=(int)(e); i--)\n#define pb push_back\n#define all(r) r.begin(),r.end()\n#define rall(r) r.rbegin(),r.rend()\n#define fi first\n#define se second\n \ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n \nconst int INF = 1e9;\nconst ll MOD = 1e9 + 7;\ndouble EPS = 1e-8;\n\n#define DEBUG_MODE\n#ifdef DEBUG_MODE\n#define dump(x) cout << #x << \" : \" << x << endl\n#define LINE cout << \"line : \" << __LINE__ << endl\n#define dumpV(v) cout << #v << \" : [\"; for(auto& t : v) cout << t << \", \"; cout<<\"]\" << endl\n#define STOP assert(false)\n#else\n#define dump(x) ;\n#define LINE ;\n#define dumpV(v);\n#define STOP ;\n#endif\n#define mp make_pair\n\nnamespace std{\n template<class S,class T>\n ostream &operator <<(ostream& out,const pair<S,T>& a){\n out<<'('<<a.fi<<\", \"<<a.se<<')';\n return out;\n }\n}\n\n\nconst int MAX_N = 1e5+10;\nconst int MAX_M = 5e5+10;\n\nint t[MAX_N];\nusing Edge = pair<int, ll>; // to, cost\nvector<Edge> es[MAX_N];\n\nusing State = pair<ll, pii>; // cost, day, population\nState StateINF = State(1e18, pii(1e9, 1e9));\n\nbool chMin(State& a, const State& b) {\n if(a <= b) return false;\n a = b;\n return true;\n}\n\nState d[MAX_N];\n\nint from[MAX_N]; // 経路復元\n\nint A[MAX_N][30];\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, m;\n cin >> n >> m;\n rep(i, n) cin >> t[i];\n rep(i, m) {\n int a, b, c;\n cin >> a >> b >> c;\n --a;\n --b;\n es[a].pb({b, (ll)c});\n es[b].pb({a, (ll)c});\n }\n from[0] = -1;\n {\n rep(i, n) d[i] = StateINF;\n int root = 0;\n using P = pair<State, int>;\n priority_queue<P, vector<P>, greater<P> > q;\n d[root] = {0LL, {0, -1}};\n q.push({d[root], root});\n while (!q.empty()) {\n auto p = q.top(); q.pop();\n int prv = p.se;\n const auto state = p.fi;\n if (d[prv] < p.fi) continue;\n for (auto& e : es[prv]) {\n int to = e.fi;\n auto nState = state;\n nState.fi += e.se;\n nState.se.fi++;\n nState.se.se = t[prv];\n\n if (chMin(d[to], nState)) {\n q.push({d[to], to});\n from[to] = prv;\n }\n }\n }\n }\n rep(i, MAX_N) rep(j, 30) A[i][j] = -1;\n rep(j, 30) rep(i, n) {\n if(j == 0) A[i][j] = from[i];\n else if(A[i][j-1] != -1) A[i][j] = A[A[i][j-1]][j-1];\n }\n // rep(i, n) {\n // cout << i << \" \" << d[i].fi << \" \" << d[i].se.fi << \" \" << d[i].se.se << \" \" << from[i] << \" \" << A[i][0] <<endl;\n // }\n // return 0;\n // LINE;\n int k;\n cin >> k;\n rep(_, k) {\n int x, D, p;\n cin >> x >> D >> p;\n --x;\n auto s = d[x];\n int day = s.se.fi;\n ll cost = s.fi;\n if(day <= D) cout << max(0LL, cost - p) << '\\n';\n else {\n int now = x;\n while(d[now].se.fi > D) {\n // dump(mp(now, d[now].se.fi));\n // dump(D);\n if(A[now][0] == -1) break;\n rep(i, 20) {\n int to = A[now][i];\n if(to == -1) {\n now = A[now][i-1];\n break;\n }\n if(d[to].se.fi < D) {\n now = A[now][i-1];\n break;\n } \n }\n }\n assert(now >= 0 && d[now].se.fi == D);\n ll dif = cost - d[now].fi;\n // cout << now << endl;\n cout << dif + max(0LL, d[now].fi - p) << '\\n';\n // LINE;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":44388,"score_of_the_acc":-0.4484,"final_rank":8},{"submission_id":"aoj_2764_3254689","code_snippet":"#include <queue>\n#include <vector>\n#include <iostream>\nusing namespace std;\nconst int bits = 20;\nstruct edge {\n\tint to, cost;\n};\nstruct state {\n\tint pos, cost, dist, pop, par;\n};\nbool operator<(const state& s1, const state& s2) {\n\tif (s1.cost != s2.cost) return s1.cost > s2.cost;\n\tif (s1.dist != s2.dist) return s1.dist > s2.dist;\n\treturn s1.pop > s2.pop;\n}\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\tint N, M;\n\tcin >> N >> M;\n\tvector<int> t(N);\n\tfor (int i = 0; i < N; ++i) cin >> t[i];\n\tvector<vector<edge> > G(N);\n\tfor (int i = 0; i < M; ++i) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c; --a, --b;\n\t\tG[a].push_back(edge{ b, c });\n\t\tG[b].push_back(edge{ a, c });\n\t}\n\tpriority_queue<state> que;\n\tque.push(state{ 0, 0, 0, t[0], -1 });\n\tvector<int> p(N, -2), pc(N), days(N), costs(N);\n\twhile (!que.empty()) {\n\t\tstate u = que.top(); que.pop();\n\t\tif (p[u.pos] == -2) {\n\t\t\tp[u.pos] = u.par;\n\t\t\tdays[u.pos] = u.dist;\n\t\t\tcosts[u.pos] = u.cost;\n\t\t\tfor (edge e : G[u.pos]) {\n\t\t\t\tif (p[e.to] == -2) {\n\t\t\t\t\tque.push(state{ e.to, u.cost + e.cost, u.dist + 1, t[u.pos], u.pos });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvector<vector<int> > xp(bits, vector<int>(N));\n\txp[0] = p; xp[0][0] = 0;\n\tfor (int i = 1; i < bits; ++i) {\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\txp[i][j] = xp[i - 1][xp[i - 1][j]];\n\t\t}\n\t}\n\tint Q;\n\tcin >> Q;\n\tfor (int i = 0; i < Q; ++i) {\n\t\tint pos, day, money;\n\t\tcin >> pos >> day >> money; --pos;\n\t\tint forward = max(days[pos] - day, 0);\n\t\tint fpos = pos;\n\t\tfor (int j = bits - 1; j >= 0; --j) {\n\t\t\tif ((forward >> j) & 1) fpos = xp[j][fpos];\n\t\t}\n\t\tint least = costs[pos] - costs[fpos];\n\t\tint ans = least + max(costs[fpos] - money, 0);\n\t\tcout << ans << '\\n';\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":280,"memory_kb":35716,"score_of_the_acc":-0.4215,"final_rank":6},{"submission_id":"aoj_2764_3002031","code_snippet":"#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <queue>\n#include <cmath>\n#include <cstdlib>\nusing namespace std;\nusing ll = long long int;\n\n#define fprintf(...) void(0)\n\nstruct Edge {\n ll to, cost;\n};\n\nusing Graph = vector< vector< Edge > >;\n\nstruct Elem {\n ll pos, cost, day;\n bool operator<(const Elem &e) const {\n if(cost != e.cost) return cost > e.cost;\n return day > e.day;\n }\n};\n\nconst int MAX_N = 100000;\nll N, M, K;\nll popu[MAX_N + 10], x[MAX_N + 10], d[MAX_N + 10], p[MAX_N + 10];\n\nconst ll INF = 1LL << 60;\npair< Graph, vector<int> > get_tree(Graph &G) {\n // cost, days\n vector< pair<ll, ll> > state(N, make_pair(INF, INF));\n\n // population, prev_town\n vector< pair<ll, ll> > pre(N, make_pair(INF, -1));\n\n priority_queue<Elem> que;\n que.push(Elem{0, 0, 0});\n state[0] = make_pair(0, 0);\n\n while(que.size()) {\n Elem cur = que.top(); que.pop();\n pair<ll, ll> cur_state = make_pair(cur.cost, cur.day);\n\n int u = cur.pos;\n if(cur_state > state[u]) continue;\n\n for(auto e : G[u]) {\n int to = e.to, n_cost = cur.cost + e.cost, n_day = cur.day + 1;\n\n pair<ll, ll> nxt = make_pair(n_cost, n_day);\n pair<ll, ll> pop_info = make_pair(popu[u], u);\n if(state[to] > nxt) {\n state[to] = nxt;\n pre[to] = pop_info;\n que.push(Elem{to, n_cost, n_day});\n }\n else if(state[to] == nxt) {\n if(pre[to] > pop_info) {\n pre[to] = pop_info;\n }\n }\n }\n }\n\n Graph ret(N);\n vector<int> par(N, -1);\n for(int i=1; i<N; i++) {\n // the parent of i is pre[i].second\n int u = i, v = pre[i].second;\n\n ll cost_u = state[u].first, cost_v = state[v].first;\n ll diff = llabs(cost_u - cost_v);\n ret[u].push_back(Edge{v, diff});\n ret[v].push_back(Edge{u, diff});\n par[u] = v;\n }\n return make_pair(ret, par);\n}\n\npair< vector<ll>, vector<ll> > get_cost_info(Graph &G) {\n vector<ll> visited(N), sum(N), days(N);\n\n queue<int> que;\n que.push(0);\n visited[0] = true;\n\n while(que.size()) {\n int cur = que.front(); que.pop();\n for(auto e : G[cur]) {\n if(visited[e.to]) continue;\n visited[e.to] = true;\n sum[e.to] = sum[cur] + e.cost;\n days[e.to] = days[cur] + 1;\n que.push(e.to);\n }\n }\n return make_pair(sum, days);\n}\n\nvoid solve(Graph &G, vector<int> &par) {\n vector< vector<int> > nxt(N, vector<int>(18, -1));\n vector<ll> acc_cost, days;\n tie(acc_cost, days) = get_cost_info(G);\n\n // 2^k table\n for(int i=0; i<N; i++) {\n fprintf(stderr, \"parent of %d is %d\\n\", i, par[i]);\n nxt[i][0] = par[i];\n }\n for(int k=1; k<18; k++) {\n for(int i=0; i<N; i++) {\n if(nxt[i][k-1] < 0) continue;\n nxt[i][k] = nxt[ nxt[i][k-1] ][k-1];\n }\n }\n\n for(int i=0; i<K; i++) {\n ll need_day = days[ x[i] ];\n ll dayA = max(0LL, days[ x[i] ] - d[i]), dayB = need_day - dayA;\n\n ll costA = acc_cost[ x[i] ];\n\n // get costB\n ll rest = dayA, cur = x[i];\n for(int k=0; k<18; k++) {\n if(rest >> k & 1) {\n cur = nxt[cur][k];\n }\n }\n\n ll costB = acc_cost[ cur ];\n\n fprintf(stderr, \"dayA = %lld, dayB = %lld, costA = %lld, costB = %lld\\n\", dayA, dayB, costA, costB);\n\n ll ans = costA - costB + max(0LL, costB - p[i]);\n printf(\"%lld\\n\", ans);\n }\n}\n\nint main() {\n scanf(\"%lld%lld\", &N, &M);\n for(int i=0; i<N; i++) {\n scanf(\"%lld\", &popu[i]);\n }\n\n Graph G(N);\n for(int i=0; i<M; i++) {\n int a, b, c; scanf(\"%d%d%d\", &a, &b, &c);\n a--; b--;\n G[a].push_back(Edge{b, c});\n G[b].push_back(Edge{a, c});\n }\n\n scanf(\"%lld\", &K);\n for(int i=0; i<K; i++) {\n scanf(\"%lld%lld%lld\", &x[i], &d[i], &p[i]);\n x[i]--;\n }\n\n Graph H; vector<int> par;\n\n fprintf(stderr, \"get tree!\\n\");\n tie(H, par) = get_tree(G);\n\n fprintf(stderr, \"solve!\\n\");\n solve(H, par);\n return 0;\n}","accuracy":1,"time_ms":270,"memory_kb":53072,"score_of_the_acc":-0.6361,"final_rank":11},{"submission_id":"aoj_2764_2884869","code_snippet":"#include <iostream>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <queue>\n#include <cmath>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define MP make_pair\n#define PB push_back\nll inf = (1LL)<<60;\n\nll dp[100001][20];\n\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n,m;\n cin >> n >> m;\n vector<ll> t(n);\n rep(i,n)cin >> t[i];\n vector<vector<pair<int,ll> > >g(n);\n rep(i,m){\n int a,b;\n ll c;\n cin >> a >> b >> c;\n a--;\n b--;\n g[a].PB(MP(b,c));\n g[b].PB(MP(a,c));\n }\n priority_queue<pair<ll,pair<ll,int> >,vector<pair<ll,pair<ll,int> > >,greater<pair<ll,pair<ll,int> > > >pq;\n pq.push(MP((ll)0,MP((ll)0,0)));\n vector<int> parent(n);\n parent[0]=-1;\n vector<pair<ll,ll> > place(n,MP(inf,inf));\n place[0] = MP(0,0);\n while(!pq.empty()){\n auto xxxxxxxx = pq.top();\n pq.pop();\n auto x = xxxxxxxx.first;\n auto y = xxxxxxxx.second.first;\n auto p = xxxxxxxx.second.second;\n if(make_pair(x,y) > place[p]) continue;\n for(auto& e : g[p]){\n if(MP(x+e.second,y+1)>place[e.first])continue;\n if(MP(x+e.second,y+1)==place[e.first]){\n if(t[parent[e.first]]>t[p]){\n parent[e.first] = p;\n pq.push(MP(x+e.second,MP(y+1,e.first)));\n }\n }else{\n place[e.first] = MP(x+e.second,y+1);\n parent[e.first] = p;\n pq.push(MP(x+e.second,MP(y+1,e.first)));\n }\n }\n }\n rep(i,n){\n rep(j,20){\n dp[i][j] = -1;\n }\n }\n rep(i,n){\n dp[i][0] = parent[i];\n }\n rep(j,19){\n rep(i,n){\n if(dp[i][j]>=0){\n dp[i][j+1] = dp[dp[i][j]][j];\n }\n }\n }\n int k;\n cin >> k;\n rep(i,k){\n int a,b;\n ll c;\n cin >> a >> b >> c;\n a--;\n ll ans = 0;\n ans = place[a].first;\n if(place[a].second<=b){\n cout << max(0LL,ans-c) << endl;\n }else{\n int now = a;\n int d = place[a].second-b;\n for(int i = 20; i>=0; i--){\n if(d < (1 << i)) continue;\n now = dp[now][i];\n d -= (1<<i);\n }\n cout << ans - min(place[now].first,c) << endl;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":50812,"score_of_the_acc":-0.6952,"final_rank":12},{"submission_id":"aoj_2764_2736310","code_snippet":"/*\n * g.cc: \n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n\nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_D = 20;\n\ntypedef long long ll;\n\nconst int INF = 1 << 30;\nconst ll LINF = 1LL << 60;\n\n/* typedef */\n\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\n\nstruct Stat {\n ll c;\n int d, i;\n Stat() {}\n Stat(ll _c, int _d, int _i): c(_c), d(_d), i(_i) {}\n bool operator<(const Stat &s) const {\n return c > s.c || (c == s.c && d > s.d);\n }\n};\n\n/* global variables */\n\nint ts[MAX_N];\nvpii nbrs[MAX_N];\nll costs[MAX_N];\nint dists[MAX_N], prts[MAX_N][MAX_D];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n int tmp = scanf(\"%d%d\", &n, &m);\n\n for (int i = 0; i < n; i++) tmp = scanf(\"%d\", &ts[i]);\n\n for (int i = 0; i < m; i++) {\n int ai, bi, ci;\n tmp = scanf(\"%d%d%d\", &ai, &bi, &ci);\n ai--, bi--;\n nbrs[ai].push_back(pii(bi, ci));\n nbrs[bi].push_back(pii(ai, ci));\n }\n\n for (int i = 0; i < n; i++) costs[i] = LINF;\n costs[0] = 0;\n dists[0] = 0;\n prts[0][0] = -1;\n\n priority_queue<Stat> q;\n q.push(Stat(0, 0, 0));\n\n while (! q.empty()) {\n Stat u = q.top(); q.pop();\n if (costs[u.i] != u.c || dists[u.i] != u.d) continue;\n\n int vd = u.d + 1;\n vpii &nbru = nbrs[u.i];\n\n for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\n int &vi = vit->first;\n ll vc = u.c + vit->second;\n\n if (costs[vi] > vc) {\n\tcosts[vi] = vc;\n\tdists[vi] = vd;\n\tprts[vi][0] = u.i;\n\tq.push(Stat(vc, vd, vi));\n }\n else if (costs[vi] == vc) {\n\tif (dists[vi] > vd) {\n\t dists[vi] = vd;\n\t prts[vi][0] = u.i;\n\t q.push(Stat(vc, vd, vi));\n\t}\n\telse if (dists[vi] == vd && ts[prts[vi][0]] > ts[u.i]) {\n\t prts[vi][0] = u.i;\n\t}\n }\n }\n }\n\n for (int d = 1; d < MAX_D; d++)\n for (int i = 0; i < n; i++) {\n int j = prts[i][d - 1];\n prts[i][d] = (j < 0) ? -1 : prts[j][d - 1];\n }\n\n int k;\n tmp = scanf(\"%d\", &k);\n\n while (k--) {\n int xi, di, pi;\n tmp = scanf(\"%d%d%d\", &xi, &di, &pi);\n xi--;\n\n int r = dists[xi] - di;\n int yi = xi;\n //printf(\"xi=%d,di=%d,pi=%d: costs=%lld,dists=%d,r=%d\\n\",\n //xi, di, pi, costs[xi], dists[xi], r);\n\n if (r > 0)\n for (int d = MAX_D - 1; d >= 0; d--)\n\tif (r & (1 << d)) yi = prts[yi][d];\n //printf(\" yi=%d\\n\", yi);\n \n ll cost = costs[xi] - costs[yi];\n if (cost < costs[xi] - pi) cost = costs[xi] - pi;\n\n printf(\"%lld\\n\", cost);\n }\n}","accuracy":1,"time_ms":210,"memory_kb":30240,"score_of_the_acc":-0.2232,"final_rank":2},{"submission_id":"aoj_2764_2058074","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nvector<int>pops;\nstruct edge {\n\tint from;\n\tint to;\n\tlong long int cost;\n};\nstruct aa {\n\tedge frome;\n\tlong long int cost;\n\t int time;\n};\nclass Compare {\npublic:\n\tbool operator()(const aa l, const aa r) {\n\t\treturn l.cost == r.cost ?l.time==r.time?pops[l.frome.from] > pops[r.frome.from]: l.time > r.time:l.cost > r.cost;\n\t}\n}comp;\t\n\n\nclass Tree {\npublic:\n\tTree(int V, int root) : V(V),revT(V), root(root), cnum(V), place(V), id(V) {\n\t\tT.resize(V);\n\t\tfor (int i = 0; i < MAXLOGV; i++) {\n\t\t\tparent[i].resize(V);\n\t\t\tcosts[i].resize(V);\n\n\t\t}\n\t\tdepth.resize(V);\n\t}\n\t// u??¨v????????????\n\t// lca????±????????????¨????????????????????§????????°????????¨????????????\n\tvoid unite(edge& v) {\n\t\tT[v.from].push_back(v);\n\t\trevT[v.to]=(edge{ v.to,v.from,v.cost });\n\t}\n\t// init??????\n\t// ????????????????????????????????????????????????????????°????????¨lca????±???????????????????\n\tvoid init() {\n\t\tdfs(root, 0, 0);\n\t\tint id = 0;\n\t\tgetid(root, 0, id);\n\t}\n\t// u??¨v???lca????±???????\n\tint lca(int u, int v) const {\n\t\tif (depth[u] > depth[v]) swap(u, v);\n\t\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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\t// u??¨v????????¢????±???????\n\t// edge????????????????????¨????????????????????????????????????\n\tint dist(int u, int v) const {\n\t\tint p = lca(u, v);\n\t\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\n\t}\n\tint dfs(int v, int p, int d) {\n\t\tparent[0][v] = p;\n\t\tcosts[0][v] = revT[v].cost;\n\t\tdepth[v] = d;\n\t\tcnum[v] = 0;\n\t\tfor (int i = 1; i < MAXLOGV; i++) {\n\t\t\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\n\t\t\tcosts[i][v] = costs[i - 1][parent[i - 1][v]] + costs[i - 1][v];\n\t\t}\n\t\tfor (auto e : T[v]) {\n\t\t\tint next = e.to;\n\t\t\tif (next != p) cnum[v] += dfs(next, v, d + 1);\n\t\t}\n\t\treturn cnum[v] + 1;\n\t}\n\n\tvoid getid(const int v, const int p, int &nplace) {\n\t\tplace[v] = nplace;\n\t\tid[nplace] = v;\n\t\tnplace++;\n\t\tfor (auto e : T[v]) {\n\t\t\tint next = e.to;\n\t\t\tif (next != p) getid(next, v, nplace);\n\t\t}\n\t}\n\tstatic const int MAXLOGV = 20;\n\t// ??°???????????£??\\???????????¨???\n\tvector<vector<edge> > T;\n\tvector<edge>revT;\n\t// ???????????°\n\tint V;\n\t// ?????????????????????\n\tint root;\n\n\t// ????????????\n\tvector<int> parent[MAXLOGV];\n\tvector<long long int>costs[MAXLOGV];\n\t// ??????????????±???\n\tvector<int> depth;\n\n\t//????????°\n\tvector<int>cnum;\n\n\t//??????\n\tvector<int>place;\n\tvector<int>id;\n\n};\n\nint main() {\n\tint N, M; cin >> N >> M;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint a; cin >> a;\n\t\tpops.push_back(a);\n\t}\n\tvector<vector<edge>>edges(N);\n\tfor (int i = 0; i < M; ++i) {\n\t\tint a, b, c; cin >> a >> b >> c; a--; b--;\n\t\tedges[a].push_back(edge{ a,b,c });\n\t\tedges[b].push_back(edge{ b,a,c });\n\t}\n\t\n\tvector<aa>memo(N, aa{ edge{-1,-1,-1},static_cast<long long int>(1e18),(static_cast<int>(1e9)) });\n\tmemo[0] = aa{ edge{-1,0,0},0,0 };\n\tpriority_queue<aa, vector<aa>, Compare>que;\n\tque.push(aa{ edge{-1,0,0},0,0 });\n\twhile (!que.empty()) {\n\t\taa atop(que.top());\n\t\tque.pop();\n\t\tfor (auto e : edges[atop.frome.to]) {\n\t\t\tconst int next = e.to;\n\t\t\tconst long long int nextcost = atop.cost + e.cost;\n\t\t\tconst int nexttime = atop.time + 1;\n\t\t\tif (comp.operator()(memo[next],aa{ e,nextcost,nexttime })) {\n\t\t\t\tmemo[next] = aa{ e,nextcost,nexttime };\n\t\t\t\tque.push(aa{ e,nextcost,nexttime });\n\t\t\t}\n\t\t}\n\t}\n\tTree t(N,0);\n\tfor (int i = 1; i < N; ++i) {\n\t\tt.unite(memo[i].frome);\n\t}\n\tt.init();\n\tint K; cin >> K;\n\tfor (int i = 0; i < K; ++i) {\n\t\tlong long int sum = 0;\n\t\tint x, d, p; cin >> x >> d >> p;\n\t\tx--;\n\t\tif (d >= t.depth[x]) {\n\t\t\tint rest = t.depth[x];\n\t\t\tlong long int need = 0;\n\t\t\tint now = x;\n\t\t\tfor (int i = 0; i < 20; ++i) {\n\t\t\t\tif (rest&(1 << i)) {\n\t\t\t\t\tneed += t.costs[i][now];\n\t\t\t\t\tnow = t.parent[i][now];\n\t\t\t\t}\n\t\t\t}\n\t\t\tsum += max(0ll, need -p);\n\t\t}\n\t\telse {\n\t\t\tint rest = t.depth[x] - d;\n\t\t\tlong long int need = 0;\n\t\t\tint now = x;\n\t\t\tfor (int i = 0; i < 20; ++i) {\n\t\t\t\tif (rest&(1 << i)) {\n\t\t\t\t\tneed += t.costs[i][now];\n\t\t\t\t\tnow = t.parent[i][now];\n\t\t\t\t}\n\t\t\t}\n\t\t\tsum += need;\n\t\t\trest = d;\n\t\t\tneed = 0;\n\t\t\tfor (int i = 0; i < 20; ++i) {\n\t\t\t\tif (rest&(1 << i)) {\n\t\t\t\t\tneed += t.costs[i][now];\n\t\t\t\t\tnow = t.parent[i][now];\n\t\t\t\t}\n\t\t\t}\n\t\t\tsum += max(0ll, need - p);\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":660,"memory_kb":66080,"score_of_the_acc":-1.5068,"final_rank":15},{"submission_id":"aoj_2764_1661416","code_snippet":"/*\n * g.cc: \n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n\nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_D = 20;\n\ntypedef long long ll;\n\nconst int INF = 1 << 30;\nconst ll LINF = 1LL << 60;\n\n/* typedef */\n\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\n\nstruct Stat {\n ll c;\n int d, i;\n Stat() {}\n Stat(ll _c, int _d, int _i): c(_c), d(_d), i(_i) {}\n bool operator<(const Stat &s) const {\n return c > s.c || (c == s.c && d > s.d);\n }\n};\n\n/* global variables */\n\nint ts[MAX_N];\nvpii nbrs[MAX_N];\nll costs[MAX_N];\nint dists[MAX_N], prts[MAX_N][MAX_D];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n int tmp = scanf(\"%d%d\", &n, &m);\n\n for (int i = 0; i < n; i++) tmp = scanf(\"%d\", &ts[i]);\n\n for (int i = 0; i < m; i++) {\n int ai, bi, ci;\n tmp = scanf(\"%d%d%d\", &ai, &bi, &ci);\n ai--, bi--;\n nbrs[ai].push_back(pii(bi, ci));\n nbrs[bi].push_back(pii(ai, ci));\n }\n\n for (int i = 0; i < n; i++) costs[i] = LINF;\n costs[0] = 0;\n dists[0] = 0;\n prts[0][0] = -1;\n\n priority_queue<Stat> q;\n q.push(Stat(0, 0, 0));\n\n while (! q.empty()) {\n Stat u = q.top(); q.pop();\n if (costs[u.i] != u.c || dists[u.i] != u.d) continue;\n\n int vd = u.d + 1;\n vpii &nbru = nbrs[u.i];\n\n for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\n int &vi = vit->first;\n ll vc = u.c + vit->second;\n\n if (costs[vi] > vc) {\n\tcosts[vi] = vc;\n\tdists[vi] = vd;\n\tprts[vi][0] = u.i;\n\tq.push(Stat(vc, vd, vi));\n }\n else if (costs[vi] == vc) {\n\tif (dists[vi] > vd) {\n\t dists[vi] = vd;\n\t prts[vi][0] = u.i;\n\t q.push(Stat(vc, vd, vi));\n\t}\n\telse if (dists[vi] == vd && ts[prts[vi][0]] > ts[u.i]) {\n\t prts[vi][0] = u.i;\n\t}\n }\n }\n }\n\n for (int d = 1; d < MAX_D; d++)\n for (int i = 0; i < n; i++) {\n int j = prts[i][d - 1];\n prts[i][d] = (j < 0) ? -1 : prts[j][d - 1];\n }\n\n int k;\n tmp = scanf(\"%d\", &k);\n\n while (k--) {\n int xi, di, pi;\n tmp = scanf(\"%d%d%d\", &xi, &di, &pi);\n xi--;\n\n int r = dists[xi] - di;\n int yi = xi;\n //printf(\"xi=%d,di=%d,pi=%d: costs=%lld,dists=%d,r=%d\\n\",\n //xi, di, pi, costs[xi], dists[xi], r);\n\n if (r > 0)\n for (int d = MAX_D - 1; d >= 0; d--)\n\tif (r & (1 << d)) yi = prts[yi][d];\n //printf(\" yi=%d\\n\", yi);\n \n ll cost = costs[xi] - costs[yi];\n if (cost < costs[xi] - pi) cost = costs[xi] - pi;\n\n printf(\"%lld\\n\", cost);\n }\n\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":28244,"score_of_the_acc":-0.3214,"final_rank":5},{"submission_id":"aoj_2764_1522948","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <complex>\n#include <cassert>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<P,int> T;\ntypedef pair<T,int> F;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\n#define pu push\n#define pb push_back\n#define mp make_pair\n#define eps 1e-9\n#define INF 2000000000\n#define sz(x) ((int)(x).size())\n#define fi first\n#define sec second\n#define SORT(x) sort((x).begin(),(x).end())\n#define all(x) (x).begin(),(x).end()\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)\n#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)\n#define EQ(a,b) (abs((a)-(b))<eps)\nstruct edge\n{\n\tint to,cost;\n\tedge(int to,int cost):to(to),cost(cost){}\n};\nint N,M,K;\nint t[100100];\nint day[100100],dist[100100];\nint x[100100],d[100100],p[100100];\nint par[100100][20];\nvector<edge> G[100100];\nbool used[100100];\npriority_queue<F,vector<F>,greater<F> > q;\nint ascend(int v,int k)\n{\n\tfor(int i=19;i>=0;i--)\n\t{\n\t\tif(k&(1<<i))v=par[v][i];\n\t}\n\treturn v;\n}\nint main()\n{\n\tscanf(\"%d %d\",&N,&M);\n\tfor(int i=0;i<N;i++)scanf(\"%d\",&t[i]);\n\tfor(int i=0;i<M;i++)\n\t{\n\t\tint a,b,c;\n\t\tscanf(\"%d %d %d\",&a,&b,&c);\n\t\ta--;b--;\n\t\tG[a].pb(edge(b,c));\n\t\tG[b].pb(edge(a,c));\n\t}\n\tscanf(\"%d\",&K);\n\tfor(int i=0;i<K;i++)\n\t{\n\t\tscanf(\"%d %d %d\",&x[i],&d[i],&p[i]);\n\t\tx[i]--;\n\t}\n\tmemset(used,false,sizeof(used));\n\tfor(int i=0;i<N;i++)day[i]=INF,dist[i]=INF;\n\tday[0]=0;dist[0]=0;\n\tq.push(F(T(P(0,0),t[0]),0));\n\tpar[0][0]=-1;\n\twhile(!q.empty())\n\t{\n\t\tF a = q.top();\n\t\tq.pop();\n\t\tint v = a.sec;\n\t\tint date = a.fi.fi.sec;\n\t\tint dis = a.fi.fi.fi;\n\t\tfor(int i=0;i<G[v].size();i++)\n\t\t{\n\t\t\tedge e = G[v][i];\n\t\t\tif(dist[e.to]>dis+e.cost){\n\t\t\t\tday[e.to]=date+1;\n\t\t\t\tdist[e.to]=dis+e.cost;\n\t\t\t\tpar[e.to][0]=v;\n\t\t\t\tq.push(F(T(P(dist[e.to],day[e.to]),t[e.to]),e.to));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(dist[e.to]==dis+e.cost&&day[e.to]>date+1){\n\t\t\t\tday[e.to]=date+1;\n\t\t\t\tdist[e.to]=dis+e.cost;\n\t\t\t\tpar[e.to][0]=v;\n\t\t\t\tq.push(F(T(P(dist[e.to],day[e.to]),t[e.to]),e.to));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(dist[e.to]==dis+e.cost&&day[e.to]==date+1&&t[par[e.to][0]]>t[v]){\n\t\t\t\tday[e.to]=date+1;\n\t\t\t\tdist[e.to]=dis+e.cost;\n\t\t\t\tpar[e.to][0]=v;\n\t\t\t\tq.push(F(T(P(dist[e.to],day[e.to]),t[e.to]),e.to));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t}\n\t/*for(int i=0;i<N;i++)\n\t{\n\t\tprintf(\"%d %d %d\\n\",day[i],dist[i],par[i][0]);\n\t}*/\n\tfor(int i=0;i<19;i++)\n\t{\n\t\tfor(int v=0;v<N;v++)\n\t\t{\n\t\t\tif(par[v][i]==-1)par[v][i+1]=-1;\n\t\t\telse par[v][i+1]=par[par[v][i]][i];\n\t\t}\n\t}\n\tfor(int i=0;i<K;i++)\n\t{\n\t\tif(day[x[i]]<=d[i])printf(\"%d\\n\",max(0,dist[x[i]]-p[i]));\n\t\telse\n\t\t{\n\t\t\tint k = day[x[i]]-d[i];\n\t\t\tassert(k<=day[x[i]]);\n\t\t\tint y = ascend(x[i],k);\n\t\t\t//printf(\"y %d\\n\",y);\n\t\t\tif(dist[y]<=p[i])printf(\"%d\\n\",dist[x[i]]-dist[y]);\n\t\t\telse printf(\"%d\\n\",dist[x[i]]-p[i]);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":270,"memory_kb":29144,"score_of_the_acc":-0.3156,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2764_10593094\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <algorithm>\\n#include <climits>\\n\\nusing namespace std;\\n\\nconst int MAX_N = 100000;\\nconst int MAX_D = 20;\\ntypedef long long ll;\\nconst ll INF = 1LL << 60;\\n\\nstruct Edge {\\n int to;\\n int cost;\\n Edge(int t, int c) : to(t), cost(c) {}\\n};\\n\\nstruct State {\\n ll total_cost;\\n int depth;\\n int node;\\n State(ll c, int d, int n) : total_cost(c), depth(d), node(n) {}\\n \\n bool operator<(const State& other) const {\\n if (total_cost != other.total_cost) {\\n return total_cost > other.total_cost;\\n }\\n return depth > other.depth;\\n }\\n};\\n\\nvector<int> tree_types;\\nvector<vector<Edge>> graph;\\nvector<ll> min_costs;\\nvector<int> depths;\\nvector<vector<int>> ancestors;\\n\\nvoid dijkstra(int start, int n) {\\n min_costs.assign(n, INF);\\n depths.assign(n, 0);\\n ancestors.assign(n, vector<int>(MAX_D, -1));\\n \\n min_costs[start] = 0;\\n priority_queue<State> pq;\\n pq.push(State(0, 0, start));\\n \\n while (!pq.empty()) {\\n State current = pq.top();\\n pq.pop();\\n \\n if (current.total_cost != min_costs[current.node] || \\n current.depth != depths[current.node]) {\\n continue;\\n }\\n \\n for (const Edge& edge : graph[current.node]) {\\n int neighbor = edge.to;\\n ll new_cost = current.total_cost + edge.cost;\\n int new_depth = current.depth + 1;\\n \\n if (new_cost < min_costs[neighbor]) {\\n min_costs[neighbor] = new_cost;\\n depths[neighbor] = new_depth;\\n ancestors[neighbor][0] = current.node;\\n pq.push(State(new_cost, new_depth, neighbor));\\n }\\n else if (new_cost == min_costs[neighbor]) {\\n if (new_depth < depths[neighbor]) {\\n depths[neighbor] = new_depth;\\n ancestors[neighbor][0] = current.node;\\n pq.push(State(new_cost, new_depth, neighbor));\\n }\\n else if (new_depth == depths[neighbor] && \\n tree_types[ancestors[neighbor][0]] > tree_types[current.node]) {\\n ancestors[neighbor][0] = current.node;\\n }\\n }\\n }\\n }\\n \\n // Build binary lifting table\\n for (int d = 1; d < MAX_D; ++d) {\\n for (int i = 0; i < n; ++i) {\\n if (ancestors[i][d-1] != -1) {\\n ancestors[i][d] = ancestors[ancestors[i][d-1]][d-1];\\n }\\n }\\n }\\n}\\n\\nint find_ancestor(int node, int steps) {\\n for (int d = MAX_D - 1; d >= 0; --d) {\\n if (steps >= (1 << d)) {\\n node = ancestors[node][d];\\n steps -= (1 << d);\\n if (node == -1) break;\\n }\\n }\\n return node;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n \\n int n, m;\\n cin >> n >> m;\\n \\n tree_types.resize(n);\\n for (int i = 0; i < n; ++i) {\\n cin >> tree_types[i];\\n }\\n \\n graph.resize(n);\\n for (int i = 0; i < m; ++i) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n a--; b--;\\n graph[a].emplace_back(b, c);\\n graph[b].emplace_back(a, c);\\n }\\n \\n dijkstra(0, n);\\n \\n int k;\\n cin >> k;\\n while (k--) {\\n int x, d, p;\\n cin >> x >> d >> p;\\n x--;\\n \\n int r = depths[x] - d;\\n int y = x;\\n \\n if (r > 0) {\\n y = find_ancestor(x, r);\\n }\\n \\n ll cost = min_costs[x] - min_costs[y];\\n if (p < min_costs[y]) {\\n cost = min_costs[x] - p;\\n }\\n \\n cout << cost << '\\\\n';\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 33948,\n \"score_of_the_acc\": -0.1835,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2764_10230010\",\n \"code_snippet\": \"// AOJ #2764 Travel Support\\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\\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\\tpc('\\\\n');\\n}\\n\\nstruct State { ll cost; int days, city, parent; };\\n \\nint N;\\nvector<int> popArr;\\n \\nstruct StateCompare {\\n bool operator()(const State &a, const State &b) const {\\n if(a.cost != b.cost) return a.cost > b.cost;\\n if(a.days != b.days) return a.days > b.days;\\n int pa = (a.parent == -1 ? -1 : popArr[a.parent-1]);\\n int pb = (b.parent == -1 ? -1 : popArr[b.parent-1]);\\n return pa > pb;\\n }\\n};\\n \\nstruct Edge { int to, cost; };\\n \\nint main() {\\n N = Cin();\\n int M = Cin();\\n popArr.resize(N);\\n for (int i=0; i<N; i++) popArr[i] = Cin();\\n \\n vector<vector<Edge>> graph(N+1);\\n for (int i=0; i<M; i++){\\n int a = Cin(), b = Cin(), c = Cin();\\n graph[a].push_back({b,c});\\n graph[b].push_back({a,c});\\n }\\n \\n const ll INF = 1LL << 60;\\n vector<ll> bestCost(N+1, INF);\\n vector<int> bestDays(N+1, INT_MAX);\\n vector<int> bestParent(N+1, -1);\\n bestCost[1] = 0;\\n bestDays[1] = 0;\\n bestParent[1] = -1;\\n \\n priority_queue<State, vector<State>, StateCompare> pq;\\n pq.push({0,0,1,-1});\\n \\n while(!pq.empty()){\\n State st = pq.top(); pq.pop();\\n int cur = st.city;\\n if(st.cost != bestCost[cur] || st.days != bestDays[cur]) continue;\\n \\n for(auto &e : graph[cur]){\\n int nxt = e.to;\\n ll nc = st.cost + e.cost;\\n int nd = st.days + 1;\\n int candidateParent = cur;\\n bool update = false;\\n if(nc < bestCost[nxt]) update = true;\\n else if(nc == bestCost[nxt]){\\n if(nd < bestDays[nxt]) update = true;\\n else if(nd == bestDays[nxt]){\\n int candPop = popArr[candidateParent-1];\\n int currPop = (bestParent[nxt] == -1 ? INT_MAX : popArr[bestParent[nxt]-1]);\\n if(candPop < currPop)\\n update = true;\\n }\\n }\\n if(update){\\n bestCost[nxt] = nc;\\n bestDays[nxt] = nd;\\n bestParent[nxt] = candidateParent;\\n pq.push({nc, nd, nxt, candidateParent});\\n }\\n }\\n }\\n \\n vector<int> depth(N+1, 0);\\n for (int i=1; i<=N; i++) depth[i] = bestDays[i];\\n vector<int> edgeCost(N+1, 0);\\n for (int i=2; i<=N; i++){\\n if(bestParent[i] != -1) edgeCost[i] = (int)(bestCost[i] - bestCost[bestParent[i]]);\\n }\\n \\n int maxP = 0;\\n while((1 << maxP) <= N) maxP++;\\n vector<vector<int>> up(maxP, vector<int>(N+1, -1));\\n vector<vector<ll>> sumCost(maxP, vector<ll>(N+1, 0));\\n for (int i=1; i<=N; i++){\\n up[0][i] = (bestParent[i] == -1 ? 0 : bestParent[i]);\\n sumCost[0][i] = (i==1 ? 0 : edgeCost[i]);\\n }\\n for (int p=1; p<maxP; p++){\\n for (int i=1; i<=N; i++){\\n int mid = up[p-1][i];\\n up[p][i] = (mid==0 ? 0 : up[p-1][mid]);\\n sumCost[p][i] = sumCost[p-1][i] + (mid==0 ? 0 : sumCost[p-1][mid]);\\n }\\n }\\n auto getSum = [&](int x, int k) -> ll {\\n ll s = 0;\\n int cur = x;\\n for (int p = 0; p < maxP; p++){\\n if(k & (1 << p)){\\n s += sumCost[p][cur];\\n cur = up[p][cur];\\n if(cur==0) break;\\n }\\n }\\n return s;\\n };\\n \\n int Q = Cin();\\n for (int i=0; i<Q; i++){\\n int x = Cin(), d = Cin(), pSub = Cin();\\n if(x==1){\\n Cout(0);\\n continue;\\n }\\n int L = depth[x];\\n int preCount = (L > d ? L - d : 0);\\n ll cost_pre = getSum(x, preCount);\\n ll total = getSum(x, L);\\n ll cost_post = total - cost_pre;\\n ll extra = 0;\\n if((ll)pSub < cost_post) extra = cost_post - pSub;\\n ll ans = cost_pre + extra;\\n Cout(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 45852,\n \"score_of_the_acc\": -0.2359,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2764_10229988\",\n \"code_snippet\": \"// AOJ #2764 Travel Support\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nstruct State { ll cost; int days, city, parent; };\\n \\nint N;\\nvector<int> popArr;\\n \\nstruct StateCompare {\\n bool operator()(const State &a, const State &b) const {\\n if(a.cost != b.cost) return a.cost > b.cost;\\n if(a.days != b.days) return a.days > b.days;\\n int pa = (a.parent == -1 ? -1 : popArr[a.parent-1]);\\n int pb = (b.parent == -1 ? -1 : popArr[b.parent-1]);\\n return pa > pb;\\n }\\n};\\n \\nstruct Edge { int to, cost; };\\n \\nint main() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n \\n int M;\\n cin >> N >> M;\\n popArr.resize(N);\\n for (int i=0; i<N; i++) cin >> popArr[i];\\n \\n vector<vector<Edge>> graph(N+1);\\n for (int i=0; i<M; i++){\\n int a, b, c;\\n cin >> a >> b >> c;\\n graph[a].push_back({b,c});\\n graph[b].push_back({a,c});\\n }\\n \\n const ll INF = 1LL << 60;\\n vector<ll> bestCost(N+1, INF);\\n vector<int> bestDays(N+1, INT_MAX);\\n vector<int> bestParent(N+1, -1);\\n bestCost[1] = 0;\\n bestDays[1] = 0;\\n bestParent[1] = -1;\\n \\n priority_queue<State, vector<State>, StateCompare> pq;\\n pq.push({0,0,1,-1});\\n \\n while(!pq.empty()){\\n State st = pq.top(); pq.pop();\\n int cur = st.city;\\n if(st.cost != bestCost[cur] || st.days != bestDays[cur]) continue;\\n \\n for(auto &e : graph[cur]){\\n int nxt = e.to;\\n ll nc = st.cost + e.cost;\\n int nd = st.days + 1;\\n int candidateParent = cur;\\n bool update = false;\\n if(nc < bestCost[nxt]) update = true;\\n else if(nc == bestCost[nxt]){\\n if(nd < bestDays[nxt]) update = true;\\n else if(nd == bestDays[nxt]){\\n int candPop = popArr[candidateParent-1];\\n int currPop = (bestParent[nxt] == -1 ? INT_MAX : popArr[bestParent[nxt]-1]);\\n if(candPop < currPop)\\n update = true;\\n }\\n }\\n if(update){\\n bestCost[nxt] = nc;\\n bestDays[nxt] = nd;\\n bestParent[nxt] = candidateParent;\\n pq.push({nc, nd, nxt, candidateParent});\\n }\\n }\\n }\\n \\n vector<int> depth(N+1, 0);\\n for (int i=1; i<=N; i++) depth[i] = bestDays[i];\\n vector<int> edgeCost(N+1, 0);\\n for (int i=2; i<=N; i++){\\n if(bestParent[i] != -1) edgeCost[i] = (int)(bestCost[i] - bestCost[bestParent[i]]);\\n }\\n \\n int maxP = 0;\\n while((1 << maxP) <= N) maxP++;\\n vector<vector<int>> up(maxP, vector<int>(N+1, -1));\\n vector<vector<ll>> sumCost(maxP, vector<ll>(N+1, 0));\\n for (int i=1; i<=N; i++){\\n up[0][i] = (bestParent[i] == -1 ? 0 : bestParent[i]);\\n sumCost[0][i] = (i==1 ? 0 : edgeCost[i]);\\n }\\n for (int p=1; p<maxP; p++){\\n for (int i=1; i<=N; i++){\\n int mid = up[p-1][i];\\n up[p][i] = (mid==0 ? 0 : up[p-1][mid]);\\n sumCost[p][i] = sumCost[p-1][i] + (mid==0 ? 0 : sumCost[p-1][mid]);\\n }\\n }\\n auto getSum = [&](int x, int k) -> ll {\\n ll s = 0;\\n int cur = x;\\n for (int p = 0; p < maxP; p++){\\n if(k & (1 << p)){\\n s += sumCost[p][cur];\\n cur = up[p][cur];\\n if(cur==0) break;\\n }\\n }\\n return s;\\n };\\n \\n int Q;\\n cin >> Q;\\n for (int i=0; i<Q; i++){\\n int x, d, pSub;\\n cin >> x >> d >> pSub;\\n if(x==1){\\n cout << 0 << endl;\\n continue;\\n }\\n int L = depth[x];\\n int preCount = (L > d ? L - d : 0);\\n ll cost_pre = getSum(x, preCount);\\n ll total = getSum(x, L);\\n ll cost_post = total - cost_pre;\\n ll extra = 0;\\n if((ll)pSub < cost_post) extra = cost_post - pSub;\\n ll ans = cost_pre + extra;\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 45432,\n \"score_of_the_acc\": -0.4802,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2764_8319101\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\n#pragma warning (disable: 4996)\\n\\n// Main Variables\\nlong long N, T[1 << 19];\\nlong long M, A[1 << 19], B[1 << 19], C[1 << 19];\\nlong long K, X[1 << 19], D[1 << 19], P[1 << 19];\\nvector<pair<long long, long long>> G[1 << 19];\\nvector<int> H[1 << 19];\\npair<long long, long long> Dist[1 << 19];\\npriority_queue<tuple<long long, long long, long long>, vector<tuple<long long, long long, long long>>, greater<tuple<long long, long long, long long>>> Q;\\n\\n// LCA Variables\\nlong long Par[1 << 19][22];\\nlong long Depth[1 << 19];\\nbool Used[1 << 19];\\n\\nvoid dfs(int pos, int dep) {\\n\\tDepth[pos] = dep;\\n\\tfor (int to : H[pos]) dfs(to, dep + 1);\\n}\\n\\nint prevs(int pos, int x) {\\n\\tfor (int i = 20; i >= 0; i--) {\\n\\t\\tif (x >= (1 << i)) { x -= (1 << i); pos = Par[pos][i]; }\\n\\t}\\n\\treturn pos;\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tscanf(\\\"%lld%lld\\\", &N, &M);\\n\\tfor (int i = 1; i <= N; i++) scanf(\\\"%lld\\\", &T[i]);\\n\\tfor (int i = 1; i <= M; i++) scanf(\\\"%lld%lld%lld\\\", &A[i], &B[i], &C[i]);\\n\\tscanf(\\\"%lld\\\", &K);\\n\\tfor (int i = 1; i <= K; i++) scanf(\\\"%lld%lld%lld\\\", &X[i], &D[i], &P[i]);\\n\\n\\t// Step 2. Make Graph\\n\\tfor (int i = 1; i <= M; i++) {\\n\\t\\tG[A[i]].push_back(make_pair(B[i], C[i]));\\n\\t\\tG[B[i]].push_back(make_pair(A[i], C[i]));\\n\\t}\\n\\tfor (int i = 1; i <= N; i++) Dist[i] = make_pair((1LL << 60), -1);\\n\\tQ.push(make_tuple(0, 0, 1));\\n\\tDist[1] = make_pair(0, 0);\\n\\n\\t// Step 3A. Dijkstra\\n\\twhile (!Q.empty()) {\\n\\t\\tlong long pos = get<2>(Q.top());\\n\\t\\tlong long cost1 = get<0>(Q.top());\\n\\t\\tlong long cost2 = get<1>(Q.top()); Q.pop();\\n\\t\\tif (Used[pos] == true) continue;\\n\\t\\tUsed[pos] = true;\\n\\t\\tfor (int i = 0; i < G[pos].size(); i++) {\\n\\t\\t\\tlong long to = G[pos][i].first;\\n\\t\\t\\tlong long nex_cost1 = cost1 + G[pos][i].second;\\n\\t\\t\\tlong long nex_cost2 = cost2 + 1;\\n\\t\\t\\tif (Dist[to] > make_pair(nex_cost1, nex_cost2)) {\\n\\t\\t\\t\\tDist[to] = make_pair(nex_cost1, nex_cost2);\\n\\t\\t\\t\\tQ.push(make_tuple(nex_cost1, nex_cost2, to));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 3B. Get Prev\\n\\tfor (int i = 2; i <= N; i++) {\\n\\t\\tpair<long long, long long> minid = make_pair((1LL << 60), (1LL << 60));\\n\\t\\tfor (int j = 0; j < G[i].size(); j++) {\\n\\t\\t\\tlong long to = G[i][j].first;\\n\\t\\t\\tlong long bef_cost1 = Dist[i].first - G[i][j].second;\\n\\t\\t\\tlong long bef_cost2 = Dist[i].second - 1;\\n\\t\\t\\tif (Dist[to] == make_pair(bef_cost1, bef_cost2)) {\\n\\t\\t\\t\\tminid = min(minid, make_pair(T[to], to));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tPar[i][0] = minid.second;\\n\\t}\\n\\n\\t// Step 4. LCA Init\\n\\tfor (int d = 1; d <= 20; d++) {\\n\\t\\tfor (int i = 1; i <= N; i++) Par[i][d] = Par[Par[i][d - 1]][d - 1];\\n\\t}\\n\\tfor (int i = 2; i <= N; i++) H[Par[i][0]].push_back(i);\\n\\tdfs(1, 0);\\n\\n\\t// Step 5. Answer Query\\n\\tfor (int i = 1; i <= K; i++) {\\n\\t\\tlong long Dist1 = get<0>(Dist[X[i]]);\\n\\t\\tlong long Dist2 = 0;\\n\\t\\tif (Depth[X[i]] > D[i]) {\\n\\t\\t\\tint pos = prevs(X[i], Depth[X[i]] - D[i]);\\n\\t\\t\\tDist2 = get<0>(Dist[X[i]]) - get<0>(Dist[pos]);\\n\\t\\t}\\n\\t\\tlong long Answer = max(Dist2, Dist1 - P[i]);\\n\\t\\tprintf(\\\"%lld\\\\n\\\", Answer);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 99928,\n \"score_of_the_acc\": -1.103,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2764_8319087\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\n#pragma warning (disable: 4996)\\n\\n// Main Variables\\nlong long N, T[1 << 19];\\nlong long M, A[1 << 19], B[1 << 19], C[1 << 19];\\nlong long K, X[1 << 19], D[1 << 19], P[1 << 19];\\nlong long Prev[1 << 19];\\nvector<pair<long long, long long>> G[1 << 19];\\nvector<int> H[1 << 19];\\ntuple<long long, long long, long long> Dist[1 << 19];\\npriority_queue<tuple<long long, long long, long long, long long>, vector<tuple<long long, long long, long long, long long>>, greater<tuple<long long, long long, long long, long long>>> Q;\\n\\n// LCA Variables\\nlong long Par[1 << 19][22];\\nlong long Depth[1 << 19];\\nbool Used[1 << 19];\\n\\nvoid dfs(int pos, int dep) {\\n\\tDepth[pos] = dep;\\n\\tfor (int to : H[pos]) dfs(to, dep + 1);\\n}\\n\\nint prevs(int pos, int x) {\\n\\tfor (int i = 20; i >= 0; i--) {\\n\\t\\tif (x >= (1 << i)) { x -= (1 << i); pos = Par[pos][i]; }\\n\\t}\\n\\treturn pos;\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tscanf(\\\"%lld%lld\\\", &N, &M);\\n\\tfor (int i = 1; i <= N; i++) scanf(\\\"%lld\\\", &T[i]);\\n\\tfor (int i = 1; i <= M; i++) scanf(\\\"%lld%lld%lld\\\", &A[i], &B[i], &C[i]);\\n\\tscanf(\\\"%lld\\\", &K);\\n\\tfor (int i = 1; i <= K; i++) scanf(\\\"%lld%lld%lld\\\", &X[i], &D[i], &P[i]);\\n\\n\\t// Step 2. Make Graph\\n\\tfor (int i = 1; i <= M; i++) {\\n\\t\\tG[A[i]].push_back(make_pair(B[i], C[i]));\\n\\t\\tG[B[i]].push_back(make_pair(A[i], C[i]));\\n\\t}\\n\\tfor (int i = 1; i <= N; i++) Dist[i] = make_tuple((1LL << 60), -1, -1);\\n\\tQ.push(make_tuple(0, 0, (1LL << 60), 1));\\n\\tDist[1] = make_tuple(0, 0, (1LL << 60));\\n\\n\\t// Step 3. Dijkstra\\n\\twhile (!Q.empty()) {\\n\\t\\tlong long pos = get<3>(Q.top());\\n\\t\\tlong long cost1 = get<0>(Q.top());\\n\\t\\tlong long cost2 = get<1>(Q.top());\\n\\t\\tlong long cost3 = get<2>(Q.top()); Q.pop();\\n\\t\\tif (Used[pos] == true) continue;\\n\\t\\tUsed[pos] = true;\\n\\t\\tfor (int i = 0; i < G[pos].size(); i++) {\\n\\t\\t\\tlong long to = G[pos][i].first;\\n\\t\\t\\tlong long nex_cost1 = cost1 + G[pos][i].second;\\n\\t\\t\\tlong long nex_cost2 = cost2 + 1;\\n\\t\\t\\tlong long nex_cost3 = min(cost3, T[pos]);\\n\\t\\t\\tif (Dist[to] > make_tuple(nex_cost1, nex_cost2, nex_cost3)) {\\n\\t\\t\\t\\tDist[to] = make_tuple(nex_cost1, nex_cost2, nex_cost3);\\n\\t\\t\\t\\tPrev[to] = pos;\\n\\t\\t\\t\\tQ.push(make_tuple(nex_cost1, nex_cost2, nex_cost3, to));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. LCA Init\\n\\tfor (int i = 1; i <= N; i++) Par[i][0] = Prev[i];\\n\\tfor (int d = 1; d <= 20; d++) {\\n\\t\\tfor (int i = 1; i <= N; i++) Par[i][d] = Par[Par[i][d - 1]][d - 1];\\n\\t}\\n\\tfor (int i = 2; i <= N; i++) H[Prev[i]].push_back(i);\\n\\tdfs(1, 0);\\n\\n\\t// Step 5. Answer Query\\n\\tfor (int i = 1; i <= K; i++) {\\n\\t\\tlong long Dist1 = get<0>(Dist[X[i]]);\\n\\t\\tlong long Dist2 = 0;\\n\\t\\tif (Depth[X[i]] > D[i]) {\\n\\t\\t\\tint pos = prevs(X[i], Depth[X[i]] - D[i]);\\n\\t\\t\\tDist2 = get<0>(Dist[X[i]]) - get<0>(Dist[pos]);\\n\\t\\t}\\n\\t\\tlong long Answer = max(Dist2, Dist1 - P[i]);\\n\\t\\tprintf(\\\"%lld\\\\n\\\", Answer);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6984126984126984,\n \"time_ms\": 170,\n \"memory_kb\": 102900,\n \"score_of_the_acc\": -1.125,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2764_8319078\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\n#pragma warning (disable: 4996)\\n\\n// Main Variables\\nlong long N, T[1 << 19];\\nlong long M, A[1 << 19], B[1 << 19], C[1 << 19];\\nlong long K, X[1 << 19], D[1 << 19], P[1 << 19];\\nlong long Prev[1 << 19];\\nvector<pair<long long, long long>> G[1 << 19];\\nvector<int> H[1 << 19];\\ntuple<long long, long long, long long> Dist[1 << 19];\\npriority_queue<tuple<long long, long long, long long, long long>, vector<tuple<long long, long long, long long, long long>>, greater<tuple<long long, long long, long long, long long>>> Q;\\n\\n// LCA Variables\\nlong long Par[1 << 19][22];\\nlong long Depth[1 << 19];\\nbool Used[1 << 19];\\n\\nvoid dfs(int pos, int dep) {\\n\\tDepth[pos] = dep;\\n\\tfor (int to : H[pos]) dfs(to, dep + 1);\\n}\\n\\nint prevs(int pos, int x) {\\n\\tfor (int i = 20; i >= 0; i--) {\\n\\t\\tif (x >= (1 << i)) { x -= (1 << i); pos = Par[pos][i]; }\\n\\t}\\n\\treturn pos;\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tscanf(\\\"%lld%lld\\\", &N, &M);\\n\\tfor (int i = 1; i <= N; i++) scanf(\\\"%lld\\\", &T[i]);\\n\\tfor (int i = 1; i <= M; i++) scanf(\\\"%lld%lld%lld\\\", &A[i], &B[i], &C[i]);\\n\\tscanf(\\\"%lld\\\", &K);\\n\\tfor (int i = 1; i <= K; i++) scanf(\\\"%lld%lld%lld\\\", &X[i], &D[i], &P[i]);\\n\\n\\t// Step 2. Make Graph\\n\\tfor (int i = 1; i <= M; i++) {\\n\\t\\tG[A[i]].push_back(make_pair(B[i], C[i]));\\n\\t\\tG[B[i]].push_back(make_pair(A[i], C[i]));\\n\\t}\\n\\tfor (int i = 1; i <= N; i++) Dist[i] = make_tuple((1LL << 60), -1, -1);\\n\\tQ.push(make_tuple(0, 0, 0, 1));\\n\\tDist[1] = make_tuple(0, 0, 0);\\n\\n\\t// Step 3. Dijkstra\\n\\twhile (!Q.empty()) {\\n\\t\\tlong long pos = get<3>(Q.top());\\n\\t\\tlong long cost1 = get<0>(Q.top());\\n\\t\\tlong long cost2 = get<1>(Q.top());\\n\\t\\tlong long cost3 = get<2>(Q.top()); Q.pop();\\n\\t\\tif (Used[pos] == true) continue;\\n\\t\\tUsed[pos] = true;\\n\\t\\tfor (int i = 0; i < G[pos].size(); i++) {\\n\\t\\t\\tlong long to = G[pos][i].first;\\n\\t\\t\\tlong long nex_cost1 = cost1 + G[pos][i].second;\\n\\t\\t\\tlong long nex_cost2 = cost2 + 1;\\n\\t\\t\\tlong long nex_cost3 = cost3 + T[to];\\n\\t\\t\\tif (Dist[to] > make_tuple(nex_cost1, nex_cost2, nex_cost3)) {\\n\\t\\t\\t\\tDist[to] = make_tuple(nex_cost1, nex_cost2, nex_cost3);\\n\\t\\t\\t\\tPrev[to] = pos;\\n\\t\\t\\t\\tQ.push(make_tuple(nex_cost1, nex_cost2, nex_cost3, to));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. LCA Init\\n\\tfor (int i = 1; i <= N; i++) Par[i][0] = Prev[i];\\n\\tfor (int d = 1; d <= 20; d++) {\\n\\t\\tfor (int i = 1; i <= N; i++) Par[i][d] = Par[Par[i][d - 1]][d - 1];\\n\\t}\\n\\tfor (int i = 2; i <= N; i++) H[Prev[i]].push_back(i);\\n\\tdfs(1, 0);\\n\\n\\t// Step 5. Answer Query\\n\\tfor (int i = 1; i <= K; i++) {\\n\\t\\tlong long Dist1 = get<0>(Dist[X[i]]);\\n\\t\\tlong long Dist2 = 0;\\n\\t\\tif (Depth[X[i]] > D[i]) {\\n\\t\\t\\tint pos = prevs(X[i], Depth[X[i]] - D[i]);\\n\\t\\t\\tDist2 = get<0>(Dist[X[i]]) - get<0>(Dist[pos]);\\n\\t\\t}\\n\\t\\tlong long Answer = max(Dist2, Dist1 - P[i]);\\n\\t\\tprintf(\\\"%lld\\\\n\\\", Answer);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6984126984126984,\n \"time_ms\": 170,\n \"memory_kb\": 102632,\n \"score_of_the_acc\": -1.1214,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2764_4550057\",\n \"code_snippet\": \"#include <array>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\nint main(){\\n using ll = long long;\\n int N, M;\\n cin >> N >> M;\\n vector<int> T(N);\\n for(int i = 0; i < N; ++i)\\n cin >> T[i];\\n vector<vector<pair<int,int>>> G(N);\\n for(int i = 0; i < M; ++i){\\n int a, b, c;\\n cin >> a >> b >> c;\\n --a,--b;\\n G[a].emplace_back(c,b);\\n G[b].emplace_back(c,a);\\n }\\n int K;\\n cin >> K;\\n vector<int> X(K), D(K), P(K);\\n for(int i = 0; i < K; ++i){\\n cin >> X[i] >> D[i] >> P[i];\\n --X[i];\\n }\\n priority_queue<array<ll,3>,vector<array<ll,3>>,greater<>> pq;\\n pq.push({0,0,0});\\n const ll INF = 1e18;\\n vector<ll> cost(N,INF), day(N,INF), from(N,-1);\\n cost[0] = 0;\\n day[0] = 0;\\n from[0] = 0;\\n auto update = [&](int v, ll c, int d, int f){\\n if(cost[v] < c) return false;\\n if(cost[v] > c){\\n cost[v] = c;\\n day[v] = d;\\n from[v] = f;\\n return true;\\n }\\n if(day[v] < d) return false;\\n if(day[v] > d){\\n day[v] = d;\\n from[v] = f;\\n return true;\\n }\\n if(from[v] < 0 or T[from[v]] > T[f]){\\n from[v] = f;\\n return true;\\n }\\n return false;\\n };\\n\\n while(pq.size()){\\n auto p = pq.top();\\n pq.pop();\\n ll c = p[0], d = p[1], v = p[2];\\n if(cost[v] != c or day[v] != d) continue;\\n for(auto e : G[v]){\\n ll c_ = c + e.first, d_ = d + 1, v_ = e.second;\\n if(update(v_,c_,d_,v)){\\n pq.push({c_,d_,v_});\\n }\\n }\\n }\\n // for(int i = 0; i < N; ++i){\\n // printf(\\\"v = %d, cost = %lld, day = %lld, from = %lld\\\\n\\\",i,cost[i],day[i],from[i]);\\n // }\\n\\n vector<vector<int>> nex(N,vector<int>(25,-1));\\n for(int i = 0; i < N; ++i){\\n nex[i][0] = from[i];\\n }\\n for(int i = 1; i < 25; ++i){\\n for(int j = 0; j < N; ++j){\\n nex[j][i] = nex[nex[j][i-1]][i-1];\\n }\\n }\\n for(int i = 0; i < K; ++i){\\n int x = X[i], d = D[i], p = P[i];\\n if(day[x] <= d){\\n cout << max(0LL,cost[x]-p) << \\\"\\\\n\\\";\\n continue;\\n }\\n ll ans = cost[x];\\n int v = x;\\n for(int j = 24; j >= 0; --j){\\n if(day[nex[v][j]] > d){\\n v = nex[v][j];\\n }\\n }\\n if(day[v] > d){\\n v = nex[v][0];\\n }\\n ans -= cost[v];\\n ans += max(0LL,cost[v]-p);\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 38000,\n \"score_of_the_acc\": -0.8093,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2764_4550042\",\n \"code_snippet\": \"#include <array>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\nint main(){\\n using ll = long long;\\n int N, M;\\n cin >> N >> M;\\n vector<int> T(N);\\n for(int i = 0; i < N; ++i)\\n cin >> T[i];\\n vector<vector<pair<int,int>>> G(N);\\n for(int i = 0; i < M; ++i){\\n int a, b, c;\\n cin >> a >> b >> c;\\n --a,--b;\\n G[a].emplace_back(c,b);\\n G[b].emplace_back(c,a);\\n }\\n int K;\\n cin >> K;\\n vector<int> X(K), D(K), P(K);\\n for(int i = 0; i < K; ++i){\\n cin >> X[i] >> D[i] >> P[i];\\n --X[i];\\n }\\n priority_queue<array<ll,3>,vector<array<ll,3>>,greater<>> pq;\\n pq.push({0,0,0});\\n const ll INF = 1e18;\\n vector<ll> cost(N,INF), day(N,INF), from(N,-1);\\n cost[0] = 0;\\n day[0] = 0;\\n from[0] = 0;\\n auto update = [&](int v, ll c, int d, int f){\\n if(cost[v] < c) return false;\\n if(cost[v] > c){\\n cost[v] = c;\\n day[v] = d;\\n from[v] = f;\\n return true;\\n }\\n if(day[v] > d){\\n day[v] = d;\\n from[v] = f;\\n return true;\\n }\\n if(from[v] < 0 or T[from[v]] > T[f]){\\n from[v] = f;\\n return true;\\n }\\n return false;\\n };\\n\\n while(pq.size()){\\n auto p = pq.top();\\n pq.pop();\\n ll c = p[0], d = p[1], v = p[2];\\n if(cost[v] != c or day[v] != d) continue;\\n for(auto e : G[v]){\\n ll c_ = c + e.first, d_ = d + 1, v_ = e.second;\\n if(update(v_,c_,d_,v)){\\n pq.push({c_,d_,v_});\\n }\\n }\\n }\\n // for(int i = 0; i < N; ++i){\\n // printf(\\\"v = %d, cost = %lld, day = %lld, from = %lld\\\\n\\\",i,cost[i],day[i],from[i]);\\n // }\\n\\n vector<vector<int>> nex(N,vector<int>(25,-1));\\n for(int i = 0; i < N; ++i){\\n nex[i][0] = from[i];\\n }\\n for(int i = 1; i < 25; ++i){\\n for(int j = 0; j < N; ++j){\\n nex[j][i] = nex[nex[j][i-1]][i-1];\\n }\\n }\\n for(int i = 0; i < K; ++i){\\n int x = X[i], d = D[i], p = P[i];\\n if(day[x] <= d){\\n cout << max(0LL,cost[x]-p) << \\\"\\\\n\\\";\\n continue;\\n }\\n ll ans = cost[x];\\n int v = x;\\n for(int j = 24; j >= 0; --j){\\n if(day[nex[v][j]] > d){\\n v = nex[v][j];\\n }\\n }\\n if(day[v] > d){\\n v = nex[v][0];\\n }\\n ans -= cost[v];\\n ans += max(0LL,cost[v]-p);\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 0.6984126984126984,\n \"time_ms\": 490,\n \"memory_kb\": 38164,\n \"score_of_the_acc\": -0.8293,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2764_4550021\",\n \"code_snippet\": \"#include <array>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\nint main(){\\n using ll = long long;\\n int N, M;\\n cin >> N >> M;\\n vector<int> T(N);\\n for(int i = 0; i < N; ++i)\\n cin >> T[i];\\n vector<vector<pair<int,int>>> G(N);\\n for(int i = 0; i < M; ++i){\\n int a, b, c;\\n cin >> a >> b >> c;\\n --a,--b;\\n G[a].emplace_back(c,b);\\n G[b].emplace_back(c,a);\\n }\\n int K;\\n cin >> K;\\n vector<int> X(K), D(K), P(K);\\n for(int i = 0; i < K; ++i){\\n cin >> X[i] >> D[i] >> P[i];\\n --X[i];\\n }\\n priority_queue<array<ll,3>,vector<array<ll,3>>,greater<>> pq;\\n pq.push({0,0,0});\\n const ll INF = 1e18;\\n vector<ll> cost(N,INF), day(N,INF), from(N,-1);\\n cost[0] = 0;\\n day[0] = 0;\\n from[0] = 0;\\n auto update = [&](int v, ll c, int d, int f){\\n if(cost[v] < c) return false;\\n if(cost[v] > c){\\n cost[v] = c;\\n day[v] = d;\\n from[v] = f;\\n return true;\\n }\\n if(day[v] > d){\\n day[v] = d;\\n from[v] = f;\\n return true;\\n }\\n if(from[v] < 0 or T[from[v]] > T[f]){\\n from[v] = f;\\n return true;\\n }\\n return false;\\n };\\n\\n while(pq.size()){\\n auto p = pq.top();\\n pq.pop();\\n ll c = p[0], d = p[1], v = p[2];\\n if(cost[v] < c) continue;\\n for(auto e : G[v]){\\n ll c_ = c + e.first, d_ = d + 1, v_ = e.second;\\n if(update(v_,c_,d_,v)){\\n pq.push({c_,d_,v_});\\n }\\n }\\n }\\n // for(int i = 0; i < N; ++i){\\n // printf(\\\"v = %d, cost = %lld, day = %lld, from = %lld\\\\n\\\",i,cost[i],day[i],from[i]);\\n // }\\n\\n vector<vector<int>> nex(N,vector<int>(25,-1));\\n for(int i = 0; i < N; ++i){\\n nex[i][0] = from[i];\\n }\\n for(int i = 1; i < 25; ++i){\\n for(int j = 0; j < N; ++j){\\n nex[j][i] = nex[nex[j][i-1]][i-1];\\n }\\n }\\n for(int i = 0; i < K; ++i){\\n int x = X[i], d = D[i], p = P[i];\\n if(day[x] <= d){\\n cout << max(0LL,cost[x]-p) << \\\"\\\\n\\\";\\n continue;\\n }\\n long long ans = cost[x];\\n int v = x;\\n for(int j = 24; j >= 0; --j){\\n if(day[nex[v][j]] > d){\\n v = nex[v][j];\\n }\\n }\\n if(day[v] > d){\\n v = nex[v][0];\\n }\\n ans -= cost[v];\\n ans += max(0LL,cost[v]-p);\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 0.6984126984126984,\n \"time_ms\": 480,\n \"memory_kb\": 38164,\n \"score_of_the_acc\": -0.8114,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2764_4550019\",\n \"code_snippet\": \"#include <array>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\nint main(){\\n using ll = long long;\\n int N, M;\\n cin >> N >> M;\\n vector<int> T(N);\\n for(int i = 0; i < N; ++i)\\n cin >> T[i];\\n vector<vector<pair<int,int>>> G(N);\\n for(int i = 0; i < M; ++i){\\n int a, b, c;\\n cin >> a >> b >> c;\\n --a,--b;\\n G[a].emplace_back(c,b);\\n G[b].emplace_back(c,a);\\n }\\n int K;\\n cin >> K;\\n vector<int> X(K), D(K), P(K);\\n for(int i = 0; i < K; ++i){\\n cin >> X[i] >> D[i] >> P[i];\\n --X[i];\\n }\\n priority_queue<array<ll,3>,vector<array<ll,3>>,greater<>> pq;\\n pq.push({0,0,0});\\n const ll INF = 1e18;\\n vector<ll> cost(N,INF), day(N,INF), from(N,-1);\\n cost[0] = 0;\\n day[0] = 0;\\n from[0] = 0;\\n auto update = [&](int v, ll c, int d, int f){\\n if(cost[v] < c) return false;\\n if(cost[v] > c){\\n cost[v] = c;\\n day[v] = d;\\n from[v] = f;\\n return true;\\n }\\n if(day[v] > d){\\n day[v] = d;\\n from[v] = f;\\n return true;\\n }\\n if(from[v] < 0 or T[from[v]] > T[f]){\\n from[v] = f;\\n return true;\\n }\\n return false;\\n };\\n\\n while(pq.size()){\\n auto p = pq.top();\\n pq.pop();\\n ll c = p[0], d = p[1], v = p[2];\\n if(cost[v] < c) continue;\\n for(auto e : G[v]){\\n ll c_ = c + e.first, d_ = d + 1, v_ = e.second;\\n if(update(v_,c_,d_,v)){\\n pq.push({c_,d_,v_});\\n }\\n }\\n }\\n // for(int i = 0; i < N; ++i){\\n // printf(\\\"v = %d, cost = %lld, day = %lld, from = %lld\\\\n\\\",i,cost[i],day[i],from[i]);\\n // }\\n\\n vector<vector<int>> nex(N,vector<int>(20,-1));\\n for(int i = 0; i < N; ++i){\\n nex[i][0] = from[i];\\n }\\n for(int i = 1; i < 20; ++i){\\n for(int j = 0; j < N; ++j){\\n nex[j][i] = nex[nex[j][i-1]][i-1];\\n }\\n }\\n for(int i = 0; i < K; ++i){\\n int x = X[i], d = D[i], p = P[i];\\n if(day[x] <= d){\\n cout << max(0LL,cost[x]-p) << \\\"\\\\n\\\";\\n continue;\\n }\\n long long ans = cost[x];\\n int v = x;\\n for(int j = 19; j >= 0; --j){\\n if(day[nex[v][j]] > d){\\n v = nex[v][j];\\n }\\n }\\n if(day[v] > d){\\n v = nex[v][0];\\n }\\n ans -= cost[v];\\n ans += max(0LL,cost[v]-p);\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 0.6984126984126984,\n \"time_ms\": 480,\n \"memory_kb\": 36340,\n \"score_of_the_acc\": -0.787,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2764_3717706\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"random\\\"\\n#include \\\"string\\\"\\n#include \\\"bitset\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"map\\\"\\n#include \\\"queue\\\"\\n#include \\\"list\\\"\\n#include \\\"set\\\"\\n#include \\\"climits\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"stack\\\"\\n#include \\\"functional\\\"\\n\\nusing namespace std;\\nusing ll = long long int;\\nusing PII = pair<ll, ll>;\\n\\nstruct Edge {\\n\\tint to, cost;\\n\\tEdge(int a, int b) {\\n\\t\\tto = a;\\n\\t\\tcost = b;\\n\\t\\treturn;\\n\\t}\\n};\\n\\nstruct Node {\\n\\tint num, cost, day;\\n\\tbool operator<(const Node&n)const {\\n\\t\\treturn make_pair(cost, day) < make_pair(n.cost, n.day);\\n\\t}\\n\\tbool operator>(const Node&n)const {\\n\\t\\treturn make_pair(cost, day)>make_pair(n.cost, n.day);\\n\\t}\\n\\tNode(int a, int b, int c) {\\n\\t\\tnum = a, cost = b, day = c;\\n\\t\\treturn;\\n\\t}\\n};\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tvector<long long int>num(N);\\n\\tfor (auto &i : num)cin >> i;\\n\\tvector<vector<Edge>>edge(N);\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\ta--;\\n\\t\\tb--;\\n\\t\\tedge[a].push_back(Edge(b, c));\\n\\t\\tedge[b].push_back(Edge(a, c));\\n\\t}\\n\\tvector<pair<int, int>>dist(N, { 1000000000,1000000000 });\\n\\tdist[0] = make_pair( 0,0 );\\n\\tpriority_queue<Node, vector<Node>, greater<Node>>PQ;\\n\\tPQ.push(Node(0, 0, 0));\\n\\twhile (!PQ.empty()) {\\n\\t\\tint cn = PQ.top().num;\\n\\t\\tint c = PQ.top().cost;\\n\\t\\tint cd = PQ.top().day;\\n\\t\\tPQ.pop();\\n\\t\\tfor (auto i : edge[cn]) {\\n\\t\\t\\tif (dist[i.to] > make_pair(c + i.cost, cd + 1)) {\\n\\t\\t\\t\\tdist[i.to] = make_pair(c + i.cost, cd + 1);\\n\\t\\t\\t\\tPQ.push(Node(i.to, dist[i.to].first, dist[i.to].second));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint K;\\n\\tcin >> K;\\n\\tvector<vector<int>>tapi(N, vector<int>(20, -1));\\n\\tfor (int i = 1; i < N; i++) {\\n\\t\\tint nx = -1;\\n\\t\\tfor (auto j : edge[i]) {\\n\\t\\t\\tif (dist[j.to].first + j.cost == dist[i].first&&dist[j.to].second + 1 == dist[i].second) {\\n\\t\\t\\t\\tif (nx == -1)nx = j.to;\\n\\t\\t\\t\\telse if (num[nx] > num[j.to])nx = j.to;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (nx != -1) {\\n\\t\\t\\ttapi[i][0] = nx;\\n\\t\\t}\\n\\t}\\n\\tfor (int j = 1; j < 20; j++) {\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tif (tapi[i][j - 1] == -1)continue;\\n\\t\\t\\ttapi[i][j] = tapi[tapi[i][j - 1]][j - 1];\\n\\t\\t}\\n\\t}\\n\\twhile (K--) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\ta--;\\n\\t\\tint step = max(0, dist[a].second - b);\\n\\t\\tint ans = dist[a].first;\\n\\t\\tint node = a;\\n\\t\\tfor (int i = 0; i < 20; i++) {\\n\\t\\t\\tif ((step >> i) & 1) {\\n\\t\\t\\t\\tnode = tapi[node][i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans -= dist[node].first;\\n\\t\\tans += max(0, dist[node].first - c);\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 32588,\n \"score_of_the_acc\": -0.6118,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2764_3659763\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100005\\n\\nstruct Edge{\\n\\tEdge(int arg_to,ll arg_cost){\\n\\t\\tto = arg_to;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tint to;\\n\\tll cost;\\n};\\n\\nstruct Info{\\n\\n\\tint start,day,pay;\\n};\\n\\nstruct State{\\n\\n\\tState(int arg_node_id,int arg_sum_date,int arg_sum_cost){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tsum_date = arg_sum_date;\\n\\t\\tsum_cost = arg_sum_cost;\\n\\t}\\n\\tbool operator<(const struct State &arg) const{\\n\\n\\t\\tif(sum_cost != arg.sum_cost){\\n\\n\\t\\t\\treturn sum_cost > arg.sum_cost; //総コストが異なるなら昇順(PQ)\\n\\t\\t}else{\\n\\n\\t\\t\\treturn sum_date > arg.sum_date; //総コストが同じなら、日数の総和(PQ)\\n\\t\\t}\\n\\t}\\n\\n\\tint node_id,sum_date,sum_cost;\\n};\\n\\nint N,E,K;\\nint root; //根ノードの番号\\nint MAX_LOG_V = 17;\\nint POW[18];\\nint T[NUM];\\nint min_dist[NUM],min_date[NUM];\\nint parent[18][NUM];\\nint depth[NUM];\\nvector<Edge> G[NUM]; //グラフの隣接リスト表現\\nvector<int> Tree_G[NUM];\\nInfo info[NUM];\\n\\n\\n//parentとdepthを再帰的に設定\\nvoid dfs(int node_id,int parent_id,int d){\\n\\tparent[0][node_id] = parent_id;\\n\\tdepth[node_id] = d;\\n\\tfor(int i = 0; i < Tree_G[node_id].size(); i++){\\n\\t\\tif(Tree_G[node_id][i] != parent_id)dfs(Tree_G[node_id][i],node_id,d+1);\\n\\t}\\n}\\n\\n//初期化\\nvoid init(){\\n\\t//parent[0]とdepthを初期化する\\n\\tdfs(root,-1,0);\\n\\t//parentを初期化する\\n\\tfor(int k = 0; k + 1 < MAX_LOG_V; k++){\\n\\t\\tfor(int node_id = 0; node_id < N; node_id++){\\n\\t\\t\\tif(parent[k][node_id] < 0)parent[k+1][node_id] = -1; //node_idの2^k上のノードがルートノードより上なら、2^(k+1)上も同様とする\\n\\t\\t\\telse{\\n\\t\\t\\t\\tparent[k+1][node_id] = parent[k][parent[k][node_id]];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i <= 17; i++){\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N,&E);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&T[i]);\\n\\t}\\n\\n\\tint from,to,cost;\\n\\n\\tfor(int i = 0; i < E; i++){\\n\\n\\t\\tscanf(\\\"%d %d %d\\\",&from,&to,&cost);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\n\\t\\tG[from].push_back(Edge(to,cost));\\n\\t\\tG[to].push_back(Edge(from,cost));\\n\\t}\\n\\n\\tscanf(\\\"%d\\\",&K);\\n\\n\\tfor(int i = 0; i < K; i++){\\n\\n\\t\\tscanf(\\\"%d %d %d\\\",&info[i].start,&info[i].day,&info[i].pay);\\n\\t\\tinfo[i].start--;\\n\\t}\\n\\n\\t//ダイクストラ\\n\\n\\tmin_dist[0] = 0;\\n\\tmin_date[0] = 0;\\n\\n\\tfor(int i = 1; i < N; i++){\\n\\n\\t\\tmin_dist[i] = BIG_NUM;\\n\\t\\tmin_date[i] = BIG_NUM;\\n\\t}\\n\\n\\tpriority_queue<State> Q;\\n\\tQ.push(State(0,0,0));\\n\\n\\tint next_node,next_cost,next_date;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif((Q.top().sum_cost > min_dist[Q.top().node_id])\\n\\t\\t\\t\\t|| (Q.top().sum_cost == min_dist[Q.top().node_id] && Q.top().sum_date > min_date[Q.top().node_id])){\\n\\n\\t\\t\\tQ.pop();\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\\n\\n\\t\\t\\t\\tnext_node = G[Q.top().node_id][i].to;\\n\\t\\t\\t\\tnext_cost = Q.top().sum_cost+G[Q.top().node_id][i].cost;\\n\\t\\t\\t\\tnext_date = Q.top().sum_date+1;\\n\\n\\t\\t\\t\\tif(min_dist[next_node] > next_cost){\\n\\n\\t\\t\\t\\t\\tmin_dist[next_node] = next_cost;\\n\\t\\t\\t\\t\\tmin_date[next_node] = next_date;\\n\\t\\t\\t\\t\\tQ.push(State(next_node,next_date,next_cost));\\n\\n\\t\\t\\t\\t}else if(min_dist[next_node] == next_cost && min_date[next_node] > next_date){\\n\\n\\t\\t\\t\\t\\tmin_date[next_node] = next_date;\\n\\t\\t\\t\\t\\tQ.push(State(next_node,next_date,next_cost));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tint tmp_num,next;\\n\\n\\t//最短経路の辺を張る\\n\\tfor(int i = 1; i < N; i++){\\n\\t\\t//次の節店を探し、辺を張る\\n\\t\\ttmp_num = BIG_NUM;\\n\\t\\tnext = -1;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\t\\t\\tif(min_dist[i]-G[i][k].cost == min_dist[G[i][k].to] && min_date[i] == min_date[G[i][k].to]+1){ //最短経路上\\n\\n\\t\\t\\t\\tif(tmp_num > T[G[i][k].to]){ //人口で選ぶ\\n\\t\\t\\t\\t\\ttmp_num = T[G[i][k].to];\\n\\t\\t\\t\\t\\tnext = G[i][k].to;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(next == -1)continue;\\n\\n\\t\\tTree_G[next].push_back(i); //木は都市0をスタートとする\\n\\t}\\n\\n\\t//木作り&ダブリング\\n\\troot = 0;\\n\\tinit();\\n\\n\\tint current_node,diff;\\n\\n\\tfor(int i = 0; i < K; i++){\\n\\n\\t\\tint ans = BIG_NUM;\\n\\n\\t\\tcurrent_node = info[i].start;\\n\\t\\tdiff = depth[info[i].start]-info[i].day;\\n\\n\\t\\tfor(int k = MAX_LOG_V-1; k >= 0; k--){\\n\\t\\t\\tif(diff >= POW[k]){ //たとえば深さの差が39なら、32+4+2+1のように、ノードを上方に移動させる\\n\\n\\t\\t\\t\\tcurrent_node = parent[k][current_node];\\n\\t\\t\\t\\tdiff -= POW[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(current_node == -1){ //★金を貰う前に着く★\\n\\n\\t\\t\\tans = min(ans,min_dist[info[i].start]);\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tans = min(ans,(min_dist[info[i].start]-min_dist[current_node])+max(0,min_dist[current_node]-info[i].pay));\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 43016,\n \"score_of_the_acc\": -0.4479,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2764_3367882\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define rep(i,n) REP(i,0,n)\\n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\\n#define repr(i, n) REPR(i, n, 0)\\n#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)\\n#define pb push_back\\n#define all(r) r.begin(),r.end()\\n#define rall(r) r.rbegin(),r.rend()\\n#define fi first\\n#define se second\\n \\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n \\nconst int INF = 1e9;\\nconst ll MOD = 1e9 + 7;\\ndouble EPS = 1e-8;\\n\\n#define DEBUG_MODE\\n#ifdef DEBUG_MODE\\n#define dump(x) cout << #x << \\\" : \\\" << x << endl\\n#define LINE cout << \\\"line : \\\" << __LINE__ << endl\\n#define dumpV(v) cout << #v << \\\" : [\\\"; for(auto& t : v) cout << t << \\\", \\\"; cout<<\\\"]\\\" << endl\\n#define STOP assert(false)\\n#else\\n#define dump(x) ;\\n#define LINE ;\\n#define dumpV(v);\\n#define STOP ;\\n#endif\\n#define mp make_pair\\n\\nnamespace std{\\n template<class S,class T>\\n ostream &operator <<(ostream& out,const pair<S,T>& a){\\n out<<'('<<a.fi<<\\\", \\\"<<a.se<<')';\\n return out;\\n }\\n}\\n\\n\\nconst int MAX_N = 1e5+10;\\nconst int MAX_M = 5e5+10;\\n\\nint t[MAX_N];\\nusing Edge = pair<int, ll>; // to, cost\\nvector<Edge> es[MAX_N];\\n\\nusing State = pair<ll, pii>; // cost, day, population\\nState StateINF = State(1e18, pii(1e9, 1e9));\\n\\nbool chMin(State& a, const State& b) {\\n if(a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\nState d[MAX_N];\\n\\nint from[MAX_N]; // 経路復元\\n\\nint A[MAX_N][30];\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, m;\\n cin >> n >> m;\\n rep(i, n) cin >> t[i];\\n rep(i, m) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n --a;\\n --b;\\n es[a].pb({b, (ll)c});\\n es[b].pb({a, (ll)c});\\n }\\n from[0] = -1;\\n {\\n rep(i, n) d[i] = StateINF;\\n int root = 0;\\n using P = pair<State, int>;\\n priority_queue<P, vector<P>, greater<P> > q;\\n d[root] = {0LL, {0, -1}};\\n q.push({d[root], root});\\n while (!q.empty()) {\\n auto p = q.top(); q.pop();\\n int prv = p.se;\\n const auto state = p.fi;\\n if (d[prv] < p.fi) continue;\\n for (auto& e : es[prv]) {\\n int to = e.fi;\\n auto nState = state;\\n nState.fi += e.se;\\n nState.se.fi++;\\n nState.se.se = t[prv];\\n\\n if (chMin(d[to], nState)) {\\n q.push({d[to], to});\\n from[to] = prv;\\n }\\n }\\n }\\n }\\n rep(i, MAX_N) rep(j, 30) A[i][j] = -1;\\n rep(j, 30) rep(i, n) {\\n if(j == 0) A[i][j] = from[i];\\n else if(A[i][j-1] != -1) A[i][j] = A[A[i][j-1]][j-1];\\n }\\n // rep(i, n) {\\n // cout << i << \\\" \\\" << d[i].fi << \\\" \\\" << d[i].se.fi << \\\" \\\" << d[i].se.se << \\\" \\\" << from[i] << \\\" \\\" << A[i][0] <<endl;\\n // }\\n // return 0;\\n // LINE;\\n int k;\\n cin >> k;\\n rep(_, k) {\\n int x, D, p;\\n cin >> x >> D >> p;\\n --x;\\n auto s = d[x];\\n int day = s.se.fi;\\n ll cost = s.fi;\\n if(day <= D) cout << max(0LL, cost - p) << '\\\\n';\\n else {\\n int now = x;\\n while(d[now].se.fi > D) {\\n // dump(mp(now, d[now].se.fi));\\n // dump(D);\\n if(A[now][0] == -1) break;\\n rep(i, 20) {\\n int to = A[now][i];\\n if(to == -1) {\\n now = A[now][i-1];\\n break;\\n }\\n if(d[to].se.fi < D) {\\n now = A[now][i-1];\\n break;\\n } \\n }\\n }\\n assert(now >= 0 && d[now].se.fi == D);\\n ll dif = cost - d[now].fi;\\n // cout << now << endl;\\n cout << dif + max(0LL, d[now].fi - p) << '\\\\n';\\n // LINE;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 44388,\n \"score_of_the_acc\": -0.4484,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2764_3254689\",\n \"code_snippet\": \"#include <queue>\\n#include <vector>\\n#include <iostream>\\nusing namespace std;\\nconst int bits = 20;\\nstruct edge {\\n\\tint to, cost;\\n};\\nstruct state {\\n\\tint pos, cost, dist, pop, par;\\n};\\nbool operator<(const state& s1, const state& s2) {\\n\\tif (s1.cost != s2.cost) return s1.cost > s2.cost;\\n\\tif (s1.dist != s2.dist) return s1.dist > s2.dist;\\n\\treturn s1.pop > s2.pop;\\n}\\nint main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(false);\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tvector<int> t(N);\\n\\tfor (int i = 0; i < N; ++i) cin >> t[i];\\n\\tvector<vector<edge> > G(N);\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c; --a, --b;\\n\\t\\tG[a].push_back(edge{ b, c });\\n\\t\\tG[b].push_back(edge{ a, c });\\n\\t}\\n\\tpriority_queue<state> que;\\n\\tque.push(state{ 0, 0, 0, t[0], -1 });\\n\\tvector<int> p(N, -2), pc(N), days(N), costs(N);\\n\\twhile (!que.empty()) {\\n\\t\\tstate u = que.top(); que.pop();\\n\\t\\tif (p[u.pos] == -2) {\\n\\t\\t\\tp[u.pos] = u.par;\\n\\t\\t\\tdays[u.pos] = u.dist;\\n\\t\\t\\tcosts[u.pos] = u.cost;\\n\\t\\t\\tfor (edge e : G[u.pos]) {\\n\\t\\t\\t\\tif (p[e.to] == -2) {\\n\\t\\t\\t\\t\\tque.push(state{ e.to, u.cost + e.cost, u.dist + 1, t[u.pos], u.pos });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<vector<int> > xp(bits, vector<int>(N));\\n\\txp[0] = p; xp[0][0] = 0;\\n\\tfor (int i = 1; i < bits; ++i) {\\n\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\txp[i][j] = xp[i - 1][xp[i - 1][j]];\\n\\t\\t}\\n\\t}\\n\\tint Q;\\n\\tcin >> Q;\\n\\tfor (int i = 0; i < Q; ++i) {\\n\\t\\tint pos, day, money;\\n\\t\\tcin >> pos >> day >> money; --pos;\\n\\t\\tint forward = max(days[pos] - day, 0);\\n\\t\\tint fpos = pos;\\n\\t\\tfor (int j = bits - 1; j >= 0; --j) {\\n\\t\\t\\tif ((forward >> j) & 1) fpos = xp[j][fpos];\\n\\t\\t}\\n\\t\\tint least = costs[pos] - costs[fpos];\\n\\t\\tint ans = least + max(costs[fpos] - money, 0);\\n\\t\\tcout << ans << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 35716,\n \"score_of_the_acc\": -0.4215,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2764_3002031\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <tuple>\\n#include <queue>\\n#include <cmath>\\n#include <cstdlib>\\nusing namespace std;\\nusing ll = long long int;\\n\\n#define fprintf(...) void(0)\\n\\nstruct Edge {\\n ll to, cost;\\n};\\n\\nusing Graph = vector< vector< Edge > >;\\n\\nstruct Elem {\\n ll pos, cost, day;\\n bool operator<(const Elem &e) const {\\n if(cost != e.cost) return cost > e.cost;\\n return day > e.day;\\n }\\n};\\n\\nconst int MAX_N = 100000;\\nll N, M, K;\\nll popu[MAX_N + 10], x[MAX_N + 10], d[MAX_N + 10], p[MAX_N + 10];\\n\\nconst ll INF = 1LL << 60;\\npair< Graph, vector<int> > get_tree(Graph &G) {\\n // cost, days\\n vector< pair<ll, ll> > state(N, make_pair(INF, INF));\\n\\n // population, prev_town\\n vector< pair<ll, ll> > pre(N, make_pair(INF, -1));\\n\\n priority_queue<Elem> que;\\n que.push(Elem{0, 0, 0});\\n state[0] = make_pair(0, 0);\\n\\n while(que.size()) {\\n Elem cur = que.top(); que.pop();\\n pair<ll, ll> cur_state = make_pair(cur.cost, cur.day);\\n\\n int u = cur.pos;\\n if(cur_state > state[u]) continue;\\n\\n for(auto e : G[u]) {\\n int to = e.to, n_cost = cur.cost + e.cost, n_day = cur.day + 1;\\n\\n pair<ll, ll> nxt = make_pair(n_cost, n_day);\\n pair<ll, ll> pop_info = make_pair(popu[u], u);\\n if(state[to] > nxt) {\\n state[to] = nxt;\\n pre[to] = pop_info;\\n que.push(Elem{to, n_cost, n_day});\\n }\\n else if(state[to] == nxt) {\\n if(pre[to] > pop_info) {\\n pre[to] = pop_info;\\n }\\n }\\n }\\n }\\n\\n Graph ret(N);\\n vector<int> par(N, -1);\\n for(int i=1; i<N; i++) {\\n // the parent of i is pre[i].second\\n int u = i, v = pre[i].second;\\n\\n ll cost_u = state[u].first, cost_v = state[v].first;\\n ll diff = llabs(cost_u - cost_v);\\n ret[u].push_back(Edge{v, diff});\\n ret[v].push_back(Edge{u, diff});\\n par[u] = v;\\n }\\n return make_pair(ret, par);\\n}\\n\\npair< vector<ll>, vector<ll> > get_cost_info(Graph &G) {\\n vector<ll> visited(N), sum(N), days(N);\\n\\n queue<int> que;\\n que.push(0);\\n visited[0] = true;\\n\\n while(que.size()) {\\n int cur = que.front(); que.pop();\\n for(auto e : G[cur]) {\\n if(visited[e.to]) continue;\\n visited[e.to] = true;\\n sum[e.to] = sum[cur] + e.cost;\\n days[e.to] = days[cur] + 1;\\n que.push(e.to);\\n }\\n }\\n return make_pair(sum, days);\\n}\\n\\nvoid solve(Graph &G, vector<int> &par) {\\n vector< vector<int> > nxt(N, vector<int>(18, -1));\\n vector<ll> acc_cost, days;\\n tie(acc_cost, days) = get_cost_info(G);\\n\\n // 2^k table\\n for(int i=0; i<N; i++) {\\n fprintf(stderr, \\\"parent of %d is %d\\\\n\\\", i, par[i]);\\n nxt[i][0] = par[i];\\n }\\n for(int k=1; k<18; k++) {\\n for(int i=0; i<N; i++) {\\n if(nxt[i][k-1] < 0) continue;\\n nxt[i][k] = nxt[ nxt[i][k-1] ][k-1];\\n }\\n }\\n\\n for(int i=0; i<K; i++) {\\n ll need_day = days[ x[i] ];\\n ll dayA = max(0LL, days[ x[i] ] - d[i]), dayB = need_day - dayA;\\n\\n ll costA = acc_cost[ x[i] ];\\n\\n // get costB\\n ll rest = dayA, cur = x[i];\\n for(int k=0; k<18; k++) {\\n if(rest >> k & 1) {\\n cur = nxt[cur][k];\\n }\\n }\\n\\n ll costB = acc_cost[ cur ];\\n\\n fprintf(stderr, \\\"dayA = %lld, dayB = %lld, costA = %lld, costB = %lld\\\\n\\\", dayA, dayB, costA, costB);\\n\\n ll ans = costA - costB + max(0LL, costB - p[i]);\\n printf(\\\"%lld\\\\n\\\", ans);\\n }\\n}\\n\\nint main() {\\n scanf(\\\"%lld%lld\\\", &N, &M);\\n for(int i=0; i<N; i++) {\\n scanf(\\\"%lld\\\", &popu[i]);\\n }\\n\\n Graph G(N);\\n for(int i=0; i<M; i++) {\\n int a, b, c; scanf(\\\"%d%d%d\\\", &a, &b, &c);\\n a--; b--;\\n G[a].push_back(Edge{b, c});\\n G[b].push_back(Edge{a, c});\\n }\\n\\n scanf(\\\"%lld\\\", &K);\\n for(int i=0; i<K; i++) {\\n scanf(\\\"%lld%lld%lld\\\", &x[i], &d[i], &p[i]);\\n x[i]--;\\n }\\n\\n Graph H; vector<int> par;\\n\\n fprintf(stderr, \\\"get tree!\\\\n\\\");\\n tie(H, par) = get_tree(G);\\n\\n fprintf(stderr, \\\"solve!\\\\n\\\");\\n solve(H, par);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 53072,\n \"score_of_the_acc\": -0.6361,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2764_2884869\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <queue>\\n#include <cmath>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define MP make_pair\\n#define PB push_back\\nll inf = (1LL)<<60;\\n\\nll dp[100001][20];\\n\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n,m;\\n cin >> n >> m;\\n vector<ll> t(n);\\n rep(i,n)cin >> t[i];\\n vector<vector<pair<int,ll> > >g(n);\\n rep(i,m){\\n int a,b;\\n ll c;\\n cin >> a >> b >> c;\\n a--;\\n b--;\\n g[a].PB(MP(b,c));\\n g[b].PB(MP(a,c));\\n }\\n priority_queue<pair<ll,pair<ll,int> >,vector<pair<ll,pair<ll,int> > >,greater<pair<ll,pair<ll,int> > > >pq;\\n pq.push(MP((ll)0,MP((ll)0,0)));\\n vector<int> parent(n);\\n parent[0]=-1;\\n vector<pair<ll,ll> > place(n,MP(inf,inf));\\n place[0] = MP(0,0);\\n while(!pq.empty()){\\n auto xxxxxxxx = pq.top();\\n pq.pop();\\n auto x = xxxxxxxx.first;\\n auto y = xxxxxxxx.second.first;\\n auto p = xxxxxxxx.second.second;\\n if(make_pair(x,y) > place[p]) continue;\\n for(auto& e : g[p]){\\n if(MP(x+e.second,y+1)>place[e.first])continue;\\n if(MP(x+e.second,y+1)==place[e.first]){\\n if(t[parent[e.first]]>t[p]){\\n parent[e.first] = p;\\n pq.push(MP(x+e.second,MP(y+1,e.first)));\\n }\\n }else{\\n place[e.first] = MP(x+e.second,y+1);\\n parent[e.first] = p;\\n pq.push(MP(x+e.second,MP(y+1,e.first)));\\n }\\n }\\n }\\n rep(i,n){\\n rep(j,20){\\n dp[i][j] = -1;\\n }\\n }\\n rep(i,n){\\n dp[i][0] = parent[i];\\n }\\n rep(j,19){\\n rep(i,n){\\n if(dp[i][j]>=0){\\n dp[i][j+1] = dp[dp[i][j]][j];\\n }\\n }\\n }\\n int k;\\n cin >> k;\\n rep(i,k){\\n int a,b;\\n ll c;\\n cin >> a >> b >> c;\\n a--;\\n ll ans = 0;\\n ans = place[a].first;\\n if(place[a].second<=b){\\n cout << max(0LL,ans-c) << endl;\\n }else{\\n int now = a;\\n int d = place[a].second-b;\\n for(int i = 20; i>=0; i--){\\n if(d < (1 << i)) continue;\\n now = dp[now][i];\\n d -= (1<<i);\\n }\\n cout << ans - min(place[now].first,c) << endl;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 50812,\n \"score_of_the_acc\": -0.6952,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2764_2736310\",\n \"code_snippet\": \"/*\\n * g.cc: \\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n\\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\nconst int MAX_D = 20;\\n\\ntypedef long long ll;\\n\\nconst int INF = 1 << 30;\\nconst ll LINF = 1LL << 60;\\n\\n/* typedef */\\n\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vpii;\\n\\nstruct Stat {\\n ll c;\\n int d, i;\\n Stat() {}\\n Stat(ll _c, int _d, int _i): c(_c), d(_d), i(_i) {}\\n bool operator<(const Stat &s) const {\\n return c > s.c || (c == s.c && d > s.d);\\n }\\n};\\n\\n/* global variables */\\n\\nint ts[MAX_N];\\nvpii nbrs[MAX_N];\\nll costs[MAX_N];\\nint dists[MAX_N], prts[MAX_N][MAX_D];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, m;\\n int tmp = scanf(\\\"%d%d\\\", &n, &m);\\n\\n for (int i = 0; i < n; i++) tmp = scanf(\\\"%d\\\", &ts[i]);\\n\\n for (int i = 0; i < m; i++) {\\n int ai, bi, ci;\\n tmp = scanf(\\\"%d%d%d\\\", &ai, &bi, &ci);\\n ai--, bi--;\\n nbrs[ai].push_back(pii(bi, ci));\\n nbrs[bi].push_back(pii(ai, ci));\\n }\\n\\n for (int i = 0; i < n; i++) costs[i] = LINF;\\n costs[0] = 0;\\n dists[0] = 0;\\n prts[0][0] = -1;\\n\\n priority_queue<Stat> q;\\n q.push(Stat(0, 0, 0));\\n\\n while (! q.empty()) {\\n Stat u = q.top(); q.pop();\\n if (costs[u.i] != u.c || dists[u.i] != u.d) continue;\\n\\n int vd = u.d + 1;\\n vpii &nbru = nbrs[u.i];\\n\\n for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\\n int &vi = vit->first;\\n ll vc = u.c + vit->second;\\n\\n if (costs[vi] > vc) {\\n\\tcosts[vi] = vc;\\n\\tdists[vi] = vd;\\n\\tprts[vi][0] = u.i;\\n\\tq.push(Stat(vc, vd, vi));\\n }\\n else if (costs[vi] == vc) {\\n\\tif (dists[vi] > vd) {\\n\\t dists[vi] = vd;\\n\\t prts[vi][0] = u.i;\\n\\t q.push(Stat(vc, vd, vi));\\n\\t}\\n\\telse if (dists[vi] == vd && ts[prts[vi][0]] > ts[u.i]) {\\n\\t prts[vi][0] = u.i;\\n\\t}\\n }\\n }\\n }\\n\\n for (int d = 1; d < MAX_D; d++)\\n for (int i = 0; i < n; i++) {\\n int j = prts[i][d - 1];\\n prts[i][d] = (j < 0) ? -1 : prts[j][d - 1];\\n }\\n\\n int k;\\n tmp = scanf(\\\"%d\\\", &k);\\n\\n while (k--) {\\n int xi, di, pi;\\n tmp = scanf(\\\"%d%d%d\\\", &xi, &di, &pi);\\n xi--;\\n\\n int r = dists[xi] - di;\\n int yi = xi;\\n //printf(\\\"xi=%d,di=%d,pi=%d: costs=%lld,dists=%d,r=%d\\\\n\\\",\\n //xi, di, pi, costs[xi], dists[xi], r);\\n\\n if (r > 0)\\n for (int d = MAX_D - 1; d >= 0; d--)\\n\\tif (r & (1 << d)) yi = prts[yi][d];\\n //printf(\\\" yi=%d\\\\n\\\", yi);\\n \\n ll cost = costs[xi] - costs[yi];\\n if (cost < costs[xi] - pi) cost = costs[xi] - pi;\\n\\n printf(\\\"%lld\\\\n\\\", cost);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 30240,\n \"score_of_the_acc\": -0.2232,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2764_2058074\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nvector<int>pops;\\nstruct edge {\\n\\tint from;\\n\\tint to;\\n\\tlong long int cost;\\n};\\nstruct aa {\\n\\tedge frome;\\n\\tlong long int cost;\\n\\t int time;\\n};\\nclass Compare {\\npublic:\\n\\tbool operator()(const aa l, const aa r) {\\n\\t\\treturn l.cost == r.cost ?l.time==r.time?pops[l.frome.from] > pops[r.frome.from]: l.time > r.time:l.cost > r.cost;\\n\\t}\\n}comp;\\t\\n\\n\\nclass Tree {\\npublic:\\n\\tTree(int V, int root) : V(V),revT(V), root(root), cnum(V), place(V), id(V) {\\n\\t\\tT.resize(V);\\n\\t\\tfor (int i = 0; i < MAXLOGV; i++) {\\n\\t\\t\\tparent[i].resize(V);\\n\\t\\t\\tcosts[i].resize(V);\\n\\n\\t\\t}\\n\\t\\tdepth.resize(V);\\n\\t}\\n\\t// u??¨v????????????\\n\\t// lca????±????????????¨????????????????????§????????°????????¨????????????\\n\\tvoid unite(edge& v) {\\n\\t\\tT[v.from].push_back(v);\\n\\t\\trevT[v.to]=(edge{ v.to,v.from,v.cost });\\n\\t}\\n\\t// init??????\\n\\t// ????????????????????????????????????????????????????????°????????¨lca????±???????????????????\\n\\tvoid init() {\\n\\t\\tdfs(root, 0, 0);\\n\\t\\tint id = 0;\\n\\t\\tgetid(root, 0, id);\\n\\t}\\n\\t// u??¨v???lca????±???????\\n\\tint lca(int u, int v) const {\\n\\t\\tif (depth[u] > depth[v]) swap(u, v);\\n\\t\\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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\\t// u??¨v????????¢????±???????\\n\\t// edge????????????????????¨????????????????????????????????????\\n\\tint dist(int u, int v) const {\\n\\t\\tint p = lca(u, v);\\n\\t\\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\\n\\t}\\n\\tint dfs(int v, int p, int d) {\\n\\t\\tparent[0][v] = p;\\n\\t\\tcosts[0][v] = revT[v].cost;\\n\\t\\tdepth[v] = d;\\n\\t\\tcnum[v] = 0;\\n\\t\\tfor (int i = 1; i < MAXLOGV; i++) {\\n\\t\\t\\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\\n\\t\\t\\tcosts[i][v] = costs[i - 1][parent[i - 1][v]] + costs[i - 1][v];\\n\\t\\t}\\n\\t\\tfor (auto e : T[v]) {\\n\\t\\t\\tint next = e.to;\\n\\t\\t\\tif (next != p) cnum[v] += dfs(next, v, d + 1);\\n\\t\\t}\\n\\t\\treturn cnum[v] + 1;\\n\\t}\\n\\n\\tvoid getid(const int v, const int p, int &nplace) {\\n\\t\\tplace[v] = nplace;\\n\\t\\tid[nplace] = v;\\n\\t\\tnplace++;\\n\\t\\tfor (auto e : T[v]) {\\n\\t\\t\\tint next = e.to;\\n\\t\\t\\tif (next != p) getid(next, v, nplace);\\n\\t\\t}\\n\\t}\\n\\tstatic const int MAXLOGV = 20;\\n\\t// ??°???????????£??\\\\???????????¨???\\n\\tvector<vector<edge> > T;\\n\\tvector<edge>revT;\\n\\t// ???????????°\\n\\tint V;\\n\\t// ?????????????????????\\n\\tint root;\\n\\n\\t// ????????????\\n\\tvector<int> parent[MAXLOGV];\\n\\tvector<long long int>costs[MAXLOGV];\\n\\t// ??????????????±???\\n\\tvector<int> depth;\\n\\n\\t//????????°\\n\\tvector<int>cnum;\\n\\n\\t//??????\\n\\tvector<int>place;\\n\\tvector<int>id;\\n\\n};\\n\\nint main() {\\n\\tint N, M; cin >> N >> M;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint a; cin >> a;\\n\\t\\tpops.push_back(a);\\n\\t}\\n\\tvector<vector<edge>>edges(N);\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint a, b, c; cin >> a >> b >> c; a--; b--;\\n\\t\\tedges[a].push_back(edge{ a,b,c });\\n\\t\\tedges[b].push_back(edge{ b,a,c });\\n\\t}\\n\\t\\n\\tvector<aa>memo(N, aa{ edge{-1,-1,-1},static_cast<long long int>(1e18),(static_cast<int>(1e9)) });\\n\\tmemo[0] = aa{ edge{-1,0,0},0,0 };\\n\\tpriority_queue<aa, vector<aa>, Compare>que;\\n\\tque.push(aa{ edge{-1,0,0},0,0 });\\n\\twhile (!que.empty()) {\\n\\t\\taa atop(que.top());\\n\\t\\tque.pop();\\n\\t\\tfor (auto e : edges[atop.frome.to]) {\\n\\t\\t\\tconst int next = e.to;\\n\\t\\t\\tconst long long int nextcost = atop.cost + e.cost;\\n\\t\\t\\tconst int nexttime = atop.time + 1;\\n\\t\\t\\tif (comp.operator()(memo[next],aa{ e,nextcost,nexttime })) {\\n\\t\\t\\t\\tmemo[next] = aa{ e,nextcost,nexttime };\\n\\t\\t\\t\\tque.push(aa{ e,nextcost,nexttime });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tTree t(N,0);\\n\\tfor (int i = 1; i < N; ++i) {\\n\\t\\tt.unite(memo[i].frome);\\n\\t}\\n\\tt.init();\\n\\tint K; cin >> K;\\n\\tfor (int i = 0; i < K; ++i) {\\n\\t\\tlong long int sum = 0;\\n\\t\\tint x, d, p; cin >> x >> d >> p;\\n\\t\\tx--;\\n\\t\\tif (d >= t.depth[x]) {\\n\\t\\t\\tint rest = t.depth[x];\\n\\t\\t\\tlong long int need = 0;\\n\\t\\t\\tint now = x;\\n\\t\\t\\tfor (int i = 0; i < 20; ++i) {\\n\\t\\t\\t\\tif (rest&(1 << i)) {\\n\\t\\t\\t\\t\\tneed += t.costs[i][now];\\n\\t\\t\\t\\t\\tnow = t.parent[i][now];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsum += max(0ll, need -p);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint rest = t.depth[x] - d;\\n\\t\\t\\tlong long int need = 0;\\n\\t\\t\\tint now = x;\\n\\t\\t\\tfor (int i = 0; i < 20; ++i) {\\n\\t\\t\\t\\tif (rest&(1 << i)) {\\n\\t\\t\\t\\t\\tneed += t.costs[i][now];\\n\\t\\t\\t\\t\\tnow = t.parent[i][now];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsum += need;\\n\\t\\t\\trest = d;\\n\\t\\t\\tneed = 0;\\n\\t\\t\\tfor (int i = 0; i < 20; ++i) {\\n\\t\\t\\t\\tif (rest&(1 << i)) {\\n\\t\\t\\t\\t\\tneed += t.costs[i][now];\\n\\t\\t\\t\\t\\tnow = t.parent[i][now];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsum += max(0ll, need - p);\\n\\t\\t}\\n\\t\\tcout << sum << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 66080,\n \"score_of_the_acc\": -1.5068,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2764_1661416\",\n \"code_snippet\": \"/*\\n * g.cc: \\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n\\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\nconst int MAX_D = 20;\\n\\ntypedef long long ll;\\n\\nconst int INF = 1 << 30;\\nconst ll LINF = 1LL << 60;\\n\\n/* typedef */\\n\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vpii;\\n\\nstruct Stat {\\n ll c;\\n int d, i;\\n Stat() {}\\n Stat(ll _c, int _d, int _i): c(_c), d(_d), i(_i) {}\\n bool operator<(const Stat &s) const {\\n return c > s.c || (c == s.c && d > s.d);\\n }\\n};\\n\\n/* global variables */\\n\\nint ts[MAX_N];\\nvpii nbrs[MAX_N];\\nll costs[MAX_N];\\nint dists[MAX_N], prts[MAX_N][MAX_D];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, m;\\n int tmp = scanf(\\\"%d%d\\\", &n, &m);\\n\\n for (int i = 0; i < n; i++) tmp = scanf(\\\"%d\\\", &ts[i]);\\n\\n for (int i = 0; i < m; i++) {\\n int ai, bi, ci;\\n tmp = scanf(\\\"%d%d%d\\\", &ai, &bi, &ci);\\n ai--, bi--;\\n nbrs[ai].push_back(pii(bi, ci));\\n nbrs[bi].push_back(pii(ai, ci));\\n }\\n\\n for (int i = 0; i < n; i++) costs[i] = LINF;\\n costs[0] = 0;\\n dists[0] = 0;\\n prts[0][0] = -1;\\n\\n priority_queue<Stat> q;\\n q.push(Stat(0, 0, 0));\\n\\n while (! q.empty()) {\\n Stat u = q.top(); q.pop();\\n if (costs[u.i] != u.c || dists[u.i] != u.d) continue;\\n\\n int vd = u.d + 1;\\n vpii &nbru = nbrs[u.i];\\n\\n for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\\n int &vi = vit->first;\\n ll vc = u.c + vit->second;\\n\\n if (costs[vi] > vc) {\\n\\tcosts[vi] = vc;\\n\\tdists[vi] = vd;\\n\\tprts[vi][0] = u.i;\\n\\tq.push(Stat(vc, vd, vi));\\n }\\n else if (costs[vi] == vc) {\\n\\tif (dists[vi] > vd) {\\n\\t dists[vi] = vd;\\n\\t prts[vi][0] = u.i;\\n\\t q.push(Stat(vc, vd, vi));\\n\\t}\\n\\telse if (dists[vi] == vd && ts[prts[vi][0]] > ts[u.i]) {\\n\\t prts[vi][0] = u.i;\\n\\t}\\n }\\n }\\n }\\n\\n for (int d = 1; d < MAX_D; d++)\\n for (int i = 0; i < n; i++) {\\n int j = prts[i][d - 1];\\n prts[i][d] = (j < 0) ? -1 : prts[j][d - 1];\\n }\\n\\n int k;\\n tmp = scanf(\\\"%d\\\", &k);\\n\\n while (k--) {\\n int xi, di, pi;\\n tmp = scanf(\\\"%d%d%d\\\", &xi, &di, &pi);\\n xi--;\\n\\n int r = dists[xi] - di;\\n int yi = xi;\\n //printf(\\\"xi=%d,di=%d,pi=%d: costs=%lld,dists=%d,r=%d\\\\n\\\",\\n //xi, di, pi, costs[xi], dists[xi], r);\\n\\n if (r > 0)\\n for (int d = MAX_D - 1; d >= 0; d--)\\n\\tif (r & (1 << d)) yi = prts[yi][d];\\n //printf(\\\" yi=%d\\\\n\\\", yi);\\n \\n ll cost = costs[xi] - costs[yi];\\n if (cost < costs[xi] - pi) cost = costs[xi] - pi;\\n\\n printf(\\\"%lld\\\\n\\\", cost);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 28244,\n \"score_of_the_acc\": -0.3214,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2764_1522948\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <complex>\\n#include <cassert>\\n#include <string>\\n#include <sstream>\\n#include <algorithm>\\n#include <numeric>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <iostream>\\n#include <map>\\n#include <set>\\nusing namespace std;\\ntypedef pair<int,int> P;\\ntypedef pair<P,int> T;\\ntypedef pair<T,int> F;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\n#define pu push\\n#define pb push_back\\n#define mp make_pair\\n#define eps 1e-9\\n#define INF 2000000000\\n#define sz(x) ((int)(x).size())\\n#define fi first\\n#define sec second\\n#define SORT(x) sort((x).begin(),(x).end())\\n#define all(x) (x).begin(),(x).end()\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)\\n#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)\\n#define EQ(a,b) (abs((a)-(b))<eps)\\nstruct edge\\n{\\n\\tint to,cost;\\n\\tedge(int to,int cost):to(to),cost(cost){}\\n};\\nint N,M,K;\\nint t[100100];\\nint day[100100],dist[100100];\\nint x[100100],d[100100],p[100100];\\nint par[100100][20];\\nvector<edge> G[100100];\\nbool used[100100];\\npriority_queue<F,vector<F>,greater<F> > q;\\nint ascend(int v,int k)\\n{\\n\\tfor(int i=19;i>=0;i--)\\n\\t{\\n\\t\\tif(k&(1<<i))v=par[v][i];\\n\\t}\\n\\treturn v;\\n}\\nint main()\\n{\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\tfor(int i=0;i<N;i++)scanf(\\\"%d\\\",&t[i]);\\n\\tfor(int i=0;i<M;i++)\\n\\t{\\n\\t\\tint a,b,c;\\n\\t\\tscanf(\\\"%d %d %d\\\",&a,&b,&c);\\n\\t\\ta--;b--;\\n\\t\\tG[a].pb(edge(b,c));\\n\\t\\tG[b].pb(edge(a,c));\\n\\t}\\n\\tscanf(\\\"%d\\\",&K);\\n\\tfor(int i=0;i<K;i++)\\n\\t{\\n\\t\\tscanf(\\\"%d %d %d\\\",&x[i],&d[i],&p[i]);\\n\\t\\tx[i]--;\\n\\t}\\n\\tmemset(used,false,sizeof(used));\\n\\tfor(int i=0;i<N;i++)day[i]=INF,dist[i]=INF;\\n\\tday[0]=0;dist[0]=0;\\n\\tq.push(F(T(P(0,0),t[0]),0));\\n\\tpar[0][0]=-1;\\n\\twhile(!q.empty())\\n\\t{\\n\\t\\tF a = q.top();\\n\\t\\tq.pop();\\n\\t\\tint v = a.sec;\\n\\t\\tint date = a.fi.fi.sec;\\n\\t\\tint dis = a.fi.fi.fi;\\n\\t\\tfor(int i=0;i<G[v].size();i++)\\n\\t\\t{\\n\\t\\t\\tedge e = G[v][i];\\n\\t\\t\\tif(dist[e.to]>dis+e.cost){\\n\\t\\t\\t\\tday[e.to]=date+1;\\n\\t\\t\\t\\tdist[e.to]=dis+e.cost;\\n\\t\\t\\t\\tpar[e.to][0]=v;\\n\\t\\t\\t\\tq.push(F(T(P(dist[e.to],day[e.to]),t[e.to]),e.to));\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif(dist[e.to]==dis+e.cost&&day[e.to]>date+1){\\n\\t\\t\\t\\tday[e.to]=date+1;\\n\\t\\t\\t\\tdist[e.to]=dis+e.cost;\\n\\t\\t\\t\\tpar[e.to][0]=v;\\n\\t\\t\\t\\tq.push(F(T(P(dist[e.to],day[e.to]),t[e.to]),e.to));\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif(dist[e.to]==dis+e.cost&&day[e.to]==date+1&&t[par[e.to][0]]>t[v]){\\n\\t\\t\\t\\tday[e.to]=date+1;\\n\\t\\t\\t\\tdist[e.to]=dis+e.cost;\\n\\t\\t\\t\\tpar[e.to][0]=v;\\n\\t\\t\\t\\tq.push(F(T(P(dist[e.to],day[e.to]),t[e.to]),e.to));\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t/*for(int i=0;i<N;i++)\\n\\t{\\n\\t\\tprintf(\\\"%d %d %d\\\\n\\\",day[i],dist[i],par[i][0]);\\n\\t}*/\\n\\tfor(int i=0;i<19;i++)\\n\\t{\\n\\t\\tfor(int v=0;v<N;v++)\\n\\t\\t{\\n\\t\\t\\tif(par[v][i]==-1)par[v][i+1]=-1;\\n\\t\\t\\telse par[v][i+1]=par[par[v][i]][i];\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<K;i++)\\n\\t{\\n\\t\\tif(day[x[i]]<=d[i])printf(\\\"%d\\\\n\\\",max(0,dist[x[i]]-p[i]));\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tint k = day[x[i]]-d[i];\\n\\t\\t\\tassert(k<=day[x[i]]);\\n\\t\\t\\tint y = ascend(x[i],k);\\n\\t\\t\\t//printf(\\\"y %d\\\\n\\\",y);\\n\\t\\t\\tif(dist[y]<=p[i])printf(\\\"%d\\\\n\\\",dist[x[i]]-dist[y]);\\n\\t\\t\\telse printf(\\\"%d\\\\n\\\",dist[x[i]]-p[i]);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 29144,\n \"score_of_the_acc\": -0.3156,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1657,"cells":{"group_id":{"kind":"string","value":"aoj_2763_cpp"},"problem_description":{"kind":"string","value":"F: みこみー文字列 - Miko Mi String -\n物語\nみっこみっこみ〜！みんなのアイドル，田澤みこみこ！今日は〜，みこと一緒に〜，文字列アルゴリズムの練習，しよ☆\nみこのとっておきの\nキャラ作り\n合言葉，「みっこみっこみ〜」は，ローマ字にすると “MikoMikoMi” になるみこ！つまり，\nA=\n“Mi”,\nB=\n“Ko” とすると，\nABABA\nの形で書けるってことなの！こんな風に，適切に\nA\nと\nB\nを決めると\nABABA\nの形に分解できる文字列のことを「みこみー文字列」って言うわ！文字列の名前にまでなっちゃうなんて，みこはみんなの人気者みこね！\nみんなでみこみー文字列をも〜っと使っていくために，与えられた文字列がみこみー文字列かどうか判定するプログラムを作ることにしたんだけど，みこ，FizzBuzzより長いプログラムなんて書けな〜い！だから〜，みこのために〜，みこみー文字列を判定するプログラムを書いて欲しいな☆\n……アンタ，いま寒いって言った！？\n問題\nアルファベット大文字・小文字からなる文字列\nS\nが与えられる．\nここで，\nS = ABABA\nと書けるような，空でない2つの文字列\nA, B\nが存在するならば，\nS\nは「みこみー文字列」であるという．\nこのとき，アルファベットの大文字と小文字は違う文字として区別するものとする．\n与えられた文字列がみこみー文字列であるかどうかを判定するプログラムを作成せよ．\n入力形式\n入力は文字列\nS\nを含む1行のみからなる．\nS\nは以下の条件を満たすと仮定してよい．\n1 ≤ |S| ≤ 10^6\n．ただし，\n|S|\nは文字列\nS\nの長さを表す．\nS\nは大文字，もしくは小文字のアルファベットのみからなる．\nなお，入力が非常に大きくなる場合があるため，入力の受け取りには高速な関数を用いることを推奨する．\n出力形式\nS\nがみこみー文字列であるならば，\nS = ABABA\nを満たすような\nA, B\nについて，“Love\nAB\n!”と出力せよ．ただし，複数の\nA, B\nの組が条件を満たす場合，\n|AB|\nが最小のものを出力せよ．\nS\nがみこみー文字列でないならば，“mitomerarenaiWA”と出力せよ．\n入力例1\nNicoNicoNi\n出力例1\nLove Nico!\n入力例2\nKashikoiKawaiiElichika\n出力例2\nmitomerarenaiWA\n入力例3\nLiveLiveL\n出力例3\nLove Live!\n入力例4\nAizunyanPeroPero\n出力例4\nmitomerarenaiWA\n入力例5\nAAAAAAAAAAAAAA\n出力例5\nLove AAAAA!"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2763_8469801","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2763.cc: Miko Mi String\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 1000000;\nconst int P = 4073;\nconst int MOD = 1000000009;\n\n/* typedef */\n\ntemplate<const int MOD>\nstruct MI {\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<MOD> mi;\n\n/* global variables */\n\nmi pes[MAX_N + 1], invpes[MAX_N + 1];\nchar s[MAX_N + 4];\nmi rh[MAX_N + 1];\n\n/* subroutines */\n\ninline void prep_rhash(int n) {\n pes[0] = invpes[0] = 1;\n pes[1] = P;\n invpes[1] = pes[1].inv();\n for (int i = 2; i <= n; i++) {\n pes[i] = pes[i - 1] * P;\n invpes[i] = invpes[i - 1] * invpes[1];\n }\n}\n\ninline int s2rh(mi rh[], const char s[]) {\n int k = 0;\n for (; s[k]; k++)\n rh[k + 1] = rh[k] + pes[k] * s[k];\n return k;\n}\n\ninline mi s2h(const char s[]) {\n mi h = 0;\n for (int k = 0; s[k]; k++) h += pes[k] * s[k];\n return h;\n}\n\ninline mi rhash(mi rh[], int i, int j) {\n return (rh[j] - rh[i]) * invpes[i];\n}\n\n/* main */\n\nint main() {\n prep_rhash(MAX_N);\n\n scanf(\"%s\", s);\n int n = s2rh(rh, s);\n \n for (int a = (n - 1) / 3; a >= 1; a--) {\n int m = n - a * 3;\n if (! (m & 1)) {\n int b = m / 2;\n mi ah0 = rhash(rh, 0, a);\n mi bh0 = rhash(rh, a, a + b);\n mi ah1 = rhash(rh, a + b, a * 2 + b);\n mi bh1 = rhash(rh, a * 2 + b, a * 2 + b * 2);\n mi ah2 = rhash(rh, a * 2 + b * 2, n);\n if (ah0 == ah1 && ah1 == ah2 && bh0 == bh1) {\n\tprintf(\"Love \");\n\tfor (int i = 0; i < a + b; i++) putchar(s[i]);\n\tputchar('!');\n\tputchar('\\n');\n\treturn 0;\n }\n }\n }\n\n puts(\"mitomerarenaiWA\");\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":15652,"score_of_the_acc":-0.2488,"final_rank":1},{"submission_id":"aoj_2763_8469792","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2763.cc: Miko Mi String\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 1000000;\nconst int P = 4073;\nconst int MOD = 1000000009;\n\n/* typedef */\n\ntemplate<const int MOD>\nstruct MI {\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<MOD> mi;\n\n/* global variables */\n\nmi pes[MAX_N + 1], invpes[MAX_N + 1];\nchar s[MAX_N + 4];\nmi rh[MAX_N + 1];\n\n/* subroutines */\n\ninline void prep_rhash(int n) {\n pes[0] = invpes[0] = 1;\n pes[1] = P;\n invpes[1] = pes[1].inv();\n for (int i = 2; i <= n; i++) {\n pes[i] = pes[i - 1] * P;\n invpes[i] = invpes[i - 1] * invpes[1];\n }\n}\n\ninline int s2rh(mi rh[], const char s[]) {\n int k = 0;\n for (; s[k]; k++)\n rh[k + 1] = rh[k] + pes[k] * s[k];\n return k;\n}\n\ninline mi s2h(const char s[]) {\n mi h = 0;\n for (int k = 0; s[k]; k++) h += pes[k] * s[k];\n return h;\n}\n\ninline mi rhash(mi rh[], int i, int j) {\n return (rh[j] - rh[i]) * invpes[i];\n}\n\n/* main */\n\nint main() {\n prep_rhash(MAX_N);\n\n scanf(\"%s\", s);\n int n = s2rh(rh, s);\n \n for (int a = n / 3; a >= 1; a--) {\n int m = n - a * 3;\n if (! (m & 1)) {\n int b = m / 2;\n mi ah0 = rhash(rh, 0, a);\n mi bh0 = rhash(rh, a, a + b);\n mi ah1 = rhash(rh, a + b, a * 2 + b);\n mi bh1 = rhash(rh, a * 2 + b, a * 2 + b * 2);\n mi ah2 = rhash(rh, a * 2 + b * 2, n);\n if (ah0 == ah1 && ah1 == ah2 && bh0 == bh1) {\n\tprintf(\"Love \");\n\tfor (int i = 0; i < a + b; i++) putchar(s[i]);\n\tputchar('!');\n\tputchar('\\n');\n\treturn 0;\n }\n }\n }\n\n puts(\"mitomerarenaiWA\");\n return 0;\n}","accuracy":0.4819277108433735,"time_ms":10,"memory_kb":15656,"score_of_the_acc":-0.2489,"final_rank":16},{"submission_id":"aoj_2763_8319005","code_snippet":"#include <iostream>\nusing namespace std;\n\nlong long mod = 2147483647;\nlong long N;\nlong long Pow[1 << 20];\nlong long Hash[1 << 20];\n\n// Hash value of [l, r]\nlong long Hash_Value(int l, int r) {\n\treturn (Hash[r] - Hash[l - 1] * Pow[r - l + 1] + mod * mod) % mod;\n}\n\nint main() {\n\t// Step 1. Init\n\tPow[0] = 1;\n\tfor (int i = 1; i <= 1000000; i++) Pow[i] = (233LL * Pow[i - 1]) % mod;\n\n\t// Step 2. Input\n\tstring S; cin >> S; N = S.size();\n\tfor (int i = 1; i <= N; i++) {\n\t\tlong long val = S[i - 1];\n\t\tHash[i] = (233LL * Hash[i - 1] + val) % mod;\n\t}\n\n\t// Step 3. Brute Force\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (3 * i <= N) continue;\n\t\tif (2 * i >= N) continue;\n\t\tint amari = N - 2 * i;\n\t\tlong long v1 = Hash_Value(1, i);\n\t\tlong long v2 = Hash_Value(i + 1, 2 * i);\n\t\tif (v1 != v2) continue;\n\t\tlong long u1 = Hash_Value(0 * i + 1, 0 * i + amari);\n\t\tlong long u2 = Hash_Value(1 * i + 1, 1 * i + amari);\n\t\tlong long u3 = Hash_Value(2 * i + 1, 2 * i + amari);\n\t\tif (u1 != u2 || u1 != u3 || u2 != u3) continue;\n\t\tcout << \"Love \" << S.substr(0, i) << \"!\" << endl;\n\t\treturn 0;\n\t}\n\n\t// Step 4. Output\n\tcout << \"mitomerarenaiWA\" << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":20876,"score_of_the_acc":-0.478,"final_rank":6},{"submission_id":"aoj_2763_5853002","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< 998244353 >;\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 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\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\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 = calc_mod(mt()) % 100000 + 1000;\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};\n\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n string s; cin >> s;\n RollingHash rh(s);\n\n int n = s.size();\n int mi = 1e9;\n for(int i=1; i<n; i++) {\n if((n-3*i) <= 0) break;\n if((n-3*i)%2 != 0) continue;\n\n int len1 = i, len2 = (n-3*i)/2;\n if(rh.get(0, len1) == rh.get(len1+len2, 2*len1+len2) && rh.get(len1+len2, 2*len1+len2) == rh.get(2*len1+2*len2, n) && rh.get(len1, len1+len2) == rh.get(2*len1+len2, 2*len1+2*len2)) {\n \n if(mi > len1 + len2) {\n mi = len1+len2;\n }\n }\n }\n if(mi == 1e9) {\n cout << \"mitomerarenaiWA\" << endl;\n }else{\n cout << \"Love \" << s.substr(0, mi) << \"!\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":20152,"score_of_the_acc":-0.4137,"final_rank":4},{"submission_id":"aoj_2763_5852979","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< 998244353 >;\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 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\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\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 = calc_mod(mt()) % 100000 + 1000;\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};\n\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n string s; cin >> s;\n RollingHash rh(s);\n\n int n = s.size();\n int mi = 1e9;\n for(int i=1; i<n; i++) {\n if((n-3*i) < 0) break;\n if((n-3*i)%2 != 0) continue;\n\n int len1 = i, len2 = (n-3*i)/2;\n if(rh.get(0, len1) == rh.get(len1+len2, 2*len1+len2) && rh.get(len1+len2, 2*len1+len2) == rh.get(2*len1+2*len2, n) && rh.get(len1, len1+len2) == rh.get(2*len1+len2, 2*len1+2*len2)) {\n \n if(mi > len1 + len2) {\n mi = len1+len2;\n }\n }\n }\n if(mi == 1e9) {\n cout << \"mitomerarenaiWA\" << endl;\n }else{\n cout << \"Love \" << s.substr(0, mi) << \"!\" << endl;\n }\n return 0;\n}","accuracy":0.4819277108433735,"time_ms":10,"memory_kb":20072,"score_of_the_acc":-0.4108,"final_rank":17},{"submission_id":"aoj_2763_5852970","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< 998244353 >;\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 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\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\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 static const int base1 = 1007, base2 = 2009;\n static const int mod1 = 1000000007, mod2 = 1000000009;\n vector<long long> hash1, hash2, power1, power2;\n int n;\n // construct\n RollingHash(const string &S) {\n n = (int)S.size();\n hash1.assign(n+1, 0);\n hash2.assign(n+1, 0);\n power1.assign(n+1, 1);\n power2.assign(n+1, 1);\n for (int i = 0; i < n; ++i) {\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\n hash2[i+1] = (hash2[i] * base2 + S[i]) % mod2;\n power1[i+1] = (power1[i] * base1) % mod1;\n power2[i+1] = (power2[i] * base2) % mod2;\n }\n }\n \n // get hash of S[left:right]\n inline pair<long long, long long> get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\n if (res1 < 0) res1 += mod1;\n long long res2 = hash2[r] - hash2[l] * power2[r-l] % mod2;\n if (res2 < 0) res2 += mod2;\n return {res1, res2};\n }\n \n inline pair<long long, long long> c_shift(int l) {\n auto h1 = get(0, l);\n auto h2 = get(l, n);\n return {(h1.first + h2.first * power1[l]) % mod1, (h1.second + h2.second * power2[l]) % mod2};\n }\n \n // get lcp of S[a:] and T[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n};\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n string s; cin >> s;\n RollingHash rh(s);\n\n int n = s.size();\n int mi = 1e9;\n for(int i=1; i<n; i++) {\n if((n-3*i) < 0) break;\n if((n-3*i)%2 != 0) continue;\n\n int len1 = i, len2 = (n-3*i)/2;\n if(rh.get(0, len1-1) == rh.get(len1+len2, 2*len1+len2-1) && rh.get(len1+len2, 2*len1+len2-1) == rh.get(2*len1+2*len2, n-1) && rh.get(len1, len1+len2-1) == rh.get(2*len1+len2, 2*len1+2*len2-1)) {\n \n if(mi > len1 + len2) {\n mi = len1+len2;\n }\n }\n }\n if(mi == 1e9) {\n cout << \"mitomerarenaiWA\" << endl;\n }else{\n cout << \"Love \" << s.substr(0, mi) << \"!\" << endl;\n }\n return 0;\n}","accuracy":0.5662650602409639,"time_ms":10,"memory_kb":35872,"score_of_the_acc":-0.9899,"final_rank":14},{"submission_id":"aoj_2763_5852962","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< 998244353 >;\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 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\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\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 static const int base1 = 1007, base2 = 2009;\n static const int mod1 = 1000000007, mod2 = 1000000009;\n vector<long long> hash1, hash2, power1, power2;\n int n;\n // construct\n RollingHash(const string &S) {\n n = (int)S.size();\n hash1.assign(n+1, 0);\n hash2.assign(n+1, 0);\n power1.assign(n+1, 1);\n power2.assign(n+1, 1);\n for (int i = 0; i < n; ++i) {\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\n hash2[i+1] = (hash2[i] * base2 + S[i]) % mod2;\n power1[i+1] = (power1[i] * base1) % mod1;\n power2[i+1] = (power2[i] * base2) % mod2;\n }\n }\n \n // get hash of S[left:right]\n inline pair<long long, long long> get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\n if (res1 < 0) res1 += mod1;\n long long res2 = hash2[r] - hash2[l] * power2[r-l] % mod2;\n if (res2 < 0) res2 += mod2;\n return {res1, res2};\n }\n \n inline pair<long long, long long> c_shift(int l) {\n auto h1 = get(0, l);\n auto h2 = get(l, n);\n return {(h1.first + h2.first * power1[l]) % mod1, (h1.second + h2.second * power2[l]) % mod2};\n }\n \n // get lcp of S[a:] and T[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n};\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n string s; cin >> s;\n RollingHash rh(s);\n\n int n = s.size();\n int mi = 1e9;\n for(int i=1; i<n; i++) {\n if((n-3*i) < 0) break;\n if((n-3*i)%2 != 0) continue;\n\n int len1 = i, len2 = (n-3*i)/2;\n if(rh.get(0, len1) == rh.get(len1+len2, 2*len1+len2) && rh.get(len1+len2, 2*len1+len2) == rh.get(2*len1+2*len2, n) && rh.get(len1, len1+len2) == rh.get(2*len1+len2, 2*len1+2*len2)) {\n \n if(mi > len1 + len2) {\n mi = len1+len2;\n }\n }\n }\n if(mi == 1e9) {\n cout << \"mitomerarenaiWA\" << endl;\n }else{\n cout << \"Love \" << s.substr(0, mi) << \"!\" << endl;\n }\n return 0;\n}","accuracy":0.4819277108433735,"time_ms":10,"memory_kb":35812,"score_of_the_acc":-0.9877,"final_rank":19},{"submission_id":"aoj_2763_5135928","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <random>\nusing namespace std;\n\n// source: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\nstruct rolling_hash{\n using lli = long long int;\n const lli MOD = (1LL << 61) -1;\n const lli MASK30 = (1LL << 30) -1;\n const lli MASK31 = (1LL << 31) -1;\n const lli MASK61 = (1LL << 61) -1;\n\n lli base;\n vector<lli> hash_table;\n vector<lli> base_pow;\n rolling_hash(const string& s){\n base = get_rand();\n int n = s.length();\n hash_table.assign(n+1, 0);\n base_pow.assign(n+1, 1);\n for(int i=0; i<n; i++){\n hash_table[i+1] = calc_mod(mul(hash_table[i], base) + s[i]);\n base_pow[i+1] = mul(base_pow[i], base);\n }\n }\n // calculate hash value of s[a:b]\n lli calc_hash(int a, int b){\n lli res = hash_table[b] -mul(hash_table[a], base_pow[b-a]);\n return (res>=0)? res: res+MOD; \n }\n\n // calculate a*b mod 2^61-1\n lli mul(lli a, lli b){\n lli au = a >> 31;\n lli al = a & MASK31;\n lli bu = b >> 31;\n lli bl = b & MASK31;\n lli mid = al*bu + au*bl;\n lli midu = mid >> 30;\n lli midl = mid & MASK30;\n return calc_mod(2*au*bu + midu+(midl<<31) + al*bl);\n }\n // calculate x mod 2^61-1\n lli calc_mod(lli x){\n lli xu = x >> 61;\n lli xl = x & MASK61;\n lli res = xu + xl;\n if(res >= MOD) res -= MOD;\n return res;\n }\n\n // generate random number\n lli get_rand(){\n std::random_device seed_gen;\n std::mt19937_64 rnd(seed_gen());\n return rnd() % MOD;\n }\n};\n\nint main(){\n string s;\n cin >> s;\n int n = s.length();\n rolling_hash rh(s);\n string ans = \"\";\n for(int i=1; i*3+2<=n; i++){\n int rem = n -3*i;\n if(rem%2 == 1) continue;\n int p[]={0, i, i+rem/2, 2*i+rem/2, 2*i+rem, n};\n long long int h[5];\n for(int i=0; i<5; i++){\n h[i] = rh.calc_hash(p[i], p[i+1]);\n }\n if(h[0]==h[2] and h[0]==h[4] and h[1]==h[3]){\n ans = s.substr(0, i+rem/2);\n }\n }\n if(ans == \"\"){\n cout << \"mitomerarenaiWA\" << endl;\n }else{\n cout << \"Love \" << ans << \"!\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":20692,"score_of_the_acc":-0.6977,"final_rank":7},{"submission_id":"aoj_2763_5018837","code_snippet":"#pragma region Macros\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 endl '\\n'\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;\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}\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(all(res), 0);\n sort(all(res), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\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); }\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}\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>>;\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#define i128 __int128_t\n#define ull unsigned long long int\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\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;\ntemplate <typename A, typename B>\nostream& operator <<(ostream& out, const pair<A, B>& a) {\nout << \"(\" << a.first << \",\" << a.second << \")\";\nreturn out;\n}\ntemplate <typename T, size_t N>\nostream& operator <<(ostream& out, const array<T, N>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T>\nostream& operator <<(ostream& out, const vector<T>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T, class Cmp>\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" :\", \"); out << v; first = 0;} out << \"}\";\nreturn out;\n}\ntemplate <typename U, typename T, class Cmp>\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& p : a) { out << (first ? \"\" : \", \"); out << p.first << \":\" << p.second; first = 0;} out << \"}\";\nreturn out;\n}\n// #define LOCAL\n#ifdef LOCAL\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define trace(...) 42\n#endif\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\ncerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\nconst char* comma = strchr(names + 1, ',');\ncerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n__f(comma + 1, args...);\n}\n#pragma endregion\n//#include<atcoder/all>\n//using namespace atcoder;\nstruct RollingHash {\n static const int base1 = 8973;\n static const int mod1 = 2016112121;\n vector<long long> hash1, power1;\n\n // construct\n RollingHash(const string &S) {\n int n = (int)S.size();\n hash1.assign(n+1, 0);\n power1.assign(n+1, 1);\n for (int i = 0; i < n; ++i) {\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\n power1[i+1] = (power1[i] * base1) % mod1;\n }\n }\n \n // get hash value of S[left:right]\n inline long long get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\n if (res1 < 0) res1 += mod1;\n return res1;\n }\n\n // get hash value of whole S\n inline long long get() const {\n return hash1.back();\n }\n\n // get lcp of S[a:] and S[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n\n // get lcp of S[a:] and T[b:]\n inline int getLCP(const RollingHash &T, int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != T.get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n};\nint main(){\n STR(s);\n RollingHash rh(s);\n int n = s.size();\n vector<int> ret;\n rep(i,n){\n if(!i)continue;\n int sizA = i;\n int sizB = n - i*3;\n if(sizB<= 0 || sizB%2 == 1)continue;\n sizB /= 2;\n vector<ll> A,B;\n A.pb(rh.get(0,sizA-1));\n B.pb(rh.get(sizA,sizA+sizB-1));\n A.pb(rh.get(sizA+sizB,2*sizA+sizB-1));\n B.pb(rh.get(2*sizA+sizB,2*sizA+2*sizB-1));\n A.pb(rh.get(2*sizA+2*sizB,n-1));\n sort(all(A));sort(all(B));\n auto check = [&](vector<ll> v){\n int k = v.size();\n ll ret = v[0];\n rep(i,k){\n if(ret != v[i])return false; \n }\n return true;\n };\n if(check(A) && check(B)){\n ret.pb(sizA+sizB);\n }\n }\n if(ret.size() == 0){\n cout << \"mitomerarenaiWA\" << endl;\n return 0;\n }\n sort(all(ret));\n trace(ret);\n string hoge = s.substr(0,ret[0]);\n cout << \"Love \" << hoge << '!' << endl;\n return 0;\n}","accuracy":0.5662650602409639,"time_ms":20,"memory_kb":20152,"score_of_the_acc":-0.4326,"final_rank":13},{"submission_id":"aoj_2763_5018831","code_snippet":"#pragma region Macros\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 endl '\\n'\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;\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}\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(all(res), 0);\n sort(all(res), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\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); }\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}\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>>;\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#define i128 __int128_t\n#define ull unsigned long long int\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\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;\ntemplate <typename A, typename B>\nostream& operator <<(ostream& out, const pair<A, B>& a) {\nout << \"(\" << a.first << \",\" << a.second << \")\";\nreturn out;\n}\ntemplate <typename T, size_t N>\nostream& operator <<(ostream& out, const array<T, N>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T>\nostream& operator <<(ostream& out, const vector<T>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T, class Cmp>\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" :\", \"); out << v; first = 0;} out << \"}\";\nreturn out;\n}\ntemplate <typename U, typename T, class Cmp>\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& p : a) { out << (first ? \"\" : \", \"); out << p.first << \":\" << p.second; first = 0;} out << \"}\";\nreturn out;\n}\n// #define LOCAL\n#ifdef LOCAL\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define trace(...) 42\n#endif\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\ncerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\nconst char* comma = strchr(names + 1, ',');\ncerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n__f(comma + 1, args...);\n}\n#pragma endregion\n//#include<atcoder/all>\n//using namespace atcoder;\nstruct RollingHash {\n static const int base1 = 8973;\n static const int mod1 = 2016112121;\n vector<long long> hash1, power1;\n\n // construct\n RollingHash(const string &S) {\n int n = (int)S.size();\n hash1.assign(n+1, 0);\n power1.assign(n+1, 1);\n for (int i = 0; i < n; ++i) {\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\n power1[i+1] = (power1[i] * base1) % mod1;\n }\n }\n \n // get hash value of S[left:right]\n inline long long get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\n if (res1 < 0) res1 += mod1;\n return res1;\n }\n\n // get hash value of whole S\n inline long long get() const {\n return hash1.back();\n }\n\n // get lcp of S[a:] and S[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n\n // get lcp of S[a:] and T[b:]\n inline int getLCP(const RollingHash &T, int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != T.get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n};\nint main(){\n STR(s);\n RollingHash rh(s);\n int n = s.size();\n vector<int> ret;\n rep(i,n){\n if(!i)continue;\n int sizA = i;\n int sizB = n - i*3;\n if(sizB<= 0 || sizB%2 == 1)continue;\n sizB /= 2;\n vector<ll> A,B;\n A.pb(rh.get(0,sizA-1));\n B.pb(rh.get(sizA,sizA+sizB-1));\n A.pb(rh.get(sizA+sizB,2*sizA+sizB-1));\n B.pb(rh.get(2*sizA+sizB,2*sizA+2*sizB-1));\n A.pb(rh.get(2*sizA+2*sizB,n-1));\n sort(all(A));sort(all(B));\n if(A.back() == A[0] && B.back() == B[0]){\n ret.pb(sizA+sizB);\n }\n }\n if(ret.size() == 0){\n cout << \"mitomerarenaiWA\" << endl;\n return 0;\n }\n sort(all(ret));\n trace(ret);\n string hoge = s.substr(0,ret[0]);\n cout << \"Love \" << hoge << '!' << endl;\n return 0;\n}","accuracy":0.5662650602409639,"time_ms":20,"memory_kb":19980,"score_of_the_acc":-0.4263,"final_rank":10},{"submission_id":"aoj_2763_5018826","code_snippet":"#pragma region Macros\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 endl '\\n'\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;\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}\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(all(res), 0);\n sort(all(res), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\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); }\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}\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>>;\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#define i128 __int128_t\n#define ull unsigned long long int\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\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;\ntemplate <typename A, typename B>\nostream& operator <<(ostream& out, const pair<A, B>& a) {\nout << \"(\" << a.first << \",\" << a.second << \")\";\nreturn out;\n}\ntemplate <typename T, size_t N>\nostream& operator <<(ostream& out, const array<T, N>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T>\nostream& operator <<(ostream& out, const vector<T>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T, class Cmp>\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" :\", \"); out << v; first = 0;} out << \"}\";\nreturn out;\n}\ntemplate <typename U, typename T, class Cmp>\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& p : a) { out << (first ? \"\" : \", \"); out << p.first << \":\" << p.second; first = 0;} out << \"}\";\nreturn out;\n}\n// #define LOCAL\n#ifdef LOCAL\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define trace(...) 42\n#endif\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\ncerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\nconst char* comma = strchr(names + 1, ',');\ncerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n__f(comma + 1, args...);\n}\n#pragma endregion\n//#include<atcoder/all>\n//using namespace atcoder;\nstruct RollingHash {\n static const int base1 = 8973;\n static const int mod1 = 1000000007;\n vector<long long> hash1, power1;\n\n // construct\n RollingHash(const string &S) {\n int n = (int)S.size();\n hash1.assign(n+1, 0);\n power1.assign(n+1, 1);\n for (int i = 0; i < n; ++i) {\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\n power1[i+1] = (power1[i] * base1) % mod1;\n }\n }\n \n // get hash value of S[left:right]\n inline long long get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\n if (res1 < 0) res1 += mod1;\n return res1;\n }\n\n // get hash value of whole S\n inline long long get() const {\n return hash1.back();\n }\n\n // get lcp of S[a:] and S[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n\n // get lcp of S[a:] and T[b:]\n inline int getLCP(const RollingHash &T, int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != T.get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n};\nint main(){\n STR(s);\n RollingHash rh(s);\n int n = s.size();\n vector<int> ret;\n rep(i,n){\n if(!i)continue;\n int sizA = i;\n int sizB = n - i*3;\n if(sizB<= 0 || sizB%2 == 1)continue;\n sizB /= 2;\n vector<ll> A,B;\n A.pb(rh.get(0,sizA-1));\n B.pb(rh.get(sizA,sizA+sizB-1));\n A.pb(rh.get(sizA+sizB,2*sizA+sizB-1));\n B.pb(rh.get(2*sizA+sizB,2*sizA+2*sizB-1));\n A.pb(rh.get(2*sizA+2*sizB,n-1));\n sort(all(A));sort(all(B));\n if(A.back() == A[0] && B.back() == B[0]){\n ret.pb(sizA+sizB);\n }\n }\n if(ret.size() == 0){\n cout << \"mitomerarenaiWA\" << endl;\n return 0;\n }\n sort(all(ret));\n trace(ret);\n string hoge = s.substr(0,ret[0]);\n cout << \"Love \" << hoge << '!' << endl;\n return 0;\n}","accuracy":0.5662650602409639,"time_ms":20,"memory_kb":20124,"score_of_the_acc":-0.4316,"final_rank":12},{"submission_id":"aoj_2763_5018825","code_snippet":"#pragma region Macros\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 endl '\\n'\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;\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}\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(all(res), 0);\n sort(all(res), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\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); }\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}\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>>;\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#define i128 __int128_t\n#define ull unsigned long long int\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\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;\ntemplate <typename A, typename B>\nostream& operator <<(ostream& out, const pair<A, B>& a) {\nout << \"(\" << a.first << \",\" << a.second << \")\";\nreturn out;\n}\ntemplate <typename T, size_t N>\nostream& operator <<(ostream& out, const array<T, N>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T>\nostream& operator <<(ostream& out, const vector<T>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T, class Cmp>\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" :\", \"); out << v; first = 0;} out << \"}\";\nreturn out;\n}\ntemplate <typename U, typename T, class Cmp>\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& p : a) { out << (first ? \"\" : \", \"); out << p.first << \":\" << p.second; first = 0;} out << \"}\";\nreturn out;\n}\n// #define LOCAL\n#ifdef LOCAL\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define trace(...) 42\n#endif\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\ncerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\nconst char* comma = strchr(names + 1, ',');\ncerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n__f(comma + 1, args...);\n}\n#pragma endregion\n//#include<atcoder/all>\n//using namespace atcoder;\nstruct RollingHash {\n static const int base1 = 1007;\n static const int mod1 = 1000000007;\n vector<long long> hash1, power1;\n\n // construct\n RollingHash(const string &S) {\n int n = (int)S.size();\n hash1.assign(n+1, 0);\n power1.assign(n+1, 1);\n for (int i = 0; i < n; ++i) {\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\n power1[i+1] = (power1[i] * base1) % mod1;\n }\n }\n \n // get hash value of S[left:right]\n inline long long get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\n if (res1 < 0) res1 += mod1;\n return res1;\n }\n\n // get hash value of whole S\n inline long long get() const {\n return hash1.back();\n }\n\n // get lcp of S[a:] and S[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n\n // get lcp of S[a:] and T[b:]\n inline int getLCP(const RollingHash &T, int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != T.get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n};\nint main(){\n STR(s);\n RollingHash rh(s);\n int n = s.size();\n vector<int> ret;\n rep(i,n){\n if(!i)continue;\n int sizA = i;\n int sizB = n - i*3;\n if(sizB<= 0 || sizB%2 == 1)continue;\n sizB /= 2;\n vector<ll> A,B;\n A.pb(rh.get(0,sizA-1));\n B.pb(rh.get(sizA,sizA+sizB-1));\n A.pb(rh.get(sizA+sizB,2*sizA+sizB-1));\n B.pb(rh.get(2*sizA+sizB,2*sizA+2*sizB-1));\n A.pb(rh.get(2*sizA+2*sizB,n-1));\n sort(all(A));sort(all(B));\n if(A.back() == A[0] && B.back() == B[0]){\n ret.pb(sizA+sizB);\n }\n }\n if(ret.size() == 0){\n cout << \"mitomerarenaiWA\" << endl;\n return 0;\n }\n sort(all(ret));\n trace(ret);\n string hoge = s.substr(0,ret[0]);\n cout << \"Love \" << hoge << '!' << endl;\n return 0;\n}","accuracy":0.5662650602409639,"time_ms":20,"memory_kb":20024,"score_of_the_acc":-0.4279,"final_rank":11},{"submission_id":"aoj_2763_4549691","code_snippet":"#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#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\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; }\n// ---------------------------------------------------------------------------\n\nvector<int> Z_algorithm(string S){\n int c=0,n=S.size();\n vector<int> Z(n,0);\n for(int i=1; i<n; i++){\n int l = i-c;\n if(i+Z[l] < c+Z[c]){\n Z[i] = Z[l];\n }else{\n int j = max(0, c+Z[c]-i);\n while(i+j<n && S[j]==S[i+j]) j++;\n Z[i] = j;\n c = i;\n }\n }\n Z[0] = n;\n return Z;\n}\n\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n string S;\n cin >> S;\n vector<int> Z = Z_algorithm(S);\n int N = S.size();\n // ABを入れる\n string ans = \"-\";\n for(int i=N-1; i>=1; i--){\n // 後ろがAになるか判定\n if(Z[i] == N-i){\n // Bの文字列の長さ\n // これB*2の長さ\n int B = (i-1)-Z[i]+1-Z[i];\n if(B <= 0) continue;\n if(B%2 == 0){\n // Bの長さ\n B /= 2;\n if(Z[Z[i]+B] >= Z[i]+B){\n // 条件満たす\n // cout << i << \" \" << Z[i]+B << \"\\n\";\n if(ans == \"-\"){\n ans = S.substr(0,Z[i]+B);\n }else{\n if(ans.size() > Z[i]+B){\n ans = S.substr(0,Z[i]+B);\n }\n }\n }\n }\n }\n }\n if(ans == \"-\"){\n cout << \"mitomerarenaiWA\" << \"\\n\";\n }else{\n cout << \"Love \" << ans << \"!\" << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":8864,"score_of_the_acc":-0.3962,"final_rank":2},{"submission_id":"aoj_2763_4549416","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;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000007LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\ntemplate< unsigned mod >\nstruct RollingHash {\n vector< unsigned > hashed, power;\n\n inline unsigned mul(unsigned a, unsigned b) const {\n unsigned long long x = (unsigned long long) a * b;\n unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;\n asm(\"divl %4; \\n\\t\" : \"=a\" (d), \"=d\" (m) : \"d\" (xh), \"a\" (xl), \"r\" (mod));\n return m;\n }\n\n RollingHash(const string &s, unsigned base = 10007) {\n int sz = (int) s.size();\n hashed.assign(sz + 1, 0);\n power.assign(sz + 1, 0);\n power[0] = 1;\n for(int i = 0; i < sz; i++) {\n power[i + 1] = mul(power[i], base);\n hashed[i + 1] = mul(hashed[i], base) + s[i];\n if(hashed[i + 1] >= mod) hashed[i + 1] -= mod;\n }\n }\n\n unsigned get(int l, int r) const {\n unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);\n if(ret >= mod) ret -= mod;\n return ret;\n }\n\n unsigned connect(unsigned h1, int h2, int h2len) const {\n unsigned ret = mul(h1, power[h2len]) + h2;\n if(ret >= mod) ret -= mod;\n return ret;\n }\n\n int LCP(const RollingHash< mod > &b, int l1, int r1, int l2, int r2) {\n int len = min(r1 - l1, r2 - l2);\n int low = -1, high = len + 1;\n while(high - low > 1) {\n int mid = (low + high) / 2;\n if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;\n else high = mid;\n }\n return (low);\n }\n};\n\nusing RH = RollingHash< 1000000007 >;\n\n\nint main() {\n \n string s; cin >> s;\n int n = s.size();\n string ans = \"\";\n int val = inf;\n\n\n RH rh(s);\n for (int A = 1; A <= n; A++) {\n int rest = n - 3 * A;\n if (rest <= 0) continue;\n if (rest % 2 != 0) continue;\n int B = rest / 2;\n\n if (rh.get(0, A) == rh.get(A + B, A + B + A) \n and rh.get(0, A) == rh.get(2 * A + 2 * B, 2 * A + 2 * B + A) \n and rh.get(A, A + B) == rh.get(2 * A + B, 2 * A + B + B)) {\n\n string a = s.substr(0, A);\n string b = s.substr(A, B);\n if (A + B < val) {\n ans = \"Love \" + a + b + \"!\";\n val = A + B;\n }\n }\n }\n\n\n if (ans == \"\") {\n cout << \"mitomerarenaiWA\" << endl;\n } else {\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":540,"memory_kb":13828,"score_of_the_acc":-1.1819,"final_rank":9},{"submission_id":"aoj_2763_4549349","code_snippet":"#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#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\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; }\n// ---------------------------------------------------------------------------\n\nvector<int> Z_algorithm(string S){\n int c=0,n=S.size();\n vector<int> Z(n,0);\n for(int i=1; i<n; i++){\n int l = i-c;\n if(i+Z[l] < c+Z[c]){\n Z[i] = Z[l];\n }else{\n int j = max(0, c+Z[c]-i);\n while(i+j<n && S[j]==S[i+j]) j++;\n Z[i] = j;\n c = i;\n }\n }\n Z[0] = n;\n return Z;\n}\n\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n string S;\n cin >> S;\n vector<int> Z = Z_algorithm(S);\n int N = S.size();\n // ABを入れる\n string ans = \"-\";\n for(int i=N-1; i>=1; i--){\n // 後ろがAになるか判定\n if(Z[i] == N-i){\n // Bの文字列の長さ\n // これB*2の長さ\n int B = (i-1)-Z[i]+1-Z[i];\n if(B <= 0) continue;\n if(B%2 == 0){\n // Bの長さ\n B /= 2;\n if(Z[Z[i]+B] >= Z[i]+B){\n // 条件満たす\n // cout << i << \" \" << Z[i]+B << \"\\n\";\n if(ans == \"-\"){\n ans = S.substr(0,Z[i]+B);\n }else{\n if(ans.size() > Z[i]+B){\n ans = S.substr(0,Z[i]+B);\n }\n }\n }\n }\n }\n }\n if(ans == \"-\"){\n cout << \"mitomerarenaiWA\" << \"\\n\";\n }else{\n cout << \"Love \" << ans << \"!\" << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":8940,"score_of_the_acc":-0.399,"final_rank":3},{"submission_id":"aoj_2763_4246987","code_snippet":"#include <bits/stdc++.h>\nusing namespace std::literals::string_literals;\nusing i64 = std::int_fast64_t;\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::cin;\n\ntemplate<typename T>\nstd::vector<T> make_v(size_t a){return std::vector<T>(a);}\n\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts){\n return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\n\n#include <vector>\n#include <string>\n\nclass rolling_hash {\npublic:\n\tusing u64 = std::uint_fast64_t;\n\tusing size_type = std::uint_fast32_t;\n\n\tstatic constexpr u64 MOD = (1uL << 61) - 1;\n\tstatic constexpr u64 base = 20200213;\n\n\tstd::string str;\n\tstd::vector<u64> hash_, pow;\n\nprivate:\n\tstatic constexpr u64 mask30 = (1ul << 30) - 1;\n\tstatic constexpr u64 mask31 = (1ul << 31) - 1;\n\n\tu64 mul(u64 a, u64 b) const {\n\t\tu64 au = a >> 31;\n\t\tu64 ad = a & mask31;\n\t\tu64 bu = b >> 31;\n\t\tu64 bd = b & mask31;\n\t\tu64 mid = ad * bu + au * bd;\n\t\tu64 midu = mid >> 30;\n\t\tu64 midd = mid & mask30;\n\t\treturn apply(au * bu * 2 + midu + (midd << 31) + ad * bd);\n\t}\n\tu64 apply(u64 val) const {\n\t\tval = (val & MOD) + (val >> 61);\n\t\tif(val >= MOD) val -= MOD;\n\t\treturn val;\n\t}\n\tsize_type xorshift(size_type x) const {\n\t\tx ^= x << 13;\n\t\tx ^= x >> 17;\n\t\tx ^= x << 5;\n\t\treturn x;\n\t}\n\npublic:\n\trolling_hash(const rolling_hash &) = default;\n\trolling_hash(rolling_hash&&) = default;\n\n\trolling_hash() : str() {};\n\trolling_hash(const std::string & str) : str(str) {\n\t\thash_.resize(str.size() + 1, 0);\n\t\tpow.resize(str.size() + 1, 1);\n\t\tfor(size_type i = 0; i < str.size(); i++) {\n\t\t\thash_[i + 1] = mul(hash_[i], base) + xorshift(str[i] + 1);\n\t\t\tpow[i + 1] = mul(pow[i], base);\n\t\t\tif(hash_[i + 1] >= MOD) hash_[i + 1] -= MOD;\n\t\t}\n\t}\n\n\tu64 hash() const { return hash_.back(); }\n\tu64 hash(size_type l, size_type r) const {\n\t\tu64 ret = MOD + hash_[r] - mul(hash_[l], pow[r - l]);\n\t\treturn ret < MOD ? ret : ret - MOD;\n\t}\n\t\n\tsize_type size() const { return str.size(); }\n};\n\nint main() {\n\tstd::string s; cin >> s;\n\n\trolling_hash hash(s);\n\tfor(int i = (int)s.size(); i > 0; i--) {\n\t\tint A = i;\n\t\tint B = (int)s.size() - 3 * A;\n\t\tif(A <= 0 or B <= 0 or B & 1) continue; B /= 2;\n\n\t\ti64 X = hash.hash(0, A);\n\t\ti64 Y = hash.hash(A, A + B);\n\t\tif(X != hash.hash(A + B, A + B + A)) continue;\n\t\tif(Y != hash.hash(A + B + A, A + B + A + B)) continue;\n\t\tif(X != hash.hash(A + B + A + B, A + B + A + B + A)) continue;\n\n\t\tprintf(\"Love %s!\\n\", s.substr(0, A + B).c_str());\n\t\treturn 0;\n\t}\n\tprintf(\"mitomerarenaiWA\\n\");\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":20040,"score_of_the_acc":-0.4474,"final_rank":5},{"submission_id":"aoj_2763_4246974","code_snippet":"#include <bits/stdc++.h>\nusing namespace std::literals::string_literals;\nusing i64 = std::int_fast64_t;\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::cin;\n\ntemplate<typename T>\nstd::vector<T> make_v(size_t a){return std::vector<T>(a);}\n\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts){\n return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\n\n#include <vector>\n#include <string>\n\nclass rolling_hash {\npublic:\n\tusing u64 = std::uint_fast64_t;\n\tusing size_type = std::uint_fast32_t;\n\n\tstatic constexpr u64 MOD = (1uL << 61) - 1;\n\tstatic constexpr u64 base = 20200213;\n\n\tstd::string str;\n\tstd::vector<u64> hash_, pow;\n\nprivate:\n\tstatic constexpr u64 mask30 = (1ul << 30) - 1;\n\tstatic constexpr u64 mask31 = (1ul << 31) - 1;\n\n\tu64 mul(u64 a, u64 b) const {\n\t\tu64 au = a >> 31;\n\t\tu64 ad = a & mask31;\n\t\tu64 bu = b >> 31;\n\t\tu64 bd = b & mask31;\n\t\tu64 mid = ad * bu + au * bd;\n\t\tu64 midu = mid >> 30;\n\t\tu64 midd = mid & mask30;\n\t\treturn apply(au * bu * 2 + midu + (midd << 31) + ad * bd);\n\t}\n\tu64 apply(u64 val) const {\n\t\tval = (val & MOD) + (val >> 61);\n\t\tif(val >= MOD) val -= MOD;\n\t\treturn val;\n\t}\n\tsize_type xorshift(size_type x) const {\n\t\tx ^= x << 13;\n\t\tx ^= x >> 17;\n\t\tx ^= x << 5;\n\t\treturn x;\n\t}\n\npublic:\n\trolling_hash(const rolling_hash &) = default;\n\trolling_hash(rolling_hash&&) = default;\n\n\trolling_hash() : str() {};\n\trolling_hash(const std::string & str) : str(str) {\n\t\thash_.resize(str.size() + 1, 0);\n\t\tpow.resize(str.size() + 1, 1);\n\t\tfor(size_type i = 0; i < str.size(); i++) {\n\t\t\thash_[i + 1] = mul(hash_[i], base) + xorshift(str[i] + 1);\n\t\t\tpow[i + 1] = mul(pow[i], base);\n\t\t\tif(hash_[i + 1] >= MOD) hash_[i + 1] -= MOD;\n\t\t}\n\t}\n\n\tu64 hash() const { return hash_.back(); }\n\tu64 hash(size_type l, size_type r) const {\n\t\tu64 ret = MOD + hash_[r] - mul(hash_[l], pow[r - l]);\n\t\treturn ret < MOD ? ret : ret - MOD;\n\t}\n\t\n\tsize_type size() const { return str.size(); }\n};\n\nint main() {\n\tstd::string s; cin >> s;\n\n\trolling_hash hash(s);\n\tfor(int i = (int)s.size(); i >= 0; i--) {\n\t\tint A = i;\n\t\tint B = (int)s.size() - 3 * A;\n\t\tif(A < 0 or B < 0 or B & 1) continue; B /= 2;\n\n\t\ti64 X = hash.hash(0, A);\n\t\ti64 Y = hash.hash(A, A + B);\n\t\tif(X != hash.hash(A + B, A + B + A)) continue;\n\t\tif(Y != hash.hash(A + B + A, A + B + A + B)) continue;\n\t\tif(X != hash.hash(A + B + A + B, A + B + A + B + A)) continue;\n\n\t\tprintf(\"Love %s!\\n\", s.substr(0, A + B).c_str());\n\t\treturn 0;\n\t}\n\tprintf(\"mitomerarenaiWA\\n\");\n\treturn 0;\n}","accuracy":0.4578313253012048,"time_ms":30,"memory_kb":20088,"score_of_the_acc":-0.4491,"final_rank":20},{"submission_id":"aoj_2763_4246973","code_snippet":"#include <bits/stdc++.h>\nusing namespace std::literals::string_literals;\nusing i64 = std::int_fast64_t;\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::cin;\n\ntemplate<typename T>\nstd::vector<T> make_v(size_t a){return std::vector<T>(a);}\n\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts){\n return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\n\n#include <vector>\n#include <string>\n\nclass rolling_hash {\npublic:\n\tusing u64 = std::uint_fast64_t;\n\tusing size_type = std::uint_fast32_t;\n\n\tstatic constexpr u64 MOD = (1uL << 61) - 1;\n\tstatic constexpr u64 base = 20200213;\n\n\tstd::string str;\n\tstd::vector<u64> hash_, pow;\n\nprivate:\n\tstatic constexpr u64 mask30 = (1ul << 30) - 1;\n\tstatic constexpr u64 mask31 = (1ul << 31) - 1;\n\n\tu64 mul(u64 a, u64 b) const {\n\t\tu64 au = a >> 31;\n\t\tu64 ad = a & mask31;\n\t\tu64 bu = b >> 31;\n\t\tu64 bd = b & mask31;\n\t\tu64 mid = ad * bu + au * bd;\n\t\tu64 midu = mid >> 30;\n\t\tu64 midd = mid & mask30;\n\t\treturn apply(au * bu * 2 + midu + (midd << 31) + ad * bd);\n\t}\n\tu64 apply(u64 val) const {\n\t\tval = (val & MOD) + (val >> 61);\n\t\tif(val >= MOD) val -= MOD;\n\t\treturn val;\n\t}\n\tsize_type xorshift(size_type x) const {\n\t\tx ^= x << 13;\n\t\tx ^= x >> 17;\n\t\tx ^= x << 5;\n\t\treturn x;\n\t}\n\npublic:\n\trolling_hash(const rolling_hash &) = default;\n\trolling_hash(rolling_hash&&) = default;\n\n\trolling_hash() : str() {};\n\trolling_hash(const std::string & str) : str(str) {\n\t\thash_.resize(str.size() + 1, 0);\n\t\tpow.resize(str.size() + 1, 1);\n\t\tfor(size_type i = 0; i < str.size(); i++) {\n\t\t\thash_[i + 1] = mul(hash_[i], base) + xorshift(str[i] + 1);\n\t\t\tpow[i + 1] = mul(pow[i], base);\n\t\t\tif(hash_[i + 1] >= MOD) hash_[i + 1] -= MOD;\n\t\t}\n\t}\n\n\tu64 hash() const { return hash_.back(); }\n\tu64 hash(size_type l, size_type r) const {\n\t\tu64 ret = MOD + hash_[r] - mul(hash_[l], pow[r - l]);\n\t\treturn ret < MOD ? ret : ret - MOD;\n\t}\n\t\n\tsize_type size() const { return str.size(); }\n};\n\nint main() {\n\tstd::string s; cin >> s;\n\n\trolling_hash hash(s);\n\tfor(int i = (int)s.size() - 1; i >= 0; i--) {\n\t\tint A = i + 1;\n\t\tint B = (int)s.size() - 3 * A;\n\t\tif(A < 0 or B < 0 or B & 1) continue; B /= 2;\n\n\t\ti64 X = hash.hash(0, A);\n\t\ti64 Y = hash.hash(A, A + B);\n\t\tif(X != hash.hash(A + B, A + B + A)) continue;\n\t\tif(Y != hash.hash(A + B + A, A + B + A + B)) continue;\n\t\tif(X != hash.hash(A + B + A + B, A + B + A + B + A)) continue;\n\n\t\tprintf(\"Love %s!\\n\", s.substr(0, A + B).c_str());\n\t\treturn 0;\n\t}\n\tprintf(\"mitomerarenaiWA\\n\");\n\treturn 0;\n}","accuracy":0.4819277108433735,"time_ms":30,"memory_kb":19996,"score_of_the_acc":-0.4457,"final_rank":18},{"submission_id":"aoj_2763_3736602","code_snippet":"#include \"iostream\"\n#include \"random\"\n#include \"string\"\n#include \"bitset\"\n#include \"algorithm\"\n#include \"map\"\n#include \"queue\"\n#include \"list\"\n#include \"set\"\n#include \"climits\"\n#include \"iomanip\"\n#include \"stack\"\n#include \"functional\"\n\nusing namespace std;\nusing ll = long long int;\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n\nstruct rollingHash {\n ll mo[2] = {1000000007, 1000000009};\n ll base[2] = {1009, 1007};\n vector<ll> hash[2], power[2];\n rollingHash() {}\n rollingHash(string s) {\n hash[0].resize(s.size()+1); hash[1].resize(s.size()+1);\n power[0].resize(s.size()+1); power[1].resize(s.size()+1);\n init(s);\n }\n inline ll mul(ll a, ll b, ll md) const {\n return a * b % md;\n // unsigned long long y = a*b;\n // unsigned xh = (unsigned)(y>>32), xl = (unsigned)y, d, m;\n // asm(\n // \"divl %4; \\n\\t\"\n // : \"=a\" (d), \"=d\" (m)\n // : \"d\" (xh), \"a\" (xl), \"r\" (md)\n // );\n // return a;\n }\n // O(|S|)\n void init(string s) {\n REP(i, 2) {\n power[i][0] = 1;\n FOR(j, 1, s.size()+1) power[i][j] = mul(power[i][j-1], base[i], mo[i]);\n }\n // 1-indexの累積和\n REP(i, 2) REP(j, s.size()) {\n hash[i][j+1] = (hash[i][j]+mul(power[i][j], s[j], mo[i]))%mo[i];\n }\n }\n // [l1,r1) と [l2,r2) が一致するか\n bool equal(int l1, int r1, int l2, int r2) {\n REP(i, 2) {\n ll a = (hash[i][r1]-hash[i][l1]+mo[i])%mo[i];\n ll b = (hash[i][r2]-hash[i][l2]+mo[i])%mo[i];\n if(mul(a,power[i][l2-l1],mo[i]) != b) return false;\n }\n return true;\n }\n // [l,r)\n PII get(int l, int r) {\n PII ret;\n ret.first = (hash[0][r]-hash[0][l]+mo[0])%mo[0];\n ret.first = mul(ret.first, power[0][hash[0].size()-1-l], mo[0]);\n ret.second = (hash[1][r]-hash[1][l]+mo[1])%mo[1];\n ret.second = mul(ret.second, power[1][hash[1].size()-1-l], mo[1]);\n return ret;\n }\n};\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tstring s;\n\tcin >> s;\n\n\tconst ll INF = 1LL << 30;\n\tll ans = INF;\n\trollingHash hash(s);\n\tfor (ll i = 1; i <= s.size(); ++i) {\n\t\tll len = (ll)s.size() - i * 3;\n\t\tif (len <= 0 || len % 2) continue;\n\t\tlen /= 2;\n\t\tll idx1 = i - 1, idx2 = i + len - 1, idx3 = 2 * i + len - 1, idx4 = 2 * i + 2 * len - 1;\n\t\tif (hash.equal(0, idx1, idx2 + 1, idx3) && hash.equal(idx2 + 1, idx3, idx4 + 1, s.size() - 1) && hash.equal(idx1 + 1, idx2, idx3 + 1, idx4)) {\n\t\t\tif (ans > i + len) {\n\t\t\t\tans = i + len;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (ans == INF) cout << \"mitomerarenaiWA\" << endl;\n\telse cout << \"Love \" << s.substr(0, ans) << \"!\" << endl;\n}","accuracy":0.5662650602409639,"time_ms":90,"memory_kb":36148,"score_of_the_acc":-1.1509,"final_rank":15},{"submission_id":"aoj_2763_3718739","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nstruct RollingHash {\n const int base = 10007;\n static const int M = 2;\n const vector<int> mod = {999999937, 1000000007};\n vector<long long> hash[M], power[M];\n RollingHash(const string &s, int base = 9973) : base(base) {\n int n = s.size();\n for (int iter = 0; iter < M; ++iter) {\n hash[iter].assign(n + 1, 0);\n power[iter].assign(n + 1, 1);\n for (int i = 0; i < n; ++i) {\n hash[iter][i + 1] = (hash[iter][i] * base + s[i]) % mod[iter];\n power[iter][i + 1] = power[iter][i] * base % mod[iter];\n }\n }\n }\n long long get(int l, int r, int id = 0) { // [l, r)\n long long ret = hash[id][r] - hash[id][l] * power[id][r-l] % mod[id];\n return (ret < 0 ? ret + mod[id] : ret);\n }\n};\n\nint main() {\n string s;\n while (cin >> s) {\n RollingHash rh(s);\n int n = s.size();\n int ans = n;\n int a = n % 2 == 0 ? 2 : 1;\n int b = n % 2 == 0 ? n / 2 - 1 : n / 2;\n int c = b + a;\n int d = n - a;\n while (a < b) {\n long long A = rh.get(0, a);\n if (rh.get(b, c) == A && rh.get(d, n) == A && rh.get(a, b) == rh.get(c, d)) {\n ans = min(ans, b);\n }\n a += 2; b -= 1; c += 1; d -= 2;\n }\n if (ans != n) {\n cout << \"Love \" << s.substr(0, ans) << '!' << endl;\n } else {\n cout << \"mitomerarenaiWA\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":35664,"score_of_the_acc":-1.0577,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2763_8469801\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2763.cc: Miko Mi String\\n */\\n\\n#include<cstdio>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 1000000;\\nconst int P = 4073;\\nconst int MOD = 1000000009;\\n\\n/* typedef */\\n\\ntemplate<const int MOD>\\nstruct MI {\\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<MOD> mi;\\n\\n/* global variables */\\n\\nmi pes[MAX_N + 1], invpes[MAX_N + 1];\\nchar s[MAX_N + 4];\\nmi rh[MAX_N + 1];\\n\\n/* subroutines */\\n\\ninline void prep_rhash(int n) {\\n pes[0] = invpes[0] = 1;\\n pes[1] = P;\\n invpes[1] = pes[1].inv();\\n for (int i = 2; i <= n; i++) {\\n pes[i] = pes[i - 1] * P;\\n invpes[i] = invpes[i - 1] * invpes[1];\\n }\\n}\\n\\ninline int s2rh(mi rh[], const char s[]) {\\n int k = 0;\\n for (; s[k]; k++)\\n rh[k + 1] = rh[k] + pes[k] * s[k];\\n return k;\\n}\\n\\ninline mi s2h(const char s[]) {\\n mi h = 0;\\n for (int k = 0; s[k]; k++) h += pes[k] * s[k];\\n return h;\\n}\\n\\ninline mi rhash(mi rh[], int i, int j) {\\n return (rh[j] - rh[i]) * invpes[i];\\n}\\n\\n/* main */\\n\\nint main() {\\n prep_rhash(MAX_N);\\n\\n scanf(\\\"%s\\\", s);\\n int n = s2rh(rh, s);\\n \\n for (int a = (n - 1) / 3; a >= 1; a--) {\\n int m = n - a * 3;\\n if (! (m & 1)) {\\n int b = m / 2;\\n mi ah0 = rhash(rh, 0, a);\\n mi bh0 = rhash(rh, a, a + b);\\n mi ah1 = rhash(rh, a + b, a * 2 + b);\\n mi bh1 = rhash(rh, a * 2 + b, a * 2 + b * 2);\\n mi ah2 = rhash(rh, a * 2 + b * 2, n);\\n if (ah0 == ah1 && ah1 == ah2 && bh0 == bh1) {\\n\\tprintf(\\\"Love \\\");\\n\\tfor (int i = 0; i < a + b; i++) putchar(s[i]);\\n\\tputchar('!');\\n\\tputchar('\\\\n');\\n\\treturn 0;\\n }\\n }\\n }\\n\\n puts(\\\"mitomerarenaiWA\\\");\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 15652,\n \"score_of_the_acc\": -0.2488,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2763_8469792\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2763.cc: Miko Mi String\\n */\\n\\n#include<cstdio>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 1000000;\\nconst int P = 4073;\\nconst int MOD = 1000000009;\\n\\n/* typedef */\\n\\ntemplate<const int MOD>\\nstruct MI {\\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<MOD> mi;\\n\\n/* global variables */\\n\\nmi pes[MAX_N + 1], invpes[MAX_N + 1];\\nchar s[MAX_N + 4];\\nmi rh[MAX_N + 1];\\n\\n/* subroutines */\\n\\ninline void prep_rhash(int n) {\\n pes[0] = invpes[0] = 1;\\n pes[1] = P;\\n invpes[1] = pes[1].inv();\\n for (int i = 2; i <= n; i++) {\\n pes[i] = pes[i - 1] * P;\\n invpes[i] = invpes[i - 1] * invpes[1];\\n }\\n}\\n\\ninline int s2rh(mi rh[], const char s[]) {\\n int k = 0;\\n for (; s[k]; k++)\\n rh[k + 1] = rh[k] + pes[k] * s[k];\\n return k;\\n}\\n\\ninline mi s2h(const char s[]) {\\n mi h = 0;\\n for (int k = 0; s[k]; k++) h += pes[k] * s[k];\\n return h;\\n}\\n\\ninline mi rhash(mi rh[], int i, int j) {\\n return (rh[j] - rh[i]) * invpes[i];\\n}\\n\\n/* main */\\n\\nint main() {\\n prep_rhash(MAX_N);\\n\\n scanf(\\\"%s\\\", s);\\n int n = s2rh(rh, s);\\n \\n for (int a = n / 3; a >= 1; a--) {\\n int m = n - a * 3;\\n if (! (m & 1)) {\\n int b = m / 2;\\n mi ah0 = rhash(rh, 0, a);\\n mi bh0 = rhash(rh, a, a + b);\\n mi ah1 = rhash(rh, a + b, a * 2 + b);\\n mi bh1 = rhash(rh, a * 2 + b, a * 2 + b * 2);\\n mi ah2 = rhash(rh, a * 2 + b * 2, n);\\n if (ah0 == ah1 && ah1 == ah2 && bh0 == bh1) {\\n\\tprintf(\\\"Love \\\");\\n\\tfor (int i = 0; i < a + b; i++) putchar(s[i]);\\n\\tputchar('!');\\n\\tputchar('\\\\n');\\n\\treturn 0;\\n }\\n }\\n }\\n\\n puts(\\\"mitomerarenaiWA\\\");\\n return 0;\\n}\",\n \"accuracy\": 0.4819277108433735,\n \"time_ms\": 10,\n \"memory_kb\": 15656,\n \"score_of_the_acc\": -0.2489,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2763_8319005\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\n\\nlong long mod = 2147483647;\\nlong long N;\\nlong long Pow[1 << 20];\\nlong long Hash[1 << 20];\\n\\n// Hash value of [l, r]\\nlong long Hash_Value(int l, int r) {\\n\\treturn (Hash[r] - Hash[l - 1] * Pow[r - l + 1] + mod * mod) % mod;\\n}\\n\\nint main() {\\n\\t// Step 1. Init\\n\\tPow[0] = 1;\\n\\tfor (int i = 1; i <= 1000000; i++) Pow[i] = (233LL * Pow[i - 1]) % mod;\\n\\n\\t// Step 2. Input\\n\\tstring S; cin >> S; N = S.size();\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tlong long val = S[i - 1];\\n\\t\\tHash[i] = (233LL * Hash[i - 1] + val) % mod;\\n\\t}\\n\\n\\t// Step 3. Brute Force\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (3 * i <= N) continue;\\n\\t\\tif (2 * i >= N) continue;\\n\\t\\tint amari = N - 2 * i;\\n\\t\\tlong long v1 = Hash_Value(1, i);\\n\\t\\tlong long v2 = Hash_Value(i + 1, 2 * i);\\n\\t\\tif (v1 != v2) continue;\\n\\t\\tlong long u1 = Hash_Value(0 * i + 1, 0 * i + amari);\\n\\t\\tlong long u2 = Hash_Value(1 * i + 1, 1 * i + amari);\\n\\t\\tlong long u3 = Hash_Value(2 * i + 1, 2 * i + amari);\\n\\t\\tif (u1 != u2 || u1 != u3 || u2 != u3) continue;\\n\\t\\tcout << \\\"Love \\\" << S.substr(0, i) << \\\"!\\\" << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tcout << \\\"mitomerarenaiWA\\\" << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 20876,\n \"score_of_the_acc\": -0.478,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2763_5853002\",\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< 998244353 >;\\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 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\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\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 = calc_mod(mt()) % 100000 + 1000;\\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};\\n\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n\\n string s; cin >> s;\\n RollingHash rh(s);\\n\\n int n = s.size();\\n int mi = 1e9;\\n for(int i=1; i<n; i++) {\\n if((n-3*i) <= 0) break;\\n if((n-3*i)%2 != 0) continue;\\n\\n int len1 = i, len2 = (n-3*i)/2;\\n if(rh.get(0, len1) == rh.get(len1+len2, 2*len1+len2) && rh.get(len1+len2, 2*len1+len2) == rh.get(2*len1+2*len2, n) && rh.get(len1, len1+len2) == rh.get(2*len1+len2, 2*len1+2*len2)) {\\n \\n if(mi > len1 + len2) {\\n mi = len1+len2;\\n }\\n }\\n }\\n if(mi == 1e9) {\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n }else{\\n cout << \\\"Love \\\" << s.substr(0, mi) << \\\"!\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 20152,\n \"score_of_the_acc\": -0.4137,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2763_5852979\",\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< 998244353 >;\\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 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\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\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 = calc_mod(mt()) % 100000 + 1000;\\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};\\n\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n\\n string s; cin >> s;\\n RollingHash rh(s);\\n\\n int n = s.size();\\n int mi = 1e9;\\n for(int i=1; i<n; i++) {\\n if((n-3*i) < 0) break;\\n if((n-3*i)%2 != 0) continue;\\n\\n int len1 = i, len2 = (n-3*i)/2;\\n if(rh.get(0, len1) == rh.get(len1+len2, 2*len1+len2) && rh.get(len1+len2, 2*len1+len2) == rh.get(2*len1+2*len2, n) && rh.get(len1, len1+len2) == rh.get(2*len1+len2, 2*len1+2*len2)) {\\n \\n if(mi > len1 + len2) {\\n mi = len1+len2;\\n }\\n }\\n }\\n if(mi == 1e9) {\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n }else{\\n cout << \\\"Love \\\" << s.substr(0, mi) << \\\"!\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.4819277108433735,\n \"time_ms\": 10,\n \"memory_kb\": 20072,\n \"score_of_the_acc\": -0.4108,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2763_5852970\",\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< 998244353 >;\\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 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\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\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 static const int base1 = 1007, base2 = 2009;\\n static const int mod1 = 1000000007, mod2 = 1000000009;\\n vector<long long> hash1, hash2, power1, power2;\\n int n;\\n // construct\\n RollingHash(const string &S) {\\n n = (int)S.size();\\n hash1.assign(n+1, 0);\\n hash2.assign(n+1, 0);\\n power1.assign(n+1, 1);\\n power2.assign(n+1, 1);\\n for (int i = 0; i < n; ++i) {\\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\\n hash2[i+1] = (hash2[i] * base2 + S[i]) % mod2;\\n power1[i+1] = (power1[i] * base1) % mod1;\\n power2[i+1] = (power2[i] * base2) % mod2;\\n }\\n }\\n \\n // get hash of S[left:right]\\n inline pair<long long, long long> get(int l, int r) const {\\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\\n if (res1 < 0) res1 += mod1;\\n long long res2 = hash2[r] - hash2[l] * power2[r-l] % mod2;\\n if (res2 < 0) res2 += mod2;\\n return {res1, res2};\\n }\\n \\n inline pair<long long, long long> c_shift(int l) {\\n auto h1 = get(0, l);\\n auto h2 = get(l, n);\\n return {(h1.first + h2.first * power1[l]) % mod1, (h1.second + h2.second * power2[l]) % mod2};\\n }\\n \\n // get lcp of S[a:] and T[b:]\\n inline int getLCP(int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n};\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n\\n string s; cin >> s;\\n RollingHash rh(s);\\n\\n int n = s.size();\\n int mi = 1e9;\\n for(int i=1; i<n; i++) {\\n if((n-3*i) < 0) break;\\n if((n-3*i)%2 != 0) continue;\\n\\n int len1 = i, len2 = (n-3*i)/2;\\n if(rh.get(0, len1-1) == rh.get(len1+len2, 2*len1+len2-1) && rh.get(len1+len2, 2*len1+len2-1) == rh.get(2*len1+2*len2, n-1) && rh.get(len1, len1+len2-1) == rh.get(2*len1+len2, 2*len1+2*len2-1)) {\\n \\n if(mi > len1 + len2) {\\n mi = len1+len2;\\n }\\n }\\n }\\n if(mi == 1e9) {\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n }else{\\n cout << \\\"Love \\\" << s.substr(0, mi) << \\\"!\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.5662650602409639,\n \"time_ms\": 10,\n \"memory_kb\": 35872,\n \"score_of_the_acc\": -0.9899,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2763_5852962\",\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< 998244353 >;\\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 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\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\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 static const int base1 = 1007, base2 = 2009;\\n static const int mod1 = 1000000007, mod2 = 1000000009;\\n vector<long long> hash1, hash2, power1, power2;\\n int n;\\n // construct\\n RollingHash(const string &S) {\\n n = (int)S.size();\\n hash1.assign(n+1, 0);\\n hash2.assign(n+1, 0);\\n power1.assign(n+1, 1);\\n power2.assign(n+1, 1);\\n for (int i = 0; i < n; ++i) {\\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\\n hash2[i+1] = (hash2[i] * base2 + S[i]) % mod2;\\n power1[i+1] = (power1[i] * base1) % mod1;\\n power2[i+1] = (power2[i] * base2) % mod2;\\n }\\n }\\n \\n // get hash of S[left:right]\\n inline pair<long long, long long> get(int l, int r) const {\\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\\n if (res1 < 0) res1 += mod1;\\n long long res2 = hash2[r] - hash2[l] * power2[r-l] % mod2;\\n if (res2 < 0) res2 += mod2;\\n return {res1, res2};\\n }\\n \\n inline pair<long long, long long> c_shift(int l) {\\n auto h1 = get(0, l);\\n auto h2 = get(l, n);\\n return {(h1.first + h2.first * power1[l]) % mod1, (h1.second + h2.second * power2[l]) % mod2};\\n }\\n \\n // get lcp of S[a:] and T[b:]\\n inline int getLCP(int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n};\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n\\n string s; cin >> s;\\n RollingHash rh(s);\\n\\n int n = s.size();\\n int mi = 1e9;\\n for(int i=1; i<n; i++) {\\n if((n-3*i) < 0) break;\\n if((n-3*i)%2 != 0) continue;\\n\\n int len1 = i, len2 = (n-3*i)/2;\\n if(rh.get(0, len1) == rh.get(len1+len2, 2*len1+len2) && rh.get(len1+len2, 2*len1+len2) == rh.get(2*len1+2*len2, n) && rh.get(len1, len1+len2) == rh.get(2*len1+len2, 2*len1+2*len2)) {\\n \\n if(mi > len1 + len2) {\\n mi = len1+len2;\\n }\\n }\\n }\\n if(mi == 1e9) {\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n }else{\\n cout << \\\"Love \\\" << s.substr(0, mi) << \\\"!\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.4819277108433735,\n \"time_ms\": 10,\n \"memory_kb\": 35812,\n \"score_of_the_acc\": -0.9877,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2763_5135928\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <random>\\nusing namespace std;\\n\\n// source: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\\nstruct rolling_hash{\\n using lli = long long int;\\n const lli MOD = (1LL << 61) -1;\\n const lli MASK30 = (1LL << 30) -1;\\n const lli MASK31 = (1LL << 31) -1;\\n const lli MASK61 = (1LL << 61) -1;\\n\\n lli base;\\n vector<lli> hash_table;\\n vector<lli> base_pow;\\n rolling_hash(const string& s){\\n base = get_rand();\\n int n = s.length();\\n hash_table.assign(n+1, 0);\\n base_pow.assign(n+1, 1);\\n for(int i=0; i<n; i++){\\n hash_table[i+1] = calc_mod(mul(hash_table[i], base) + s[i]);\\n base_pow[i+1] = mul(base_pow[i], base);\\n }\\n }\\n // calculate hash value of s[a:b]\\n lli calc_hash(int a, int b){\\n lli res = hash_table[b] -mul(hash_table[a], base_pow[b-a]);\\n return (res>=0)? res: res+MOD; \\n }\\n\\n // calculate a*b mod 2^61-1\\n lli mul(lli a, lli b){\\n lli au = a >> 31;\\n lli al = a & MASK31;\\n lli bu = b >> 31;\\n lli bl = b & MASK31;\\n lli mid = al*bu + au*bl;\\n lli midu = mid >> 30;\\n lli midl = mid & MASK30;\\n return calc_mod(2*au*bu + midu+(midl<<31) + al*bl);\\n }\\n // calculate x mod 2^61-1\\n lli calc_mod(lli x){\\n lli xu = x >> 61;\\n lli xl = x & MASK61;\\n lli res = xu + xl;\\n if(res >= MOD) res -= MOD;\\n return res;\\n }\\n\\n // generate random number\\n lli get_rand(){\\n std::random_device seed_gen;\\n std::mt19937_64 rnd(seed_gen());\\n return rnd() % MOD;\\n }\\n};\\n\\nint main(){\\n string s;\\n cin >> s;\\n int n = s.length();\\n rolling_hash rh(s);\\n string ans = \\\"\\\";\\n for(int i=1; i*3+2<=n; i++){\\n int rem = n -3*i;\\n if(rem%2 == 1) continue;\\n int p[]={0, i, i+rem/2, 2*i+rem/2, 2*i+rem, n};\\n long long int h[5];\\n for(int i=0; i<5; i++){\\n h[i] = rh.calc_hash(p[i], p[i+1]);\\n }\\n if(h[0]==h[2] and h[0]==h[4] and h[1]==h[3]){\\n ans = s.substr(0, i+rem/2);\\n }\\n }\\n if(ans == \\\"\\\"){\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n }else{\\n cout << \\\"Love \\\" << ans << \\\"!\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 20692,\n \"score_of_the_acc\": -0.6977,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2763_5018837\",\n \"code_snippet\": \"#pragma region Macros\\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 endl '\\\\n'\\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;\\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}\\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(all(res), 0);\\n sort(all(res), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\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); }\\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}\\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>>;\\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#define i128 __int128_t\\n#define ull unsigned long long int\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\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;\\ntemplate <typename A, typename B>\\nostream& operator <<(ostream& out, const pair<A, B>& a) {\\nout << \\\"(\\\" << a.first << \\\",\\\" << a.second << \\\")\\\";\\nreturn out;\\n}\\ntemplate <typename T, size_t N>\\nostream& operator <<(ostream& out, const array<T, N>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T>\\nostream& operator <<(ostream& out, const vector<T>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T, class Cmp>\\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" :\\\", \\\"); out << v; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\ntemplate <typename U, typename T, class Cmp>\\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& p : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << p.first << \\\":\\\" << p.second; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\n// #define LOCAL\\n#ifdef LOCAL\\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define trace(...) 42\\n#endif\\ntemplate <typename Arg1>\\nvoid __f(const char* name, Arg1&& arg1){\\ncerr << name << \\\": \\\" << arg1 << endl;\\n}\\ntemplate <typename Arg1, typename... Args>\\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\\nconst char* comma = strchr(names + 1, ',');\\ncerr.write(names, comma - names) << \\\": \\\" << arg1 << \\\" |\\\";\\n__f(comma + 1, args...);\\n}\\n#pragma endregion\\n//#include<atcoder/all>\\n//using namespace atcoder;\\nstruct RollingHash {\\n static const int base1 = 8973;\\n static const int mod1 = 2016112121;\\n vector<long long> hash1, power1;\\n\\n // construct\\n RollingHash(const string &S) {\\n int n = (int)S.size();\\n hash1.assign(n+1, 0);\\n power1.assign(n+1, 1);\\n for (int i = 0; i < n; ++i) {\\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\\n power1[i+1] = (power1[i] * base1) % mod1;\\n }\\n }\\n \\n // get hash value of S[left:right]\\n inline long long get(int l, int r) const {\\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\\n if (res1 < 0) res1 += mod1;\\n return res1;\\n }\\n\\n // get hash value of whole S\\n inline long long get() const {\\n return hash1.back();\\n }\\n\\n // get lcp of S[a:] and S[b:]\\n inline int getLCP(int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n\\n // get lcp of S[a:] and T[b:]\\n inline int getLCP(const RollingHash &T, int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != T.get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n};\\nint main(){\\n STR(s);\\n RollingHash rh(s);\\n int n = s.size();\\n vector<int> ret;\\n rep(i,n){\\n if(!i)continue;\\n int sizA = i;\\n int sizB = n - i*3;\\n if(sizB<= 0 || sizB%2 == 1)continue;\\n sizB /= 2;\\n vector<ll> A,B;\\n A.pb(rh.get(0,sizA-1));\\n B.pb(rh.get(sizA,sizA+sizB-1));\\n A.pb(rh.get(sizA+sizB,2*sizA+sizB-1));\\n B.pb(rh.get(2*sizA+sizB,2*sizA+2*sizB-1));\\n A.pb(rh.get(2*sizA+2*sizB,n-1));\\n sort(all(A));sort(all(B));\\n auto check = [&](vector<ll> v){\\n int k = v.size();\\n ll ret = v[0];\\n rep(i,k){\\n if(ret != v[i])return false; \\n }\\n return true;\\n };\\n if(check(A) && check(B)){\\n ret.pb(sizA+sizB);\\n }\\n }\\n if(ret.size() == 0){\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n return 0;\\n }\\n sort(all(ret));\\n trace(ret);\\n string hoge = s.substr(0,ret[0]);\\n cout << \\\"Love \\\" << hoge << '!' << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.5662650602409639,\n \"time_ms\": 20,\n \"memory_kb\": 20152,\n \"score_of_the_acc\": -0.4326,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2763_5018831\",\n \"code_snippet\": \"#pragma region Macros\\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 endl '\\\\n'\\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;\\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}\\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(all(res), 0);\\n sort(all(res), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\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); }\\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}\\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>>;\\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#define i128 __int128_t\\n#define ull unsigned long long int\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\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;\\ntemplate <typename A, typename B>\\nostream& operator <<(ostream& out, const pair<A, B>& a) {\\nout << \\\"(\\\" << a.first << \\\",\\\" << a.second << \\\")\\\";\\nreturn out;\\n}\\ntemplate <typename T, size_t N>\\nostream& operator <<(ostream& out, const array<T, N>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T>\\nostream& operator <<(ostream& out, const vector<T>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T, class Cmp>\\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" :\\\", \\\"); out << v; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\ntemplate <typename U, typename T, class Cmp>\\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& p : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << p.first << \\\":\\\" << p.second; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\n// #define LOCAL\\n#ifdef LOCAL\\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define trace(...) 42\\n#endif\\ntemplate <typename Arg1>\\nvoid __f(const char* name, Arg1&& arg1){\\ncerr << name << \\\": \\\" << arg1 << endl;\\n}\\ntemplate <typename Arg1, typename... Args>\\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\\nconst char* comma = strchr(names + 1, ',');\\ncerr.write(names, comma - names) << \\\": \\\" << arg1 << \\\" |\\\";\\n__f(comma + 1, args...);\\n}\\n#pragma endregion\\n//#include<atcoder/all>\\n//using namespace atcoder;\\nstruct RollingHash {\\n static const int base1 = 8973;\\n static const int mod1 = 2016112121;\\n vector<long long> hash1, power1;\\n\\n // construct\\n RollingHash(const string &S) {\\n int n = (int)S.size();\\n hash1.assign(n+1, 0);\\n power1.assign(n+1, 1);\\n for (int i = 0; i < n; ++i) {\\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\\n power1[i+1] = (power1[i] * base1) % mod1;\\n }\\n }\\n \\n // get hash value of S[left:right]\\n inline long long get(int l, int r) const {\\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\\n if (res1 < 0) res1 += mod1;\\n return res1;\\n }\\n\\n // get hash value of whole S\\n inline long long get() const {\\n return hash1.back();\\n }\\n\\n // get lcp of S[a:] and S[b:]\\n inline int getLCP(int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n\\n // get lcp of S[a:] and T[b:]\\n inline int getLCP(const RollingHash &T, int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != T.get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n};\\nint main(){\\n STR(s);\\n RollingHash rh(s);\\n int n = s.size();\\n vector<int> ret;\\n rep(i,n){\\n if(!i)continue;\\n int sizA = i;\\n int sizB = n - i*3;\\n if(sizB<= 0 || sizB%2 == 1)continue;\\n sizB /= 2;\\n vector<ll> A,B;\\n A.pb(rh.get(0,sizA-1));\\n B.pb(rh.get(sizA,sizA+sizB-1));\\n A.pb(rh.get(sizA+sizB,2*sizA+sizB-1));\\n B.pb(rh.get(2*sizA+sizB,2*sizA+2*sizB-1));\\n A.pb(rh.get(2*sizA+2*sizB,n-1));\\n sort(all(A));sort(all(B));\\n if(A.back() == A[0] && B.back() == B[0]){\\n ret.pb(sizA+sizB);\\n }\\n }\\n if(ret.size() == 0){\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n return 0;\\n }\\n sort(all(ret));\\n trace(ret);\\n string hoge = s.substr(0,ret[0]);\\n cout << \\\"Love \\\" << hoge << '!' << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.5662650602409639,\n \"time_ms\": 20,\n \"memory_kb\": 19980,\n \"score_of_the_acc\": -0.4263,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2763_5018826\",\n \"code_snippet\": \"#pragma region Macros\\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 endl '\\\\n'\\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;\\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}\\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(all(res), 0);\\n sort(all(res), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\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); }\\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}\\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>>;\\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#define i128 __int128_t\\n#define ull unsigned long long int\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\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;\\ntemplate <typename A, typename B>\\nostream& operator <<(ostream& out, const pair<A, B>& a) {\\nout << \\\"(\\\" << a.first << \\\",\\\" << a.second << \\\")\\\";\\nreturn out;\\n}\\ntemplate <typename T, size_t N>\\nostream& operator <<(ostream& out, const array<T, N>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T>\\nostream& operator <<(ostream& out, const vector<T>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T, class Cmp>\\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" :\\\", \\\"); out << v; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\ntemplate <typename U, typename T, class Cmp>\\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& p : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << p.first << \\\":\\\" << p.second; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\n// #define LOCAL\\n#ifdef LOCAL\\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define trace(...) 42\\n#endif\\ntemplate <typename Arg1>\\nvoid __f(const char* name, Arg1&& arg1){\\ncerr << name << \\\": \\\" << arg1 << endl;\\n}\\ntemplate <typename Arg1, typename... Args>\\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\\nconst char* comma = strchr(names + 1, ',');\\ncerr.write(names, comma - names) << \\\": \\\" << arg1 << \\\" |\\\";\\n__f(comma + 1, args...);\\n}\\n#pragma endregion\\n//#include<atcoder/all>\\n//using namespace atcoder;\\nstruct RollingHash {\\n static const int base1 = 8973;\\n static const int mod1 = 1000000007;\\n vector<long long> hash1, power1;\\n\\n // construct\\n RollingHash(const string &S) {\\n int n = (int)S.size();\\n hash1.assign(n+1, 0);\\n power1.assign(n+1, 1);\\n for (int i = 0; i < n; ++i) {\\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\\n power1[i+1] = (power1[i] * base1) % mod1;\\n }\\n }\\n \\n // get hash value of S[left:right]\\n inline long long get(int l, int r) const {\\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\\n if (res1 < 0) res1 += mod1;\\n return res1;\\n }\\n\\n // get hash value of whole S\\n inline long long get() const {\\n return hash1.back();\\n }\\n\\n // get lcp of S[a:] and S[b:]\\n inline int getLCP(int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n\\n // get lcp of S[a:] and T[b:]\\n inline int getLCP(const RollingHash &T, int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != T.get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n};\\nint main(){\\n STR(s);\\n RollingHash rh(s);\\n int n = s.size();\\n vector<int> ret;\\n rep(i,n){\\n if(!i)continue;\\n int sizA = i;\\n int sizB = n - i*3;\\n if(sizB<= 0 || sizB%2 == 1)continue;\\n sizB /= 2;\\n vector<ll> A,B;\\n A.pb(rh.get(0,sizA-1));\\n B.pb(rh.get(sizA,sizA+sizB-1));\\n A.pb(rh.get(sizA+sizB,2*sizA+sizB-1));\\n B.pb(rh.get(2*sizA+sizB,2*sizA+2*sizB-1));\\n A.pb(rh.get(2*sizA+2*sizB,n-1));\\n sort(all(A));sort(all(B));\\n if(A.back() == A[0] && B.back() == B[0]){\\n ret.pb(sizA+sizB);\\n }\\n }\\n if(ret.size() == 0){\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n return 0;\\n }\\n sort(all(ret));\\n trace(ret);\\n string hoge = s.substr(0,ret[0]);\\n cout << \\\"Love \\\" << hoge << '!' << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.5662650602409639,\n \"time_ms\": 20,\n \"memory_kb\": 20124,\n \"score_of_the_acc\": -0.4316,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2763_5018825\",\n \"code_snippet\": \"#pragma region Macros\\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 endl '\\\\n'\\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;\\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}\\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(all(res), 0);\\n sort(all(res), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\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); }\\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}\\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>>;\\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#define i128 __int128_t\\n#define ull unsigned long long int\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\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;\\ntemplate <typename A, typename B>\\nostream& operator <<(ostream& out, const pair<A, B>& a) {\\nout << \\\"(\\\" << a.first << \\\",\\\" << a.second << \\\")\\\";\\nreturn out;\\n}\\ntemplate <typename T, size_t N>\\nostream& operator <<(ostream& out, const array<T, N>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T>\\nostream& operator <<(ostream& out, const vector<T>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T, class Cmp>\\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" :\\\", \\\"); out << v; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\ntemplate <typename U, typename T, class Cmp>\\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& p : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << p.first << \\\":\\\" << p.second; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\n// #define LOCAL\\n#ifdef LOCAL\\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define trace(...) 42\\n#endif\\ntemplate <typename Arg1>\\nvoid __f(const char* name, Arg1&& arg1){\\ncerr << name << \\\": \\\" << arg1 << endl;\\n}\\ntemplate <typename Arg1, typename... Args>\\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\\nconst char* comma = strchr(names + 1, ',');\\ncerr.write(names, comma - names) << \\\": \\\" << arg1 << \\\" |\\\";\\n__f(comma + 1, args...);\\n}\\n#pragma endregion\\n//#include<atcoder/all>\\n//using namespace atcoder;\\nstruct RollingHash {\\n static const int base1 = 1007;\\n static const int mod1 = 1000000007;\\n vector<long long> hash1, power1;\\n\\n // construct\\n RollingHash(const string &S) {\\n int n = (int)S.size();\\n hash1.assign(n+1, 0);\\n power1.assign(n+1, 1);\\n for (int i = 0; i < n; ++i) {\\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\\n power1[i+1] = (power1[i] * base1) % mod1;\\n }\\n }\\n \\n // get hash value of S[left:right]\\n inline long long get(int l, int r) const {\\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\\n if (res1 < 0) res1 += mod1;\\n return res1;\\n }\\n\\n // get hash value of whole S\\n inline long long get() const {\\n return hash1.back();\\n }\\n\\n // get lcp of S[a:] and S[b:]\\n inline int getLCP(int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n\\n // get lcp of S[a:] and T[b:]\\n inline int getLCP(const RollingHash &T, int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != T.get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n};\\nint main(){\\n STR(s);\\n RollingHash rh(s);\\n int n = s.size();\\n vector<int> ret;\\n rep(i,n){\\n if(!i)continue;\\n int sizA = i;\\n int sizB = n - i*3;\\n if(sizB<= 0 || sizB%2 == 1)continue;\\n sizB /= 2;\\n vector<ll> A,B;\\n A.pb(rh.get(0,sizA-1));\\n B.pb(rh.get(sizA,sizA+sizB-1));\\n A.pb(rh.get(sizA+sizB,2*sizA+sizB-1));\\n B.pb(rh.get(2*sizA+sizB,2*sizA+2*sizB-1));\\n A.pb(rh.get(2*sizA+2*sizB,n-1));\\n sort(all(A));sort(all(B));\\n if(A.back() == A[0] && B.back() == B[0]){\\n ret.pb(sizA+sizB);\\n }\\n }\\n if(ret.size() == 0){\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n return 0;\\n }\\n sort(all(ret));\\n trace(ret);\\n string hoge = s.substr(0,ret[0]);\\n cout << \\\"Love \\\" << hoge << '!' << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.5662650602409639,\n \"time_ms\": 20,\n \"memory_kb\": 20024,\n \"score_of_the_acc\": -0.4279,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2763_4549691\",\n \"code_snippet\": \"#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#define enld '\\\\n'\\n#define rep(i,n) for(int i=0; i<(n); i++)\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll mod2 = 998244353;\\nconst double PI = 3.1415926535897932384626433832795028841971;\\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; }\\n// ---------------------------------------------------------------------------\\n\\nvector<int> Z_algorithm(string S){\\n int c=0,n=S.size();\\n vector<int> Z(n,0);\\n for(int i=1; i<n; i++){\\n int l = i-c;\\n if(i+Z[l] < c+Z[c]){\\n Z[i] = Z[l];\\n }else{\\n int j = max(0, c+Z[c]-i);\\n while(i+j<n && S[j]==S[i+j]) j++;\\n Z[i] = j;\\n c = i;\\n }\\n }\\n Z[0] = n;\\n return Z;\\n}\\n\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n string S;\\n cin >> S;\\n vector<int> Z = Z_algorithm(S);\\n int N = S.size();\\n // ABを入れる\\n string ans = \\\"-\\\";\\n for(int i=N-1; i>=1; i--){\\n // 後ろがAになるか判定\\n if(Z[i] == N-i){\\n // Bの文字列の長さ\\n // これB*2の長さ\\n int B = (i-1)-Z[i]+1-Z[i];\\n if(B <= 0) continue;\\n if(B%2 == 0){\\n // Bの長さ\\n B /= 2;\\n if(Z[Z[i]+B] >= Z[i]+B){\\n // 条件満たす\\n // cout << i << \\\" \\\" << Z[i]+B << \\\"\\\\n\\\";\\n if(ans == \\\"-\\\"){\\n ans = S.substr(0,Z[i]+B);\\n }else{\\n if(ans.size() > Z[i]+B){\\n ans = S.substr(0,Z[i]+B);\\n }\\n }\\n }\\n }\\n }\\n }\\n if(ans == \\\"-\\\"){\\n cout << \\\"mitomerarenaiWA\\\" << \\\"\\\\n\\\";\\n }else{\\n cout << \\\"Love \\\" << ans << \\\"!\\\" << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 8864,\n \"score_of_the_acc\": -0.3962,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2763_4549416\",\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;\\nusing lint = long long int;\\nlong long int INF = 1001001001001001LL;\\nint inf = 1000000007;\\nlong long int MOD = 1000000007LL;\\ndouble PI = 3.1415926535897932;\\n\\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\\n\\n#define ALL(a) a.begin(),a.end()\\n#define RALL(a) a.rbegin(),a.rend()\\n\\ntemplate< unsigned mod >\\nstruct RollingHash {\\n vector< unsigned > hashed, power;\\n\\n inline unsigned mul(unsigned a, unsigned b) const {\\n unsigned long long x = (unsigned long long) a * b;\\n unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;\\n asm(\\\"divl %4; \\\\n\\\\t\\\" : \\\"=a\\\" (d), \\\"=d\\\" (m) : \\\"d\\\" (xh), \\\"a\\\" (xl), \\\"r\\\" (mod));\\n return m;\\n }\\n\\n RollingHash(const string &s, unsigned base = 10007) {\\n int sz = (int) s.size();\\n hashed.assign(sz + 1, 0);\\n power.assign(sz + 1, 0);\\n power[0] = 1;\\n for(int i = 0; i < sz; i++) {\\n power[i + 1] = mul(power[i], base);\\n hashed[i + 1] = mul(hashed[i], base) + s[i];\\n if(hashed[i + 1] >= mod) hashed[i + 1] -= mod;\\n }\\n }\\n\\n unsigned get(int l, int r) const {\\n unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);\\n if(ret >= mod) ret -= mod;\\n return ret;\\n }\\n\\n unsigned connect(unsigned h1, int h2, int h2len) const {\\n unsigned ret = mul(h1, power[h2len]) + h2;\\n if(ret >= mod) ret -= mod;\\n return ret;\\n }\\n\\n int LCP(const RollingHash< mod > &b, int l1, int r1, int l2, int r2) {\\n int len = min(r1 - l1, r2 - l2);\\n int low = -1, high = len + 1;\\n while(high - low > 1) {\\n int mid = (low + high) / 2;\\n if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;\\n else high = mid;\\n }\\n return (low);\\n }\\n};\\n\\nusing RH = RollingHash< 1000000007 >;\\n\\n\\nint main() {\\n \\n string s; cin >> s;\\n int n = s.size();\\n string ans = \\\"\\\";\\n int val = inf;\\n\\n\\n RH rh(s);\\n for (int A = 1; A <= n; A++) {\\n int rest = n - 3 * A;\\n if (rest <= 0) continue;\\n if (rest % 2 != 0) continue;\\n int B = rest / 2;\\n\\n if (rh.get(0, A) == rh.get(A + B, A + B + A) \\n and rh.get(0, A) == rh.get(2 * A + 2 * B, 2 * A + 2 * B + A) \\n and rh.get(A, A + B) == rh.get(2 * A + B, 2 * A + B + B)) {\\n\\n string a = s.substr(0, A);\\n string b = s.substr(A, B);\\n if (A + B < val) {\\n ans = \\\"Love \\\" + a + b + \\\"!\\\";\\n val = A + B;\\n }\\n }\\n }\\n\\n\\n if (ans == \\\"\\\") {\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n } else {\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 13828,\n \"score_of_the_acc\": -1.1819,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2763_4549349\",\n \"code_snippet\": \"#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#define enld '\\\\n'\\n#define rep(i,n) for(int i=0; i<(n); i++)\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll mod2 = 998244353;\\nconst double PI = 3.1415926535897932384626433832795028841971;\\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; }\\n// ---------------------------------------------------------------------------\\n\\nvector<int> Z_algorithm(string S){\\n int c=0,n=S.size();\\n vector<int> Z(n,0);\\n for(int i=1; i<n; i++){\\n int l = i-c;\\n if(i+Z[l] < c+Z[c]){\\n Z[i] = Z[l];\\n }else{\\n int j = max(0, c+Z[c]-i);\\n while(i+j<n && S[j]==S[i+j]) j++;\\n Z[i] = j;\\n c = i;\\n }\\n }\\n Z[0] = n;\\n return Z;\\n}\\n\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n string S;\\n cin >> S;\\n vector<int> Z = Z_algorithm(S);\\n int N = S.size();\\n // ABを入れる\\n string ans = \\\"-\\\";\\n for(int i=N-1; i>=1; i--){\\n // 後ろがAになるか判定\\n if(Z[i] == N-i){\\n // Bの文字列の長さ\\n // これB*2の長さ\\n int B = (i-1)-Z[i]+1-Z[i];\\n if(B <= 0) continue;\\n if(B%2 == 0){\\n // Bの長さ\\n B /= 2;\\n if(Z[Z[i]+B] >= Z[i]+B){\\n // 条件満たす\\n // cout << i << \\\" \\\" << Z[i]+B << \\\"\\\\n\\\";\\n if(ans == \\\"-\\\"){\\n ans = S.substr(0,Z[i]+B);\\n }else{\\n if(ans.size() > Z[i]+B){\\n ans = S.substr(0,Z[i]+B);\\n }\\n }\\n }\\n }\\n }\\n }\\n if(ans == \\\"-\\\"){\\n cout << \\\"mitomerarenaiWA\\\" << \\\"\\\\n\\\";\\n }else{\\n cout << \\\"Love \\\" << ans << \\\"!\\\" << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 8940,\n \"score_of_the_acc\": -0.399,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2763_4246987\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std::literals::string_literals;\\nusing i64 = std::int_fast64_t;\\nusing std::cout;\\nusing std::cerr;\\nusing std::endl;\\nusing std::cin;\\n\\ntemplate<typename T>\\nstd::vector<T> make_v(size_t a){return std::vector<T>(a);}\\n\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts){\\n return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\n\\n#include <vector>\\n#include <string>\\n\\nclass rolling_hash {\\npublic:\\n\\tusing u64 = std::uint_fast64_t;\\n\\tusing size_type = std::uint_fast32_t;\\n\\n\\tstatic constexpr u64 MOD = (1uL << 61) - 1;\\n\\tstatic constexpr u64 base = 20200213;\\n\\n\\tstd::string str;\\n\\tstd::vector<u64> hash_, pow;\\n\\nprivate:\\n\\tstatic constexpr u64 mask30 = (1ul << 30) - 1;\\n\\tstatic constexpr u64 mask31 = (1ul << 31) - 1;\\n\\n\\tu64 mul(u64 a, u64 b) const {\\n\\t\\tu64 au = a >> 31;\\n\\t\\tu64 ad = a & mask31;\\n\\t\\tu64 bu = b >> 31;\\n\\t\\tu64 bd = b & mask31;\\n\\t\\tu64 mid = ad * bu + au * bd;\\n\\t\\tu64 midu = mid >> 30;\\n\\t\\tu64 midd = mid & mask30;\\n\\t\\treturn apply(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n\\t}\\n\\tu64 apply(u64 val) const {\\n\\t\\tval = (val & MOD) + (val >> 61);\\n\\t\\tif(val >= MOD) val -= MOD;\\n\\t\\treturn val;\\n\\t}\\n\\tsize_type xorshift(size_type x) const {\\n\\t\\tx ^= x << 13;\\n\\t\\tx ^= x >> 17;\\n\\t\\tx ^= x << 5;\\n\\t\\treturn x;\\n\\t}\\n\\npublic:\\n\\trolling_hash(const rolling_hash &) = default;\\n\\trolling_hash(rolling_hash&&) = default;\\n\\n\\trolling_hash() : str() {};\\n\\trolling_hash(const std::string & str) : str(str) {\\n\\t\\thash_.resize(str.size() + 1, 0);\\n\\t\\tpow.resize(str.size() + 1, 1);\\n\\t\\tfor(size_type i = 0; i < str.size(); i++) {\\n\\t\\t\\thash_[i + 1] = mul(hash_[i], base) + xorshift(str[i] + 1);\\n\\t\\t\\tpow[i + 1] = mul(pow[i], base);\\n\\t\\t\\tif(hash_[i + 1] >= MOD) hash_[i + 1] -= MOD;\\n\\t\\t}\\n\\t}\\n\\n\\tu64 hash() const { return hash_.back(); }\\n\\tu64 hash(size_type l, size_type r) const {\\n\\t\\tu64 ret = MOD + hash_[r] - mul(hash_[l], pow[r - l]);\\n\\t\\treturn ret < MOD ? ret : ret - MOD;\\n\\t}\\n\\t\\n\\tsize_type size() const { return str.size(); }\\n};\\n\\nint main() {\\n\\tstd::string s; cin >> s;\\n\\n\\trolling_hash hash(s);\\n\\tfor(int i = (int)s.size(); i > 0; i--) {\\n\\t\\tint A = i;\\n\\t\\tint B = (int)s.size() - 3 * A;\\n\\t\\tif(A <= 0 or B <= 0 or B & 1) continue; B /= 2;\\n\\n\\t\\ti64 X = hash.hash(0, A);\\n\\t\\ti64 Y = hash.hash(A, A + B);\\n\\t\\tif(X != hash.hash(A + B, A + B + A)) continue;\\n\\t\\tif(Y != hash.hash(A + B + A, A + B + A + B)) continue;\\n\\t\\tif(X != hash.hash(A + B + A + B, A + B + A + B + A)) continue;\\n\\n\\t\\tprintf(\\\"Love %s!\\\\n\\\", s.substr(0, A + B).c_str());\\n\\t\\treturn 0;\\n\\t}\\n\\tprintf(\\\"mitomerarenaiWA\\\\n\\\");\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 20040,\n \"score_of_the_acc\": -0.4474,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2763_4246974\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std::literals::string_literals;\\nusing i64 = std::int_fast64_t;\\nusing std::cout;\\nusing std::cerr;\\nusing std::endl;\\nusing std::cin;\\n\\ntemplate<typename T>\\nstd::vector<T> make_v(size_t a){return std::vector<T>(a);}\\n\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts){\\n return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\n\\n#include <vector>\\n#include <string>\\n\\nclass rolling_hash {\\npublic:\\n\\tusing u64 = std::uint_fast64_t;\\n\\tusing size_type = std::uint_fast32_t;\\n\\n\\tstatic constexpr u64 MOD = (1uL << 61) - 1;\\n\\tstatic constexpr u64 base = 20200213;\\n\\n\\tstd::string str;\\n\\tstd::vector<u64> hash_, pow;\\n\\nprivate:\\n\\tstatic constexpr u64 mask30 = (1ul << 30) - 1;\\n\\tstatic constexpr u64 mask31 = (1ul << 31) - 1;\\n\\n\\tu64 mul(u64 a, u64 b) const {\\n\\t\\tu64 au = a >> 31;\\n\\t\\tu64 ad = a & mask31;\\n\\t\\tu64 bu = b >> 31;\\n\\t\\tu64 bd = b & mask31;\\n\\t\\tu64 mid = ad * bu + au * bd;\\n\\t\\tu64 midu = mid >> 30;\\n\\t\\tu64 midd = mid & mask30;\\n\\t\\treturn apply(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n\\t}\\n\\tu64 apply(u64 val) const {\\n\\t\\tval = (val & MOD) + (val >> 61);\\n\\t\\tif(val >= MOD) val -= MOD;\\n\\t\\treturn val;\\n\\t}\\n\\tsize_type xorshift(size_type x) const {\\n\\t\\tx ^= x << 13;\\n\\t\\tx ^= x >> 17;\\n\\t\\tx ^= x << 5;\\n\\t\\treturn x;\\n\\t}\\n\\npublic:\\n\\trolling_hash(const rolling_hash &) = default;\\n\\trolling_hash(rolling_hash&&) = default;\\n\\n\\trolling_hash() : str() {};\\n\\trolling_hash(const std::string & str) : str(str) {\\n\\t\\thash_.resize(str.size() + 1, 0);\\n\\t\\tpow.resize(str.size() + 1, 1);\\n\\t\\tfor(size_type i = 0; i < str.size(); i++) {\\n\\t\\t\\thash_[i + 1] = mul(hash_[i], base) + xorshift(str[i] + 1);\\n\\t\\t\\tpow[i + 1] = mul(pow[i], base);\\n\\t\\t\\tif(hash_[i + 1] >= MOD) hash_[i + 1] -= MOD;\\n\\t\\t}\\n\\t}\\n\\n\\tu64 hash() const { return hash_.back(); }\\n\\tu64 hash(size_type l, size_type r) const {\\n\\t\\tu64 ret = MOD + hash_[r] - mul(hash_[l], pow[r - l]);\\n\\t\\treturn ret < MOD ? ret : ret - MOD;\\n\\t}\\n\\t\\n\\tsize_type size() const { return str.size(); }\\n};\\n\\nint main() {\\n\\tstd::string s; cin >> s;\\n\\n\\trolling_hash hash(s);\\n\\tfor(int i = (int)s.size(); i >= 0; i--) {\\n\\t\\tint A = i;\\n\\t\\tint B = (int)s.size() - 3 * A;\\n\\t\\tif(A < 0 or B < 0 or B & 1) continue; B /= 2;\\n\\n\\t\\ti64 X = hash.hash(0, A);\\n\\t\\ti64 Y = hash.hash(A, A + B);\\n\\t\\tif(X != hash.hash(A + B, A + B + A)) continue;\\n\\t\\tif(Y != hash.hash(A + B + A, A + B + A + B)) continue;\\n\\t\\tif(X != hash.hash(A + B + A + B, A + B + A + B + A)) continue;\\n\\n\\t\\tprintf(\\\"Love %s!\\\\n\\\", s.substr(0, A + B).c_str());\\n\\t\\treturn 0;\\n\\t}\\n\\tprintf(\\\"mitomerarenaiWA\\\\n\\\");\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4578313253012048,\n \"time_ms\": 30,\n \"memory_kb\": 20088,\n \"score_of_the_acc\": -0.4491,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2763_4246973\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std::literals::string_literals;\\nusing i64 = std::int_fast64_t;\\nusing std::cout;\\nusing std::cerr;\\nusing std::endl;\\nusing std::cin;\\n\\ntemplate<typename T>\\nstd::vector<T> make_v(size_t a){return std::vector<T>(a);}\\n\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts){\\n return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\n\\n#include <vector>\\n#include <string>\\n\\nclass rolling_hash {\\npublic:\\n\\tusing u64 = std::uint_fast64_t;\\n\\tusing size_type = std::uint_fast32_t;\\n\\n\\tstatic constexpr u64 MOD = (1uL << 61) - 1;\\n\\tstatic constexpr u64 base = 20200213;\\n\\n\\tstd::string str;\\n\\tstd::vector<u64> hash_, pow;\\n\\nprivate:\\n\\tstatic constexpr u64 mask30 = (1ul << 30) - 1;\\n\\tstatic constexpr u64 mask31 = (1ul << 31) - 1;\\n\\n\\tu64 mul(u64 a, u64 b) const {\\n\\t\\tu64 au = a >> 31;\\n\\t\\tu64 ad = a & mask31;\\n\\t\\tu64 bu = b >> 31;\\n\\t\\tu64 bd = b & mask31;\\n\\t\\tu64 mid = ad * bu + au * bd;\\n\\t\\tu64 midu = mid >> 30;\\n\\t\\tu64 midd = mid & mask30;\\n\\t\\treturn apply(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n\\t}\\n\\tu64 apply(u64 val) const {\\n\\t\\tval = (val & MOD) + (val >> 61);\\n\\t\\tif(val >= MOD) val -= MOD;\\n\\t\\treturn val;\\n\\t}\\n\\tsize_type xorshift(size_type x) const {\\n\\t\\tx ^= x << 13;\\n\\t\\tx ^= x >> 17;\\n\\t\\tx ^= x << 5;\\n\\t\\treturn x;\\n\\t}\\n\\npublic:\\n\\trolling_hash(const rolling_hash &) = default;\\n\\trolling_hash(rolling_hash&&) = default;\\n\\n\\trolling_hash() : str() {};\\n\\trolling_hash(const std::string & str) : str(str) {\\n\\t\\thash_.resize(str.size() + 1, 0);\\n\\t\\tpow.resize(str.size() + 1, 1);\\n\\t\\tfor(size_type i = 0; i < str.size(); i++) {\\n\\t\\t\\thash_[i + 1] = mul(hash_[i], base) + xorshift(str[i] + 1);\\n\\t\\t\\tpow[i + 1] = mul(pow[i], base);\\n\\t\\t\\tif(hash_[i + 1] >= MOD) hash_[i + 1] -= MOD;\\n\\t\\t}\\n\\t}\\n\\n\\tu64 hash() const { return hash_.back(); }\\n\\tu64 hash(size_type l, size_type r) const {\\n\\t\\tu64 ret = MOD + hash_[r] - mul(hash_[l], pow[r - l]);\\n\\t\\treturn ret < MOD ? ret : ret - MOD;\\n\\t}\\n\\t\\n\\tsize_type size() const { return str.size(); }\\n};\\n\\nint main() {\\n\\tstd::string s; cin >> s;\\n\\n\\trolling_hash hash(s);\\n\\tfor(int i = (int)s.size() - 1; i >= 0; i--) {\\n\\t\\tint A = i + 1;\\n\\t\\tint B = (int)s.size() - 3 * A;\\n\\t\\tif(A < 0 or B < 0 or B & 1) continue; B /= 2;\\n\\n\\t\\ti64 X = hash.hash(0, A);\\n\\t\\ti64 Y = hash.hash(A, A + B);\\n\\t\\tif(X != hash.hash(A + B, A + B + A)) continue;\\n\\t\\tif(Y != hash.hash(A + B + A, A + B + A + B)) continue;\\n\\t\\tif(X != hash.hash(A + B + A + B, A + B + A + B + A)) continue;\\n\\n\\t\\tprintf(\\\"Love %s!\\\\n\\\", s.substr(0, A + B).c_str());\\n\\t\\treturn 0;\\n\\t}\\n\\tprintf(\\\"mitomerarenaiWA\\\\n\\\");\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4819277108433735,\n \"time_ms\": 30,\n \"memory_kb\": 19996,\n \"score_of_the_acc\": -0.4457,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2763_3736602\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"random\\\"\\n#include \\\"string\\\"\\n#include \\\"bitset\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"map\\\"\\n#include \\\"queue\\\"\\n#include \\\"list\\\"\\n#include \\\"set\\\"\\n#include \\\"climits\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"stack\\\"\\n#include \\\"functional\\\"\\n\\nusing namespace std;\\nusing ll = long long int;\\nusing PII = pair<ll, ll>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n\\nstruct rollingHash {\\n ll mo[2] = {1000000007, 1000000009};\\n ll base[2] = {1009, 1007};\\n vector<ll> hash[2], power[2];\\n rollingHash() {}\\n rollingHash(string s) {\\n hash[0].resize(s.size()+1); hash[1].resize(s.size()+1);\\n power[0].resize(s.size()+1); power[1].resize(s.size()+1);\\n init(s);\\n }\\n inline ll mul(ll a, ll b, ll md) const {\\n return a * b % md;\\n // unsigned long long y = a*b;\\n // unsigned xh = (unsigned)(y>>32), xl = (unsigned)y, d, m;\\n // asm(\\n // \\\"divl %4; \\\\n\\\\t\\\"\\n // : \\\"=a\\\" (d), \\\"=d\\\" (m)\\n // : \\\"d\\\" (xh), \\\"a\\\" (xl), \\\"r\\\" (md)\\n // );\\n // return a;\\n }\\n // O(|S|)\\n void init(string s) {\\n REP(i, 2) {\\n power[i][0] = 1;\\n FOR(j, 1, s.size()+1) power[i][j] = mul(power[i][j-1], base[i], mo[i]);\\n }\\n // 1-indexの累積和\\n REP(i, 2) REP(j, s.size()) {\\n hash[i][j+1] = (hash[i][j]+mul(power[i][j], s[j], mo[i]))%mo[i];\\n }\\n }\\n // [l1,r1) と [l2,r2) が一致するか\\n bool equal(int l1, int r1, int l2, int r2) {\\n REP(i, 2) {\\n ll a = (hash[i][r1]-hash[i][l1]+mo[i])%mo[i];\\n ll b = (hash[i][r2]-hash[i][l2]+mo[i])%mo[i];\\n if(mul(a,power[i][l2-l1],mo[i]) != b) return false;\\n }\\n return true;\\n }\\n // [l,r)\\n PII get(int l, int r) {\\n PII ret;\\n ret.first = (hash[0][r]-hash[0][l]+mo[0])%mo[0];\\n ret.first = mul(ret.first, power[0][hash[0].size()-1-l], mo[0]);\\n ret.second = (hash[1][r]-hash[1][l]+mo[1])%mo[1];\\n ret.second = mul(ret.second, power[1][hash[1].size()-1-l], mo[1]);\\n return ret;\\n }\\n};\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\tstring s;\\n\\tcin >> s;\\n\\n\\tconst ll INF = 1LL << 30;\\n\\tll ans = INF;\\n\\trollingHash hash(s);\\n\\tfor (ll i = 1; i <= s.size(); ++i) {\\n\\t\\tll len = (ll)s.size() - i * 3;\\n\\t\\tif (len <= 0 || len % 2) continue;\\n\\t\\tlen /= 2;\\n\\t\\tll idx1 = i - 1, idx2 = i + len - 1, idx3 = 2 * i + len - 1, idx4 = 2 * i + 2 * len - 1;\\n\\t\\tif (hash.equal(0, idx1, idx2 + 1, idx3) && hash.equal(idx2 + 1, idx3, idx4 + 1, s.size() - 1) && hash.equal(idx1 + 1, idx2, idx3 + 1, idx4)) {\\n\\t\\t\\tif (ans > i + len) {\\n\\t\\t\\t\\tans = i + len;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tif (ans == INF) cout << \\\"mitomerarenaiWA\\\" << endl;\\n\\telse cout << \\\"Love \\\" << s.substr(0, ans) << \\\"!\\\" << endl;\\n}\",\n \"accuracy\": 0.5662650602409639,\n \"time_ms\": 90,\n \"memory_kb\": 36148,\n \"score_of_the_acc\": -1.1509,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2763_3718739\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nstruct RollingHash {\\n const int base = 10007;\\n static const int M = 2;\\n const vector<int> mod = {999999937, 1000000007};\\n vector<long long> hash[M], power[M];\\n RollingHash(const string &s, int base = 9973) : base(base) {\\n int n = s.size();\\n for (int iter = 0; iter < M; ++iter) {\\n hash[iter].assign(n + 1, 0);\\n power[iter].assign(n + 1, 1);\\n for (int i = 0; i < n; ++i) {\\n hash[iter][i + 1] = (hash[iter][i] * base + s[i]) % mod[iter];\\n power[iter][i + 1] = power[iter][i] * base % mod[iter];\\n }\\n }\\n }\\n long long get(int l, int r, int id = 0) { // [l, r)\\n long long ret = hash[id][r] - hash[id][l] * power[id][r-l] % mod[id];\\n return (ret < 0 ? ret + mod[id] : ret);\\n }\\n};\\n\\nint main() {\\n string s;\\n while (cin >> s) {\\n RollingHash rh(s);\\n int n = s.size();\\n int ans = n;\\n int a = n % 2 == 0 ? 2 : 1;\\n int b = n % 2 == 0 ? n / 2 - 1 : n / 2;\\n int c = b + a;\\n int d = n - a;\\n while (a < b) {\\n long long A = rh.get(0, a);\\n if (rh.get(b, c) == A && rh.get(d, n) == A && rh.get(a, b) == rh.get(c, d)) {\\n ans = min(ans, b);\\n }\\n a += 2; b -= 1; c += 1; d -= 2;\\n }\\n if (ans != n) {\\n cout << \\\"Love \\\" << s.substr(0, ans) << '!' << endl;\\n } else {\\n cout << \\\"mitomerarenaiWA\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 35664,\n \"score_of_the_acc\": -1.0577,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1658,"cells":{"group_id":{"kind":"string","value":"aoj_2770_cpp"},"problem_description":{"kind":"string","value":"F: リレー / Relay\n問題文\n湖に浮かぶ $N$ 個の小島からなるビワコという村がある．\nビワコ村には $N-1$ 本の簡単な作りの橋がある．\n島には $0$ から $N-1$ まで，橋には $0$ から $N-2$ までの番号が付けられている．\n$i$ 番の橋は $i+1$ 番の島と $p_i$ 番の島を直接つなぎ，長さは $w_i$ である．\n村人はどの島の間もいくつかの橋を通って相互に移動できるようになっている．\nある村人の提案により，ビワコ村でリレー大会が開催されることとなった．\nしかし，ビワコ村には閉路がなくトラックを用意できないため，\n現在ある橋を $1$ つだけ掛け替えることによって閉路を作ろうと考えた．\nこの操作によって用意できる閉路のうち，長さが最大となるものの長さを求めなさい．\n入力\n$N$\n$p_0 \\ w_0$\n$\\vdots$\n$p_{n-2} \\ w_{n-2}$\n制約\n$2 \\leq N \\leq 100000$\n$0 \\leq p_i \\leq N-1$\n$1 \\leq w_i \\leq 1000$\n全て整数\n全ての島と島の間が到達可能である\n出力\n答えを $1$ 行で出力せよ．\nサンプル\n各サンプルを図示すると次のようになる．\nサンプル入力1\n5\n0 1\n0 2\n0 3\n0 4\nサンプル出力1\n9\nサンプル入力2\n12\n0 6\n1 1\n0 3\n3 4\n0 2\n5 1\n6 1\n0 2\n8 1\n9 1\n10 2\nサンプル出力2\n19\nサンプル入力3\n2\n0 1\nサンプル出力3\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2770_10401948","code_snippet":"// AOJ #2770 Relay\n// 2025.4.21\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, 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 vector<vector<pair<int,int>>> adj(N);\n vector<tuple<int,int,int>> edges(N-1);\n for(int i = 0; i < N-1; i++){\n int v = Cin(), w = Cin();\n int u = i + 1;\n edges[i] = {u, v, w};\n adj[u].emplace_back(v, w);\n adj[v].emplace_back(u, w);\n }\n\n vector<int> parent(N, -1), pw(N, 0);\n vector<vector<int>> children(N);\n vector<int> idx(N, 0), post;\n post.reserve(N);\n vector<int> stk;\n stk.reserve(N);\n\n parent[0] = -2;\n stk.push_back(0);\n while(!stk.empty()){\n int u = stk.back();\n if(idx[u] < (int)adj[u].size()){\n auto [v, w] = adj[u][idx[u]++];\n if(parent[u] == v) continue;\n parent[v] = u;\n pw[v] = w;\n children[u].push_back(v);\n stk.push_back(v);\n } else {\n post.push_back(u);\n stk.pop_back();\n }\n }\n\n vector<ll> down1(N,0), down2(N,0), down3(N,0), sub_dia(N,0);\n vector<int> d1id(N,-1), d2id(N,-1), d3id(N,-1);\n vector<ll> child_dia1(N,0), child_dia2(N,0);\n vector<int> cd1id(N,-1);\n\n for(int u: post){\n for(int v: children[u]){\n ll h = down1[v] + pw[v];\n if(h > down1[u]){\n down3[u] = down2[u]; d3id[u] = d2id[u];\n down2[u] = down1[u]; d2id[u] = d1id[u];\n down1[u] = h, d1id[u] = v;\n } else if(h > down2[u]){\n down3[u] = down2[u]; d3id[u] = d2id[u];\n down2[u] = h, d2id[u] = v;\n } else if(h > down3[u]){\n down3[u] = h, d3id[u] = v;\n }\n }\n ll best1 = 0, best2 = 0;\n int best1idx = -1;\n for(int v: children[u]){\n ll cd = sub_dia[v];\n if(cd > best1){\n best2 = best1;\n best1 = cd;\n best1idx = v;\n } else if(cd > best2) best2 = cd;\n }\n child_dia1[u] = best1;\n child_dia2[u] = best2;\n cd1id[u] = best1idx;\n sub_dia[u] = max(best1, down1[u] + down2[u]);\n }\n\n vector<ll> up(N,0), dout(N,0);\n stk.clear();\n stk.push_back(0);\n while(!stk.empty()){\n int u = stk.back(); stk.pop_back();\n for(int v: children[u]){\n ll best_h = (d1id[u] != v ? down1[u]\n : (d2id[u] != v ? down2[u]\n : down3[u]));\n ll c1, c2;\n if(d1id[u] != v){\n c1 = down1[u];\n c2 = (d2id[u] != v ? down2[u] : down3[u]);\n } else {\n c1 = down2[u];\n c2 = down3[u];\n }\n ll cross = c1 + c2;\n ll bcd = (cd1id[u] != v ? child_dia1[u] : child_dia2[u]);\n\n ll best = dout[u];\n best = max(best, bcd);\n best = max(best, cross);\n best = max(best, up[u] + best_h);\n dout[v] = best;\n\n ll up_ex = max(up[u], best_h);\n up[v] = up_ex + pw[v];\n\n stk.push_back(v);\n }\n }\n\n ll ans = 0;\n for(auto [u, v, w] : edges){\n if(parent[v] == u) ans = max(ans, max(sub_dia[v], dout[v]) + w);\n else ans = max(ans, max(sub_dia[u], dout[u]) + w);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":24816,"score_of_the_acc":-0.1723,"final_rank":2},{"submission_id":"aoj_2770_4968872","code_snippet":"#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdlib>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\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 <type_traits>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n/* template start */\n\nusing i64 = std::int_fast64_t;\nusing u64 = std::uint_fast64_t;\n\n#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)\n#define all(i) i.begin(), i.end()\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() { std::cerr << std::endl; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmax(T1& a, T2 b) {\n return a < b && (a = b, true);\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmin(T1& a, T2 b) {\n return a > b && (a = b, true);\n}\n\ntemplate <typename Num>\nconstexpr Num mypow(Num a, u64 b, Num id = 1) {\n if (b == 0) return id;\n Num x = id;\n while (b > 0) {\n if (b & 1) x *= a;\n a *= a;\n b >>= 1;\n }\n return x;\n}\n\ntemplate <typename T>\nstd::vector<std::pair<std::size_t, T>> enumerate(const std::vector<T>& data) {\n std::vector<std::pair<std::size_t, T>> ret;\n for (std::size_t index = 0; index < data.size(); index++)\n ret.emplace_back(index, data[index]);\n return ret;\n}\n\n/* template end */\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n i64 n;\n std::cin>>n;\n\n using P=std::pair<i64,i64>;\n\n std::vector<std::vector<P>> graph(n);\n\n i64 ans=0;\n\n rep(i,1,n){\n i64 p,w;\n std::cin>>p>>w;\n\n chmax(ans,w);\n\n graph[i].emplace_back(p,w);\n graph[p].emplace_back(i,w);\n }\n\n std::vector<i64> arch(n,0),path_root(n,0);\n\n auto dfs1=[&](auto&& f,i64 now,i64 par)->void{\n arch[now] = 0;\n path_root[now] = 0;\n\n i64 first=0,second=0;\n\n for(auto itr = graph[now].begin();itr!=graph[now].end();){\n if(itr->first == par){\n itr = graph[now].erase(itr);\n continue;\n }\n\n const auto& [e,w] = *itr;\n\n f(f,e,now);\n chmax(arch[now],arch[e]);\n\n if(path_root[e] + w > first){\n second = first;\n first = path_root[e]+w;\n }else if(path_root[e] + w > second){\n second = path_root[e]+w;\n }\n\n itr++;\n }\n\n path_root[now] = first;\n chmax(arch[now],first+second);\n };\n\n dfs1(dfs1,0,-1);\n\n debug(arch);\n debug(path_root);\n\n auto dfs2=[&](auto&& f,i64 now,i64 par,i64 pw,i64 parch,i64 ppath)->void{\n if(par!=-1){\n chmax(ans,arch[now]+pw);\n chmax(ans,parch + pw);\n }\n\n debug(now,par,pw,parch,ppath);\n\n if(graph[now].empty())return;\n\n i64 m = graph[now].size();\n std::vector<i64> lfirst(m),lsecond(m),rfirst(m),rsecond(m);\n std::vector<i64> lmax(m),rmax(m);\n\n lfirst[0] = 0;\n lsecond[0] = 0;\n lmax[0]=0;\n rep(i,1,m){\n const auto& [e,w] = graph[now][i-1];\n lmax[i] = std::max(lmax[i-1],arch[e]);\n lfirst[i] = lfirst[i-1];\n lsecond[i] = lsecond[i-1];\n if(path_root[e] + w > lfirst[i-1]){\n lsecond[i] = lfirst[i-1];\n lfirst[i] = path_root[e]+w;\n }else if(path_root[e] + w > lsecond[i-1]){\n lfirst[i] = lfirst[i-1];\n lsecond[i] = path_root[e]+w;\n }\n }\n\n rfirst[m-1] = ppath + pw;\n rsecond[m-1] = 0;\n rmax[m-1] = parch;\n for(i64 i = m-2;i>=0;i--){\n const auto& [e,w] = graph[now][i+1];\n rmax[i] = std::max(rmax[i+1],arch[e]);\n rfirst[i] = rfirst[i+1];\n rsecond[i] = rsecond[i+1];\n if(path_root[e] + w > rfirst[i+1]){\n rsecond[i] = rfirst[i+1];\n rfirst[i] = path_root[e]+w;\n }else if(path_root[e]+w > rsecond[i+1]){\n rfirst[i] = rfirst[i+1];\n rsecond[i] = path_root[e]+w;\n }\n }\n\n if(now == 2){\n debug(rfirst);\n debug(rsecond);\n }\n\n rep(i,0,m){\n const auto& [e,w] = graph[now][i];\n i64 narch = std::max(lmax[i],rmax[i]);\n i64 npath = std::max(lfirst[i],rfirst[i]);\n std::vector<i64> tmp = {lfirst[i],lsecond[i],rfirst[i],rsecond[i]};\n std::sort(all(tmp),std::greater<i64>());\n chmax(narch,tmp[0]+tmp[1]);\n\n f(f,e,now,w,narch,npath);\n }\n };\n\n dfs2(dfs2,0,-1,0,0,0);\n\n std::cout<<ans<<\"\\n\";\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":58620,"score_of_the_acc":-1.147,"final_rank":9},{"submission_id":"aoj_2770_4968657","code_snippet":"#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdlib>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\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 <type_traits>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n/* template start */\n\nusing i64 = std::int_fast64_t;\nusing u64 = std::uint_fast64_t;\n\n#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)\n#define all(i) i.begin(), i.end()\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() { std::cerr << std::endl; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmax(T1& a, T2 b) {\n return a < b && (a = b, true);\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmin(T1& a, T2 b) {\n return a > b && (a = b, true);\n}\n\ntemplate <typename Num>\nconstexpr Num mypow(Num a, u64 b, Num id = 1) {\n if (b == 0) return id;\n Num x = id;\n while (b > 0) {\n if (b & 1) x *= a;\n a *= a;\n b >>= 1;\n }\n return x;\n}\n\ntemplate <typename T>\nstd::vector<std::pair<std::size_t, T>> enumerate(const std::vector<T>& data) {\n std::vector<std::pair<std::size_t, T>> ret;\n for (std::size_t index = 0; index < data.size(); index++)\n ret.emplace_back(index, data[index]);\n return ret;\n}\n\n/* template end */\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n i64 n;\n std::cin>>n;\n\n using P=std::pair<i64,i64>;\n\n std::vector<std::vector<P>> graph(n);\n\n i64 ans=0;\n\n rep(i,1,n){\n i64 p,w;\n std::cin>>p>>w;\n\n chmax(ans,w);\n\n graph[i].emplace_back(p,w);\n graph[p].emplace_back(i,w);\n }\n\n std::vector<i64> arch(n,0),path_root(n,0);\n\n auto dfs1=[&](auto&& f,i64 now,i64 par)->void{\n arch[now] = 0;\n path_root[now] = 0;\n\n i64 first=0,second=0;\n\n for(auto itr = graph[now].begin();itr!=graph[now].end();){\n if(itr->first == par){\n itr = graph[now].erase(itr);\n continue;\n }\n\n const auto& [e,w] = *itr;\n\n f(f,e,now);\n chmax(arch[now],arch[e]);\n\n if(path_root[e] + w > first){\n second = first;\n first = path_root[e]+w;\n }else if(path_root[e] + w > second){\n second = path_root[e]+w;\n }\n\n itr++;\n }\n\n path_root[now] = first;\n chmax(arch[now],first+second);\n };\n\n dfs1(dfs1,0,-1);\n\n auto dfs2=[&](auto&& f,i64 now,i64 par,i64 pw,i64 parch,i64 ppath)->void{\n if(par!=-1){\n chmax(ans,arch[now]+pw);\n chmax(ans,parch + pw);\n }\n\n if(graph[now].empty())return;\n\n i64 m = graph[now].size();\n std::vector<i64> lfirst(m),lsecond(m),rfirst(m),rsecond(m);\n std::vector<i64> lmax(m),rmax(m);\n\n lfirst[0] = 0;\n lsecond[0] = 0;\n lmax[0]=0;\n rep(i,1,m){\n const auto& [e,w] = graph[now][i-1];\n lmax[i] = std::max(lmax[i-1],arch[e]);\n if(path_root[e] + w > lfirst[i-1]){\n lsecond[i] = lfirst[i-1];\n lfirst[i] = path_root[e]+w;\n }else if(path_root[e] + w > lsecond[i-1]){\n lfirst[i] = lfirst[i-1];\n lsecond[i] = path_root[e]+w;\n }\n }\n\n rfirst[m-1] = ppath + pw;\n rsecond[m-1] = 0;\n rmax[m-1] = parch;\n for(i64 i = m-2;i>=0;i--){\n const auto& [e,w] = graph[now][i+1];\n rmax[i] = std::max(rmax[i+1],arch[e]);\n if(path_root[e] + w > rfirst[i+1]){\n rsecond[i] = rfirst[i+1];\n rfirst[i] = path_root[e]+w;\n }else if(path_root[e]+w > rsecond[i+1]){\n rfirst[i] = rfirst[i+1];\n rsecond[i] = path_root[e]+w;\n }\n }\n\n rep(i,0,m){\n const auto& [e,w] = graph[now][i];\n i64 narch = std::max(lmax[i],rmax[i]);\n i64 npath = std::max(lfirst[i],rfirst[i]);\n std::vector<i64> tmp = {lfirst[i],lsecond[i],rfirst[i],rsecond[i]};\n std::sort(all(tmp),std::greater<i64>());\n chmax(narch,tmp[0]+tmp[1]);\n\n f(f,e,now,w,narch,npath);\n }\n };\n\n dfs2(dfs2,0,-1,0,0,0);\n\n std::cout<<ans<<\"\\n\";\n\n return 0;\n}","accuracy":0.2542372881355932,"time_ms":30,"memory_kb":16220,"score_of_the_acc":-0.1007,"final_rank":20},{"submission_id":"aoj_2770_4968551","code_snippet":"#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdlib>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\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 <type_traits>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n/* template start */\n\nusing i64 = std::int_fast64_t;\nusing u64 = std::uint_fast64_t;\n\n#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)\n#define all(i) i.begin(), i.end()\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() { std::cerr << std::endl; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmax(T1& a, T2 b) {\n return a < b && (a = b, true);\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmin(T1& a, T2 b) {\n return a > b && (a = b, true);\n}\n\ntemplate <typename Num>\nconstexpr Num mypow(Num a, u64 b, Num id = 1) {\n if (b == 0) return id;\n Num x = id;\n while (b > 0) {\n if (b & 1) x *= a;\n a *= a;\n b >>= 1;\n }\n return x;\n}\n\ntemplate <typename T>\nstd::vector<std::pair<std::size_t, T>> enumerate(const std::vector<T>& data) {\n std::vector<std::pair<std::size_t, T>> ret;\n for (std::size_t index = 0; index < data.size(); index++)\n ret.emplace_back(index, data[index]);\n return ret;\n}\n\n/* template end */\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n i64 n;\n std::cin>>n;\n\n using P=std::pair<i64,i64>;\n\n std::vector<std::vector<P>> graph(n);\n\n i64 ans=0;\n\n rep(i,1,n){\n i64 p,w;\n std::cin>>p>>w;\n\n chmax(ans,w);\n\n graph[i].emplace_back(p,w);\n graph[p].emplace_back(i,w);\n }\n\n std::vector<i64> arch(n,0),path_root(n,0);\n\n auto dfs1=[&](auto&& f,i64 now,i64 par)->void{\n arch[now] = 0;\n path_root[now] = 0;\n\n i64 first=0,second=0;\n\n for(auto itr = graph[now].begin();itr!=graph[now].end();){\n if(itr->first == par){\n itr = graph[now].erase(itr);\n continue;\n }\n\n const auto& [e,w] = *itr;\n\n f(f,e,now);\n chmax(arch[now],arch[e]);\n\n if(path_root[e] + w > first){\n second = first;\n first = path_root[e]+w;\n }else if(path_root[e] + w > second){\n second = path_root[e]+w;\n }\n\n itr++;\n }\n\n path_root[now] = first;\n chmax(arch[now],first+second);\n };\n\n dfs1(dfs1,0,-1);\n\n auto dfs2=[&](auto&& f,i64 now,i64 par,i64 pw,i64 parch,i64 ppath)->void{\n if(par!=-1){\n chmax(ans,arch[now]+pw);\n chmax(ans,parch + pw);\n }\n\n if(graph[now].empty())return;\n\n i64 m = graph[now].size();\n std::vector<i64> lfirst(m),lsecond(m),rfirst(m),rsecond(m);\n std::vector<i64> lmax(m),rmax(m);\n\n lfirst[0] = 0;\n lsecond[0] = 0;\n lmax[0]=0;\n rep(i,1,m){\n const auto& [e,w] = graph[now][i-1];\n lmax[i] = std::max(lmax[i-1],arch[e]);\n if(path_root[e] + w > lfirst[i-1]){\n lsecond[i] = lfirst[i-1];\n lfirst[i] = path_root[e]+w;\n }else if(path_root[e] + w > lsecond[i-1]){\n lfirst[i] = lfirst[i-1];\n lsecond[i] = path_root[e]+w;\n }\n }\n\n rfirst[m-1] = ppath + pw;\n rsecond[m-1] = 0;\n rmax[m-1] = parch;\n for(i64 i = m-2;i>=0;i--){\n const auto& [e,w] = graph[now][i+1];\n rmax[i] = std::max(rmax[i+1],arch[e]);\n if(path_root[e] + w > rfirst[i+1]){\n rsecond[i] = rfirst[i+1];\n rfirst[i] = path_root[e]+w;\n }else if(path_root[e]+w > rsecond[i+1]){\n rfirst[i] = rfirst[i+1];\n rsecond[i] = path_root[e]+w;\n }\n }\n\n rep(i,0,m){\n const auto& [e,w] = graph[now][i];\n i64 narch = std::max(lmax[i],rmax[i]);\n i64 npath = std::max(lfirst[i],rfirst[i]);\n std::vector<i64> tmp = {lfirst[i],lsecond[i],rfirst[i],rsecond[i]};\n std::sort(all(tmp),std::greater<i64>());\n chmax(narch,tmp[0]+tmp[1]);\n\n f(f,e,now,w,narch,npath);\n }\n };\n\n dfs2(dfs2,0,-1,0,0,0);\n\n std::cout<<ans<<\"\\n\";\n\n return 0;\n}","accuracy":0.2542372881355932,"time_ms":30,"memory_kb":16184,"score_of_the_acc":-0.1,"final_rank":19},{"submission_id":"aoj_2770_4964391","code_snippet":"#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#include <cassert>\n#include <functional>\n\ntypedef long long ll;\nusing namespace std;\n\n#ifndef LOCAL\n#define debug(...) ;\n#else\n#define debug(...) cerr << __LINE__ << \" : \" << #__VA_ARGS__ << \" = \" << _tostr(__VA_ARGS__) << endl;\n\ntemplate<typename T>\nostream &operator<<(ostream &out, const vector<T> &v);\n\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &out, const pair<T1, T2> &p) {\n out << \"{\" << p.first << \", \" << p.second << \"}\";\n return out;\n}\n\ntemplate<typename T>\nostream &operator<<(ostream &out, const vector<T> &v) {\n out << '{';\n for (const T &item : v) out << item << \", \";\n out << \"\\b\\b}\";\n return out;\n}\n\nvoid _tostr_rec(ostringstream &oss) {\n oss << \"\\b\\b \\b\";\n}\n\ntemplate<typename Head, typename... Tail>\nvoid _tostr_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << head << \", \";\n _tostr_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate<typename... T>\nstring _tostr(T &&... args) {\n ostringstream oss;\n int size = sizeof...(args);\n if (size > 1) oss << \"{\";\n _tostr_rec(oss, forward<T>(args)...);\n if (size > 1) oss << \"}\";\n return oss.str();\n}\n#endif\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 300000000 //3e8\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 200010\n\nvector<pair<int, int>> G[SIZE];\npair<int, int> lE[SIZE][3];\nint cSize[SIZE];\n\npair<int, int> dfs1(int now) {\n cSize[now] = 1;\n for (auto p : G[now]) {\n auto res = dfs1(p.first);\n cSize[now] += res.second;\n int e = max(res.first, p.second);\n lE[now][2] = max(lE[now][2], {e, p.first});\n if (lE[now][1] < lE[now][2]) swap(lE[now][1], lE[now][2]);\n if (lE[now][0] < lE[now][1]) swap(lE[now][0], lE[now][1]);\n }\n\n return {lE[now][0].first, cSize[now]};\n}\n\nint ans = 0;\n\npair<pair<int, int>, int> dfs2(int now, int L) { // {max dist, max (dist + w)}\n int D = 0, DW = -INF, W = -INF, DD = -INF;\n\n for (auto p : G[now]) {\n int to = p.first;\n int l = lE[now][0].second == to ? lE[now][1].first : lE[now][0].first;\n auto res = dfs2(p.first, max({L, l, p.second}));\n\n int d = res.first.first + p.second;\n int dw = res.first.second + p.second;\n int w = max(p.second, res.second);\n\n ans = max(ans, D + d + L);\n ans = max(ans, D + dw);\n ans = max(ans, DW + d);\n ans = max(ans, DD + w);\n\n DW = max({DW, dw, d + W, D + w});\n DD = max(DD, D + d);\n D = max(D, d);\n W = max(W, w);\n }\n\n debug(now, ans, L, D, DW, W);\n\n return {{D, DW}, W};\n}\n\nint inEdge[SIZE] = {};\n\nint main() {\n int N, sumW = 0;\n\n scanf(\"%d\", &N);\n\n for (int i = 1; i < N; i++) {\n int p, w;\n scanf(\"%d%d\", &p, &w);\n G[p].push_back({i, w});\n sumW += w;\n inEdge[p]++;\n inEdge[i]++;\n }\n\n int counter = 0;\n\n for (int i = 0; i < N; i++) {\n counter += inEdge[i] == 1;\n if (inEdge[i] > 2) counter = INF;\n }\n\n if (counter == 2) {\n printf(\"%d\\n\", sumW);\n return 0;\n }\n\n dfs1(0);\n dfs2(0, -INF);\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":17808,"score_of_the_acc":-0.1324,"final_rank":1},{"submission_id":"aoj_2770_4964330","code_snippet":"#if 1\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <queue>\n#include <stack>\n#include <array>\n#include <deque>\n#include <algorithm>\n#include <utility>\n#include <cstdint>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <assert.h>\n#include <bitset>\n#include <list>\n#include <cmath>\n//#include <atcoder/all>\n\nauto& in = std::cin;\nauto& out = std::cout;\n#define all_range(C) std::begin(C), std::end(C)\nconst double PI = 3.141592653589793238462643383279502884197169399375105820974944;\n\n\ntemplate<typename T, typename U>\nstd::enable_if_t<std::rank<T>::value == 0> fill_all(T& arr, const U& v) {\n arr = v;\n}\ntemplate<typename ARR, typename U>\nstd::enable_if_t<std::rank<ARR>::value != 0> fill_all(ARR& arr, const U& v) {\n for (auto& i : arr) {\n fill_all(i, v);\n }\n}\n\nstd::map<int, int> graph[100000];\nint N;\nbool used_v[100000];\nint parent[100000];\nint32_t D[100000];\nvoid dfs(int v, int p, int32_t depth) {\n parent[v] = p;\n D[v] = depth;\n for (auto& next : graph[v]) {\n if (next.first == p) { continue; }\n dfs(next.first, v, depth + next.second);\n }\n}\n\nint32_t maxdp[100000];\nint32_t maxdep(int v, int p) {\n if (maxdp[v] != -1) { return maxdp[v]; }\n maxdp[v] = D[v];\n for (auto& next : graph[v]) {\n if (next.first == p) { continue; }\n if (used_v[next.first]) { continue; }\n maxdp[v] = std::max(maxdp[v], maxdep(next.first, v));\n }\n return maxdp[v];\n}\n\nint main()\n{\n using std::endl;\n using std::cout;\n in.sync_with_stdio(false);\n out.sync_with_stdio(false);\n in.tie(nullptr);\n out.tie(nullptr);\n\n in >> N;\n for (size_t i = 0; i < N-1; i++)\n {\n int b, l;\n in >> b >> l;\n graph[i + 1].insert({ b, l });\n graph[b].insert({ i + 1, l });\n }\n\n dfs(0, -1, 0);\n int maxa = std::max_element(D, D + N) - D;\n dfs(maxa, -1, 0);\n int maxb = std::max_element(D, D + N) - D;\n\n int32_t used_max = 0;\n int v = maxb;\n while (true) {\n used_v[v] = true;\n if (parent[v] == -1) { break; }\n if (used_max < graph[v][parent[v]]) {\n used_max = graph[v][parent[v]];\n }\n\n v = parent[v];\n }\n\n int32_t not_used_max = 0;\n for (size_t i = 0; i < N; i++)\n {\n for (auto& edge : graph[i]) {\n if (used_v[i] && used_v[edge.first]) { continue; }\n if (not_used_max < edge.second) {\n not_used_max = edge.second;\n }\n }\n }\n int32_t res = D[maxb] + not_used_max;\n\n //graph[used_max_a].erase(used_max_b);\n //graph[used_max_b].erase(used_max_a);\n\n //fill_all(D, -1);\n //dfs(used_max_a, -1, 0);\n //dfs(std::max_element(D, D + N) - D, -1, 0);\n //res = std::max(res, (*std::max_element(D, D + N)) + used_max);\n\n //fill_all(D, -1);\n //dfs(used_max_b, -1, 0);\n //dfs(std::max_element(D, D + N) - D, -1, 0);\n //res = std::max(res, (*std::max_element(D, D + N)) + used_max);\n\n fill_all(maxdp, -1);\n v = maxb;\n used_max = 0;\n while (true) {\n if (parent[v] == -1) { break; }\n used_max = std::max(used_max, graph[v][parent[v]]);\n res = std::max(res, maxdep(parent[v], -1) + used_max);\n v = parent[v];\n }\n\n dfs(maxb, -1, 0);\n fill_all(maxdp, -1);\n v = maxa;\n used_max = 0;\n while (true) {\n if (parent[v] == -1) { break; }\n used_max = std::max(used_max, graph[v][parent[v]]);\n res = std::max(res, maxdep(parent[v], -1) + used_max);\n v = parent[v];\n }\n\n out << res << endl;\n\n return 0;\n}\n#endif","accuracy":1,"time_ms":120,"memory_kb":23148,"score_of_the_acc":-1.139,"final_rank":8},{"submission_id":"aoj_2770_4937089","code_snippet":"//\n// Created by yamunaku on 2020/10/23.\n//\n\n#include <bits/stdc++.h>\n//#include <atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define repl(i, l, r) for(int i = (l); i < (r); i++)\n#define per(i, n) for(int i = ((n)-1); i >= 0; i--)\n#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)\n#define all(x) (x).begin(),(x).end()\n#define MOD9 998244353\n#define MOD1 1000000007\n#define IINF 1000000000\n#define LINF 1000000000000000000\n#define SP <<\" \"<<\n#define CYES cout<<\"Yes\"<<endl\n#define CNO cout<<\"No\"<<endl\n#define CFS cin.tie(0);ios::sync_with_stdio(false)\n#define CST(x) cout<<fixed<<setprecision(x)\n\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing mti = vector<vector<int>>;\nusing vl = vector<ll>;\nusing mtl = vector<vector<ll>>;\nusing pi = pair<int, int>;\nusing pl = pair<ll, ll>;\ntemplate<typename T>\nusing heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;\n\nvector<pair<int, int>> p;\nvector<vector<pair<int, int>>> ch;\n\nstruct status {\n int top;\n int ans;\n};\n\npair<int, int> get2(pair<int, int> pp, int x) {\n if (x > pp.first) return {x, pp.first};\n else if (x > pp.second) return {pp.first, x};\n else return pp;\n}\n\nvector<status> s;\n\nint answer = 0;\n\nstatus dfs(int x) {\n status ans = {0, 0};\n pair<int, int> top2 = {0, 0};\n for (auto &p : ch[x]) {\n auto ret = dfs(p.first);\n ret.top += p.second;\n top2 = get2(top2, ret.top);\n ans.ans = max(ans.ans, ret.ans);\n answer = max(answer, ret.ans + p.second);\n }\n ans.top = max(ans.top, top2.first);\n ans.ans = max(ans.ans, top2.first + top2.second);\n s[x] = ans;\n return s[x];\n}\n\nvoid zendfs(int x, int ans, int top) {\n int sz = ch[x].size();\n vector<pair<int, int>> pl(sz + 1, {0, 0});\n vector<pair<int, int>> pr(sz + 1, {0, 0});\n vi ansl(sz + 1, ans), ansr(sz + 1, ans);\n rep(i, sz) {\n pl[i + 1] = get2(pl[i], s[ch[x][i].first].top + ch[x][i].second);\n ansl[i + 1] = max(ansl[i], s[ch[x][i].first].ans);\n }\n per(i, sz) {\n pr[i] = get2(pr[i + 1], s[ch[x][i].first].top + ch[x][i].second);\n ansr[i] = max(ansr[i + 1], s[ch[x][i].first].ans);\n }\n rep(i, sz) {\n auto pp = pl[i];\n pp = get2(pp, pr[i + 1].first);\n pp = get2(pp, pr[i + 1].second);\n pp = get2(pp, top);\n int k = max(max(ansl[i], ansr[i + 1]), pp.first + pp.second);\n// cout << ch[x][i].first SP pp.first SP pp.second SP ansl[i] SP ansr[i] SP k << endl;\n answer = max(answer, k + ch[x][i].second);\n zendfs(ch[x][i].first, k, pp.first + ch[x][i].second);\n }\n}\n\nvector<vector<pair<int, int>>> e;\n\nvoid indfs(int x, int prnt, int &c) {\n int now = c;\n// cout << x SP c << endl;\n c++;\n for (auto &nx : e[x]) {\n if (nx.first == prnt) continue;\n p[c] = {now, nx.second};\n ch[now].emplace_back(c, nx.second);\n indfs(nx.first, x, c);\n }\n}\n\nint main() {\n //CFS;\n int n;\n cin >> n;\n p = vector<pair<int, int>>(n, {0, 0});\n ch = vector<vector<pair<int, int>>>(n);\n s = vector<status>(n);\n e = vector<vector<pair<int, int>>>(n);\n rep(i, n - 1) {\n int to, w;\n cin >> to >> w;\n e[i + 1].emplace_back(to, w);\n e[to].emplace_back(i + 1, w);\n }\n int idx = 0;\n indfs(0, 0, idx);\n dfs(0);\n zendfs(0, 0, 0);\n cout << answer << endl;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":37336,"score_of_the_acc":-0.8222,"final_rank":5},{"submission_id":"aoj_2770_4936965","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 = 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 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 = mod) {\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}\n\nconst int mn = 1 << 18;\nstruct edge {\n\tint to; int cost;\n};\nusing Data = P;\nvector<edge> G[mn];\nvector<int> ids[mn];\nvector<Data> memo[mn];\nvector<int> costs[mn];\nint root;\n\nData merge(Data a, Data b) {\n\tData res;\n\t//\n\tres.first = max(a.first, b.first);\n\tres.second = max({ a.second,b.second,a.first + b.first });\n\t//\n\treturn res;\n}\n\nint ans = 0;\nData dfs(int id, int fr) {\n\tData res;\n\t//\n\t//initialize\n\tres = { 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\n\t\t//calc ans\n\t\tans = max(ans, e.cost + nex.second);\n\t\t//\n\t\t//update with edge\n\t\tnex.first += e.cost;\n\t\tnex.second = max(nex.second, nex.first);\n\t\t//\n\t\tres = merge(res, nex);\n\t\tids[id].push_back(e.to);\n\t\tmemo[id].push_back(nex);\n\t\tcosts[id].push_back(e.cost);\n\t}\n\t//\n\t//update for return\n\t//\n\treturn res;\n}\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\t//calcurate id's ans\n\t//\n\tvector<Data> le(len + 1);\n\tvector<Data> ri(len + 1);\n\t//\n\tData init_c = { 0,0 };\n\t//\n\tle[0] = init_c;\n\trep(i, len) {\n\t\tle[i + 1] = merge(le[i], v[i]);\n\t}\n\tri[len] = init_c;\n\tper(i, len) {\n\t\tri[i] = merge(ri[i + 1], v[i]);\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\t\tans = max(ans, costs[id][i] + d.second);\n\t\t//\n\t\t//update for return\n\t\td.first += costs[id][i];\n\t\td.second = max(d.first, d.second);\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}\nvoid solve() {\n\tint n; cin >> n;\n\trep(i, n - 1) {\n\t\tint p, w; cin >> p >> w;\n\t\tG[i + 1].push_back({ p,w });\n\t\tG[p].push_back({ i + 1,w });\n\t}\n\tyaru();\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\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":66288,"score_of_the_acc":-1.5,"final_rank":10},{"submission_id":"aoj_2770_4322974","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 100005\n\nstruct Edge{\n\tEdge(int arg_to,ll arg_weight){\n\t\tto = arg_to;\n\t\tweight = arg_weight;\n\t}\n\tint to;\n\tll weight;\n};\n\nstruct Info{\n\tInfo(int arg_node_id,int arg_pre){\n\t\tnode_id = arg_node_id;\n\t\tpre = arg_pre;\n\t}\n\tint node_id,pre;\n};\n\nint N;\nint root = 0;\nint leaf[SIZE];\nint num_visit;\nint LEFT[SIZE],RIGHT[SIZE];\nll PARENT[SIZE],num_OUT[SIZE],W[SIZE],euler_W[SIZE],edge_W[SIZE];\nll nodes[2*SIZE+5],max_L[2*SIZE+5],max_R[2*SIZE+5];\nvector<Edge> G[SIZE];\n\n//オイラーツアーで、ノードのカバー範囲を計算する\nvoid euler_tour(int node_id,int pre_node,ll sum){\n\teuler_W[node_id] = sum;\n\tnodes[num_visit] = node_id;\n\tLEFT[node_id] = num_visit++;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tif(G[node_id][i].to == pre_node)continue;\n\t\tedge_W[G[node_id][i].to] = G[node_id][i].weight; //入次の重み\n\t\teuler_tour(G[node_id][i].to,node_id,sum+G[node_id][i].weight);\n\t}\n\tnodes[num_visit] = node_id;\n\tRIGHT[node_id] = num_visit++;\n}\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tint from;\n\tll weight;\n\n\tfor(int to = 1; to <= N-1; to++){\n\t\tscanf(\"%d %lld\",&from,&weight);\n\t\tG[from].push_back(Edge(to,weight));\n\t\tG[to].push_back(Edge(from,weight));\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnum_OUT[i] = 0;\n\t}\n\n\tqueue<Info> Q;\n\tQ.push(Info(root,-1));\n\n\twhile(!Q.empty()){\n\n\t\tPARENT[Q.front().node_id] = Q.front().pre;\n\n\t\tfor(int i = 0; i < G[Q.front().node_id].size(); i++){\n\t\t\tint next = G[Q.front().node_id][i].to;\n\t\t\tif(next == Q.front().pre)continue;\n\n\t\t\tnum_OUT[Q.front().node_id]++;\n\n\t\t\tQ.push(Info(next,Q.front().node_id));\n\t\t}\n\t\tQ.pop();\n\t}\n\n\tll maximum = 0;\n\tint A,B;\n\n\tqueue<int> NODE;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(num_OUT[i] == 0){\n\t\t\tleaf[i] = i;\n\t\t\tW[i] = 0;\n\t\t\tNODE.push(i);\n\t\t}\n\t}\n\n\tll max_path1,max_path2;\n\tint a,b;\n\n\twhile(!NODE.empty()){\n\n\t\tint node = NODE.front();\n\t\tNODE.pop();\n\n\t\tmax_path1 = 0;\n\t\tmax_path2 = 0;\n\n\t\tb = node;\n\n\t\tfor(int i = 0; i < G[node].size(); i++){\n\n\t\t\tint child = G[node][i].to;\n\t\t\tif(child == PARENT[node])continue;\n\n\t\t\tll tmp = W[child]+G[node][i].weight;\n\n\t\t\tif(tmp > max_path1){\n\n\t\t\t\tmax_path2 = max_path1;\n\t\t\t\tb = a;\n\t\t\t\tmax_path1 = tmp;\n\t\t\t\tW[node] = tmp;\n\t\t\t\tleaf[node] = leaf[child];\n\t\t\t\ta = leaf[child];\n\n\t\t\t}else if(tmp > max_path2){\n\n\t\t\t\tmax_path2 = tmp;\n\t\t\t\tb = leaf[child];\n\t\t\t}\n\t\t}\n\n\t\tif(max_path1+max_path2 > maximum){\n\n\t\t\tmaximum = max_path1+max_path2;\n\t\t\tA = a;\n\t\t\tB = b;\n\t\t}\n\t\tif(PARENT[node] != -1){\n\t\t\tnum_OUT[PARENT[node]]--;\n\t\t}\n\t\tif(num_OUT[PARENT[node]] == 0){\n\n\t\t\tNODE.push(PARENT[node]);\n\t\t}\n\t}\n\tnum_visit = 0;\n\teuler_tour(A,-1,0);\n\n\t//基準点より左の最大重み\n\tmax_L[0] = euler_W[A];\n\tfor(int i = 1; i < 2*N; i++){\n\n\t\tmax_L[i] = max(max_L[i-1],euler_W[nodes[i]]);\n\t}\n\tmax_R[2*N-1] = euler_W[A];\n\tfor(int i = 2*N-2; i >= 0; i--){\n\n\t\tmax_R[i] = max(max_R[i+1],euler_W[nodes[i]]);\n\t}\n\n\tll ans = 0;\n\tll w_L,w_R;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(i == A)continue;\n\n\t\tif(LEFT[i] > 0){\n\n\t\t\tw_L = max_L[LEFT[i]-1];\n\t\t}\n\t\tif(RIGHT[i]+1 < 2*N){\n\n\t\t\tw_R = max_R[RIGHT[i]+1];\n\t\t}\n\t\tans = max(ans,edge_W[i]+max(w_L,w_R));\n\t}\n\n\tnum_visit = 0;\n\tedge_W[B] = 0;\n\teuler_tour(B,-1,0);\n\n\t//基準点より左の最大重み\n\tmax_L[0] = euler_W[B];\n\tfor(int i = 1; i < 2*N; i++){\n\n\t\tmax_L[i] = max(max_L[i-1],euler_W[nodes[i]]);\n\t}\n\tmax_R[2*N-1] = euler_W[B];\n\tfor(int i = 2*N-2; i >= 0; i--){\n\n\t\tmax_R[i] = max(max_R[i+1],euler_W[nodes[i]]);\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(i == B)continue;\n\n\t\tif(LEFT[i] > 0){\n\n\t\t\tw_L = max_L[LEFT[i]-1];\n\t\t}\n\t\tif(RIGHT[i]+1 < 2*N){\n\n\t\t\tw_R = max_R[RIGHT[i]+1];\n\t\t}\n\t\tans = max(ans,edge_W[i]+max(w_L,w_R));\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":26852,"score_of_the_acc":-0.7129,"final_rank":4},{"submission_id":"aoj_2770_4322972","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 100005\n\nstruct Edge{\n\tEdge(int arg_to,ll arg_weight){\n\t\tto = arg_to;\n\t\tweight = arg_weight;\n\t}\n\tint to;\n\tll weight;\n};\n\nstruct Info{\n\tInfo(int arg_node_id,int arg_pre){\n\t\tnode_id = arg_node_id;\n\t\tpre = arg_pre;\n\t}\n\tint node_id,pre;\n};\n\nint N;\nint root = 0;\nint leaf[SIZE];\nint num_visit;\nint LEFT[SIZE],RIGHT[SIZE];\nll PARENT[SIZE],num_OUT[SIZE],W[SIZE],euler_W[SIZE],edge_W[SIZE];\nll nodes[2*SIZE+5],max_L[2*SIZE+5],max_R[2*SIZE+5];\nvector<Edge> G[SIZE];\n\n//オイラーツアーで、ノードのカバー範囲を計算する\nvoid euler_tour(int node_id,int pre_node,ll sum){\n\teuler_W[node_id] = sum;\n\tnodes[num_visit] = node_id;\n\tLEFT[node_id] = num_visit++;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tif(G[node_id][i].to == pre_node)continue;\n\t\tedge_W[G[node_id][i].to] = G[node_id][i].weight; //入次の重み\n\t\teuler_tour(G[node_id][i].to,node_id,sum+G[node_id][i].weight);\n\t}\n\tnodes[num_visit] = node_id;\n\tRIGHT[node_id] = num_visit++;\n}\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tint from;\n\tll weight;\n\n\tfor(int to = 1; to <= N-1; to++){\n\t\tscanf(\"%d %lld\",&from,&weight);\n\t\tG[from].push_back(Edge(to,weight));\n\t\tG[to].push_back(Edge(from,weight));\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnum_OUT[i] = 0;\n\t}\n\n\tqueue<Info> Q;\n\tQ.push(Info(root,-1));\n\n\twhile(!Q.empty()){\n\n\t\tPARENT[Q.front().node_id] = Q.front().pre;\n\n\t\tfor(int i = 0; i < G[Q.front().node_id].size(); i++){\n\t\t\tint next = G[Q.front().node_id][i].to;\n\t\t\tif(next == Q.front().pre)continue;\n\n\t\t\tnum_OUT[Q.front().node_id]++;\n\n\t\t\tQ.push(Info(next,Q.front().node_id));\n\t\t}\n\t\tQ.pop();\n\t}\n\n\tll maximum = 0;\n\tint A,B;\n\n\tqueue<int> NODE;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(num_OUT[i] == 0){\n\t\t\tleaf[i] = i;\n\t\t\tW[i] = 0;\n\t\t\tNODE.push(i);\n\t\t}\n\t}\n\n\tll max_path1,max_path2;\n\tint a,b;\n\n\twhile(!NODE.empty()){\n\n\t\tint node = NODE.front();\n\t\tNODE.pop();\n\n\t\tmax_path1 = 0;\n\t\tmax_path2 = 0;\n\n\t\tb = node;\n\n\t\tfor(int i = 0; i < G[node].size(); i++){\n\n\t\t\tint child = G[node][i].to;\n\t\t\tif(child == PARENT[node])continue;\n\n\t\t\tll tmp = W[child]+G[node][i].weight;\n\n\t\t\tif(tmp > max_path1){\n\n\t\t\t\tmax_path2 = max_path1;\n\t\t\t\tb = a;\n\t\t\t\tmax_path1 = tmp;\n\t\t\t\tW[node] = tmp;\n\t\t\t\tleaf[node] = leaf[child];\n\t\t\t\ta = leaf[child];\n\n\t\t\t}else if(tmp > max_path2){\n\n\t\t\t\tmax_path2 = tmp;\n\t\t\t\tb = leaf[child];\n\t\t\t}\n\t\t}\n\n\t\t/*if(node == root){\n\t\t\tprintf(\"max_path1:%lld path2:%lld\\n\",max_path1,max_path2);\n\t\t\tprintf(\"a:%d b:%d\\n\",a,b);\n\t\t}*/\n\n\t\tif(max_path1+max_path2 > maximum){\n\n\t\t\tmaximum = max_path1+max_path2;\n\t\t\tA = a;\n\t\t\tB = b;\n\t\t}\n\t\tif(PARENT[node] != -1){\n\t\t\tnum_OUT[PARENT[node]]--;\n\t\t}\n\t\tif(num_OUT[PARENT[node]] == 0){\n\n\t\t\tNODE.push(PARENT[node]);\n\t\t}\n\t}\n\n\t/*printf(\"maximum:%lld\\n\",maximum);\n\tprintf(\"A:%d B:%d\\n\",A,B);\n*/\n\tnum_visit = 0;\n\teuler_tour(A,-1,0);\n\n\t//基準点より左の最大重み\n\tmax_L[0] = euler_W[A];\n\tfor(int i = 1; i < 2*N; i++){\n\n\t\tmax_L[i] = max(max_L[i-1],euler_W[nodes[i]]);\n\t}\n\tmax_R[2*N-1] = euler_W[A];\n\tfor(int i = 2*N-2; i >= 0; i--){\n\n\t\tmax_R[i] = max(max_R[i+1],euler_W[nodes[i]]);\n\t}\n\n\tll ans = 0;\n\tll w_L,w_R;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(i == A)continue;\n\n\t\tif(LEFT[i] > 0){\n\n\t\t\tw_L = max_L[LEFT[i]-1];\n\t\t}\n\t\tif(RIGHT[i]+1 < 2*N){\n\n\t\t\tw_R = max_R[RIGHT[i]+1];\n\t\t}\n\t\tans = max(ans,edge_W[i]+max(w_L,w_R));\n\t}\n\n\tnum_visit = 0;\n\tedge_W[B] = 0;\n\teuler_tour(B,-1,0);\n\n\t//基準点より左の最大重み\n\tmax_L[0] = euler_W[B];\n\tfor(int i = 1; i < 2*N; i++){\n\n\t\tmax_L[i] = max(max_L[i-1],euler_W[nodes[i]]);\n\t}\n\tmax_R[2*N-1] = euler_W[B];\n\tfor(int i = 2*N-2; i >= 0; i--){\n\n\t\tmax_R[i] = max(max_R[i+1],euler_W[nodes[i]]);\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(i == B)continue;\n\n\t\tif(LEFT[i] > 0){\n\n\t\t\tw_L = max_L[LEFT[i]-1];\n\t\t}\n\t\tif(RIGHT[i]+1 < 2*N){\n\n\t\t\tw_R = max_R[RIGHT[i]+1];\n\t\t}\n\t\tans = max(ans,edge_W[i]+max(w_L,w_R));\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":26856,"score_of_the_acc":-0.613,"final_rank":3},{"submission_id":"aoj_2770_3723523","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\n\n\nvector<P> G[100001];\nvector<P> dp1(100000);\nP dfs1(int u,int t){\n P ret;\n ret.first=0;\n ret.second=0;\n for(auto v:G[u]){\n if(v.first==t) continue;\n P p = dfs1(v.first,u);\n ret.first=max(ret.first,p.first+v.second);\n ret.second=max({ret.second,p.second,v.second});\n }\n return dp1[u]=ret;\n}\n\nint dfs2(int u,int t,int d,int e){\n vector<pair<P,int>> A;\n vector<P> dd,ee;\n A.push_back({{0,0},-1});\n A.push_back({{0,0},-1});\n for(auto v:G[u]){\n if(v.first==t){\n A.push_back({{d+v.second,e},v.first});\n }\n else{\n A.push_back({{dp1[v.first].first+v.second,max(dp1[v.first].second,v.second)},v.first});\n }\n }\n sort(A.rbegin(),A.rend());\n int ret=0;\n for(auto v:A){\n int sum = v.first.second;\n if(v.second==A[0].second){\n sum += A[1].first.first;\n sum += A[2].first.first;\n }\n else if(v.second==A[1].second){\n sum += A[0].first.first;\n sum += A[2].first.first;\n }\n else{\n sum += A[0].first.first;\n sum += A[1].first.first;\n }\n ret = max(ret,sum);\n\n dd.push_back({v.first.first,v.second});\n ee.push_back({v.first.second,v.second});\n }\n sort(dd.rbegin(),dd.rend());\n sort(ee.rbegin(),ee.rend());\n for(auto v:G[u]){\n if(v.first==t) continue;\n int nd=dd[0].first,ne=ee[0].first;\n if(dd[0].second==v.first) nd=dd[1].first;\n if(ee[0].second==v.first) ne=ee[1].first;\n ret=max(ret,dfs2(v.first,u,nd,max(ne,v.second)));\n }\n return ret;\n}\n\nint main(){\n int n;cin >> n;\n for (int i = 0; i < n-1; i++) {\n int p,w;cin >> p >> w;\n G[i+1].push_back({p,w});\n G[p].push_back({i+1,w});\n }\n dfs1(0,-1);\n cout << dfs2(0,-1,0,0) << endl;\n}","accuracy":1,"time_ms":110,"memory_kb":46648,"score_of_the_acc":-1.508,"final_rank":11},{"submission_id":"aoj_2770_3720684","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N;\nvector<pair<int,int> >G[1<<17];\npair<int,int>dp1[1<<17];\npair<int,int>dfs1(int u,int p)\n{\n\tpair<int,int>ret;\n\tret.first=ret.second=0;\n\tfor(pair<int,int>q:G[u])\n\t{\n\t\tif(q.first==p)continue;\n\t\tpair<int,int>now=dfs1(q.first,u);\n\t\tret.first=max(ret.first,now.first+q.second);\n\t\tret.second=max(ret.second,max(now.second,q.second));\n\t}\n\tdp1[u]=ret;\n\treturn ret;\n}\nint ans;\nvoid dfs2(int u,int p,pair<int,int>P)\n{\n\tvector<pair<pair<int,int>,int> >A;\n\tA.push_back(make_pair(P,-1));\n\tfor(int i=0;i<G[u].size();i++)\n\t{\n\t\tint v=G[u][i].first;\n\t\tif(v==p)continue;\n\t\tA.push_back(make_pair(make_pair(dp1[v].first+G[u][i].second,max(dp1[v].second,G[u][i].second)),i));\n\t}\n\tsort(A.rbegin(),A.rend());\n\tpair<int,int>dmax1,dmax2,emax1,emax2;\n\tdmax1=dmax2=emax1=emax2=make_pair(0,-1);\n\twhile(A.size()<3)A.push_back(make_pair(make_pair(0,0),-(int)A.size()-1));\n\tfor(int i=0;i<A.size();i++)\n\t{\n\t\tans=max(ans,A[i].first.second+A[i==0?2:0].first.first+A[i==1?2:1].first.first);\n\t\tif(dmax1.first<=A[i].first.first)\n\t\t{\n\t\t\tdmax2=dmax1;\n\t\t\tdmax1=make_pair(A[i].first.first,A[i].second);\n\t\t}\n\t\telse if(dmax2.first<=A[i].first.first)\n\t\t{\n\t\t\tdmax2=make_pair(A[i].first.first,A[i].second);\n\t\t}\n\t\tif(emax1.first<=A[i].first.second)\n\t\t{\n\t\t\temax2=emax1;\n\t\t\temax1=make_pair(A[i].first.second,A[i].second);\n\t\t}\n\t\telse if(emax2.first<=A[i].first.second)\n\t\t{\n\t\t\temax2=make_pair(A[i].first.second,A[i].second);\n\t\t}\n\t}\n\tfor(int i=0;i<G[u].size();i++)\n\t{\n\t\tif(G[u][i].first==p)continue;\n\t\tdfs2(G[u][i].first,u,make_pair(G[u][i].second+(dmax1.second==i?dmax2.first:dmax1.first),max(G[u][i].second,emax1.second==i?emax2.first:emax1.first)));\n\t}\n}\nmain()\n{\n\tcin>>N;\n\tfor(int i=1;i<N;i++)\n\t{\n\t\tint p,w;cin>>p>>w;\n\t\tG[p].push_back(make_pair(i,w));\n\t\tG[i].push_back(make_pair(p,w));\n\t}\n\tdfs1(0,-1);\n\tdfs2(0,-1,make_pair(0,0));\n\tcout<<ans<<endl;\n}","accuracy":1,"time_ms":80,"memory_kb":33472,"score_of_the_acc":-0.945,"final_rank":6},{"submission_id":"aoj_2770_3720487","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N;\nvector<pair<int,int> >G[1<<17];\npair<int,int>dp1[1<<17];\npair<int,int>dfs1(int u,int p)\n{\n\tpair<int,int>ret;\n\tret.first=ret.second=0;\n\tfor(pair<int,int>q:G[u])\n\t{\n\t\tif(q.first==p)continue;\n\t\tpair<int,int>now=dfs1(q.first,u);\n\t\tret.first=max(ret.first,now.first+q.second);\n\t\tret.second=max(ret.second,max(now.second,q.second));\n\t}\n\tdp1[u]=ret;\n\treturn ret;\n}\nint ans;\nvoid dfs2(int u,int p,pair<int,int>P)\n{\n\tvector<pair<pair<int,int>,int> >A;\n\tA.push_back(make_pair(P,-1));\n\tfor(int i=0;i<G[u].size();i++)\n\t{\n\t\tint v=G[u][i].first;\n\t\tif(v==p)continue;\n\t\tA.push_back(make_pair(make_pair(dp1[v].first+G[u][i].second,max(dp1[v].second,G[u][i].second)),i));\n\t}\n\tsort(A.rbegin(),A.rend());\n\tpair<int,int>dmax1,dmax2,emax1,emax2;\n\tdmax1=dmax2=emax1=emax2=make_pair(0,-1);\n\twhile(A.size()<3)A.push_back(make_pair(make_pair(0,0),-(int)A.size()-1));\n\tfor(int i=0;i<A.size();i++)\n\t{\n\t\tans=max(ans,A[i].first.second+A[i==0?2:0].first.first+A[i==1?2:1].first.first);\n\t\tif(dmax1.first<=A[i].first.first)\n\t\t{\n\t\t\tdmax2=dmax1;\n\t\t\tdmax1=make_pair(A[i].first.first,A[i].second);\n\t\t}\n\t\telse if(dmax2.first<=A[i].first.first)\n\t\t{\n\t\t\tdmax2=make_pair(A[i].first.first,A[i].second);\n\t\t}\n\t\tif(emax1.first<=A[i].first.second)\n\t\t{\n\t\t\temax2=emax1;\n\t\t\temax1=make_pair(A[i].first.second,A[i].second);\n\t\t}\n\t\telse if(emax2.first<=A[i].first.second)\n\t\t{\n\t\t\temax2=make_pair(A[i].first.second,A[i].second);\n\t\t}\n\t}\n\tfor(int i=0;i<G[u].size();i++)\n\t{\n\t\tif(G[u][i].first==p)continue;\n\t\tdfs2(G[u][i].first,u,make_pair(G[u][i].second+(dmax1.second==i?dmax2.first:dmax1.first),max(G[u][i].second,emax1.second==i?emax2.first:emax1.first)));\n\t}\n}\nmain()\n{\n\tcin>>N;\n\tfor(int i=1;i<N;i++)\n\t{\n\t\tint p,w;cin>>p>>w;\n\t\tG[p].push_back(make_pair(i,w));\n\t\tG[i].push_back(make_pair(p,w));\n\t}\n\tdfs1(0,-1);\n\tdfs2(0,-1,make_pair(0,0));\n\tcout<<ans<<endl;\n}","accuracy":1,"time_ms":90,"memory_kb":33476,"score_of_the_acc":-1.0451,"final_rank":7},{"submission_id":"aoj_2770_3583698","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <utility>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\n\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, const int v, const int prev){\n ll t = 0, s = 0;\n for(auto e : G[v]){\n int v_ = e.second;\n ll w = e.first;\n if(v_ == prev) continue;\n pair<ll,ll> p = dfs(G,D,v_,v);\n ll x = max(p.first,p.second);\n s = max(s,x+w);\n if(s > t) swap(s,t);\n }\n D[v] = {t,s};\n return D[v];\n}\n\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\n assert(A.first >= A.second);\n assert(B.first >= B.second);\n if(A < B) swap(A,B);\n pair<ll,ll> ret = A;\n ret.second = max(ret.second,B.first);\n return ret;\n}\n\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev,\n const vector<pair<ll,ll>> &D, const pair<ll,ll> ts){\n int N = G[v].size();\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\n for(int i = 0; i < N; ++i){\n pair<ll,int> e = G[v][i];\n int v_ = e.second;\n ll w = e.first, l = 0;\n if(v_ == prev) l = max(ts.first,ts.second);\n else l = max(D[v_].first,D[v_].second);\n E[i+1].first = l+w;\n B[i ].first = l+w;\n }\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\n ll ret = 0;\n for(int i = 0; i < N; ++i){\n ll w = G[v][i].first;\n int v_ = G[v][i].second;\n pair<ll,ll> p = D[v_];\n if(v_ == prev) p = ts;\n ret = max(ret,w+p.first+p.second);\n p = top2(E[i],B[i+1]);\n ret = max(ret,w+p.first+p.second);\n }\n for(int i = 0; i < N; ++i){\n int v_ = G[v][i].second;\n if(v_ == prev) continue;\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\n ret = max(ret,solve(G,v_,v,D,ts_));\n }\n return ret;\n}\n\nint main(){\n int N;\n cin >> N;\n vector<vector<pair<long long,int>>> G(N);\n for(int i = 0; i < N-1; ++i){\n int p;\n long long w;\n cin >> p >> w;\n G[p].emplace_back(w,i+1);\n G[i+1].emplace_back(w,p);\n }\n vector<pair<ll,ll>> D(N,{0,0});\n pair<ll,ll> p = dfs(G,D,0,-1);\n ll ans = p.first+p.second;\n pair<ll,ll> ts(0,0);\n cout << max(ans,solve(G,0,-1,D,ts)) << endl;\n}","accuracy":0.3728813559322034,"time_ms":90,"memory_kb":38456,"score_of_the_acc":-1.1445,"final_rank":17},{"submission_id":"aoj_2770_3583671","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <utility>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\n\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, const int v, const int prev){\n ll t = 0, s = 0;\n for(auto e : G[v]){\n int v_ = e.second;\n ll w = e.first;\n if(v_ == prev) continue;\n pair<ll,ll> p = dfs(G,D,v_,v);\n ll x = max(p.first,p.second);\n s = max(s,x+w);\n if(s > t) swap(s,t);\n }\n D[v] = {t,s};\n return D[v];\n}\n\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\n assert(A.first >= A.second);\n assert(B.first >= B.second);\n if(A < B) swap(A,B);\n pair<ll,ll> ret = A;\n ret.second = max(ret.second,B.first);\n return ret;\n}\n\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev,\n const vector<pair<ll,ll>> &D, const pair<ll,ll> ts){\n int N = G[v].size();\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\n for(int i = 0; i < N; ++i){\n pair<ll,int> e = G[v][i];\n int v_ = e.second;\n ll w = e.first, l = 0;\n if(v_ == prev) l = max(ts.first,ts.second);\n else l = max(D[v_].first,D[v_].second);\n E[i+1].first = l+w;\n B[i ].first = l+w;\n }\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\n ll ret = 0;\n for(int i = 0; i < N; ++i){\n ll w = G[v][i].first;\n int v_ = G[v][i].second;\n pair<ll,ll> p = D[v_];\n if(v_ == prev) p = ts;\n ret = max(ret,w+p.first+p.second);\n p = top2(E[i],B[i+1]);\n ret = max(ret,w+p.first+p.second);\n }\n for(int i = 0; i < N; ++i){\n int v_ = G[v][i].second;\n if(v_ == prev) continue;\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\n ret = max(ret,solve(G,v_,v,D,ts_));\n }\n return ret;\n}\n\nint main(){\n int N;\n cin >> N;\n vector<vector<pair<long long,int>>> G(N);\n for(int i = 0; i < N-1; ++i){\n int p;\n long long w;\n cin >> p >> w;\n G[p].emplace_back(w,i+1);\n G[i+1].emplace_back(w,p);\n }\n vector<pair<ll,ll>> D(N,{0,0});\n dfs(G,D,0,-1);\n pair<ll,ll> ts(0,0);\n cout << solve(G,0,-1,D,ts) << endl;\n}","accuracy":0.3728813559322034,"time_ms":90,"memory_kb":38336,"score_of_the_acc":-1.1421,"final_rank":14},{"submission_id":"aoj_2770_3583644","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <utility>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\n\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\n ll t = 0, s = 0;\n for(auto e : G[v]){\n int v_ = e.second;\n ll w = e.first;\n if(v_ == prev) continue;\n pair<ll,ll> p = dfs(G,D,v_,v);\n ll x = max(p.first,p.second);\n s = max(s,x+w);\n if(s > t) swap(s,t);\n }\n D[v] = {t,s};\n return D[v];\n}\n\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\n assert(A.first >= A.second);\n assert(B.first >= B.second);\n if(A < B) swap(A,B);\n pair<ll,ll> ret = A;\n ret.second = max(ret.second,B.first);\n return ret;\n}\n\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\n int N = G[v].size();\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\n for(int i = 0; i < N; ++i){\n pair<ll,int> e = G[v][i];\n int v_ = e.second;\n ll w = e.first, l = 0;\n if(v_ == prev) l = max(ts.first,ts.second);\n else l = max(D[v_].first,D[v_].second);\n E[i+1].first = l+w;\n B[i ].first = l+w;\n }\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\n ll ret = 0;\n for(int i = 0; i < N; ++i){\n ll w = G[v][i].first;\n int v_ = G[v][i].second;\n pair<ll,ll> p = D[v_];\n if(v_ == prev) p = ts;\n ret = max(ret,w+p.first+p.second);\n p = top2(E[i],B[i+1]);\n ret = max(ret,w+p.first+p.second);\n }\n for(int i = 0; i < N; ++i){\n int v_ = G[v][i].second;\n if(v_ == prev) continue;\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\n ret = max(ret,solve(G,v_,v,D,ts_));\n }\n return ret;\n}\n\nint main(){\n int N;\n cin >> N;\n vector<vector<pair<long long,int>>> G(N);\n long long ans = 0;\n for(int i = 0; i < N-1; ++i){\n int p;\n long long w;\n cin >> p >> w;\n G[p].emplace_back(w,i+1);\n G[i+1].emplace_back(w,p);\n ans = max(ans,w);\n }\n vector<pair<ll,ll>> D(N,{0,0});\n dfs(G,D,0,-1);\n // for(int i = 0; i < N; ++i)\n // cerr << D[i].first << \" \" << D[i].second << endl;\n pair<ll,ll> ts(0,0);\n ans = max(ans,solve(G,0,-1,D,ts));\n cout << ans << endl;\n}","accuracy":0.3728813559322034,"time_ms":90,"memory_kb":38336,"score_of_the_acc":-1.1421,"final_rank":14},{"submission_id":"aoj_2770_3583643","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <utility>\n#include <cassert>\nusing namespace std;\nconst long long INF = 1e9;\nusing ll = long long;\n\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\n ll t = 0, s = 0;\n for(auto e : G[v]){\n int v_ = e.second;\n ll w = e.first;\n if(v_ == prev) continue;\n pair<ll,ll> p = dfs(G,D,v_,v);\n ll x = max(p.first,p.second);\n s = max(s,x+w);\n if(s > t) swap(s,t);\n }\n D[v] = {t,s};\n return D[v];\n}\n\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\n assert(A.first >= A.second);\n assert(B.first >= B.second);\n if(A < B) swap(A,B);\n pair<ll,ll> ret = A;\n ret.second = max(ret.second,B.first);\n return ret;\n}\n\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\n int N = G[v].size();\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\n for(int i = 0; i < N; ++i){\n pair<ll,int> e = G[v][i];\n int v_ = e.second;\n ll w = e.first, l = 0;\n if(v_ == prev) l = max(ts.first,ts.second);\n else l = max(D[v_].first,D[v_].second);\n E[i+1].first = l+w;\n B[i ].first = l+w;\n }\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\n ll ret = 0;\n for(int i = 0; i < N; ++i){\n ll w = G[v][i].first;\n int v_ = G[v][i].second;\n pair<ll,ll> p = D[v_];\n if(v_ == prev) p = ts;\n ret = max(ret,w+p.first+p.second);\n p = top2(E[i],B[i+1]);\n ret = max(ret,w+p.first+p.second);\n }\n for(int i = 0; i < N; ++i){\n int v_ = G[v][i].second;\n if(v_ == prev) continue;\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\n ret = max(ret,solve(G,v_,v,D,ts_));\n }\n return ret;\n}\n\nint main(){\n int N;\n cin >> N;\n vector<vector<pair<long long,int>>> G(N);\n long long ans = -INF;\n for(int i = 0; i < N-1; ++i){\n int p;\n long long w;\n cin >> p >> w;\n G[p].emplace_back(w,i+1);\n G[i+1].emplace_back(w,p);\n ans = max(ans,w);\n }\n vector<pair<ll,ll>> D(N,{0,0});\n dfs(G,D,0,-1);\n // for(int i = 0; i < N; ++i)\n // cerr << D[i].first << \" \" << D[i].second << endl;\n pair<ll,ll> ts(0,-INF);\n ans = max(ans,solve(G,0,-1,D,ts));\n cout << ans << endl;\n}","accuracy":0.3728813559322034,"time_ms":90,"memory_kb":38296,"score_of_the_acc":-1.1413,"final_rank":12},{"submission_id":"aoj_2770_3583636","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <utility>\n#include <cassert>\nusing namespace std;\nconst long long INF = 1e9;\nusing ll = long long;\n\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\n ll t = 0, s = -INF;\n for(auto e : G[v]){\n int v_ = e.second;\n ll w = e.first;\n if(v_ == prev) continue;\n pair<ll,ll> p = dfs(G,D,v_,v);\n ll x = max(p.first,p.second);\n s = max(s,x+w);\n if(s > t) swap(s,t);\n }\n D[v] = {t,s};\n return D[v];\n}\n\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\n assert(A.first >= A.second);\n assert(B.first >= B.second);\n if(A < B) swap(A,B);\n pair<ll,ll> ret = A;\n ret.second = max(ret.second,B.first);\n return ret;\n}\n\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\n int N = G[v].size();\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\n for(int i = 0; i < N; ++i){\n pair<ll,int> e = G[v][i];\n int v_ = e.second;\n ll w = e.first, l = -INF;\n if(v_ == prev) l = max(ts.first,ts.second);\n else l = max(D[v_].first,D[v_].second);\n E[i+1].first = l+w;\n B[i ].first = l+w;\n }\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\n ll ret = -INF;\n for(int i = 0; i < N; ++i){\n ll w = G[v][i].first;\n int v_ = G[v][i].second;\n pair<ll,ll> p = D[v_];\n if(v_ == prev) p = ts;\n ret = max(ret,w+p.first+p.second);\n p = top2(E[i],B[i+1]);\n ret = max(ret,w+p.first+p.second);\n }\n for(int i = 0; i < N; ++i){\n int v_ = G[v][i].second;\n if(v_ == prev) continue;\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\n ret = max(ret,solve(G,v_,v,D,ts_));\n }\n return ret;\n}\n\nint main(){\n int N;\n cin >> N;\n vector<vector<pair<long long,int>>> G(N);\n long long ans = -INF;\n for(int i = 0; i < N-1; ++i){\n int p;\n long long w;\n cin >> p >> w;\n G[p].emplace_back(w,i+1);\n G[i+1].emplace_back(w,p);\n ans = max(ans,w);\n }\n vector<pair<ll,ll>> D(N,{0,0});\n dfs(G,D,0,-1);\n // for(int i = 0; i < N; ++i)\n // cerr << D[i].first << \" \" << D[i].second << endl;\n pair<ll,ll> ts(0,-INF);\n ans = max(ans,solve(G,0,-1,D,ts));\n cout << ans << endl;\n}","accuracy":0.3728813559322034,"time_ms":90,"memory_kb":38324,"score_of_the_acc":-1.1419,"final_rank":13},{"submission_id":"aoj_2770_3583609","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <utility>\n#include <cassert>\nusing namespace std;\nconst long long INF = 1e9;\nusing ll = long long;\n\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\n ll t = 0, s = -INF;\n for(auto e : G[v]){\n int v_ = e.second;\n ll w = e.first;\n if(v_ == prev) continue;\n pair<ll,ll> p = dfs(G,D,v_,v);\n ll x = max(p.first,p.second);\n s = max(s,x+w);\n if(s > t) swap(s,t);\n }\n D[v] = {t,s};\n return D[v];\n}\n\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\n assert(A.first >= A.second);\n assert(B.first >= B.second);\n if(A < B) swap(A,B);\n pair<ll,ll> ret = A;\n ret.second = max(ret.second,B.first);\n return ret;\n}\n\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\n int N = G[v].size();\n vector<pair<ll,ll>> E(N+1,{-INF,-INF}), B(N+1,{-INF,-INF});\n for(int i = 0; i < N; ++i){\n pair<ll,int> e = G[v][i];\n int v_ = e.second;\n ll w = e.first, l = -INF;\n if(v_ == prev) l = max(ts.first,ts.second);\n else l = max(D[v_].first,D[v_].second);\n E[i+1].first = l+w;\n B[i ].first = l+w;\n }\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\n ll ret = -INF;\n for(int i = 0; i < N; ++i){\n ll w = G[v][i].first;\n int v_ = G[v][i].second;\n pair<ll,ll> p = D[v_];\n if(v_ == prev) p = ts;\n ret = max(ret,w+p.first+p.second);\n p = top2(E[i],B[i+1]);\n ret = max(ret,w+p.first+p.second);\n ret = max(ret,w+p.first);\n }\n for(int i = 0; i < N; ++i){\n int v_ = G[v][i].second;\n if(v_ == prev) continue;\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\n ret = max(ret,solve(G,v_,v,D,ts_));\n }\n return ret;\n}\n\nint main(){\n int N;\n cin >> N;\n vector<vector<pair<long long,int>>> G(N);\n long long ans = -INF;\n for(int i = 0; i < N-1; ++i){\n int p;\n long long w;\n cin >> p >> w;\n G[p].emplace_back(w,i+1);\n G[i+1].emplace_back(w,p);\n ans = max(ans,w);\n }\n vector<pair<ll,ll>> D(N,{0,-INF});\n dfs(G,D,0,-1);\n // for(int i = 0; i < N; ++i)\n // cerr << D[i].first << \" \" << D[i].second << endl;\n pair<ll,ll> ts(0,-INF);\n ans = max(ans,solve(G,0,-1,D,ts));\n cout << ans << endl;\n}","accuracy":0.3728813559322034,"time_ms":90,"memory_kb":38452,"score_of_the_acc":-1.1444,"final_rank":16},{"submission_id":"aoj_2770_3583592","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <utility>\n#include <cassert>\nusing namespace std;\nconst long long INF = 1e9;\nusing ll = long long;\n\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\n ll t = 0, s = -INF;\n for(auto e : G[v]){\n int v_ = e.second;\n ll w = e.first;\n if(v_ == prev) continue;\n pair<ll,ll> p = dfs(G,D,v_,v);\n ll x = max(p.first,p.second);\n s = max(s,x+w);\n if(s > t) swap(s,t);\n }\n D[v] = {t,s};\n return D[v];\n}\n\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\n assert(A.first >= A.second);\n assert(B.first >= B.second);\n if(A < B) swap(A,B);\n pair<ll,ll> ret = A;\n ret.second = max(ret.second,B.first);\n return ret;\n}\n\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\n int N = G[v].size();\n vector<pair<ll,ll>> E(N+1,{-INF,-INF}), B(N+1,{-INF,-INF});\n for(int i = 0; i < N; ++i){\n pair<ll,int> e = G[v][i];\n int v_ = e.second;\n ll w = e.first, l = -INF;\n if(v_ == prev) l = max(ts.first,ts.second);\n else l = max(D[v_].first,D[v_].second);\n E[i+1].first = l+w;\n B[i ].first = l+w;\n }\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\n ll ret = -INF;\n for(int i = 0; i < N; ++i){\n ll w = G[v][i].first;\n int v_ = G[v][i].second;\n pair<ll,ll> p = D[v_];\n if(v_ == prev) p = ts;\n ret = max(ret,w+p.first+p.second);\n p = top2(E[i],B[i+1]);\n ret = max(ret,w+p.first+p.second);\n }\n for(int i = 0; i < N; ++i){\n int v_ = G[v][i].second;\n if(v_ == prev) continue;\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\n ret = max(ret,solve(G,v_,v,D,ts_));\n }\n return ret;\n}\n\nint main(){\n int N;\n cin >> N;\n vector<vector<pair<long long,int>>> G(N);\n long long ans = -INF;\n for(int i = 0; i < N-1; ++i){\n int p;\n long long w;\n cin >> p >> w;\n G[p].emplace_back(w,i+1);\n G[i+1].emplace_back(w,p);\n ans = max(ans,w);\n }\n vector<pair<ll,ll>> D(N,{0,-INF});\n dfs(G,D,0,-1);\n // for(int i = 0; i < N; ++i)\n // cerr << D[i].first << \" \" << D[i].second << endl;\n pair<ll,ll> ts(0,-INF);\n ans = max(ans,solve(G,0,-1,D,ts));\n cout << ans << endl;\n}","accuracy":0.3220338983050847,"time_ms":90,"memory_kb":28688,"score_of_the_acc":-0.9496,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_2770_10401948\",\n \"code_snippet\": \"// AOJ #2770 Relay\\n// 2025.4.21\\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, 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 vector<vector<pair<int,int>>> adj(N);\\n vector<tuple<int,int,int>> edges(N-1);\\n for(int i = 0; i < N-1; i++){\\n int v = Cin(), w = Cin();\\n int u = i + 1;\\n edges[i] = {u, v, w};\\n adj[u].emplace_back(v, w);\\n adj[v].emplace_back(u, w);\\n }\\n\\n vector<int> parent(N, -1), pw(N, 0);\\n vector<vector<int>> children(N);\\n vector<int> idx(N, 0), post;\\n post.reserve(N);\\n vector<int> stk;\\n stk.reserve(N);\\n\\n parent[0] = -2;\\n stk.push_back(0);\\n while(!stk.empty()){\\n int u = stk.back();\\n if(idx[u] < (int)adj[u].size()){\\n auto [v, w] = adj[u][idx[u]++];\\n if(parent[u] == v) continue;\\n parent[v] = u;\\n pw[v] = w;\\n children[u].push_back(v);\\n stk.push_back(v);\\n } else {\\n post.push_back(u);\\n stk.pop_back();\\n }\\n }\\n\\n vector<ll> down1(N,0), down2(N,0), down3(N,0), sub_dia(N,0);\\n vector<int> d1id(N,-1), d2id(N,-1), d3id(N,-1);\\n vector<ll> child_dia1(N,0), child_dia2(N,0);\\n vector<int> cd1id(N,-1);\\n\\n for(int u: post){\\n for(int v: children[u]){\\n ll h = down1[v] + pw[v];\\n if(h > down1[u]){\\n down3[u] = down2[u]; d3id[u] = d2id[u];\\n down2[u] = down1[u]; d2id[u] = d1id[u];\\n down1[u] = h, d1id[u] = v;\\n } else if(h > down2[u]){\\n down3[u] = down2[u]; d3id[u] = d2id[u];\\n down2[u] = h, d2id[u] = v;\\n } else if(h > down3[u]){\\n down3[u] = h, d3id[u] = v;\\n }\\n }\\n ll best1 = 0, best2 = 0;\\n int best1idx = -1;\\n for(int v: children[u]){\\n ll cd = sub_dia[v];\\n if(cd > best1){\\n best2 = best1;\\n best1 = cd;\\n best1idx = v;\\n } else if(cd > best2) best2 = cd;\\n }\\n child_dia1[u] = best1;\\n child_dia2[u] = best2;\\n cd1id[u] = best1idx;\\n sub_dia[u] = max(best1, down1[u] + down2[u]);\\n }\\n\\n vector<ll> up(N,0), dout(N,0);\\n stk.clear();\\n stk.push_back(0);\\n while(!stk.empty()){\\n int u = stk.back(); stk.pop_back();\\n for(int v: children[u]){\\n ll best_h = (d1id[u] != v ? down1[u]\\n : (d2id[u] != v ? down2[u]\\n : down3[u]));\\n ll c1, c2;\\n if(d1id[u] != v){\\n c1 = down1[u];\\n c2 = (d2id[u] != v ? down2[u] : down3[u]);\\n } else {\\n c1 = down2[u];\\n c2 = down3[u];\\n }\\n ll cross = c1 + c2;\\n ll bcd = (cd1id[u] != v ? child_dia1[u] : child_dia2[u]);\\n\\n ll best = dout[u];\\n best = max(best, bcd);\\n best = max(best, cross);\\n best = max(best, up[u] + best_h);\\n dout[v] = best;\\n\\n ll up_ex = max(up[u], best_h);\\n up[v] = up_ex + pw[v];\\n\\n stk.push_back(v);\\n }\\n }\\n\\n ll ans = 0;\\n for(auto [u, v, w] : edges){\\n if(parent[v] == u) ans = max(ans, max(sub_dia[v], dout[v]) + w);\\n else ans = max(ans, max(sub_dia[u], dout[u]) + w);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 24816,\n \"score_of_the_acc\": -0.1723,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2770_4968872\",\n \"code_snippet\": \"#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cctype>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <cstdint>\\n#include <cstdlib>\\n#include <deque>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\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 <type_traits>\\n#include <unordered_map>\\n#include <utility>\\n#include <vector>\\n\\n/* template start */\\n\\nusing i64 = std::int_fast64_t;\\nusing u64 = std::uint_fast64_t;\\n\\n#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)\\n#define all(i) i.begin(), i.end()\\n\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n\\nvoid debug_out() { std::cerr << std::endl; }\\n\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cout << \\\" :\\\";\\n debug_out(t...);\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\\n for (std::size_t i = 0; i < vec.size(); i++)\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\ntemplate <typename T1, typename T2>\\ninline bool chmax(T1& a, T2 b) {\\n return a < b && (a = b, true);\\n}\\n\\ntemplate <typename T1, typename T2>\\ninline bool chmin(T1& a, T2 b) {\\n return a > b && (a = b, true);\\n}\\n\\ntemplate <typename Num>\\nconstexpr Num mypow(Num a, u64 b, Num id = 1) {\\n if (b == 0) return id;\\n Num x = id;\\n while (b > 0) {\\n if (b & 1) x *= a;\\n a *= a;\\n b >>= 1;\\n }\\n return x;\\n}\\n\\ntemplate <typename T>\\nstd::vector<std::pair<std::size_t, T>> enumerate(const std::vector<T>& data) {\\n std::vector<std::pair<std::size_t, T>> ret;\\n for (std::size_t index = 0; index < data.size(); index++)\\n ret.emplace_back(index, data[index]);\\n return ret;\\n}\\n\\n/* template end */\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n i64 n;\\n std::cin>>n;\\n\\n using P=std::pair<i64,i64>;\\n\\n std::vector<std::vector<P>> graph(n);\\n\\n i64 ans=0;\\n\\n rep(i,1,n){\\n i64 p,w;\\n std::cin>>p>>w;\\n\\n chmax(ans,w);\\n\\n graph[i].emplace_back(p,w);\\n graph[p].emplace_back(i,w);\\n }\\n\\n std::vector<i64> arch(n,0),path_root(n,0);\\n\\n auto dfs1=[&](auto&& f,i64 now,i64 par)->void{\\n arch[now] = 0;\\n path_root[now] = 0;\\n\\n i64 first=0,second=0;\\n\\n for(auto itr = graph[now].begin();itr!=graph[now].end();){\\n if(itr->first == par){\\n itr = graph[now].erase(itr);\\n continue;\\n }\\n\\n const auto& [e,w] = *itr;\\n\\n f(f,e,now);\\n chmax(arch[now],arch[e]);\\n\\n if(path_root[e] + w > first){\\n second = first;\\n first = path_root[e]+w;\\n }else if(path_root[e] + w > second){\\n second = path_root[e]+w;\\n }\\n\\n itr++;\\n }\\n\\n path_root[now] = first;\\n chmax(arch[now],first+second);\\n };\\n\\n dfs1(dfs1,0,-1);\\n\\n debug(arch);\\n debug(path_root);\\n\\n auto dfs2=[&](auto&& f,i64 now,i64 par,i64 pw,i64 parch,i64 ppath)->void{\\n if(par!=-1){\\n chmax(ans,arch[now]+pw);\\n chmax(ans,parch + pw);\\n }\\n\\n debug(now,par,pw,parch,ppath);\\n\\n if(graph[now].empty())return;\\n\\n i64 m = graph[now].size();\\n std::vector<i64> lfirst(m),lsecond(m),rfirst(m),rsecond(m);\\n std::vector<i64> lmax(m),rmax(m);\\n\\n lfirst[0] = 0;\\n lsecond[0] = 0;\\n lmax[0]=0;\\n rep(i,1,m){\\n const auto& [e,w] = graph[now][i-1];\\n lmax[i] = std::max(lmax[i-1],arch[e]);\\n lfirst[i] = lfirst[i-1];\\n lsecond[i] = lsecond[i-1];\\n if(path_root[e] + w > lfirst[i-1]){\\n lsecond[i] = lfirst[i-1];\\n lfirst[i] = path_root[e]+w;\\n }else if(path_root[e] + w > lsecond[i-1]){\\n lfirst[i] = lfirst[i-1];\\n lsecond[i] = path_root[e]+w;\\n }\\n }\\n\\n rfirst[m-1] = ppath + pw;\\n rsecond[m-1] = 0;\\n rmax[m-1] = parch;\\n for(i64 i = m-2;i>=0;i--){\\n const auto& [e,w] = graph[now][i+1];\\n rmax[i] = std::max(rmax[i+1],arch[e]);\\n rfirst[i] = rfirst[i+1];\\n rsecond[i] = rsecond[i+1];\\n if(path_root[e] + w > rfirst[i+1]){\\n rsecond[i] = rfirst[i+1];\\n rfirst[i] = path_root[e]+w;\\n }else if(path_root[e]+w > rsecond[i+1]){\\n rfirst[i] = rfirst[i+1];\\n rsecond[i] = path_root[e]+w;\\n }\\n }\\n\\n if(now == 2){\\n debug(rfirst);\\n debug(rsecond);\\n }\\n\\n rep(i,0,m){\\n const auto& [e,w] = graph[now][i];\\n i64 narch = std::max(lmax[i],rmax[i]);\\n i64 npath = std::max(lfirst[i],rfirst[i]);\\n std::vector<i64> tmp = {lfirst[i],lsecond[i],rfirst[i],rsecond[i]};\\n std::sort(all(tmp),std::greater<i64>());\\n chmax(narch,tmp[0]+tmp[1]);\\n\\n f(f,e,now,w,narch,npath);\\n }\\n };\\n\\n dfs2(dfs2,0,-1,0,0,0);\\n\\n std::cout<<ans<<\\\"\\\\n\\\";\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 58620,\n \"score_of_the_acc\": -1.147,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2770_4968657\",\n \"code_snippet\": \"#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cctype>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <cstdint>\\n#include <cstdlib>\\n#include <deque>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\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 <type_traits>\\n#include <unordered_map>\\n#include <utility>\\n#include <vector>\\n\\n/* template start */\\n\\nusing i64 = std::int_fast64_t;\\nusing u64 = std::uint_fast64_t;\\n\\n#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)\\n#define all(i) i.begin(), i.end()\\n\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n\\nvoid debug_out() { std::cerr << std::endl; }\\n\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cout << \\\" :\\\";\\n debug_out(t...);\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\\n for (std::size_t i = 0; i < vec.size(); i++)\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\ntemplate <typename T1, typename T2>\\ninline bool chmax(T1& a, T2 b) {\\n return a < b && (a = b, true);\\n}\\n\\ntemplate <typename T1, typename T2>\\ninline bool chmin(T1& a, T2 b) {\\n return a > b && (a = b, true);\\n}\\n\\ntemplate <typename Num>\\nconstexpr Num mypow(Num a, u64 b, Num id = 1) {\\n if (b == 0) return id;\\n Num x = id;\\n while (b > 0) {\\n if (b & 1) x *= a;\\n a *= a;\\n b >>= 1;\\n }\\n return x;\\n}\\n\\ntemplate <typename T>\\nstd::vector<std::pair<std::size_t, T>> enumerate(const std::vector<T>& data) {\\n std::vector<std::pair<std::size_t, T>> ret;\\n for (std::size_t index = 0; index < data.size(); index++)\\n ret.emplace_back(index, data[index]);\\n return ret;\\n}\\n\\n/* template end */\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n i64 n;\\n std::cin>>n;\\n\\n using P=std::pair<i64,i64>;\\n\\n std::vector<std::vector<P>> graph(n);\\n\\n i64 ans=0;\\n\\n rep(i,1,n){\\n i64 p,w;\\n std::cin>>p>>w;\\n\\n chmax(ans,w);\\n\\n graph[i].emplace_back(p,w);\\n graph[p].emplace_back(i,w);\\n }\\n\\n std::vector<i64> arch(n,0),path_root(n,0);\\n\\n auto dfs1=[&](auto&& f,i64 now,i64 par)->void{\\n arch[now] = 0;\\n path_root[now] = 0;\\n\\n i64 first=0,second=0;\\n\\n for(auto itr = graph[now].begin();itr!=graph[now].end();){\\n if(itr->first == par){\\n itr = graph[now].erase(itr);\\n continue;\\n }\\n\\n const auto& [e,w] = *itr;\\n\\n f(f,e,now);\\n chmax(arch[now],arch[e]);\\n\\n if(path_root[e] + w > first){\\n second = first;\\n first = path_root[e]+w;\\n }else if(path_root[e] + w > second){\\n second = path_root[e]+w;\\n }\\n\\n itr++;\\n }\\n\\n path_root[now] = first;\\n chmax(arch[now],first+second);\\n };\\n\\n dfs1(dfs1,0,-1);\\n\\n auto dfs2=[&](auto&& f,i64 now,i64 par,i64 pw,i64 parch,i64 ppath)->void{\\n if(par!=-1){\\n chmax(ans,arch[now]+pw);\\n chmax(ans,parch + pw);\\n }\\n\\n if(graph[now].empty())return;\\n\\n i64 m = graph[now].size();\\n std::vector<i64> lfirst(m),lsecond(m),rfirst(m),rsecond(m);\\n std::vector<i64> lmax(m),rmax(m);\\n\\n lfirst[0] = 0;\\n lsecond[0] = 0;\\n lmax[0]=0;\\n rep(i,1,m){\\n const auto& [e,w] = graph[now][i-1];\\n lmax[i] = std::max(lmax[i-1],arch[e]);\\n if(path_root[e] + w > lfirst[i-1]){\\n lsecond[i] = lfirst[i-1];\\n lfirst[i] = path_root[e]+w;\\n }else if(path_root[e] + w > lsecond[i-1]){\\n lfirst[i] = lfirst[i-1];\\n lsecond[i] = path_root[e]+w;\\n }\\n }\\n\\n rfirst[m-1] = ppath + pw;\\n rsecond[m-1] = 0;\\n rmax[m-1] = parch;\\n for(i64 i = m-2;i>=0;i--){\\n const auto& [e,w] = graph[now][i+1];\\n rmax[i] = std::max(rmax[i+1],arch[e]);\\n if(path_root[e] + w > rfirst[i+1]){\\n rsecond[i] = rfirst[i+1];\\n rfirst[i] = path_root[e]+w;\\n }else if(path_root[e]+w > rsecond[i+1]){\\n rfirst[i] = rfirst[i+1];\\n rsecond[i] = path_root[e]+w;\\n }\\n }\\n\\n rep(i,0,m){\\n const auto& [e,w] = graph[now][i];\\n i64 narch = std::max(lmax[i],rmax[i]);\\n i64 npath = std::max(lfirst[i],rfirst[i]);\\n std::vector<i64> tmp = {lfirst[i],lsecond[i],rfirst[i],rsecond[i]};\\n std::sort(all(tmp),std::greater<i64>());\\n chmax(narch,tmp[0]+tmp[1]);\\n\\n f(f,e,now,w,narch,npath);\\n }\\n };\\n\\n dfs2(dfs2,0,-1,0,0,0);\\n\\n std::cout<<ans<<\\\"\\\\n\\\";\\n\\n return 0;\\n}\",\n \"accuracy\": 0.2542372881355932,\n \"time_ms\": 30,\n \"memory_kb\": 16220,\n \"score_of_the_acc\": -0.1007,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2770_4968551\",\n \"code_snippet\": \"#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cctype>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <cstdint>\\n#include <cstdlib>\\n#include <deque>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\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 <type_traits>\\n#include <unordered_map>\\n#include <utility>\\n#include <vector>\\n\\n/* template start */\\n\\nusing i64 = std::int_fast64_t;\\nusing u64 = std::uint_fast64_t;\\n\\n#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)\\n#define all(i) i.begin(), i.end()\\n\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n\\nvoid debug_out() { std::cerr << std::endl; }\\n\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cout << \\\" :\\\";\\n debug_out(t...);\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\\n for (std::size_t i = 0; i < vec.size(); i++)\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\ntemplate <typename T1, typename T2>\\ninline bool chmax(T1& a, T2 b) {\\n return a < b && (a = b, true);\\n}\\n\\ntemplate <typename T1, typename T2>\\ninline bool chmin(T1& a, T2 b) {\\n return a > b && (a = b, true);\\n}\\n\\ntemplate <typename Num>\\nconstexpr Num mypow(Num a, u64 b, Num id = 1) {\\n if (b == 0) return id;\\n Num x = id;\\n while (b > 0) {\\n if (b & 1) x *= a;\\n a *= a;\\n b >>= 1;\\n }\\n return x;\\n}\\n\\ntemplate <typename T>\\nstd::vector<std::pair<std::size_t, T>> enumerate(const std::vector<T>& data) {\\n std::vector<std::pair<std::size_t, T>> ret;\\n for (std::size_t index = 0; index < data.size(); index++)\\n ret.emplace_back(index, data[index]);\\n return ret;\\n}\\n\\n/* template end */\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n i64 n;\\n std::cin>>n;\\n\\n using P=std::pair<i64,i64>;\\n\\n std::vector<std::vector<P>> graph(n);\\n\\n i64 ans=0;\\n\\n rep(i,1,n){\\n i64 p,w;\\n std::cin>>p>>w;\\n\\n chmax(ans,w);\\n\\n graph[i].emplace_back(p,w);\\n graph[p].emplace_back(i,w);\\n }\\n\\n std::vector<i64> arch(n,0),path_root(n,0);\\n\\n auto dfs1=[&](auto&& f,i64 now,i64 par)->void{\\n arch[now] = 0;\\n path_root[now] = 0;\\n\\n i64 first=0,second=0;\\n\\n for(auto itr = graph[now].begin();itr!=graph[now].end();){\\n if(itr->first == par){\\n itr = graph[now].erase(itr);\\n continue;\\n }\\n\\n const auto& [e,w] = *itr;\\n\\n f(f,e,now);\\n chmax(arch[now],arch[e]);\\n\\n if(path_root[e] + w > first){\\n second = first;\\n first = path_root[e]+w;\\n }else if(path_root[e] + w > second){\\n second = path_root[e]+w;\\n }\\n\\n itr++;\\n }\\n\\n path_root[now] = first;\\n chmax(arch[now],first+second);\\n };\\n\\n dfs1(dfs1,0,-1);\\n\\n auto dfs2=[&](auto&& f,i64 now,i64 par,i64 pw,i64 parch,i64 ppath)->void{\\n if(par!=-1){\\n chmax(ans,arch[now]+pw);\\n chmax(ans,parch + pw);\\n }\\n\\n if(graph[now].empty())return;\\n\\n i64 m = graph[now].size();\\n std::vector<i64> lfirst(m),lsecond(m),rfirst(m),rsecond(m);\\n std::vector<i64> lmax(m),rmax(m);\\n\\n lfirst[0] = 0;\\n lsecond[0] = 0;\\n lmax[0]=0;\\n rep(i,1,m){\\n const auto& [e,w] = graph[now][i-1];\\n lmax[i] = std::max(lmax[i-1],arch[e]);\\n if(path_root[e] + w > lfirst[i-1]){\\n lsecond[i] = lfirst[i-1];\\n lfirst[i] = path_root[e]+w;\\n }else if(path_root[e] + w > lsecond[i-1]){\\n lfirst[i] = lfirst[i-1];\\n lsecond[i] = path_root[e]+w;\\n }\\n }\\n\\n rfirst[m-1] = ppath + pw;\\n rsecond[m-1] = 0;\\n rmax[m-1] = parch;\\n for(i64 i = m-2;i>=0;i--){\\n const auto& [e,w] = graph[now][i+1];\\n rmax[i] = std::max(rmax[i+1],arch[e]);\\n if(path_root[e] + w > rfirst[i+1]){\\n rsecond[i] = rfirst[i+1];\\n rfirst[i] = path_root[e]+w;\\n }else if(path_root[e]+w > rsecond[i+1]){\\n rfirst[i] = rfirst[i+1];\\n rsecond[i] = path_root[e]+w;\\n }\\n }\\n\\n rep(i,0,m){\\n const auto& [e,w] = graph[now][i];\\n i64 narch = std::max(lmax[i],rmax[i]);\\n i64 npath = std::max(lfirst[i],rfirst[i]);\\n std::vector<i64> tmp = {lfirst[i],lsecond[i],rfirst[i],rsecond[i]};\\n std::sort(all(tmp),std::greater<i64>());\\n chmax(narch,tmp[0]+tmp[1]);\\n\\n f(f,e,now,w,narch,npath);\\n }\\n };\\n\\n dfs2(dfs2,0,-1,0,0,0);\\n\\n std::cout<<ans<<\\\"\\\\n\\\";\\n\\n return 0;\\n}\",\n \"accuracy\": 0.2542372881355932,\n \"time_ms\": 30,\n \"memory_kb\": 16184,\n \"score_of_the_acc\": -0.1,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2770_4964391\",\n \"code_snippet\": \"#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n\\n#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <iostream>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n\\n#include <cassert>\\n#include <functional>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#ifndef LOCAL\\n#define debug(...) ;\\n#else\\n#define debug(...) cerr << __LINE__ << \\\" : \\\" << #__VA_ARGS__ << \\\" = \\\" << _tostr(__VA_ARGS__) << endl;\\n\\ntemplate<typename T>\\nostream &operator<<(ostream &out, const vector<T> &v);\\n\\ntemplate<typename T1, typename T2>\\nostream &operator<<(ostream &out, const pair<T1, T2> &p) {\\n out << \\\"{\\\" << p.first << \\\", \\\" << p.second << \\\"}\\\";\\n return out;\\n}\\n\\ntemplate<typename T>\\nostream &operator<<(ostream &out, const vector<T> &v) {\\n out << '{';\\n for (const T &item : v) out << item << \\\", \\\";\\n out << \\\"\\\\b\\\\b}\\\";\\n return out;\\n}\\n\\nvoid _tostr_rec(ostringstream &oss) {\\n oss << \\\"\\\\b\\\\b \\\\b\\\";\\n}\\n\\ntemplate<typename Head, typename... Tail>\\nvoid _tostr_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << head << \\\", \\\";\\n _tostr_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate<typename... T>\\nstring _tostr(T &&... args) {\\n ostringstream oss;\\n int size = sizeof...(args);\\n if (size > 1) oss << \\\"{\\\";\\n _tostr_rec(oss, forward<T>(args)...);\\n if (size > 1) oss << \\\"}\\\";\\n return oss.str();\\n}\\n#endif\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 300000000 //3e8\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 200010\\n\\nvector<pair<int, int>> G[SIZE];\\npair<int, int> lE[SIZE][3];\\nint cSize[SIZE];\\n\\npair<int, int> dfs1(int now) {\\n cSize[now] = 1;\\n for (auto p : G[now]) {\\n auto res = dfs1(p.first);\\n cSize[now] += res.second;\\n int e = max(res.first, p.second);\\n lE[now][2] = max(lE[now][2], {e, p.first});\\n if (lE[now][1] < lE[now][2]) swap(lE[now][1], lE[now][2]);\\n if (lE[now][0] < lE[now][1]) swap(lE[now][0], lE[now][1]);\\n }\\n\\n return {lE[now][0].first, cSize[now]};\\n}\\n\\nint ans = 0;\\n\\npair<pair<int, int>, int> dfs2(int now, int L) { // {max dist, max (dist + w)}\\n int D = 0, DW = -INF, W = -INF, DD = -INF;\\n\\n for (auto p : G[now]) {\\n int to = p.first;\\n int l = lE[now][0].second == to ? lE[now][1].first : lE[now][0].first;\\n auto res = dfs2(p.first, max({L, l, p.second}));\\n\\n int d = res.first.first + p.second;\\n int dw = res.first.second + p.second;\\n int w = max(p.second, res.second);\\n\\n ans = max(ans, D + d + L);\\n ans = max(ans, D + dw);\\n ans = max(ans, DW + d);\\n ans = max(ans, DD + w);\\n\\n DW = max({DW, dw, d + W, D + w});\\n DD = max(DD, D + d);\\n D = max(D, d);\\n W = max(W, w);\\n }\\n\\n debug(now, ans, L, D, DW, W);\\n\\n return {{D, DW}, W};\\n}\\n\\nint inEdge[SIZE] = {};\\n\\nint main() {\\n int N, sumW = 0;\\n\\n scanf(\\\"%d\\\", &N);\\n\\n for (int i = 1; i < N; i++) {\\n int p, w;\\n scanf(\\\"%d%d\\\", &p, &w);\\n G[p].push_back({i, w});\\n sumW += w;\\n inEdge[p]++;\\n inEdge[i]++;\\n }\\n\\n int counter = 0;\\n\\n for (int i = 0; i < N; i++) {\\n counter += inEdge[i] == 1;\\n if (inEdge[i] > 2) counter = INF;\\n }\\n\\n if (counter == 2) {\\n printf(\\\"%d\\\\n\\\", sumW);\\n return 0;\\n }\\n\\n dfs1(0);\\n dfs2(0, -INF);\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 17808,\n \"score_of_the_acc\": -0.1324,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2770_4964330\",\n \"code_snippet\": \"#if 1\\n#include <iostream>\\n#include <fstream>\\n#include <string>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <queue>\\n#include <stack>\\n#include <array>\\n#include <deque>\\n#include <algorithm>\\n#include <utility>\\n#include <cstdint>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <assert.h>\\n#include <bitset>\\n#include <list>\\n#include <cmath>\\n//#include <atcoder/all>\\n\\nauto& in = std::cin;\\nauto& out = std::cout;\\n#define all_range(C) std::begin(C), std::end(C)\\nconst double PI = 3.141592653589793238462643383279502884197169399375105820974944;\\n\\n\\ntemplate<typename T, typename U>\\nstd::enable_if_t<std::rank<T>::value == 0> fill_all(T& arr, const U& v) {\\n arr = v;\\n}\\ntemplate<typename ARR, typename U>\\nstd::enable_if_t<std::rank<ARR>::value != 0> fill_all(ARR& arr, const U& v) {\\n for (auto& i : arr) {\\n fill_all(i, v);\\n }\\n}\\n\\nstd::map<int, int> graph[100000];\\nint N;\\nbool used_v[100000];\\nint parent[100000];\\nint32_t D[100000];\\nvoid dfs(int v, int p, int32_t depth) {\\n parent[v] = p;\\n D[v] = depth;\\n for (auto& next : graph[v]) {\\n if (next.first == p) { continue; }\\n dfs(next.first, v, depth + next.second);\\n }\\n}\\n\\nint32_t maxdp[100000];\\nint32_t maxdep(int v, int p) {\\n if (maxdp[v] != -1) { return maxdp[v]; }\\n maxdp[v] = D[v];\\n for (auto& next : graph[v]) {\\n if (next.first == p) { continue; }\\n if (used_v[next.first]) { continue; }\\n maxdp[v] = std::max(maxdp[v], maxdep(next.first, v));\\n }\\n return maxdp[v];\\n}\\n\\nint main()\\n{\\n using std::endl;\\n using std::cout;\\n in.sync_with_stdio(false);\\n out.sync_with_stdio(false);\\n in.tie(nullptr);\\n out.tie(nullptr);\\n\\n in >> N;\\n for (size_t i = 0; i < N-1; i++)\\n {\\n int b, l;\\n in >> b >> l;\\n graph[i + 1].insert({ b, l });\\n graph[b].insert({ i + 1, l });\\n }\\n\\n dfs(0, -1, 0);\\n int maxa = std::max_element(D, D + N) - D;\\n dfs(maxa, -1, 0);\\n int maxb = std::max_element(D, D + N) - D;\\n\\n int32_t used_max = 0;\\n int v = maxb;\\n while (true) {\\n used_v[v] = true;\\n if (parent[v] == -1) { break; }\\n if (used_max < graph[v][parent[v]]) {\\n used_max = graph[v][parent[v]];\\n }\\n\\n v = parent[v];\\n }\\n\\n int32_t not_used_max = 0;\\n for (size_t i = 0; i < N; i++)\\n {\\n for (auto& edge : graph[i]) {\\n if (used_v[i] && used_v[edge.first]) { continue; }\\n if (not_used_max < edge.second) {\\n not_used_max = edge.second;\\n }\\n }\\n }\\n int32_t res = D[maxb] + not_used_max;\\n\\n //graph[used_max_a].erase(used_max_b);\\n //graph[used_max_b].erase(used_max_a);\\n\\n //fill_all(D, -1);\\n //dfs(used_max_a, -1, 0);\\n //dfs(std::max_element(D, D + N) - D, -1, 0);\\n //res = std::max(res, (*std::max_element(D, D + N)) + used_max);\\n\\n //fill_all(D, -1);\\n //dfs(used_max_b, -1, 0);\\n //dfs(std::max_element(D, D + N) - D, -1, 0);\\n //res = std::max(res, (*std::max_element(D, D + N)) + used_max);\\n\\n fill_all(maxdp, -1);\\n v = maxb;\\n used_max = 0;\\n while (true) {\\n if (parent[v] == -1) { break; }\\n used_max = std::max(used_max, graph[v][parent[v]]);\\n res = std::max(res, maxdep(parent[v], -1) + used_max);\\n v = parent[v];\\n }\\n\\n dfs(maxb, -1, 0);\\n fill_all(maxdp, -1);\\n v = maxa;\\n used_max = 0;\\n while (true) {\\n if (parent[v] == -1) { break; }\\n used_max = std::max(used_max, graph[v][parent[v]]);\\n res = std::max(res, maxdep(parent[v], -1) + used_max);\\n v = parent[v];\\n }\\n\\n out << res << endl;\\n\\n return 0;\\n}\\n#endif\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 23148,\n \"score_of_the_acc\": -1.139,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2770_4937089\",\n \"code_snippet\": \"//\\n// Created by yamunaku on 2020/10/23.\\n//\\n\\n#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n\\nusing namespace std;\\n//using namespace atcoder;\\n\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define repl(i, l, r) for(int i = (l); i < (r); i++)\\n#define per(i, n) for(int i = ((n)-1); i >= 0; i--)\\n#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)\\n#define all(x) (x).begin(),(x).end()\\n#define MOD9 998244353\\n#define MOD1 1000000007\\n#define IINF 1000000000\\n#define LINF 1000000000000000000\\n#define SP <<\\\" \\\"<<\\n#define CYES cout<<\\\"Yes\\\"<<endl\\n#define CNO cout<<\\\"No\\\"<<endl\\n#define CFS cin.tie(0);ios::sync_with_stdio(false)\\n#define CST(x) cout<<fixed<<setprecision(x)\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing vi = vector<int>;\\nusing mti = vector<vector<int>>;\\nusing vl = vector<ll>;\\nusing mtl = vector<vector<ll>>;\\nusing pi = pair<int, int>;\\nusing pl = pair<ll, ll>;\\ntemplate<typename T>\\nusing heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;\\n\\nvector<pair<int, int>> p;\\nvector<vector<pair<int, int>>> ch;\\n\\nstruct status {\\n int top;\\n int ans;\\n};\\n\\npair<int, int> get2(pair<int, int> pp, int x) {\\n if (x > pp.first) return {x, pp.first};\\n else if (x > pp.second) return {pp.first, x};\\n else return pp;\\n}\\n\\nvector<status> s;\\n\\nint answer = 0;\\n\\nstatus dfs(int x) {\\n status ans = {0, 0};\\n pair<int, int> top2 = {0, 0};\\n for (auto &p : ch[x]) {\\n auto ret = dfs(p.first);\\n ret.top += p.second;\\n top2 = get2(top2, ret.top);\\n ans.ans = max(ans.ans, ret.ans);\\n answer = max(answer, ret.ans + p.second);\\n }\\n ans.top = max(ans.top, top2.first);\\n ans.ans = max(ans.ans, top2.first + top2.second);\\n s[x] = ans;\\n return s[x];\\n}\\n\\nvoid zendfs(int x, int ans, int top) {\\n int sz = ch[x].size();\\n vector<pair<int, int>> pl(sz + 1, {0, 0});\\n vector<pair<int, int>> pr(sz + 1, {0, 0});\\n vi ansl(sz + 1, ans), ansr(sz + 1, ans);\\n rep(i, sz) {\\n pl[i + 1] = get2(pl[i], s[ch[x][i].first].top + ch[x][i].second);\\n ansl[i + 1] = max(ansl[i], s[ch[x][i].first].ans);\\n }\\n per(i, sz) {\\n pr[i] = get2(pr[i + 1], s[ch[x][i].first].top + ch[x][i].second);\\n ansr[i] = max(ansr[i + 1], s[ch[x][i].first].ans);\\n }\\n rep(i, sz) {\\n auto pp = pl[i];\\n pp = get2(pp, pr[i + 1].first);\\n pp = get2(pp, pr[i + 1].second);\\n pp = get2(pp, top);\\n int k = max(max(ansl[i], ansr[i + 1]), pp.first + pp.second);\\n// cout << ch[x][i].first SP pp.first SP pp.second SP ansl[i] SP ansr[i] SP k << endl;\\n answer = max(answer, k + ch[x][i].second);\\n zendfs(ch[x][i].first, k, pp.first + ch[x][i].second);\\n }\\n}\\n\\nvector<vector<pair<int, int>>> e;\\n\\nvoid indfs(int x, int prnt, int &c) {\\n int now = c;\\n// cout << x SP c << endl;\\n c++;\\n for (auto &nx : e[x]) {\\n if (nx.first == prnt) continue;\\n p[c] = {now, nx.second};\\n ch[now].emplace_back(c, nx.second);\\n indfs(nx.first, x, c);\\n }\\n}\\n\\nint main() {\\n //CFS;\\n int n;\\n cin >> n;\\n p = vector<pair<int, int>>(n, {0, 0});\\n ch = vector<vector<pair<int, int>>>(n);\\n s = vector<status>(n);\\n e = vector<vector<pair<int, int>>>(n);\\n rep(i, n - 1) {\\n int to, w;\\n cin >> to >> w;\\n e[i + 1].emplace_back(to, w);\\n e[to].emplace_back(i + 1, w);\\n }\\n int idx = 0;\\n indfs(0, 0, idx);\\n dfs(0);\\n zendfs(0, 0, 0);\\n cout << answer << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 37336,\n \"score_of_the_acc\": -0.8222,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2770_4936965\",\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 = 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 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 = mod) {\\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}\\n\\nconst int mn = 1 << 18;\\nstruct edge {\\n\\tint to; int cost;\\n};\\nusing Data = P;\\nvector<edge> G[mn];\\nvector<int> ids[mn];\\nvector<Data> memo[mn];\\nvector<int> costs[mn];\\nint root;\\n\\nData merge(Data a, Data b) {\\n\\tData res;\\n\\t//\\n\\tres.first = max(a.first, b.first);\\n\\tres.second = max({ a.second,b.second,a.first + b.first });\\n\\t//\\n\\treturn res;\\n}\\n\\nint ans = 0;\\nData dfs(int id, int fr) {\\n\\tData res;\\n\\t//\\n\\t//initialize\\n\\tres = { 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\\n\\t\\t//calc ans\\n\\t\\tans = max(ans, e.cost + nex.second);\\n\\t\\t//\\n\\t\\t//update with edge\\n\\t\\tnex.first += e.cost;\\n\\t\\tnex.second = max(nex.second, nex.first);\\n\\t\\t//\\n\\t\\tres = merge(res, nex);\\n\\t\\tids[id].push_back(e.to);\\n\\t\\tmemo[id].push_back(nex);\\n\\t\\tcosts[id].push_back(e.cost);\\n\\t}\\n\\t//\\n\\t//update for return\\n\\t//\\n\\treturn res;\\n}\\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\\t//calcurate id's ans\\n\\t//\\n\\tvector<Data> le(len + 1);\\n\\tvector<Data> ri(len + 1);\\n\\t//\\n\\tData init_c = { 0,0 };\\n\\t//\\n\\tle[0] = init_c;\\n\\trep(i, len) {\\n\\t\\tle[i + 1] = merge(le[i], v[i]);\\n\\t}\\n\\tri[len] = init_c;\\n\\tper(i, len) {\\n\\t\\tri[i] = merge(ri[i + 1], v[i]);\\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\\t\\tans = max(ans, costs[id][i] + d.second);\\n\\t\\t//\\n\\t\\t//update for return\\n\\t\\td.first += costs[id][i];\\n\\t\\td.second = max(d.first, d.second);\\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}\\nvoid solve() {\\n\\tint n; cin >> n;\\n\\trep(i, n - 1) {\\n\\t\\tint p, w; cin >> p >> w;\\n\\t\\tG[i + 1].push_back({ p,w });\\n\\t\\tG[p].push_back({ i + 1,w });\\n\\t}\\n\\tyaru();\\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\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 66288,\n \"score_of_the_acc\": -1.5,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2770_4322974\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 100005\\n\\nstruct Edge{\\n\\tEdge(int arg_to,ll arg_weight){\\n\\t\\tto = arg_to;\\n\\t\\tweight = arg_weight;\\n\\t}\\n\\tint to;\\n\\tll weight;\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_node_id,int arg_pre){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tpre = arg_pre;\\n\\t}\\n\\tint node_id,pre;\\n};\\n\\nint N;\\nint root = 0;\\nint leaf[SIZE];\\nint num_visit;\\nint LEFT[SIZE],RIGHT[SIZE];\\nll PARENT[SIZE],num_OUT[SIZE],W[SIZE],euler_W[SIZE],edge_W[SIZE];\\nll nodes[2*SIZE+5],max_L[2*SIZE+5],max_R[2*SIZE+5];\\nvector<Edge> G[SIZE];\\n\\n//オイラーツアーで、ノードのカバー範囲を計算する\\nvoid euler_tour(int node_id,int pre_node,ll sum){\\n\\teuler_W[node_id] = sum;\\n\\tnodes[num_visit] = node_id;\\n\\tLEFT[node_id] = num_visit++;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tif(G[node_id][i].to == pre_node)continue;\\n\\t\\tedge_W[G[node_id][i].to] = G[node_id][i].weight; //入次の重み\\n\\t\\teuler_tour(G[node_id][i].to,node_id,sum+G[node_id][i].weight);\\n\\t}\\n\\tnodes[num_visit] = node_id;\\n\\tRIGHT[node_id] = num_visit++;\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint from;\\n\\tll weight;\\n\\n\\tfor(int to = 1; to <= N-1; to++){\\n\\t\\tscanf(\\\"%d %lld\\\",&from,&weight);\\n\\t\\tG[from].push_back(Edge(to,weight));\\n\\t\\tG[to].push_back(Edge(from,weight));\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnum_OUT[i] = 0;\\n\\t}\\n\\n\\tqueue<Info> Q;\\n\\tQ.push(Info(root,-1));\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tPARENT[Q.front().node_id] = Q.front().pre;\\n\\n\\t\\tfor(int i = 0; i < G[Q.front().node_id].size(); i++){\\n\\t\\t\\tint next = G[Q.front().node_id][i].to;\\n\\t\\t\\tif(next == Q.front().pre)continue;\\n\\n\\t\\t\\tnum_OUT[Q.front().node_id]++;\\n\\n\\t\\t\\tQ.push(Info(next,Q.front().node_id));\\n\\t\\t}\\n\\t\\tQ.pop();\\n\\t}\\n\\n\\tll maximum = 0;\\n\\tint A,B;\\n\\n\\tqueue<int> NODE;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(num_OUT[i] == 0){\\n\\t\\t\\tleaf[i] = i;\\n\\t\\t\\tW[i] = 0;\\n\\t\\t\\tNODE.push(i);\\n\\t\\t}\\n\\t}\\n\\n\\tll max_path1,max_path2;\\n\\tint a,b;\\n\\n\\twhile(!NODE.empty()){\\n\\n\\t\\tint node = NODE.front();\\n\\t\\tNODE.pop();\\n\\n\\t\\tmax_path1 = 0;\\n\\t\\tmax_path2 = 0;\\n\\n\\t\\tb = node;\\n\\n\\t\\tfor(int i = 0; i < G[node].size(); i++){\\n\\n\\t\\t\\tint child = G[node][i].to;\\n\\t\\t\\tif(child == PARENT[node])continue;\\n\\n\\t\\t\\tll tmp = W[child]+G[node][i].weight;\\n\\n\\t\\t\\tif(tmp > max_path1){\\n\\n\\t\\t\\t\\tmax_path2 = max_path1;\\n\\t\\t\\t\\tb = a;\\n\\t\\t\\t\\tmax_path1 = tmp;\\n\\t\\t\\t\\tW[node] = tmp;\\n\\t\\t\\t\\tleaf[node] = leaf[child];\\n\\t\\t\\t\\ta = leaf[child];\\n\\n\\t\\t\\t}else if(tmp > max_path2){\\n\\n\\t\\t\\t\\tmax_path2 = tmp;\\n\\t\\t\\t\\tb = leaf[child];\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(max_path1+max_path2 > maximum){\\n\\n\\t\\t\\tmaximum = max_path1+max_path2;\\n\\t\\t\\tA = a;\\n\\t\\t\\tB = b;\\n\\t\\t}\\n\\t\\tif(PARENT[node] != -1){\\n\\t\\t\\tnum_OUT[PARENT[node]]--;\\n\\t\\t}\\n\\t\\tif(num_OUT[PARENT[node]] == 0){\\n\\n\\t\\t\\tNODE.push(PARENT[node]);\\n\\t\\t}\\n\\t}\\n\\tnum_visit = 0;\\n\\teuler_tour(A,-1,0);\\n\\n\\t//基準点より左の最大重み\\n\\tmax_L[0] = euler_W[A];\\n\\tfor(int i = 1; i < 2*N; i++){\\n\\n\\t\\tmax_L[i] = max(max_L[i-1],euler_W[nodes[i]]);\\n\\t}\\n\\tmax_R[2*N-1] = euler_W[A];\\n\\tfor(int i = 2*N-2; i >= 0; i--){\\n\\n\\t\\tmax_R[i] = max(max_R[i+1],euler_W[nodes[i]]);\\n\\t}\\n\\n\\tll ans = 0;\\n\\tll w_L,w_R;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(i == A)continue;\\n\\n\\t\\tif(LEFT[i] > 0){\\n\\n\\t\\t\\tw_L = max_L[LEFT[i]-1];\\n\\t\\t}\\n\\t\\tif(RIGHT[i]+1 < 2*N){\\n\\n\\t\\t\\tw_R = max_R[RIGHT[i]+1];\\n\\t\\t}\\n\\t\\tans = max(ans,edge_W[i]+max(w_L,w_R));\\n\\t}\\n\\n\\tnum_visit = 0;\\n\\tedge_W[B] = 0;\\n\\teuler_tour(B,-1,0);\\n\\n\\t//基準点より左の最大重み\\n\\tmax_L[0] = euler_W[B];\\n\\tfor(int i = 1; i < 2*N; i++){\\n\\n\\t\\tmax_L[i] = max(max_L[i-1],euler_W[nodes[i]]);\\n\\t}\\n\\tmax_R[2*N-1] = euler_W[B];\\n\\tfor(int i = 2*N-2; i >= 0; i--){\\n\\n\\t\\tmax_R[i] = max(max_R[i+1],euler_W[nodes[i]]);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(i == B)continue;\\n\\n\\t\\tif(LEFT[i] > 0){\\n\\n\\t\\t\\tw_L = max_L[LEFT[i]-1];\\n\\t\\t}\\n\\t\\tif(RIGHT[i]+1 < 2*N){\\n\\n\\t\\t\\tw_R = max_R[RIGHT[i]+1];\\n\\t\\t}\\n\\t\\tans = max(ans,edge_W[i]+max(w_L,w_R));\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 26852,\n \"score_of_the_acc\": -0.7129,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2770_4322972\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 100005\\n\\nstruct Edge{\\n\\tEdge(int arg_to,ll arg_weight){\\n\\t\\tto = arg_to;\\n\\t\\tweight = arg_weight;\\n\\t}\\n\\tint to;\\n\\tll weight;\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_node_id,int arg_pre){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tpre = arg_pre;\\n\\t}\\n\\tint node_id,pre;\\n};\\n\\nint N;\\nint root = 0;\\nint leaf[SIZE];\\nint num_visit;\\nint LEFT[SIZE],RIGHT[SIZE];\\nll PARENT[SIZE],num_OUT[SIZE],W[SIZE],euler_W[SIZE],edge_W[SIZE];\\nll nodes[2*SIZE+5],max_L[2*SIZE+5],max_R[2*SIZE+5];\\nvector<Edge> G[SIZE];\\n\\n//オイラーツアーで、ノードのカバー範囲を計算する\\nvoid euler_tour(int node_id,int pre_node,ll sum){\\n\\teuler_W[node_id] = sum;\\n\\tnodes[num_visit] = node_id;\\n\\tLEFT[node_id] = num_visit++;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tif(G[node_id][i].to == pre_node)continue;\\n\\t\\tedge_W[G[node_id][i].to] = G[node_id][i].weight; //入次の重み\\n\\t\\teuler_tour(G[node_id][i].to,node_id,sum+G[node_id][i].weight);\\n\\t}\\n\\tnodes[num_visit] = node_id;\\n\\tRIGHT[node_id] = num_visit++;\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint from;\\n\\tll weight;\\n\\n\\tfor(int to = 1; to <= N-1; to++){\\n\\t\\tscanf(\\\"%d %lld\\\",&from,&weight);\\n\\t\\tG[from].push_back(Edge(to,weight));\\n\\t\\tG[to].push_back(Edge(from,weight));\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnum_OUT[i] = 0;\\n\\t}\\n\\n\\tqueue<Info> Q;\\n\\tQ.push(Info(root,-1));\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tPARENT[Q.front().node_id] = Q.front().pre;\\n\\n\\t\\tfor(int i = 0; i < G[Q.front().node_id].size(); i++){\\n\\t\\t\\tint next = G[Q.front().node_id][i].to;\\n\\t\\t\\tif(next == Q.front().pre)continue;\\n\\n\\t\\t\\tnum_OUT[Q.front().node_id]++;\\n\\n\\t\\t\\tQ.push(Info(next,Q.front().node_id));\\n\\t\\t}\\n\\t\\tQ.pop();\\n\\t}\\n\\n\\tll maximum = 0;\\n\\tint A,B;\\n\\n\\tqueue<int> NODE;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(num_OUT[i] == 0){\\n\\t\\t\\tleaf[i] = i;\\n\\t\\t\\tW[i] = 0;\\n\\t\\t\\tNODE.push(i);\\n\\t\\t}\\n\\t}\\n\\n\\tll max_path1,max_path2;\\n\\tint a,b;\\n\\n\\twhile(!NODE.empty()){\\n\\n\\t\\tint node = NODE.front();\\n\\t\\tNODE.pop();\\n\\n\\t\\tmax_path1 = 0;\\n\\t\\tmax_path2 = 0;\\n\\n\\t\\tb = node;\\n\\n\\t\\tfor(int i = 0; i < G[node].size(); i++){\\n\\n\\t\\t\\tint child = G[node][i].to;\\n\\t\\t\\tif(child == PARENT[node])continue;\\n\\n\\t\\t\\tll tmp = W[child]+G[node][i].weight;\\n\\n\\t\\t\\tif(tmp > max_path1){\\n\\n\\t\\t\\t\\tmax_path2 = max_path1;\\n\\t\\t\\t\\tb = a;\\n\\t\\t\\t\\tmax_path1 = tmp;\\n\\t\\t\\t\\tW[node] = tmp;\\n\\t\\t\\t\\tleaf[node] = leaf[child];\\n\\t\\t\\t\\ta = leaf[child];\\n\\n\\t\\t\\t}else if(tmp > max_path2){\\n\\n\\t\\t\\t\\tmax_path2 = tmp;\\n\\t\\t\\t\\tb = leaf[child];\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t/*if(node == root){\\n\\t\\t\\tprintf(\\\"max_path1:%lld path2:%lld\\\\n\\\",max_path1,max_path2);\\n\\t\\t\\tprintf(\\\"a:%d b:%d\\\\n\\\",a,b);\\n\\t\\t}*/\\n\\n\\t\\tif(max_path1+max_path2 > maximum){\\n\\n\\t\\t\\tmaximum = max_path1+max_path2;\\n\\t\\t\\tA = a;\\n\\t\\t\\tB = b;\\n\\t\\t}\\n\\t\\tif(PARENT[node] != -1){\\n\\t\\t\\tnum_OUT[PARENT[node]]--;\\n\\t\\t}\\n\\t\\tif(num_OUT[PARENT[node]] == 0){\\n\\n\\t\\t\\tNODE.push(PARENT[node]);\\n\\t\\t}\\n\\t}\\n\\n\\t/*printf(\\\"maximum:%lld\\\\n\\\",maximum);\\n\\tprintf(\\\"A:%d B:%d\\\\n\\\",A,B);\\n*/\\n\\tnum_visit = 0;\\n\\teuler_tour(A,-1,0);\\n\\n\\t//基準点より左の最大重み\\n\\tmax_L[0] = euler_W[A];\\n\\tfor(int i = 1; i < 2*N; i++){\\n\\n\\t\\tmax_L[i] = max(max_L[i-1],euler_W[nodes[i]]);\\n\\t}\\n\\tmax_R[2*N-1] = euler_W[A];\\n\\tfor(int i = 2*N-2; i >= 0; i--){\\n\\n\\t\\tmax_R[i] = max(max_R[i+1],euler_W[nodes[i]]);\\n\\t}\\n\\n\\tll ans = 0;\\n\\tll w_L,w_R;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(i == A)continue;\\n\\n\\t\\tif(LEFT[i] > 0){\\n\\n\\t\\t\\tw_L = max_L[LEFT[i]-1];\\n\\t\\t}\\n\\t\\tif(RIGHT[i]+1 < 2*N){\\n\\n\\t\\t\\tw_R = max_R[RIGHT[i]+1];\\n\\t\\t}\\n\\t\\tans = max(ans,edge_W[i]+max(w_L,w_R));\\n\\t}\\n\\n\\tnum_visit = 0;\\n\\tedge_W[B] = 0;\\n\\teuler_tour(B,-1,0);\\n\\n\\t//基準点より左の最大重み\\n\\tmax_L[0] = euler_W[B];\\n\\tfor(int i = 1; i < 2*N; i++){\\n\\n\\t\\tmax_L[i] = max(max_L[i-1],euler_W[nodes[i]]);\\n\\t}\\n\\tmax_R[2*N-1] = euler_W[B];\\n\\tfor(int i = 2*N-2; i >= 0; i--){\\n\\n\\t\\tmax_R[i] = max(max_R[i+1],euler_W[nodes[i]]);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(i == B)continue;\\n\\n\\t\\tif(LEFT[i] > 0){\\n\\n\\t\\t\\tw_L = max_L[LEFT[i]-1];\\n\\t\\t}\\n\\t\\tif(RIGHT[i]+1 < 2*N){\\n\\n\\t\\t\\tw_R = max_R[RIGHT[i]+1];\\n\\t\\t}\\n\\t\\tans = max(ans,edge_W[i]+max(w_L,w_R));\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 26856,\n \"score_of_the_acc\": -0.613,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2770_3723523\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\n\\n\\nvector<P> G[100001];\\nvector<P> dp1(100000);\\nP dfs1(int u,int t){\\n P ret;\\n ret.first=0;\\n ret.second=0;\\n for(auto v:G[u]){\\n if(v.first==t) continue;\\n P p = dfs1(v.first,u);\\n ret.first=max(ret.first,p.first+v.second);\\n ret.second=max({ret.second,p.second,v.second});\\n }\\n return dp1[u]=ret;\\n}\\n\\nint dfs2(int u,int t,int d,int e){\\n vector<pair<P,int>> A;\\n vector<P> dd,ee;\\n A.push_back({{0,0},-1});\\n A.push_back({{0,0},-1});\\n for(auto v:G[u]){\\n if(v.first==t){\\n A.push_back({{d+v.second,e},v.first});\\n }\\n else{\\n A.push_back({{dp1[v.first].first+v.second,max(dp1[v.first].second,v.second)},v.first});\\n }\\n }\\n sort(A.rbegin(),A.rend());\\n int ret=0;\\n for(auto v:A){\\n int sum = v.first.second;\\n if(v.second==A[0].second){\\n sum += A[1].first.first;\\n sum += A[2].first.first;\\n }\\n else if(v.second==A[1].second){\\n sum += A[0].first.first;\\n sum += A[2].first.first;\\n }\\n else{\\n sum += A[0].first.first;\\n sum += A[1].first.first;\\n }\\n ret = max(ret,sum);\\n\\n dd.push_back({v.first.first,v.second});\\n ee.push_back({v.first.second,v.second});\\n }\\n sort(dd.rbegin(),dd.rend());\\n sort(ee.rbegin(),ee.rend());\\n for(auto v:G[u]){\\n if(v.first==t) continue;\\n int nd=dd[0].first,ne=ee[0].first;\\n if(dd[0].second==v.first) nd=dd[1].first;\\n if(ee[0].second==v.first) ne=ee[1].first;\\n ret=max(ret,dfs2(v.first,u,nd,max(ne,v.second)));\\n }\\n return ret;\\n}\\n\\nint main(){\\n int n;cin >> n;\\n for (int i = 0; i < n-1; i++) {\\n int p,w;cin >> p >> w;\\n G[i+1].push_back({p,w});\\n G[p].push_back({i+1,w});\\n }\\n dfs1(0,-1);\\n cout << dfs2(0,-1,0,0) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 46648,\n \"score_of_the_acc\": -1.508,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2770_3720684\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\nint N;\\nvector<pair<int,int> >G[1<<17];\\npair<int,int>dp1[1<<17];\\npair<int,int>dfs1(int u,int p)\\n{\\n\\tpair<int,int>ret;\\n\\tret.first=ret.second=0;\\n\\tfor(pair<int,int>q:G[u])\\n\\t{\\n\\t\\tif(q.first==p)continue;\\n\\t\\tpair<int,int>now=dfs1(q.first,u);\\n\\t\\tret.first=max(ret.first,now.first+q.second);\\n\\t\\tret.second=max(ret.second,max(now.second,q.second));\\n\\t}\\n\\tdp1[u]=ret;\\n\\treturn ret;\\n}\\nint ans;\\nvoid dfs2(int u,int p,pair<int,int>P)\\n{\\n\\tvector<pair<pair<int,int>,int> >A;\\n\\tA.push_back(make_pair(P,-1));\\n\\tfor(int i=0;i<G[u].size();i++)\\n\\t{\\n\\t\\tint v=G[u][i].first;\\n\\t\\tif(v==p)continue;\\n\\t\\tA.push_back(make_pair(make_pair(dp1[v].first+G[u][i].second,max(dp1[v].second,G[u][i].second)),i));\\n\\t}\\n\\tsort(A.rbegin(),A.rend());\\n\\tpair<int,int>dmax1,dmax2,emax1,emax2;\\n\\tdmax1=dmax2=emax1=emax2=make_pair(0,-1);\\n\\twhile(A.size()<3)A.push_back(make_pair(make_pair(0,0),-(int)A.size()-1));\\n\\tfor(int i=0;i<A.size();i++)\\n\\t{\\n\\t\\tans=max(ans,A[i].first.second+A[i==0?2:0].first.first+A[i==1?2:1].first.first);\\n\\t\\tif(dmax1.first<=A[i].first.first)\\n\\t\\t{\\n\\t\\t\\tdmax2=dmax1;\\n\\t\\t\\tdmax1=make_pair(A[i].first.first,A[i].second);\\n\\t\\t}\\n\\t\\telse if(dmax2.first<=A[i].first.first)\\n\\t\\t{\\n\\t\\t\\tdmax2=make_pair(A[i].first.first,A[i].second);\\n\\t\\t}\\n\\t\\tif(emax1.first<=A[i].first.second)\\n\\t\\t{\\n\\t\\t\\temax2=emax1;\\n\\t\\t\\temax1=make_pair(A[i].first.second,A[i].second);\\n\\t\\t}\\n\\t\\telse if(emax2.first<=A[i].first.second)\\n\\t\\t{\\n\\t\\t\\temax2=make_pair(A[i].first.second,A[i].second);\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<G[u].size();i++)\\n\\t{\\n\\t\\tif(G[u][i].first==p)continue;\\n\\t\\tdfs2(G[u][i].first,u,make_pair(G[u][i].second+(dmax1.second==i?dmax2.first:dmax1.first),max(G[u][i].second,emax1.second==i?emax2.first:emax1.first)));\\n\\t}\\n}\\nmain()\\n{\\n\\tcin>>N;\\n\\tfor(int i=1;i<N;i++)\\n\\t{\\n\\t\\tint p,w;cin>>p>>w;\\n\\t\\tG[p].push_back(make_pair(i,w));\\n\\t\\tG[i].push_back(make_pair(p,w));\\n\\t}\\n\\tdfs1(0,-1);\\n\\tdfs2(0,-1,make_pair(0,0));\\n\\tcout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 33472,\n \"score_of_the_acc\": -0.945,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2770_3720487\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\nint N;\\nvector<pair<int,int> >G[1<<17];\\npair<int,int>dp1[1<<17];\\npair<int,int>dfs1(int u,int p)\\n{\\n\\tpair<int,int>ret;\\n\\tret.first=ret.second=0;\\n\\tfor(pair<int,int>q:G[u])\\n\\t{\\n\\t\\tif(q.first==p)continue;\\n\\t\\tpair<int,int>now=dfs1(q.first,u);\\n\\t\\tret.first=max(ret.first,now.first+q.second);\\n\\t\\tret.second=max(ret.second,max(now.second,q.second));\\n\\t}\\n\\tdp1[u]=ret;\\n\\treturn ret;\\n}\\nint ans;\\nvoid dfs2(int u,int p,pair<int,int>P)\\n{\\n\\tvector<pair<pair<int,int>,int> >A;\\n\\tA.push_back(make_pair(P,-1));\\n\\tfor(int i=0;i<G[u].size();i++)\\n\\t{\\n\\t\\tint v=G[u][i].first;\\n\\t\\tif(v==p)continue;\\n\\t\\tA.push_back(make_pair(make_pair(dp1[v].first+G[u][i].second,max(dp1[v].second,G[u][i].second)),i));\\n\\t}\\n\\tsort(A.rbegin(),A.rend());\\n\\tpair<int,int>dmax1,dmax2,emax1,emax2;\\n\\tdmax1=dmax2=emax1=emax2=make_pair(0,-1);\\n\\twhile(A.size()<3)A.push_back(make_pair(make_pair(0,0),-(int)A.size()-1));\\n\\tfor(int i=0;i<A.size();i++)\\n\\t{\\n\\t\\tans=max(ans,A[i].first.second+A[i==0?2:0].first.first+A[i==1?2:1].first.first);\\n\\t\\tif(dmax1.first<=A[i].first.first)\\n\\t\\t{\\n\\t\\t\\tdmax2=dmax1;\\n\\t\\t\\tdmax1=make_pair(A[i].first.first,A[i].second);\\n\\t\\t}\\n\\t\\telse if(dmax2.first<=A[i].first.first)\\n\\t\\t{\\n\\t\\t\\tdmax2=make_pair(A[i].first.first,A[i].second);\\n\\t\\t}\\n\\t\\tif(emax1.first<=A[i].first.second)\\n\\t\\t{\\n\\t\\t\\temax2=emax1;\\n\\t\\t\\temax1=make_pair(A[i].first.second,A[i].second);\\n\\t\\t}\\n\\t\\telse if(emax2.first<=A[i].first.second)\\n\\t\\t{\\n\\t\\t\\temax2=make_pair(A[i].first.second,A[i].second);\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<G[u].size();i++)\\n\\t{\\n\\t\\tif(G[u][i].first==p)continue;\\n\\t\\tdfs2(G[u][i].first,u,make_pair(G[u][i].second+(dmax1.second==i?dmax2.first:dmax1.first),max(G[u][i].second,emax1.second==i?emax2.first:emax1.first)));\\n\\t}\\n}\\nmain()\\n{\\n\\tcin>>N;\\n\\tfor(int i=1;i<N;i++)\\n\\t{\\n\\t\\tint p,w;cin>>p>>w;\\n\\t\\tG[p].push_back(make_pair(i,w));\\n\\t\\tG[i].push_back(make_pair(p,w));\\n\\t}\\n\\tdfs1(0,-1);\\n\\tdfs2(0,-1,make_pair(0,0));\\n\\tcout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 33476,\n \"score_of_the_acc\": -1.0451,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2770_3583698\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <cassert>\\nusing namespace std;\\nusing ll = long long;\\n\\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, const int v, const int prev){\\n ll t = 0, s = 0;\\n for(auto e : G[v]){\\n int v_ = e.second;\\n ll w = e.first;\\n if(v_ == prev) continue;\\n pair<ll,ll> p = dfs(G,D,v_,v);\\n ll x = max(p.first,p.second);\\n s = max(s,x+w);\\n if(s > t) swap(s,t);\\n }\\n D[v] = {t,s};\\n return D[v];\\n}\\n\\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\\n assert(A.first >= A.second);\\n assert(B.first >= B.second);\\n if(A < B) swap(A,B);\\n pair<ll,ll> ret = A;\\n ret.second = max(ret.second,B.first);\\n return ret;\\n}\\n\\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev,\\n const vector<pair<ll,ll>> &D, const pair<ll,ll> ts){\\n int N = G[v].size();\\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\\n for(int i = 0; i < N; ++i){\\n pair<ll,int> e = G[v][i];\\n int v_ = e.second;\\n ll w = e.first, l = 0;\\n if(v_ == prev) l = max(ts.first,ts.second);\\n else l = max(D[v_].first,D[v_].second);\\n E[i+1].first = l+w;\\n B[i ].first = l+w;\\n }\\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\\n ll ret = 0;\\n for(int i = 0; i < N; ++i){\\n ll w = G[v][i].first;\\n int v_ = G[v][i].second;\\n pair<ll,ll> p = D[v_];\\n if(v_ == prev) p = ts;\\n ret = max(ret,w+p.first+p.second);\\n p = top2(E[i],B[i+1]);\\n ret = max(ret,w+p.first+p.second);\\n }\\n for(int i = 0; i < N; ++i){\\n int v_ = G[v][i].second;\\n if(v_ == prev) continue;\\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\\n ret = max(ret,solve(G,v_,v,D,ts_));\\n }\\n return ret;\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n vector<vector<pair<long long,int>>> G(N);\\n for(int i = 0; i < N-1; ++i){\\n int p;\\n long long w;\\n cin >> p >> w;\\n G[p].emplace_back(w,i+1);\\n G[i+1].emplace_back(w,p);\\n }\\n vector<pair<ll,ll>> D(N,{0,0});\\n pair<ll,ll> p = dfs(G,D,0,-1);\\n ll ans = p.first+p.second;\\n pair<ll,ll> ts(0,0);\\n cout << max(ans,solve(G,0,-1,D,ts)) << endl;\\n}\",\n \"accuracy\": 0.3728813559322034,\n \"time_ms\": 90,\n \"memory_kb\": 38456,\n \"score_of_the_acc\": -1.1445,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2770_3583671\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <cassert>\\nusing namespace std;\\nusing ll = long long;\\n\\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, const int v, const int prev){\\n ll t = 0, s = 0;\\n for(auto e : G[v]){\\n int v_ = e.second;\\n ll w = e.first;\\n if(v_ == prev) continue;\\n pair<ll,ll> p = dfs(G,D,v_,v);\\n ll x = max(p.first,p.second);\\n s = max(s,x+w);\\n if(s > t) swap(s,t);\\n }\\n D[v] = {t,s};\\n return D[v];\\n}\\n\\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\\n assert(A.first >= A.second);\\n assert(B.first >= B.second);\\n if(A < B) swap(A,B);\\n pair<ll,ll> ret = A;\\n ret.second = max(ret.second,B.first);\\n return ret;\\n}\\n\\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev,\\n const vector<pair<ll,ll>> &D, const pair<ll,ll> ts){\\n int N = G[v].size();\\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\\n for(int i = 0; i < N; ++i){\\n pair<ll,int> e = G[v][i];\\n int v_ = e.second;\\n ll w = e.first, l = 0;\\n if(v_ == prev) l = max(ts.first,ts.second);\\n else l = max(D[v_].first,D[v_].second);\\n E[i+1].first = l+w;\\n B[i ].first = l+w;\\n }\\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\\n ll ret = 0;\\n for(int i = 0; i < N; ++i){\\n ll w = G[v][i].first;\\n int v_ = G[v][i].second;\\n pair<ll,ll> p = D[v_];\\n if(v_ == prev) p = ts;\\n ret = max(ret,w+p.first+p.second);\\n p = top2(E[i],B[i+1]);\\n ret = max(ret,w+p.first+p.second);\\n }\\n for(int i = 0; i < N; ++i){\\n int v_ = G[v][i].second;\\n if(v_ == prev) continue;\\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\\n ret = max(ret,solve(G,v_,v,D,ts_));\\n }\\n return ret;\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n vector<vector<pair<long long,int>>> G(N);\\n for(int i = 0; i < N-1; ++i){\\n int p;\\n long long w;\\n cin >> p >> w;\\n G[p].emplace_back(w,i+1);\\n G[i+1].emplace_back(w,p);\\n }\\n vector<pair<ll,ll>> D(N,{0,0});\\n dfs(G,D,0,-1);\\n pair<ll,ll> ts(0,0);\\n cout << solve(G,0,-1,D,ts) << endl;\\n}\",\n \"accuracy\": 0.3728813559322034,\n \"time_ms\": 90,\n \"memory_kb\": 38336,\n \"score_of_the_acc\": -1.1421,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2770_3583644\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <cassert>\\nusing namespace std;\\nusing ll = long long;\\n\\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\\n ll t = 0, s = 0;\\n for(auto e : G[v]){\\n int v_ = e.second;\\n ll w = e.first;\\n if(v_ == prev) continue;\\n pair<ll,ll> p = dfs(G,D,v_,v);\\n ll x = max(p.first,p.second);\\n s = max(s,x+w);\\n if(s > t) swap(s,t);\\n }\\n D[v] = {t,s};\\n return D[v];\\n}\\n\\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\\n assert(A.first >= A.second);\\n assert(B.first >= B.second);\\n if(A < B) swap(A,B);\\n pair<ll,ll> ret = A;\\n ret.second = max(ret.second,B.first);\\n return ret;\\n}\\n\\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\\n int N = G[v].size();\\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\\n for(int i = 0; i < N; ++i){\\n pair<ll,int> e = G[v][i];\\n int v_ = e.second;\\n ll w = e.first, l = 0;\\n if(v_ == prev) l = max(ts.first,ts.second);\\n else l = max(D[v_].first,D[v_].second);\\n E[i+1].first = l+w;\\n B[i ].first = l+w;\\n }\\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\\n ll ret = 0;\\n for(int i = 0; i < N; ++i){\\n ll w = G[v][i].first;\\n int v_ = G[v][i].second;\\n pair<ll,ll> p = D[v_];\\n if(v_ == prev) p = ts;\\n ret = max(ret,w+p.first+p.second);\\n p = top2(E[i],B[i+1]);\\n ret = max(ret,w+p.first+p.second);\\n }\\n for(int i = 0; i < N; ++i){\\n int v_ = G[v][i].second;\\n if(v_ == prev) continue;\\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\\n ret = max(ret,solve(G,v_,v,D,ts_));\\n }\\n return ret;\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n vector<vector<pair<long long,int>>> G(N);\\n long long ans = 0;\\n for(int i = 0; i < N-1; ++i){\\n int p;\\n long long w;\\n cin >> p >> w;\\n G[p].emplace_back(w,i+1);\\n G[i+1].emplace_back(w,p);\\n ans = max(ans,w);\\n }\\n vector<pair<ll,ll>> D(N,{0,0});\\n dfs(G,D,0,-1);\\n // for(int i = 0; i < N; ++i)\\n // cerr << D[i].first << \\\" \\\" << D[i].second << endl;\\n pair<ll,ll> ts(0,0);\\n ans = max(ans,solve(G,0,-1,D,ts));\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.3728813559322034,\n \"time_ms\": 90,\n \"memory_kb\": 38336,\n \"score_of_the_acc\": -1.1421,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2770_3583643\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <cassert>\\nusing namespace std;\\nconst long long INF = 1e9;\\nusing ll = long long;\\n\\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\\n ll t = 0, s = 0;\\n for(auto e : G[v]){\\n int v_ = e.second;\\n ll w = e.first;\\n if(v_ == prev) continue;\\n pair<ll,ll> p = dfs(G,D,v_,v);\\n ll x = max(p.first,p.second);\\n s = max(s,x+w);\\n if(s > t) swap(s,t);\\n }\\n D[v] = {t,s};\\n return D[v];\\n}\\n\\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\\n assert(A.first >= A.second);\\n assert(B.first >= B.second);\\n if(A < B) swap(A,B);\\n pair<ll,ll> ret = A;\\n ret.second = max(ret.second,B.first);\\n return ret;\\n}\\n\\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\\n int N = G[v].size();\\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\\n for(int i = 0; i < N; ++i){\\n pair<ll,int> e = G[v][i];\\n int v_ = e.second;\\n ll w = e.first, l = 0;\\n if(v_ == prev) l = max(ts.first,ts.second);\\n else l = max(D[v_].first,D[v_].second);\\n E[i+1].first = l+w;\\n B[i ].first = l+w;\\n }\\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\\n ll ret = 0;\\n for(int i = 0; i < N; ++i){\\n ll w = G[v][i].first;\\n int v_ = G[v][i].second;\\n pair<ll,ll> p = D[v_];\\n if(v_ == prev) p = ts;\\n ret = max(ret,w+p.first+p.second);\\n p = top2(E[i],B[i+1]);\\n ret = max(ret,w+p.first+p.second);\\n }\\n for(int i = 0; i < N; ++i){\\n int v_ = G[v][i].second;\\n if(v_ == prev) continue;\\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\\n ret = max(ret,solve(G,v_,v,D,ts_));\\n }\\n return ret;\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n vector<vector<pair<long long,int>>> G(N);\\n long long ans = -INF;\\n for(int i = 0; i < N-1; ++i){\\n int p;\\n long long w;\\n cin >> p >> w;\\n G[p].emplace_back(w,i+1);\\n G[i+1].emplace_back(w,p);\\n ans = max(ans,w);\\n }\\n vector<pair<ll,ll>> D(N,{0,0});\\n dfs(G,D,0,-1);\\n // for(int i = 0; i < N; ++i)\\n // cerr << D[i].first << \\\" \\\" << D[i].second << endl;\\n pair<ll,ll> ts(0,-INF);\\n ans = max(ans,solve(G,0,-1,D,ts));\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.3728813559322034,\n \"time_ms\": 90,\n \"memory_kb\": 38296,\n \"score_of_the_acc\": -1.1413,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2770_3583636\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <cassert>\\nusing namespace std;\\nconst long long INF = 1e9;\\nusing ll = long long;\\n\\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\\n ll t = 0, s = -INF;\\n for(auto e : G[v]){\\n int v_ = e.second;\\n ll w = e.first;\\n if(v_ == prev) continue;\\n pair<ll,ll> p = dfs(G,D,v_,v);\\n ll x = max(p.first,p.second);\\n s = max(s,x+w);\\n if(s > t) swap(s,t);\\n }\\n D[v] = {t,s};\\n return D[v];\\n}\\n\\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\\n assert(A.first >= A.second);\\n assert(B.first >= B.second);\\n if(A < B) swap(A,B);\\n pair<ll,ll> ret = A;\\n ret.second = max(ret.second,B.first);\\n return ret;\\n}\\n\\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\\n int N = G[v].size();\\n vector<pair<ll,ll>> E(N+1,{0,0}), B(N+1,{0,0});\\n for(int i = 0; i < N; ++i){\\n pair<ll,int> e = G[v][i];\\n int v_ = e.second;\\n ll w = e.first, l = -INF;\\n if(v_ == prev) l = max(ts.first,ts.second);\\n else l = max(D[v_].first,D[v_].second);\\n E[i+1].first = l+w;\\n B[i ].first = l+w;\\n }\\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\\n ll ret = -INF;\\n for(int i = 0; i < N; ++i){\\n ll w = G[v][i].first;\\n int v_ = G[v][i].second;\\n pair<ll,ll> p = D[v_];\\n if(v_ == prev) p = ts;\\n ret = max(ret,w+p.first+p.second);\\n p = top2(E[i],B[i+1]);\\n ret = max(ret,w+p.first+p.second);\\n }\\n for(int i = 0; i < N; ++i){\\n int v_ = G[v][i].second;\\n if(v_ == prev) continue;\\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\\n ret = max(ret,solve(G,v_,v,D,ts_));\\n }\\n return ret;\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n vector<vector<pair<long long,int>>> G(N);\\n long long ans = -INF;\\n for(int i = 0; i < N-1; ++i){\\n int p;\\n long long w;\\n cin >> p >> w;\\n G[p].emplace_back(w,i+1);\\n G[i+1].emplace_back(w,p);\\n ans = max(ans,w);\\n }\\n vector<pair<ll,ll>> D(N,{0,0});\\n dfs(G,D,0,-1);\\n // for(int i = 0; i < N; ++i)\\n // cerr << D[i].first << \\\" \\\" << D[i].second << endl;\\n pair<ll,ll> ts(0,-INF);\\n ans = max(ans,solve(G,0,-1,D,ts));\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.3728813559322034,\n \"time_ms\": 90,\n \"memory_kb\": 38324,\n \"score_of_the_acc\": -1.1419,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2770_3583609\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <cassert>\\nusing namespace std;\\nconst long long INF = 1e9;\\nusing ll = long long;\\n\\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\\n ll t = 0, s = -INF;\\n for(auto e : G[v]){\\n int v_ = e.second;\\n ll w = e.first;\\n if(v_ == prev) continue;\\n pair<ll,ll> p = dfs(G,D,v_,v);\\n ll x = max(p.first,p.second);\\n s = max(s,x+w);\\n if(s > t) swap(s,t);\\n }\\n D[v] = {t,s};\\n return D[v];\\n}\\n\\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\\n assert(A.first >= A.second);\\n assert(B.first >= B.second);\\n if(A < B) swap(A,B);\\n pair<ll,ll> ret = A;\\n ret.second = max(ret.second,B.first);\\n return ret;\\n}\\n\\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\\n int N = G[v].size();\\n vector<pair<ll,ll>> E(N+1,{-INF,-INF}), B(N+1,{-INF,-INF});\\n for(int i = 0; i < N; ++i){\\n pair<ll,int> e = G[v][i];\\n int v_ = e.second;\\n ll w = e.first, l = -INF;\\n if(v_ == prev) l = max(ts.first,ts.second);\\n else l = max(D[v_].first,D[v_].second);\\n E[i+1].first = l+w;\\n B[i ].first = l+w;\\n }\\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\\n ll ret = -INF;\\n for(int i = 0; i < N; ++i){\\n ll w = G[v][i].first;\\n int v_ = G[v][i].second;\\n pair<ll,ll> p = D[v_];\\n if(v_ == prev) p = ts;\\n ret = max(ret,w+p.first+p.second);\\n p = top2(E[i],B[i+1]);\\n ret = max(ret,w+p.first+p.second);\\n ret = max(ret,w+p.first);\\n }\\n for(int i = 0; i < N; ++i){\\n int v_ = G[v][i].second;\\n if(v_ == prev) continue;\\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\\n ret = max(ret,solve(G,v_,v,D,ts_));\\n }\\n return ret;\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n vector<vector<pair<long long,int>>> G(N);\\n long long ans = -INF;\\n for(int i = 0; i < N-1; ++i){\\n int p;\\n long long w;\\n cin >> p >> w;\\n G[p].emplace_back(w,i+1);\\n G[i+1].emplace_back(w,p);\\n ans = max(ans,w);\\n }\\n vector<pair<ll,ll>> D(N,{0,-INF});\\n dfs(G,D,0,-1);\\n // for(int i = 0; i < N; ++i)\\n // cerr << D[i].first << \\\" \\\" << D[i].second << endl;\\n pair<ll,ll> ts(0,-INF);\\n ans = max(ans,solve(G,0,-1,D,ts));\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.3728813559322034,\n \"time_ms\": 90,\n \"memory_kb\": 38452,\n \"score_of_the_acc\": -1.1444,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2770_3583592\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <cassert>\\nusing namespace std;\\nconst long long INF = 1e9;\\nusing ll = long long;\\n\\npair<ll,ll> dfs(const vector<vector<pair<ll,int>>> &G, vector<pair<ll,ll>> &D, int v, int prev){\\n ll t = 0, s = -INF;\\n for(auto e : G[v]){\\n int v_ = e.second;\\n ll w = e.first;\\n if(v_ == prev) continue;\\n pair<ll,ll> p = dfs(G,D,v_,v);\\n ll x = max(p.first,p.second);\\n s = max(s,x+w);\\n if(s > t) swap(s,t);\\n }\\n D[v] = {t,s};\\n return D[v];\\n}\\n\\npair<ll,ll> top2(pair<ll,ll> A, pair<ll,ll> B){\\n assert(A.first >= A.second);\\n assert(B.first >= B.second);\\n if(A < B) swap(A,B);\\n pair<ll,ll> ret = A;\\n ret.second = max(ret.second,B.first);\\n return ret;\\n}\\n\\nll solve(const vector<vector<pair<long long,int>>> &G, int v, int prev, vector<pair<ll,ll>> &D, pair<ll,ll> ts){\\n int N = G[v].size();\\n vector<pair<ll,ll>> E(N+1,{-INF,-INF}), B(N+1,{-INF,-INF});\\n for(int i = 0; i < N; ++i){\\n pair<ll,int> e = G[v][i];\\n int v_ = e.second;\\n ll w = e.first, l = -INF;\\n if(v_ == prev) l = max(ts.first,ts.second);\\n else l = max(D[v_].first,D[v_].second);\\n E[i+1].first = l+w;\\n B[i ].first = l+w;\\n }\\n for(int i = 1; i <= N; ++i) E[i] = top2(E[i],E[i-1]);\\n for(int i = N-1; i >= 0; --i) B[i] = top2(B[i],B[i+1]);\\n ll ret = -INF;\\n for(int i = 0; i < N; ++i){\\n ll w = G[v][i].first;\\n int v_ = G[v][i].second;\\n pair<ll,ll> p = D[v_];\\n if(v_ == prev) p = ts;\\n ret = max(ret,w+p.first+p.second);\\n p = top2(E[i],B[i+1]);\\n ret = max(ret,w+p.first+p.second);\\n }\\n for(int i = 0; i < N; ++i){\\n int v_ = G[v][i].second;\\n if(v_ == prev) continue;\\n pair<ll,ll> ts_ = top2(E[i],B[i+1]);\\n ret = max(ret,solve(G,v_,v,D,ts_));\\n }\\n return ret;\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n vector<vector<pair<long long,int>>> G(N);\\n long long ans = -INF;\\n for(int i = 0; i < N-1; ++i){\\n int p;\\n long long w;\\n cin >> p >> w;\\n G[p].emplace_back(w,i+1);\\n G[i+1].emplace_back(w,p);\\n ans = max(ans,w);\\n }\\n vector<pair<ll,ll>> D(N,{0,-INF});\\n dfs(G,D,0,-1);\\n // for(int i = 0; i < N; ++i)\\n // cerr << D[i].first << \\\" \\\" << D[i].second << endl;\\n pair<ll,ll> ts(0,-INF);\\n ans = max(ans,solve(G,0,-1,D,ts));\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.3220338983050847,\n \"time_ms\": 90,\n \"memory_kb\": 28688,\n \"score_of_the_acc\": -0.9496,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1659,"cells":{"group_id":{"kind":"string","value":"aoj_2768_cpp"},"problem_description":{"kind":"string","value":"D: スキャナー / Scanner\n問題文\nここに $N$ 枚の紙がある。あなたは $3$ 台のスキャナーを並列に用いることで、\n全ての紙をスキャンしたいと考えている。それぞれの紙はスキャンにかかる時間が決まっており、\n$i$ 番目の紙をスキャンするのにかかる時間は $T_i$ である。\n紙をスキャンする順番は任意であるが、$1$ 台のスキャナーで複数の紙を同時にスキャンすることはできない。\n全ての紙のスキャンが終了し、スキャンを行っているスキャナーがなくなるまでにかかる時間を最小化しなさい。\n入力\n$N$\n$T_1$\n$T_2$\n$T_3$\n$\\vdots$\n$T_N$\n制約\n$1 \\leq N \\leq 50$\n$1 \\leq T_i \\leq 50$\n入力は全て整数\n出力\n答えを $1$ 行で出力してください．\nサンプル\nサンプル入力1\n4\n1\n1\n1\n1\nサンプル出力1\n2\nサンプル入力2\n9\n15\n20\n27\n4\n10\n7\n34\n30\n36\nサンプル出力2\n61\nサンプル入力3\n6\n20\n18\n46\n16\n9\n48\nサンプル出力3\n55"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2768_10851361","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define FOR(i,s,t) for(int i = s; i< t ;i++)\n\n#define SZ(x) (int)x.size()\nusing LL = long long; using ll = LL;\nconst int INF = 1e9; const LL LINF = 1e18;\n\n#define MAXT 1005\nll N;\nvector<int> T;\nbool memo[55][MAXT][MAXT];\n\nvoid dfs(int n, int x, int y,ll sum) {\n\tif (memo[n][x][y]) return;\n\tmemo[n][x][y] = true;\n\tif (n == N) return;\n\tif (x + T[n] < MAXT) dfs(n + 1, x + T[n], y,sum + T[n]);\n\tif (y + T[n] < MAXT) dfs(n + 1, x, y + T[n],sum + T[n]);\n\tif (sum - x - y + T[n] < MAXT) dfs(n + 1, x, y, sum + T[n]);\n}\n\nvoid solve() {\n\tcin >> N;\n\tT.resize(N);\n\tfor (auto& in : T) { cin >> in; }\n\tsort(T.begin(), T.end());\n\treverse(T.begin(), T.end());\n\tdfs(0, 0, 0, 0);\n\tint sum = accumulate(T.begin(), T.end(), 0);\n\n\tll ans = LINF;\n\tfor (int i = 0; i < MAXT; i++) {\n\t\tfor (int j = 0; j < MAXT; j++) {\n\t\t\tif (memo[N][i][j] == false) continue;\n\t\t\tll t = -1;\n\t\t\tt = max({ i,j,sum - i - j });\n\t\t\tans = min(ans, t);\n\t\t}\n\t}\n\tcout << ans << endl;\n}\n\n\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":52640,"score_of_the_acc":-0.4611,"final_rank":15},{"submission_id":"aoj_2768_9521829","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) { return (ull)rng() % B; }\n\nbool dp[2501][2501];\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n int sum = 0;\n vector<int> t(n);\n for (int i = 0; i < n; ++i) {\n cin >> t[i];\n sum += t[i];\n }\n dp[0][0] = true;\n for (int i = 0; i < n; ++i) {\n for (int j = 2500; j >= 0; --j) {\n for (int k = 2500; k >= 0; --k) {\n if (dp[j][k]) {\n dp[j + t[i]][k] = true;\n dp[j][k + t[i]] = true;\n }\n }\n }\n }\n int res = sum;\n for (int i = 0; i <= 2500; ++i) {\n for (int j = 0; j <= 2500; ++j) {\n if (dp[i][j]) {\n res = min(res, max({i, j, sum - i - j}));\n }\n }\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":150,"memory_kb":8484,"score_of_the_acc":-0.1702,"final_rank":8},{"submission_id":"aoj_2768_7952735","code_snippet":"#pragma region Macros\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define drep(i,n) for(ll i = (n)-1;i >= 0;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 endl '\\n'\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;\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}\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(all(res), 0);\n sort(all(res), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\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); }\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#define i128 __int128_t\n#define ull unsigned long long int\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\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;\ntemplate <typename A, typename B>\nostream& operator <<(ostream& out, const pair<A, B>& a) {\nout << \"(\" << a.first << \",\" << a.second << \")\";\nreturn out;\n}\ntemplate <typename T, size_t N>\nostream& operator <<(ostream& out, const array<T, N>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T>\nostream& operator <<(ostream& out, const vector<T>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T, class Cmp>\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" :\", \"); out << v; first = 0;} out << \"}\";\nreturn out;\n}\ntemplate <typename U, typename T, class Cmp>\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& p : a) { out << (first ? \"\" : \", \"); out << p.first << \":\" << p.second; first = 0;} out << \"}\";\nreturn out;\n}\n#define LOCAL\n#ifdef LOCAL\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define trace(...) 42\n#endif\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\ncerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\nconst char* comma = strchr(names + 1, ',');\ncerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n__f(comma + 1, args...);\n}\n#pragma endregion\n//#include<atcoder/all>\n//using namespace atcoder;\nint main(){\n INT(n);\n VEC(int,a,n);\n vv(int,dp,n*51+1,n*51+1);\n dp[0][0] = 1;\n rep(i,n){\n vv(int,tmp,n*51+1,n*51+1);\n rep(j,n*51+1)rep(k,n*51+1){\n tmp[j][k] |= dp[j][k];\n if(j+a[i] <= n*51)tmp[j+a[i]][k] |= dp[j][k];\n if(k+a[i] <= n*51)tmp[j][k+a[i]] |= dp[j][k];\n }\n swap(dp,tmp);\n }\n int sum = 0;\n rep(i,n)sum += a[i];\n int ret = 100000;\n rep(j,n*51+1)rep(k,n*51+1){\n if(dp[j][k]){\n chmin(ret,max(j,max(k,sum-j-k)));\n }\n }\n cout << ret << endl;\n return 0;\n}","accuracy":1,"time_ms":870,"memory_kb":54308,"score_of_the_acc":-1.2877,"final_rank":18},{"submission_id":"aoj_2768_7952369","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\n//#pragma GCC optimize (\"-Ofast\")\n//#pragma GCC optimize (\"unroll-loops\")\n#define int long long\n#define endl '\\n'\n//#define double __float80\nusing namespace std;\n#define fi first\n#define se second\n#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)\n#define rep2(i, a, b) for (int i = (int)(a), i##_len=(b); i < i##_len; i++)\n#define rep3(i, a, b) for (int i = (int)(a), i##_len=(b); i >= i##_len; i--)\n#define rfor(i, a) for (auto &i: a)\n#define all(obj) begin(obj), end(obj)\n#define _max(x) *max_element(all(x))\n#define _min(x) *min_element(all(x))\n#define _sum(x) accumulate(all(x), 0LL)\n\nconst int MOD = 1000000007;\n// const int MOD = 998244353;\n const int INF = 1e18;\n// const int INF = 1e13 + 7;\n// const int INF = LLONG_MAX; // 9.2e18\nconst double EPS = 1e-20;\nconst double PI = 3.14159265358979;\ntemplate <class T> using V = vector<T>;\ntemplate <class T> using VV = vector<vector<T>>;\ntemplate <class T> using VVV = vector<vector<vector<T>>>;\ntemplate <class T, class S> using P = pair<T, S>;\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;}\nint _ceil(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }\ntemplate<class T> T chmod(T &a, T mod=MOD) {a = a >= 0 ? a % mod : a - (mod * _ceil(a, mod)); return a;};\nint _mod(int a, int mod=MOD) {return a >= 0 ? a % mod : a - (mod * _ceil(a, mod));}\ndouble _mod(double a, int mod = MOD) { return fmod(a, mod) >= 0 ? fmod(a, mod) : fmod(a, mod) + mod; }\nint _pow(int a, int b, int mod=MOD) {int res = 1;for (a %= mod; b; a = a * a % mod, b >>= 1)if (b & 1) res = res * a % mod;return res;}\nvector<int> iota(int n){vector<int> ret(n); iota(begin(ret), end(ret), 0); return ret;}\nstruct mint {long long x;mint(long long x = 0): x((x % MOD + MOD) % MOD) {}mint operator-() const { return mint(-x); }mint &operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint &operator-=(const mint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint a) {(x *= a.x) %= MOD;return *this;}mint operator+(const mint a) const { return mint(*this) += a; }mint operator-(const mint a) const { return mint(*this) -= a; }mint operator*(const mint a) const { return mint(*this) *= a; }mint pow(long long n) const {mint ret(1), mul(x);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}mint 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 mint(u);}mint &operator/=(const mint a) { return *this *= a.inv(); }mint operator/(const mint a) const { return mint(*this) /= a; }bool operator==(const mint a) const { return x == a.x; }bool operator!=(const mint a) const { return x != a.x; }friend istream &operator>>(istream &is, mint &a) { return is >> a.x; }friend ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }};\n// clang-format on\n\nsigned main() {\n cin.tie(nullptr);\n cout.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n int N;\n cin >> N;\n vector<int> T(N);\n for (int i = 0; i < N; i++) {\n cin >> T[i];\n }\n vector<vector<bool>> dp(2500 + 1, vector<bool>(2500 + 1));\n dp[0][0] = true;\n for (int i = 0; i < N; i++) {\n int t = T[i];\n vector<vector<bool>> dp_new = dp;\n for (int j = 0; j < 2500 + 1; j++) {\n for (int k = 0; k < 2500 + 1; k++) {\n if (!dp[j][k]) {\n continue;\n }\n if (j + t <= 2500) {\n dp_new[j + t][k] = true;\n }\n if (k + t <= 2500) {\n dp_new[j][k + t] = true;\n }\n }\n }\n dp = dp_new;\n }\n int ans = INF;\n int T_sum = _sum(T);\n for (int j = 0; j < 2500 + 1; j++) {\n for (int k = 0; k < 2500 + 1; k++) {\n if (dp[j][k]) {\n ans = min(ans, max({j, k, T_sum - j - k}));\n }\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":370,"memory_kb":4936,"score_of_the_acc":-0.4006,"final_rank":14},{"submission_id":"aoj_2768_7950806","code_snippet":"#line 2 \"src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\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; }\n\n#line 2 \"src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr {\n T i, d;\n constexpr itr(const T i) noexcept : i(i), d(1) {}\n constexpr itr(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr x) const noexcept {\n return d > 0 ? i < x.i : i > x.i;\n }\n};\n\ntemplate < class T > struct rep {\n const itr< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end() const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end() const noexcept { return t; }\n};\n#line 2 \"src/utility/io.hpp\"\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator vector< T >() {\n vector< T > v(n);\n for(T& x : v) cin >> x;\n return v;\n }\n };\n struct mat {\n int h,w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator vector< vector< T > >() {\n vector m(h, vector< T >(w));\n for(vector< T >& v : m) for(T& x : v) cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n } su;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) {\n cout << fixed << setprecision(d);\n }\n void flush() {\n cout.flush();\n }\n}\nint print() { cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n cout << h; if(sizeof...(tail)) cout << ' ';\n return print(forward<tail>(t)...);\n}\ntemplate < class T > int print(vector< T > a, char sep = ' ') {\n int n = a.size();\n for(int i : rep(n)) cout << a[i] << (i != n - 1 ? sep : '\\n');\n return 0;\n}\ntemplate < class T > int print(vector< vector< T > > a) {\n if(a.empty()) return 0;\n int h = a.size(), w = a[0].size();\n for(int i : rep(h)) for(int j : rep(w)) cout << a[i][j] << (j != w - 1 ? ' ' : '\\n');\n return 0;\n}\n#line 2 \"src/utility/key_val.hpp\"\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n};\n#line 2 \"src/utility/vec_op.hpp\"\ntemplate < class T >\nkey_val< int, T > max_of(const vector< T >& a) {\n int i = max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\n\ntemplate < class T >\nkey_val< int, T > min_of(const vector< T >& a) {\n int i = min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\n\ntemplate < class T >\nT sum_of(const vector< T >& a) {\n T sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\n\ntemplate < class T >\nvector<ll> freq_of(const vector< T >& a, T L, T R) {\n vector<ll> res(R - L);\n for(const T x : a) res[x - L]++;\n return res;\n}\n\ntemplate < class T >\nvector<ll> freq_of(const vector< T >& a, T R) {\n return freq_of(a, T(0), R);\n}\n\ntemplate < class T >\nstruct prefix_sum {\n vector< T > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), T(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n T sum(int L, int R) {\n return s[R] - s[L];\n }\n};\n#line 2 \"A.cpp\"\n\nint main() {\n int N = in();\n vector<int> T = in(N);\n int SUM = sum_of(T);\n auto h = [&](int x, int y) { return x * SUM + y; };\n vector<int> dp((SUM + 1) * (SUM + 1), 0);\n dp[h(0, 0)] = 1;\n for(int i : rep(N)) {\n vector<int> nt = dp;\n for(int x = 0; x <= SUM; x++) {\n for(int y = 0; y <= SUM; y++) {\n if(x + T[i] <= SUM) nt[h(x + T[i], y)] |= dp[h(x, y)];\n if(y + T[i] <= SUM) nt[h(x, y + T[i])] |= dp[h(x, y)];\n }\n }\n swap(dp, nt);\n }\n\n int ans = SUM;\n for(int x = 0; x <= SUM; x++) {\n for(int y = 0; y <= SUM; y++) {\n if(dp[h(x, y)]) {\n chmin(ans, max({x, y, SUM - (x + y)}));\n }\n }\n }\n print(ans);\n}","accuracy":1,"time_ms":410,"memory_kb":45596,"score_of_the_acc":-0.7039,"final_rank":16},{"submission_id":"aoj_2768_7937039","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\nint main() {\n int N, T[50];\n static int dp[2][2501][2501];\n cin >> N;\n for (int i = 0; i < N; i++) {\n cin >> T[i];\n }\n fill_n(**dp, 2 * 2501 * 2501, INF);\n dp[1][0][0] = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 2500; j >= 0; j--) {\n for (int k = 2500; k >= 0; k--) {\n if (j >= T[i])\n dp[i & 1][j][k] = min(dp[i & 1][j][k], dp[(i + 1) & 1][j - T[i]][k]);\n if (k >= T[i])\n dp[i & 1][j][k] = min(dp[i & 1][j][k], dp[(i + 1) & 1][j][k - T[i]]);\n dp[i & 1][j][k] = min(dp[i & 1][j][k], dp[(i + 1) & 1][j][k] + T[i]);\n }\n }\n fill_n(*dp[(i + 1) & 1], 2501 * 2501, INF);\n }\n int ret = INF;\n for (int i = 0; i <= 2500; i++) {\n for (int j = 0; j <= 2500; j++) {\n ret = min(ret, max(i, max(j, dp[(N + 1) & 1][i][j])));\n }\n }\n cout << ret << endl;\n}","accuracy":1,"time_ms":900,"memory_kb":51984,"score_of_the_acc":-1.3075,"final_rank":19},{"submission_id":"aoj_2768_7084225","code_snippet":"#include <iostream>\n#include <string.h>\n#include <queue>\nusing namespace std;\n\nint dp[2501][2501];\n\nint main() {\n\tint n;\n\tint s1=0;\n\tcin>>n;\n\tmemset(dp,0,sizeof(dp));\n\tdp[0][0]=1;\n\tfor(int i=0;i<n;i++){\n\t\tint t;\n\t\tcin>>t;\n\t\t\n\t\tfor(int x=s1;x>=0;x--){\n\t\t\tfor(int y=s1;y>=0;y--){\n\t\t\t\tif(dp[x][y]==1){\n\t\t\t\t\tdp[x+t][y]=1;\n\t\t\t\t\tdp[x][y+t]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\ts1+=t;;\n\t}\n\tint ans=s1;\n\tfor(int x=0;x<=s1;x++){\n\t\tfor(int y=0;y<=s1;y++){\n\t\t\tif(dp[x][y]==1){\n\t\t\t\tint z=s1-x-y;\n\t\t\t\tint t1=max(x,y);\n\t\t\t\tint t2=max(t1,z);\n\t\t\t\tif(t2<ans)ans=t2;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":27548,"score_of_the_acc":-0.2103,"final_rank":9},{"submission_id":"aoj_2768_6986290","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n, v, s = 0;\n cin >> n;\n bool dp[901][901] = {};\n dp[0][0] = true;\n while(n--){\n cin >> v;\n s += v;\n for(int j = 900; j >= 0; j--){\n for(int k = 900; k >= 0; k--){\n if(j + v <= 900)dp[j + v][k] |= dp[j][k];\n if(k + v <= 900)dp[j][k + v] |= dp[j][k];\n }\n }\n }\n int ans = s;\n for(int j = 900; j >= 0; j--){\n for(int k = 900; k >= 0; k--){\n if(dp[j][k])ans = min(ans, max({s - j - k, j, k}));\n }\n }\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":30,"memory_kb":4208,"score_of_the_acc":-0.0052,"final_rank":1},{"submission_id":"aoj_2768_5972388","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 = 1000000007; \n\nstruct fast_io {\n\tfast_io(){\n\t\tstd::cin.tie(nullptr);\n\t\tstd::ios::sync_with_stdio(false);\n\t};\n} fio;\n\nsigned main(){\n\tcout<<fixed<<setprecision(10);\n\t\n\tconstexpr int MAX = 51;\n\tint N;\n\tvector<int> t;\n\tvector<vector<bool>> dp;\n\tint ans = INF, sum = 0;\n\t\n\tcin>>N;\n\t\n\tdp.resize(N*MAX, vector<bool>(N*MAX));\n\tt.resize(N);\n\t\n\tfor(int i = 0; i < N; i++){\n\t\tcin>>t[i];\n\t\tsum += t[i];\n\t}\n\t\n\tdp[0][0] = true;\n\t\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int j = dp.size()-1; j >= 0; j--){\n\t\t\tfor(int k = dp[j].size()-1; k >= 0; k--){\n\t\t\t\tif(!dp[j][k]) continue;\n\t\t\t\tif(j+t[i] < dp.size()) dp[j+t[i]][k] = true;\n\t\t\t\tif(k+t[i] < dp[j].size()) dp[j][k+t[i]] = true;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tfor(int i = 0; i < dp.size(); i++){\n\t\tfor(int j = 0; j < dp.size(); j++){\n\t\t\tif(!dp[i][j]) continue;\n\t\t\tans = min(ans, max({i, j, sum - i - j}));\n\t\t}\n\t}\n\t\n\tcout<<ans<<endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":260,"memory_kb":4428,"score_of_the_acc":-0.2709,"final_rank":12},{"submission_id":"aoj_2768_5972320","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\nint func(){\n int n = in();\n const int N = 2501;\n vvector<char> dp1(N,vector<char>(N,false));\n dp1[0][0] = true;\n int sum = 0;\n rep(_,n){\n vvector<char> dp2(N,vector<char>(N,false));\n int v = in();\n sum += v;\n rep(i,N){\n rep(j,N){\n if(not dp1[i][j])continue;\n dp2[i][j] = true;\n dp2[i+v][j] = true;\n dp2[i][j+v] = true;\n }\n }\n swap(dp1,dp2);\n }\n int res = 10000000;\n rep(i,N){\n rep(j,N){\n if(dp1[i][j]){\n chmin(res,max({i,j,sum-i-j}));\n }\n }\n }\n return res;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n println(func());\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":15512,"score_of_the_acc":-0.2951,"final_rank":13},{"submission_id":"aoj_2768_5972228","code_snippet":"#include<bits/stdc++.h>\n\n#define int ll\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 all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define TakAo(ans) ans ? cout << \"Takahashi\\n\" : cout << \"Aoki\\n\"\n#define YesNo(ans) ans ? cout << \"Yes\\n\" : cout << \"No\\n\"\n#define yesno(ans) ans ? cout << \"yes\\n\" : cout << \"no\\n\"\n#define YESNO(ans) ans ? cout << \"YES\\n\" : cout << \"NO\\n\"\n#define equal(f1, f2) (abs(f1 - f2) <= EPS)\n#define endl '\\n'\n#define fi first\n#define se second\n#define mkpr make_pair\n#define mktpl make_tuple\n\nusing namespace std;\nusing ll = int64_t;\nusing ld = long double;\nusing P = pair<int, int>;\nusing Tpl = tuple<int, int, int>;\nusing vvi = vector<vector<int>>;\nusing vvvec = vector<vector<vector<int>>>;\n\nconst ld EPS = 1e-8;\nconst ld Pi = acos(-1);\nconst ll INF = 1e9+10;\nconst int MOD = 998244353;\n//const int MOD = 1e4+7;\nconst int NIL = -1;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, -1, 0, 1};\n\nll cel(ll a, ll b){ return (a + b - 1) / b; }\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; }\nll sq(ll a){ return a * a; }\nll cube(ll a){ return a * a * a; }\nll powi(ll a, ll b){ ll res = 1; rep(i, b) res *= a; return res; }\ntemplate<class T> bool chmin(T &a, T b){ if(a > b){ a = b; return 1;} return 0; }\ntemplate<class T> bool chmax(T &a, T b){ if(a < b){ a = b; return 1;} return 0; }\n\nvoid Main(){\n int N, T[50], Tsum = 0; cin >> N;\n\n rep(i, N){\n cin >> T[i];\n Tsum += T[i];\n }\n \n const int smax = 1000;\n\n bool dp[2][smax][smax] = {};\n dp[1][0][0] = dp[1][T[0]][0] = dp[1][0][T[0]] = 1;\n\n for(int i = 1; i < N; i++){\n rep(j, smax){\n rep(k, smax){\n if(dp[i & 1][j][k]){\n dp[i & 1][j][k] = 0;\n dp[(i+1) & 1][j][k] = 1;\n if(j + T[i] < smax) dp[(i+1) & 1][j + T[i]][k] = 1;\n if(k + T[i] < smax) dp[(i+1) & 1][j][k + T[i]] = 1;\n }\n }\n }\n }\n\n ll ans = INF;\n rep(i, smax){\n rep(j, smax){\n if(dp[N & 1][i][j]){\n ans = min(max(i, max(j, Tsum - i - j)), ans);\n }\n }\n }\n\n cout << ans << endl;\n}\n\nsigned main(){\n cin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\tcout << fixed << setprecision(15);\n\tMain();\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5400,"score_of_the_acc":-0.0127,"final_rank":2},{"submission_id":"aoj_2768_5972195","code_snippet":"#include<bits/stdc++.h>\n\n#define int ll\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 all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define TakAo(ans) ans ? cout << \"Takahashi\\n\" : cout << \"Aoki\\n\"\n#define YesNo(ans) ans ? cout << \"Yes\\n\" : cout << \"No\\n\"\n#define yesno(ans) ans ? cout << \"yes\\n\" : cout << \"no\\n\"\n#define YESNO(ans) ans ? cout << \"YES\\n\" : cout << \"NO\\n\"\n#define equal(f1, f2) (abs(f1 - f2) <= EPS)\n#define endl '\\n'\n#define fi first\n#define se second\n#define mkpr make_pair\n#define mktpl make_tuple\n\nusing namespace std;\nusing ll = int64_t;\nusing ld = long double;\nusing P = pair<int, int>;\nusing Tpl = tuple<int, int, int>;\nusing vvi = vector<vector<int>>;\nusing vvvec = vector<vector<vector<int>>>;\n\nconst ld EPS = 1e-8;\nconst ld Pi = acos(-1);\nconst ll INF = 1e9+10;\nconst int MOD = 998244353;\n//const int MOD = 1e4+7;\nconst int NIL = -1;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, -1, 0, 1};\n\nll cel(ll a, ll b){ return (a + b - 1) / b; }\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; }\nll sq(ll a){ return a * a; }\nll cube(ll a){ return a * a * a; }\nll powi(ll a, ll b){ ll res = 1; rep(i, b) res *= a; return res; }\ntemplate<class T> bool chmin(T &a, T b){ if(a > b){ a = b; return 1;} return 0; }\ntemplate<class T> bool chmax(T &a, T b){ if(a < b){ a = b; return 1;} return 0; }\n\nvoid Main(){\n int N, T[50], Tsum = 0; cin >> N;\n\n rep(i, N){\n cin >> T[i];\n Tsum += T[i];\n }\n \n const int smax = 1000;\n\n bool dp[2][smax][smax] = {};\n dp[1][0][0] = dp[1][T[0]][0] = dp[1][0][T[0]] = 1;\n\n for(int i = 1; i < N; i++){\n rep(j, smax){\n rep(k, smax){\n if(j + k > smax) break;\n if(dp[i & 1][j][k]){\n dp[(i+1) & 1][j][k] = 1;\n if(j + T[i] < smax) dp[(i+1) & 1][j + T[i]][k] = 1;\n if(k + T[i] < smax) dp[(i+1) & 1][j][k + T[i]] = 1;\n dp[i & 1][j][k] = 0;\n }\n }\n }\n }\n\n ll ans = INF;\n rep(i, smax){\n rep(j, smax){\n if(dp[N & 1][i][j]){\n ans = min(max(i, max(j, Tsum - i - j)), ans);\n }\n }\n }\n\n cout << ans << endl;\n}\n\nsigned main(){\n cin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\tcout << fixed << setprecision(15);\n\tMain();\n return 0;\n}","accuracy":0.35714285714285715,"time_ms":30,"memory_kb":5404,"score_of_the_acc":-0.0127,"final_rank":20},{"submission_id":"aoj_2768_5972025","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 = 1000000007; \n\nstruct fast_io {\n\tfast_io(){\n\t\tstd::cin.tie(nullptr);\n\t\tstd::ios::sync_with_stdio(false);\n\t};\n} fio;\n\nsigned main(){\n\tcout<<fixed<<setprecision(10);\n\t\n\tconstexpr int MAX = 51;\n\tint N;\n\tvector<int> t;\n\tvector<vector<bool>> dp;\n\tint ans = INF, sum = 0;\n\t\n\tcin>>N;\n\t\n\tdp.resize(N*MAX, vector<bool>(N*MAX));\n\tt.resize(N);\n\t\n\tfor(int i = 0; i < N; i++){\n\t\tcin>>t[i];\n\t\tsum += t[i];\n\t}\n\t\n\tdp[0][0] = true;\n\t\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int j = dp.size()-1; j >= 0; j--){\n\t\t\tfor(int k = dp[j].size()-1; k >= 0; k--){\n\t\t\t\tif(!dp[j][k]) continue;\n\t\t\t\tif(j+t[i] < dp.size()) dp[j+t[i]][k] = true;\n\t\t\t\tif(k+t[i] < dp[j].size()) dp[j][k+t[i]] = true;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tfor(int i = 0; i < dp.size(); i++){\n\t\tfor(int j = 0; j < dp.size(); j++){\n\t\t\tif(!dp[i][j]) continue;\n\t\t\tans = min(ans, max({i, j, sum - i - j}));\n\t\t}\n\t}\n\t\n\tcout<<ans<<endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":250,"memory_kb":4412,"score_of_the_acc":-0.2593,"final_rank":11},{"submission_id":"aoj_2768_5056862","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, 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);\n\tVI a = in[n];\n\tint sum = a | Sum;\n\n\tauto dp = make_vector({sum + 1, sum + 1}, false);\n\tdp[0][0] = true;\n\trep(i, n) {\n\t\trrep(x, sum + 1) rrep(y, sum + 1) if (dp[x][y]) {\n\t\t\tif (x + a[i] <= sum) {\n\t\t\t\tdp[x + a[i]][y] = true;\n\t\t\t}\n\t\t\tif (y + a[i] <= sum) {\n\t\t\t\tdp[x][y + a[i]] = true;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = inf;\n\trep(x, sum + 1) rep(y, sum + 1) {\n\t\tif (dp[x][y]) {\n\t\t\tchmin(ans, max({x, y, sum - x - y}));\n\t\t}\n\t}\n\tout(ans);\n}","accuracy":1,"time_ms":240,"memory_kb":4216,"score_of_the_acc":-0.2466,"final_rank":10},{"submission_id":"aoj_2768_4969410","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <array>\n#include <bitset>\n#include <algorithm>\n\nconstexpr int MAX_S = 50 * 17;\nstd::array<std::array<std::bitset<MAX_S + 1>, MAX_S + 1>, 2> dp;\n\nint main(void){\n std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false);\n int n; std::cin >> n;\n dp[0][0][0] = true;\n int S = 0;\n for(int i = 0; i < n; ++i){\n int t; std::cin >> t; S += t;\n for(int o1 = 0; o1 + t <= MAX_S; ++o1) for(int o2 = 0; o2 <= MAX_S; ++o2) if(dp[0][o1][o2]) dp[1][o1 + t][o2] = true;\n for(int o1 = 0; o1 <= MAX_S; ++o1) for(int o2 = 0; o2 + t <= MAX_S; ++o2) if(dp[0][o1][o2]) dp[1][o1][o2 + t] = true;\n dp[0] = dp[1];\n }\n int res = std::numeric_limits<int>::max();\n for(int i = 0; i <= MAX_S and i < res; ++i){\n for(int j = std::max(0, S - i - res + 1), k = S - i - j; j <= MAX_S and j < res; ++j, --k) if(dp[0][i][j]){\n const int v = std::max({i, j, k});\n if(res > v) res = v;\n }\n }\n std::cout << res << '\\n';\n\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3392,"score_of_the_acc":-0.046,"final_rank":5},{"submission_id":"aoj_2768_4968724","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\n\nint main(void){\n \n long long N;\n vector<long long> T;\n int Tsum=0;\n\n cin >> N;\n for(int i=0;i<N;i++){\n long long t;\n cin >> t;\n Tsum+=t;\n T.push_back(t);\n }\n long long range = min(1000,Tsum);\n \n bool dp[2][1010][1010]={};\n dp[0][0][0]=true;\n \n for(int i=0;i<N;i++){\n for(int j=0;j<=range;j++){\n for(int k=0;k<=range;k++){\n dp[1][j][k]|=dp[0][j][k];\n if(j-T[i]>=0){\n dp[1][j][k]|=dp[0][j-T[i]][k];\n }\n if(k-T[i]>=0){\n dp[1][j][k]|=dp[0][j][k-T[i]];\n }\n }\n }\n\n\n for(int j=0;j<=range;j++){\n for(int k=0;k<=range;k++){\n dp[0][j][k]=dp[1][j][k];\n dp[1][j][k]=false;\n }\n }\n }\n \n\n int Ans = 10*Tsum;\n for(int j=0;j<=range;j++){\n for(int k=0;k<=range;k++){\n if(dp[0][j][k]){\n //cout << j << \" \" << k << \" \" << Tsum-j-k << endl;\n int r = max(max(j,k),Tsum-j-k); \n Ans=min(Ans,r);\n }\n }\n }\n\n \n cout << Ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":5440,"score_of_the_acc":-0.0474,"final_rank":6},{"submission_id":"aoj_2768_4968555","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint N;\n\tcin>>N;\n\tvector<vector<int>> p(851,vector<int>(851));\n\tint S=0;\n\tp[0][0]=1;\n\tvector<int> q(N);\n\tfor(int i=0;i<N;i++){\n\t\tcin>>q[i];\n\t}\n\tfor(int k=0;k<N;k++){\n\t\tint a=q[k];\n\t\tfor(int i=850;i>=0;i--){\n\t\t\tfor(int j=850;j>=0;j--){\n\t\t\t\tif(p[i][j]==0){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(j+a<=850){\n\t\t\t\t\tp[i][j+a]=1;\n\t\t\t\t}\n\t\t\t\tif(i+a<=850){\n\t\t\t\t\tp[i+a][j]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tS+=a;\n\t}\n\tint Z=855;\n\tfor(int i=0;i<851;i++){\n\t\tfor(int j=0;j<851;j++){\n\t\t\tif(p[i][j]==1){\n\t\t\t\tZ=min(Z,max(S-i-j,max(i,j)));\n\t\t\t}\n\t\t}\n\t}\n\tcout<<Z<<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":6320,"score_of_the_acc":-0.0185,"final_rank":3},{"submission_id":"aoj_2768_4964120","code_snippet":"#if 1\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <queue>\n#include <stack>\n#include <array>\n#include <deque>\n#include <algorithm>\n#include <utility>\n#include <cstdint>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <assert.h>\n#include <bitset>\n#include <list>\n#include <cmath>\n//#include <atcoder/all>\n\nauto& in = std::cin;\nauto& out = std::cout;\n#define all_range(C) std::begin(C), std::end(C)\nconst double PI = 3.141592653589793238462643383279502884197169399375105820974944;\n\n\ntemplate<typename T, typename U>\nstd::enable_if_t<std::rank<T>::value == 0> fill_all(T& arr, const U& v) {\n arr = v;\n}\ntemplate<typename ARR, typename U>\nstd::enable_if_t<std::rank<ARR>::value != 0> fill_all(ARR& arr, const U& v) {\n for (auto& i : arr) {\n fill_all(i, v);\n }\n}\n\nint32_t N;\nint32_t T[50];\nint dp[50][900][900];\nint func(int i, int a, int b, int c)\n{\n if (i == N) {\n return std::max({ a,b,c });\n }\n if (a >= 900 || b >= 900 || c >= 900) {\n return 1000;\n }\n\n auto& memo = dp[i][a][b];\n if (memo != -1) {\n return memo;\n }\n auto& t = T[i];\n memo = std::min({ func(i + 1,a + t, b,c), func(i + 1,a, b + t,c) , func(i + 1,a, b,c + t) });\n\n return memo;\n}\n\nint main()\n{\n using std::endl;\n using std::cout;\n in.sync_with_stdio(false);\n out.sync_with_stdio(false);\n in.tie(nullptr);\n out.tie(nullptr);\n fill_all(dp, -1);\n\n in >> N ;\n for (size_t i = 0; i < N; i++)\n {\n in >> T[i];\n }\n\n out << func(0, 0, 0, 0) << endl;\n\n return 0;\n}\n#endif","accuracy":1,"time_ms":280,"memory_kb":161412,"score_of_the_acc":-1.2874,"final_rank":17},{"submission_id":"aoj_2768_4964080","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 x){ return 63 - __builtin_clzll(x); }\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\nint main(){\n LL(n);\n vector dp(2501, vector<bool>(2501));\n dp[0][0] = 1;\n ll sum=0;\n while(n--){\n LL(t);\n sum+=t;\n rrep(2500)rrep(j,2500-i)if(dp[i][j]){\n if(i+t<=2500)dp[i+t][j]=1;\n if(j+t<=2500)dp[i][j+t]=1;\n }\n }\n ll ans=LINF;\n rep(2501)rep(j,2501)if(dp[i][j])chmin(ans,max({i,j,sum-i-j}));\n out(ans);\n}","accuracy":1,"time_ms":160,"memory_kb":4544,"score_of_the_acc":-0.1567,"final_rank":7},{"submission_id":"aoj_2768_4936983","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>\n#include<complex>\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 for(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 for(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 if(vec_n==-1)vec_n=vec_s.size();\n for(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 if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\n\nint main(){\n int n,m;\n int i,j,k;\n int a,b,c;\n vector<vector<int>> dp(1e3+7,vector<int>(1e3+7,INF));\n dp[0][0]=0;\n cin>>n;\n for(i=0;i<n;i++){\n cin>>a;\n for(j=min((int)1e3,50*i);j>=0;j--){\n for(k=min((int)1e3,50*i);k>=0;k--){\n if(dp[j][k]==INF)continue;\n if(j+a<1e3)dp[j+a][k]=min(dp[j][k],dp[j+a][k]);\n if(k+a<1e3)dp[j][k+a]=min(dp[j][k],dp[j][k+a]);\n dp[j][k]+=a;\n }\n }\n }\n int s=1e9;\n for(i=0;i<1e3;i++){\n for(j=0;j<1e3;j++){\n s=min(s,max({i,j,dp[i][j]}));\n }\n }\n cout<<s<<endl;\n}","accuracy":1,"time_ms":40,"memory_kb":7456,"score_of_the_acc":-0.0372,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2768_10851361\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,s,t) for(int i = s; i< t ;i++)\\n\\n#define SZ(x) (int)x.size()\\nusing LL = long long; using ll = LL;\\nconst int INF = 1e9; const LL LINF = 1e18;\\n\\n#define MAXT 1005\\nll N;\\nvector<int> T;\\nbool memo[55][MAXT][MAXT];\\n\\nvoid dfs(int n, int x, int y,ll sum) {\\n\\tif (memo[n][x][y]) return;\\n\\tmemo[n][x][y] = true;\\n\\tif (n == N) return;\\n\\tif (x + T[n] < MAXT) dfs(n + 1, x + T[n], y,sum + T[n]);\\n\\tif (y + T[n] < MAXT) dfs(n + 1, x, y + T[n],sum + T[n]);\\n\\tif (sum - x - y + T[n] < MAXT) dfs(n + 1, x, y, sum + T[n]);\\n}\\n\\nvoid solve() {\\n\\tcin >> N;\\n\\tT.resize(N);\\n\\tfor (auto& in : T) { cin >> in; }\\n\\tsort(T.begin(), T.end());\\n\\treverse(T.begin(), T.end());\\n\\tdfs(0, 0, 0, 0);\\n\\tint sum = accumulate(T.begin(), T.end(), 0);\\n\\n\\tll ans = LINF;\\n\\tfor (int i = 0; i < MAXT; i++) {\\n\\t\\tfor (int j = 0; j < MAXT; j++) {\\n\\t\\t\\tif (memo[N][i][j] == false) continue;\\n\\t\\t\\tll t = -1;\\n\\t\\t\\tt = max({ i,j,sum - i - j });\\n\\t\\t\\tans = min(ans, t);\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n}\\n\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(false);\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 52640,\n \"score_of_the_acc\": -0.4611,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2768_9521829\",\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) { return (ull)rng() % B; }\\n\\nbool dp[2501][2501];\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n;\\n cin >> n;\\n int sum = 0;\\n vector<int> t(n);\\n for (int i = 0; i < n; ++i) {\\n cin >> t[i];\\n sum += t[i];\\n }\\n dp[0][0] = true;\\n for (int i = 0; i < n; ++i) {\\n for (int j = 2500; j >= 0; --j) {\\n for (int k = 2500; k >= 0; --k) {\\n if (dp[j][k]) {\\n dp[j + t[i]][k] = true;\\n dp[j][k + t[i]] = true;\\n }\\n }\\n }\\n }\\n int res = sum;\\n for (int i = 0; i <= 2500; ++i) {\\n for (int j = 0; j <= 2500; ++j) {\\n if (dp[i][j]) {\\n res = min(res, max({i, j, sum - i - j}));\\n }\\n }\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 8484,\n \"score_of_the_acc\": -0.1702,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2768_7952735\",\n \"code_snippet\": \"#pragma region Macros\\n#include <bits/stdc++.h>\\n#define ll long long\\n#define ld long double\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define drep(i,n) for(ll i = (n)-1;i >= 0;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 endl '\\\\n'\\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;\\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}\\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(all(res), 0);\\n sort(all(res), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\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); }\\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#define i128 __int128_t\\n#define ull unsigned long long int\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\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;\\ntemplate <typename A, typename B>\\nostream& operator <<(ostream& out, const pair<A, B>& a) {\\nout << \\\"(\\\" << a.first << \\\",\\\" << a.second << \\\")\\\";\\nreturn out;\\n}\\ntemplate <typename T, size_t N>\\nostream& operator <<(ostream& out, const array<T, N>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T>\\nostream& operator <<(ostream& out, const vector<T>& a) {\\nout << \\\"[\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << v; first = 0;} out << \\\"]\\\";\\nreturn out;\\n}\\ntemplate <typename T, class Cmp>\\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& v : a) { out << (first ? \\\"\\\" :\\\", \\\"); out << v; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\ntemplate <typename U, typename T, class Cmp>\\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\\nout << \\\"{\\\"; bool first = true;\\nfor (auto& p : a) { out << (first ? \\\"\\\" : \\\", \\\"); out << p.first << \\\":\\\" << p.second; first = 0;} out << \\\"}\\\";\\nreturn out;\\n}\\n#define LOCAL\\n#ifdef LOCAL\\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define trace(...) 42\\n#endif\\ntemplate <typename Arg1>\\nvoid __f(const char* name, Arg1&& arg1){\\ncerr << name << \\\": \\\" << arg1 << endl;\\n}\\ntemplate <typename Arg1, typename... Args>\\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\\nconst char* comma = strchr(names + 1, ',');\\ncerr.write(names, comma - names) << \\\": \\\" << arg1 << \\\" |\\\";\\n__f(comma + 1, args...);\\n}\\n#pragma endregion\\n//#include<atcoder/all>\\n//using namespace atcoder;\\nint main(){\\n INT(n);\\n VEC(int,a,n);\\n vv(int,dp,n*51+1,n*51+1);\\n dp[0][0] = 1;\\n rep(i,n){\\n vv(int,tmp,n*51+1,n*51+1);\\n rep(j,n*51+1)rep(k,n*51+1){\\n tmp[j][k] |= dp[j][k];\\n if(j+a[i] <= n*51)tmp[j+a[i]][k] |= dp[j][k];\\n if(k+a[i] <= n*51)tmp[j][k+a[i]] |= dp[j][k];\\n }\\n swap(dp,tmp);\\n }\\n int sum = 0;\\n rep(i,n)sum += a[i];\\n int ret = 100000;\\n rep(j,n*51+1)rep(k,n*51+1){\\n if(dp[j][k]){\\n chmin(ret,max(j,max(k,sum-j-k)));\\n }\\n }\\n cout << ret << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 54308,\n \"score_of_the_acc\": -1.2877,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2768_7952369\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\n//#pragma GCC optimize (\\\"-Ofast\\\")\\n//#pragma GCC optimize (\\\"unroll-loops\\\")\\n#define int long long\\n#define endl '\\\\n'\\n//#define double __float80\\nusing namespace std;\\n#define fi first\\n#define se second\\n#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)\\n#define rep2(i, a, b) for (int i = (int)(a), i##_len=(b); i < i##_len; i++)\\n#define rep3(i, a, b) for (int i = (int)(a), i##_len=(b); i >= i##_len; i--)\\n#define rfor(i, a) for (auto &i: a)\\n#define all(obj) begin(obj), end(obj)\\n#define _max(x) *max_element(all(x))\\n#define _min(x) *min_element(all(x))\\n#define _sum(x) accumulate(all(x), 0LL)\\n\\nconst int MOD = 1000000007;\\n// const int MOD = 998244353;\\n const int INF = 1e18;\\n// const int INF = 1e13 + 7;\\n// const int INF = LLONG_MAX; // 9.2e18\\nconst double EPS = 1e-20;\\nconst double PI = 3.14159265358979;\\ntemplate <class T> using V = vector<T>;\\ntemplate <class T> using VV = vector<vector<T>>;\\ntemplate <class T> using VVV = vector<vector<vector<T>>>;\\ntemplate <class T, class S> using P = pair<T, S>;\\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;}\\nint _ceil(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }\\ntemplate<class T> T chmod(T &a, T mod=MOD) {a = a >= 0 ? a % mod : a - (mod * _ceil(a, mod)); return a;};\\nint _mod(int a, int mod=MOD) {return a >= 0 ? a % mod : a - (mod * _ceil(a, mod));}\\ndouble _mod(double a, int mod = MOD) { return fmod(a, mod) >= 0 ? fmod(a, mod) : fmod(a, mod) + mod; }\\nint _pow(int a, int b, int mod=MOD) {int res = 1;for (a %= mod; b; a = a * a % mod, b >>= 1)if (b & 1) res = res * a % mod;return res;}\\nvector<int> iota(int n){vector<int> ret(n); iota(begin(ret), end(ret), 0); return ret;}\\nstruct mint {long long x;mint(long long x = 0): x((x % MOD + MOD) % MOD) {}mint operator-() const { return mint(-x); }mint &operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint &operator-=(const mint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint a) {(x *= a.x) %= MOD;return *this;}mint operator+(const mint a) const { return mint(*this) += a; }mint operator-(const mint a) const { return mint(*this) -= a; }mint operator*(const mint a) const { return mint(*this) *= a; }mint pow(long long n) const {mint ret(1), mul(x);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}mint 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 mint(u);}mint &operator/=(const mint a) { return *this *= a.inv(); }mint operator/(const mint a) const { return mint(*this) /= a; }bool operator==(const mint a) const { return x == a.x; }bool operator!=(const mint a) const { return x != a.x; }friend istream &operator>>(istream &is, mint &a) { return is >> a.x; }friend ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }};\\n// clang-format on\\n\\nsigned main() {\\n cin.tie(nullptr);\\n cout.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n int N;\\n cin >> N;\\n vector<int> T(N);\\n for (int i = 0; i < N; i++) {\\n cin >> T[i];\\n }\\n vector<vector<bool>> dp(2500 + 1, vector<bool>(2500 + 1));\\n dp[0][0] = true;\\n for (int i = 0; i < N; i++) {\\n int t = T[i];\\n vector<vector<bool>> dp_new = dp;\\n for (int j = 0; j < 2500 + 1; j++) {\\n for (int k = 0; k < 2500 + 1; k++) {\\n if (!dp[j][k]) {\\n continue;\\n }\\n if (j + t <= 2500) {\\n dp_new[j + t][k] = true;\\n }\\n if (k + t <= 2500) {\\n dp_new[j][k + t] = true;\\n }\\n }\\n }\\n dp = dp_new;\\n }\\n int ans = INF;\\n int T_sum = _sum(T);\\n for (int j = 0; j < 2500 + 1; j++) {\\n for (int k = 0; k < 2500 + 1; k++) {\\n if (dp[j][k]) {\\n ans = min(ans, max({j, k, T_sum - j - k}));\\n }\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 4936,\n \"score_of_the_acc\": -0.4006,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2768_7950806\",\n \"code_snippet\": \"#line 2 \\\"src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\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; }\\n\\n#line 2 \\\"src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr {\\n T i, d;\\n constexpr itr(const T i) noexcept : i(i), d(1) {}\\n constexpr itr(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept {\\n return d > 0 ? i < x.i : i > x.i;\\n }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end() const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end() const noexcept { return t; }\\n};\\n#line 2 \\\"src/utility/io.hpp\\\"\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator vector< T >() {\\n vector< T > v(n);\\n for(T& x : v) cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h,w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator vector< vector< T > >() {\\n vector m(h, vector< T >(w));\\n for(vector< T >& v : m) for(T& x : v) cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n } su;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) {\\n cout << fixed << setprecision(d);\\n }\\n void flush() {\\n cout.flush();\\n }\\n}\\nint print() { cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n cout << h; if(sizeof...(tail)) cout << ' ';\\n return print(forward<tail>(t)...);\\n}\\ntemplate < class T > int print(vector< T > a, char sep = ' ') {\\n int n = a.size();\\n for(int i : rep(n)) cout << a[i] << (i != n - 1 ? sep : '\\\\n');\\n return 0;\\n}\\ntemplate < class T > int print(vector< vector< T > > a) {\\n if(a.empty()) return 0;\\n int h = a.size(), w = a[0].size();\\n for(int i : rep(h)) for(int j : rep(w)) cout << a[i][j] << (j != w - 1 ? ' ' : '\\\\n');\\n return 0;\\n}\\n#line 2 \\\"src/utility/key_val.hpp\\\"\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n};\\n#line 2 \\\"src/utility/vec_op.hpp\\\"\\ntemplate < class T >\\nkey_val< int, T > max_of(const vector< T >& a) {\\n int i = max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\n\\ntemplate < class T >\\nkey_val< int, T > min_of(const vector< T >& a) {\\n int i = min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\n\\ntemplate < class T >\\nT sum_of(const vector< T >& a) {\\n T sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\n\\ntemplate < class T >\\nvector<ll> freq_of(const vector< T >& a, T L, T R) {\\n vector<ll> res(R - L);\\n for(const T x : a) res[x - L]++;\\n return res;\\n}\\n\\ntemplate < class T >\\nvector<ll> freq_of(const vector< T >& a, T R) {\\n return freq_of(a, T(0), R);\\n}\\n\\ntemplate < class T >\\nstruct prefix_sum {\\n vector< T > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), T(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n T sum(int L, int R) {\\n return s[R] - s[L];\\n }\\n};\\n#line 2 \\\"A.cpp\\\"\\n\\nint main() {\\n int N = in();\\n vector<int> T = in(N);\\n int SUM = sum_of(T);\\n auto h = [&](int x, int y) { return x * SUM + y; };\\n vector<int> dp((SUM + 1) * (SUM + 1), 0);\\n dp[h(0, 0)] = 1;\\n for(int i : rep(N)) {\\n vector<int> nt = dp;\\n for(int x = 0; x <= SUM; x++) {\\n for(int y = 0; y <= SUM; y++) {\\n if(x + T[i] <= SUM) nt[h(x + T[i], y)] |= dp[h(x, y)];\\n if(y + T[i] <= SUM) nt[h(x, y + T[i])] |= dp[h(x, y)];\\n }\\n }\\n swap(dp, nt);\\n }\\n\\n int ans = SUM;\\n for(int x = 0; x <= SUM; x++) {\\n for(int y = 0; y <= SUM; y++) {\\n if(dp[h(x, y)]) {\\n chmin(ans, max({x, y, SUM - (x + y)}));\\n }\\n }\\n }\\n print(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 45596,\n \"score_of_the_acc\": -0.7039,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2768_7937039\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 1 << 28;\\nint main() {\\n int N, T[50];\\n static int dp[2][2501][2501];\\n cin >> N;\\n for (int i = 0; i < N; i++) {\\n cin >> T[i];\\n }\\n fill_n(**dp, 2 * 2501 * 2501, INF);\\n dp[1][0][0] = 0;\\n for (int i = 0; i < N; i++) {\\n for (int j = 2500; j >= 0; j--) {\\n for (int k = 2500; k >= 0; k--) {\\n if (j >= T[i])\\n dp[i & 1][j][k] = min(dp[i & 1][j][k], dp[(i + 1) & 1][j - T[i]][k]);\\n if (k >= T[i])\\n dp[i & 1][j][k] = min(dp[i & 1][j][k], dp[(i + 1) & 1][j][k - T[i]]);\\n dp[i & 1][j][k] = min(dp[i & 1][j][k], dp[(i + 1) & 1][j][k] + T[i]);\\n }\\n }\\n fill_n(*dp[(i + 1) & 1], 2501 * 2501, INF);\\n }\\n int ret = INF;\\n for (int i = 0; i <= 2500; i++) {\\n for (int j = 0; j <= 2500; j++) {\\n ret = min(ret, max(i, max(j, dp[(N + 1) & 1][i][j])));\\n }\\n }\\n cout << ret << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 51984,\n \"score_of_the_acc\": -1.3075,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2768_7084225\",\n \"code_snippet\": \"#include <iostream>\\n#include <string.h>\\n#include <queue>\\nusing namespace std;\\n\\nint dp[2501][2501];\\n\\nint main() {\\n\\tint n;\\n\\tint s1=0;\\n\\tcin>>n;\\n\\tmemset(dp,0,sizeof(dp));\\n\\tdp[0][0]=1;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tint t;\\n\\t\\tcin>>t;\\n\\t\\t\\n\\t\\tfor(int x=s1;x>=0;x--){\\n\\t\\t\\tfor(int y=s1;y>=0;y--){\\n\\t\\t\\t\\tif(dp[x][y]==1){\\n\\t\\t\\t\\t\\tdp[x+t][y]=1;\\n\\t\\t\\t\\t\\tdp[x][y+t]=1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ts1+=t;;\\n\\t}\\n\\tint ans=s1;\\n\\tfor(int x=0;x<=s1;x++){\\n\\t\\tfor(int y=0;y<=s1;y++){\\n\\t\\t\\tif(dp[x][y]==1){\\n\\t\\t\\t\\tint z=s1-x-y;\\n\\t\\t\\t\\tint t1=max(x,y);\\n\\t\\t\\t\\tint t2=max(t1,z);\\n\\t\\t\\t\\tif(t2<ans)ans=t2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 27548,\n \"score_of_the_acc\": -0.2103,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2768_6986290\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main(){\\n int n, v, s = 0;\\n cin >> n;\\n bool dp[901][901] = {};\\n dp[0][0] = true;\\n while(n--){\\n cin >> v;\\n s += v;\\n for(int j = 900; j >= 0; j--){\\n for(int k = 900; k >= 0; k--){\\n if(j + v <= 900)dp[j + v][k] |= dp[j][k];\\n if(k + v <= 900)dp[j][k + v] |= dp[j][k];\\n }\\n }\\n }\\n int ans = s;\\n for(int j = 900; j >= 0; j--){\\n for(int k = 900; k >= 0; k--){\\n if(dp[j][k])ans = min(ans, max({s - j - k, j, k}));\\n }\\n }\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4208,\n \"score_of_the_acc\": -0.0052,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2768_5972388\",\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 = 1000000007; \\n\\nstruct fast_io {\\n\\tfast_io(){\\n\\t\\tstd::cin.tie(nullptr);\\n\\t\\tstd::ios::sync_with_stdio(false);\\n\\t};\\n} fio;\\n\\nsigned main(){\\n\\tcout<<fixed<<setprecision(10);\\n\\t\\n\\tconstexpr int MAX = 51;\\n\\tint N;\\n\\tvector<int> t;\\n\\tvector<vector<bool>> dp;\\n\\tint ans = INF, sum = 0;\\n\\t\\n\\tcin>>N;\\n\\t\\n\\tdp.resize(N*MAX, vector<bool>(N*MAX));\\n\\tt.resize(N);\\n\\t\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tcin>>t[i];\\n\\t\\tsum += t[i];\\n\\t}\\n\\t\\n\\tdp[0][0] = true;\\n\\t\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int j = dp.size()-1; j >= 0; j--){\\n\\t\\t\\tfor(int k = dp[j].size()-1; k >= 0; k--){\\n\\t\\t\\t\\tif(!dp[j][k]) continue;\\n\\t\\t\\t\\tif(j+t[i] < dp.size()) dp[j+t[i]][k] = true;\\n\\t\\t\\t\\tif(k+t[i] < dp[j].size()) dp[j][k+t[i]] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tfor(int i = 0; i < dp.size(); i++){\\n\\t\\tfor(int j = 0; j < dp.size(); j++){\\n\\t\\t\\tif(!dp[i][j]) continue;\\n\\t\\t\\tans = min(ans, max({i, j, sum - i - j}));\\n\\t\\t}\\n\\t}\\n\\t\\n\\tcout<<ans<<endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 4428,\n \"score_of_the_acc\": -0.2709,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2768_5972320\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\nint func(){\\n int n = in();\\n const int N = 2501;\\n vvector<char> dp1(N,vector<char>(N,false));\\n dp1[0][0] = true;\\n int sum = 0;\\n rep(_,n){\\n vvector<char> dp2(N,vector<char>(N,false));\\n int v = in();\\n sum += v;\\n rep(i,N){\\n rep(j,N){\\n if(not dp1[i][j])continue;\\n dp2[i][j] = true;\\n dp2[i+v][j] = true;\\n dp2[i][j+v] = true;\\n }\\n }\\n swap(dp1,dp2);\\n }\\n int res = 10000000;\\n rep(i,N){\\n rep(j,N){\\n if(dp1[i][j]){\\n chmin(res,max({i,j,sum-i-j}));\\n }\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n println(func());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 15512,\n \"score_of_the_acc\": -0.2951,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2768_5972228\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define int ll\\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 all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define TakAo(ans) ans ? cout << \\\"Takahashi\\\\n\\\" : cout << \\\"Aoki\\\\n\\\"\\n#define YesNo(ans) ans ? cout << \\\"Yes\\\\n\\\" : cout << \\\"No\\\\n\\\"\\n#define yesno(ans) ans ? cout << \\\"yes\\\\n\\\" : cout << \\\"no\\\\n\\\"\\n#define YESNO(ans) ans ? cout << \\\"YES\\\\n\\\" : cout << \\\"NO\\\\n\\\"\\n#define equal(f1, f2) (abs(f1 - f2) <= EPS)\\n#define endl '\\\\n'\\n#define fi first\\n#define se second\\n#define mkpr make_pair\\n#define mktpl make_tuple\\n\\nusing namespace std;\\nusing ll = int64_t;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing Tpl = tuple<int, int, int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvec = vector<vector<vector<int>>>;\\n\\nconst ld EPS = 1e-8;\\nconst ld Pi = acos(-1);\\nconst ll INF = 1e9+10;\\nconst int MOD = 998244353;\\n//const int MOD = 1e4+7;\\nconst int NIL = -1;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, -1, 0, 1};\\n\\nll cel(ll a, ll b){ return (a + b - 1) / b; }\\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; }\\nll sq(ll a){ return a * a; }\\nll cube(ll a){ return a * a * a; }\\nll powi(ll a, ll b){ ll res = 1; rep(i, b) res *= a; return res; }\\ntemplate<class T> bool chmin(T &a, T b){ if(a > b){ a = b; return 1;} return 0; }\\ntemplate<class T> bool chmax(T &a, T b){ if(a < b){ a = b; return 1;} return 0; }\\n\\nvoid Main(){\\n int N, T[50], Tsum = 0; cin >> N;\\n\\n rep(i, N){\\n cin >> T[i];\\n Tsum += T[i];\\n }\\n \\n const int smax = 1000;\\n\\n bool dp[2][smax][smax] = {};\\n dp[1][0][0] = dp[1][T[0]][0] = dp[1][0][T[0]] = 1;\\n\\n for(int i = 1; i < N; i++){\\n rep(j, smax){\\n rep(k, smax){\\n if(dp[i & 1][j][k]){\\n dp[i & 1][j][k] = 0;\\n dp[(i+1) & 1][j][k] = 1;\\n if(j + T[i] < smax) dp[(i+1) & 1][j + T[i]][k] = 1;\\n if(k + T[i] < smax) dp[(i+1) & 1][j][k + T[i]] = 1;\\n }\\n }\\n }\\n }\\n\\n ll ans = INF;\\n rep(i, smax){\\n rep(j, smax){\\n if(dp[N & 1][i][j]){\\n ans = min(max(i, max(j, Tsum - i - j)), ans);\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n}\\n\\nsigned main(){\\n cin.tie(nullptr);\\n\\tios_base::sync_with_stdio(false);\\n\\tcout << fixed << setprecision(15);\\n\\tMain();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5400,\n \"score_of_the_acc\": -0.0127,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2768_5972195\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define int ll\\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 all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define TakAo(ans) ans ? cout << \\\"Takahashi\\\\n\\\" : cout << \\\"Aoki\\\\n\\\"\\n#define YesNo(ans) ans ? cout << \\\"Yes\\\\n\\\" : cout << \\\"No\\\\n\\\"\\n#define yesno(ans) ans ? cout << \\\"yes\\\\n\\\" : cout << \\\"no\\\\n\\\"\\n#define YESNO(ans) ans ? cout << \\\"YES\\\\n\\\" : cout << \\\"NO\\\\n\\\"\\n#define equal(f1, f2) (abs(f1 - f2) <= EPS)\\n#define endl '\\\\n'\\n#define fi first\\n#define se second\\n#define mkpr make_pair\\n#define mktpl make_tuple\\n\\nusing namespace std;\\nusing ll = int64_t;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing Tpl = tuple<int, int, int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvec = vector<vector<vector<int>>>;\\n\\nconst ld EPS = 1e-8;\\nconst ld Pi = acos(-1);\\nconst ll INF = 1e9+10;\\nconst int MOD = 998244353;\\n//const int MOD = 1e4+7;\\nconst int NIL = -1;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, -1, 0, 1};\\n\\nll cel(ll a, ll b){ return (a + b - 1) / b; }\\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; }\\nll sq(ll a){ return a * a; }\\nll cube(ll a){ return a * a * a; }\\nll powi(ll a, ll b){ ll res = 1; rep(i, b) res *= a; return res; }\\ntemplate<class T> bool chmin(T &a, T b){ if(a > b){ a = b; return 1;} return 0; }\\ntemplate<class T> bool chmax(T &a, T b){ if(a < b){ a = b; return 1;} return 0; }\\n\\nvoid Main(){\\n int N, T[50], Tsum = 0; cin >> N;\\n\\n rep(i, N){\\n cin >> T[i];\\n Tsum += T[i];\\n }\\n \\n const int smax = 1000;\\n\\n bool dp[2][smax][smax] = {};\\n dp[1][0][0] = dp[1][T[0]][0] = dp[1][0][T[0]] = 1;\\n\\n for(int i = 1; i < N; i++){\\n rep(j, smax){\\n rep(k, smax){\\n if(j + k > smax) break;\\n if(dp[i & 1][j][k]){\\n dp[(i+1) & 1][j][k] = 1;\\n if(j + T[i] < smax) dp[(i+1) & 1][j + T[i]][k] = 1;\\n if(k + T[i] < smax) dp[(i+1) & 1][j][k + T[i]] = 1;\\n dp[i & 1][j][k] = 0;\\n }\\n }\\n }\\n }\\n\\n ll ans = INF;\\n rep(i, smax){\\n rep(j, smax){\\n if(dp[N & 1][i][j]){\\n ans = min(max(i, max(j, Tsum - i - j)), ans);\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n}\\n\\nsigned main(){\\n cin.tie(nullptr);\\n\\tios_base::sync_with_stdio(false);\\n\\tcout << fixed << setprecision(15);\\n\\tMain();\\n return 0;\\n}\",\n \"accuracy\": 0.35714285714285715,\n \"time_ms\": 30,\n \"memory_kb\": 5404,\n \"score_of_the_acc\": -0.0127,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2768_5972025\",\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 = 1000000007; \\n\\nstruct fast_io {\\n\\tfast_io(){\\n\\t\\tstd::cin.tie(nullptr);\\n\\t\\tstd::ios::sync_with_stdio(false);\\n\\t};\\n} fio;\\n\\nsigned main(){\\n\\tcout<<fixed<<setprecision(10);\\n\\t\\n\\tconstexpr int MAX = 51;\\n\\tint N;\\n\\tvector<int> t;\\n\\tvector<vector<bool>> dp;\\n\\tint ans = INF, sum = 0;\\n\\t\\n\\tcin>>N;\\n\\t\\n\\tdp.resize(N*MAX, vector<bool>(N*MAX));\\n\\tt.resize(N);\\n\\t\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tcin>>t[i];\\n\\t\\tsum += t[i];\\n\\t}\\n\\t\\n\\tdp[0][0] = true;\\n\\t\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int j = dp.size()-1; j >= 0; j--){\\n\\t\\t\\tfor(int k = dp[j].size()-1; k >= 0; k--){\\n\\t\\t\\t\\tif(!dp[j][k]) continue;\\n\\t\\t\\t\\tif(j+t[i] < dp.size()) dp[j+t[i]][k] = true;\\n\\t\\t\\t\\tif(k+t[i] < dp[j].size()) dp[j][k+t[i]] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tfor(int i = 0; i < dp.size(); i++){\\n\\t\\tfor(int j = 0; j < dp.size(); j++){\\n\\t\\t\\tif(!dp[i][j]) continue;\\n\\t\\t\\tans = min(ans, max({i, j, sum - i - j}));\\n\\t\\t}\\n\\t}\\n\\t\\n\\tcout<<ans<<endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 4412,\n \"score_of_the_acc\": -0.2593,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2768_5056862\",\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, 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);\\n\\tVI a = in[n];\\n\\tint sum = a | Sum;\\n\\n\\tauto dp = make_vector({sum + 1, sum + 1}, false);\\n\\tdp[0][0] = true;\\n\\trep(i, n) {\\n\\t\\trrep(x, sum + 1) rrep(y, sum + 1) if (dp[x][y]) {\\n\\t\\t\\tif (x + a[i] <= sum) {\\n\\t\\t\\t\\tdp[x + a[i]][y] = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (y + a[i] <= sum) {\\n\\t\\t\\t\\tdp[x][y + a[i]] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = inf;\\n\\trep(x, sum + 1) rep(y, sum + 1) {\\n\\t\\tif (dp[x][y]) {\\n\\t\\t\\tchmin(ans, max({x, y, sum - x - y}));\\n\\t\\t}\\n\\t}\\n\\tout(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 4216,\n \"score_of_the_acc\": -0.2466,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2768_4969410\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <array>\\n#include <bitset>\\n#include <algorithm>\\n\\nconstexpr int MAX_S = 50 * 17;\\nstd::array<std::array<std::bitset<MAX_S + 1>, MAX_S + 1>, 2> dp;\\n\\nint main(void){\\n std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false);\\n int n; std::cin >> n;\\n dp[0][0][0] = true;\\n int S = 0;\\n for(int i = 0; i < n; ++i){\\n int t; std::cin >> t; S += t;\\n for(int o1 = 0; o1 + t <= MAX_S; ++o1) for(int o2 = 0; o2 <= MAX_S; ++o2) if(dp[0][o1][o2]) dp[1][o1 + t][o2] = true;\\n for(int o1 = 0; o1 <= MAX_S; ++o1) for(int o2 = 0; o2 + t <= MAX_S; ++o2) if(dp[0][o1][o2]) dp[1][o1][o2 + t] = true;\\n dp[0] = dp[1];\\n }\\n int res = std::numeric_limits<int>::max();\\n for(int i = 0; i <= MAX_S and i < res; ++i){\\n for(int j = std::max(0, S - i - res + 1), k = S - i - j; j <= MAX_S and j < res; ++j, --k) if(dp[0][i][j]){\\n const int v = std::max({i, j, k});\\n if(res > v) res = v;\\n }\\n }\\n std::cout << res << '\\\\n';\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.046,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2768_4968724\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\n\\nint main(void){\\n \\n long long N;\\n vector<long long> T;\\n int Tsum=0;\\n\\n cin >> N;\\n for(int i=0;i<N;i++){\\n long long t;\\n cin >> t;\\n Tsum+=t;\\n T.push_back(t);\\n }\\n long long range = min(1000,Tsum);\\n \\n bool dp[2][1010][1010]={};\\n dp[0][0][0]=true;\\n \\n for(int i=0;i<N;i++){\\n for(int j=0;j<=range;j++){\\n for(int k=0;k<=range;k++){\\n dp[1][j][k]|=dp[0][j][k];\\n if(j-T[i]>=0){\\n dp[1][j][k]|=dp[0][j-T[i]][k];\\n }\\n if(k-T[i]>=0){\\n dp[1][j][k]|=dp[0][j][k-T[i]];\\n }\\n }\\n }\\n\\n\\n for(int j=0;j<=range;j++){\\n for(int k=0;k<=range;k++){\\n dp[0][j][k]=dp[1][j][k];\\n dp[1][j][k]=false;\\n }\\n }\\n }\\n \\n\\n int Ans = 10*Tsum;\\n for(int j=0;j<=range;j++){\\n for(int k=0;k<=range;k++){\\n if(dp[0][j][k]){\\n //cout << j << \\\" \\\" << k << \\\" \\\" << Tsum-j-k << endl;\\n int r = max(max(j,k),Tsum-j-k); \\n Ans=min(Ans,r);\\n }\\n }\\n }\\n\\n \\n cout << Ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5440,\n \"score_of_the_acc\": -0.0474,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2768_4968555\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n\\tint N;\\n\\tcin>>N;\\n\\tvector<vector<int>> p(851,vector<int>(851));\\n\\tint S=0;\\n\\tp[0][0]=1;\\n\\tvector<int> q(N);\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tcin>>q[i];\\n\\t}\\n\\tfor(int k=0;k<N;k++){\\n\\t\\tint a=q[k];\\n\\t\\tfor(int i=850;i>=0;i--){\\n\\t\\t\\tfor(int j=850;j>=0;j--){\\n\\t\\t\\t\\tif(p[i][j]==0){\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(j+a<=850){\\n\\t\\t\\t\\t\\tp[i][j+a]=1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(i+a<=850){\\n\\t\\t\\t\\t\\tp[i+a][j]=1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tS+=a;\\n\\t}\\n\\tint Z=855;\\n\\tfor(int i=0;i<851;i++){\\n\\t\\tfor(int j=0;j<851;j++){\\n\\t\\t\\tif(p[i][j]==1){\\n\\t\\t\\t\\tZ=min(Z,max(S-i-j,max(i,j)));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<Z<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6320,\n \"score_of_the_acc\": -0.0185,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2768_4964120\",\n \"code_snippet\": \"#if 1\\n#include <iostream>\\n#include <fstream>\\n#include <string>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <queue>\\n#include <stack>\\n#include <array>\\n#include <deque>\\n#include <algorithm>\\n#include <utility>\\n#include <cstdint>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <assert.h>\\n#include <bitset>\\n#include <list>\\n#include <cmath>\\n//#include <atcoder/all>\\n\\nauto& in = std::cin;\\nauto& out = std::cout;\\n#define all_range(C) std::begin(C), std::end(C)\\nconst double PI = 3.141592653589793238462643383279502884197169399375105820974944;\\n\\n\\ntemplate<typename T, typename U>\\nstd::enable_if_t<std::rank<T>::value == 0> fill_all(T& arr, const U& v) {\\n arr = v;\\n}\\ntemplate<typename ARR, typename U>\\nstd::enable_if_t<std::rank<ARR>::value != 0> fill_all(ARR& arr, const U& v) {\\n for (auto& i : arr) {\\n fill_all(i, v);\\n }\\n}\\n\\nint32_t N;\\nint32_t T[50];\\nint dp[50][900][900];\\nint func(int i, int a, int b, int c)\\n{\\n if (i == N) {\\n return std::max({ a,b,c });\\n }\\n if (a >= 900 || b >= 900 || c >= 900) {\\n return 1000;\\n }\\n\\n auto& memo = dp[i][a][b];\\n if (memo != -1) {\\n return memo;\\n }\\n auto& t = T[i];\\n memo = std::min({ func(i + 1,a + t, b,c), func(i + 1,a, b + t,c) , func(i + 1,a, b,c + t) });\\n\\n return memo;\\n}\\n\\nint main()\\n{\\n using std::endl;\\n using std::cout;\\n in.sync_with_stdio(false);\\n out.sync_with_stdio(false);\\n in.tie(nullptr);\\n out.tie(nullptr);\\n fill_all(dp, -1);\\n\\n in >> N ;\\n for (size_t i = 0; i < N; i++)\\n {\\n in >> T[i];\\n }\\n\\n out << func(0, 0, 0, 0) << endl;\\n\\n return 0;\\n}\\n#endif\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 161412,\n \"score_of_the_acc\": -1.2874,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2768_4964080\",\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 x){ return 63 - __builtin_clzll(x); }\\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\\nint main(){\\n LL(n);\\n vector dp(2501, vector<bool>(2501));\\n dp[0][0] = 1;\\n ll sum=0;\\n while(n--){\\n LL(t);\\n sum+=t;\\n rrep(2500)rrep(j,2500-i)if(dp[i][j]){\\n if(i+t<=2500)dp[i+t][j]=1;\\n if(j+t<=2500)dp[i][j+t]=1;\\n }\\n }\\n ll ans=LINF;\\n rep(2501)rep(j,2501)if(dp[i][j])chmin(ans,max({i,j,sum-i-j}));\\n out(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 4544,\n \"score_of_the_acc\": -0.1567,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2768_4936983\",\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>\\n#include<complex>\\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 for(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 for(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 if(vec_n==-1)vec_n=vec_s.size();\\n for(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 if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\n\\nint main(){\\n int n,m;\\n int i,j,k;\\n int a,b,c;\\n vector<vector<int>> dp(1e3+7,vector<int>(1e3+7,INF));\\n dp[0][0]=0;\\n cin>>n;\\n for(i=0;i<n;i++){\\n cin>>a;\\n for(j=min((int)1e3,50*i);j>=0;j--){\\n for(k=min((int)1e3,50*i);k>=0;k--){\\n if(dp[j][k]==INF)continue;\\n if(j+a<1e3)dp[j+a][k]=min(dp[j][k],dp[j+a][k]);\\n if(k+a<1e3)dp[j][k+a]=min(dp[j][k],dp[j][k+a]);\\n dp[j][k]+=a;\\n }\\n }\\n }\\n int s=1e9;\\n for(i=0;i<1e3;i++){\\n for(j=0;j<1e3;j++){\\n s=min(s,max({i,j,dp[i][j]}));\\n }\\n }\\n cout<<s<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7456,\n \"score_of_the_acc\": -0.0372,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1660,"cells":{"group_id":{"kind":"string","value":"aoj_2769_cpp"},"problem_description":{"kind":"string","value":"E: 28\n問題文\nトランプゲームの大富豪において，ランクが $2$, $8$ のカードは強力です．\nそこで，$10$ 進数表記で数字の $2$, $8$ のみからなる整数を\n良い整数\nと呼ぶことにします．\n良い整数を小さいものから列挙すると $2, 8, 22, 28, 82, 88, \\cdots$ となります．\n$n$ を正の整数とします．$n$ が良い整数の積の形で表現できるとき，\n最大でいくつの積になるか求めてください．できないなら $-1$ と出力してください．\n入力\n$n$\n制約\n$1 \\leq n \\leq 10^{18}$\n出力\n答えを $1$ 行で出力してください．\nサンプル\nサンプル入力1\n1\nサンプル出力1\n-1\nサンプル入力2\n2\nサンプル出力2\n1\nサンプル入力3\n88\nサンプル出力3\n3\n$2 \\times 2 \\times 22$ と表せます．\nサンプル入力4\n100\nサンプル出力4\n-1\nサンプル入力5\n173553147234869248\nサンプル出力5\n11\n$2^6 \\times 28 \\times 2222^3 \\times 8828$ と表せます．"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2769_5972328","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\nvector<ll> gene28(){\n vector<ll> res;\n string buf = \"\";\n method(rec,void,int rem){\n if(rem==0){\n res.emplace_back(stoll(buf));\n return;\n }\n buf += \"2\";\n rec(rem-1);\n buf.erase(buf.end()-1);\n buf += \"8\";\n rec(rem-1);\n buf.erase(buf.end()-1);\n };\n rep(i,1,19){\n rec(i);\n }\n sort(all(res));\n return res;\n}\n\nint func(){\n ll n = in();\n if(n==1)return -1;\n map<ll,int> m;\n vector<ll> v28 = gene28();\n method(rec,int,ll n){\n if(n==1)return 0;\n if(m.count(n))return m[n];\n int res = -INF;\n foreach(i,v28){\n if(i > n)break;\n if(n % i == 0){\n chmax(res,1+rec(n/i));\n }\n }\n return m[n] = res;\n };\n\n int res = rec(n);\n if(res<0)return -1;\n return res;\n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n println(func());\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":9236,"score_of_the_acc":-0.2016,"final_rank":9},{"submission_id":"aoj_2769_4968710","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <map>\n#include <utility>\n#include <vector>\n\ntemplate <class InputIterator>\nstd::ostream& range_output(std::ostream& os_arg, InputIterator first_arg, InputIterator last_arg){ if(first_arg != last_arg){ do{ os_arg << *(first_arg++); if(first_arg == last_arg) break; os_arg << ' '; } while(true); } return os_arg; }\ntemplate <class Tp> std::ostream& operator << (std::ostream& os_arg, const std::vector<Tp>& arr_arg){ return range_output(os_arg, arr_arg.cbegin(), arr_arg.cend()); }\ntemplate <class Tp, std::size_t Size> std::ostream& operator << (std::ostream& os_arg, const std::array<Tp, Size>& arr_arg){ return range_output(os_arg, arr_arg.cbegin(), arr_arg.cend()); }\ntemplate <class S, class T> std::ostream& operator << (std::ostream& os_arg, const std::pair<S, T>& pair_arg){ return os_arg << '(' << pair_arg.first << \", \" << pair_arg.second << ')'; }\n\n#ifndef ONLINE_JUDGE\n template <typename Head> void dump_out(Head head_arg){ std::cerr << head_arg << '\\n'; }\n template <typename Head, typename... Tail>\n void dump_out(Head head_arg, Tail... tail_args){ std::cerr << head_arg << \", \"; dump_out(tail_args...); }\n #define dump(...) do { std::cerr << \"[in line \" << __LINE__ << \"] \" << #__VA_ARGS__ << \" : \"; dump_out(__VA_ARGS__); } while(false)\n#else\n #define dump(...) (void(0))\n#endif\n\ntemplate <class S, class T> bool chmax(S& x, const T& y){ if(x < y){x = y; return true; } return false; }\ntemplate <class S, class T> bool chmin(S& x, const T& y){ if(x > y){x = y; return true; } return false; }\n\nstd::vector<long long int> S, T;\n\nstd::map<long long int, int> dp;\n\nvoid dfs1(int depth = 0, long long int val = 0, long long int D = 1){\n if(val != 0) S.push_back(val);\n if(depth < 9){\n dfs1(depth + 1, val + 2 * D, 10 * D);\n dfs1(depth + 1, val + 8 * D, 10 * D);\n }\n}\n\nvoid dfs2(int depth = 0, long long int val = 0, long long int D = 1){\n if(val != 0) T.push_back(val);\n if(depth < 18){\n dfs2(depth + 1, val + 2 * D, 10 * D);\n dfs2(depth + 1, val + 8 * D, 10 * D);\n }\n}\n\nint solve(long long int v){\n if(v % 2 == 1) return -1;\n if(dp.find(v) != dp.end()) return dp[v];\n\n int res = -1;\n const auto itr = std::lower_bound(T.cbegin(), T.cend(), v);\n if(itr != T.cend() and *itr == v) res = 1;\n for(const auto s : S){\n const long long int t = v / s;\n if(t < s) break;\n if(v % s != 0) continue;\n const int r = solve(t);\n if(r == -1) continue;\n chmax(res, r + 1);\n }\n return dp[v] = res;\n}\n\n\n\nint main(void){\n std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false);\n long long int n; std::cin >> n;\n dfs1(); std::sort(S.begin(), S.end());\n dfs2(); std::sort(T.begin(), T.end());\n std::cout << solve(n) << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":9368,"score_of_the_acc":-0.1125,"final_rank":5},{"submission_id":"aoj_2769_4968691","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint64_t N;\n\tcin>>N;\n\tvector<int64_t>p;\n\tfor(int64_t i=(1<<19)-1;i>0;i--){\n\t\tint64_t A=-1,K=1e18L,B=0;\n\t\tfor(int j=18;j>=0;j--){\n\t\t\tif(A==-1&&!(i&(1<<j))){\n\t\t\t\tK/=10;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(A==-1&&(i&(1<<j))){\n\t\t\t\tA=0;\n\t\t\t\tB=j;\n\t\t\t}\n\t\t\telse if(i&(1<<j)){\n\t\t\t\tB--;\n\t\t\t\tA+=8*K;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tA+=2*K;\n\t\t\t}\n\t\t\tK/=10;\n\t\t}\n\t\tif(B==0){\n\t\t\tcontinue;\n\t\t}\n\t\tp.push_back(A);\n\t}\n\tint Z=0;\n\tif(N==1){\n\t\tcout<<\"-1\"<<endl;\n\t\treturn 0;\n\t}\n\tmap<int64_t,int64_t> m;\n\tm[N]=0;\n\tfor(int i=0;i<p.size();i++){\n\t\tfor(auto x:m){\n\t\t\tint64_t b,c;\n\t\t\ttie(b,c)=x;\n\t\t\twhile(b%p[i]==0){\n\t\t\t\tb/=p[i];\n\t\t\t\tc++;\n\t\t\t\tif(!m.count(b)){\n\t\t\t\t\tm[b]=c;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tm[b]=max(c,m[b]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(m.count(1)){\n\t\tcout<<m[1]<<endl;\n\t}\n\telse{\n\t\tcout<<\"-1\"<<endl;\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":9396,"score_of_the_acc":-0.1128,"final_rank":6},{"submission_id":"aoj_2769_4968492","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint64_t N;\n\tcin>>N;\n\tvector<int64_t>p;\n\tfor(int64_t i=(1<<19)-1;i>0;i--){\n\t\tint64_t A=-1,K=1e18L,B=0;\n\t\tfor(int j=18;j>=0;j--){\n\t\t\tif(A==-1&&!(i&(1<<j))){\n\t\t\t\tK/=10;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(A==-1&&(i&(1<<j))){\n\t\t\t\tA=0;\n\t\t\t\tB=j;\n\t\t\t}\n\t\t\telse if(i&(1<<j)){\n\t\t\t\tB--;\n\t\t\t\tA+=8*K;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tA+=2*K;\n\t\t\t}\n\t\t\tK/=10;\n\t\t}\n\t\tif(B==0){\n\t\t\tcontinue;\n\t\t}\n\t\tp.push_back(A);\n\t}\n\tint Z=0;\n\tif(N==1){\n\t\tcout<<\"-1\"<<endl;\n\t\treturn 0;\n\t}\n\tfor(int i=0;i<p.size();i++){\n\t\twhile(N%p[i]==0){\n\t\t\tN/=p[i];\n\t\t\tZ++;\n\t\t}\n\t}\n\tif(N==1){\n\t\tcout<<Z<<endl;\n\t}\n\telse{\n\t\tcout<<\"-1\"<<endl;\n\t}\n}","accuracy":0.1346153846153846,"time_ms":20,"memory_kb":9000,"score_of_the_acc":-0.1076,"final_rank":18},{"submission_id":"aoj_2769_4964542","code_snippet":"#if 1\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <queue>\n#include <stack>\n#include <array>\n#include <deque>\n#include <algorithm>\n#include <utility>\n#include <cstdint>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <assert.h>\n#include <bitset>\n#include <list>\n#include <cmath>\n//#include <atcoder/all>\n\nauto& in = std::cin;\nauto& out = std::cout;\n#define all_range(C) std::begin(C), std::end(C)\nconst double PI = 3.141592653589793238462643383279502884197169399375105820974944;\n\nstd::map<uint64_t, int> makeable;\nstd::set<uint64_t> prim2;\nvoid dfs(int i, uint64_t base) {\n if (i == 18) {\n return;\n }\n\n if (!makeable.count(base + 2)) {\n //makeable.insert({ base + 2,1 });\n prim2.insert(base + 2);\n //makeable.insert(base + 2);\n //for (auto& p : prim2) {\n // if ((base + 2) < 10000000000000000000 / p) {\n // makeable.insert((base + 2) * p);\n // }\n //}\n }\n if (!makeable.count(base + 8)) {\n //makeable.insert({ base + 8,1 });\n prim2.insert(base + 8);\n //makeable.insert(base + 8);\n //for (auto& p : prim2) {\n // if ((base + 8) < 10000000000000000000 / p) {\n // makeable.insert((base + 8) * p);\n // }\n //}\n }\n dfs(i + 1, (base + 2) * 10);\n dfs(i + 1, (base + 8) * 10);\n}\n\nuint64_t N;\nstd::map<std::pair< uint64_t, uint64_t>, int > dp;\nint dfs2(uint64_t n, std::set<uint64_t>::iterator iter) {\n\n if (dp.count({ n, 0 })) {\n return dp[{n, 0}];\n }\n auto iter_end = ++iter;\n int res = -1;\n for (;;) {\n if (n == 1) {\n return 0;\n }\n if (*iter == 1) { return dp[{n, 0}] = res; }\n if (n % 2 == 1) { return dp[{n, 0}] = res; }\n if (n % *iter == 0) {\n auto tmp = dfs2(n / *iter, --prim2.upper_bound(n / *iter));\n if (tmp >= 0) {\n res = std::max(res, 1 + tmp);\n }\n }\n //return std::max(res, dfs2(n, std::prev(iter)));\n --iter;\n }\n}\n\nint main()\n{\n using std::endl;\n in.sync_with_stdio(false);\n out.sync_with_stdio(false);\n in.tie(nullptr);\n out.tie(nullptr);\n prim2.insert(1);\n dfs(0, 0);\n\n in >> N;\n if (N == 1) { out << -1 << endl; return 0; }\n int res = -1;\n std::set<uint64_t>::iterator iter = --prim2.end();\n while (*iter > 1000000) {\n if (N % *iter == 0) {\n auto tmp = dfs2(N / *iter, --prim2.upper_bound(N / *iter));\n if(tmp >= 0) res = std::max(res, 1 + tmp);\n if ((N / *iter) % *iter == 0) {\n tmp = dfs2(N / *iter / *iter, --prim2.upper_bound(N / *iter / *iter));\n if (tmp >= 0) res = std::max(res, 2 + tmp);\n }\n }\n --iter;\n }\n out << std::max(res, dfs2(N, iter)) << endl;\n\n return 0;\n}\n#endif","accuracy":1,"time_ms":150,"memory_kb":27776,"score_of_the_acc":-0.7499,"final_rank":13},{"submission_id":"aoj_2769_4937007","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 = 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 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 = mod) {\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}\n\nvoid solve() {\n\tvector<ll> v;\n\trep1(i, 18) {\n\t\trep(j, (1 << i)) {\n\t\t\tll s = 0;\n\t\t\tll t = 1;\n\t\t\trep(k, i) {\n\t\t\t\tif (j & (1 << k)) {\n\t\t\t\t\ts += t * 2;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ts += t * 8;\n\t\t\t\t}\n\t\t\t\tt *= 10;\n\t\t\t}\n\t\t\tv.push_back(s);\n\t\t}\n\t}\n\tsort(all(v), greater<ll>());\n\tll n; cin >> n;\n\tif (n == 1) {\n\t\tcout << -1 << \"\\n\"; return;\n\t}\n\tmap<ll, int> mp;\n\tmap<ll, int> nex;\n\tmp[n] = 0;\n\trep(i, v.size()) {\n\t\tnex.clear();\n\t\tnex = mp;\n\t\tfor (LP p : mp) {\n\t\t\tif (p.first % v[i] == 0) {\n\t\t\t\tll cop = p.first;\n\t\t\t\tint cop2 = p.second;\n\t\t\t\twhile (cop % v[i] == 0) {\n\t\t\t\t\tcop /= v[i]; cop2++;\n\t\t\t\t\tnex[cop] = max(nex[cop], cop2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmp = nex;\n\t}\n\tif (mp.find(1) == mp.end())cout << -1 << \"\\n\";\n\telse cout << mp[1] << \"\\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\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":13404,"score_of_the_acc":-0.2871,"final_rank":10},{"submission_id":"aoj_2769_4936969","code_snippet":"#include <bits/stdc++.h>\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define ALL(x) (x).begin(), (x).end()\n#define HHH(x) cerr << \"L\" << __LINE__ << \": \" << #x << \" = \" << (x) << endl\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }\n\nusing ll = long long;\nusing ld = long double;\n\nusing namespace std;\n\nconst int INF = 1e9;\n\nvector<ll> goods;\n\nmap<pair<ll,int>,int> memo;\n\nint dfs(ll n, int i) {\n // cout << n << \" \" << i << endl;\n if (n == 1) return 0;\n if (i == -1) return -INF;\n auto p = make_pair(n, i);\n if (memo.count(p)) return memo[p];\n int res = -INF;\n if (n % goods[i] == 0) chmax(res, dfs(n / goods[i], i) + 1);\n chmax(res, dfs(n, i - 1));\n return memo[p] = res;\n}\n\nint main() {\n for (int n_digit = 1; n_digit <= 18; ++n_digit) {\n REP(bit, 1 << n_digit) {\n ll val = 0;\n for (int i = 0; i < n_digit; ++i) {\n if ((bit >> i) & 1) val = val * 10 + 8;\n else val = val * 10 + 2;\n }\n goods.push_back(val);\n }\n }\n ll n;\n cin >> n;\n vector<ll> new_goods;\n for (ll x: goods) {\n if (n % x == 0) new_goods.push_back(x);\n }\n goods = new_goods;\n // REP(i,goods.size()) cout << goods[i] << endl;\n int res = dfs(n, goods.size() - 1);\n if (res <= 0) cout << -1 << endl;\n else cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":9148,"score_of_the_acc":-0.0793,"final_rank":4},{"submission_id":"aoj_2769_3999501","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n\nsigned main(){\n ios::sync_with_stdio(false);\n\tcin.tie(0);\n cout << fixed << setprecision(20);\n\n ll n;\n cin>>n;\n vector<ll> v;\n queue<ll> q;\n q.push(0);\n while(q.size()){\n ll now=q.front();\n if(now>n) break;\n q.pop();\n ll p=now*10 + 2;\n if(n%p==0) v.push_back(p);\n q.push(p);\n p = now*10 + 8;\n if(n%p==0) v.push_back(p);\n q.push(p);\n }\n // cerr << v.size() << endl;\n // for(auto i:v){\n // cerr << i << endl;\n // }\n map<ll,ll> mp;\n mp[n]=0;\n mp[1] = -1;\n for(int i=0;i<v.size();i++){\n ll now=v[i];\n for(auto j:mp){\n ll a = j.first;\n while(a%now == 0){\n mp[a/now] = max(mp[a/now],mp[a]+1);\n a/=now;\n }\n } \n }\n cout << mp[1] << endl;\n \n}","accuracy":1,"time_ms":10,"memory_kb":7000,"score_of_the_acc":-0.0508,"final_rank":3},{"submission_id":"aoj_2769_3720736","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\n\nvector<LL> st;\nint ans = -1;\n\nvoid dfs(LL N, int k, int use){\n if(k >= st.size()) return;\n LL now = st[k];\n if(N == 1){\n ans = max(ans, use);\n return;\n }\n if(now > N) return;\n if(N % now == 0){\n dfs(N/now, k, use+1);\n }\n dfs(N, k+1, use);\n}\n\nint main(){\n LL N;\n cin>>N;\n if(N == 1){\n cout << -1 << endl;\n return 0;\n }\n set<LL> M;\n for(int i=1;i<=18;i++)\n {\n for(int j=0;j<(1<<i);j++)\n {\n LL now=0;\n for(int k=0;k<i;k++) now = now*10 + (j>>k&1 ? 8:2);\n if(__builtin_popcountll(j) == i) continue;\n M.insert(now);\n }\n }\n for(auto &&i : M)if(N % i == 0) st.push_back(i);\n dfs(N, 0, 0);\n cout << ans << endl;\n}","accuracy":1,"time_ms":160,"memory_kb":27724,"score_of_the_acc":-0.7795,"final_rank":14},{"submission_id":"aoj_2769_3720676","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\nlong N;\nvector<long>A;\nint dfs(long n,int i)\n{\n\tif(i==A.size())\n\t{\n\t\treturn n==1?0:-1;\n\t}\n\tint ans=dfs(n,i+1);\n\tint t=0;\n\twhile(n%A[i]==0)\n\t{\n\t\tt++;n/=A[i];\n\t\tint now=dfs(n,i+1);\n\t\tif(now>=0)ans=max(ans,now+t);\n\t}\n\treturn ans;\n}\nmain()\n{\n cin>>N;\n\tif(N==1)\n\t{\n\t\tcout<<-1<<endl;\n\t\treturn 0;\n\t}\n for(int i=1;i<=18;i++)\n {\n for(int j=0;j<1<<i;j++)\n {\n long now=0;\n for(int k=0;k<i;k++)now=now*10+(j>>k&1?8:2);\n\t\t\tif(N%now==0)A.push_back(now);\n\t\t}\n\t}\n\tcout<<dfs(N,0)<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3156,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2769_3720671","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\nlong N;\nvector<int>A;\nint dfs(long n,int i)\n{\n\tif(i==A.size())\n\t{\n\t\treturn n==1?0:-1;\n\t}\n\tint ans=dfs(n,i+1);\n\tint t=0;\n\twhile(n%A[i]==0)\n\t{\n\t\tt++;n/=A[i];\n\t\tint now=dfs(n,i+1);\n\t\tif(now>=0)ans=max(ans,now+t);\n\t}\n\treturn ans;\n}\nmain()\n{\n cin>>N;\n\tif(N==1)\n\t{\n\t\tcout<<-1<<endl;\n\t\treturn 0;\n\t}\n for(int i=1;i<=18;i++)\n {\n for(int j=0;j<1<<i;j++)\n {\n long now=0;\n for(int k=0;k<i;k++)now=now*10+(j>>k&1?8:2);\n\t\t\tif(N%now==0)A.push_back(now);\n\t\t}\n\t}\n\tcout<<dfs(N,0)<<endl;\n}","accuracy":0.17307692307692307,"time_ms":10,"memory_kb":3156,"score_of_the_acc":0,"final_rank":16},{"submission_id":"aoj_2769_3720361","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nlong N;\nmain()\n{\n cin>>N;\n if(N == 1){\n cout << -1 << endl;\n return 0;\n }\n set<long> M;\n for(int i=1;i<=18;i++)\n {\n for(int j=0;j<1<<i;j++)\n {\n long now=0;\n for(int k=0;k<i;k++)now=now*10+(j>>k&1?8:2);\n if(__builtin_popcountll(j) == i) continue;\n M.insert(now);\n }\n }\n int ans = 0;\n for(auto i=M.rbegin(); i!=M.rend(); i++){\n long x = *i;\n while(N > 1 && N%x == 0){\n N /= x;\n ans++;\n // cout << x << endl;\n }\n }\n if(N > 1) ans = -1;\n // cout << N << endl;\n\n cout << ans << endl;\n}","accuracy":0.1346153846153846,"time_ms":140,"memory_kb":27672,"score_of_the_acc":-0.7182,"final_rank":19},{"submission_id":"aoj_2769_3583287","code_snippet":"#include <bits/stdc++.h>\n\n#define ALL(a) (a).begin(), (a).end()\n#define llong long long\n\nusing namespace std;\nmap<llong, llong> m;\nvector<llong> l;\n\n\nllong dfs(llong n){\n\n\tif(n == 1)return 0;\n\tif(m.find(n) != m.end())return m[n];\n\tm[n] = -1;\n\tfor(auto e : l){\n\t\tif(e > n)break;\n\t\tif(n%e == 0){\n\t\t\tllong val = dfs(n/e);\n\t\t\tif(val < 0) continue;\n\t\t\tm[n] = max(m[n], 1+val);\n\t\n\t\t}\n\t}\n\tif(m[n] == 0)return -1;\n\treturn m[n];\n}\n\n/*\nllong dfs(llong n){\n\tif(n == 1)return 0;\n\tif(m.find(n) != m.end())return m[n];\n\tllong ret = \n\tfor(auto e : l){\n\t\tif(e > n)break;\n\t\tif(n%e == 0)m[n] = max(m[n], 1+dfs(n/e));\n\t}\n\tif(m[n] == 0)return -1;\n\treturn m[n];\n}\n*/\nsigned main(){\n\tllong n; cin >> n;\n\tfor(llong i = 1; i < 19; i++){\n\t\tfor(llong j = 0; j < (1 << i); j++){\n\t\t\tllong tmp = 0;\n\t\t\tllong t = 1;\n\t\t\tfor(llong k = 0; k < i; k++){\n\t\t\t\tif(j & (1 << k)){\n\t\t\t\t\ttmp += 8*t;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\ttmp += 2*t;\n\t\t\t\t}\n\t\t\t\tt *= 10;\n\t\t\t}\n\t\t\tl.push_back(tmp);\n\t\t}\n\t}\n//\tfor(int i = 0; i < 20; i++)cerr << l[i] << \" \";\n//\tcerr << endl;\n\tif(n == 1){\n\t\tcout << -1 << endl;\n\t\treturn 0;\n\t}\n\tm[1] = 0;\n\tcout << dfs(n) << endl;\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":7076,"score_of_the_acc":-0.1428,"final_rank":7},{"submission_id":"aoj_2769_3583159","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <vector>\n#include <map>\n\nint inf = 1e9;\n\nstd::map<intmax_t, int> memo;\n\nint dfs(intmax_t n, const std::vector<intmax_t>& div) {\n if (n == 1) return 0;\n if (memo.find(n) != memo.end()) return memo.at(n);\n int res = 0;\n for (auto x: div) {\n if (x > n) break;\n if (n % x != 0) continue;\n int cur = dfs(n / x, div) + 1;\n res = std::max(cur, res);\n }\n if (res == 0) res = -1;\n memo[n] = res;\n return res;\n}\n\nint main() {\n intmax_t n;\n scanf(\"%jd\", &n);\n\n if (n == 1)\n return puts(\"-1\"), 0;\n\n std::vector<intmax_t> div{2, 8};\n auto tmp = div;\n intmax_t bound = 1e18;\n while (true) {\n bool updated = false;\n std::vector<intmax_t> tmp0;\n for (auto x: tmp) {\n if (10*x > bound) continue;\n tmp0.push_back(10*x+2);\n tmp0.push_back(10*x+8);\n div.push_back(10*x+2);\n div.push_back(10*x+8);\n updated = true;\n }\n tmp = std::move(tmp0);\n if (!updated) break;\n }\n\n int res = dfs(n, div);\n if (!res) res = -1;\n printf(\"%d\\n\", res);\n}","accuracy":1,"time_ms":20,"memory_kb":12524,"score_of_the_acc":-0.1542,"final_rank":8},{"submission_id":"aoj_2769_3245142","code_snippet":"#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst int inf = (1 << 30);\nvector<long long> d;\nint solve(int pos, long long cur) {\n\tif (pos == d.size()) return -inf;\n\tif (cur == 1) return 0;\n\tint ret = solve(pos + 1, cur);\n\tif (cur % d[pos] == 0) ret = max(ret, solve(pos, cur / d[pos]) + 1);\n\treturn ret;\n}\nint main() {\n\tlong long n;\n\tcin >> n;\n\tfor (int i = 1; i <= 18; ++i) {\n\t\tfor (int j = 0; j < (1 << i) - 1; ++j) {\n\t\t\tlong long cur = 0;\n\t\t\tfor (int k = 0; k < i; ++k) {\n\t\t\t\tcur = cur * 10 + (((j >> k) & 1) ? 8 : 2);\n\t\t\t}\n\t\t\tif (n % cur == 0) {\n\t\t\t\td.push_back(cur);\n\t\t\t}\n\t\t}\n\t}\n\tint ans = solve(0, n);\n\tcout << (ans >= 0 ? ans : -1) << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3164,"score_of_the_acc":-0.0001,"final_rank":2},{"submission_id":"aoj_2769_3245139","code_snippet":"#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst int inf = (1 << 30);\nvector<long long> d;\nint solve(int pos, long long cur) {\n\tif (pos == d.size()) return -inf;\n\tif (cur == 1) return 0;\n\tint ret = solve(pos + 1, cur);\n\tif (cur % d[pos] == 0) ret = max(ret, solve(pos, cur / d[pos]) + 1);\n\treturn ret;\n}\nint main() {\n\tlong long n;\n\tcin >> n;\n\tfor (int i = 1; i <= 18; ++i) {\n\t\tfor (int j = 0; j < (1 << i) - 1; ++j) {\n\t\t\tlong long cur = 0;\n\t\t\tfor (int k = 0; k < i; ++k) {\n\t\t\t\tcur = cur * 10 + (((j >> k) & 1) ? 8 : 2);\n\t\t\t}\n\t\t\tif (n % cur == 0) {\n\t\t\t\td.push_back(cur);\n\t\t\t}\n\t\t}\n\t}\n\tint ans = solve(0, n);\n\tcout << (ans != -inf ? ans : -1) << endl;\n\treturn 0;\n}","accuracy":0.057692307692307696,"time_ms":10,"memory_kb":3160,"score_of_the_acc":-0.0001,"final_rank":20},{"submission_id":"aoj_2769_3109831","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_popcount\n\n#define INF 1e16\n#define mod 1000000007\nll n;\nvector<ll> vs;\nmap<ll,ll> dp[2];\n\nint main(){\n\n repl(i,1,19){\n rep(S,1<<i){\n string tmp;\n rep(d,i){\n if((S>>d)&1)tmp+=\"8\";\n else tmp+=\"2\";\n }\n vs.push_back(stoll(tmp));\n }\n }\n reverse(all(vs));\n cin>>n;\n if(n==1){\n cout<<-1<<endl;\n return 0;\n }\n ll m=vs.size();\n\n int crt=0,nxt=1;\n dp[crt][n]=0;\n rep(i,m){\n ll v=vs[i];\n dp[nxt].clear();\n for(auto it : dp[crt]){\n if(it.fi%v==0){\n ll tmp=it.fi,cnt=1;\n while(tmp%v==0){\n maxch(dp[nxt][tmp/v],it.se+cnt);\n tmp/=v;\n cnt++;\n }\n }\n maxch(dp[nxt][it.fi],it.se);\n }\n swap(crt,nxt);\n }\n if(dp[crt].find(1)==dp[crt].end())cout<<-1<<endl;\n else cout<<dp[crt][1]<<endl;\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":6948,"score_of_the_acc":-0.6259,"final_rank":12},{"submission_id":"aoj_2769_3107927","code_snippet":"#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\nll make(int d, int mask){\n string s = \"\";\n rep(i,d){\n if(mask>>i&1) s += '8';\n else s += '2';\n }\n return atoll(s.c_str());\n}\n\nconst int INF = 19191919;\nvector<ll> v;\nint V;\n\nconst int N = 1<<10;\nmap<ll,int> dp[N];\nint dfs(int d, ll n){\n if(d==V){\n if(n==1) return 0;\n return -INF;\n }\n if(dp[d].count(n)) return dp[d][n];\n\n int ret = -INF;\n if(n%v[d]==0) ret = max(ret, dfs(d, n/v[d])+1);\n ret = max(ret, dfs(d+1, n));\n\n return dp[d][n] = ret;\n}\n\nint main(){\n ll n;\n cin >>n;\n if(n==1){\n cout << -1 << endl;\n return 0;\n }\n\n for(int i=1; i<=9; ++i){\n rep(mask,1<<i) v.pb(make(i,mask));\n }\n V = v.size();\n\n int ans = -1;\n\n ans = max(ans, dfs(0,n));\n for(int i=10; i<=18; ++i){\n rep(mask,1<<i){\n ll val = make(i,mask);\n if(n%val==0){\n ans = max(ans, dfs(0, n/val)+1);\n }\n }\n }\n\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":340,"memory_kb":78760,"score_of_the_acc":-2,"final_rank":15},{"submission_id":"aoj_2769_3107477","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define pb push_back\n#define all(x) begin(x),end(x)\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#ifdef LOCAL\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cerr<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n#else\n#define dbg(...) {}\n#endif\n\n#define long long long // for codeforces\n\nvector<long> goods = {2,8};\nmap<long,int> memo;\n\nint dfs(long val){\n if (memo.count(val)) return memo[val];\n int ans = -1;\n for(auto v : goods){\n if(v > val) break;\n if(v == val) {\n ans = max(ans, 1);\n }\n if(val%v==0){\n int r = dfs(val/v);\n if(r > 0) ans = max(ans, r + 1);\n }\n }\n return memo[val] = ans;\n}\n\nbool isgood(long x){\n while(x>0){\n if(x%10 !=2 && x%10 != 8) return false;\n x /= 10;\n }\n return true;\n}\n\nint main(){\n rep(_,9){\n int s = goods.size();\n rep(i,s) if (goods[i] * 10 <= 1000000000){\n goods.pb(goods[i]*10 + 2);\n goods.pb(goods[i]*10 + 8);\n }\n }\n\n long v;\n cin>>v;\n\n int ans = dfs(v);\n if(isgood(v)) ans = max(ans, 1);\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3348,"score_of_the_acc":-0.3056,"final_rank":11},{"submission_id":"aoj_2769_3107475","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define pb push_back\n#define all(x) begin(x),end(x)\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#ifdef LOCAL\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cerr<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n#else\n#define dbg(...) {}\n#endif\n\n#define long long long // for codeforces\n\nvector<long> goods = {2,8};\nmap<long,int> memo;\n\nint dfs(long val){\n if (memo.count(val)) return memo[val];\n int ans = -1;\n for(auto v : goods){\n if(v > val) break;\n if(v == val) {\n ans = max(ans, 1);\n }\n if(val%v==0){\n int r = dfs(val/v);\n if(r > 0) ans = max(ans, r + 1);\n }\n }\n return memo[val] = ans;\n}\n\nint main(){\n rep(_,9){\n int s = goods.size();\n rep(i,s) if (goods[i] * 10 <= 1000000000){\n goods.pb(goods[i]*10 + 2);\n goods.pb(goods[i]*10 + 8);\n }\n }\n\n long v;\n cin>>v;\n\n cout << dfs(v) << endl;\n\n return 0;\n}","accuracy":0.17307692307692307,"time_ms":70,"memory_kb":3344,"score_of_the_acc":-0.1843,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_2769_5972328\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\nvector<ll> gene28(){\\n vector<ll> res;\\n string buf = \\\"\\\";\\n method(rec,void,int rem){\\n if(rem==0){\\n res.emplace_back(stoll(buf));\\n return;\\n }\\n buf += \\\"2\\\";\\n rec(rem-1);\\n buf.erase(buf.end()-1);\\n buf += \\\"8\\\";\\n rec(rem-1);\\n buf.erase(buf.end()-1);\\n };\\n rep(i,1,19){\\n rec(i);\\n }\\n sort(all(res));\\n return res;\\n}\\n\\nint func(){\\n ll n = in();\\n if(n==1)return -1;\\n map<ll,int> m;\\n vector<ll> v28 = gene28();\\n method(rec,int,ll n){\\n if(n==1)return 0;\\n if(m.count(n))return m[n];\\n int res = -INF;\\n foreach(i,v28){\\n if(i > n)break;\\n if(n % i == 0){\\n chmax(res,1+rec(n/i));\\n }\\n }\\n return m[n] = res;\\n };\\n\\n int res = rec(n);\\n if(res<0)return -1;\\n return res;\\n}\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n println(func());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 9236,\n \"score_of_the_acc\": -0.2016,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2769_4968710\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <array>\\n#include <cassert>\\n#include <map>\\n#include <utility>\\n#include <vector>\\n\\ntemplate <class InputIterator>\\nstd::ostream& range_output(std::ostream& os_arg, InputIterator first_arg, InputIterator last_arg){ if(first_arg != last_arg){ do{ os_arg << *(first_arg++); if(first_arg == last_arg) break; os_arg << ' '; } while(true); } return os_arg; }\\ntemplate <class Tp> std::ostream& operator << (std::ostream& os_arg, const std::vector<Tp>& arr_arg){ return range_output(os_arg, arr_arg.cbegin(), arr_arg.cend()); }\\ntemplate <class Tp, std::size_t Size> std::ostream& operator << (std::ostream& os_arg, const std::array<Tp, Size>& arr_arg){ return range_output(os_arg, arr_arg.cbegin(), arr_arg.cend()); }\\ntemplate <class S, class T> std::ostream& operator << (std::ostream& os_arg, const std::pair<S, T>& pair_arg){ return os_arg << '(' << pair_arg.first << \\\", \\\" << pair_arg.second << ')'; }\\n\\n#ifndef ONLINE_JUDGE\\n template <typename Head> void dump_out(Head head_arg){ std::cerr << head_arg << '\\\\n'; }\\n template <typename Head, typename... Tail>\\n void dump_out(Head head_arg, Tail... tail_args){ std::cerr << head_arg << \\\", \\\"; dump_out(tail_args...); }\\n #define dump(...) do { std::cerr << \\\"[in line \\\" << __LINE__ << \\\"] \\\" << #__VA_ARGS__ << \\\" : \\\"; dump_out(__VA_ARGS__); } while(false)\\n#else\\n #define dump(...) (void(0))\\n#endif\\n\\ntemplate <class S, class T> bool chmax(S& x, const T& y){ if(x < y){x = y; return true; } return false; }\\ntemplate <class S, class T> bool chmin(S& x, const T& y){ if(x > y){x = y; return true; } return false; }\\n\\nstd::vector<long long int> S, T;\\n\\nstd::map<long long int, int> dp;\\n\\nvoid dfs1(int depth = 0, long long int val = 0, long long int D = 1){\\n if(val != 0) S.push_back(val);\\n if(depth < 9){\\n dfs1(depth + 1, val + 2 * D, 10 * D);\\n dfs1(depth + 1, val + 8 * D, 10 * D);\\n }\\n}\\n\\nvoid dfs2(int depth = 0, long long int val = 0, long long int D = 1){\\n if(val != 0) T.push_back(val);\\n if(depth < 18){\\n dfs2(depth + 1, val + 2 * D, 10 * D);\\n dfs2(depth + 1, val + 8 * D, 10 * D);\\n }\\n}\\n\\nint solve(long long int v){\\n if(v % 2 == 1) return -1;\\n if(dp.find(v) != dp.end()) return dp[v];\\n\\n int res = -1;\\n const auto itr = std::lower_bound(T.cbegin(), T.cend(), v);\\n if(itr != T.cend() and *itr == v) res = 1;\\n for(const auto s : S){\\n const long long int t = v / s;\\n if(t < s) break;\\n if(v % s != 0) continue;\\n const int r = solve(t);\\n if(r == -1) continue;\\n chmax(res, r + 1);\\n }\\n return dp[v] = res;\\n}\\n\\n\\n\\nint main(void){\\n std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false);\\n long long int n; std::cin >> n;\\n dfs1(); std::sort(S.begin(), S.end());\\n dfs2(); std::sort(T.begin(), T.end());\\n std::cout << solve(n) << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 9368,\n \"score_of_the_acc\": -0.1125,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2769_4968691\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n\\tint64_t N;\\n\\tcin>>N;\\n\\tvector<int64_t>p;\\n\\tfor(int64_t i=(1<<19)-1;i>0;i--){\\n\\t\\tint64_t A=-1,K=1e18L,B=0;\\n\\t\\tfor(int j=18;j>=0;j--){\\n\\t\\t\\tif(A==-1&&!(i&(1<<j))){\\n\\t\\t\\t\\tK/=10;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif(A==-1&&(i&(1<<j))){\\n\\t\\t\\t\\tA=0;\\n\\t\\t\\t\\tB=j;\\n\\t\\t\\t}\\n\\t\\t\\telse if(i&(1<<j)){\\n\\t\\t\\t\\tB--;\\n\\t\\t\\t\\tA+=8*K;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tA+=2*K;\\n\\t\\t\\t}\\n\\t\\t\\tK/=10;\\n\\t\\t}\\n\\t\\tif(B==0){\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tp.push_back(A);\\n\\t}\\n\\tint Z=0;\\n\\tif(N==1){\\n\\t\\tcout<<\\\"-1\\\"<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tmap<int64_t,int64_t> m;\\n\\tm[N]=0;\\n\\tfor(int i=0;i<p.size();i++){\\n\\t\\tfor(auto x:m){\\n\\t\\t\\tint64_t b,c;\\n\\t\\t\\ttie(b,c)=x;\\n\\t\\t\\twhile(b%p[i]==0){\\n\\t\\t\\t\\tb/=p[i];\\n\\t\\t\\t\\tc++;\\n\\t\\t\\t\\tif(!m.count(b)){\\n\\t\\t\\t\\t\\tm[b]=c;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tm[b]=max(c,m[b]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(m.count(1)){\\n\\t\\tcout<<m[1]<<endl;\\n\\t}\\n\\telse{\\n\\t\\tcout<<\\\"-1\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 9396,\n \"score_of_the_acc\": -0.1128,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2769_4968492\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n\\tint64_t N;\\n\\tcin>>N;\\n\\tvector<int64_t>p;\\n\\tfor(int64_t i=(1<<19)-1;i>0;i--){\\n\\t\\tint64_t A=-1,K=1e18L,B=0;\\n\\t\\tfor(int j=18;j>=0;j--){\\n\\t\\t\\tif(A==-1&&!(i&(1<<j))){\\n\\t\\t\\t\\tK/=10;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif(A==-1&&(i&(1<<j))){\\n\\t\\t\\t\\tA=0;\\n\\t\\t\\t\\tB=j;\\n\\t\\t\\t}\\n\\t\\t\\telse if(i&(1<<j)){\\n\\t\\t\\t\\tB--;\\n\\t\\t\\t\\tA+=8*K;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tA+=2*K;\\n\\t\\t\\t}\\n\\t\\t\\tK/=10;\\n\\t\\t}\\n\\t\\tif(B==0){\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tp.push_back(A);\\n\\t}\\n\\tint Z=0;\\n\\tif(N==1){\\n\\t\\tcout<<\\\"-1\\\"<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tfor(int i=0;i<p.size();i++){\\n\\t\\twhile(N%p[i]==0){\\n\\t\\t\\tN/=p[i];\\n\\t\\t\\tZ++;\\n\\t\\t}\\n\\t}\\n\\tif(N==1){\\n\\t\\tcout<<Z<<endl;\\n\\t}\\n\\telse{\\n\\t\\tcout<<\\\"-1\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 0.1346153846153846,\n \"time_ms\": 20,\n \"memory_kb\": 9000,\n \"score_of_the_acc\": -0.1076,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2769_4964542\",\n \"code_snippet\": \"#if 1\\n#include <iostream>\\n#include <fstream>\\n#include <string>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <queue>\\n#include <stack>\\n#include <array>\\n#include <deque>\\n#include <algorithm>\\n#include <utility>\\n#include <cstdint>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <assert.h>\\n#include <bitset>\\n#include <list>\\n#include <cmath>\\n//#include <atcoder/all>\\n\\nauto& in = std::cin;\\nauto& out = std::cout;\\n#define all_range(C) std::begin(C), std::end(C)\\nconst double PI = 3.141592653589793238462643383279502884197169399375105820974944;\\n\\nstd::map<uint64_t, int> makeable;\\nstd::set<uint64_t> prim2;\\nvoid dfs(int i, uint64_t base) {\\n if (i == 18) {\\n return;\\n }\\n\\n if (!makeable.count(base + 2)) {\\n //makeable.insert({ base + 2,1 });\\n prim2.insert(base + 2);\\n //makeable.insert(base + 2);\\n //for (auto& p : prim2) {\\n // if ((base + 2) < 10000000000000000000 / p) {\\n // makeable.insert((base + 2) * p);\\n // }\\n //}\\n }\\n if (!makeable.count(base + 8)) {\\n //makeable.insert({ base + 8,1 });\\n prim2.insert(base + 8);\\n //makeable.insert(base + 8);\\n //for (auto& p : prim2) {\\n // if ((base + 8) < 10000000000000000000 / p) {\\n // makeable.insert((base + 8) * p);\\n // }\\n //}\\n }\\n dfs(i + 1, (base + 2) * 10);\\n dfs(i + 1, (base + 8) * 10);\\n}\\n\\nuint64_t N;\\nstd::map<std::pair< uint64_t, uint64_t>, int > dp;\\nint dfs2(uint64_t n, std::set<uint64_t>::iterator iter) {\\n\\n if (dp.count({ n, 0 })) {\\n return dp[{n, 0}];\\n }\\n auto iter_end = ++iter;\\n int res = -1;\\n for (;;) {\\n if (n == 1) {\\n return 0;\\n }\\n if (*iter == 1) { return dp[{n, 0}] = res; }\\n if (n % 2 == 1) { return dp[{n, 0}] = res; }\\n if (n % *iter == 0) {\\n auto tmp = dfs2(n / *iter, --prim2.upper_bound(n / *iter));\\n if (tmp >= 0) {\\n res = std::max(res, 1 + tmp);\\n }\\n }\\n //return std::max(res, dfs2(n, std::prev(iter)));\\n --iter;\\n }\\n}\\n\\nint main()\\n{\\n using std::endl;\\n in.sync_with_stdio(false);\\n out.sync_with_stdio(false);\\n in.tie(nullptr);\\n out.tie(nullptr);\\n prim2.insert(1);\\n dfs(0, 0);\\n\\n in >> N;\\n if (N == 1) { out << -1 << endl; return 0; }\\n int res = -1;\\n std::set<uint64_t>::iterator iter = --prim2.end();\\n while (*iter > 1000000) {\\n if (N % *iter == 0) {\\n auto tmp = dfs2(N / *iter, --prim2.upper_bound(N / *iter));\\n if(tmp >= 0) res = std::max(res, 1 + tmp);\\n if ((N / *iter) % *iter == 0) {\\n tmp = dfs2(N / *iter / *iter, --prim2.upper_bound(N / *iter / *iter));\\n if (tmp >= 0) res = std::max(res, 2 + tmp);\\n }\\n }\\n --iter;\\n }\\n out << std::max(res, dfs2(N, iter)) << endl;\\n\\n return 0;\\n}\\n#endif\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 27776,\n \"score_of_the_acc\": -0.7499,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2769_4937007\",\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 = 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 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 = mod) {\\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}\\n\\nvoid solve() {\\n\\tvector<ll> v;\\n\\trep1(i, 18) {\\n\\t\\trep(j, (1 << i)) {\\n\\t\\t\\tll s = 0;\\n\\t\\t\\tll t = 1;\\n\\t\\t\\trep(k, i) {\\n\\t\\t\\t\\tif (j & (1 << k)) {\\n\\t\\t\\t\\t\\ts += t * 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\ts += t * 8;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tt *= 10;\\n\\t\\t\\t}\\n\\t\\t\\tv.push_back(s);\\n\\t\\t}\\n\\t}\\n\\tsort(all(v), greater<ll>());\\n\\tll n; cin >> n;\\n\\tif (n == 1) {\\n\\t\\tcout << -1 << \\\"\\\\n\\\"; return;\\n\\t}\\n\\tmap<ll, int> mp;\\n\\tmap<ll, int> nex;\\n\\tmp[n] = 0;\\n\\trep(i, v.size()) {\\n\\t\\tnex.clear();\\n\\t\\tnex = mp;\\n\\t\\tfor (LP p : mp) {\\n\\t\\t\\tif (p.first % v[i] == 0) {\\n\\t\\t\\t\\tll cop = p.first;\\n\\t\\t\\t\\tint cop2 = p.second;\\n\\t\\t\\t\\twhile (cop % v[i] == 0) {\\n\\t\\t\\t\\t\\tcop /= v[i]; cop2++;\\n\\t\\t\\t\\t\\tnex[cop] = max(nex[cop], cop2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmp = nex;\\n\\t}\\n\\tif (mp.find(1) == mp.end())cout << -1 << \\\"\\\\n\\\";\\n\\telse cout << mp[1] << \\\"\\\\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\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 13404,\n \"score_of_the_acc\": -0.2871,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2769_4936969\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define ALL(x) (x).begin(), (x).end()\\n#define HHH(x) cerr << \\\"L\\\" << __LINE__ << \\\": \\\" << #x << \\\" = \\\" << (x) << endl\\n\\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }\\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }\\n\\nusing ll = long long;\\nusing ld = long double;\\n\\nusing namespace std;\\n\\nconst int INF = 1e9;\\n\\nvector<ll> goods;\\n\\nmap<pair<ll,int>,int> memo;\\n\\nint dfs(ll n, int i) {\\n // cout << n << \\\" \\\" << i << endl;\\n if (n == 1) return 0;\\n if (i == -1) return -INF;\\n auto p = make_pair(n, i);\\n if (memo.count(p)) return memo[p];\\n int res = -INF;\\n if (n % goods[i] == 0) chmax(res, dfs(n / goods[i], i) + 1);\\n chmax(res, dfs(n, i - 1));\\n return memo[p] = res;\\n}\\n\\nint main() {\\n for (int n_digit = 1; n_digit <= 18; ++n_digit) {\\n REP(bit, 1 << n_digit) {\\n ll val = 0;\\n for (int i = 0; i < n_digit; ++i) {\\n if ((bit >> i) & 1) val = val * 10 + 8;\\n else val = val * 10 + 2;\\n }\\n goods.push_back(val);\\n }\\n }\\n ll n;\\n cin >> n;\\n vector<ll> new_goods;\\n for (ll x: goods) {\\n if (n % x == 0) new_goods.push_back(x);\\n }\\n goods = new_goods;\\n // REP(i,goods.size()) cout << goods[i] << endl;\\n int res = dfs(n, goods.size() - 1);\\n if (res <= 0) cout << -1 << endl;\\n else cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 9148,\n \"score_of_the_acc\": -0.0793,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2769_3999501\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\n\\nsigned main(){\\n ios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n cout << fixed << setprecision(20);\\n\\n ll n;\\n cin>>n;\\n vector<ll> v;\\n queue<ll> q;\\n q.push(0);\\n while(q.size()){\\n ll now=q.front();\\n if(now>n) break;\\n q.pop();\\n ll p=now*10 + 2;\\n if(n%p==0) v.push_back(p);\\n q.push(p);\\n p = now*10 + 8;\\n if(n%p==0) v.push_back(p);\\n q.push(p);\\n }\\n // cerr << v.size() << endl;\\n // for(auto i:v){\\n // cerr << i << endl;\\n // }\\n map<ll,ll> mp;\\n mp[n]=0;\\n mp[1] = -1;\\n for(int i=0;i<v.size();i++){\\n ll now=v[i];\\n for(auto j:mp){\\n ll a = j.first;\\n while(a%now == 0){\\n mp[a/now] = max(mp[a/now],mp[a]+1);\\n a/=now;\\n }\\n } \\n }\\n cout << mp[1] << endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7000,\n \"score_of_the_acc\": -0.0508,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2769_3720736\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing LL = long long;\\n\\nvector<LL> st;\\nint ans = -1;\\n\\nvoid dfs(LL N, int k, int use){\\n if(k >= st.size()) return;\\n LL now = st[k];\\n if(N == 1){\\n ans = max(ans, use);\\n return;\\n }\\n if(now > N) return;\\n if(N % now == 0){\\n dfs(N/now, k, use+1);\\n }\\n dfs(N, k+1, use);\\n}\\n\\nint main(){\\n LL N;\\n cin>>N;\\n if(N == 1){\\n cout << -1 << endl;\\n return 0;\\n }\\n set<LL> M;\\n for(int i=1;i<=18;i++)\\n {\\n for(int j=0;j<(1<<i);j++)\\n {\\n LL now=0;\\n for(int k=0;k<i;k++) now = now*10 + (j>>k&1 ? 8:2);\\n if(__builtin_popcountll(j) == i) continue;\\n M.insert(now);\\n }\\n }\\n for(auto &&i : M)if(N % i == 0) st.push_back(i);\\n dfs(N, 0, 0);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 27724,\n \"score_of_the_acc\": -0.7795,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2769_3720676\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\nlong N;\\nvector<long>A;\\nint dfs(long n,int i)\\n{\\n\\tif(i==A.size())\\n\\t{\\n\\t\\treturn n==1?0:-1;\\n\\t}\\n\\tint ans=dfs(n,i+1);\\n\\tint t=0;\\n\\twhile(n%A[i]==0)\\n\\t{\\n\\t\\tt++;n/=A[i];\\n\\t\\tint now=dfs(n,i+1);\\n\\t\\tif(now>=0)ans=max(ans,now+t);\\n\\t}\\n\\treturn ans;\\n}\\nmain()\\n{\\n cin>>N;\\n\\tif(N==1)\\n\\t{\\n\\t\\tcout<<-1<<endl;\\n\\t\\treturn 0;\\n\\t}\\n for(int i=1;i<=18;i++)\\n {\\n for(int j=0;j<1<<i;j++)\\n {\\n long now=0;\\n for(int k=0;k<i;k++)now=now*10+(j>>k&1?8:2);\\n\\t\\t\\tif(N%now==0)A.push_back(now);\\n\\t\\t}\\n\\t}\\n\\tcout<<dfs(N,0)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2769_3720671\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\nlong N;\\nvector<int>A;\\nint dfs(long n,int i)\\n{\\n\\tif(i==A.size())\\n\\t{\\n\\t\\treturn n==1?0:-1;\\n\\t}\\n\\tint ans=dfs(n,i+1);\\n\\tint t=0;\\n\\twhile(n%A[i]==0)\\n\\t{\\n\\t\\tt++;n/=A[i];\\n\\t\\tint now=dfs(n,i+1);\\n\\t\\tif(now>=0)ans=max(ans,now+t);\\n\\t}\\n\\treturn ans;\\n}\\nmain()\\n{\\n cin>>N;\\n\\tif(N==1)\\n\\t{\\n\\t\\tcout<<-1<<endl;\\n\\t\\treturn 0;\\n\\t}\\n for(int i=1;i<=18;i++)\\n {\\n for(int j=0;j<1<<i;j++)\\n {\\n long now=0;\\n for(int k=0;k<i;k++)now=now*10+(j>>k&1?8:2);\\n\\t\\t\\tif(N%now==0)A.push_back(now);\\n\\t\\t}\\n\\t}\\n\\tcout<<dfs(N,0)<<endl;\\n}\",\n \"accuracy\": 0.17307692307692307,\n \"time_ms\": 10,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": 0,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2769_3720361\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nlong N;\\nmain()\\n{\\n cin>>N;\\n if(N == 1){\\n cout << -1 << endl;\\n return 0;\\n }\\n set<long> M;\\n for(int i=1;i<=18;i++)\\n {\\n for(int j=0;j<1<<i;j++)\\n {\\n long now=0;\\n for(int k=0;k<i;k++)now=now*10+(j>>k&1?8:2);\\n if(__builtin_popcountll(j) == i) continue;\\n M.insert(now);\\n }\\n }\\n int ans = 0;\\n for(auto i=M.rbegin(); i!=M.rend(); i++){\\n long x = *i;\\n while(N > 1 && N%x == 0){\\n N /= x;\\n ans++;\\n // cout << x << endl;\\n }\\n }\\n if(N > 1) ans = -1;\\n // cout << N << endl;\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.1346153846153846,\n \"time_ms\": 140,\n \"memory_kb\": 27672,\n \"score_of_the_acc\": -0.7182,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2769_3583287\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define ALL(a) (a).begin(), (a).end()\\n#define llong long long\\n\\nusing namespace std;\\nmap<llong, llong> m;\\nvector<llong> l;\\n\\n\\nllong dfs(llong n){\\n\\n\\tif(n == 1)return 0;\\n\\tif(m.find(n) != m.end())return m[n];\\n\\tm[n] = -1;\\n\\tfor(auto e : l){\\n\\t\\tif(e > n)break;\\n\\t\\tif(n%e == 0){\\n\\t\\t\\tllong val = dfs(n/e);\\n\\t\\t\\tif(val < 0) continue;\\n\\t\\t\\tm[n] = max(m[n], 1+val);\\n\\t\\n\\t\\t}\\n\\t}\\n\\tif(m[n] == 0)return -1;\\n\\treturn m[n];\\n}\\n\\n/*\\nllong dfs(llong n){\\n\\tif(n == 1)return 0;\\n\\tif(m.find(n) != m.end())return m[n];\\n\\tllong ret = \\n\\tfor(auto e : l){\\n\\t\\tif(e > n)break;\\n\\t\\tif(n%e == 0)m[n] = max(m[n], 1+dfs(n/e));\\n\\t}\\n\\tif(m[n] == 0)return -1;\\n\\treturn m[n];\\n}\\n*/\\nsigned main(){\\n\\tllong n; cin >> n;\\n\\tfor(llong i = 1; i < 19; i++){\\n\\t\\tfor(llong j = 0; j < (1 << i); j++){\\n\\t\\t\\tllong tmp = 0;\\n\\t\\t\\tllong t = 1;\\n\\t\\t\\tfor(llong k = 0; k < i; k++){\\n\\t\\t\\t\\tif(j & (1 << k)){\\n\\t\\t\\t\\t\\ttmp += 8*t;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\ttmp += 2*t;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tt *= 10;\\n\\t\\t\\t}\\n\\t\\t\\tl.push_back(tmp);\\n\\t\\t}\\n\\t}\\n//\\tfor(int i = 0; i < 20; i++)cerr << l[i] << \\\" \\\";\\n//\\tcerr << endl;\\n\\tif(n == 1){\\n\\t\\tcout << -1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tm[1] = 0;\\n\\tcout << dfs(n) << endl;\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7076,\n \"score_of_the_acc\": -0.1428,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2769_3583159\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <vector>\\n#include <map>\\n\\nint inf = 1e9;\\n\\nstd::map<intmax_t, int> memo;\\n\\nint dfs(intmax_t n, const std::vector<intmax_t>& div) {\\n if (n == 1) return 0;\\n if (memo.find(n) != memo.end()) return memo.at(n);\\n int res = 0;\\n for (auto x: div) {\\n if (x > n) break;\\n if (n % x != 0) continue;\\n int cur = dfs(n / x, div) + 1;\\n res = std::max(cur, res);\\n }\\n if (res == 0) res = -1;\\n memo[n] = res;\\n return res;\\n}\\n\\nint main() {\\n intmax_t n;\\n scanf(\\\"%jd\\\", &n);\\n\\n if (n == 1)\\n return puts(\\\"-1\\\"), 0;\\n\\n std::vector<intmax_t> div{2, 8};\\n auto tmp = div;\\n intmax_t bound = 1e18;\\n while (true) {\\n bool updated = false;\\n std::vector<intmax_t> tmp0;\\n for (auto x: tmp) {\\n if (10*x > bound) continue;\\n tmp0.push_back(10*x+2);\\n tmp0.push_back(10*x+8);\\n div.push_back(10*x+2);\\n div.push_back(10*x+8);\\n updated = true;\\n }\\n tmp = std::move(tmp0);\\n if (!updated) break;\\n }\\n\\n int res = dfs(n, div);\\n if (!res) res = -1;\\n printf(\\\"%d\\\\n\\\", res);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 12524,\n \"score_of_the_acc\": -0.1542,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2769_3245142\",\n \"code_snippet\": \"#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nconst int inf = (1 << 30);\\nvector<long long> d;\\nint solve(int pos, long long cur) {\\n\\tif (pos == d.size()) return -inf;\\n\\tif (cur == 1) return 0;\\n\\tint ret = solve(pos + 1, cur);\\n\\tif (cur % d[pos] == 0) ret = max(ret, solve(pos, cur / d[pos]) + 1);\\n\\treturn ret;\\n}\\nint main() {\\n\\tlong long n;\\n\\tcin >> n;\\n\\tfor (int i = 1; i <= 18; ++i) {\\n\\t\\tfor (int j = 0; j < (1 << i) - 1; ++j) {\\n\\t\\t\\tlong long cur = 0;\\n\\t\\t\\tfor (int k = 0; k < i; ++k) {\\n\\t\\t\\t\\tcur = cur * 10 + (((j >> k) & 1) ? 8 : 2);\\n\\t\\t\\t}\\n\\t\\t\\tif (n % cur == 0) {\\n\\t\\t\\t\\td.push_back(cur);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = solve(0, n);\\n\\tcout << (ans >= 0 ? ans : -1) << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -0.0001,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2769_3245139\",\n \"code_snippet\": \"#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nconst int inf = (1 << 30);\\nvector<long long> d;\\nint solve(int pos, long long cur) {\\n\\tif (pos == d.size()) return -inf;\\n\\tif (cur == 1) return 0;\\n\\tint ret = solve(pos + 1, cur);\\n\\tif (cur % d[pos] == 0) ret = max(ret, solve(pos, cur / d[pos]) + 1);\\n\\treturn ret;\\n}\\nint main() {\\n\\tlong long n;\\n\\tcin >> n;\\n\\tfor (int i = 1; i <= 18; ++i) {\\n\\t\\tfor (int j = 0; j < (1 << i) - 1; ++j) {\\n\\t\\t\\tlong long cur = 0;\\n\\t\\t\\tfor (int k = 0; k < i; ++k) {\\n\\t\\t\\t\\tcur = cur * 10 + (((j >> k) & 1) ? 8 : 2);\\n\\t\\t\\t}\\n\\t\\t\\tif (n % cur == 0) {\\n\\t\\t\\t\\td.push_back(cur);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = solve(0, n);\\n\\tcout << (ans != -inf ? ans : -1) << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.057692307692307696,\n \"time_ms\": 10,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -0.0001,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2769_3109831\",\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_popcount\\n\\n#define INF 1e16\\n#define mod 1000000007\\nll n;\\nvector<ll> vs;\\nmap<ll,ll> dp[2];\\n\\nint main(){\\n\\n repl(i,1,19){\\n rep(S,1<<i){\\n string tmp;\\n rep(d,i){\\n if((S>>d)&1)tmp+=\\\"8\\\";\\n else tmp+=\\\"2\\\";\\n }\\n vs.push_back(stoll(tmp));\\n }\\n }\\n reverse(all(vs));\\n cin>>n;\\n if(n==1){\\n cout<<-1<<endl;\\n return 0;\\n }\\n ll m=vs.size();\\n\\n int crt=0,nxt=1;\\n dp[crt][n]=0;\\n rep(i,m){\\n ll v=vs[i];\\n dp[nxt].clear();\\n for(auto it : dp[crt]){\\n if(it.fi%v==0){\\n ll tmp=it.fi,cnt=1;\\n while(tmp%v==0){\\n maxch(dp[nxt][tmp/v],it.se+cnt);\\n tmp/=v;\\n cnt++;\\n }\\n }\\n maxch(dp[nxt][it.fi],it.se);\\n }\\n swap(crt,nxt);\\n }\\n if(dp[crt].find(1)==dp[crt].end())cout<<-1<<endl;\\n else cout<<dp[crt][1]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 6948,\n \"score_of_the_acc\": -0.6259,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2769_3107927\",\n \"code_snippet\": \"#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\\nll make(int d, int mask){\\n string s = \\\"\\\";\\n rep(i,d){\\n if(mask>>i&1) s += '8';\\n else s += '2';\\n }\\n return atoll(s.c_str());\\n}\\n\\nconst int INF = 19191919;\\nvector<ll> v;\\nint V;\\n\\nconst int N = 1<<10;\\nmap<ll,int> dp[N];\\nint dfs(int d, ll n){\\n if(d==V){\\n if(n==1) return 0;\\n return -INF;\\n }\\n if(dp[d].count(n)) return dp[d][n];\\n\\n int ret = -INF;\\n if(n%v[d]==0) ret = max(ret, dfs(d, n/v[d])+1);\\n ret = max(ret, dfs(d+1, n));\\n\\n return dp[d][n] = ret;\\n}\\n\\nint main(){\\n ll n;\\n cin >>n;\\n if(n==1){\\n cout << -1 << endl;\\n return 0;\\n }\\n\\n for(int i=1; i<=9; ++i){\\n rep(mask,1<<i) v.pb(make(i,mask));\\n }\\n V = v.size();\\n\\n int ans = -1;\\n\\n ans = max(ans, dfs(0,n));\\n for(int i=10; i<=18; ++i){\\n rep(mask,1<<i){\\n ll val = make(i,mask);\\n if(n%val==0){\\n ans = max(ans, dfs(0, n/val)+1);\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 78760,\n \"score_of_the_acc\": -2,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2769_3107477\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define pb push_back\\n#define all(x) begin(x),end(x)\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#ifdef LOCAL\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cerr<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n#else\\n#define dbg(...) {}\\n#endif\\n\\n#define long long long // for codeforces\\n\\nvector<long> goods = {2,8};\\nmap<long,int> memo;\\n\\nint dfs(long val){\\n if (memo.count(val)) return memo[val];\\n int ans = -1;\\n for(auto v : goods){\\n if(v > val) break;\\n if(v == val) {\\n ans = max(ans, 1);\\n }\\n if(val%v==0){\\n int r = dfs(val/v);\\n if(r > 0) ans = max(ans, r + 1);\\n }\\n }\\n return memo[val] = ans;\\n}\\n\\nbool isgood(long x){\\n while(x>0){\\n if(x%10 !=2 && x%10 != 8) return false;\\n x /= 10;\\n }\\n return true;\\n}\\n\\nint main(){\\n rep(_,9){\\n int s = goods.size();\\n rep(i,s) if (goods[i] * 10 <= 1000000000){\\n goods.pb(goods[i]*10 + 2);\\n goods.pb(goods[i]*10 + 8);\\n }\\n }\\n\\n long v;\\n cin>>v;\\n\\n int ans = dfs(v);\\n if(isgood(v)) ans = max(ans, 1);\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3348,\n \"score_of_the_acc\": -0.3056,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2769_3107475\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define pb push_back\\n#define all(x) begin(x),end(x)\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#ifdef LOCAL\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cerr<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n#else\\n#define dbg(...) {}\\n#endif\\n\\n#define long long long // for codeforces\\n\\nvector<long> goods = {2,8};\\nmap<long,int> memo;\\n\\nint dfs(long val){\\n if (memo.count(val)) return memo[val];\\n int ans = -1;\\n for(auto v : goods){\\n if(v > val) break;\\n if(v == val) {\\n ans = max(ans, 1);\\n }\\n if(val%v==0){\\n int r = dfs(val/v);\\n if(r > 0) ans = max(ans, r + 1);\\n }\\n }\\n return memo[val] = ans;\\n}\\n\\nint main(){\\n rep(_,9){\\n int s = goods.size();\\n rep(i,s) if (goods[i] * 10 <= 1000000000){\\n goods.pb(goods[i]*10 + 2);\\n goods.pb(goods[i]*10 + 8);\\n }\\n }\\n\\n long v;\\n cin>>v;\\n\\n cout << dfs(v) << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.17307692307692307,\n \"time_ms\": 70,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.1843,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1661,"cells":{"group_id":{"kind":"string","value":"aoj_2773_cpp"},"problem_description":{"kind":"string","value":"B: 周期数列 - Periodic Sequence -\n問題\nH大学の教授を務めているPeriod博士は、万物に潜むとされる周期と呼ばれる性質を研究している。一般的に知られている基本的な周期としては、数列に潜む周期が考えられるだろう。すなわち、長さ\nN\nの数列\nS = S_1, S_2,\n...\n, S_N\nが以下の性質を満たすならば、周期\nt\n(\nt \\≤ N\n) を持つという事実である。\n1 \\≤ i \\≤ N − t\nについて、\nS_i=S_{i+t}\nである。\n今、Period博士が着目しているのは、周期を用いてより簡易な記述ができる数列である。例えば、長さ\nN\nの数列が周期\nt\n(\n\\≤ N\n) を持つとき、ある整数\nk\nを用いて\nN=kt\nと書けるならば、その数列は長さ\nt\nの数列\nS_1,\n...\n, S_t\nが\nk\n個連続したものである、と記述できる。Period博士は数列を例のように記述できたとき、その数列は\nk\n-partであると言うことにした。\nPeriod博士は、\nk\nが最も大きい\nk\n-partに興味を示している。そこで助手であるあなたは、入力として数列を受け取り、それが\nk\n-partであるとき最も大きい\nk\nを出力するプログラムの作成を任されることとなった。Period博士の要求に正確に応えるプログラムを作成しよう。\n入力形式\nN\nS_1\n...\nS_N\n1行目には、数列の長さを表す整数\nN\nが与えられる。2行目には、長さ\nN\nの数列の各要素を表す整数\nS_i\n(\n1 \\≤ i \\≤ N\n) が空白区切りで与えられる。また、入力は\n1 \\≤ N \\≤ 200,000\nと\n1 \\≤ S_i \\≤ 100,000\n(\n1 \\≤ i \\≤ N\n) を満たす。\n出力形式\n与えられた数列に対して、\nk\n-partであるときの\nk\nの最大値を1行に出力せよ。\n入力例1\n6\n1 2 3 1 2 3\n出力例1\n2\n入力例2\n12\n1 2 1 2 1 2 1 2 1 2 1 2\n出力例2\n6\n入力例3\n6\n1 2 3 4 5 6\n出力例3\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2773_10865813","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst ll LINF = 1e18;\nconst int INF = 1e9;\n#define FOR(i,s,t) for(int i =s; i < t;i++)\n#define SZ(a) (int)a.size()\n#define ALL(a) a.begin(),a.end()\n\nvoid solve() {\n\tll N; cin >> N;\n\tvector<ll> S(N);\n\tfor (auto& in : S) cin >> in;\n\n\tll res = 1;\n\tfor (ll t = 1; t <= N; t++) {\n\t\tif (N%t != 0) continue;\n\t\tbool f = false;\n\t\tfor (ll i = 0; i < N - t; i++) {\n\t\t\tif (S[i] == S[i + t]) continue;\n\t\t\tf = true;\n\t\t\tbreak;\n\t\t}\n\t\tif (f) continue;\n\t\tres = N / t;\n\t\tbreak;\n\t}\n\tcout << res << endl;\n}\n\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\n\tsolve();\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4648,"score_of_the_acc":-0.0903,"final_rank":7},{"submission_id":"aoj_2773_10283845","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;\n cin >> n;\n vector<ll> s(n);\n rep(i, 0, n)\n {\n cin >> s[i];\n }\n vector<bool> f(n + 1, true);\n rep(i, 2, n + 1)\n {\n if (!f[i])\n {\n continue;\n }\n if (n % i != 0)\n {\n for (ll j = i; j <= n; j += i)\n {\n f[j] = false;\n }\n }\n else\n {\n ll t = n / i;\n bool g = true;\n rep(j, 0, n - t)\n {\n if (s[j] != s[j + t])\n {\n g = false;\n }\n }\n if (!g)\n {\n for (ll j = i; j <= n; j += i)\n {\n f[j] = false;\n }\n }\n }\n }\n ll ans = 1;\n rep(i, 1, n + 1)\n {\n if (f[i])\n {\n ans = i;\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4992,"score_of_the_acc":-0.1208,"final_rank":10},{"submission_id":"aoj_2773_6939952","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=2167167167167167167;\nconst int INF=2100000000;\nconst ll mod=1e9+7;\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\";}\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\n\n\nnamespace po167{\n//LCP vec[0,n) and vec[i,n)\n//for all i \n//O(vec.size())\ntemplate<class T>\nstd::vector<int> Z_algo(std::vector<T> &vec){\n\tint n=vec.size();\n\tint ind=1,j=0,k;\n\tstd::vector<int> ans(n,0);\n\tans[0]=n;\n\twhile(ind<n){\n\t\twhile(ind+j<n&&vec[j]==vec[ind+j]) j++;\n\t\tans[ind]=j;\n\t\tif(j==0){\n\t\t\tind++;\n\t\t\tcontinue;\n\t\t}\n\t\tk=1;\n\t\twhile(k+ind<n&&ans[k]+k<j){\n\t\t\tans[k+ind]=ans[k];\n\t\t\tk++;\n\t\t}\n\t\tj-=k;\n\t\tind+=k;\n\t}\n\treturn ans;\n}\nstd::vector<int> Z_algo(std::string &vec){\n\tint n=vec.size();\n\tint ind=1,j=0,k;\n\tstd::vector<int> ans(n,0);\n\tans[0]=n;\n\twhile(ind<n){\n\t\twhile(ind+j<n&&vec[j]==vec[ind+j]) j++;\n\t\tans[ind]=j;\n\t\tif(j==0){\n\t\t\tind++;\n\t\t\tcontinue;\n\t\t}\n\t\tk=1;\n\t\twhile(k+ind<n&&ans[k]+k<j){\n\t\t\tans[k+ind]=ans[k];\n\t\t\tk++;\n\t\t}\n\t\tj-=k;\n\t\tind+=k;\n\t}\n\treturn ans;\n}\n}\nusing po167::Z_algo;\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;\n\tcin>>N;\n\tvector<int> S(N);\n\trep(i,N) cin>>S[i];\n\tauto Z=Z_algo(S);\n\trep(i,N){\n\t\tif(i==0) continue;\n\t\tif(__gcd(i,N)!=i) continue;\n\t\tif(Z[i]==N-i){\n\t\t\tcout<<N/i<<\"\\n\";\n\t\t\treturn;\n\t\t}\n\t}\n\tcout<<\"1\\n\";\n}","accuracy":1,"time_ms":20,"memory_kb":4644,"score_of_the_acc":-0.1044,"final_rank":9},{"submission_id":"aoj_2773_5850720","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< 998244353 >;\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 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\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\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 static const int base1 = 1007, base2 = 2009;\n static const int mod1 = 1000000007, mod2 = 1000000009;\n vector<long long> hash1, hash2, power1, power2;\n int n;\n // construct\n RollingHash(const string &S) {\n n = (int)S.size();\n hash1.assign(n+1, 0);\n hash2.assign(n+1, 0);\n power1.assign(n+1, 1);\n power2.assign(n+1, 1);\n for (int i = 0; i < n; ++i) {\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\n hash2[i+1] = (hash2[i] * base2 + S[i]) % mod2;\n power1[i+1] = (power1[i] * base1) % mod1;\n power2[i+1] = (power2[i] * base2) % mod2;\n }\n }\n \n // get hash of S[left:right]\n inline pair<long long, long long> get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\n if (res1 < 0) res1 += mod1;\n long long res2 = hash2[r] - hash2[l] * power2[r-l] % mod2;\n if (res2 < 0) res2 += mod2;\n return {res1, res2};\n }\n \n inline pair<long long, long long> c_shift(int l) {\n auto h1 = get(0, l);\n auto h2 = get(l, n);\n return {(h1.first + h2.first * power1[l]) % mod1, (h1.second + h2.second * power2[l]) % mod2};\n }\n \n // get lcp of S[a:] and T[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n};\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n int n; cin >> n;\n vector<int> s(n);\n REP(i,n) cin >> s[i];\n\n int ans = 1;\n for(int i=1; i*i<=n; i++) {\n if(n%i == 0) {\n int a = i, b = n/i;\n bool f = true;\n for(int j=a; j<n; j++) {\n if(s[j] != s[j-a]) f = false;\n }\n if(f) ans = max(ans, b);\n f = true;\n for(int j=b; j<n; j++) {\n if(s[j] != s[j-b]) f = false;\n \n }\n if(f) ans = max(ans, a);\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3876,"score_of_the_acc":-0.0217,"final_rank":4},{"submission_id":"aoj_2773_5850717","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< 998244353 >;\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 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\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\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 static const int base1 = 1007, base2 = 2009;\n static const int mod1 = 1000000007, mod2 = 1000000009;\n vector<long long> hash1, hash2, power1, power2;\n int n;\n // construct\n RollingHash(const string &S) {\n n = (int)S.size();\n hash1.assign(n+1, 0);\n hash2.assign(n+1, 0);\n power1.assign(n+1, 1);\n power2.assign(n+1, 1);\n for (int i = 0; i < n; ++i) {\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\n hash2[i+1] = (hash2[i] * base2 + S[i]) % mod2;\n power1[i+1] = (power1[i] * base1) % mod1;\n power2[i+1] = (power2[i] * base2) % mod2;\n }\n }\n \n // get hash of S[left:right]\n inline pair<long long, long long> get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\n if (res1 < 0) res1 += mod1;\n long long res2 = hash2[r] - hash2[l] * power2[r-l] % mod2;\n if (res2 < 0) res2 += mod2;\n return {res1, res2};\n }\n \n inline pair<long long, long long> c_shift(int l) {\n auto h1 = get(0, l);\n auto h2 = get(l, n);\n return {(h1.first + h2.first * power1[l]) % mod1, (h1.second + h2.second * power2[l]) % mod2};\n }\n \n // get lcp of S[a:] and T[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\n int low = 0, high = len;\n while (high - low > 1) {\n int mid = (low + high) >> 1;\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\n else low = mid;\n }\n return low;\n }\n};\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n int n; cin >> n;\n vector<int> s(n);\n REP(i,n) cin >> s[i];\n\n int ans = 1;\n for(int i=2; i*i<=n; i++) {\n if(n%i == 0) {\n int a = i, b = n/i;\n bool f = true;\n for(int j=a; j<n; j++) {\n if(s[j] != s[j-a]) f = false;\n }\n if(f) ans = max(ans, b);\n f = true;\n for(int j=b; j<n; j++) {\n if(s[j] != s[j-b]) f = false;\n \n }\n if(f) ans = max(ans, a);\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":0.5,"time_ms":10,"memory_kb":3880,"score_of_the_acc":-0.022,"final_rank":18},{"submission_id":"aoj_2773_5850154","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n//イテレーション\n#define REP(i, n) for (ll i = 0; i < ll(n); i++)\n#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)\n#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)\n#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)\n#define FORA(i, I) for (const auto& i : I)\n// x:コンテナ\n#define ALL(x) x.begin(), x.end()\n#define SIZE(x) ll(x.size())\n//定数\n#define INF32 2147483647 // 2.147483647×10^{9}:32bit整数のinf\n#define INF64 9223372036854775807 // 9.223372036854775807×10^{18}:64bit整数のinf\n#define MOD 1000000007 //問題による\n//略記\n#define F first\n#define S second\n//出力(空白区切りで昇順に)\n#define coutALL(x) \\\n for (auto i = x.begin(); i != --x.end(); i++) cout << *i << \" \"; \\\n cout << *--x.end() << endl;\n\n// aをbで割る時の繰上げ,繰り下げ\nll myceil(ll a, ll b) { return (a + (b - 1)) / b; }\nll myfloor(ll a, ll b) { return a / b; }\n\nint main() {\n //小数の桁数の出力指定\n // cout<<fixed<<setprecision(10);\n //入力の高速化用のコード\n // ios::sync_with_stdio(false);\n // cin.tie(nullptr);\n ll N;\n cin >> N;\n vector<ll> ss;\n REP(i, N) {\n ll t;\n cin >> t;\n ss.push_back(t);\n }\n\n ll bk = 1;\n FOR(i, 1, N-1) {\n if(N % i != 0) continue;\n ll k = N / i;\n\n bool f = true;\n FOR(j, 0, i - 1) {\n for(ll n = 1; n < k; n++) {\n //cout << k << \" \" << i << \" \" << j << \" \" << n << \" \" << ss[j] << \" \" << ss[n*i+j] << endl;\n if(ss[j] != ss[n*i+j]) {\n f = false;\n break;\n }\n }\n if(!f) break;\n }\n if(f) {\n bk = k;\n break;\n }\n }\n cout << bk << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5180,"score_of_the_acc":-0.1665,"final_rank":13},{"submission_id":"aoj_2773_5534217","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#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}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n; cin >> n;\n vector<int> s(n);\n for(int i=0;i<n;i++){\n cin >> s[i];\n }\n int res=1;\n for(int i=1;i<=n;i++){\n if(n%i==0){\n bool ok=true;\n for(int j=i;j<n;j++){\n if(s[j]!=s[j%i]){\n ok=false; break;\n }\n }\n if(ok){\n res=max(res,n/i);\n }\n }\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3900,"score_of_the_acc":-0.0383,"final_rank":5},{"submission_id":"aoj_2773_5532377","code_snippet":"#line 2 \"cpplib/util/template.hpp\"\n/**\n * These codes are licensed under CC0.\n * http://creativecommons.org/publicdomain/zero/1.0/deed.ja\n */\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"avx2\")\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>using V=vector<T>;\ntemplate<typename T>using VV=V<V<T>>;\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 debug(T t){bool f=0;for(auto i:t){cerr<<(f?\" \":\"\")<<i;f=1;}cerr<<endl;}\ntemplate<typename T>inline void debug2(T t){for(auto i:t)debug(i);}\n#define loop(n) for(long long _=0;_<(long long)(n);++_)\n#define _overload4(_1,_2,_3,_4,name,...) name\n#define __rep(i,a) repi(i,0,a,1)\n#define _rep(i,a,b) repi(i,a,b,1)\n#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)\n#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)\n#define _overload3_rev(_1,_2,_3,name,...) name\n#define _rep_rev(i,a) repi_rev(i,0,a)\n#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)\n#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)\n\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)\n// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\n// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\n// inline 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;}\n// template<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)\n#if __cplusplus>=201703L\n template<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#endif\n#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))\n#define bit(n,a) ((n>>a)&1)\nvector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}\nusing graph=vector<vector<int>>;\ntemplate<typename T>using graph_w=vector<vector<pair<int,T>>>;\ntemplate<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<\"(\"<<v.first<<\",\"<<v.second<<\")\";return out;}\n#if __cplusplus>=201703L\n constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}\n#endif\n\ntemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}\ntemplate<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}\ntemplate<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}\ntemplate<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}\n#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile(\"mov %%rsp, %%rbx\\nmov %%rax, %%rsp\":\"=b\"(stack_extend_origin_memory_):\"a\"((char*)stack_extend_memory_+(size)-1024));\n#define END_STACK_EXTEND asm volatile(\"mov %%rax, %%rsp\"::\"a\"(stack_extend_origin_memory_));free(stack_extend_memory_);\n#line 2 \"code.cpp\"\n\nstd::vector<int> z_algorithm(const vec& s){\n std::vector<int>res(s.size());\n res[0]=s.size();\n int i=1,j=0;\n while(i<(int)s.size()){\n while(i+j<(int)s.size()&&s[j]==s[i+j])++j;\n res[i]=j;\n if(j==0){++i;continue;}\n int k=1;\n while(i+k<(int)s.size()&&k+res[k]<j)res[i+k]=res[k],++k;\n i+=k;j-=k;\n }\n return res;\n}\n\nint main(){\n lint n;\n cin>>n;\n vec a(n);\n rep(i,n)cin>>a[i];\n auto d=z_algorithm(a);\n rep(i,1,n){\n if(n%i==0&&d[i]==n-i){\n cout<<n/i<<endl;\n return 0;\n }\n }\n cout<<1<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":5428,"score_of_the_acc":-0.1596,"final_rank":12},{"submission_id":"aoj_2773_5532372","code_snippet":"#line 1 \"b.cpp\"\n#pragma region Macros\n#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#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__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()\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(i, n) FOR(i, 0, n)\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\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\n#pragma endregion Macros\n\n#line 1 \"/home/siro53/kyo-pro/compro_library/math/divisor.hpp\"\ntemplate<class T>\nvector<T> divisor(T n) {\n vector<T> ret;\n for(T i = 1; i * i <= n; i++) {\n if(n % i == 0) {\n ret.push_back(i);\n if(i * i != n)\n ret.push_back(n / i);\n }\n }\n sort(begin(ret), end(ret));\n return (ret);\n}\n#line 70 \"b.cpp\"\n\nint main() {\n int N;\n cin >> N;\n vector<int> a(N);\n REP(i, N) cin >> a[i];\n\n auto v = divisor(N);\n int ans = -INF;\n\n for(int len : v) {\n vector<vector<int>> v(N/len);\n for(int i = 0; i < N; i += len) {\n REP(j, len) v[i/len].push_back(a[i + j]);\n }\n debug(len, v);\n bool ok = true;\n FOR(i, 1, N/len) if(v[i-1] != v[i]) ok = false;\n if(ok) chmax(ans, N/len);\n }\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":14888,"score_of_the_acc":-1.058,"final_rank":14},{"submission_id":"aoj_2773_4926994","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n#define rep(i,n) for(ll i=0;i<n;i++)\n\nvector<long long> divisor(long long n){\n vector<long long> r;\n for(long long i=1;i*i<=n;i++){\n if(n%i==0){\n r.emplace_back(i);\n if(i*i!=n)r.emplace_back(n/i);\n }\n }\n sort(r.begin(),r.end());\n return r;\n}\n\nsigned main(){\n ll n;\n cin>>n;\n vector<ll> S(n);\n rep(i,n)cin>>S[i];\n auto v=divisor(n);\n for(auto a:v){\n if(a>n-1)break;\n rep(i,n-a){\n if(S[i]!=S[i+a]){\n break;\n }\n if(i==n-a-1){\n cout<<n/a<<endl;\n return 0;\n }\n }\n }\n cout<<1<<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":4692,"score_of_the_acc":-0.1232,"final_rank":11},{"submission_id":"aoj_2773_4926942","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n#define rep(i,n) for(ll i=0;i<n;i++)\n\nvector<long long> divisor(long long n){\n vector<long long> r;\n for(long long i=1;i*i<=n;i++){\n if(n%i==0){\n r.emplace_back(i);\n if(i*i!=n)r.emplace_back(n/i);\n }\n }\n sort(r.begin(),r.end());\n return r;\n}\n\nsigned main(){\n ll n;\n cin>>n;\n vector<ll> S(n);\n rep(i,n)cin>>S[i];\n auto v=divisor(n);\n ll t=n;\n for(auto a:v){\n if(a>n-1)break;\n if(S[0]==S[a]){\n t=a;\n break;\n }\n }\n cout<<n/t<<endl;\n}","accuracy":0.72,"time_ms":30,"memory_kb":4700,"score_of_the_acc":-0.1239,"final_rank":17},{"submission_id":"aoj_2773_4926911","code_snippet":"#include <bits/stdc++.h>\ntypedef long long int lli;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define out(s) cout << s << endl;\nusing namespace std;\nint main()\n{\n string s = \"\";\n lli n;\n cin >> n;\n vector<lli> yaku;\n lli p = 2;\n while(p<=n/2){\n if(n%p==0){\n yaku.push_back(p);\n }\n p++;\n }\n rep(i, n)\n {\n string a;\n cin >> a;\n s = s + a;\n }\n lli k = 1;\n lli div = 0;\n while (true)\n {\n\n if (s.size() % yaku[div] == 0)\n {\n string sub = s.substr(0, s.size() / yaku[div]);\n bool check = true;\n rep(j, s.size() /sub.size() - 1)\n {\n if (sub != s.substr((sub.size()) * (j + 1), s.size()/yaku[div]))\n {\n check = false;\n break;\n }\n }\n\n if (check)\n {\n k = k * yaku[div];\n div = 0;\n s = sub;\n continue;\n }\n }\n div++;\n if (div >=yaku.size())\n {\n break;\n }\n }\n cout << k << endl;\n}","accuracy":0.04,"time_ms":670,"memory_kb":4020,"score_of_the_acc":-0.991,"final_rank":19},{"submission_id":"aoj_2773_4926867","code_snippet":"#include <bits/stdc++.h>\ntypedef long long int lli;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define out(s) cout << s << endl;\nusing namespace std;\nint main()\n{\n string s = \"\";\n lli n;\n cin >> n;\n vector<lli> yaku;\n lli p = 2;\n while(p*p<=n){\n if(n%p==0){\n yaku.push_back(p);\n }\n p++;\n }\n rep(i, n)\n {\n string a;\n cin >> a;\n s = s + a;\n }\n lli k = 1;\n lli div = 0;\n while (true)\n {\n if (s.size() % yaku[div] == 0)\n {\n string sub = s.substr(0, s.size() / yaku[div]);\n bool check = true;\n rep(j, s.size() /sub.size() - 1)\n {\n if (sub != s.substr((sub.size()) * (j + 1), s.size()/yaku[div]))\n {\n check = false;\n break;\n }\n }\n\n if (check)\n {\n k = k * yaku[div];\n div = 0;\n s = sub;\n continue;\n }\n }\n div++;\n if (div >=yaku.size())\n {\n break;\n }\n }\n cout << k << endl;\n}","accuracy":0.04,"time_ms":700,"memory_kb":3984,"score_of_the_acc":-1.0313,"final_rank":20},{"submission_id":"aoj_2773_4926782","code_snippet":"#include <bits/stdc++.h>\n\nusing i64=std::int_fast64_t;\nusing u64=std::uint_fast64_t;\n\n#define rep(i,a,b) for(i64 i=(a);(i) < (b);(i)++)\n#define all(i) i.begin(),i.end()\n\nint main(){\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n i64 n;\n std::cin>>n;\n\n std::vector<i64> s(n);\n for(auto&& e:s)std::cin>>e;\n\n std::vector<i64> yaku;\n\n for(i64 i=1;i*i<=n;i++){\n if(n%i==0){\n yaku.emplace_back(i);\n if(i*i!=n)yaku.emplace_back(n/i);\n }\n }\n\n std::sort(all(yaku),std::greater<i64>());\n\n for(const auto& e:yaku){\n i64 len = n/e;\n bool isok=true;\n rep(i,0,len){\n rep(j,0,e)isok&=(s[i] == s[i+len*j]);\n }\n if(isok){\n std::cout<<e<<\"\\n\";\n return 0;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4672,"score_of_the_acc":-0.0924,"final_rank":8},{"submission_id":"aoj_2773_4926653","code_snippet":"#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\n#define SIZE 200000\n\nint main() {\n int N, S[SIZE];\n\n scanf(\"%d\", &N);\n\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", S + i);\n }\n\n int ans = 1;\n\n for (int i = 1; i <= N; i++) {\n if (N % i != 0) continue;\n\n bool ok = true;\n\n for (int j = 0; j + i < N; j++) {\n ok &= S[j] == S[i + j];\n }\n\n if (ok) {\n ans = max(ans, N / i);\n }\n }\n\n printf(\"%d\\n\", ans);\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3788,"score_of_the_acc":-0.0139,"final_rank":1},{"submission_id":"aoj_2773_4472189","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -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; }\n// ---------------------------------------------------------------------------\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N;\n cin >> N;\n vector<int> A(N);\n for(int i=0; i<N; i++) cin >> A[i];\n for(int i=1; i<=N; i++){\n if(N%i == 0){\n bool can = true;\n for(int j=0; i+j<N; j++){\n if(A[j] != A[i+j]){\n can = false;\n break;\n }\n }\n if(can){\n cout << N/i << enld;\n return 0;\n }\n }\n }\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3632,"score_of_the_acc":-0.0145,"final_rank":2},{"submission_id":"aoj_2773_4471516","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -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; }\n// ---------------------------------------------------------------------------\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N;\n cin >> N;\n vector<int> A(N+1);\n for(int i=1; i<=N; i++){\n cin >> A[i];\n }\n int ans = inf;\n for(int i=1; i<=N; i++){\n if(N%i == 0){\n bool can = true;\n for(int j=1; j<=i; j++){\n int now = A[j];\n for(int k=j; k<=N; k+=i){\n if(now != A[k]){\n can = false;\n break;\n }\n }\n if(!can) break;\n }\n if(can){\n chmin(ans,i);\n }\n }\n }\n cout << N/ans << enld;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3636,"score_of_the_acc":-0.0148,"final_rank":3},{"submission_id":"aoj_2773_4471488","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 int ans;\n for(int k=n; k>=1; k--){\n if(n%k != 0) continue;\n int t = n/k;\n bool ok = true;\n for(int i=0; i<n; i++){\n if(a[i] != a[i%t]){\n ok = false;\n break;\n }\n }\n if(ok){\n ans = k;\n break;\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3636,"score_of_the_acc":-0.0728,"final_rank":6},{"submission_id":"aoj_2773_4471429","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -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; }\n// ---------------------------------------------------------------------------\n\nvector<int> KMP(vector<int> S){\n int l = S.size();\n vector<int> A(l+1);\n A[0] = -1;\n int j = -1;\n for(int i=0; i<l; i++){\n while(j >= 0 and S[i] != S[j]) j = A[j];\n j++;\n if(i<l and S[i+1] == S[j]) A[i+1] = A[j];\n else A[i+1] = j;\n }\n return A;\n}\n\nint gcd(int a,int b){\n if(b == 0) return a;\n return gcd(b,a%b);\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N;\n cin >> N;\n vector<int> S(N);\n for(int i=0; i<N; i++) cin >> S[i];\n vector<int> A = KMP(S);\n int temp = N/(N-A[N]);\n cout << gcd(N,temp) << enld; \n return 0;\n}","accuracy":0.88,"time_ms":10,"memory_kb":5272,"score_of_the_acc":-0.1457,"final_rank":15},{"submission_id":"aoj_2773_4471410","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -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; }\n// ---------------------------------------------------------------------------\n\nvector<int> KMP(vector<int> S){\n int l = S.size();\n vector<int> A(l+1);\n A[0] = -1;\n int j = -1;\n for(int i=0; i<l; i++){\n while(j >= 0 and S[i] != S[j]) j = A[j];\n j++;\n if(i<l and S[i+1] == S[j]) A[i+1] = A[j];\n else A[i+1] = j;\n }\n return A;\n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N;\n cin >> N;\n vector<int> S(N);\n for(int i=0; i<N; i++) cin >> S[i];\n vector<int> A = KMP(S);\n cout << N/(N-A[N]) << enld; \n return 0;\n}","accuracy":0.8,"time_ms":10,"memory_kb":5252,"score_of_the_acc":-0.1439,"final_rank":16}],"string":"[\n {\n \"submission_id\": \"aoj_2773_10865813\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing LL = long long; using ll = LL;\\nusing PII = pair<int, int>; using pii = PII;\\nusing PLL = pair<LL, LL>; using pll = PLL;\\nusing VI = vector<int>; using VL = vector<LL>;\\nconst ll LINF = 1e18;\\nconst int INF = 1e9;\\n#define FOR(i,s,t) for(int i =s; i < t;i++)\\n#define SZ(a) (int)a.size()\\n#define ALL(a) a.begin(),a.end()\\n\\nvoid solve() {\\n\\tll N; cin >> N;\\n\\tvector<ll> S(N);\\n\\tfor (auto& in : S) cin >> in;\\n\\n\\tll res = 1;\\n\\tfor (ll t = 1; t <= N; t++) {\\n\\t\\tif (N%t != 0) continue;\\n\\t\\tbool f = false;\\n\\t\\tfor (ll i = 0; i < N - t; i++) {\\n\\t\\t\\tif (S[i] == S[i + t]) continue;\\n\\t\\t\\tf = true;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tif (f) continue;\\n\\t\\tres = N / t;\\n\\t\\tbreak;\\n\\t}\\n\\tcout << res << endl;\\n}\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(false);\\n\\n\\tsolve();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4648,\n \"score_of_the_acc\": -0.0903,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2773_10283845\",\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;\\n cin >> n;\\n vector<ll> s(n);\\n rep(i, 0, n)\\n {\\n cin >> s[i];\\n }\\n vector<bool> f(n + 1, true);\\n rep(i, 2, n + 1)\\n {\\n if (!f[i])\\n {\\n continue;\\n }\\n if (n % i != 0)\\n {\\n for (ll j = i; j <= n; j += i)\\n {\\n f[j] = false;\\n }\\n }\\n else\\n {\\n ll t = n / i;\\n bool g = true;\\n rep(j, 0, n - t)\\n {\\n if (s[j] != s[j + t])\\n {\\n g = false;\\n }\\n }\\n if (!g)\\n {\\n for (ll j = i; j <= n; j += i)\\n {\\n f[j] = false;\\n }\\n }\\n }\\n }\\n ll ans = 1;\\n rep(i, 1, n + 1)\\n {\\n if (f[i])\\n {\\n ans = i;\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4992,\n \"score_of_the_acc\": -0.1208,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2773_6939952\",\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=2167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=1e9+7;\\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\\\";}\\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\n\\n\\nnamespace po167{\\n//LCP vec[0,n) and vec[i,n)\\n//for all i \\n//O(vec.size())\\ntemplate<class T>\\nstd::vector<int> Z_algo(std::vector<T> &vec){\\n\\tint n=vec.size();\\n\\tint ind=1,j=0,k;\\n\\tstd::vector<int> ans(n,0);\\n\\tans[0]=n;\\n\\twhile(ind<n){\\n\\t\\twhile(ind+j<n&&vec[j]==vec[ind+j]) j++;\\n\\t\\tans[ind]=j;\\n\\t\\tif(j==0){\\n\\t\\t\\tind++;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tk=1;\\n\\t\\twhile(k+ind<n&&ans[k]+k<j){\\n\\t\\t\\tans[k+ind]=ans[k];\\n\\t\\t\\tk++;\\n\\t\\t}\\n\\t\\tj-=k;\\n\\t\\tind+=k;\\n\\t}\\n\\treturn ans;\\n}\\nstd::vector<int> Z_algo(std::string &vec){\\n\\tint n=vec.size();\\n\\tint ind=1,j=0,k;\\n\\tstd::vector<int> ans(n,0);\\n\\tans[0]=n;\\n\\twhile(ind<n){\\n\\t\\twhile(ind+j<n&&vec[j]==vec[ind+j]) j++;\\n\\t\\tans[ind]=j;\\n\\t\\tif(j==0){\\n\\t\\t\\tind++;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tk=1;\\n\\t\\twhile(k+ind<n&&ans[k]+k<j){\\n\\t\\t\\tans[k+ind]=ans[k];\\n\\t\\t\\tk++;\\n\\t\\t}\\n\\t\\tj-=k;\\n\\t\\tind+=k;\\n\\t}\\n\\treturn ans;\\n}\\n}\\nusing po167::Z_algo;\\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;\\n\\tcin>>N;\\n\\tvector<int> S(N);\\n\\trep(i,N) cin>>S[i];\\n\\tauto Z=Z_algo(S);\\n\\trep(i,N){\\n\\t\\tif(i==0) continue;\\n\\t\\tif(__gcd(i,N)!=i) continue;\\n\\t\\tif(Z[i]==N-i){\\n\\t\\t\\tcout<<N/i<<\\\"\\\\n\\\";\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\tcout<<\\\"1\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4644,\n \"score_of_the_acc\": -0.1044,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2773_5850720\",\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< 998244353 >;\\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 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\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\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 static const int base1 = 1007, base2 = 2009;\\n static const int mod1 = 1000000007, mod2 = 1000000009;\\n vector<long long> hash1, hash2, power1, power2;\\n int n;\\n // construct\\n RollingHash(const string &S) {\\n n = (int)S.size();\\n hash1.assign(n+1, 0);\\n hash2.assign(n+1, 0);\\n power1.assign(n+1, 1);\\n power2.assign(n+1, 1);\\n for (int i = 0; i < n; ++i) {\\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\\n hash2[i+1] = (hash2[i] * base2 + S[i]) % mod2;\\n power1[i+1] = (power1[i] * base1) % mod1;\\n power2[i+1] = (power2[i] * base2) % mod2;\\n }\\n }\\n \\n // get hash of S[left:right]\\n inline pair<long long, long long> get(int l, int r) const {\\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\\n if (res1 < 0) res1 += mod1;\\n long long res2 = hash2[r] - hash2[l] * power2[r-l] % mod2;\\n if (res2 < 0) res2 += mod2;\\n return {res1, res2};\\n }\\n \\n inline pair<long long, long long> c_shift(int l) {\\n auto h1 = get(0, l);\\n auto h2 = get(l, n);\\n return {(h1.first + h2.first * power1[l]) % mod1, (h1.second + h2.second * power2[l]) % mod2};\\n }\\n \\n // get lcp of S[a:] and T[b:]\\n inline int getLCP(int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n};\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n\\n int n; cin >> n;\\n vector<int> s(n);\\n REP(i,n) cin >> s[i];\\n\\n int ans = 1;\\n for(int i=1; i*i<=n; i++) {\\n if(n%i == 0) {\\n int a = i, b = n/i;\\n bool f = true;\\n for(int j=a; j<n; j++) {\\n if(s[j] != s[j-a]) f = false;\\n }\\n if(f) ans = max(ans, b);\\n f = true;\\n for(int j=b; j<n; j++) {\\n if(s[j] != s[j-b]) f = false;\\n \\n }\\n if(f) ans = max(ans, a);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3876,\n \"score_of_the_acc\": -0.0217,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2773_5850717\",\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< 998244353 >;\\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 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\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\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 static const int base1 = 1007, base2 = 2009;\\n static const int mod1 = 1000000007, mod2 = 1000000009;\\n vector<long long> hash1, hash2, power1, power2;\\n int n;\\n // construct\\n RollingHash(const string &S) {\\n n = (int)S.size();\\n hash1.assign(n+1, 0);\\n hash2.assign(n+1, 0);\\n power1.assign(n+1, 1);\\n power2.assign(n+1, 1);\\n for (int i = 0; i < n; ++i) {\\n hash1[i+1] = (hash1[i] * base1 + S[i]) % mod1;\\n hash2[i+1] = (hash2[i] * base2 + S[i]) % mod2;\\n power1[i+1] = (power1[i] * base1) % mod1;\\n power2[i+1] = (power2[i] * base2) % mod2;\\n }\\n }\\n \\n // get hash of S[left:right]\\n inline pair<long long, long long> get(int l, int r) const {\\n long long res1 = hash1[r] - hash1[l] * power1[r-l] % mod1;\\n if (res1 < 0) res1 += mod1;\\n long long res2 = hash2[r] - hash2[l] * power2[r-l] % mod2;\\n if (res2 < 0) res2 += mod2;\\n return {res1, res2};\\n }\\n \\n inline pair<long long, long long> c_shift(int l) {\\n auto h1 = get(0, l);\\n auto h2 = get(l, n);\\n return {(h1.first + h2.first * power1[l]) % mod1, (h1.second + h2.second * power2[l]) % mod2};\\n }\\n \\n // get lcp of S[a:] and T[b:]\\n inline int getLCP(int a, int b) const {\\n int len = min((int)hash1.size()-a, (int)hash1.size()-b);\\n int low = 0, high = len;\\n while (high - low > 1) {\\n int mid = (low + high) >> 1;\\n if (get(a, a+mid) != get(b, b+mid)) high = mid;\\n else low = mid;\\n }\\n return low;\\n }\\n};\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n\\n int n; cin >> n;\\n vector<int> s(n);\\n REP(i,n) cin >> s[i];\\n\\n int ans = 1;\\n for(int i=2; i*i<=n; i++) {\\n if(n%i == 0) {\\n int a = i, b = n/i;\\n bool f = true;\\n for(int j=a; j<n; j++) {\\n if(s[j] != s[j-a]) f = false;\\n }\\n if(f) ans = max(ans, b);\\n f = true;\\n for(int j=b; j<n; j++) {\\n if(s[j] != s[j-b]) f = false;\\n \\n }\\n if(f) ans = max(ans, a);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 10,\n \"memory_kb\": 3880,\n \"score_of_the_acc\": -0.022,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2773_5850154\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\n//イテレーション\\n#define REP(i, n) for (ll i = 0; i < ll(n); i++)\\n#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)\\n#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)\\n#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)\\n#define FORA(i, I) for (const auto& i : I)\\n// x:コンテナ\\n#define ALL(x) x.begin(), x.end()\\n#define SIZE(x) ll(x.size())\\n//定数\\n#define INF32 2147483647 // 2.147483647×10^{9}:32bit整数のinf\\n#define INF64 9223372036854775807 // 9.223372036854775807×10^{18}:64bit整数のinf\\n#define MOD 1000000007 //問題による\\n//略記\\n#define F first\\n#define S second\\n//出力(空白区切りで昇順に)\\n#define coutALL(x) \\\\\\n for (auto i = x.begin(); i != --x.end(); i++) cout << *i << \\\" \\\"; \\\\\\n cout << *--x.end() << endl;\\n\\n// aをbで割る時の繰上げ,繰り下げ\\nll myceil(ll a, ll b) { return (a + (b - 1)) / b; }\\nll myfloor(ll a, ll b) { return a / b; }\\n\\nint main() {\\n //小数の桁数の出力指定\\n // cout<<fixed<<setprecision(10);\\n //入力の高速化用のコード\\n // ios::sync_with_stdio(false);\\n // cin.tie(nullptr);\\n ll N;\\n cin >> N;\\n vector<ll> ss;\\n REP(i, N) {\\n ll t;\\n cin >> t;\\n ss.push_back(t);\\n }\\n\\n ll bk = 1;\\n FOR(i, 1, N-1) {\\n if(N % i != 0) continue;\\n ll k = N / i;\\n\\n bool f = true;\\n FOR(j, 0, i - 1) {\\n for(ll n = 1; n < k; n++) {\\n //cout << k << \\\" \\\" << i << \\\" \\\" << j << \\\" \\\" << n << \\\" \\\" << ss[j] << \\\" \\\" << ss[n*i+j] << endl;\\n if(ss[j] != ss[n*i+j]) {\\n f = false;\\n break;\\n }\\n }\\n if(!f) break;\\n }\\n if(f) {\\n bk = k;\\n break;\\n }\\n }\\n cout << bk << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5180,\n \"score_of_the_acc\": -0.1665,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2773_5534217\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#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}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n; cin >> n;\\n vector<int> s(n);\\n for(int i=0;i<n;i++){\\n cin >> s[i];\\n }\\n int res=1;\\n for(int i=1;i<=n;i++){\\n if(n%i==0){\\n bool ok=true;\\n for(int j=i;j<n;j++){\\n if(s[j]!=s[j%i]){\\n ok=false; break;\\n }\\n }\\n if(ok){\\n res=max(res,n/i);\\n }\\n }\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3900,\n \"score_of_the_acc\": -0.0383,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2773_5532377\",\n \"code_snippet\": \"#line 2 \\\"cpplib/util/template.hpp\\\"\\n/**\\n * These codes are licensed under CC0.\\n * http://creativecommons.org/publicdomain/zero/1.0/deed.ja\\n */\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#pragma GCC target(\\\"avx2\\\")\\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>using V=vector<T>;\\ntemplate<typename T>using VV=V<V<T>>;\\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 debug(T t){bool f=0;for(auto i:t){cerr<<(f?\\\" \\\":\\\"\\\")<<i;f=1;}cerr<<endl;}\\ntemplate<typename T>inline void debug2(T t){for(auto i:t)debug(i);}\\n#define loop(n) for(long long _=0;_<(long long)(n);++_)\\n#define _overload4(_1,_2,_3,_4,name,...) name\\n#define __rep(i,a) repi(i,0,a,1)\\n#define _rep(i,a,b) repi(i,a,b,1)\\n#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)\\n#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)\\n#define _overload3_rev(_1,_2,_3,name,...) name\\n#define _rep_rev(i,a) repi_rev(i,0,a)\\n#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)\\n#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)\\n\\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)\\n// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\\n// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\\n// inline 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;}\\n// template<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)\\n#if __cplusplus>=201703L\\n template<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#endif\\n#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))\\n#define bit(n,a) ((n>>a)&1)\\nvector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}\\nusing graph=vector<vector<int>>;\\ntemplate<typename T>using graph_w=vector<vector<pair<int,T>>>;\\ntemplate<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<\\\"(\\\"<<v.first<<\\\",\\\"<<v.second<<\\\")\\\";return out;}\\n#if __cplusplus>=201703L\\n constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}\\n#endif\\n\\ntemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}\\ntemplate<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}\\ntemplate<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}\\ntemplate<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}\\n#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile(\\\"mov %%rsp, %%rbx\\\\nmov %%rax, %%rsp\\\":\\\"=b\\\"(stack_extend_origin_memory_):\\\"a\\\"((char*)stack_extend_memory_+(size)-1024));\\n#define END_STACK_EXTEND asm volatile(\\\"mov %%rax, %%rsp\\\"::\\\"a\\\"(stack_extend_origin_memory_));free(stack_extend_memory_);\\n#line 2 \\\"code.cpp\\\"\\n\\nstd::vector<int> z_algorithm(const vec& s){\\n std::vector<int>res(s.size());\\n res[0]=s.size();\\n int i=1,j=0;\\n while(i<(int)s.size()){\\n while(i+j<(int)s.size()&&s[j]==s[i+j])++j;\\n res[i]=j;\\n if(j==0){++i;continue;}\\n int k=1;\\n while(i+k<(int)s.size()&&k+res[k]<j)res[i+k]=res[k],++k;\\n i+=k;j-=k;\\n }\\n return res;\\n}\\n\\nint main(){\\n lint n;\\n cin>>n;\\n vec a(n);\\n rep(i,n)cin>>a[i];\\n auto d=z_algorithm(a);\\n rep(i,1,n){\\n if(n%i==0&&d[i]==n-i){\\n cout<<n/i<<endl;\\n return 0;\\n }\\n }\\n cout<<1<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5428,\n \"score_of_the_acc\": -0.1596,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2773_5532372\",\n \"code_snippet\": \"#line 1 \\\"b.cpp\\\"\\n#pragma region Macros\\n#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#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__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()\\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(i, n) FOR(i, 0, n)\\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\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\n#pragma endregion Macros\\n\\n#line 1 \\\"/home/siro53/kyo-pro/compro_library/math/divisor.hpp\\\"\\ntemplate<class T>\\nvector<T> divisor(T n) {\\n vector<T> ret;\\n for(T i = 1; i * i <= n; i++) {\\n if(n % i == 0) {\\n ret.push_back(i);\\n if(i * i != n)\\n ret.push_back(n / i);\\n }\\n }\\n sort(begin(ret), end(ret));\\n return (ret);\\n}\\n#line 70 \\\"b.cpp\\\"\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<int> a(N);\\n REP(i, N) cin >> a[i];\\n\\n auto v = divisor(N);\\n int ans = -INF;\\n\\n for(int len : v) {\\n vector<vector<int>> v(N/len);\\n for(int i = 0; i < N; i += len) {\\n REP(j, len) v[i/len].push_back(a[i + j]);\\n }\\n debug(len, v);\\n bool ok = true;\\n FOR(i, 1, N/len) if(v[i-1] != v[i]) ok = false;\\n if(ok) chmax(ans, N/len);\\n }\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 14888,\n \"score_of_the_acc\": -1.058,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2773_4926994\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n\\nvector<long long> divisor(long long n){\\n vector<long long> r;\\n for(long long i=1;i*i<=n;i++){\\n if(n%i==0){\\n r.emplace_back(i);\\n if(i*i!=n)r.emplace_back(n/i);\\n }\\n }\\n sort(r.begin(),r.end());\\n return r;\\n}\\n\\nsigned main(){\\n ll n;\\n cin>>n;\\n vector<ll> S(n);\\n rep(i,n)cin>>S[i];\\n auto v=divisor(n);\\n for(auto a:v){\\n if(a>n-1)break;\\n rep(i,n-a){\\n if(S[i]!=S[i+a]){\\n break;\\n }\\n if(i==n-a-1){\\n cout<<n/a<<endl;\\n return 0;\\n }\\n }\\n }\\n cout<<1<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4692,\n \"score_of_the_acc\": -0.1232,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2773_4926942\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n\\nvector<long long> divisor(long long n){\\n vector<long long> r;\\n for(long long i=1;i*i<=n;i++){\\n if(n%i==0){\\n r.emplace_back(i);\\n if(i*i!=n)r.emplace_back(n/i);\\n }\\n }\\n sort(r.begin(),r.end());\\n return r;\\n}\\n\\nsigned main(){\\n ll n;\\n cin>>n;\\n vector<ll> S(n);\\n rep(i,n)cin>>S[i];\\n auto v=divisor(n);\\n ll t=n;\\n for(auto a:v){\\n if(a>n-1)break;\\n if(S[0]==S[a]){\\n t=a;\\n break;\\n }\\n }\\n cout<<n/t<<endl;\\n}\",\n \"accuracy\": 0.72,\n \"time_ms\": 30,\n \"memory_kb\": 4700,\n \"score_of_the_acc\": -0.1239,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2773_4926911\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\ntypedef long long int lli;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define out(s) cout << s << endl;\\nusing namespace std;\\nint main()\\n{\\n string s = \\\"\\\";\\n lli n;\\n cin >> n;\\n vector<lli> yaku;\\n lli p = 2;\\n while(p<=n/2){\\n if(n%p==0){\\n yaku.push_back(p);\\n }\\n p++;\\n }\\n rep(i, n)\\n {\\n string a;\\n cin >> a;\\n s = s + a;\\n }\\n lli k = 1;\\n lli div = 0;\\n while (true)\\n {\\n\\n if (s.size() % yaku[div] == 0)\\n {\\n string sub = s.substr(0, s.size() / yaku[div]);\\n bool check = true;\\n rep(j, s.size() /sub.size() - 1)\\n {\\n if (sub != s.substr((sub.size()) * (j + 1), s.size()/yaku[div]))\\n {\\n check = false;\\n break;\\n }\\n }\\n\\n if (check)\\n {\\n k = k * yaku[div];\\n div = 0;\\n s = sub;\\n continue;\\n }\\n }\\n div++;\\n if (div >=yaku.size())\\n {\\n break;\\n }\\n }\\n cout << k << endl;\\n}\",\n \"accuracy\": 0.04,\n \"time_ms\": 670,\n \"memory_kb\": 4020,\n \"score_of_the_acc\": -0.991,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2773_4926867\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\ntypedef long long int lli;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define out(s) cout << s << endl;\\nusing namespace std;\\nint main()\\n{\\n string s = \\\"\\\";\\n lli n;\\n cin >> n;\\n vector<lli> yaku;\\n lli p = 2;\\n while(p*p<=n){\\n if(n%p==0){\\n yaku.push_back(p);\\n }\\n p++;\\n }\\n rep(i, n)\\n {\\n string a;\\n cin >> a;\\n s = s + a;\\n }\\n lli k = 1;\\n lli div = 0;\\n while (true)\\n {\\n if (s.size() % yaku[div] == 0)\\n {\\n string sub = s.substr(0, s.size() / yaku[div]);\\n bool check = true;\\n rep(j, s.size() /sub.size() - 1)\\n {\\n if (sub != s.substr((sub.size()) * (j + 1), s.size()/yaku[div]))\\n {\\n check = false;\\n break;\\n }\\n }\\n\\n if (check)\\n {\\n k = k * yaku[div];\\n div = 0;\\n s = sub;\\n continue;\\n }\\n }\\n div++;\\n if (div >=yaku.size())\\n {\\n break;\\n }\\n }\\n cout << k << endl;\\n}\",\n \"accuracy\": 0.04,\n \"time_ms\": 700,\n \"memory_kb\": 3984,\n \"score_of_the_acc\": -1.0313,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2773_4926782\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing i64=std::int_fast64_t;\\nusing u64=std::uint_fast64_t;\\n\\n#define rep(i,a,b) for(i64 i=(a);(i) < (b);(i)++)\\n#define all(i) i.begin(),i.end()\\n\\nint main(){\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n i64 n;\\n std::cin>>n;\\n\\n std::vector<i64> s(n);\\n for(auto&& e:s)std::cin>>e;\\n\\n std::vector<i64> yaku;\\n\\n for(i64 i=1;i*i<=n;i++){\\n if(n%i==0){\\n yaku.emplace_back(i);\\n if(i*i!=n)yaku.emplace_back(n/i);\\n }\\n }\\n\\n std::sort(all(yaku),std::greater<i64>());\\n\\n for(const auto& e:yaku){\\n i64 len = n/e;\\n bool isok=true;\\n rep(i,0,len){\\n rep(j,0,e)isok&=(s[i] == s[i+len*j]);\\n }\\n if(isok){\\n std::cout<<e<<\\\"\\\\n\\\";\\n return 0;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4672,\n \"score_of_the_acc\": -0.0924,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2773_4926653\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cstdio>\\n\\nusing namespace std;\\n\\n#define SIZE 200000\\n\\nint main() {\\n int N, S[SIZE];\\n\\n scanf(\\\"%d\\\", &N);\\n\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", S + i);\\n }\\n\\n int ans = 1;\\n\\n for (int i = 1; i <= N; i++) {\\n if (N % i != 0) continue;\\n\\n bool ok = true;\\n\\n for (int j = 0; j + i < N; j++) {\\n ok &= S[j] == S[i + j];\\n }\\n\\n if (ok) {\\n ans = max(ans, N / i);\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3788,\n \"score_of_the_acc\": -0.0139,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2773_4472189\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\n#define enld '\\\\n'\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll mod2 = 998244353;\\nconst double PI = 3.1415926535897932384626433832795028841971;\\nconst int dx[6] = {1, 0, -1, 0,1,1};\\nconst int dy[6] = {0, 1, 0, -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; }\\n// ---------------------------------------------------------------------------\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int N;\\n cin >> N;\\n vector<int> A(N);\\n for(int i=0; i<N; i++) cin >> A[i];\\n for(int i=1; i<=N; i++){\\n if(N%i == 0){\\n bool can = true;\\n for(int j=0; i+j<N; j++){\\n if(A[j] != A[i+j]){\\n can = false;\\n break;\\n }\\n }\\n if(can){\\n cout << N/i << enld;\\n return 0;\\n }\\n }\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.0145,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2773_4471516\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\n#define enld '\\\\n'\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll mod2 = 998244353;\\nconst double PI = 3.1415926535897932384626433832795028841971;\\nconst int dx[6] = {1, 0, -1, 0,1,1};\\nconst int dy[6] = {0, 1, 0, -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; }\\n// ---------------------------------------------------------------------------\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int N;\\n cin >> N;\\n vector<int> A(N+1);\\n for(int i=1; i<=N; i++){\\n cin >> A[i];\\n }\\n int ans = inf;\\n for(int i=1; i<=N; i++){\\n if(N%i == 0){\\n bool can = true;\\n for(int j=1; j<=i; j++){\\n int now = A[j];\\n for(int k=j; k<=N; k+=i){\\n if(now != A[k]){\\n can = false;\\n break;\\n }\\n }\\n if(!can) break;\\n }\\n if(can){\\n chmin(ans,i);\\n }\\n }\\n }\\n cout << N/ans << enld;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -0.0148,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2773_4471488\",\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 int ans;\\n for(int k=n; k>=1; k--){\\n if(n%k != 0) continue;\\n int t = n/k;\\n bool ok = true;\\n for(int i=0; i<n; i++){\\n if(a[i] != a[i%t]){\\n ok = false;\\n break;\\n }\\n }\\n if(ok){\\n ans = k;\\n break;\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -0.0728,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2773_4471429\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\n#define enld '\\\\n'\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll mod2 = 998244353;\\nconst double PI = 3.1415926535897932384626433832795028841971;\\nconst int dx[6] = {1, 0, -1, 0,1,1};\\nconst int dy[6] = {0, 1, 0, -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; }\\n// ---------------------------------------------------------------------------\\n\\nvector<int> KMP(vector<int> S){\\n int l = S.size();\\n vector<int> A(l+1);\\n A[0] = -1;\\n int j = -1;\\n for(int i=0; i<l; i++){\\n while(j >= 0 and S[i] != S[j]) j = A[j];\\n j++;\\n if(i<l and S[i+1] == S[j]) A[i+1] = A[j];\\n else A[i+1] = j;\\n }\\n return A;\\n}\\n\\nint gcd(int a,int b){\\n if(b == 0) return a;\\n return gcd(b,a%b);\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int N;\\n cin >> N;\\n vector<int> S(N);\\n for(int i=0; i<N; i++) cin >> S[i];\\n vector<int> A = KMP(S);\\n int temp = N/(N-A[N]);\\n cout << gcd(N,temp) << enld; \\n return 0;\\n}\",\n \"accuracy\": 0.88,\n \"time_ms\": 10,\n \"memory_kb\": 5272,\n \"score_of_the_acc\": -0.1457,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2773_4471410\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\n#define enld '\\\\n'\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll mod2 = 998244353;\\nconst double PI = 3.1415926535897932384626433832795028841971;\\nconst int dx[6] = {1, 0, -1, 0,1,1};\\nconst int dy[6] = {0, 1, 0, -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; }\\n// ---------------------------------------------------------------------------\\n\\nvector<int> KMP(vector<int> S){\\n int l = S.size();\\n vector<int> A(l+1);\\n A[0] = -1;\\n int j = -1;\\n for(int i=0; i<l; i++){\\n while(j >= 0 and S[i] != S[j]) j = A[j];\\n j++;\\n if(i<l and S[i+1] == S[j]) A[i+1] = A[j];\\n else A[i+1] = j;\\n }\\n return A;\\n}\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int N;\\n cin >> N;\\n vector<int> S(N);\\n for(int i=0; i<N; i++) cin >> S[i];\\n vector<int> A = KMP(S);\\n cout << N/(N-A[N]) << enld; \\n return 0;\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 10,\n \"memory_kb\": 5252,\n \"score_of_the_acc\": -0.1439,\n \"final_rank\": 16\n }\n]","isConversational":false}}},{"rowIdx":1662,"cells":{"group_id":{"kind":"string","value":"aoj_2774_cpp"},"problem_description":{"kind":"string","value":"C: 成長する点 - Growing Point -\n問題\n粘菌コンピュータというものがある。\nある種の粘菌には「餌を求め、餌と餌の最短距離をつなぐ形に変形する」\nという性質がある。\nこれを利用し、餌を「入力」、形を「出力」とみなして\nコンピュータとして利用することができる。\n今、二次元平面上に1つの粘菌の拠点と\nN\n個の餌が存在する。それぞれの餌には\n1\nから\nN\nまでの異なる番号が与えられ、拠点には番号0が与えられている。\nこの粘菌はある餌を食べるために、その餌と最も近い拠点の最短距離を結ぶ管状に\n成長し、食べた位置に新たに拠点を形成する。\n新たに形成した拠点は拠点を形成する直前に食べた餌と同じ番号を持つ。\n粘菌は拠点以外の場所から成長することはできない。\n以降では、拠点と餌を二次元平面上の点、管状に成長した粘菌を複数の線分として考える。\nすべての拠点と線分からなる構造を粘菌網と呼ぶ。\n粘菌は1つの餌を食べるために次のような操作を繰り返す。\nまだ食べていない餌の中で粘菌網に最も近い餌を選ぶ。そのような餌が複数存在する場合は番号が最も小さい餌を選ぶ。\n選んだ餌と最も近い拠点を選ぶ。そのような拠点が複数存在する場合は、最も拠点の番号が小さいものから取る。\n選んだ拠点と餌を結ぶ線分を引く。以降ではこのとき選んだ餌も拠点として扱う。\nこの粘菌は生きるために必要な栄養を取るのに\nM\n個の餌を食べる必要がある。\n粘菌が\nM\n個の餌を食べるまでに引いたすべての線分の長さの合計を求めよ。\nまた、出力する値は0.0001以下の誤差を含んでいても良い。\n以下の図では入力例2の粘菌の様子を示している。\n入力形式\nN\nM\nX\nY\npx_1\npy_1\n...\npx_n\npy_n\n1\n行目には餌の数\nN\n（\n1 \\≤ N \\≤ 5,000\n）、食べる餌の個数\nM\n（\n1 \\≤ M \\≤ N\n）、番号0の拠点の座標\nX\n,\nY\n（\n−5,000 \\≤ X, Y \\≤ 5,000\n）が整数値で与えられる。続く\nN\n行には番号順に餌の座標\npx_i\n,\npy_i\n（\n1 \\≤ i \\≤ N\n）が整数値で与えられる。（\n−5,000 \\≤ px_i, py_i \\≤ 5,000\n）\nまた、番号が異なる餌は異なる座標に存在し、それぞれの餌と番号0の拠点の座標は異なる。\n出力形式\n成長した距離の合計を1行で出力せよ。また、出力する値は0.0001以下の誤差を含んでいても良い。\n入力例1\n2 2 0 0\n3 3\n4 0\n出力例1\n7.16227766017\n最初は番号1の餌と拠点の距離が $3\\sqrt{2}$ と番号2の餌と拠点の距離が\n4\nなので\n番号2の餌が選ばれる。その後番号1の餌と粘菌網との距離が\n3\nになり、番号1の餌が選ばれる。\n入力例2\n4 4 1 3\n3 3\n2 1\n3 1\n1 1\n出力例2\n6.2360679775\n図のように餌1、2、4、3の順に粘菌は餌を食べていく\n入力例3\n16 15 -4077 763\n-2480 2841\n-2908 -1096\n676 -4080\n-4988 -2634\n3004 -1360\n-2272 1773\n-4344 -3631\n-355 4426\n-3740 3634\n-3330 2191\n-3423 -2999\n-3438 2281\n4754 -1500\n-3440 -3873\n-2089 -3419\n1426 2793\n出力例3\n25349.9626798834"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2774_10858226","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst ll LINF = 1e18;\nconst int INF = 1e9;\n#define FOR(i,s,t) for(int i =s; i < t;i++)\n#define SZ(a) (int)a.size()\n#define ALL(a) a.begin(),a.end()\n\ntypedef double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-9, pi = acos(-1.0);\nnamespace std {\n\tbool operator < (const Point& lhs, const Point& rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() < rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() :a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) :a(a), b(b) {}\n\tPoint operator[](const int _num) {\n\t\tif (_num == 0) return a;\n\t\telse if (_num == 1) return b;\n\t}\n};\n\nld dot(Point a, Point b) { return real(conj(a)*b); }\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\nbool isis_sp(Line s, Point p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\nld dist_sp(Line s, Point p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\n}\n\nvoid solve() {\n\tint N, M, X, Y; cin >> N >> M >> X >> Y;\n\tvector<int> flag(N+1, 0);\n\tvector<Point> ps(N+1);\n\tps[0] = Point(X, Y); flag[0] = 1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tint a, b; cin >> a >> b;\n\t\tps[i] = Point(a, b);\n\t}\n\n\tld ans = 0;\n\tvector<double> dist(N + 1, LINF);\n\tfor (int i = 0; i <= N; i++) {\n\t\tdist[i] = abs(ps[i] - ps[0]);\n\t}\n\tfor (int i = 0; i < M; i++) {\n\t\tld len = LINF;\n\t\tint idx = -1;\n\t\tfor (int i = 0; i <= N; i++) {\n\t\t\tif (flag[i] == 1) continue;\n\t\t\tif (len > dist[i]) {\n\t\t\t\tlen = dist[i];\n\t\t\t\tidx = i;\n\t\t\t}\n\t\t}\n\n\t\tlen = LINF;\n\t\tint pidx = -1;\n\t\tfor (int i = 0; i <= N; i++) {\n\t\t\tif (flag[i] == 1) {\n\t\t\t\tld d = abs(ps[i] - ps[idx]);\n\t\t\t\tif (len > d) {\n\t\t\t\t\tlen = d;\n\t\t\t\t\tpidx = i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans += abs(ps[idx] - ps[pidx]);\n\t\tflag[idx] = 1;\n\t\tLine L(ps[idx], ps[pidx]);\n\t\tfor (int i = 0; i <= N; i++) {\n\t\t\tif (flag[i] == 1) continue;\n\t\t\tdist[i] = min(dist[i], dist_sp(L, ps[i]));\n\t\t}\n\n\t}\n\tcout << fixed << setprecision(12) << ans << endl;\n}\n\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\n\tsolve();\n\n\treturn 0;\n}","accuracy":1,"time_ms":1110,"memory_kb":3696,"score_of_the_acc":-0.6429,"final_rank":9},{"submission_id":"aoj_2774_9640371","code_snippet":"#include<iostream>\n#include<cmath>\n\nusing namespace std;\n#define ld long double\nconst ld EPS = 1e-8;\nconst int N = 5010;\n\nstruct Point {\n int x, y;\n\n Point (int x1 = 0, int y1 = 0) {\n x = x1, y = y1;\n }\n};\n\nstruct Vector {\n int x, y;\n\n Vector(Point a, Point b) {\n x = b.x - a.x, y = b.y - a.y;\n }\n\n ld len() {\n return sqrtl(x * x + y * y);\n }\n\n int dot_prod(Vector v1) {\n return x * v1.x + y * v1.y;\n }\n\n int cross_prod(Vector v1) {\n return x * v1.y - y * v1.x;\n }\n};\n\nld dist_point_point(Point a, Point b) {\n Vector ab(a, b);\n return ab.len();\n}\n\nld dist_edg_point(Point a, Point b, Point p) {\n Vector ab(a, b), ba(b, a), ap(a, p), bp(b, p);\n if(ab.dot_prod(ap) < 0) return ap.len();\n if(ba.dot_prod(bp) < 0) return bp.len();\n return abs(ab.cross_prod(ap) / ab.len());\n}\n\nint n, m;\nbool usd[N];\nPoint a[N];\nld ans = 0, d[N];\n\nint main() {\n#ifdef LOCAL\n freopen(\"inp.txt\", \"r\", stdin);\n freopen(\"out.txt\", \"w\", stdout);\n#endif\n cin >> n >> m >> a[0].x >> a[0].y;\n for(int i = 1; i <= n; ++i) {\n cin >> a[i].x >> a[i].y;\n d[i] = dist_point_point(a[0], a[i]);\n }\n usd[0] = true;\n for(int i = 0; i < m; ++i) {\n int opt = -1;\n for(int j = 1; j <= n; ++j) {\n if(usd[j]) continue;\n if(opt == -1 || d[j] < d[opt] - EPS) opt = j;\n }\n int opt_usd = 0;\n for(int j = 0; j <= n; ++j) {\n if(usd[j]) {\n if(dist_point_point(a[j], a[opt]) < dist_point_point(a[opt_usd], a[opt])) {\n opt_usd = j;\n }\n }\n }\n ans += dist_point_point(a[opt], a[opt_usd]);\n usd[opt] = true;\n for(int j = 1; j <= n; ++j) {\n if(!usd[j]) {\n d[j] = min(d[j], dist_edg_point(a[opt], a[opt_usd], a[j]));\n }\n }\n }\n cout.precision(11);\n cout << fixed << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":400,"memory_kb":3416,"score_of_the_acc":-0.1793,"final_rank":5},{"submission_id":"aoj_2774_9522006","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) { return (ull)rng() % B; }\n\n// https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/all\n////////////////////////////////////////////////////////////////////////////////\ntypedef double Real;\nconst Real eps = 1e-8; // 1000 : 10^-8, 10000 : 10^-7\ninline int sgn(Real a, Real b = 0) { return (a - b < -eps) ? -1 : (a - b > eps) ? 1 : 0; }\ninline Real _sqrt(Real a) { return sqrt(max(a, (Real)0)); }\nstruct Point {\n Real x, y;\n Point() {}\n Point(Real x, Real y) : x(x), y(y) {}\n Point &operator-=(const Point &p) {\n x -= p.x;\n y -= p.y;\n return *this;\n }\n Point &operator+=(const Point &p) {\n x += p.x;\n y += p.y;\n return *this;\n }\n Point &operator*=(Real d) {\n x *= d;\n y *= d;\n return *this;\n }\n Point &operator/=(Real d) {\n x /= d;\n y /= d;\n return *this;\n }\n Point operator+(const Point &p) const {\n Point res(*this);\n return res += p;\n }\n Point operator-(const Point &p) const {\n Point res(*this);\n return res -= p;\n }\n Point operator*(Real d) const {\n Point res(*this);\n return res *= d;\n }\n Point operator/(Real d) const {\n Point res(*this);\n return res /= d;\n }\n bool operator<(const Point &p) const {\n return (sgn(x, p.x) < 0 or (sgn(x, p.x) == 0 and sgn(y, p.y) < 0));\n }\n bool operator==(const Point &p) const { return (sgn(x - p.x) == 0 and sgn(y - p.y) == 0); }\n friend istream &operator>>(istream &is, Point &p) {\n is >> p.x >> p.y;\n return (is);\n }\n Real norm() { return _sqrt(x * x + y * y); }\n Real norm2() { return (x * x + y * y); }\n Point vec() { return (*this); }\n Point unit() { return (*this) / this->norm(); } // 単位ベクトル\n Point rotate(Real theta) {\n return {x * cos(theta) - y * sin(theta), x * sin(theta) + y * cos(theta)};\n }\n Point perpendicular() { return {-y, x}; }\n Point normal() { return perpendicular().unit(); } // 法線ベクトル\n};\n\nPoint vec(Point a, Point b) { return (b - a); }\nReal dist(Point a, Point b) { return vec(a, b).norm(); }\nReal dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }\nReal cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }\n\n// 線分\nstruct Segment : array<Point, 2> {\n Segment() {}\n Segment(Point a, Point b) { at(0) = a, at(1) = b; }\n Point vec() { return (at(1) - at(0)); }\n Real length() { return vec().norm(); }\n friend istream &operator>>(istream &is, Segment &s) {\n is >> s[0] >> s[1];\n return (is);\n }\n};\n// 直線\nstruct Line : Segment {\n Line() {}\n Line(Point a, Point b) : Segment(a, b) {}\n Line(Segment s) : Line(s[0], s[1]) {}\n};\n\nint ccw(Point a, Point b, Point c) {\n b -= a, c -= a;\n if (sgn(cross(b, c)) == 1) return 1; // a,b,c 反時計回り\n if (sgn(cross(b, c)) == -1) return -1; // a,b,c 時計周り\n if (sgn(dot(b, c)) == -1) return 2; // c,a,b 一直線上\n if (sgn(c.norm() - b.norm()) == 1) return -2; // a,b,c 一直線上\n return 0; // a,c,b 一直線上\n}\n\n// 垂直判定\ntemplate <typename T> bool is_orthogonal(T s, T t) { return sgn(dot(s.vec(), t.vec())) == 0; }\n// 並行判定\ntemplate <typename T> bool is_parallel(T s, T t) { return sgn(cross(s.vec(), t.vec())) == 0; }\n// 同一直線判定\ntemplate <typename T> bool is_same_line(T s, T t) {\n return abs(ccw(s[0], s[1], t[0])) != 1 and abs(ccw(s[0], s[1], t[1])) != 1;\n}\n// 線分上の点判定\nbool is_on_segment(Point p, Segment l) { return ccw(l[0], l[1], p) == 0; }\n// 線分の交差判定(AOJ-2172)\nbool is_intersect(Segment s, Segment t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 and\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\n// 2直線の交点(AOJ-2596)\npair<bool, Point> line_intersection(Line s, Line t) {\n if (is_same_line(s, t)) return {true, s[0]};\n else if (is_parallel(s, t)) return {false, Point()};\n else return {true, s[0] + s.vec() * cross(t[0] - s[0], t.vec()) / cross(s.vec(), t.vec())};\n}\n// 2線分の交点\npair<bool, Point> segment_intersection(Segment s, Segment t) {\n if (is_same_line(s, t)) {\n if (is_on_segment(s[0], t)) return {true, s[0]};\n else if (is_on_segment(s[1], t)) return {true, s[1]};\n else if (is_on_segment(t[0], s)) return {true, t[0]};\n else return {false, Point()};\n }\n if (!is_intersect(s, t)) return {false, Point()};\n else return line_intersection(Line(s), Line(t));\n}\n// 点と直線の距離\nReal point_line_distance(Point p, Line l) { return abs(cross(p - l[0], l.vec())) / l.length(); }\n// 点と線分の距離\nReal point_segment_distance(Point p, Segment l) {\n if (sgn(dot(p - l[0], l.vec())) == -1) return dist(p, l[0]);\n else if (sgn(dot(p - l[1], l.vec())) == 1) return dist(p, l[1]);\n else return point_line_distance(p, l);\n}\n// 線分と線分の距離(AOJ-1157)\nReal segment_segment_distance(Segment s, Segment t) {\n if (is_intersect(s, t)) return 0;\n double res = point_segment_distance(s[0], t);\n res = min(res, point_segment_distance(s[1], t));\n res = min(res, point_segment_distance(t[0], s));\n res = min(res, point_segment_distance(t[1], s));\n return res;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, m;\n cin >> n >> m;\n vector<Point> p(n + 1);\n vector<double> dist(n + 1);\n vector<bool> used(n + 1);\n for (int i = 0; i <= n; ++i) {\n cin >> p[i];\n }\n used[0] = true;\n for (int i = 0; i <= n; ++i) {\n dist[i] = (p[0] - p[i]).norm();\n }\n double res = 0;\n for (int i = 0; i < m; ++i) {\n int idx = -1;\n for (int j = 0; j <= n; ++j) {\n if (used[j]) continue;\n if (idx == -1) idx = j;\n if (dist[j] < dist[idx]) idx = j;\n }\n int base = -1;\n double cost = 1e9;\n for (int j = 0; j <= n; ++j) {\n if (!used[j]) continue;\n double d = (p[j] - p[idx]).norm();\n if (d < cost) {\n cost = d;\n base = j;\n }\n }\n res += cost;\n used[idx] = true;\n Segment s = Segment(p[base], p[idx]);\n for (int j = 0; j <= n; ++j) {\n dist[j] = min(dist[j], point_segment_distance(p[j], s));\n }\n }\n printf(\"%.9f\\n\", res);\n}","accuracy":1,"time_ms":240,"memory_kb":3664,"score_of_the_acc":-0.0843,"final_rank":2},{"submission_id":"aoj_2774_5533669","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// arg(x) : argment,[-PI,PI]\nusing CP = complex<long double>;\n#define X real()\n#define Y imag()\nconst long double PI = acos(-1.0L);\nconst long double EPS = 1e-10;\nbool operator==(const CP &l, const CP &r) { return norm(l - r) <= EPS; }\nstruct Circle {\n CP o;\n long double r;\n Circle(long double _x = 0.0L, long double _y = 0.0L, long double _r = 0.0L)\n : o(CP(_x, _y)), r(_r) {}\n Circle(CP _o, long double _r = 0.0) : o(_o), r(_r) {}\n bool operator<(const Circle &cr) const { return r < cr.r; }\n};\n\nstruct Line {\n CP s, t;\n Line(long double sx = 0.0L, long double sy = 0.0L, long double tx = 0.0L,\n long double ty = 0.0L)\n : s(CP(sx, sy)), t(CP(tx, ty)) {}\n Line(CP _s, CP _t) : s(_s), t(_t) {}\n};\n\n// cos a\nlong double costh(const long double &a, const long double &b,\n const long double &c) {\n return (b * b - a * a + c * c) / (2.0L * b * c);\n}\n\n// dot(a,b) = |a||b|cos x\nlong double dot(const CP &a, const CP &b) { return (conj(a) * b).X; }\n// cross(a,b) : area of parallelogram\n// sign : a-> b ,counter clockwise? + : -\nlong double cross(const CP &a, const CP &b) { return (conj(a) * b).Y; }\nlong double corner(const CP &a, const CP &b) {\n //[0,PI]\n return acos(dot(a, b) / (abs(a) * abs(b)));\n}\n\nCP projectionLP(const CP &s, const CP &t, const CP &p) {\n if (s == t) return s;\n CP base = t - s;\n long double r = dot(p - s, base) / norm(base);\n return s + base * r;\n}\nCP projectionLP(const Line &l, const CP &p) {\n return projectionLP(l.s, l.t, p);\n}\n\nCP reflectionLP(const CP &s, const CP &t, const CP &p) {\n CP tmp = (projectionLP(s, t, p) - p);\n tmp *= 2;\n return p + tmp;\n}\nCP reflectionLP(const Line &l, const CP &p) {\n return reflectionLP(l.s, l.t, p);\n}\n\nint calc_clockwiseSP(const CP &s, CP t, CP p) {\n t -= s;\n p -= s;\n if (cross(t, p) > EPS) return 1; // \"COUNTER_CLOCKWISE\"\n if (cross(t, p) < -EPS) return -1; //\"CLOCK_WISE\"\n if (dot(t, p) < 0) return 2; // \"ONLINE_BACK\"\n if (norm(t) < norm(p)) return -2; // \"ONLINE_FRONT\"\n return 0; // \"ON_SEGMENT\"\n}\nint calc_clockwiseSP(const Line &l, const CP &p) {\n return calc_clockwiseSP(l.s, l.t, p);\n}\n\nint parallel_orthogonalLL(const CP &s, CP t, const CP &a, CP b) {\n t -= s;\n b -= a;\n if (abs(cross(t, b)) <= EPS) return 2; // \"parallel\"\n if (abs(dot(t, b)) <= EPS) return 1; // \"orthogonal\"\n return 0;\n}\nint parallel_orthogonalLL(const Line &ll, const Line &lr) {\n return parallel_orthogonalLL(ll.s, ll.t, lr.s, lr.t);\n}\n\nCP intersectionLL(const CP &a, const CP &b, const CP &c, const CP &d) {\n return a + (b - a) * (cross(d - c, c - a) / cross(d - c, b - a));\n}\nCP intersectionLL(const Line &ll, const Line &lr) {\n return intersectionLL(ll.s, ll.t, lr.s, lr.t);\n}\n\nbool on_segSP(const CP &s, const CP &t, const CP &p) {\n // if not use end point, dot(s - p, t - p) < 0\n return abs(cross(s - p, t - p)) <= EPS && dot(s - p, t - p) <= 0;\n}\nbool on_segSP(const Line &l, const CP &p) { return on_segSP(l.s, l.t, p); }\n\n// crossing segments? (a,b) and (c,d)\nbool iscrossSS(const CP &a, const CP &b, const CP &c, const CP &d) {\n // parallel\n if (abs(cross(a - b, c - d)) <= EPS) {\n return on_segSP(a, b, c) || on_segSP(a, b, d) || on_segSP(c, d, a) ||\n on_segSP(c, d, b);\n }\n CP isp = intersectionLL(a, b, c, d);\n return on_segSP(a, b, isp) && on_segSP(c, d, isp);\n}\nbool iscrossSS(const Line &ll, const Line &lr) {\n return iscrossSS(ll.s, ll.t, lr.s, lr.t);\n}\n\nlong double distLP(const CP &s, const CP &t, const CP &p) {\n return abs(cross(t - s, p - s) / abs(t - s));\n}\nlong double distLP(const Line &l, const CP &p) { return distLP(l.s, l.t, p); }\n\nlong double distSP(const CP &s, const CP &t, const CP &p) {\n if (dot(t - s, p - s) < 0) return abs(p - s);\n if (dot(s - t, p - t) < 0) return abs(p - t);\n return distLP(s, t, p);\n}\nlong double distSP(const Line &l, const CP &p) { return distSP(l.s, l.t, p); }\n\nusing P = pair<long double, int>;\n\nint n, m;\nvector<CP> v;\n\nlong double solve();\n\nint main() {\n cin >> n >> m, ++n;\n for (int i = 0; i < n; ++i) {\n int x, y;\n cin >> x >> y;\n v.emplace_back(x, y);\n }\n cout << fixed << setprecision(10);\n cout << solve() << endl;\n return 0;\n}\n\nlong double solve() {\n vector<long double> memo(n, 1e10);\n for (int i = 1; i < n; ++i) memo[i] = abs(v[i] - v[0]);\n memo[0] = -1;\n long double res = 0;\n while (m--) {\n long double nd = 1e10;\n int now = 0;\n for (int i = 0; i < n; ++i)\n if (memo[i] > 0 && memo[i] < nd) now = i, nd = memo[i];\n int from = 0;\n nd = 1e10;\n for (int i = 0; i < n; ++i)\n if (memo[i] < 0 && abs(v[now] - v[i]) < nd)\n from = i, nd = abs(v[now] - v[i]);\n res += nd;\n memo[now] = -1;\n for (int i = 0; i < n; ++i)\n if (memo[i] > 0) memo[i] = min(memo[i], distSP(v[from], v[now], v[i]));\n }\n return res;\n}","accuracy":1,"time_ms":1350,"memory_kb":3744,"score_of_the_acc":-0.7982,"final_rank":12},{"submission_id":"aoj_2774_5532964","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// arg(x) : argment,[-PI,PI]\nusing CP = complex<long double>;\n#define X real()\n#define Y imag()\nconst long double PI = acos(-1.0L);\nconst long double EPS = 1e-10;\nbool operator==(const CP &l, const CP &r) { return norm(l - r) <= EPS; }\nstruct Circle {\n CP o;\n long double r;\n Circle(long double _x = 0.0L, long double _y = 0.0L, long double _r = 0.0L)\n : o(CP(_x, _y)), r(_r) {}\n Circle(CP _o, long double _r = 0.0) : o(_o), r(_r) {}\n bool operator<(const Circle &cr) const { return r < cr.r; }\n};\n\nstruct Line {\n CP s, t;\n Line(long double sx = 0.0L, long double sy = 0.0L, long double tx = 0.0L,\n long double ty = 0.0L)\n : s(CP(sx, sy)), t(CP(tx, ty)) {}\n Line(CP _s, CP _t) : s(_s), t(_t) {}\n};\n\n// cos a\nlong double costh(const long double &a, const long double &b,\n const long double &c) {\n return (b * b - a * a + c * c) / (2.0L * b * c);\n}\n\n// dot(a,b) = |a||b|cos x\nlong double dot(const CP &a, const CP &b) { return (conj(a) * b).X; }\n// cross(a,b) : area of parallelogram\n// sign : a-> b ,counter clockwise? + : -\nlong double cross(const CP &a, const CP &b) { return (conj(a) * b).Y; }\nlong double corner(const CP &a, const CP &b) {\n //[0,PI]\n return acos(dot(a, b) / (abs(a) * abs(b)));\n}\n\nCP projectionLP(const CP &s, const CP &t, const CP &p) {\n if (s == t) return s;\n CP base = t - s;\n long double r = dot(p - s, base) / norm(base);\n return s + base * r;\n}\nCP projectionLP(const Line &l, const CP &p) {\n return projectionLP(l.s, l.t, p);\n}\n\nCP reflectionLP(const CP &s, const CP &t, const CP &p) {\n CP tmp = (projectionLP(s, t, p) - p);\n tmp *= 2;\n return p + tmp;\n}\nCP reflectionLP(const Line &l, const CP &p) {\n return reflectionLP(l.s, l.t, p);\n}\n\nint calc_clockwiseSP(const CP &s, CP t, CP p) {\n t -= s;\n p -= s;\n if (cross(t, p) > EPS) return 1; // \"COUNTER_CLOCKWISE\"\n if (cross(t, p) < -EPS) return -1; //\"CLOCK_WISE\"\n if (dot(t, p) < 0) return 2; // \"ONLINE_BACK\"\n if (norm(t) < norm(p)) return -2; // \"ONLINE_FRONT\"\n return 0; // \"ON_SEGMENT\"\n}\nint calc_clockwiseSP(const Line &l, const CP &p) {\n return calc_clockwiseSP(l.s, l.t, p);\n}\n\nint parallel_orthogonalLL(const CP &s, CP t, const CP &a, CP b) {\n t -= s;\n b -= a;\n if (abs(cross(t, b)) <= EPS) return 2; // \"parallel\"\n if (abs(dot(t, b)) <= EPS) return 1; // \"orthogonal\"\n return 0;\n}\nint parallel_orthogonalLL(const Line &ll, const Line &lr) {\n return parallel_orthogonalLL(ll.s, ll.t, lr.s, lr.t);\n}\n\nCP intersectionLL(const CP &a, const CP &b, const CP &c, const CP &d) {\n return a + (b - a) * (cross(d - c, c - a) / cross(d - c, b - a));\n}\nCP intersectionLL(const Line &ll, const Line &lr) {\n return intersectionLL(ll.s, ll.t, lr.s, lr.t);\n}\n\nbool on_segSP(const CP &s, const CP &t, const CP &p) {\n // if not use end point, dot(s - p, t - p) < 0\n return abs(cross(s - p, t - p)) <= EPS && dot(s - p, t - p) <= 0;\n}\nbool on_segSP(const Line &l, const CP &p) { return on_segSP(l.s, l.t, p); }\n\n// crossing segments? (a,b) and (c,d)\nbool iscrossSS(const CP &a, const CP &b, const CP &c, const CP &d) {\n // parallel\n if (abs(cross(a - b, c - d)) <= EPS) {\n return on_segSP(a, b, c) || on_segSP(a, b, d) || on_segSP(c, d, a) ||\n on_segSP(c, d, b);\n }\n CP isp = intersectionLL(a, b, c, d);\n return on_segSP(a, b, isp) && on_segSP(c, d, isp);\n}\nbool iscrossSS(const Line &ll, const Line &lr) {\n return iscrossSS(ll.s, ll.t, lr.s, lr.t);\n}\n\nlong double distLP(const CP &s, const CP &t, const CP &p) {\n return abs(cross(t - s, p - s) / abs(t - s));\n}\nlong double distLP(const Line &l, const CP &p) { return distLP(l.s, l.t, p); }\n\nlong double distSP(const CP &s, const CP &t, const CP &p) {\n if (dot(t - s, p - s) < 0) return abs(p - s);\n if (dot(s - t, p - t) < 0) return abs(p - t);\n return distLP(s, t, p);\n}\nlong double distSP(const Line &l, const CP &p) { return distSP(l.s, l.t, p); }\n\nusing P = pair<long double, int>;\n\nint n, m;\nvector<CP> v;\n\nlong double solve();\n\nint main() {\n cin >> n >> m, ++n;\n for (int i = 0; i < n; ++i) {\n int x, y;\n cin >> x >> y;\n v.emplace_back(x, y);\n }\n cout << fixed << setprecision(10);\n cout << solve() << endl;\n return 0;\n}\n\nlong double solve() {\n // vector<vector<long double>> dist(n, vector<long double>(n, 0));\n vector<long double> memo(n, 1e10);\n {\n // for (int i = 0; i < n; ++i)\n // for (int j = 0; j < n; ++j) dist[i][j] = abs(v[i] - v[j]);\n for (int i = 1; i < n; ++i) memo[i] = abs(v[i] - v[0]);\n memo[0] = -1;\n }\n long double res = 0;\n while (m--) {\n long double nd = 1e10;\n int now = 0;\n for (int i = 0; i < n; ++i)\n if (memo[i] > 0 && memo[i] < nd) now = i, nd = memo[i];\n int from = 0;\n nd = 1e10;\n for (int i = 0; i < n; ++i)\n if (memo[i] < 0 && abs(v[now] - v[i]) < nd)\n from = i, nd = abs(v[now] - v[i]);\n res += nd;\n memo[now] = -1;\n for (int i = 0; i < n; ++i)\n if (memo[i] > 0) memo[i] = min(memo[i], distSP(v[from], v[now], v[i]));\n }\n return res;\n}","accuracy":1,"time_ms":1350,"memory_kb":3744,"score_of_the_acc":-0.7982,"final_rank":12},{"submission_id":"aoj_2774_5532551","code_snippet":"#line 1 \"c.cpp\"\n#pragma region Macros\n#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#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__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()\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(i, n) FOR(i, 0, n)\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\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\n#pragma endregion Macros\n\n#line 1 \"/home/siro53/kyo-pro/compro_library/geometry/geometry.hpp\"\nnamespace geometry {\n // Point : 複素数型を位置ベクトルとして扱う\n // 実軸(real)をx軸、挙軸(imag)をy軸として見る\n using D = double;\n using Point = complex<D>;\n const D EPS = 1e-7;\n const D PI = acosl(-1);\n\n inline bool equal(const D &a, const D &b) { return fabs(a - b) < EPS; }\n\n // 単位ベクトル(unit vector)を求める\n Point unitVector(const Point &a) { return a / abs(a); }\n\n // 法線ベクトル(normal vector)を求める\n // 90度回転した単位ベクトルをかける\n // -90度がよければPoint(0, -1)をかける\n Point normalVector(const Point &a) { return a * Point(0, 1); }\n\n // 内積(dot product) : a・b = |a||b|cosΘ\n D dot(const Point &a, const Point &b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n }\n\n // 外積(cross product) : a×b = |a||b|sinΘ\n D cross(const Point &a, const Point &b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n }\n\n // 点pを反時計回りにtheta度回転\n // thetaはラジアン！！！\n Point rotate(const Point &p, const D &theta) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\n sin(theta) * p.real() + cos(theta) * p.imag());\n }\n\n // ラジアン->度\n D radianToDegree(const D &radian) { return radian * 180.0 / PI; }\n\n // 度->ラジアン\n D degreeToRadian(const D °ree) { return degree * PI / 180.0; }\n\n // 点の回転方向\n // 点a, b, cの位置関係について(aが基準点)\n int ccw(const Point &a, Point b, Point c) {\n b -= a, c -= a;\n // 点a, b, c が\n // 反時計回りの時、\n if(cross(b, c) > EPS) return 1;\n // 時計回りの時、\n if(cross(b, c) < -EPS) return -1;\n // c, a, bがこの順番で同一直線上にある時、\n if(dot(b, c) < 0) return 2;\n // a, b, cがこの順番で同一直線上にある場合、\n if(norm(b) < norm(c)) return -2;\n // cが線分ab上にある場合、\n return 0;\n }\n\n // Line : 直線を表す構造体\n // b - a で直線・線分を表せる\n struct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n // Ax+By=C\n Line(D A, D B, D C) {\n if(equal(A, 0)) {\n a = Point(0, C / B), b = Point(1, C / B);\n } else if(equal(B, 0)) {\n b = Point(C / A, 0), b = Point(C / A, 1);\n } else {\n a = Point(0, C / B), b = Point(C / A, 0);\n }\n }\n };\n\n // Segment : 線分を表す構造体\n // Lineと同じ\n struct Segment : Line {\n Segment() = default;\n\n Segment(Point a, Point b) : Line(a, b) {}\n };\n\n // Circle : 円を表す構造体\n // pが中心の位置ベクトル、rは半径\n struct Circle {\n Point p;\n D r;\n\n Circle() = default;\n\n Circle(Point p, D r) : p(p), r(r) {}\n };\n\n // 2直線の直交判定 : a⊥b <=> dot(a, b) = 0\n bool isOrthogonal(const Line &a, const Line &b) {\n return equal(dot(a.b - a.a, b.b - b.a), 0);\n }\n // 2直線の平行判定 : a//b <=> cross(a, b) = 0\n bool isParallel(const Line &a, const Line &b) {\n return equal(cross(a.b - a.a, b.b - b.a), 0);\n }\n\n // 点cが直線ab上にあるか\n bool isPointOnLine(const Point &a, const Point &b, const Point &c) {\n return isParallel(Line(a, b), Line(a, c));\n }\n\n // 点cが\"線分\"ab上にあるか\n bool isPointOnSegment(const Point &a, const Point &b, const Point &c) {\n // |a-c| + |c-b| <= |a-b| なら線分上\n return (abs(a - c) + abs(c - b) < abs(a - b) + EPS);\n }\n\n // 直線lと点pの距離を求める\n D distanceBetweenLineAndPoint(const Line &l, const Point &p) {\n return abs(cross(l.b - l.a, p - l.a)) / abs(l.b - l.a);\n }\n\n // 線分lと点pの距離を求める\n // 定義：点pから「線分lのどこか」への最短距離\n D distanceBetweenSegmentAndPoint(const Segment &l, const Point &p) {\n if(dot(l.b - l.a, p - l.a) < EPS) return abs(p - l.a);\n if(dot(l.a - l.b, p - l.b) < EPS) return abs(p - l.b);\n return abs(cross(l.b - l.a, p - l.a)) / abs(l.b - l.a);\n }\n\n // 直線s, tの交点の計算\n Point crossPoint(const Line &s, const Line &t) {\n D d1 = cross(s.b - s.a, t.b - t.a);\n D d2 = cross(s.b - s.a, s.b - t.a);\n if(equal(abs(d1), 0) && equal(abs(d2), 0)) return t.a;\n return t.a + (t.b - t.a) * (d2 / d1);\n }\n\n // 線分s, tの交点の計算\n Point crossPoint(const Segment &s, const Segment &t) {\n return crossPoint(Line(s), Line(t));\n }\n\n // 線分sと線分tが交差しているかどうか\n // bound:線分の端点を含むか\n bool isIntersect(const Segment &s, const Segment &t, bool bound) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) < bound &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) < bound;\n }\n\n // 線分sとtの距離\n D distanceBetweenSegments(const Segment &s, const Segment &t) {\n if(isIntersect(s, t, 1)) return (D)(0);\n D ans = distanceBetweenSegmentAndPoint(s, t.a);\n chmin(ans, distanceBetweenSegmentAndPoint(s, t.b));\n chmin(ans, distanceBetweenSegmentAndPoint(t, s.a));\n chmin(ans, distanceBetweenSegmentAndPoint(t, s.b));\n return ans;\n }\n\n // 射影(projection)\n // 直線(線分)lに点pから引いた垂線の足を求める\n Point projection(const Line &l, const Point &p) {\n D t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n }\n\n Point projection(const Segment &l, const Point &p) {\n D t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n }\n\n // 反射(reflection)\n // 直線lを対称軸として点pと線対称の位置にある点を求める\n Point reflection(const Line &l, const Point &p) {\n return p + (projection(l, p) - p) * (D)2.0;\n }\n\n // 2つの円の交差判定\n // 返り値は共通接線の数\n int isIntersect(const Circle &c1, const Circle &c2) {\n D d = abs(c1.p - c2.p);\n // 2つの円が離れている場合\n if(d > c1.r + c2.r + EPS) return 4;\n // 外接している場合\n if(equal(d, c1.r + c2.r)) return 3;\n // 内接している場合\n if(equal(d, abs(c1.r - c2.r))) return 1;\n // 内包している場合\n if(d < abs(c1.r - c2.r) - EPS) return 0;\n return 2;\n }\n\n // 2つの円の交点\n vector<Point> crossPoint(const Circle &c1, const Circle &c2) {\n vector<Point> res;\n int mode = isIntersect(c1, c2);\n // 2つの中心の距離\n D d = abs(c1.p - c2.p);\n // 2円が離れている場合\n if(mode == 4) return res;\n // 1つの円がもう1つの円に内包されている場合\n if(mode == 0) return res;\n // 2円が外接する場合\n if(mode == 3) {\n D t = c1.r / (c1.r + c2.r);\n res.emplace_back(c1.p + (c2.p - c1.p) * t);\n return res;\n }\n // 内接している場合\n if(mode == 1) {\n if(c2.r < c1.r - EPS) {\n res.emplace_back(c1.p + (c2.p - c1.p) * (c1.r / d));\n } else {\n res.emplace_back(c2.p + (c1.p - c2.p) * (c2.r / d));\n }\n return res;\n }\n // 2円が重なる場合\n D rc1 = (c1.r * c1.r + d * d - c2.r * c2.r) / (2 * d);\n D rs1 = sqrt(c1.r * c1.r - rc1 * rc1);\n if(c1.r - abs(rc1) < EPS) rs1 = 0;\n Point e12 = (c2.p - c1.p) / abs(c2.p - c1.p);\n res.emplace_back(c1.p + rc1 * e12 + rs1 * e12 * Point(0, 1));\n res.emplace_back(c1.p + rc1 * e12 + rs1 * e12 * Point(0, -1));\n return res;\n }\n\n // 点pが円cの内部(円周上も含む)に入っているかどうか\n bool isInCircle(const Circle &c, const Point &p) {\n D d = abs(c.p - p);\n return (equal(d, c.r) || d < c.r - EPS);\n }\n\n // 円cと直線lの交点\n vector<Point> crossPoint(const Circle &c, const Line &l) {\n vector<Point> res;\n D d = distanceBetweenLineAndPoint(l, c.p);\n // 交点を持たない\n if(d > c.r + EPS) return res;\n // 接する\n Point h = projection(l, c.p);\n if(equal(d, c.r)) {\n res.emplace_back(h);\n return res;\n }\n Point e = unitVector(l.b - l.a);\n D ph = sqrt(c.r * c.r - d * d);\n res.emplace_back(h - e * ph);\n res.emplace_back(h + e * ph);\n return res;\n }\n\n // 点pを通る円cの接線\n // 2本あるので、接点のみを返す\n vector<Point> tangentToCircle(const Point &p, const Circle &c) {\n return crossPoint(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\n }\n\n // 円の共通接線\n vector<Line> tangent(const Circle &a, const Circle &b) {\n vector<Line> ret;\n // 2円の中心間の距離\n D g = abs(a.p - b.p);\n // 円が内包されている場合\n if(equal(g, 0)) return ret;\n Point u = unitVector(b.p - a.p);\n Point v = rotate(u, PI / 2);\n for(int s : {-1, 1}) {\n D h = (a.r + b.r * s) / g;\n if(equal(h * h, 1)) {\n ret.emplace_back(a.p + (h > 0 ? u : -u) * a.r,\n a.p + (h > 0 ? u : -u) * a.r + v);\n\n } else if(1 - h * h > 0) {\n Point U = u * h, V = v * sqrt(1 - h * h);\n ret.emplace_back(a.p + (U + V) * a.r,\n b.p - (U + V) * (b.r * s));\n ret.emplace_back(a.p + (U - V) * a.r,\n b.p - (U - V) * (b.r * s));\n }\n }\n return ret;\n }\n\n // 多角形の面積を求める\n D PolygonArea(const vector<Point> &p) {\n D res = 0;\n int n = p.size();\n for(int i = 0; i < n - 1; i++) res += cross(p[i], p[i + 1]);\n res += cross(p[n - 1], p[0]);\n return res * 0.5;\n }\n\n // 凸多角形かどうか\n bool isConvex(const vector<Point> &p) {\n int n = p.size();\n int now, pre, nxt;\n for(int i = 0; i < n; i++) {\n pre = (i - 1 + n) % n;\n nxt = (i + 1) % n;\n now = i;\n if(ccw(p[pre], p[now], p[nxt]) == -1) return false;\n }\n return true;\n }\n\n // 凸包 O(NlogN)\n vector<Point> ConvexHull(vector<Point> &p) {\n int n = (int)p.size(), k = 0;\n sort(ALL(p), [](const Point &a, const Point &b) {\n return (real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b));\n });\n vector<Point> ch(2 * n);\n // 一直線上の3点を含める -> (< -EPS)\n // 含め無い -> (< EPS)\n for(int i = 0; i < n; ch[k++] = p[i++]) { // lower\n while(k >= 2 &&\n cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS)\n --k;\n }\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { // upper\n while(k >= t &&\n cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS)\n --k;\n }\n ch.resize(k - 1);\n return ch;\n }\n\n // 多角形gに点pが含まれているか?\n // 含まれる:2, 辺上にある:1, 含まれない:0\n int isContained(const vector<Point> &g, const Point &p) {\n bool in = false;\n int n = (int)g.size();\n for(int i = 0; i < n; i++) {\n Point a = g[i] - p, b = g[(i + 1) % n] - p;\n if(imag(a) > imag(b)) swap(a, b);\n if(imag(a) <= EPS && EPS < imag(b) && cross(a, b) < -EPS) in = !in;\n if(cross(a, b) == 0 && dot(a, b) <= 0) return 1;\n }\n return (in ? 2 : 0);\n }\n\n} // namespace geometry\n#line 70 \"c.cpp\"\nusing namespace geometry;\n\nusing Data = pair<D, int>;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<Point> p(N+1); \n REP(i, N+1) {\n int x, y;\n cin >> x >> y;\n p[i] = Point(x, y);\n }\n\n D ans = 0;\n set<Data> unused; // まだ追加してない頂点\n set<int> used; // すでに追加した頂点\n REP(i, N) unused.emplace(abs(p[0] - p[i+1]), i+1);\n used.insert(0);\n\n REP(_, M) {\n // 次の餌を選ぶ\n auto [nxt_d, nxt_id] = *unused.begin();\n // 餌と最も近い拠点を求める\n int min_kyoten = -1;\n D mn = LLINF;\n for(int id : used) if(chmin(mn, abs(p[nxt_id] - p[id]))) min_kyoten = id;\n ans += mn;\n Segment seg(p[nxt_id], p[min_kyoten]);\n // まだ追加してない頂点の最短距離を更新\n set<Data> newse;\n for(auto& [d, id] : unused) {\n if(id == nxt_id) continue;\n D nd = min(d, distanceBetweenSegmentAndPoint(seg, p[id]));\n newse.emplace(nd, id);\n }\n unused = newse;\n used.insert(nxt_id);\n }\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":1690,"memory_kb":4268,"score_of_the_acc":-1.0322,"final_rank":15},{"submission_id":"aoj_2774_5532524","code_snippet":"#line 2 \"cpplib/util/template.hpp\"\n/**\n * These codes are licensed under CC0.\n * http://creativecommons.org/publicdomain/zero/1.0/deed.ja\n */\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"avx2\")\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>using V=vector<T>;\ntemplate<typename T>using VV=V<V<T>>;\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 debug(T t){bool f=0;for(auto i:t){cerr<<(f?\" \":\"\")<<i;f=1;}cerr<<endl;}\ntemplate<typename T>inline void debug2(T t){for(auto i:t)debug(i);}\n#define loop(n) for(long long _=0;_<(long long)(n);++_)\n#define _overload4(_1,_2,_3,_4,name,...) name\n#define __rep(i,a) repi(i,0,a,1)\n#define _rep(i,a,b) repi(i,a,b,1)\n#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)\n#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)\n#define _overload3_rev(_1,_2,_3,name,...) name\n#define _rep_rev(i,a) repi_rev(i,0,a)\n#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)\n#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)\n\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)\n// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\n// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\n// inline 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;}\n// template<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)\n#if __cplusplus>=201703L\n template<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#endif\n#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))\n#define bit(n,a) ((n>>a)&1)\nvector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}\nusing graph=vector<vector<int>>;\ntemplate<typename T>using graph_w=vector<vector<pair<int,T>>>;\ntemplate<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<\"(\"<<v.first<<\",\"<<v.second<<\")\";return out;}\n#if __cplusplus>=201703L\n constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}\n#endif\n\ntemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}\ntemplate<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}\ntemplate<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}\ntemplate<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}\n#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile(\"mov %%rsp, %%rbx\\nmov %%rax, %%rsp\":\"=b\"(stack_extend_origin_memory_):\"a\"((char*)stack_extend_memory_+(size)-1024));\n#define END_STACK_EXTEND asm volatile(\"mov %%rax, %%rsp\"::\"a\"(stack_extend_origin_memory_));free(stack_extend_memory_);\n#line 2 \"code.cpp\"\n\nint main(){\n lint n,m,x,y;\n cin>>n>>m>>x>>y;\n vec px(n),py(n);\n rep(i,n){\n cin>>px[i]>>py[i];\n }\n px.emplace_back(x);\n py.emplace_back(y);\n vector<pair<__int128_t,__int128_t>>score(n+1,make_pair(INF,1));\n set<lint> s;\n s.emplace(n);\n auto f=[&](lint i,lint j)->lint{\n return (px[j]-px[i])*(px[j]-px[i])+(py[j]-py[i])*(py[j]-py[i]);\n };\n auto g=[&](lint i,lint j,lint k)->pair<__int128_t,__int128_t>{\n lint a=py[i]-py[j];\n lint b=-(px[i]-px[j]);\n lint c=-(a*px[i]+b*py[i]);\n pair<lint,lint> tmp=make_pair((a*px[k]+b*py[k]+c)*(a*px[k]+b*py[k]+c),(a*a+b*b));\n if((px[j]-px[i])*(px[k]-px[i])+(py[j]-py[i])*(py[k]-py[i])>=0\n && (px[i]-px[j])*(px[k]-px[j])+(py[i]-py[j])*(py[k]-py[j])>=0\n )return tmp;\n else return min(make_pair(f(i,k),1LL),make_pair(f(j,k),1LL));\n };\n long double ans=0;\n auto chmin=[&](pair<__int128_t,__int128_t>&s,const pair<__int128_t,__int128_t>&t)->bool{\n if(s.first*t.second>t.first*s.second){\n s=t;\n return 1;\n }\n return 0;\n };\n rep(i,n){\n chmin(score[i],make_pair(f(i,n),1LL));\n }\n while(m--){\n pair<__int128_t,__int128_t> mn2=make_pair(INF,1LL);\n lint k=0;\n rep(i,n){\n if(chmin(mn2,score[i])){\n k=i;\n }\n }\n pair<__int128_t,__int128_t> mn=make_pair(INF,1LL);\n lint idx=0;\n for(auto j:s){\n if(chmin(mn,make_pair(f(j,k),1LL))){\n idx=j;\n }\n }\n ans+=sqrtl(f(k,idx));\n s.emplace(k);\n score[k]=make_pair(INF,1LL);\n rep(i,n){\n if(!s.count(i)){\n chmin(score[i],g(k,idx,i));\n }\n }\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":1330,"memory_kb":3856,"score_of_the_acc":-0.7888,"final_rank":11},{"submission_id":"aoj_2774_5532489","code_snippet":"#line 2 \"cpplib/util/template.hpp\"\n/**\n * These codes are licensed under CC0.\n * http://creativecommons.org/publicdomain/zero/1.0/deed.ja\n */\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"avx2\")\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>using V=vector<T>;\ntemplate<typename T>using VV=V<V<T>>;\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 debug(T t){bool f=0;for(auto i:t){cerr<<(f?\" \":\"\")<<i;f=1;}cerr<<endl;}\ntemplate<typename T>inline void debug2(T t){for(auto i:t)debug(i);}\n#define loop(n) for(long long _=0;_<(long long)(n);++_)\n#define _overload4(_1,_2,_3,_4,name,...) name\n#define __rep(i,a) repi(i,0,a,1)\n#define _rep(i,a,b) repi(i,a,b,1)\n#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)\n#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)\n#define _overload3_rev(_1,_2,_3,name,...) name\n#define _rep_rev(i,a) repi_rev(i,0,a)\n#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)\n#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)\n\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)\n// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\n// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\n// inline 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;}\n// template<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)\n#if __cplusplus>=201703L\n template<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#endif\n#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))\n#define bit(n,a) ((n>>a)&1)\nvector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}\nusing graph=vector<vector<int>>;\ntemplate<typename T>using graph_w=vector<vector<pair<int,T>>>;\ntemplate<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<\"(\"<<v.first<<\",\"<<v.second<<\")\";return out;}\n#if __cplusplus>=201703L\n constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}\n#endif\n\ntemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}\ntemplate<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}\ntemplate<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}\ntemplate<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}\n#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile(\"mov %%rsp, %%rbx\\nmov %%rax, %%rsp\":\"=b\"(stack_extend_origin_memory_):\"a\"((char*)stack_extend_memory_+(size)-1024));\n#define END_STACK_EXTEND asm volatile(\"mov %%rax, %%rsp\"::\"a\"(stack_extend_origin_memory_));free(stack_extend_memory_);\n#line 2 \"code.cpp\"\n\nint main(){\n lint n,m,x,y;\n cin>>n>>m>>x>>y;\n vec px(n),py(n);\n rep(i,n){\n cin>>px[i]>>py[i];\n }\n px.emplace_back(x);\n py.emplace_back(y);\n vector<lint>score(n+1,INF);\n set<lint> s;\n s.emplace(n);\n auto f=[&](lint i,lint j)->lint{\n return (px[j]-px[i])*(px[j]-px[i])+(py[j]-py[i])*(py[j]-py[i]);\n };\n auto g=[&](lint i,lint j,lint k)->lint{\n lint a=py[i]-py[j];\n lint b=-(px[i]-px[j]);\n lint c=-(a*px[i]+b*py[i]);\n lint tmp=(a*px[k]+b*py[k]+c)*(a*px[k]+b*py[k]+c)/(a*a+b*b);\n if((px[j]-px[i])*(px[k]-px[i])+(py[j]-py[i])*(py[k]-py[i])>=0\n && (px[i]-px[j])*(px[k]-px[j])+(py[i]-py[j])*(py[k]-py[j])>=0\n )return tmp;\n else return min(f(i,k),f(j,k));\n };\n long double ans=0;\n rep(i,n){\n chmin(score[i],f(i,n));\n }\n while(m--){\n lint mn2=INF,k=0;\n rep(i,n){\n if(chmin(mn2,score[i])){\n k=i;\n }\n }\n lint mn=INF,idx=0;\n for(auto j:s){\n if(chmin(mn,f(j,k))){\n idx=j;\n }\n }\n ans+=sqrtl(f(k,idx));\n s.emplace(k);\n score[k]=INF;\n rep(i,n){\n if(!s.count(i)){\n chmin(score[i],g(k,idx,i));\n }\n }\n }\n cout<<ans<<endl;\n}","accuracy":0.5,"time_ms":970,"memory_kb":3732,"score_of_the_acc":-0.5543,"final_rank":19},{"submission_id":"aoj_2774_5532463","code_snippet":"#line 2 \"cpplib/util/template.hpp\"\n/**\n * These codes are licensed under CC0.\n * http://creativecommons.org/publicdomain/zero/1.0/deed.ja\n */\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"avx2\")\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>using V=vector<T>;\ntemplate<typename T>using VV=V<V<T>>;\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 debug(T t){bool f=0;for(auto i:t){cerr<<(f?\" \":\"\")<<i;f=1;}cerr<<endl;}\ntemplate<typename T>inline void debug2(T t){for(auto i:t)debug(i);}\n#define loop(n) for(long long _=0;_<(long long)(n);++_)\n#define _overload4(_1,_2,_3,_4,name,...) name\n#define __rep(i,a) repi(i,0,a,1)\n#define _rep(i,a,b) repi(i,a,b,1)\n#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)\n#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)\n#define _overload3_rev(_1,_2,_3,name,...) name\n#define _rep_rev(i,a) repi_rev(i,0,a)\n#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)\n#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)\n\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)\n// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\n// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\n// inline 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;}\n// template<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)\n#if __cplusplus>=201703L\n template<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#endif\n#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))\n#define bit(n,a) ((n>>a)&1)\nvector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}\nusing graph=vector<vector<int>>;\ntemplate<typename T>using graph_w=vector<vector<pair<int,T>>>;\ntemplate<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<\"(\"<<v.first<<\",\"<<v.second<<\")\";return out;}\n#if __cplusplus>=201703L\n constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}\n#endif\n\ntemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}\ntemplate<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}\ntemplate<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}\ntemplate<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}\n#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile(\"mov %%rsp, %%rbx\\nmov %%rax, %%rsp\":\"=b\"(stack_extend_origin_memory_):\"a\"((char*)stack_extend_memory_+(size)-1024));\n#define END_STACK_EXTEND asm volatile(\"mov %%rax, %%rsp\"::\"a\"(stack_extend_origin_memory_));free(stack_extend_memory_);\n#line 2 \"code.cpp\"\n\nint main(){\n lint n,m,x,y;\n cin>>n>>m>>x>>y;\n vec px(n),py(n);\n rep(i,n){\n cin>>px[i]>>py[i];\n }\n px.emplace_back(x);\n py.emplace_back(y);\n vector<lint>score(n+1,INF);\n set<lint> s;\n s.emplace(n);\n auto f=[&](lint i,lint j)->lint{\n return (px[j]-px[i])*(px[j]-px[i])+(py[j]-py[i])*(py[j]-py[i]);\n };\n auto g=[&](lint i,lint j,lint k)->lint{\n lint a=py[i]-py[j];\n lint b=-(px[i]-px[j]);\n lint c=-(a*px[i]+b*py[i]);\n lint tmp=(a*px[k]+b*py[k]+c)*(a*px[k]+b*py[k]+c)/(a*a+b*b);\n if((px[j]-px[i])*(px[k]-px[i])+(py[j]-py[i])*(py[k]-py[i])>=0\n && (px[i]-px[j])*(px[k]-px[j])+(py[i]-py[j])*(py[k]-py[j])>=0\n )return tmp;\n else return min(f(i,k),f(j,k));\n };\n double ans=0;\n rep(i,n){\n chmin(score[i],f(i,n));\n }\n while(m--){\n lint mn2=INF,k=0;\n rep(i,n){\n if(chmin(mn2,score[i])){\n k=i;\n }\n }\n lint mn=INF,idx=0;\n for(auto j:s){\n if(chmin(mn,f(j,k))){\n idx=j;\n }\n }\n ans+=sqrt(f(k,idx));\n s.emplace(k);\n score[k]=INF;\n rep(i,n){\n if(!s.count(i)){\n chmin(score[i],g(k,idx,i));\n }\n }\n }\n cout<<ans<<endl;\n}","accuracy":0.5,"time_ms":970,"memory_kb":3836,"score_of_the_acc":-0.5575,"final_rank":20},{"submission_id":"aoj_2774_4472073","code_snippet":"#include<bits/stdc++.h>\n#include <algorithm>\n#include <iostream>\n#include <complex>\n#include <cstdio>\n#include <cmath>\n#include <utility>\n#include <vector>\nusing namespace std;\nusing W = double;\nusing P = complex<W>;\nusing L = pair<P,P>;\nusing C = pair<P,W>;\nusing Poly = vector<P>;\n#define X real()\n#define Y imag()\nconst W EPS = (1e-10), pi = acos(-1);\ndouble dot(P a, P b){ return a.X * b.X + a.Y * b.Y;}\nW cross(P a, P b){ return a.X * b.Y - a.Y * b.X;}\nW ps_dist(P a, L s){\n P sf = s.first, ss = s.second;\n if(dot(ss-sf,a-sf) >= 0 && dot(sf-ss,a-ss) >= 0)\n return abs(cross(sf-ss,a-ss))/abs(sf-ss);\n return min(abs(a-sf), abs(a-ss));\n} \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; }\n\nint inf = 1e9;\n\nusing pdi = pair<double,int>;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n,m;\n cin >> n >> m;\n vector<P> p(n+1);\n double x,y;\n cin >> x >> y;\n p[0] = P(x,y);\n for(int i=1; i<=n; i++){\n cin >> x >> y;\n p[i] = P(x,y);\n }\n bool fst = true;\n vector<bool> used(n+1,false);\n used[0] = true;\n double ans = 0;\n priority_queue<pdi,vector<pdi>,greater<pdi>> que;\n vector<double> dist(n+1);\n for(int i=1; i<=n; i++){\n dist[i] = abs(p[i]-p[0]);\n que.emplace(abs(p[i]-p[0]),i);\n }\n for(int i=0; i<m; i++){\n pdi mn = pdi(inf,inf);\n while(used[que.top().second]) que.pop();\n int id = que.top().second;\n que.pop();\n double res = inf;\n int root;\n for(int j=0; j<=n; j++){\n if(used[j]){\n if(chmin(res,abs(p[id]-p[j]))){\n root = j;\n }\n }\n }\n ans += res;\n used[id] = true;\n L line = L(p[id],p[root]);\n for(int j=0; j<=n; j++){\n if(used[j]) continue;\n if(chmin(dist[j],abs(p[j]-p[id]))){\n que.emplace(abs(p[j]-p[id]),j);\n }\n if(chmin(dist[j],ps_dist(p[j],line))){\n que.emplace(ps_dist(p[j],line),j);\n }\n }\n }\n cout << fixed << setprecision(10) << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":740,"memory_kb":36056,"score_of_the_acc":-1.391,"final_rank":16},{"submission_id":"aoj_2774_4471881","code_snippet":"#include<bits/stdc++.h>\n#include <algorithm>\n#include <iostream>\n#include <complex>\n#include <cstdio>\n#include <cmath>\n#include <utility>\n#include <vector>\nusing namespace std;\nusing W = double;\nusing P = complex<W>;\nusing L = pair<P,P>;\nusing C = pair<P,W>;\nusing Poly = vector<P>;\n#define X real()\n#define Y imag()\nconst W EPS = (1e-10), pi = acos(-1);\ndouble dot(P a, P b){ return a.X * b.X + a.Y * b.Y;}\nW cross(P a, P b){ return a.X * b.Y - a.Y * b.X;}\nW ps_dist(P a, L s){\n P sf = s.first, ss = s.second;\n if(dot(ss-sf,a-sf) >= 0 && dot(sf-ss,a-ss) >= 0)\n return abs(cross(sf-ss,a-ss))/abs(sf-ss);\n return min(abs(a-sf), abs(a-ss));\n} \n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n,m;\n cin >> n >> m;\n P ori;\n double x,y;\n cin >> x >> y;\n ori = P(x,y);\n vector<P> p;\n for(int i=0; i<n; i++){\n cin >> x >> y;\n p.emplace_back(x,y);\n // cout << p[i] << endl;\n }\n vector<pair<double,int>> dist(n);\n pair<W,int> mn = make_pair(100000000,100000000);\n for(int i=0; i<n; i++){\n dist[i].first = abs(ori-p[i]);\n dist[i].second = i;\n // cout << ori << endl;\n // cout << p[i] << endl;\n // cout << dist[i].first << endl;\n mn = min(mn,dist[i]);\n }\n vector<bool> used(n,false);\n double ans = 0;\n used[mn.second] = true;\n ans += mn.first;\n for(int i=0; i<n; i++){\n if(used[i]) continue;\n dist[i].first = min(dist[i].first,abs(p[i]-p[mn.second]));\n // 線分\n L sen = make_pair(ori,p[mn.second]);\n dist[i].first = min(dist[i].first,ps_dist(p[i],sen));\n }\n for(int i=0; i<m-1; i++){\n mn = make_pair(1000000000,10000000);\n for(int j=0; j<n; j++){\n if(used[j]) continue;\n mn = min(mn,dist[j]); \n }\n int id = mn.second;\n pair<double,int> kyo = make_pair(abs(ori-p[id]),-1); \n for(int j=0; j<n; j++){\n if(used[j]){\n kyo = min(kyo,pair<double,int>(abs(p[j]-p[id]),j));\n }\n }\n used[id] = true;\n ans += kyo.first;\n for(int j=0; j<n; j++){\n if(used[j]) continue;\n dist[j].first = min(dist[j].first,abs(p[j]-p[id]));\n L sen;\n if(kyo.second == -1){\n sen = make_pair(ori,p[id]);\n }else{\n sen = make_pair(p[kyo.second],p[id]); \n }\n dist[j].first = min(dist[j].first,ps_dist(p[j],sen));\n }\n }\n cout << fixed << setprecision(10) << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":790,"memory_kb":3480,"score_of_the_acc":-0.4312,"final_rank":8},{"submission_id":"aoj_2774_4471705","code_snippet":"#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>\n\nusing namespace std;\nusing Real = double;\nusing Point = complex<Real>;\nconst Real EPS = 1e-8, PI = acos(-1);\n\n// 実数同士の比較\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\n\nPoint operator*(const Point &p, const Real &d) {\n return Point(real(p) * d, imag(p) * d);\n}\n\n// 入力\nistream &operator>>(istream &is, Point &p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\n// 出力\nostream &operator<<(ostream &os, Point &p) {\n os << fixed << setprecision(10) << p.real() << \" \" << p.imag();\n}\n\n// 原点を中心として, 点 p を θ 回転すた点を返す\nPoint rotate(Real theta, const Point &p) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\n// ラジアンを度数に変換\nReal radian_to_degree(Real r) {\n return (r * 180.0 / PI);\n}\n\n// 度数をラジアンに変換\nReal degree_to_radian(Real d) {\n return (d * PI / 180.0);\n}\n\n// ∠BAC をラジアンで取得\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n const Point v(b - a), w(c - a);\n Real alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n if(alpha > beta) swap(alpha, beta);\n Real theta = (beta - alpha);\n return min(theta, 2 * acos(-1) - theta);\n}\n\n// x軸, y軸の順にソート\nnamespace std {\n bool operator<(const Point &a, const Point &b) {\n return !eq(a.real(), b.real()) ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\n// 直線\n// 2 点を通る直線\n// Ax + By = C \nstruct Line {\n Point a, b;\n\n Line() = default;\n\n Line(Point a, Point b) : a(a), b(b) {}\n\n Line(Real A, Real B, Real C) // Ax + By = C\n {\n if(eq(A, 0)) a = Point(0, C / B), b = Point(1, C / B);\n else if(eq(B, 0)) b = Point(C / A, 0), b = Point(C / A, 1);\n else a = Point(0, C / B), b = Point(C / A, 0);\n }\n\n friend ostream &operator<<(ostream &os, Line &p) {\n return os << p.a << \" to \" << p.b;\n }\n\n friend istream &operator>>(istream &is, Line &a) {\n return is >> a.a >> a.b;\n }\n};\n\n// 線分\n// 2 点を結ぶ\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\n\n// 円\n// 中心と半径\nstruct Circle {\n Point p;\n Real r;\n\n Circle() = default;\n\n Circle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector< Point >;\nusing Polygon = vector< Point >; // 注意!! 凸多角形は反時計回りに与える.(保証されない場合は面積が負なら reverse をかける)\nusing Segments = vector< Segment >;\nusing Lines = vector< Line >;\nusing Circles = vector< Circle >;\n\n// 外積\nReal cross(const Point &a, const Point &b) {\n return real(a) * imag(b) - imag(a) * real(b);\n}\n\n// 内積\nReal dot(const Point &a, const Point &b) {\n return real(a) * real(b) + imag(a) * imag(b);\n}\n\n\n// +1\n// \n// +2 a 0 b -2\n//\n// -1\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C&lang=jp\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n if(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n if(dot(b, c) < 0) return +2; // \"ONLINE_BACK\"\n if(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n return 0; // \"ON_SEGMENT\"\n}\n\n\n// 2 直線が平行か\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) {\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\n}\n\n// 2 直線が垂直か\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) {\n return eq(dot(a.a - a.b, b.a - b.b), 0.0);\n}\n\n// 直線 l に 点 p から垂線を下ろして,交わる点を返す\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\n// 同じ\n// 直線として扱われそう\nPoint projection(const Segment &l, const Point &p) {\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\n// 直線 l に対して, 点 p と線対称な位置にある点を返す.\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) {\n return p + (projection(l, p) - p) * 2.0;\n}\n\n// 直線上に点が乗るかどうか\nbool intersect(const Line &l, const Point &p) {\n return abs(ccw(l.a, l.b, p)) != 1;\n}\n\n// 直線 l と直線 m の交差判定\nbool intersect(const Line &l, const Line &m) {\n return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS;\n}\n\n// 線分上に点があるかどうか\nbool intersect(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == 0;\n}\n\n// 直線 l と 線分 s の交差判定\nbool intersect(const Line &l, const Segment &s) {\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\n}\n\n// 点 p と 直線 l との距離\nReal distance(const Line &l, const Point &p);\n\n// 円 c と直線 l との交差判定\nbool intersect(const Circle &c, const Line &l) {\n return distance(l, c.p) <= c.r + EPS;\n}\n\n// 点 p が 円 c 上にあるかどうか\nbool intersect(const Circle &c, const Point &p) {\n return abs(abs(p - c.p) - c.r) < EPS;\n}\n\n\n// 線分同士の交差判定\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nbool intersect(const Segment &s, const Segment &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 円 c と 線分 l との交差判定\nint intersect(const Circle &c, const Segment &l) {\n if(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n auto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n if(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n if(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n const Point h = projection(l, c.p);\n if(dot(l.a - h, l.b - h) < 0) return 2;\n return 0;\n}\n\n// 円同士の交差判定\n// 4 := 離れている\n// 3 := 外接する\n// 2 := 交わる\n// 1 := 内接する\n// 0 := 内包する\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n if(c1.r < c2.r) swap(c1, c2);\n Real d = abs(c1.p - c2.p);\n if(c1.r + c2.r < d) return 4;\n if(eq(c1.r + c2.r, d)) return 3;\n if(c1.r - c2.r < d) return 2;\n if(eq(c1.r - c2.r, d)) return 1;\n return 0;\n}\n\n// 点と点の距離\nReal distance(const Point &a, const Point &b) {\n return abs(a - b);\n}\n\n// 直線と点の距離\nReal distance(const Line &l, const Point &p) {\n return abs(p - projection(l, p));\n}\n\n// 直線と直線の距離 (もちろん交わってたら 0)\nReal distance(const Line &l, const Line &m) {\n return intersect(l, m) ? 0 : distance(l, m.a);\n}\n\n// 線分と点の距離\nReal distance(const Segment &s, const Point &p) {\n Point r = projection(s, p);\n if(intersect(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分同士の距離\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n if(intersect(a, b)) return 0;\n return min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\n// 直線と線分の距離\nReal distance(const Line &l, const Segment &s) {\n if(intersect(l, s)) return 0;\n return min(distance(l, s.a), distance(l, s.b));\n}\n\n// 直線同士の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\nPoint crosspoint(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\n// 線分同士の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) {\n return crosspoint(Line(l), Line(m));\n}\n\n\n// 円と直線の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair< Point, Point > crosspoint(const Circle &c, const Line l) {\n Point pr = projection(l, c.p);\n Point e = (l.b - l.a) / abs(l.b - l.a);\n if(eq(distance(l, c.p), c.r)) return {pr, pr};\n double base = sqrt(c.r * c.r - norm(pr - c.p));\n return {pr - e * base, pr + e * base};\n}\n\n\n// 円と線分の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\npair< Point, Point > crosspoint(const Circle &c, const Segment &l) {\n Line aa = Line(l.a, l.b);\n if(intersect(c, l) == 2) return crosspoint(c, aa);\n auto ret = crosspoint(c, aa);\n if(dot(l.a - ret.first, l.b - ret.first) < 0) ret.second = ret.first;\n else ret.first = ret.second;\n return ret;\n}\n\n// 円同士の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair< Point, Point > crosspoint(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n return {p1, p2};\n}\n\n// 点 p から円 C へ接戦を引いた時の、接点を返す\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\npair< Point, Point > tangent(const Circle &c1, const Point &p2) {\n return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r)));\n}\n\n// 円と円の共通接線を複数返す\n// 0 ~ 4 つの可能性がある\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\nLines tangent(Circle c1, Circle c2) {\n Lines ret;\n if(c1.r < c2.r) swap(c1, c2);\n Real g = norm(c1.p - c2.p);\n if(eq(g, 0)) return ret;\n Point u = (c2.p - c1.p) / sqrt(g);\n Point v = rotate(PI * 0.5, u);\n for(int s : {-1, 1}) {\n Real h = (c1.r + s * c2.r) / sqrt(g);\n if(eq(1 - h * h, 0)) {\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n } else if(1 - h * h > 0) {\n Point uu = u * h, vv = v * sqrt(1 - h * h);\n ret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n ret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n }\n }\n return ret;\n}\n\n// 多角形が凸かどうかを判定\n// 与えられる多角形は反時計回りなことが要請される\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\nbool is_convex(const Polygon &p) {\n int n = (int) p.size();\n for(int i = 0; i < n; i++) {\n if(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\n }\n return true;\n}\n\n// 凸包に含まれる点上および辺上の頂点からなる多角形を返す.\n// 多角形の開始位置は特に指定がない.\n// 反時計回りに返されることは保証されていそう\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\nPolygon convex_hull(Polygon &p) {\n int n = (int) p.size(), k = 0;\n if(n <= 2) return p;\n sort(p.begin(), p.end());\n vector< Point > ch(2 * n);\n for(int i = 0; i < n; ch[k++] = p[i++]) {\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\n// 多角形 Q と点 p との関係を返す\n// 0 := OUT\n// 1 := ON\n// 2 := IN\n// 多角形は反時計回りに渡す\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\nenum {\n OUT, ON, IN\n};\nint contains(const Polygon &Q, const Point &p) {\n bool in = false;\n for(int i = 0; i < Q.size(); i++) {\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n if(a.imag() > b.imag()) swap(a, b);\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n }\n return in ? IN : OUT;\n}\n\n// TODO よくわからん\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\nvoid merge_segments(vector< Segment > &segs) {\n\n auto merge_if_able = [](Segment &s1, const Segment &s2) {\n if(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\n if(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\n if(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\n s1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\n return true;\n };\n\n for(int i = 0; i < segs.size(); i++) {\n if(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\n }\n for(int i = 0; i < segs.size(); i++) {\n for(int j = i + 1; j < segs.size(); j++) {\n if(merge_if_able(segs[i], segs[j])) {\n segs[j--] = segs.back(), segs.pop_back();\n }\n }\n }\n}\n\n// TODO よくわからん\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\nvector< vector< int > > segment_arrangement(vector< Segment > &segs, vector< Point > &ps) {\n vector< vector< int > > g;\n int N = (int) segs.size();\n for(int i = 0; i < N; i++) {\n ps.emplace_back(segs[i].a);\n ps.emplace_back(segs[i].b);\n for(int j = i + 1; j < N; j++) {\n const Point p1 = segs[i].b - segs[i].a;\n const Point p2 = segs[j].b - segs[j].a;\n if(cross(p1, p2) == 0) continue;\n if(intersect(segs[i], segs[j])) {\n ps.emplace_back(crosspoint(segs[i], segs[j]));\n }\n }\n }\n sort(begin(ps), end(ps));\n ps.erase(unique(begin(ps), end(ps)), end(ps));\n\n int M = (int) ps.size();\n g.resize(M);\n for(int i = 0; i < N; i++) {\n vector< int > vec;\n for(int j = 0; j < M; j++) {\n if(intersect(segs[i], ps[j])) {\n vec.emplace_back(j);\n }\n }\n for(int j = 1; j < vec.size(); j++) {\n g[vec[j - 1]].push_back(vec[j]);\n g[vec[j]].push_back(vec[j - 1]);\n }\n }\n return (g);\n}\n\n\n// 直線の進行方向の右側を残す\n// Polygon は反時計回りに与える\n// Line には一応向きがあるわけで\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\nPolygon convex_cut(const Polygon &U, Line l) {\n Polygon ret;\n for(int i = 0; i < U.size(); i++) {\n Point now = U[i], nxt = U[(i + 1) % U.size()];\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\n ret.push_back(crosspoint(Line(now, nxt), l));\n }\n }\n return (ret);\n}\n\n\n// 多角形の面積\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\nReal area2(const Polygon &p) {\n Real A = 0;\n for(int i = 0; i < p.size(); ++i) {\n A += cross(p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\n// 多角形と円の共通部分の面積\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\nReal area2(const Polygon &p, const Circle &c) {\n if(p.size() < 3) return 0.0;\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n Point va = c.p - a, vb = c.p - b;\n Real f = cross(va, vb), ret = 0.0;\n if(eq(f, 0.0)) return ret;\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\n if(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\n auto u = crosspoint(c, Segment(a, b));\n vector< Point > tot{a, u.first, u.second, b};\n for(int i = 0; i + 1 < tot.size(); i++) {\n ret += cross_area(c, tot[i], tot[i + 1]);\n }\n return ret;\n };\n Real A = 0;\n for(int i = 0; i < p.size(); i++) {\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\n// 凸多角形 g の直径を求めよ。ただし、凸多角形の直径とはその最遠頂点対間距離のことである.\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\nReal convex_diameter(const Polygon &p) {\n int N = (int) p.size();\n int is = 0, js = 0;\n for(int i = 1; i < N; i++) {\n if(p[i].imag() > p[is].imag()) is = i;\n if(p[i].imag() < p[js].imag()) js = i;\n }\n Real maxdis = norm(p[is] - p[js]);\n\n int maxi, maxj, i, j;\n i = maxi = is;\n j = maxj = js;\n do {\n if(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n j = (j + 1) % N;\n } else {\n i = (i + 1) % N;\n }\n if(norm(p[i] - p[j]) > maxdis) {\n maxdis = norm(p[i] - p[j]);\n maxi = i;\n maxj = j;\n }\n } while(i != is || j != js);\n return sqrt(maxdis);\n}\n\n\n// 平面上の n 個の点について、最も近い２点の距離.\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\nReal closest_pair(Points ps) {\n if(ps.size() <= 1) throw (0);\n sort(begin(ps), end(ps));\n\n auto compare_y = [&](const Point &a, const Point &b) {\n return imag(a) < imag(b);\n };\n vector< Point > beet(ps.size());\n const Real INF = 1e18;\n\n function< Real(int, int) > rec = [&](int left, int right) {\n if(right - left <= 1) return INF;\n int mid = (left + right) >> 1;\n auto x = real(ps[mid]);\n auto ret = min(rec(left, mid), rec(mid, right));\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n int ptr = 0;\n for(int i = left; i < right; i++) {\n if(abs(real(ps[i]) - x) >= ret) continue;\n for(int j = 0; j < ptr; j++) {\n auto luz = ps[i] - beet[ptr - j - 1];\n if(imag(luz) >= ret) break;\n ret = min(ret, abs(luz));\n }\n beet[ptr++] = ps[i];\n }\n return ret;\n };\n return rec(0, (int) ps.size());\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n double x, y; cin >> x >> y;\n Point p(x, y);\n\n Points ps(n);\n\n for (int i = 0; i < n; i++) {\n double px, py; cin >> px >> py;\n ps[i] = Point(px, py);\n }\n\n // 粘菌は，線分の集合とみなすことができる\n // (距離，頂点)\n using P = pair<double, int>;\n double inf = 1e18;\n vector<double> dist(n, inf);\n priority_queue<P, vector<P>, greater<P>> que;\n int cnt = 0;\n // 始め，すべての頂点間の距離を que へ突っ込む\n for (int i = 0; i < n; i++) {\n double d = distance(p, ps[i]);\n dist[i] = d;\n que.emplace(d, i);\n }\n\n vector<bool> used(n, false);\n double ans = 0.0;\n\n while (cnt < m) {\n \n double cost;\n int node;\n tie(cost, node) = que.top();\n que.pop();\n\n if (dist[node] < cost) continue;\n\n // 頂点を追加\n cnt++;\n // 確定した頂点の中で，一番近いやつを選ぶ\n int nxtNode = -1;\n double nxtNodeCost = distance(p, ps[node]);;\n for (int i = 0; i < n; i++) {\n if (!used[i]) continue;\n\n double tmp = distance(ps[i], ps[node]);\n if (nxtNodeCost > tmp) {\n nxtNodeCost = tmp;\n nxtNode = i;\n }\n }\n\n Point nxtPoint = p;\n if (nxtNode != -1) {\n nxtPoint = ps[nxtNode];\n }\n\n // 晴れて，線分が決まる\n // ps[node] と nxtPoint\n ans += distance(ps[node], nxtPoint);\n\n // node を確定させる\n used[node] = true;\n // cerr << \"node = \" << node + 1 << \", nxtNode = \" << nxtNode << endl;\n\n // まだ確定していない頂点と，この新しい線分の距離を計算して push\n Segment sg(ps[node], nxtPoint);\n for (int i = 0; i < n; i++) {\n if (used[i]) continue;\n double tmp = distance(sg, ps[i]);\n // cerr << \"to \" << i + 1 << \" \" << tmp << endl;\n if (dist[i] <= tmp) continue;\n dist[i] = tmp;\n que.emplace(tmp, i);\n }\n }\n\n // cout << ans << endl;\n printf(\"%.10f\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":950,"memory_kb":35956,"score_of_the_acc":-1.5226,"final_rank":17},{"submission_id":"aoj_2774_4471692","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\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};\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\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}\ndouble distanceSP(const L &s, const P &p) {\n if(dot(s[1]-s[0], p-s[0]) < EPS) return abs(p-s[0]);\n if(dot(s[0]-s[1], p-s[1]) < EPS) return abs(p-s[1]);\n return distanceLP(s, p);\n}\n\nint main(){\n int n,m,sx,sy;\n cin >> n >> m >> sx >> sy;\n VP p(n+1);\n p[0] = P(sx, sy);\n for(int i=1; i<n+1; i++){\n int x,y;\n cin >> x >> y;\n p[i] = P(x, y);\n }\n\n vector<double> dist(n+1, INF);\n for(int i=1; i<=n; i++){\n dist[i] = abs(p[i] -p[0]);\n }\n double ans = 0;\n for(int rep=0; rep<m; rep++){\n double minval = INF;\n int newidx = -1;\n for(int i=0; i<n+1; i++){\n if(dist[i] +EPS < minval){\n minval = dist[i];\n newidx = i;\n }\n }\n int nearidx = -1;\n minval = INF;\n for(int i=0; i<n+1; i++){\n if(dist[i] == INF and abs(p[newidx]-p[i]) +EPS < minval){\n nearidx = i;\n minval = abs(p[newidx]-p[i]);\n }\n }\n ans += abs(p[newidx] -p[nearidx]);\n dist[newidx] = INF;\n for(int i=0; i<n+1; i++){\n if(dist[i] == INF) continue;\n dist[i] = min(dist[i], distanceSP(L(p[newidx], p[nearidx]), p[i]));\n }\n }\n cout << fixed << setprecision(10);\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":580,"memory_kb":3420,"score_of_the_acc":-0.2948,"final_rank":7},{"submission_id":"aoj_2774_4096647","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\ndouble eps = 1e-6;\n\nsigned main(){\n ios::sync_with_stdio(false);\n\tcin.tie(0);\n cout << fixed << setprecision(20);\n\n int n,m;\n cin>>n>>m;\n double a[n+1],b[n+1];\n cin>>a[0] >> b[0];\n for(int i=1;i<=n;i++){\n cin>>a[i]>>b[i];\n }\n double ans = 0;\n bool used[n+1]={};\n used[0] =1;\n double dist[n+1]={};\n for(int i=1;i<=n;i++){\n dist[i] = sqrt((a[0]-a[i])*(a[0]-a[i]) + (b[0]-b[i])*(b[0]-b[i]));\n }\n while(m){\n double d=1e13;\n int f=-1;\n for(int i=1;i<=n;i++){\n if(used[i]) continue;\n if(d > eps + dist[i]){\n d = dist[i];\n f = i;\n }\n }\n double x1 = a[f],y2 = b[f];\n d = 1e13;\n int g = 0;\n for(int i=0;i<=n;i++){\n if(!used[i]) continue;\n double ret = (x1-a[i]) * (x1-a[i]) + (y2-b[i])*(y2-b[i]);\n ret = sqrt(ret);\n if(ret+eps < d){\n d = ret;\n g = i;\n }\n }\n ans += d;\n used[f]=1;\n m--;\n //cerr << \"a \"<<f << \" \" << g << endl;\n \n for(int i=1;i<=n;i++){\n if(used[i]) continue;\n double ret = 1e14;\n double x1=a[g],y1=b[g],x2=a[f],y2=b[f];\n d = 1e15;\n if(x1==x2){\n if(b[i]>=min(y1,y2) && b[i] <=max(y1,y2)){\n double ret = abs(a[i]-x1);\n if(d > ret+eps){\n d = ret;\n }\n }\n else{\n ret = (x1-a[i]) * (x1-a[i]) + (y1-b[i]) * (y1-b[i]);\n ret = min(ret, (x2-a[i])*(x2-a[i]) + (y2-b[i]) * (y2-b[i]));\n ret = sqrt(ret);\n if(ret+eps < d){\n d = ret;\n }\n }\n }\n else{\n ret = (x1-a[i]) * (x1-a[i]) + (y1-b[i]) * (y1-b[i]);\n ret = min(ret, (x2-a[i])*(x2-a[i]) + (y2-b[i]) * (y2-b[i]));\n ret = sqrt(ret);\n double k1 = x1*y2 - x2*y1;\n double k2 = a[i] * x1 - a[i]*x2 + y1*b[i] - y2*b[i];\n k2 *= (x1 - x2);\n k1 *= (y1 - y2);\n double K = k2 - k1;\n double c = K / ((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));\n if(c>=min(x1,x2) && c <= max(x1,x2)){\n double d = (y1-y2) / (x1-x2) * c + (x1*y2 - x2*y1)/(x1-x2);\n ret = (c-a[i]) * (c-a[i]) + (d-b[i]) * (d-b[i]);\n ret = sqrt(ret);\n }\n if(ret+eps < d){\n d = ret;\n }\n }\n dist[i] = min(dist[i],d);\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":300,"memory_kb":3400,"score_of_the_acc":-0.1147,"final_rank":3},{"submission_id":"aoj_2774_3967891","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\n// xy平面上の点(ベクトル)を表現するには、complex型を利用するとよい\ntypedef complex<double> P;\n\n// 辺の表現 (座標を2つ pair でもつ)\ntypedef pair<P, P> L;\n\n// 円の表現 (座標 P と 半径 d で表現する)\ntypedef pair<P, double> C;\n\n// 成分を取り出すのを簡単にする\n#define X real()\n#define Y imag()\n\n// 誤差(epsilon)の定義\n#define EPS (1e-10)\n\n// 2つの要素が等しいかどうか\n#define EQ(a,b) (abs((a) - (b)) < EPS)\n\n// 2つのベクトルが等しいかどうか\n#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )\n\n// m は n より大きい(以上)かどうか\n#define LE(n, m) ((n) < (m) + EPS)\n#define LEQ(n, m) ((n) <= (m) + EPS)\n\n// m は n より小さい(以下)かどうか\n#define GE(n, m) ((n) + EPS > (m))\n#define GEQ(n, m) ((n) + EPS >= (m))\n\n// 2つのベクトルの内積を求める\ndouble dot(P a, P b) {\n return (a.X * b.X + a.Y * b.Y);\n}\n\n// 2つのベクトルの外積を求める\ndouble cross(P a, P b) {\n return (a.X * b.Y - a.Y * b.X);\n}\n\n// ccw (c が直線(線分) ab に対してどのような位置関係か？)\n// Verified: AOJ CGL_1_C: Counter-Clockwise\n// +1 ... a → b で半時計方向に折れて b → c (COUNTER_CLOCKWISE)\n// -1 ... a → b で時計方向に折れて b → c (CLOCKWISE)\n// +2 ... c, a, b がこの順で同一直線状にある場合 (ONLINE_BACK)\n// -2 ... a, b, c がこの順で同一直線状にある場合 ( or a == b ) (ONLINE_FRONT)\n// 0 ... c が線分 ab 上にある場合 (点 a, b 上を含む) (ON_SEGMENT)\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if( cross(b,c) > EPS ) return +1;\n if( cross(b,c) < -EPS ) return -1;\n if( dot(b,c) < 0 ) return +2;\n if( norm(b) < norm(c) ) return -2;\n return 0;\n}\n\n// 点 a1, a2 を端点とする線分と点 b との距離\ndouble dist_sp(P a1, P a2, P b) {\n if( dot(a2-a1, b-a1) < EPS ) return abs(b - a1);\n if( dot(a1-a2, b-a2) < EPS ) return abs(b - a2);\n return abs( cross(a2-a1, b-a1) ) / abs(a2 - a1);\n}\n\nint main() {\n int N, M; cin >> N >> M;\n vector<P> points(N+1);\n for(int i=0; i<N+1; i++) {\n int x, y; cin >> x >> y;\n points[i] = P(x, y);\n }\n\n vector<bool> selected(N+1, false);\n selected[0] = true;\n vector<double> dist(N+1, INF), pdist(N+1, INF), best(N+1, -1);\n for(int i=1; i<=N; i++) {\n double x = points[0].real() - points[i].real();\n double y = points[0].imag() - points[i].imag();\n dist[i] = sqrt(x*x + y*y);\n pdist[i] = dist[i];\n best[i] = 0;\n }\n\n double ans = 0;\n for(int i=0; i<M; i++) {\n double min_val = INF; int argmin = -1;\n for(int k=1; k<=N; k++) {\n if(selected[k]) continue;\n // fprintf(stderr, \"k = %d, dist = %.12f\\n\", k, dist[k]);\n if(min_val > dist[k]) {\n min_val = dist[k];\n argmin = k;\n }\n }\n\n ans += pdist[argmin];\n selected[argmin] = true;\n\n // argmin と best[argmin] で辺ができる\n // 辺との距離\n int u = argmin, v = best[argmin];\n // fprintf(stderr, \"u = %d, v = %d\\n\", u, v);\n for(int k=0; k<=N; k++) {\n double cost = dist_sp(points[u], points[v], points[k]);\n if(dist[k] > cost) {\n dist[k] = cost;\n }\n }\n\n // 頂点との距離\n // 誰とつなぐのが最も近いかも更新\n for(int k=0; k<=N; k++) {\n double x = points[argmin].real() - points[k].real();\n double y = points[argmin].imag() - points[k].imag();\n\n double cost = sqrt(x*x + y*y);\n dist[k] = min(dist[k], cost);\n\n if(pdist[k] > cost) {\n pdist[k] = cost;\n best[k] = argmin;\n }\n }\n }\n printf(\"%.12f\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":560,"memory_kb":3404,"score_of_the_acc":-0.2815,"final_rank":6},{"submission_id":"aoj_2774_3844897","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nstruct Vector {\n\tint x, y;\n\tint cross(const Vector that) const { return x * that.y - y * that.x; }\n\tint dot(const Vector that) const { return x * that.x + y * that.y; }\n};\nstruct Point {\n\tint x, y;\n\tdouble distance(const Point that) const {\n\t\treturn std::sqrt((x - that.x) * (x - that.x) + (y - that.y) * (y - that.y));\n\t}\n\tVector operator-(const Point& that) const {\n\t\treturn Vector{ x - that.x, y - that.y };\n\t}\n};\nstruct Edge {\n\tPoint from, to;\n\tbool has_catheti(const Point& that) const {\n\t\treturn (to - from).dot(that - from) >= 0 && (from - to).dot(that - to) >= 0;\n\t}\n\tdouble catheti_length(const Point& that) const {\n\t\treturn std::abs((to.y - from.y) * that.x - (to.x - from.x) * that.y + to.x * from.y - to.y * from.x) / std::sqrt((to.y - from.y) * (to.y - from.y) + (to.x - from.x) * (to.x - from.x));\n\t}\n\tdouble length() const { return from.distance(to); }\n};\nint main() {\n\tint n, m, x, y; std::cin >> n >> m >> x >> y;\n\tstd::vector<Point> points(n + 1); points[0] = Point{ x, y };\n\tfor (auto i = 1; i <= n; ++i) std::cin >> points[i].x >> points[i].y;\n\tstd::vector<double> nearest_distance_to_point(n + 1, DBL_MAX), nearest_distance_to_edge(n + 1, DBL_MAX);\n\tstd::vector<int> nearest_point(n + 1, 0);\n\tstd::vector<int> rest(n + 1, -1); for (auto i = 0; i < n; ++i) rest[i] = i + 1;\n\tauto comparator = [](const std::pair<int, double>& a, const std::pair<int, double>& b) { return (std::abs(a.second - b.second) < 0.0000000001) ? a.first > b.first : a.second > b.second; };\n\tstd::priority_queue<std::pair<int, double>, std::vector<std::pair<int, double>>, decltype(comparator)> queue(comparator);\n\tfor (auto i = 1; i <= n; ++i) {\n\t\tnearest_distance_to_point[i] = points[0].distance(points[i]);\n\t\tqueue.emplace(i, nearest_distance_to_point[i]);\n\t\tif (nearest_distance_to_point[0] < nearest_distance_to_point[i]) {\n\t\t\tnearest_distance_to_point[0] = nearest_distance_to_point[i];\n\t\t\tnearest_point[0] = i;\n\t\t}\n\t}\n\tdouble result = 0;\n\tfor (auto c = 0; c < m; ++c) {\n\t\twhile (nearest_point[queue.top().first] == -1) queue.pop();\n\t\tauto top = queue.top(); queue.pop();\n\t\tauto edge = Edge{ points[top.first], points[nearest_point[top.first]] };\n\t\tresult += nearest_distance_to_point[top.first];\n\t\tnearest_point[top.first] = -1;\n\t\tfor (auto i = 0; i < n - c - 1; ++i) {\n\t\t\tif (rest[i] == top.first) {\n\t\t\t\trest[i] = rest[n - c - 1];\n\t\t\t}\n\t\t\tauto distance = points[top.first].distance(points[rest[i]]);\n\t\t\tif (nearest_distance_to_point[rest[i]] > distance) {\n\t\t\t\tnearest_distance_to_point[rest[i]] = distance;\n\t\t\t\tnearest_point[rest[i]] = top.first;\n\t\t\t\tif (nearest_distance_to_edge[rest[i]] > distance) {\n\t\t\t\t\tnearest_distance_to_edge[rest[i]] = distance;\n\t\t\t\t\tqueue.emplace(rest[i], distance);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (edge.has_catheti(points[rest[i]])) {\n\t\t\t\tauto d = edge.catheti_length(points[rest[i]]);\n\t\t\t\tif (nearest_distance_to_edge[rest[i]] > d) {\n\t\t\t\t\tnearest_distance_to_edge[rest[i]] = d;\n\t\t\t\t\tqueue.emplace(rest[i], d);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tstd::cout << std::setprecision(15) << std::fixed << result << std::endl;\n}","accuracy":1,"time_ms":130,"memory_kb":35880,"score_of_the_acc":-0.9946,"final_rank":14},{"submission_id":"aoj_2774_2917956","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\"; return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \" \";} return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \"{ \"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \":\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \", \"; } out << \" }\"; return out; }\n\n/*\n <url:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2774>\n 問題文============================================================\n =================================================================\n 解説=============================================================\n \n prim法の要領で辺を追加するたびに、各頂点への最短距離を更新していけば良い\n ================================================================\n */\ntypedef double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-9, pi = acos(-1.0);\nnamespace std {\n bool 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}\n\nclass Line {\npublic:\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 Point operator[](const int _num) {\n if (_num == 0) return a;\n else if (_num == 1) return b;\n else assert(false);\n }\n};\n\nld dot(Point a, Point b) { return real(conj(a)*b); }\nPoint proj(Line l, Point p) {\n ld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + t * (l.a - l.b);\n}\nbool isis_sp(Line s, Point p) {\n return (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\nld dist_sp(Line s, Point p) {\n Point r = proj(s, p);\n return isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\n}\n\nvoid solve() {\n int N, M, X, Y; cin >> N >> M >> X >> Y;\n vector<int> flag(N+1, 0);\n vector<Point> ps(N+1);\n ps[0] = Point(X, Y); flag[0] = 1;\n for (int i = 1; i <= N; i++) {\n int a, b; cin >> a >> b;\n ps[i] = Point(a, b);\n }\n \n ld ans = 0;\n vector<double> dist(N + 1, LINF);\n for (int i = 0; i <= N; i++) {\n dist[i] = abs(ps[i] - ps[0]);\n }\n for (int i = 0; i < M; i++) {\n ld len = LINF;\n int idx = -1;\n for (int i = 0; i <= N; i++) {\n if (flag[i] == 1) continue;\n if (len > dist[i]) {\n len = dist[i];\n idx = i;\n }\n }\n \n len = LINF;\n int pidx = -1;\n for (int i = 0; i <= N; i++) {\n if (flag[i] == 1) {\n ld d = abs(ps[i] - ps[idx]);\n if (len > d) {\n len = d;\n pidx = i;\n }\n }\n }\n ans += abs(ps[idx] - ps[pidx]);\n flag[idx] = 1;\n Line L(ps[idx], ps[pidx]);\n for (int i = 0; i <= N; i++) {\n if (flag[i] == 1) continue;\n dist[i] = min(dist[i], dist_sp(L, ps[i]));\n }\n }\n cout << fixed << setprecision(12) << ans << endl;\n}\n\nint main() {\n cin.tie(0); ios_base::sync_with_stdio(false);\n solve();\n return 0;\n}","accuracy":1,"time_ms":1200,"memory_kb":3448,"score_of_the_acc":-0.6931,"final_rank":10},{"submission_id":"aoj_2774_2720555","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 5001\n\nstruct Point{\n double x,y;\n};\n\ntypedef Point Vector;\n\nstruct Line{\n void set(double x1,double y1,double x2,double y2){\n p1.x = x1;\n p1.y = y1;\n p2.x = x2;\n p2.y = y2;\n }\n Point p1,p2;\n};\n\ntypedef Line Segment;\n\nint N,M;\nbool is_nenkin[NUM];\nPoint point[NUM];\ndouble min_dist[NUM];\nint index[NUM];\n\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p2,l.p1),calc_minus(p,l.p1))/calc_len(calc_minus(l.p2,l.p1)));\n}\n\ndouble getDistanceSP(Segment s,Point p){\n\tif(dot(calc_minus(s.p2,s.p1),calc_minus(p,s.p1)) < 0.0)return calc_len(calc_minus(p,s.p1));\n\tif(dot(calc_minus(s.p1,s.p2),calc_minus(p,s.p2)) < 0.0)return calc_len(calc_minus(p,s.p2));\n\treturn getDistanceLP(s,p);\n}\n\n\ndouble calc_dist(int from,int to){\n\treturn sqrt((point[from].x-point[to].x)*(point[from].x-point[to].x)+(point[from].y-point[to].y)*(point[from].y-point[to].y));\n}\n\n\nint main(){\n\n\tscanf(\"%d %d %lf %lf\",&N,&M,&point[0].x,&point[0].y);\n\n\tis_nenkin[0] = true;\n\tmin_dist[0] = 0;\n\n\tfor(int i = 1; i <= N; i++){\n\t\tis_nenkin[i] = false;\n\t\tmin_dist[i] = DBL_MAX;\n\t\tscanf(\"%lf %lf\",&point[i].x,&point[i].y);\n\t}\n\n\tint next;\n\tdouble minimum = DBL_MAX,tmp_dist;\n\n\tfor(int i = 1; i <= N; i++){\n\t\ttmp_dist = calc_dist(0,i);\n\t\tif(minimum > tmp_dist){\n\t\t\tminimum = tmp_dist;\n\t\t\tnext = i;\n\t\t}\n\t}\n\n\tvector<int> Group;\n\n\tdouble ans = minimum;\n\tis_nenkin[next] = true;\n\tGroup.push_back(0);\n\tGroup.push_back(next);\n\n\tLine first_line;\n\tfirst_line.set(point[0].x,point[0].y,point[next].x,point[next].y);\n\n\tminimum = DBL_MAX;\n\tfor(int i = 1; i <= N; i++){\n\t\tif(is_nenkin[i])continue;\n\t\ttmp_dist = getDistanceSP(first_line,point[i]);\n\t\tmin_dist[i] = tmp_dist;\n\t}\n\n\tint count = 1,from;\n\n\twhile(count < M){\n\n\t\tminimum = DBL_MAX;\n\t\tfor(int i = 1; i <= N; i++){\n\t\t\tif(is_nenkin[i])continue;\n\t\t\tif(minimum > min_dist[i]){\n\t\t\t\tminimum = min_dist[i];\n\t\t\t\tnext = i;\n\t\t\t}\n\t\t}\n\n\t\tminimum = DBL_MAX;\n\t\tfor(int i = 0; i < Group.size(); i++){\n\t\t\ttmp_dist = calc_dist(next,Group[i]);\n\t\t\tif(minimum > tmp_dist){\n\t\t\t\tminimum = tmp_dist;\n\t\t\t\tfrom = Group[i];\n\t\t\t}else if(fabs(minimum-tmp_dist) < EPS){\n\t\t\t\tif(from > Group[i]){\n\t\t\t\t\tfrom = Group[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tans += minimum;\n\t\tcount++;\n\t\tif(count == M)break;\n\n\t\tis_nenkin[next] = true;\n\t\tGroup.push_back(next);\n\t\tLine new_line;\n\t\tnew_line.set(point[from].x,point[from].y,point[next].x,point[next].y);\n\n\t\tfor(int i = 1; i <= N; i++){\n\t\t\tif(is_nenkin[i])continue;\n\n\t\t\tmin_dist[i] = min(min_dist[i],getDistanceSP(new_line,point[i]));\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":250,"memory_kb":3404,"score_of_the_acc":-0.0828,"final_rank":1},{"submission_id":"aoj_2774_2559902","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 1120000000\n\nusing P = pair<int,int>;\n\nlong dist(P &a, P &b){\n long x=a.fi-b.fi;\n long y=a.se-b.se;\n return x*x+y*y;\n}\n\ndouble dist(P &a, P &b, P &c){\n long ipa = (b.fi-a.fi)*(c.fi-a.fi) + (b.se-a.se)*(c.se-a.se);\n long ipb = (a.fi-b.fi)*(c.fi-b.fi) + (a.se-b.se)*(c.se-b.se);\n if(ipa<=0 || ipb<=0) return min(dist(a,c), dist(b,c));\n else {\n long outacab = (c.fi-a.fi)*(b.se-a.se) - (c.se-a.se)*(b.fi-a.fi);\n return (double)outacab*outacab / dist(a,b);\n }\n}\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<P> p(n+1);\n cin>>p[0].fi>>p[0].se;\n rep(i,1,n+1) cin>>p[i].fi>>p[i].se;\n\n n++;\n\n vector<bool> used(n, false);\n used[0]=true;\n vector<double> dd(n); // dist^2\n rep(i,n) dd[i] = dist(p[0],p[i]);\n dd[0] = INF;\n\n double ans = 0;\n rep(_,m){\n int cand = 0;\n rep(j,1,n) if(!used[j] && dd[cand] > dd[j]) cand = j;\n\n double add = INF;\n int from = 0;\n rep(j,n) if(used[j] && dist(p[cand], p[j]) < add) from=j, add = dist(p[cand], p[j]);\n\n ans += sqrt(add);//dbg(add,from);\n used[cand] = true;\n\n rep(j,n) if(!used[j]) dd[j] = min<double>(dd[j], dist(p[cand], p[from], p[j]));\n }\n\n printf(\"%.10f\\n\", ans);\n\n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":3248,"score_of_the_acc":-0.1229,"final_rank":4},{"submission_id":"aoj_2774_2559901","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 1120000000\n\nusing P = pair<int,int>;\n\nlong dist(P &a, P &b){\n long x=a.fi-b.fi;\n long y=a.se-b.se;\n return x*x+y*y;\n}\n\ndouble dist(P &a, P &b, P &c){\n long ipa = (b.fi-a.fi)*(c.fi-a.fi) + (b.se-a.se)*(c.se-a.se);\n long ipb = (a.fi-b.fi)*(c.fi-b.fi) + (a.se-b.se)*(c.se-b.se);\n if(ipa<=0 || ipb<=0) return min(dist(a,c), dist(b,c));\n else {\n long outacab = (c.fi-a.fi)*(b.se-a.se) - (c.se-a.se)*(b.fi-a.fi);\n return (double)outacab*outacab / dist(a,b);\n }\n}\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<P> p(n+1);\n cin>>p[0].fi>>p[0].se;\n rep(i,1,n+1) cin>>p[i].fi>>p[i].se;\n\n n++;\n\n vector<bool> used(n, false);\n used[0]=true;\n vector<int> dd(n); // dist^2\n rep(i,n) dd[i] = dist(p[0],p[i]);\n dd[0] = INF;\n\n double ans = 0;\n rep(_,m){\n int cand = 0;\n rep(j,1,n) if(!used[j] && dd[cand] > dd[j]) cand = j;\n\n double add = INF;\n int from = 0;\n rep(j,n) if(used[j] && dist(p[cand], p[j]) < add) from=j, add = dist(p[cand], p[j]);\n\n ans += sqrt(add);//dbg(add,from);\n used[cand] = true;\n\n rep(j,n) if(!used[j]) dd[j] = min<int>(dd[j], dist(p[cand], p[from], p[j]));\n }\n\n printf(\"%.10f\\n\", ans);\n\n return 0;\n}","accuracy":0.5,"time_ms":260,"memory_kb":3212,"score_of_the_acc":-0.0833,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_2774_10858226\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing LL = long long; using ll = LL;\\nusing PII = pair<int, int>; using pii = PII;\\nusing PLL = pair<LL, LL>; using pll = PLL;\\nusing VI = vector<int>; using VL = vector<LL>;\\nconst ll LINF = 1e18;\\nconst int INF = 1e9;\\n#define FOR(i,s,t) for(int i =s; i < t;i++)\\n#define SZ(a) (int)a.size()\\n#define ALL(a) a.begin(),a.end()\\n\\ntypedef double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-9, pi = acos(-1.0);\\nnamespace std {\\n\\tbool operator < (const Point& lhs, const Point& rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() < rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() :a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) :a(a), b(b) {}\\n\\tPoint operator[](const int _num) {\\n\\t\\tif (_num == 0) return a;\\n\\t\\telse if (_num == 1) return b;\\n\\t}\\n};\\n\\nld dot(Point a, Point b) { return real(conj(a)*b); }\\nPoint proj(Line l, Point p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\nbool isis_sp(Line s, Point p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\nld dist_sp(Line s, Point p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\nvoid solve() {\\n\\tint N, M, X, Y; cin >> N >> M >> X >> Y;\\n\\tvector<int> flag(N+1, 0);\\n\\tvector<Point> ps(N+1);\\n\\tps[0] = Point(X, Y); flag[0] = 1;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tint a, b; cin >> a >> b;\\n\\t\\tps[i] = Point(a, b);\\n\\t}\\n\\n\\tld ans = 0;\\n\\tvector<double> dist(N + 1, LINF);\\n\\tfor (int i = 0; i <= N; i++) {\\n\\t\\tdist[i] = abs(ps[i] - ps[0]);\\n\\t}\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tld len = LINF;\\n\\t\\tint idx = -1;\\n\\t\\tfor (int i = 0; i <= N; i++) {\\n\\t\\t\\tif (flag[i] == 1) continue;\\n\\t\\t\\tif (len > dist[i]) {\\n\\t\\t\\t\\tlen = dist[i];\\n\\t\\t\\t\\tidx = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tlen = LINF;\\n\\t\\tint pidx = -1;\\n\\t\\tfor (int i = 0; i <= N; i++) {\\n\\t\\t\\tif (flag[i] == 1) {\\n\\t\\t\\t\\tld d = abs(ps[i] - ps[idx]);\\n\\t\\t\\t\\tif (len > d) {\\n\\t\\t\\t\\t\\tlen = d;\\n\\t\\t\\t\\t\\tpidx = i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans += abs(ps[idx] - ps[pidx]);\\n\\t\\tflag[idx] = 1;\\n\\t\\tLine L(ps[idx], ps[pidx]);\\n\\t\\tfor (int i = 0; i <= N; i++) {\\n\\t\\t\\tif (flag[i] == 1) continue;\\n\\t\\t\\tdist[i] = min(dist[i], dist_sp(L, ps[i]));\\n\\t\\t}\\n\\n\\t}\\n\\tcout << fixed << setprecision(12) << ans << endl;\\n}\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(false);\\n\\n\\tsolve();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1110,\n \"memory_kb\": 3696,\n \"score_of_the_acc\": -0.6429,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2774_9640371\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n\\nusing namespace std;\\n#define ld long double\\nconst ld EPS = 1e-8;\\nconst int N = 5010;\\n\\nstruct Point {\\n int x, y;\\n\\n Point (int x1 = 0, int y1 = 0) {\\n x = x1, y = y1;\\n }\\n};\\n\\nstruct Vector {\\n int x, y;\\n\\n Vector(Point a, Point b) {\\n x = b.x - a.x, y = b.y - a.y;\\n }\\n\\n ld len() {\\n return sqrtl(x * x + y * y);\\n }\\n\\n int dot_prod(Vector v1) {\\n return x * v1.x + y * v1.y;\\n }\\n\\n int cross_prod(Vector v1) {\\n return x * v1.y - y * v1.x;\\n }\\n};\\n\\nld dist_point_point(Point a, Point b) {\\n Vector ab(a, b);\\n return ab.len();\\n}\\n\\nld dist_edg_point(Point a, Point b, Point p) {\\n Vector ab(a, b), ba(b, a), ap(a, p), bp(b, p);\\n if(ab.dot_prod(ap) < 0) return ap.len();\\n if(ba.dot_prod(bp) < 0) return bp.len();\\n return abs(ab.cross_prod(ap) / ab.len());\\n}\\n\\nint n, m;\\nbool usd[N];\\nPoint a[N];\\nld ans = 0, d[N];\\n\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"inp.txt\\\", \\\"r\\\", stdin);\\n freopen(\\\"out.txt\\\", \\\"w\\\", stdout);\\n#endif\\n cin >> n >> m >> a[0].x >> a[0].y;\\n for(int i = 1; i <= n; ++i) {\\n cin >> a[i].x >> a[i].y;\\n d[i] = dist_point_point(a[0], a[i]);\\n }\\n usd[0] = true;\\n for(int i = 0; i < m; ++i) {\\n int opt = -1;\\n for(int j = 1; j <= n; ++j) {\\n if(usd[j]) continue;\\n if(opt == -1 || d[j] < d[opt] - EPS) opt = j;\\n }\\n int opt_usd = 0;\\n for(int j = 0; j <= n; ++j) {\\n if(usd[j]) {\\n if(dist_point_point(a[j], a[opt]) < dist_point_point(a[opt_usd], a[opt])) {\\n opt_usd = j;\\n }\\n }\\n }\\n ans += dist_point_point(a[opt], a[opt_usd]);\\n usd[opt] = true;\\n for(int j = 1; j <= n; ++j) {\\n if(!usd[j]) {\\n d[j] = min(d[j], dist_edg_point(a[opt], a[opt_usd], a[j]));\\n }\\n }\\n }\\n cout.precision(11);\\n cout << fixed << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.1793,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2774_9522006\",\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) { return (ull)rng() % B; }\\n\\n// https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/all\\n////////////////////////////////////////////////////////////////////////////////\\ntypedef double Real;\\nconst Real eps = 1e-8; // 1000 : 10^-8, 10000 : 10^-7\\ninline int sgn(Real a, Real b = 0) { return (a - b < -eps) ? -1 : (a - b > eps) ? 1 : 0; }\\ninline Real _sqrt(Real a) { return sqrt(max(a, (Real)0)); }\\nstruct Point {\\n Real x, y;\\n Point() {}\\n Point(Real x, Real y) : x(x), y(y) {}\\n Point &operator-=(const Point &p) {\\n x -= p.x;\\n y -= p.y;\\n return *this;\\n }\\n Point &operator+=(const Point &p) {\\n x += p.x;\\n y += p.y;\\n return *this;\\n }\\n Point &operator*=(Real d) {\\n x *= d;\\n y *= d;\\n return *this;\\n }\\n Point &operator/=(Real d) {\\n x /= d;\\n y /= d;\\n return *this;\\n }\\n Point operator+(const Point &p) const {\\n Point res(*this);\\n return res += p;\\n }\\n Point operator-(const Point &p) const {\\n Point res(*this);\\n return res -= p;\\n }\\n Point operator*(Real d) const {\\n Point res(*this);\\n return res *= d;\\n }\\n Point operator/(Real d) const {\\n Point res(*this);\\n return res /= d;\\n }\\n bool operator<(const Point &p) const {\\n return (sgn(x, p.x) < 0 or (sgn(x, p.x) == 0 and sgn(y, p.y) < 0));\\n }\\n bool operator==(const Point &p) const { return (sgn(x - p.x) == 0 and sgn(y - p.y) == 0); }\\n friend istream &operator>>(istream &is, Point &p) {\\n is >> p.x >> p.y;\\n return (is);\\n }\\n Real norm() { return _sqrt(x * x + y * y); }\\n Real norm2() { return (x * x + y * y); }\\n Point vec() { return (*this); }\\n Point unit() { return (*this) / this->norm(); } // 単位ベクトル\\n Point rotate(Real theta) {\\n return {x * cos(theta) - y * sin(theta), x * sin(theta) + y * cos(theta)};\\n }\\n Point perpendicular() { return {-y, x}; }\\n Point normal() { return perpendicular().unit(); } // 法線ベクトル\\n};\\n\\nPoint vec(Point a, Point b) { return (b - a); }\\nReal dist(Point a, Point b) { return vec(a, b).norm(); }\\nReal dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }\\nReal cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }\\n\\n// 線分\\nstruct Segment : array<Point, 2> {\\n Segment() {}\\n Segment(Point a, Point b) { at(0) = a, at(1) = b; }\\n Point vec() { return (at(1) - at(0)); }\\n Real length() { return vec().norm(); }\\n friend istream &operator>>(istream &is, Segment &s) {\\n is >> s[0] >> s[1];\\n return (is);\\n }\\n};\\n// 直線\\nstruct Line : Segment {\\n Line() {}\\n Line(Point a, Point b) : Segment(a, b) {}\\n Line(Segment s) : Line(s[0], s[1]) {}\\n};\\n\\nint ccw(Point a, Point b, Point c) {\\n b -= a, c -= a;\\n if (sgn(cross(b, c)) == 1) return 1; // a,b,c 反時計回り\\n if (sgn(cross(b, c)) == -1) return -1; // a,b,c 時計周り\\n if (sgn(dot(b, c)) == -1) return 2; // c,a,b 一直線上\\n if (sgn(c.norm() - b.norm()) == 1) return -2; // a,b,c 一直線上\\n return 0; // a,c,b 一直線上\\n}\\n\\n// 垂直判定\\ntemplate <typename T> bool is_orthogonal(T s, T t) { return sgn(dot(s.vec(), t.vec())) == 0; }\\n// 並行判定\\ntemplate <typename T> bool is_parallel(T s, T t) { return sgn(cross(s.vec(), t.vec())) == 0; }\\n// 同一直線判定\\ntemplate <typename T> bool is_same_line(T s, T t) {\\n return abs(ccw(s[0], s[1], t[0])) != 1 and abs(ccw(s[0], s[1], t[1])) != 1;\\n}\\n// 線分上の点判定\\nbool is_on_segment(Point p, Segment l) { return ccw(l[0], l[1], p) == 0; }\\n// 線分の交差判定(AOJ-2172)\\nbool is_intersect(Segment s, Segment t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 and\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\n// 2直線の交点(AOJ-2596)\\npair<bool, Point> line_intersection(Line s, Line t) {\\n if (is_same_line(s, t)) return {true, s[0]};\\n else if (is_parallel(s, t)) return {false, Point()};\\n else return {true, s[0] + s.vec() * cross(t[0] - s[0], t.vec()) / cross(s.vec(), t.vec())};\\n}\\n// 2線分の交点\\npair<bool, Point> segment_intersection(Segment s, Segment t) {\\n if (is_same_line(s, t)) {\\n if (is_on_segment(s[0], t)) return {true, s[0]};\\n else if (is_on_segment(s[1], t)) return {true, s[1]};\\n else if (is_on_segment(t[0], s)) return {true, t[0]};\\n else return {false, Point()};\\n }\\n if (!is_intersect(s, t)) return {false, Point()};\\n else return line_intersection(Line(s), Line(t));\\n}\\n// 点と直線の距離\\nReal point_line_distance(Point p, Line l) { return abs(cross(p - l[0], l.vec())) / l.length(); }\\n// 点と線分の距離\\nReal point_segment_distance(Point p, Segment l) {\\n if (sgn(dot(p - l[0], l.vec())) == -1) return dist(p, l[0]);\\n else if (sgn(dot(p - l[1], l.vec())) == 1) return dist(p, l[1]);\\n else return point_line_distance(p, l);\\n}\\n// 線分と線分の距離(AOJ-1157)\\nReal segment_segment_distance(Segment s, Segment t) {\\n if (is_intersect(s, t)) return 0;\\n double res = point_segment_distance(s[0], t);\\n res = min(res, point_segment_distance(s[1], t));\\n res = min(res, point_segment_distance(t[0], s));\\n res = min(res, point_segment_distance(t[1], s));\\n return res;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n, m;\\n cin >> n >> m;\\n vector<Point> p(n + 1);\\n vector<double> dist(n + 1);\\n vector<bool> used(n + 1);\\n for (int i = 0; i <= n; ++i) {\\n cin >> p[i];\\n }\\n used[0] = true;\\n for (int i = 0; i <= n; ++i) {\\n dist[i] = (p[0] - p[i]).norm();\\n }\\n double res = 0;\\n for (int i = 0; i < m; ++i) {\\n int idx = -1;\\n for (int j = 0; j <= n; ++j) {\\n if (used[j]) continue;\\n if (idx == -1) idx = j;\\n if (dist[j] < dist[idx]) idx = j;\\n }\\n int base = -1;\\n double cost = 1e9;\\n for (int j = 0; j <= n; ++j) {\\n if (!used[j]) continue;\\n double d = (p[j] - p[idx]).norm();\\n if (d < cost) {\\n cost = d;\\n base = j;\\n }\\n }\\n res += cost;\\n used[idx] = true;\\n Segment s = Segment(p[base], p[idx]);\\n for (int j = 0; j <= n; ++j) {\\n dist[j] = min(dist[j], point_segment_distance(p[j], s));\\n }\\n }\\n printf(\\\"%.9f\\\\n\\\", res);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.0843,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2774_5533669\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// arg(x) : argment,[-PI,PI]\\nusing CP = complex<long double>;\\n#define X real()\\n#define Y imag()\\nconst long double PI = acos(-1.0L);\\nconst long double EPS = 1e-10;\\nbool operator==(const CP &l, const CP &r) { return norm(l - r) <= EPS; }\\nstruct Circle {\\n CP o;\\n long double r;\\n Circle(long double _x = 0.0L, long double _y = 0.0L, long double _r = 0.0L)\\n : o(CP(_x, _y)), r(_r) {}\\n Circle(CP _o, long double _r = 0.0) : o(_o), r(_r) {}\\n bool operator<(const Circle &cr) const { return r < cr.r; }\\n};\\n\\nstruct Line {\\n CP s, t;\\n Line(long double sx = 0.0L, long double sy = 0.0L, long double tx = 0.0L,\\n long double ty = 0.0L)\\n : s(CP(sx, sy)), t(CP(tx, ty)) {}\\n Line(CP _s, CP _t) : s(_s), t(_t) {}\\n};\\n\\n// cos a\\nlong double costh(const long double &a, const long double &b,\\n const long double &c) {\\n return (b * b - a * a + c * c) / (2.0L * b * c);\\n}\\n\\n// dot(a,b) = |a||b|cos x\\nlong double dot(const CP &a, const CP &b) { return (conj(a) * b).X; }\\n// cross(a,b) : area of parallelogram\\n// sign : a-> b ,counter clockwise? + : -\\nlong double cross(const CP &a, const CP &b) { return (conj(a) * b).Y; }\\nlong double corner(const CP &a, const CP &b) {\\n //[0,PI]\\n return acos(dot(a, b) / (abs(a) * abs(b)));\\n}\\n\\nCP projectionLP(const CP &s, const CP &t, const CP &p) {\\n if (s == t) return s;\\n CP base = t - s;\\n long double r = dot(p - s, base) / norm(base);\\n return s + base * r;\\n}\\nCP projectionLP(const Line &l, const CP &p) {\\n return projectionLP(l.s, l.t, p);\\n}\\n\\nCP reflectionLP(const CP &s, const CP &t, const CP &p) {\\n CP tmp = (projectionLP(s, t, p) - p);\\n tmp *= 2;\\n return p + tmp;\\n}\\nCP reflectionLP(const Line &l, const CP &p) {\\n return reflectionLP(l.s, l.t, p);\\n}\\n\\nint calc_clockwiseSP(const CP &s, CP t, CP p) {\\n t -= s;\\n p -= s;\\n if (cross(t, p) > EPS) return 1; // \\\"COUNTER_CLOCKWISE\\\"\\n if (cross(t, p) < -EPS) return -1; //\\\"CLOCK_WISE\\\"\\n if (dot(t, p) < 0) return 2; // \\\"ONLINE_BACK\\\"\\n if (norm(t) < norm(p)) return -2; // \\\"ONLINE_FRONT\\\"\\n return 0; // \\\"ON_SEGMENT\\\"\\n}\\nint calc_clockwiseSP(const Line &l, const CP &p) {\\n return calc_clockwiseSP(l.s, l.t, p);\\n}\\n\\nint parallel_orthogonalLL(const CP &s, CP t, const CP &a, CP b) {\\n t -= s;\\n b -= a;\\n if (abs(cross(t, b)) <= EPS) return 2; // \\\"parallel\\\"\\n if (abs(dot(t, b)) <= EPS) return 1; // \\\"orthogonal\\\"\\n return 0;\\n}\\nint parallel_orthogonalLL(const Line &ll, const Line &lr) {\\n return parallel_orthogonalLL(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\nCP intersectionLL(const CP &a, const CP &b, const CP &c, const CP &d) {\\n return a + (b - a) * (cross(d - c, c - a) / cross(d - c, b - a));\\n}\\nCP intersectionLL(const Line &ll, const Line &lr) {\\n return intersectionLL(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\nbool on_segSP(const CP &s, const CP &t, const CP &p) {\\n // if not use end point, dot(s - p, t - p) < 0\\n return abs(cross(s - p, t - p)) <= EPS && dot(s - p, t - p) <= 0;\\n}\\nbool on_segSP(const Line &l, const CP &p) { return on_segSP(l.s, l.t, p); }\\n\\n// crossing segments? (a,b) and (c,d)\\nbool iscrossSS(const CP &a, const CP &b, const CP &c, const CP &d) {\\n // parallel\\n if (abs(cross(a - b, c - d)) <= EPS) {\\n return on_segSP(a, b, c) || on_segSP(a, b, d) || on_segSP(c, d, a) ||\\n on_segSP(c, d, b);\\n }\\n CP isp = intersectionLL(a, b, c, d);\\n return on_segSP(a, b, isp) && on_segSP(c, d, isp);\\n}\\nbool iscrossSS(const Line &ll, const Line &lr) {\\n return iscrossSS(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\nlong double distLP(const CP &s, const CP &t, const CP &p) {\\n return abs(cross(t - s, p - s) / abs(t - s));\\n}\\nlong double distLP(const Line &l, const CP &p) { return distLP(l.s, l.t, p); }\\n\\nlong double distSP(const CP &s, const CP &t, const CP &p) {\\n if (dot(t - s, p - s) < 0) return abs(p - s);\\n if (dot(s - t, p - t) < 0) return abs(p - t);\\n return distLP(s, t, p);\\n}\\nlong double distSP(const Line &l, const CP &p) { return distSP(l.s, l.t, p); }\\n\\nusing P = pair<long double, int>;\\n\\nint n, m;\\nvector<CP> v;\\n\\nlong double solve();\\n\\nint main() {\\n cin >> n >> m, ++n;\\n for (int i = 0; i < n; ++i) {\\n int x, y;\\n cin >> x >> y;\\n v.emplace_back(x, y);\\n }\\n cout << fixed << setprecision(10);\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nlong double solve() {\\n vector<long double> memo(n, 1e10);\\n for (int i = 1; i < n; ++i) memo[i] = abs(v[i] - v[0]);\\n memo[0] = -1;\\n long double res = 0;\\n while (m--) {\\n long double nd = 1e10;\\n int now = 0;\\n for (int i = 0; i < n; ++i)\\n if (memo[i] > 0 && memo[i] < nd) now = i, nd = memo[i];\\n int from = 0;\\n nd = 1e10;\\n for (int i = 0; i < n; ++i)\\n if (memo[i] < 0 && abs(v[now] - v[i]) < nd)\\n from = i, nd = abs(v[now] - v[i]);\\n res += nd;\\n memo[now] = -1;\\n for (int i = 0; i < n; ++i)\\n if (memo[i] > 0) memo[i] = min(memo[i], distSP(v[from], v[now], v[i]));\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1350,\n \"memory_kb\": 3744,\n \"score_of_the_acc\": -0.7982,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2774_5532964\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// arg(x) : argment,[-PI,PI]\\nusing CP = complex<long double>;\\n#define X real()\\n#define Y imag()\\nconst long double PI = acos(-1.0L);\\nconst long double EPS = 1e-10;\\nbool operator==(const CP &l, const CP &r) { return norm(l - r) <= EPS; }\\nstruct Circle {\\n CP o;\\n long double r;\\n Circle(long double _x = 0.0L, long double _y = 0.0L, long double _r = 0.0L)\\n : o(CP(_x, _y)), r(_r) {}\\n Circle(CP _o, long double _r = 0.0) : o(_o), r(_r) {}\\n bool operator<(const Circle &cr) const { return r < cr.r; }\\n};\\n\\nstruct Line {\\n CP s, t;\\n Line(long double sx = 0.0L, long double sy = 0.0L, long double tx = 0.0L,\\n long double ty = 0.0L)\\n : s(CP(sx, sy)), t(CP(tx, ty)) {}\\n Line(CP _s, CP _t) : s(_s), t(_t) {}\\n};\\n\\n// cos a\\nlong double costh(const long double &a, const long double &b,\\n const long double &c) {\\n return (b * b - a * a + c * c) / (2.0L * b * c);\\n}\\n\\n// dot(a,b) = |a||b|cos x\\nlong double dot(const CP &a, const CP &b) { return (conj(a) * b).X; }\\n// cross(a,b) : area of parallelogram\\n// sign : a-> b ,counter clockwise? + : -\\nlong double cross(const CP &a, const CP &b) { return (conj(a) * b).Y; }\\nlong double corner(const CP &a, const CP &b) {\\n //[0,PI]\\n return acos(dot(a, b) / (abs(a) * abs(b)));\\n}\\n\\nCP projectionLP(const CP &s, const CP &t, const CP &p) {\\n if (s == t) return s;\\n CP base = t - s;\\n long double r = dot(p - s, base) / norm(base);\\n return s + base * r;\\n}\\nCP projectionLP(const Line &l, const CP &p) {\\n return projectionLP(l.s, l.t, p);\\n}\\n\\nCP reflectionLP(const CP &s, const CP &t, const CP &p) {\\n CP tmp = (projectionLP(s, t, p) - p);\\n tmp *= 2;\\n return p + tmp;\\n}\\nCP reflectionLP(const Line &l, const CP &p) {\\n return reflectionLP(l.s, l.t, p);\\n}\\n\\nint calc_clockwiseSP(const CP &s, CP t, CP p) {\\n t -= s;\\n p -= s;\\n if (cross(t, p) > EPS) return 1; // \\\"COUNTER_CLOCKWISE\\\"\\n if (cross(t, p) < -EPS) return -1; //\\\"CLOCK_WISE\\\"\\n if (dot(t, p) < 0) return 2; // \\\"ONLINE_BACK\\\"\\n if (norm(t) < norm(p)) return -2; // \\\"ONLINE_FRONT\\\"\\n return 0; // \\\"ON_SEGMENT\\\"\\n}\\nint calc_clockwiseSP(const Line &l, const CP &p) {\\n return calc_clockwiseSP(l.s, l.t, p);\\n}\\n\\nint parallel_orthogonalLL(const CP &s, CP t, const CP &a, CP b) {\\n t -= s;\\n b -= a;\\n if (abs(cross(t, b)) <= EPS) return 2; // \\\"parallel\\\"\\n if (abs(dot(t, b)) <= EPS) return 1; // \\\"orthogonal\\\"\\n return 0;\\n}\\nint parallel_orthogonalLL(const Line &ll, const Line &lr) {\\n return parallel_orthogonalLL(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\nCP intersectionLL(const CP &a, const CP &b, const CP &c, const CP &d) {\\n return a + (b - a) * (cross(d - c, c - a) / cross(d - c, b - a));\\n}\\nCP intersectionLL(const Line &ll, const Line &lr) {\\n return intersectionLL(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\nbool on_segSP(const CP &s, const CP &t, const CP &p) {\\n // if not use end point, dot(s - p, t - p) < 0\\n return abs(cross(s - p, t - p)) <= EPS && dot(s - p, t - p) <= 0;\\n}\\nbool on_segSP(const Line &l, const CP &p) { return on_segSP(l.s, l.t, p); }\\n\\n// crossing segments? (a,b) and (c,d)\\nbool iscrossSS(const CP &a, const CP &b, const CP &c, const CP &d) {\\n // parallel\\n if (abs(cross(a - b, c - d)) <= EPS) {\\n return on_segSP(a, b, c) || on_segSP(a, b, d) || on_segSP(c, d, a) ||\\n on_segSP(c, d, b);\\n }\\n CP isp = intersectionLL(a, b, c, d);\\n return on_segSP(a, b, isp) && on_segSP(c, d, isp);\\n}\\nbool iscrossSS(const Line &ll, const Line &lr) {\\n return iscrossSS(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\nlong double distLP(const CP &s, const CP &t, const CP &p) {\\n return abs(cross(t - s, p - s) / abs(t - s));\\n}\\nlong double distLP(const Line &l, const CP &p) { return distLP(l.s, l.t, p); }\\n\\nlong double distSP(const CP &s, const CP &t, const CP &p) {\\n if (dot(t - s, p - s) < 0) return abs(p - s);\\n if (dot(s - t, p - t) < 0) return abs(p - t);\\n return distLP(s, t, p);\\n}\\nlong double distSP(const Line &l, const CP &p) { return distSP(l.s, l.t, p); }\\n\\nusing P = pair<long double, int>;\\n\\nint n, m;\\nvector<CP> v;\\n\\nlong double solve();\\n\\nint main() {\\n cin >> n >> m, ++n;\\n for (int i = 0; i < n; ++i) {\\n int x, y;\\n cin >> x >> y;\\n v.emplace_back(x, y);\\n }\\n cout << fixed << setprecision(10);\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nlong double solve() {\\n // vector<vector<long double>> dist(n, vector<long double>(n, 0));\\n vector<long double> memo(n, 1e10);\\n {\\n // for (int i = 0; i < n; ++i)\\n // for (int j = 0; j < n; ++j) dist[i][j] = abs(v[i] - v[j]);\\n for (int i = 1; i < n; ++i) memo[i] = abs(v[i] - v[0]);\\n memo[0] = -1;\\n }\\n long double res = 0;\\n while (m--) {\\n long double nd = 1e10;\\n int now = 0;\\n for (int i = 0; i < n; ++i)\\n if (memo[i] > 0 && memo[i] < nd) now = i, nd = memo[i];\\n int from = 0;\\n nd = 1e10;\\n for (int i = 0; i < n; ++i)\\n if (memo[i] < 0 && abs(v[now] - v[i]) < nd)\\n from = i, nd = abs(v[now] - v[i]);\\n res += nd;\\n memo[now] = -1;\\n for (int i = 0; i < n; ++i)\\n if (memo[i] > 0) memo[i] = min(memo[i], distSP(v[from], v[now], v[i]));\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1350,\n \"memory_kb\": 3744,\n \"score_of_the_acc\": -0.7982,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2774_5532551\",\n \"code_snippet\": \"#line 1 \\\"c.cpp\\\"\\n#pragma region Macros\\n#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#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__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()\\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(i, n) FOR(i, 0, n)\\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\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\n#pragma endregion Macros\\n\\n#line 1 \\\"/home/siro53/kyo-pro/compro_library/geometry/geometry.hpp\\\"\\nnamespace geometry {\\n // Point : 複素数型を位置ベクトルとして扱う\\n // 実軸(real)をx軸、挙軸(imag)をy軸として見る\\n using D = double;\\n using Point = complex<D>;\\n const D EPS = 1e-7;\\n const D PI = acosl(-1);\\n\\n inline bool equal(const D &a, const D &b) { return fabs(a - b) < EPS; }\\n\\n // 単位ベクトル(unit vector)を求める\\n Point unitVector(const Point &a) { return a / abs(a); }\\n\\n // 法線ベクトル(normal vector)を求める\\n // 90度回転した単位ベクトルをかける\\n // -90度がよければPoint(0, -1)をかける\\n Point normalVector(const Point &a) { return a * Point(0, 1); }\\n\\n // 内積(dot product) : a・b = |a||b|cosΘ\\n D dot(const Point &a, const Point &b) {\\n return (a.real() * b.real() + a.imag() * b.imag());\\n }\\n\\n // 外積(cross product) : a×b = |a||b|sinΘ\\n D cross(const Point &a, const Point &b) {\\n return (a.real() * b.imag() - a.imag() * b.real());\\n }\\n\\n // 点pを反時計回りにtheta度回転\\n // thetaはラジアン！！！\\n Point rotate(const Point &p, const D &theta) {\\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\\n sin(theta) * p.real() + cos(theta) * p.imag());\\n }\\n\\n // ラジアン->度\\n D radianToDegree(const D &radian) { return radian * 180.0 / PI; }\\n\\n // 度->ラジアン\\n D degreeToRadian(const D °ree) { return degree * PI / 180.0; }\\n\\n // 点の回転方向\\n // 点a, b, cの位置関係について(aが基準点)\\n int ccw(const Point &a, Point b, Point c) {\\n b -= a, c -= a;\\n // 点a, b, c が\\n // 反時計回りの時、\\n if(cross(b, c) > EPS) return 1;\\n // 時計回りの時、\\n if(cross(b, c) < -EPS) return -1;\\n // c, a, bがこの順番で同一直線上にある時、\\n if(dot(b, c) < 0) return 2;\\n // a, b, cがこの順番で同一直線上にある場合、\\n if(norm(b) < norm(c)) return -2;\\n // cが線分ab上にある場合、\\n return 0;\\n }\\n\\n // Line : 直線を表す構造体\\n // b - a で直線・線分を表せる\\n struct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n // Ax+By=C\\n Line(D A, D B, D C) {\\n if(equal(A, 0)) {\\n a = Point(0, C / B), b = Point(1, C / B);\\n } else if(equal(B, 0)) {\\n b = Point(C / A, 0), b = Point(C / A, 1);\\n } else {\\n a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n }\\n };\\n\\n // Segment : 線分を表す構造体\\n // Lineと同じ\\n struct Segment : Line {\\n Segment() = default;\\n\\n Segment(Point a, Point b) : Line(a, b) {}\\n };\\n\\n // Circle : 円を表す構造体\\n // pが中心の位置ベクトル、rは半径\\n struct Circle {\\n Point p;\\n D r;\\n\\n Circle() = default;\\n\\n Circle(Point p, D r) : p(p), r(r) {}\\n };\\n\\n // 2直線の直交判定 : a⊥b <=> dot(a, b) = 0\\n bool isOrthogonal(const Line &a, const Line &b) {\\n return equal(dot(a.b - a.a, b.b - b.a), 0);\\n }\\n // 2直線の平行判定 : a//b <=> cross(a, b) = 0\\n bool isParallel(const Line &a, const Line &b) {\\n return equal(cross(a.b - a.a, b.b - b.a), 0);\\n }\\n\\n // 点cが直線ab上にあるか\\n bool isPointOnLine(const Point &a, const Point &b, const Point &c) {\\n return isParallel(Line(a, b), Line(a, c));\\n }\\n\\n // 点cが\\\"線分\\\"ab上にあるか\\n bool isPointOnSegment(const Point &a, const Point &b, const Point &c) {\\n // |a-c| + |c-b| <= |a-b| なら線分上\\n return (abs(a - c) + abs(c - b) < abs(a - b) + EPS);\\n }\\n\\n // 直線lと点pの距離を求める\\n D distanceBetweenLineAndPoint(const Line &l, const Point &p) {\\n return abs(cross(l.b - l.a, p - l.a)) / abs(l.b - l.a);\\n }\\n\\n // 線分lと点pの距離を求める\\n // 定義：点pから「線分lのどこか」への最短距離\\n D distanceBetweenSegmentAndPoint(const Segment &l, const Point &p) {\\n if(dot(l.b - l.a, p - l.a) < EPS) return abs(p - l.a);\\n if(dot(l.a - l.b, p - l.b) < EPS) return abs(p - l.b);\\n return abs(cross(l.b - l.a, p - l.a)) / abs(l.b - l.a);\\n }\\n\\n // 直線s, tの交点の計算\\n Point crossPoint(const Line &s, const Line &t) {\\n D d1 = cross(s.b - s.a, t.b - t.a);\\n D d2 = cross(s.b - s.a, s.b - t.a);\\n if(equal(abs(d1), 0) && equal(abs(d2), 0)) return t.a;\\n return t.a + (t.b - t.a) * (d2 / d1);\\n }\\n\\n // 線分s, tの交点の計算\\n Point crossPoint(const Segment &s, const Segment &t) {\\n return crossPoint(Line(s), Line(t));\\n }\\n\\n // 線分sと線分tが交差しているかどうか\\n // bound:線分の端点を含むか\\n bool isIntersect(const Segment &s, const Segment &t, bool bound) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) < bound &&\\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) < bound;\\n }\\n\\n // 線分sとtの距離\\n D distanceBetweenSegments(const Segment &s, const Segment &t) {\\n if(isIntersect(s, t, 1)) return (D)(0);\\n D ans = distanceBetweenSegmentAndPoint(s, t.a);\\n chmin(ans, distanceBetweenSegmentAndPoint(s, t.b));\\n chmin(ans, distanceBetweenSegmentAndPoint(t, s.a));\\n chmin(ans, distanceBetweenSegmentAndPoint(t, s.b));\\n return ans;\\n }\\n\\n // 射影(projection)\\n // 直線(線分)lに点pから引いた垂線の足を求める\\n Point projection(const Line &l, const Point &p) {\\n D t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n }\\n\\n Point projection(const Segment &l, const Point &p) {\\n D t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n }\\n\\n // 反射(reflection)\\n // 直線lを対称軸として点pと線対称の位置にある点を求める\\n Point reflection(const Line &l, const Point &p) {\\n return p + (projection(l, p) - p) * (D)2.0;\\n }\\n\\n // 2つの円の交差判定\\n // 返り値は共通接線の数\\n int isIntersect(const Circle &c1, const Circle &c2) {\\n D d = abs(c1.p - c2.p);\\n // 2つの円が離れている場合\\n if(d > c1.r + c2.r + EPS) return 4;\\n // 外接している場合\\n if(equal(d, c1.r + c2.r)) return 3;\\n // 内接している場合\\n if(equal(d, abs(c1.r - c2.r))) return 1;\\n // 内包している場合\\n if(d < abs(c1.r - c2.r) - EPS) return 0;\\n return 2;\\n }\\n\\n // 2つの円の交点\\n vector<Point> crossPoint(const Circle &c1, const Circle &c2) {\\n vector<Point> res;\\n int mode = isIntersect(c1, c2);\\n // 2つの中心の距離\\n D d = abs(c1.p - c2.p);\\n // 2円が離れている場合\\n if(mode == 4) return res;\\n // 1つの円がもう1つの円に内包されている場合\\n if(mode == 0) return res;\\n // 2円が外接する場合\\n if(mode == 3) {\\n D t = c1.r / (c1.r + c2.r);\\n res.emplace_back(c1.p + (c2.p - c1.p) * t);\\n return res;\\n }\\n // 内接している場合\\n if(mode == 1) {\\n if(c2.r < c1.r - EPS) {\\n res.emplace_back(c1.p + (c2.p - c1.p) * (c1.r / d));\\n } else {\\n res.emplace_back(c2.p + (c1.p - c2.p) * (c2.r / d));\\n }\\n return res;\\n }\\n // 2円が重なる場合\\n D rc1 = (c1.r * c1.r + d * d - c2.r * c2.r) / (2 * d);\\n D rs1 = sqrt(c1.r * c1.r - rc1 * rc1);\\n if(c1.r - abs(rc1) < EPS) rs1 = 0;\\n Point e12 = (c2.p - c1.p) / abs(c2.p - c1.p);\\n res.emplace_back(c1.p + rc1 * e12 + rs1 * e12 * Point(0, 1));\\n res.emplace_back(c1.p + rc1 * e12 + rs1 * e12 * Point(0, -1));\\n return res;\\n }\\n\\n // 点pが円cの内部(円周上も含む)に入っているかどうか\\n bool isInCircle(const Circle &c, const Point &p) {\\n D d = abs(c.p - p);\\n return (equal(d, c.r) || d < c.r - EPS);\\n }\\n\\n // 円cと直線lの交点\\n vector<Point> crossPoint(const Circle &c, const Line &l) {\\n vector<Point> res;\\n D d = distanceBetweenLineAndPoint(l, c.p);\\n // 交点を持たない\\n if(d > c.r + EPS) return res;\\n // 接する\\n Point h = projection(l, c.p);\\n if(equal(d, c.r)) {\\n res.emplace_back(h);\\n return res;\\n }\\n Point e = unitVector(l.b - l.a);\\n D ph = sqrt(c.r * c.r - d * d);\\n res.emplace_back(h - e * ph);\\n res.emplace_back(h + e * ph);\\n return res;\\n }\\n\\n // 点pを通る円cの接線\\n // 2本あるので、接点のみを返す\\n vector<Point> tangentToCircle(const Point &p, const Circle &c) {\\n return crossPoint(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\\n }\\n\\n // 円の共通接線\\n vector<Line> tangent(const Circle &a, const Circle &b) {\\n vector<Line> ret;\\n // 2円の中心間の距離\\n D g = abs(a.p - b.p);\\n // 円が内包されている場合\\n if(equal(g, 0)) return ret;\\n Point u = unitVector(b.p - a.p);\\n Point v = rotate(u, PI / 2);\\n for(int s : {-1, 1}) {\\n D h = (a.r + b.r * s) / g;\\n if(equal(h * h, 1)) {\\n ret.emplace_back(a.p + (h > 0 ? u : -u) * a.r,\\n a.p + (h > 0 ? u : -u) * a.r + v);\\n\\n } else if(1 - h * h > 0) {\\n Point U = u * h, V = v * sqrt(1 - h * h);\\n ret.emplace_back(a.p + (U + V) * a.r,\\n b.p - (U + V) * (b.r * s));\\n ret.emplace_back(a.p + (U - V) * a.r,\\n b.p - (U - V) * (b.r * s));\\n }\\n }\\n return ret;\\n }\\n\\n // 多角形の面積を求める\\n D PolygonArea(const vector<Point> &p) {\\n D res = 0;\\n int n = p.size();\\n for(int i = 0; i < n - 1; i++) res += cross(p[i], p[i + 1]);\\n res += cross(p[n - 1], p[0]);\\n return res * 0.5;\\n }\\n\\n // 凸多角形かどうか\\n bool isConvex(const vector<Point> &p) {\\n int n = p.size();\\n int now, pre, nxt;\\n for(int i = 0; i < n; i++) {\\n pre = (i - 1 + n) % n;\\n nxt = (i + 1) % n;\\n now = i;\\n if(ccw(p[pre], p[now], p[nxt]) == -1) return false;\\n }\\n return true;\\n }\\n\\n // 凸包 O(NlogN)\\n vector<Point> ConvexHull(vector<Point> &p) {\\n int n = (int)p.size(), k = 0;\\n sort(ALL(p), [](const Point &a, const Point &b) {\\n return (real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b));\\n });\\n vector<Point> ch(2 * n);\\n // 一直線上の3点を含める -> (< -EPS)\\n // 含め無い -> (< EPS)\\n for(int i = 0; i < n; ch[k++] = p[i++]) { // lower\\n while(k >= 2 &&\\n cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS)\\n --k;\\n }\\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { // upper\\n while(k >= t &&\\n cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS)\\n --k;\\n }\\n ch.resize(k - 1);\\n return ch;\\n }\\n\\n // 多角形gに点pが含まれているか?\\n // 含まれる:2, 辺上にある:1, 含まれない:0\\n int isContained(const vector<Point> &g, const Point &p) {\\n bool in = false;\\n int n = (int)g.size();\\n for(int i = 0; i < n; i++) {\\n Point a = g[i] - p, b = g[(i + 1) % n] - p;\\n if(imag(a) > imag(b)) swap(a, b);\\n if(imag(a) <= EPS && EPS < imag(b) && cross(a, b) < -EPS) in = !in;\\n if(cross(a, b) == 0 && dot(a, b) <= 0) return 1;\\n }\\n return (in ? 2 : 0);\\n }\\n\\n} // namespace geometry\\n#line 70 \\\"c.cpp\\\"\\nusing namespace geometry;\\n\\nusing Data = pair<D, int>;\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector<Point> p(N+1); \\n REP(i, N+1) {\\n int x, y;\\n cin >> x >> y;\\n p[i] = Point(x, y);\\n }\\n\\n D ans = 0;\\n set<Data> unused; // まだ追加してない頂点\\n set<int> used; // すでに追加した頂点\\n REP(i, N) unused.emplace(abs(p[0] - p[i+1]), i+1);\\n used.insert(0);\\n\\n REP(_, M) {\\n // 次の餌を選ぶ\\n auto [nxt_d, nxt_id] = *unused.begin();\\n // 餌と最も近い拠点を求める\\n int min_kyoten = -1;\\n D mn = LLINF;\\n for(int id : used) if(chmin(mn, abs(p[nxt_id] - p[id]))) min_kyoten = id;\\n ans += mn;\\n Segment seg(p[nxt_id], p[min_kyoten]);\\n // まだ追加してない頂点の最短距離を更新\\n set<Data> newse;\\n for(auto& [d, id] : unused) {\\n if(id == nxt_id) continue;\\n D nd = min(d, distanceBetweenSegmentAndPoint(seg, p[id]));\\n newse.emplace(nd, id);\\n }\\n unused = newse;\\n used.insert(nxt_id);\\n }\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1690,\n \"memory_kb\": 4268,\n \"score_of_the_acc\": -1.0322,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2774_5532524\",\n \"code_snippet\": \"#line 2 \\\"cpplib/util/template.hpp\\\"\\n/**\\n * These codes are licensed under CC0.\\n * http://creativecommons.org/publicdomain/zero/1.0/deed.ja\\n */\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#pragma GCC target(\\\"avx2\\\")\\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>using V=vector<T>;\\ntemplate<typename T>using VV=V<V<T>>;\\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 debug(T t){bool f=0;for(auto i:t){cerr<<(f?\\\" \\\":\\\"\\\")<<i;f=1;}cerr<<endl;}\\ntemplate<typename T>inline void debug2(T t){for(auto i:t)debug(i);}\\n#define loop(n) for(long long _=0;_<(long long)(n);++_)\\n#define _overload4(_1,_2,_3,_4,name,...) name\\n#define __rep(i,a) repi(i,0,a,1)\\n#define _rep(i,a,b) repi(i,a,b,1)\\n#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)\\n#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)\\n#define _overload3_rev(_1,_2,_3,name,...) name\\n#define _rep_rev(i,a) repi_rev(i,0,a)\\n#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)\\n#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)\\n\\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)\\n// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\\n// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\\n// inline 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;}\\n// template<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)\\n#if __cplusplus>=201703L\\n template<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#endif\\n#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))\\n#define bit(n,a) ((n>>a)&1)\\nvector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}\\nusing graph=vector<vector<int>>;\\ntemplate<typename T>using graph_w=vector<vector<pair<int,T>>>;\\ntemplate<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<\\\"(\\\"<<v.first<<\\\",\\\"<<v.second<<\\\")\\\";return out;}\\n#if __cplusplus>=201703L\\n constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}\\n#endif\\n\\ntemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}\\ntemplate<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}\\ntemplate<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}\\ntemplate<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}\\n#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile(\\\"mov %%rsp, %%rbx\\\\nmov %%rax, %%rsp\\\":\\\"=b\\\"(stack_extend_origin_memory_):\\\"a\\\"((char*)stack_extend_memory_+(size)-1024));\\n#define END_STACK_EXTEND asm volatile(\\\"mov %%rax, %%rsp\\\"::\\\"a\\\"(stack_extend_origin_memory_));free(stack_extend_memory_);\\n#line 2 \\\"code.cpp\\\"\\n\\nint main(){\\n lint n,m,x,y;\\n cin>>n>>m>>x>>y;\\n vec px(n),py(n);\\n rep(i,n){\\n cin>>px[i]>>py[i];\\n }\\n px.emplace_back(x);\\n py.emplace_back(y);\\n vector<pair<__int128_t,__int128_t>>score(n+1,make_pair(INF,1));\\n set<lint> s;\\n s.emplace(n);\\n auto f=[&](lint i,lint j)->lint{\\n return (px[j]-px[i])*(px[j]-px[i])+(py[j]-py[i])*(py[j]-py[i]);\\n };\\n auto g=[&](lint i,lint j,lint k)->pair<__int128_t,__int128_t>{\\n lint a=py[i]-py[j];\\n lint b=-(px[i]-px[j]);\\n lint c=-(a*px[i]+b*py[i]);\\n pair<lint,lint> tmp=make_pair((a*px[k]+b*py[k]+c)*(a*px[k]+b*py[k]+c),(a*a+b*b));\\n if((px[j]-px[i])*(px[k]-px[i])+(py[j]-py[i])*(py[k]-py[i])>=0\\n && (px[i]-px[j])*(px[k]-px[j])+(py[i]-py[j])*(py[k]-py[j])>=0\\n )return tmp;\\n else return min(make_pair(f(i,k),1LL),make_pair(f(j,k),1LL));\\n };\\n long double ans=0;\\n auto chmin=[&](pair<__int128_t,__int128_t>&s,const pair<__int128_t,__int128_t>&t)->bool{\\n if(s.first*t.second>t.first*s.second){\\n s=t;\\n return 1;\\n }\\n return 0;\\n };\\n rep(i,n){\\n chmin(score[i],make_pair(f(i,n),1LL));\\n }\\n while(m--){\\n pair<__int128_t,__int128_t> mn2=make_pair(INF,1LL);\\n lint k=0;\\n rep(i,n){\\n if(chmin(mn2,score[i])){\\n k=i;\\n }\\n }\\n pair<__int128_t,__int128_t> mn=make_pair(INF,1LL);\\n lint idx=0;\\n for(auto j:s){\\n if(chmin(mn,make_pair(f(j,k),1LL))){\\n idx=j;\\n }\\n }\\n ans+=sqrtl(f(k,idx));\\n s.emplace(k);\\n score[k]=make_pair(INF,1LL);\\n rep(i,n){\\n if(!s.count(i)){\\n chmin(score[i],g(k,idx,i));\\n }\\n }\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1330,\n \"memory_kb\": 3856,\n \"score_of_the_acc\": -0.7888,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2774_5532489\",\n \"code_snippet\": \"#line 2 \\\"cpplib/util/template.hpp\\\"\\n/**\\n * These codes are licensed under CC0.\\n * http://creativecommons.org/publicdomain/zero/1.0/deed.ja\\n */\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#pragma GCC target(\\\"avx2\\\")\\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>using V=vector<T>;\\ntemplate<typename T>using VV=V<V<T>>;\\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 debug(T t){bool f=0;for(auto i:t){cerr<<(f?\\\" \\\":\\\"\\\")<<i;f=1;}cerr<<endl;}\\ntemplate<typename T>inline void debug2(T t){for(auto i:t)debug(i);}\\n#define loop(n) for(long long _=0;_<(long long)(n);++_)\\n#define _overload4(_1,_2,_3,_4,name,...) name\\n#define __rep(i,a) repi(i,0,a,1)\\n#define _rep(i,a,b) repi(i,a,b,1)\\n#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)\\n#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)\\n#define _overload3_rev(_1,_2,_3,name,...) name\\n#define _rep_rev(i,a) repi_rev(i,0,a)\\n#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)\\n#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)\\n\\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)\\n// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\\n// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\\n// inline 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;}\\n// template<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)\\n#if __cplusplus>=201703L\\n template<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#endif\\n#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))\\n#define bit(n,a) ((n>>a)&1)\\nvector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}\\nusing graph=vector<vector<int>>;\\ntemplate<typename T>using graph_w=vector<vector<pair<int,T>>>;\\ntemplate<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<\\\"(\\\"<<v.first<<\\\",\\\"<<v.second<<\\\")\\\";return out;}\\n#if __cplusplus>=201703L\\n constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}\\n#endif\\n\\ntemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}\\ntemplate<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}\\ntemplate<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}\\ntemplate<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}\\n#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile(\\\"mov %%rsp, %%rbx\\\\nmov %%rax, %%rsp\\\":\\\"=b\\\"(stack_extend_origin_memory_):\\\"a\\\"((char*)stack_extend_memory_+(size)-1024));\\n#define END_STACK_EXTEND asm volatile(\\\"mov %%rax, %%rsp\\\"::\\\"a\\\"(stack_extend_origin_memory_));free(stack_extend_memory_);\\n#line 2 \\\"code.cpp\\\"\\n\\nint main(){\\n lint n,m,x,y;\\n cin>>n>>m>>x>>y;\\n vec px(n),py(n);\\n rep(i,n){\\n cin>>px[i]>>py[i];\\n }\\n px.emplace_back(x);\\n py.emplace_back(y);\\n vector<lint>score(n+1,INF);\\n set<lint> s;\\n s.emplace(n);\\n auto f=[&](lint i,lint j)->lint{\\n return (px[j]-px[i])*(px[j]-px[i])+(py[j]-py[i])*(py[j]-py[i]);\\n };\\n auto g=[&](lint i,lint j,lint k)->lint{\\n lint a=py[i]-py[j];\\n lint b=-(px[i]-px[j]);\\n lint c=-(a*px[i]+b*py[i]);\\n lint tmp=(a*px[k]+b*py[k]+c)*(a*px[k]+b*py[k]+c)/(a*a+b*b);\\n if((px[j]-px[i])*(px[k]-px[i])+(py[j]-py[i])*(py[k]-py[i])>=0\\n && (px[i]-px[j])*(px[k]-px[j])+(py[i]-py[j])*(py[k]-py[j])>=0\\n )return tmp;\\n else return min(f(i,k),f(j,k));\\n };\\n long double ans=0;\\n rep(i,n){\\n chmin(score[i],f(i,n));\\n }\\n while(m--){\\n lint mn2=INF,k=0;\\n rep(i,n){\\n if(chmin(mn2,score[i])){\\n k=i;\\n }\\n }\\n lint mn=INF,idx=0;\\n for(auto j:s){\\n if(chmin(mn,f(j,k))){\\n idx=j;\\n }\\n }\\n ans+=sqrtl(f(k,idx));\\n s.emplace(k);\\n score[k]=INF;\\n rep(i,n){\\n if(!s.count(i)){\\n chmin(score[i],g(k,idx,i));\\n }\\n }\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 970,\n \"memory_kb\": 3732,\n \"score_of_the_acc\": -0.5543,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2774_5532463\",\n \"code_snippet\": \"#line 2 \\\"cpplib/util/template.hpp\\\"\\n/**\\n * These codes are licensed under CC0.\\n * http://creativecommons.org/publicdomain/zero/1.0/deed.ja\\n */\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#pragma GCC target(\\\"avx2\\\")\\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>using V=vector<T>;\\ntemplate<typename T>using VV=V<V<T>>;\\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 debug(T t){bool f=0;for(auto i:t){cerr<<(f?\\\" \\\":\\\"\\\")<<i;f=1;}cerr<<endl;}\\ntemplate<typename T>inline void debug2(T t){for(auto i:t)debug(i);}\\n#define loop(n) for(long long _=0;_<(long long)(n);++_)\\n#define _overload4(_1,_2,_3,_4,name,...) name\\n#define __rep(i,a) repi(i,0,a,1)\\n#define _rep(i,a,b) repi(i,a,b,1)\\n#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)\\n#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)\\n#define _overload3_rev(_1,_2,_3,name,...) name\\n#define _rep_rev(i,a) repi_rev(i,0,a)\\n#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)\\n#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)\\n\\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)\\n// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\\n// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\\n// inline 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;}\\n// template<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)\\n#if __cplusplus>=201703L\\n template<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#endif\\n#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))\\n#define bit(n,a) ((n>>a)&1)\\nvector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}\\nusing graph=vector<vector<int>>;\\ntemplate<typename T>using graph_w=vector<vector<pair<int,T>>>;\\ntemplate<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<\\\"(\\\"<<v.first<<\\\",\\\"<<v.second<<\\\")\\\";return out;}\\n#if __cplusplus>=201703L\\n constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}\\n#endif\\n\\ntemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}\\ntemplate<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}\\ntemplate<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}\\ntemplate<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}\\n#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile(\\\"mov %%rsp, %%rbx\\\\nmov %%rax, %%rsp\\\":\\\"=b\\\"(stack_extend_origin_memory_):\\\"a\\\"((char*)stack_extend_memory_+(size)-1024));\\n#define END_STACK_EXTEND asm volatile(\\\"mov %%rax, %%rsp\\\"::\\\"a\\\"(stack_extend_origin_memory_));free(stack_extend_memory_);\\n#line 2 \\\"code.cpp\\\"\\n\\nint main(){\\n lint n,m,x,y;\\n cin>>n>>m>>x>>y;\\n vec px(n),py(n);\\n rep(i,n){\\n cin>>px[i]>>py[i];\\n }\\n px.emplace_back(x);\\n py.emplace_back(y);\\n vector<lint>score(n+1,INF);\\n set<lint> s;\\n s.emplace(n);\\n auto f=[&](lint i,lint j)->lint{\\n return (px[j]-px[i])*(px[j]-px[i])+(py[j]-py[i])*(py[j]-py[i]);\\n };\\n auto g=[&](lint i,lint j,lint k)->lint{\\n lint a=py[i]-py[j];\\n lint b=-(px[i]-px[j]);\\n lint c=-(a*px[i]+b*py[i]);\\n lint tmp=(a*px[k]+b*py[k]+c)*(a*px[k]+b*py[k]+c)/(a*a+b*b);\\n if((px[j]-px[i])*(px[k]-px[i])+(py[j]-py[i])*(py[k]-py[i])>=0\\n && (px[i]-px[j])*(px[k]-px[j])+(py[i]-py[j])*(py[k]-py[j])>=0\\n )return tmp;\\n else return min(f(i,k),f(j,k));\\n };\\n double ans=0;\\n rep(i,n){\\n chmin(score[i],f(i,n));\\n }\\n while(m--){\\n lint mn2=INF,k=0;\\n rep(i,n){\\n if(chmin(mn2,score[i])){\\n k=i;\\n }\\n }\\n lint mn=INF,idx=0;\\n for(auto j:s){\\n if(chmin(mn,f(j,k))){\\n idx=j;\\n }\\n }\\n ans+=sqrt(f(k,idx));\\n s.emplace(k);\\n score[k]=INF;\\n rep(i,n){\\n if(!s.count(i)){\\n chmin(score[i],g(k,idx,i));\\n }\\n }\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 970,\n \"memory_kb\": 3836,\n \"score_of_the_acc\": -0.5575,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2774_4472073\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <complex>\\n#include <cstdio>\\n#include <cmath>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\nusing W = double;\\nusing P = complex<W>;\\nusing L = pair<P,P>;\\nusing C = pair<P,W>;\\nusing Poly = vector<P>;\\n#define X real()\\n#define Y imag()\\nconst W EPS = (1e-10), pi = acos(-1);\\ndouble dot(P a, P b){ return a.X * b.X + a.Y * b.Y;}\\nW cross(P a, P b){ return a.X * b.Y - a.Y * b.X;}\\nW ps_dist(P a, L s){\\n P sf = s.first, ss = s.second;\\n if(dot(ss-sf,a-sf) >= 0 && dot(sf-ss,a-ss) >= 0)\\n return abs(cross(sf-ss,a-ss))/abs(sf-ss);\\n return min(abs(a-sf), abs(a-ss));\\n} \\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; }\\n\\nint inf = 1e9;\\n\\nusing pdi = pair<double,int>;\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int n,m;\\n cin >> n >> m;\\n vector<P> p(n+1);\\n double x,y;\\n cin >> x >> y;\\n p[0] = P(x,y);\\n for(int i=1; i<=n; i++){\\n cin >> x >> y;\\n p[i] = P(x,y);\\n }\\n bool fst = true;\\n vector<bool> used(n+1,false);\\n used[0] = true;\\n double ans = 0;\\n priority_queue<pdi,vector<pdi>,greater<pdi>> que;\\n vector<double> dist(n+1);\\n for(int i=1; i<=n; i++){\\n dist[i] = abs(p[i]-p[0]);\\n que.emplace(abs(p[i]-p[0]),i);\\n }\\n for(int i=0; i<m; i++){\\n pdi mn = pdi(inf,inf);\\n while(used[que.top().second]) que.pop();\\n int id = que.top().second;\\n que.pop();\\n double res = inf;\\n int root;\\n for(int j=0; j<=n; j++){\\n if(used[j]){\\n if(chmin(res,abs(p[id]-p[j]))){\\n root = j;\\n }\\n }\\n }\\n ans += res;\\n used[id] = true;\\n L line = L(p[id],p[root]);\\n for(int j=0; j<=n; j++){\\n if(used[j]) continue;\\n if(chmin(dist[j],abs(p[j]-p[id]))){\\n que.emplace(abs(p[j]-p[id]),j);\\n }\\n if(chmin(dist[j],ps_dist(p[j],line))){\\n que.emplace(ps_dist(p[j],line),j);\\n }\\n }\\n }\\n cout << fixed << setprecision(10) << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 740,\n \"memory_kb\": 36056,\n \"score_of_the_acc\": -1.391,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2774_4471881\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <complex>\\n#include <cstdio>\\n#include <cmath>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\nusing W = double;\\nusing P = complex<W>;\\nusing L = pair<P,P>;\\nusing C = pair<P,W>;\\nusing Poly = vector<P>;\\n#define X real()\\n#define Y imag()\\nconst W EPS = (1e-10), pi = acos(-1);\\ndouble dot(P a, P b){ return a.X * b.X + a.Y * b.Y;}\\nW cross(P a, P b){ return a.X * b.Y - a.Y * b.X;}\\nW ps_dist(P a, L s){\\n P sf = s.first, ss = s.second;\\n if(dot(ss-sf,a-sf) >= 0 && dot(sf-ss,a-ss) >= 0)\\n return abs(cross(sf-ss,a-ss))/abs(sf-ss);\\n return min(abs(a-sf), abs(a-ss));\\n} \\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int n,m;\\n cin >> n >> m;\\n P ori;\\n double x,y;\\n cin >> x >> y;\\n ori = P(x,y);\\n vector<P> p;\\n for(int i=0; i<n; i++){\\n cin >> x >> y;\\n p.emplace_back(x,y);\\n // cout << p[i] << endl;\\n }\\n vector<pair<double,int>> dist(n);\\n pair<W,int> mn = make_pair(100000000,100000000);\\n for(int i=0; i<n; i++){\\n dist[i].first = abs(ori-p[i]);\\n dist[i].second = i;\\n // cout << ori << endl;\\n // cout << p[i] << endl;\\n // cout << dist[i].first << endl;\\n mn = min(mn,dist[i]);\\n }\\n vector<bool> used(n,false);\\n double ans = 0;\\n used[mn.second] = true;\\n ans += mn.first;\\n for(int i=0; i<n; i++){\\n if(used[i]) continue;\\n dist[i].first = min(dist[i].first,abs(p[i]-p[mn.second]));\\n // 線分\\n L sen = make_pair(ori,p[mn.second]);\\n dist[i].first = min(dist[i].first,ps_dist(p[i],sen));\\n }\\n for(int i=0; i<m-1; i++){\\n mn = make_pair(1000000000,10000000);\\n for(int j=0; j<n; j++){\\n if(used[j]) continue;\\n mn = min(mn,dist[j]); \\n }\\n int id = mn.second;\\n pair<double,int> kyo = make_pair(abs(ori-p[id]),-1); \\n for(int j=0; j<n; j++){\\n if(used[j]){\\n kyo = min(kyo,pair<double,int>(abs(p[j]-p[id]),j));\\n }\\n }\\n used[id] = true;\\n ans += kyo.first;\\n for(int j=0; j<n; j++){\\n if(used[j]) continue;\\n dist[j].first = min(dist[j].first,abs(p[j]-p[id]));\\n L sen;\\n if(kyo.second == -1){\\n sen = make_pair(ori,p[id]);\\n }else{\\n sen = make_pair(p[kyo.second],p[id]); \\n }\\n dist[j].first = min(dist[j].first,ps_dist(p[j],sen));\\n }\\n }\\n cout << fixed << setprecision(10) << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 790,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.4312,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2774_4471705\",\n \"code_snippet\": \"#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>\\n\\nusing namespace std;\\nusing Real = double;\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-8, PI = acos(-1);\\n\\n// 実数同士の比較\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\\n\\nPoint operator*(const Point &p, const Real &d) {\\n return Point(real(p) * d, imag(p) * d);\\n}\\n\\n// 入力\\nistream &operator>>(istream &is, Point &p) {\\n Real a, b;\\n is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\n\\n// 出力\\nostream &operator<<(ostream &os, Point &p) {\\n os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag();\\n}\\n\\n// 原点を中心として, 点 p を θ 回転すた点を返す\\nPoint rotate(Real theta, const Point &p) {\\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\n// ラジアンを度数に変換\\nReal radian_to_degree(Real r) {\\n return (r * 180.0 / PI);\\n}\\n\\n// 度数をラジアンに変換\\nReal degree_to_radian(Real d) {\\n return (d * PI / 180.0);\\n}\\n\\n// ∠BAC をラジアンで取得\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n const Point v(b - a), w(c - a);\\n Real alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n if(alpha > beta) swap(alpha, beta);\\n Real theta = (beta - alpha);\\n return min(theta, 2 * acos(-1) - theta);\\n}\\n\\n// x軸, y軸の順にソート\\nnamespace std {\\n bool operator<(const Point &a, const Point &b) {\\n return !eq(a.real(), b.real()) ? a.real() < b.real() : a.imag() < b.imag();\\n }\\n}\\n\\n// 直線\\n// 2 点を通る直線\\n// Ax + By = C \\nstruct Line {\\n Point a, b;\\n\\n Line() = default;\\n\\n Line(Point a, Point b) : a(a), b(b) {}\\n\\n Line(Real A, Real B, Real C) // Ax + By = C\\n {\\n if(eq(A, 0)) a = Point(0, C / B), b = Point(1, C / B);\\n else if(eq(B, 0)) b = Point(C / A, 0), b = Point(C / A, 1);\\n else a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n\\n friend ostream &operator<<(ostream &os, Line &p) {\\n return os << p.a << \\\" to \\\" << p.b;\\n }\\n\\n friend istream &operator>>(istream &is, Line &a) {\\n return is >> a.a >> a.b;\\n }\\n};\\n\\n// 線分\\n// 2 点を結ぶ\\nstruct Segment : Line {\\n Segment() = default;\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\n\\n\\n// 円\\n// 中心と半径\\nstruct Circle {\\n Point p;\\n Real r;\\n\\n Circle() = default;\\n\\n Circle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector< Point >;\\nusing Polygon = vector< Point >; // 注意!! 凸多角形は反時計回りに与える.(保証されない場合は面積が負なら reverse をかける)\\nusing Segments = vector< Segment >;\\nusing Lines = vector< Line >;\\nusing Circles = vector< Circle >;\\n\\n// 外積\\nReal cross(const Point &a, const Point &b) {\\n return real(a) * imag(b) - imag(a) * real(b);\\n}\\n\\n// 内積\\nReal dot(const Point &a, const Point &b) {\\n return real(a) * real(b) + imag(a) * imag(b);\\n}\\n\\n\\n// +1\\n// \\n// +2 a 0 b -2\\n//\\n// -1\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C&lang=jp\\nint ccw(const Point &a, Point b, Point c) {\\n b = b - a, c = c - a;\\n if(cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n if(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n if(dot(b, c) < 0) return +2; // \\\"ONLINE_BACK\\\"\\n if(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n return 0; // \\\"ON_SEGMENT\\\"\\n}\\n\\n\\n// 2 直線が平行か\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) {\\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\\n}\\n\\n// 2 直線が垂直か\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) {\\n return eq(dot(a.a - a.b, b.a - b.b), 0.0);\\n}\\n\\n// 直線 l に 点 p から垂線を下ろして,交わる点を返す\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\n// 同じ\\n// 直線として扱われそう\\nPoint projection(const Segment &l, const Point &p) {\\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\n// 直線 l に対して, 点 p と線対称な位置にある点を返す.\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) {\\n return p + (projection(l, p) - p) * 2.0;\\n}\\n\\n// 直線上に点が乗るかどうか\\nbool intersect(const Line &l, const Point &p) {\\n return abs(ccw(l.a, l.b, p)) != 1;\\n}\\n\\n// 直線 l と直線 m の交差判定\\nbool intersect(const Line &l, const Line &m) {\\n return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS;\\n}\\n\\n// 線分上に点があるかどうか\\nbool intersect(const Segment &s, const Point &p) {\\n return ccw(s.a, s.b, p) == 0;\\n}\\n\\n// 直線 l と 線分 s の交差判定\\nbool intersect(const Line &l, const Segment &s) {\\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\\n}\\n\\n// 点 p と 直線 l との距離\\nReal distance(const Line &l, const Point &p);\\n\\n// 円 c と直線 l との交差判定\\nbool intersect(const Circle &c, const Line &l) {\\n return distance(l, c.p) <= c.r + EPS;\\n}\\n\\n// 点 p が 円 c 上にあるかどうか\\nbool intersect(const Circle &c, const Point &p) {\\n return abs(abs(p - c.p) - c.r) < EPS;\\n}\\n\\n\\n// 線分同士の交差判定\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nbool intersect(const Segment &s, const Segment &t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 円 c と 線分 l との交差判定\\nint intersect(const Circle &c, const Segment &l) {\\n if(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n auto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n if(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n if(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n const Point h = projection(l, c.p);\\n if(dot(l.a - h, l.b - h) < 0) return 2;\\n return 0;\\n}\\n\\n// 円同士の交差判定\\n// 4 := 離れている\\n// 3 := 外接する\\n// 2 := 交わる\\n// 1 := 内接する\\n// 0 := 内包する\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2) {\\n if(c1.r < c2.r) swap(c1, c2);\\n Real d = abs(c1.p - c2.p);\\n if(c1.r + c2.r < d) return 4;\\n if(eq(c1.r + c2.r, d)) return 3;\\n if(c1.r - c2.r < d) return 2;\\n if(eq(c1.r - c2.r, d)) return 1;\\n return 0;\\n}\\n\\n// 点と点の距離\\nReal distance(const Point &a, const Point &b) {\\n return abs(a - b);\\n}\\n\\n// 直線と点の距離\\nReal distance(const Line &l, const Point &p) {\\n return abs(p - projection(l, p));\\n}\\n\\n// 直線と直線の距離 (もちろん交わってたら 0)\\nReal distance(const Line &l, const Line &m) {\\n return intersect(l, m) ? 0 : distance(l, m.a);\\n}\\n\\n// 線分と点の距離\\nReal distance(const Segment &s, const Point &p) {\\n Point r = projection(s, p);\\n if(intersect(s, r)) return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分同士の距離\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n if(intersect(a, b)) return 0;\\n return min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\n// 直線と線分の距離\\nReal distance(const Line &l, const Segment &s) {\\n if(intersect(l, s)) return 0;\\n return min(distance(l, s.a), distance(l, s.b));\\n}\\n\\n// 直線同士の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\\nPoint crosspoint(const Line &l, const Line &m) {\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\n\\n// 線分同士の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) {\\n return crosspoint(Line(l), Line(m));\\n}\\n\\n\\n// 円と直線の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair< Point, Point > crosspoint(const Circle &c, const Line l) {\\n Point pr = projection(l, c.p);\\n Point e = (l.b - l.a) / abs(l.b - l.a);\\n if(eq(distance(l, c.p), c.r)) return {pr, pr};\\n double base = sqrt(c.r * c.r - norm(pr - c.p));\\n return {pr - e * base, pr + e * base};\\n}\\n\\n\\n// 円と線分の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\\npair< Point, Point > crosspoint(const Circle &c, const Segment &l) {\\n Line aa = Line(l.a, l.b);\\n if(intersect(c, l) == 2) return crosspoint(c, aa);\\n auto ret = crosspoint(c, aa);\\n if(dot(l.a - ret.first, l.b - ret.first) < 0) ret.second = ret.first;\\n else ret.first = ret.second;\\n return ret;\\n}\\n\\n// 円同士の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair< Point, Point > crosspoint(const Circle &c1, const Circle &c2) {\\n Real d = abs(c1.p - c2.p);\\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n return {p1, p2};\\n}\\n\\n// 点 p から円 C へ接戦を引いた時の、接点を返す\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\npair< Point, Point > tangent(const Circle &c1, const Point &p2) {\\n return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r)));\\n}\\n\\n// 円と円の共通接線を複数返す\\n// 0 ~ 4 つの可能性がある\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\nLines tangent(Circle c1, Circle c2) {\\n Lines ret;\\n if(c1.r < c2.r) swap(c1, c2);\\n Real g = norm(c1.p - c2.p);\\n if(eq(g, 0)) return ret;\\n Point u = (c2.p - c1.p) / sqrt(g);\\n Point v = rotate(PI * 0.5, u);\\n for(int s : {-1, 1}) {\\n Real h = (c1.r + s * c2.r) / sqrt(g);\\n if(eq(1 - h * h, 0)) {\\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n } else if(1 - h * h > 0) {\\n Point uu = u * h, vv = v * sqrt(1 - h * h);\\n ret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n ret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n }\\n }\\n return ret;\\n}\\n\\n// 多角形が凸かどうかを判定\\n// 与えられる多角形は反時計回りなことが要請される\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\nbool is_convex(const Polygon &p) {\\n int n = (int) p.size();\\n for(int i = 0; i < n; i++) {\\n if(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\\n }\\n return true;\\n}\\n\\n// 凸包に含まれる点上および辺上の頂点からなる多角形を返す.\\n// 多角形の開始位置は特に指定がない.\\n// 反時計回りに返されることは保証されていそう\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\nPolygon convex_hull(Polygon &p) {\\n int n = (int) p.size(), k = 0;\\n if(n <= 2) return p;\\n sort(p.begin(), p.end());\\n vector< Point > ch(2 * n);\\n for(int i = 0; i < n; ch[k++] = p[i++]) {\\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\\n }\\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n// 多角形 Q と点 p との関係を返す\\n// 0 := OUT\\n// 1 := ON\\n// 2 := IN\\n// 多角形は反時計回りに渡す\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\nenum {\\n OUT, ON, IN\\n};\\nint contains(const Polygon &Q, const Point &p) {\\n bool in = false;\\n for(int i = 0; i < Q.size(); i++) {\\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n if(a.imag() > b.imag()) swap(a, b);\\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n }\\n return in ? IN : OUT;\\n}\\n\\n// TODO よくわからん\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\nvoid merge_segments(vector< Segment > &segs) {\\n\\n auto merge_if_able = [](Segment &s1, const Segment &s2) {\\n if(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\\n if(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\\n if(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\\n s1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\\n return true;\\n };\\n\\n for(int i = 0; i < segs.size(); i++) {\\n if(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\\n }\\n for(int i = 0; i < segs.size(); i++) {\\n for(int j = i + 1; j < segs.size(); j++) {\\n if(merge_if_able(segs[i], segs[j])) {\\n segs[j--] = segs.back(), segs.pop_back();\\n }\\n }\\n }\\n}\\n\\n// TODO よくわからん\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\nvector< vector< int > > segment_arrangement(vector< Segment > &segs, vector< Point > &ps) {\\n vector< vector< int > > g;\\n int N = (int) segs.size();\\n for(int i = 0; i < N; i++) {\\n ps.emplace_back(segs[i].a);\\n ps.emplace_back(segs[i].b);\\n for(int j = i + 1; j < N; j++) {\\n const Point p1 = segs[i].b - segs[i].a;\\n const Point p2 = segs[j].b - segs[j].a;\\n if(cross(p1, p2) == 0) continue;\\n if(intersect(segs[i], segs[j])) {\\n ps.emplace_back(crosspoint(segs[i], segs[j]));\\n }\\n }\\n }\\n sort(begin(ps), end(ps));\\n ps.erase(unique(begin(ps), end(ps)), end(ps));\\n\\n int M = (int) ps.size();\\n g.resize(M);\\n for(int i = 0; i < N; i++) {\\n vector< int > vec;\\n for(int j = 0; j < M; j++) {\\n if(intersect(segs[i], ps[j])) {\\n vec.emplace_back(j);\\n }\\n }\\n for(int j = 1; j < vec.size(); j++) {\\n g[vec[j - 1]].push_back(vec[j]);\\n g[vec[j]].push_back(vec[j - 1]);\\n }\\n }\\n return (g);\\n}\\n\\n\\n// 直線の進行方向の右側を残す\\n// Polygon は反時計回りに与える\\n// Line には一応向きがあるわけで\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\\nPolygon convex_cut(const Polygon &U, Line l) {\\n Polygon ret;\\n for(int i = 0; i < U.size(); i++) {\\n Point now = U[i], nxt = U[(i + 1) % U.size()];\\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\\n ret.push_back(crosspoint(Line(now, nxt), l));\\n }\\n }\\n return (ret);\\n}\\n\\n\\n// 多角形の面積\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\\nReal area2(const Polygon &p) {\\n Real A = 0;\\n for(int i = 0; i < p.size(); ++i) {\\n A += cross(p[i], p[(i + 1) % p.size()]);\\n }\\n return A;\\n}\\n\\n// 多角形と円の共通部分の面積\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\nReal area2(const Polygon &p, const Circle &c) {\\n if(p.size() < 3) return 0.0;\\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n Point va = c.p - a, vb = c.p - b;\\n Real f = cross(va, vb), ret = 0.0;\\n if(eq(f, 0.0)) return ret;\\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n if(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\n auto u = crosspoint(c, Segment(a, b));\\n vector< Point > tot{a, u.first, u.second, b};\\n for(int i = 0; i + 1 < tot.size(); i++) {\\n ret += cross_area(c, tot[i], tot[i + 1]);\\n }\\n return ret;\\n };\\n Real A = 0;\\n for(int i = 0; i < p.size(); i++) {\\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n }\\n return A;\\n}\\n\\n// 凸多角形 g の直径を求めよ。ただし、凸多角形の直径とはその最遠頂点対間距離のことである.\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\nReal convex_diameter(const Polygon &p) {\\n int N = (int) p.size();\\n int is = 0, js = 0;\\n for(int i = 1; i < N; i++) {\\n if(p[i].imag() > p[is].imag()) is = i;\\n if(p[i].imag() < p[js].imag()) js = i;\\n }\\n Real maxdis = norm(p[is] - p[js]);\\n\\n int maxi, maxj, i, j;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n if(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n j = (j + 1) % N;\\n } else {\\n i = (i + 1) % N;\\n }\\n if(norm(p[i] - p[j]) > maxdis) {\\n maxdis = norm(p[i] - p[j]);\\n maxi = i;\\n maxj = j;\\n }\\n } while(i != is || j != js);\\n return sqrt(maxdis);\\n}\\n\\n\\n// 平面上の n 個の点について、最も近い２点の距離.\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\nReal closest_pair(Points ps) {\\n if(ps.size() <= 1) throw (0);\\n sort(begin(ps), end(ps));\\n\\n auto compare_y = [&](const Point &a, const Point &b) {\\n return imag(a) < imag(b);\\n };\\n vector< Point > beet(ps.size());\\n const Real INF = 1e18;\\n\\n function< Real(int, int) > rec = [&](int left, int right) {\\n if(right - left <= 1) return INF;\\n int mid = (left + right) >> 1;\\n auto x = real(ps[mid]);\\n auto ret = min(rec(left, mid), rec(mid, right));\\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n int ptr = 0;\\n for(int i = left; i < right; i++) {\\n if(abs(real(ps[i]) - x) >= ret) continue;\\n for(int j = 0; j < ptr; j++) {\\n auto luz = ps[i] - beet[ptr - j - 1];\\n if(imag(luz) >= ret) break;\\n ret = min(ret, abs(luz));\\n }\\n beet[ptr++] = ps[i];\\n }\\n return ret;\\n };\\n return rec(0, (int) ps.size());\\n}\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n double x, y; cin >> x >> y;\\n Point p(x, y);\\n\\n Points ps(n);\\n\\n for (int i = 0; i < n; i++) {\\n double px, py; cin >> px >> py;\\n ps[i] = Point(px, py);\\n }\\n\\n // 粘菌は，線分の集合とみなすことができる\\n // (距離，頂点)\\n using P = pair<double, int>;\\n double inf = 1e18;\\n vector<double> dist(n, inf);\\n priority_queue<P, vector<P>, greater<P>> que;\\n int cnt = 0;\\n // 始め，すべての頂点間の距離を que へ突っ込む\\n for (int i = 0; i < n; i++) {\\n double d = distance(p, ps[i]);\\n dist[i] = d;\\n que.emplace(d, i);\\n }\\n\\n vector<bool> used(n, false);\\n double ans = 0.0;\\n\\n while (cnt < m) {\\n \\n double cost;\\n int node;\\n tie(cost, node) = que.top();\\n que.pop();\\n\\n if (dist[node] < cost) continue;\\n\\n // 頂点を追加\\n cnt++;\\n // 確定した頂点の中で，一番近いやつを選ぶ\\n int nxtNode = -1;\\n double nxtNodeCost = distance(p, ps[node]);;\\n for (int i = 0; i < n; i++) {\\n if (!used[i]) continue;\\n\\n double tmp = distance(ps[i], ps[node]);\\n if (nxtNodeCost > tmp) {\\n nxtNodeCost = tmp;\\n nxtNode = i;\\n }\\n }\\n\\n Point nxtPoint = p;\\n if (nxtNode != -1) {\\n nxtPoint = ps[nxtNode];\\n }\\n\\n // 晴れて，線分が決まる\\n // ps[node] と nxtPoint\\n ans += distance(ps[node], nxtPoint);\\n\\n // node を確定させる\\n used[node] = true;\\n // cerr << \\\"node = \\\" << node + 1 << \\\", nxtNode = \\\" << nxtNode << endl;\\n\\n // まだ確定していない頂点と，この新しい線分の距離を計算して push\\n Segment sg(ps[node], nxtPoint);\\n for (int i = 0; i < n; i++) {\\n if (used[i]) continue;\\n double tmp = distance(sg, ps[i]);\\n // cerr << \\\"to \\\" << i + 1 << \\\" \\\" << tmp << endl;\\n if (dist[i] <= tmp) continue;\\n dist[i] = tmp;\\n que.emplace(tmp, i);\\n }\\n }\\n\\n // cout << ans << endl;\\n printf(\\\"%.10f\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 950,\n \"memory_kb\": 35956,\n \"score_of_the_acc\": -1.5226,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2774_4471692\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\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};\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\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}\\ndouble distanceSP(const L &s, const P &p) {\\n if(dot(s[1]-s[0], p-s[0]) < EPS) return abs(p-s[0]);\\n if(dot(s[0]-s[1], p-s[1]) < EPS) return abs(p-s[1]);\\n return distanceLP(s, p);\\n}\\n\\nint main(){\\n int n,m,sx,sy;\\n cin >> n >> m >> sx >> sy;\\n VP p(n+1);\\n p[0] = P(sx, sy);\\n for(int i=1; i<n+1; i++){\\n int x,y;\\n cin >> x >> y;\\n p[i] = P(x, y);\\n }\\n\\n vector<double> dist(n+1, INF);\\n for(int i=1; i<=n; i++){\\n dist[i] = abs(p[i] -p[0]);\\n }\\n double ans = 0;\\n for(int rep=0; rep<m; rep++){\\n double minval = INF;\\n int newidx = -1;\\n for(int i=0; i<n+1; i++){\\n if(dist[i] +EPS < minval){\\n minval = dist[i];\\n newidx = i;\\n }\\n }\\n int nearidx = -1;\\n minval = INF;\\n for(int i=0; i<n+1; i++){\\n if(dist[i] == INF and abs(p[newidx]-p[i]) +EPS < minval){\\n nearidx = i;\\n minval = abs(p[newidx]-p[i]);\\n }\\n }\\n ans += abs(p[newidx] -p[nearidx]);\\n dist[newidx] = INF;\\n for(int i=0; i<n+1; i++){\\n if(dist[i] == INF) continue;\\n dist[i] = min(dist[i], distanceSP(L(p[newidx], p[nearidx]), p[i]));\\n }\\n }\\n cout << fixed << setprecision(10);\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 3420,\n \"score_of_the_acc\": -0.2948,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2774_4096647\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\ndouble eps = 1e-6;\\n\\nsigned main(){\\n ios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n cout << fixed << setprecision(20);\\n\\n int n,m;\\n cin>>n>>m;\\n double a[n+1],b[n+1];\\n cin>>a[0] >> b[0];\\n for(int i=1;i<=n;i++){\\n cin>>a[i]>>b[i];\\n }\\n double ans = 0;\\n bool used[n+1]={};\\n used[0] =1;\\n double dist[n+1]={};\\n for(int i=1;i<=n;i++){\\n dist[i] = sqrt((a[0]-a[i])*(a[0]-a[i]) + (b[0]-b[i])*(b[0]-b[i]));\\n }\\n while(m){\\n double d=1e13;\\n int f=-1;\\n for(int i=1;i<=n;i++){\\n if(used[i]) continue;\\n if(d > eps + dist[i]){\\n d = dist[i];\\n f = i;\\n }\\n }\\n double x1 = a[f],y2 = b[f];\\n d = 1e13;\\n int g = 0;\\n for(int i=0;i<=n;i++){\\n if(!used[i]) continue;\\n double ret = (x1-a[i]) * (x1-a[i]) + (y2-b[i])*(y2-b[i]);\\n ret = sqrt(ret);\\n if(ret+eps < d){\\n d = ret;\\n g = i;\\n }\\n }\\n ans += d;\\n used[f]=1;\\n m--;\\n //cerr << \\\"a \\\"<<f << \\\" \\\" << g << endl;\\n \\n for(int i=1;i<=n;i++){\\n if(used[i]) continue;\\n double ret = 1e14;\\n double x1=a[g],y1=b[g],x2=a[f],y2=b[f];\\n d = 1e15;\\n if(x1==x2){\\n if(b[i]>=min(y1,y2) && b[i] <=max(y1,y2)){\\n double ret = abs(a[i]-x1);\\n if(d > ret+eps){\\n d = ret;\\n }\\n }\\n else{\\n ret = (x1-a[i]) * (x1-a[i]) + (y1-b[i]) * (y1-b[i]);\\n ret = min(ret, (x2-a[i])*(x2-a[i]) + (y2-b[i]) * (y2-b[i]));\\n ret = sqrt(ret);\\n if(ret+eps < d){\\n d = ret;\\n }\\n }\\n }\\n else{\\n ret = (x1-a[i]) * (x1-a[i]) + (y1-b[i]) * (y1-b[i]);\\n ret = min(ret, (x2-a[i])*(x2-a[i]) + (y2-b[i]) * (y2-b[i]));\\n ret = sqrt(ret);\\n double k1 = x1*y2 - x2*y1;\\n double k2 = a[i] * x1 - a[i]*x2 + y1*b[i] - y2*b[i];\\n k2 *= (x1 - x2);\\n k1 *= (y1 - y2);\\n double K = k2 - k1;\\n double c = K / ((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));\\n if(c>=min(x1,x2) && c <= max(x1,x2)){\\n double d = (y1-y2) / (x1-x2) * c + (x1*y2 - x2*y1)/(x1-x2);\\n ret = (c-a[i]) * (c-a[i]) + (d-b[i]) * (d-b[i]);\\n ret = sqrt(ret);\\n }\\n if(ret+eps < d){\\n d = ret;\\n }\\n }\\n dist[i] = min(dist[i],d);\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.1147,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2774_3967891\",\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\\n// xy平面上の点(ベクトル)を表現するには、complex型を利用するとよい\\ntypedef complex<double> P;\\n\\n// 辺の表現 (座標を2つ pair でもつ)\\ntypedef pair<P, P> L;\\n\\n// 円の表現 (座標 P と 半径 d で表現する)\\ntypedef pair<P, double> C;\\n\\n// 成分を取り出すのを簡単にする\\n#define X real()\\n#define Y imag()\\n\\n// 誤差(epsilon)の定義\\n#define EPS (1e-10)\\n\\n// 2つの要素が等しいかどうか\\n#define EQ(a,b) (abs((a) - (b)) < EPS)\\n\\n// 2つのベクトルが等しいかどうか\\n#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )\\n\\n// m は n より大きい(以上)かどうか\\n#define LE(n, m) ((n) < (m) + EPS)\\n#define LEQ(n, m) ((n) <= (m) + EPS)\\n\\n// m は n より小さい(以下)かどうか\\n#define GE(n, m) ((n) + EPS > (m))\\n#define GEQ(n, m) ((n) + EPS >= (m))\\n\\n// 2つのベクトルの内積を求める\\ndouble dot(P a, P b) {\\n return (a.X * b.X + a.Y * b.Y);\\n}\\n\\n// 2つのベクトルの外積を求める\\ndouble cross(P a, P b) {\\n return (a.X * b.Y - a.Y * b.X);\\n}\\n\\n// ccw (c が直線(線分) ab に対してどのような位置関係か？)\\n// Verified: AOJ CGL_1_C: Counter-Clockwise\\n// +1 ... a → b で半時計方向に折れて b → c (COUNTER_CLOCKWISE)\\n// -1 ... a → b で時計方向に折れて b → c (CLOCKWISE)\\n// +2 ... c, a, b がこの順で同一直線状にある場合 (ONLINE_BACK)\\n// -2 ... a, b, c がこの順で同一直線状にある場合 ( or a == b ) (ONLINE_FRONT)\\n// 0 ... c が線分 ab 上にある場合 (点 a, b 上を含む) (ON_SEGMENT)\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if( cross(b,c) > EPS ) return +1;\\n if( cross(b,c) < -EPS ) return -1;\\n if( dot(b,c) < 0 ) return +2;\\n if( norm(b) < norm(c) ) return -2;\\n return 0;\\n}\\n\\n// 点 a1, a2 を端点とする線分と点 b との距離\\ndouble dist_sp(P a1, P a2, P b) {\\n if( dot(a2-a1, b-a1) < EPS ) return abs(b - a1);\\n if( dot(a1-a2, b-a2) < EPS ) return abs(b - a2);\\n return abs( cross(a2-a1, b-a1) ) / abs(a2 - a1);\\n}\\n\\nint main() {\\n int N, M; cin >> N >> M;\\n vector<P> points(N+1);\\n for(int i=0; i<N+1; i++) {\\n int x, y; cin >> x >> y;\\n points[i] = P(x, y);\\n }\\n\\n vector<bool> selected(N+1, false);\\n selected[0] = true;\\n vector<double> dist(N+1, INF), pdist(N+1, INF), best(N+1, -1);\\n for(int i=1; i<=N; i++) {\\n double x = points[0].real() - points[i].real();\\n double y = points[0].imag() - points[i].imag();\\n dist[i] = sqrt(x*x + y*y);\\n pdist[i] = dist[i];\\n best[i] = 0;\\n }\\n\\n double ans = 0;\\n for(int i=0; i<M; i++) {\\n double min_val = INF; int argmin = -1;\\n for(int k=1; k<=N; k++) {\\n if(selected[k]) continue;\\n // fprintf(stderr, \\\"k = %d, dist = %.12f\\\\n\\\", k, dist[k]);\\n if(min_val > dist[k]) {\\n min_val = dist[k];\\n argmin = k;\\n }\\n }\\n\\n ans += pdist[argmin];\\n selected[argmin] = true;\\n\\n // argmin と best[argmin] で辺ができる\\n // 辺との距離\\n int u = argmin, v = best[argmin];\\n // fprintf(stderr, \\\"u = %d, v = %d\\\\n\\\", u, v);\\n for(int k=0; k<=N; k++) {\\n double cost = dist_sp(points[u], points[v], points[k]);\\n if(dist[k] > cost) {\\n dist[k] = cost;\\n }\\n }\\n\\n // 頂点との距離\\n // 誰とつなぐのが最も近いかも更新\\n for(int k=0; k<=N; k++) {\\n double x = points[argmin].real() - points[k].real();\\n double y = points[argmin].imag() - points[k].imag();\\n\\n double cost = sqrt(x*x + y*y);\\n dist[k] = min(dist[k], cost);\\n\\n if(pdist[k] > cost) {\\n pdist[k] = cost;\\n best[k] = argmin;\\n }\\n }\\n }\\n printf(\\\"%.12f\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.2815,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2774_3844897\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <tuple>\\n#include <bitset>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nstruct Vector {\\n\\tint x, y;\\n\\tint cross(const Vector that) const { return x * that.y - y * that.x; }\\n\\tint dot(const Vector that) const { return x * that.x + y * that.y; }\\n};\\nstruct Point {\\n\\tint x, y;\\n\\tdouble distance(const Point that) const {\\n\\t\\treturn std::sqrt((x - that.x) * (x - that.x) + (y - that.y) * (y - that.y));\\n\\t}\\n\\tVector operator-(const Point& that) const {\\n\\t\\treturn Vector{ x - that.x, y - that.y };\\n\\t}\\n};\\nstruct Edge {\\n\\tPoint from, to;\\n\\tbool has_catheti(const Point& that) const {\\n\\t\\treturn (to - from).dot(that - from) >= 0 && (from - to).dot(that - to) >= 0;\\n\\t}\\n\\tdouble catheti_length(const Point& that) const {\\n\\t\\treturn std::abs((to.y - from.y) * that.x - (to.x - from.x) * that.y + to.x * from.y - to.y * from.x) / std::sqrt((to.y - from.y) * (to.y - from.y) + (to.x - from.x) * (to.x - from.x));\\n\\t}\\n\\tdouble length() const { return from.distance(to); }\\n};\\nint main() {\\n\\tint n, m, x, y; std::cin >> n >> m >> x >> y;\\n\\tstd::vector<Point> points(n + 1); points[0] = Point{ x, y };\\n\\tfor (auto i = 1; i <= n; ++i) std::cin >> points[i].x >> points[i].y;\\n\\tstd::vector<double> nearest_distance_to_point(n + 1, DBL_MAX), nearest_distance_to_edge(n + 1, DBL_MAX);\\n\\tstd::vector<int> nearest_point(n + 1, 0);\\n\\tstd::vector<int> rest(n + 1, -1); for (auto i = 0; i < n; ++i) rest[i] = i + 1;\\n\\tauto comparator = [](const std::pair<int, double>& a, const std::pair<int, double>& b) { return (std::abs(a.second - b.second) < 0.0000000001) ? a.first > b.first : a.second > b.second; };\\n\\tstd::priority_queue<std::pair<int, double>, std::vector<std::pair<int, double>>, decltype(comparator)> queue(comparator);\\n\\tfor (auto i = 1; i <= n; ++i) {\\n\\t\\tnearest_distance_to_point[i] = points[0].distance(points[i]);\\n\\t\\tqueue.emplace(i, nearest_distance_to_point[i]);\\n\\t\\tif (nearest_distance_to_point[0] < nearest_distance_to_point[i]) {\\n\\t\\t\\tnearest_distance_to_point[0] = nearest_distance_to_point[i];\\n\\t\\t\\tnearest_point[0] = i;\\n\\t\\t}\\n\\t}\\n\\tdouble result = 0;\\n\\tfor (auto c = 0; c < m; ++c) {\\n\\t\\twhile (nearest_point[queue.top().first] == -1) queue.pop();\\n\\t\\tauto top = queue.top(); queue.pop();\\n\\t\\tauto edge = Edge{ points[top.first], points[nearest_point[top.first]] };\\n\\t\\tresult += nearest_distance_to_point[top.first];\\n\\t\\tnearest_point[top.first] = -1;\\n\\t\\tfor (auto i = 0; i < n - c - 1; ++i) {\\n\\t\\t\\tif (rest[i] == top.first) {\\n\\t\\t\\t\\trest[i] = rest[n - c - 1];\\n\\t\\t\\t}\\n\\t\\t\\tauto distance = points[top.first].distance(points[rest[i]]);\\n\\t\\t\\tif (nearest_distance_to_point[rest[i]] > distance) {\\n\\t\\t\\t\\tnearest_distance_to_point[rest[i]] = distance;\\n\\t\\t\\t\\tnearest_point[rest[i]] = top.first;\\n\\t\\t\\t\\tif (nearest_distance_to_edge[rest[i]] > distance) {\\n\\t\\t\\t\\t\\tnearest_distance_to_edge[rest[i]] = distance;\\n\\t\\t\\t\\t\\tqueue.emplace(rest[i], distance);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (edge.has_catheti(points[rest[i]])) {\\n\\t\\t\\t\\tauto d = edge.catheti_length(points[rest[i]]);\\n\\t\\t\\t\\tif (nearest_distance_to_edge[rest[i]] > d) {\\n\\t\\t\\t\\t\\tnearest_distance_to_edge[rest[i]] = d;\\n\\t\\t\\t\\t\\tqueue.emplace(rest[i], d);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::cout << std::setprecision(15) << std::fixed << result << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 35880,\n \"score_of_the_acc\": -0.9946,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2774_2917956\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \\\"(\\\" << o.first << \\\",\\\" << o.second << \\\")\\\"; return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \\\" \\\";} return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \\\"{ \\\"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \\\":\\\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \\\", \\\"; } out << \\\" }\\\"; return out; }\\n\\n/*\\n <url:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2774>\\n 問題文============================================================\\n =================================================================\\n 解説=============================================================\\n \\n prim法の要領で辺を追加するたびに、各頂点への最短距離を更新していけば良い\\n ================================================================\\n */\\ntypedef double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-9, pi = acos(-1.0);\\nnamespace std {\\n bool 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}\\n\\nclass Line {\\npublic:\\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 Point operator[](const int _num) {\\n if (_num == 0) return a;\\n else if (_num == 1) return b;\\n else assert(false);\\n }\\n};\\n\\nld dot(Point a, Point b) { return real(conj(a)*b); }\\nPoint proj(Line l, Point p) {\\n ld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + t * (l.a - l.b);\\n}\\nbool isis_sp(Line s, Point p) {\\n return (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\nld dist_sp(Line s, Point p) {\\n Point r = proj(s, p);\\n return isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\nvoid solve() {\\n int N, M, X, Y; cin >> N >> M >> X >> Y;\\n vector<int> flag(N+1, 0);\\n vector<Point> ps(N+1);\\n ps[0] = Point(X, Y); flag[0] = 1;\\n for (int i = 1; i <= N; i++) {\\n int a, b; cin >> a >> b;\\n ps[i] = Point(a, b);\\n }\\n \\n ld ans = 0;\\n vector<double> dist(N + 1, LINF);\\n for (int i = 0; i <= N; i++) {\\n dist[i] = abs(ps[i] - ps[0]);\\n }\\n for (int i = 0; i < M; i++) {\\n ld len = LINF;\\n int idx = -1;\\n for (int i = 0; i <= N; i++) {\\n if (flag[i] == 1) continue;\\n if (len > dist[i]) {\\n len = dist[i];\\n idx = i;\\n }\\n }\\n \\n len = LINF;\\n int pidx = -1;\\n for (int i = 0; i <= N; i++) {\\n if (flag[i] == 1) {\\n ld d = abs(ps[i] - ps[idx]);\\n if (len > d) {\\n len = d;\\n pidx = i;\\n }\\n }\\n }\\n ans += abs(ps[idx] - ps[pidx]);\\n flag[idx] = 1;\\n Line L(ps[idx], ps[pidx]);\\n for (int i = 0; i <= N; i++) {\\n if (flag[i] == 1) continue;\\n dist[i] = min(dist[i], dist_sp(L, ps[i]));\\n }\\n }\\n cout << fixed << setprecision(12) << ans << endl;\\n}\\n\\nint main() {\\n cin.tie(0); ios_base::sync_with_stdio(false);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1200,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.6931,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2774_2720555\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 5001\\n\\nstruct Point{\\n double x,y;\\n};\\n\\ntypedef Point Vector;\\n\\nstruct Line{\\n void set(double x1,double y1,double x2,double y2){\\n p1.x = x1;\\n p1.y = y1;\\n p2.x = x2;\\n p2.y = y2;\\n }\\n Point p1,p2;\\n};\\n\\ntypedef Line Segment;\\n\\nint N,M;\\nbool is_nenkin[NUM];\\nPoint point[NUM];\\ndouble min_dist[NUM];\\nint index[NUM];\\n\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nPoint calc_minus(Point a,Point b){\\n Point ret;\\n\\n ret.x = a.x-b.x;\\n ret.y = a.y-b.y;\\n\\n return ret;\\n}\\n\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p2,l.p1),calc_minus(p,l.p1))/calc_len(calc_minus(l.p2,l.p1)));\\n}\\n\\ndouble getDistanceSP(Segment s,Point p){\\n\\tif(dot(calc_minus(s.p2,s.p1),calc_minus(p,s.p1)) < 0.0)return calc_len(calc_minus(p,s.p1));\\n\\tif(dot(calc_minus(s.p1,s.p2),calc_minus(p,s.p2)) < 0.0)return calc_len(calc_minus(p,s.p2));\\n\\treturn getDistanceLP(s,p);\\n}\\n\\n\\ndouble calc_dist(int from,int to){\\n\\treturn sqrt((point[from].x-point[to].x)*(point[from].x-point[to].x)+(point[from].y-point[to].y)*(point[from].y-point[to].y));\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %lf %lf\\\",&N,&M,&point[0].x,&point[0].y);\\n\\n\\tis_nenkin[0] = true;\\n\\tmin_dist[0] = 0;\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tis_nenkin[i] = false;\\n\\t\\tmin_dist[i] = DBL_MAX;\\n\\t\\tscanf(\\\"%lf %lf\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\n\\tint next;\\n\\tdouble minimum = DBL_MAX,tmp_dist;\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\ttmp_dist = calc_dist(0,i);\\n\\t\\tif(minimum > tmp_dist){\\n\\t\\t\\tminimum = tmp_dist;\\n\\t\\t\\tnext = i;\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int> Group;\\n\\n\\tdouble ans = minimum;\\n\\tis_nenkin[next] = true;\\n\\tGroup.push_back(0);\\n\\tGroup.push_back(next);\\n\\n\\tLine first_line;\\n\\tfirst_line.set(point[0].x,point[0].y,point[next].x,point[next].y);\\n\\n\\tminimum = DBL_MAX;\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tif(is_nenkin[i])continue;\\n\\t\\ttmp_dist = getDistanceSP(first_line,point[i]);\\n\\t\\tmin_dist[i] = tmp_dist;\\n\\t}\\n\\n\\tint count = 1,from;\\n\\n\\twhile(count < M){\\n\\n\\t\\tminimum = DBL_MAX;\\n\\t\\tfor(int i = 1; i <= N; i++){\\n\\t\\t\\tif(is_nenkin[i])continue;\\n\\t\\t\\tif(minimum > min_dist[i]){\\n\\t\\t\\t\\tminimum = min_dist[i];\\n\\t\\t\\t\\tnext = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tminimum = DBL_MAX;\\n\\t\\tfor(int i = 0; i < Group.size(); i++){\\n\\t\\t\\ttmp_dist = calc_dist(next,Group[i]);\\n\\t\\t\\tif(minimum > tmp_dist){\\n\\t\\t\\t\\tminimum = tmp_dist;\\n\\t\\t\\t\\tfrom = Group[i];\\n\\t\\t\\t}else if(fabs(minimum-tmp_dist) < EPS){\\n\\t\\t\\t\\tif(from > Group[i]){\\n\\t\\t\\t\\t\\tfrom = Group[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tans += minimum;\\n\\t\\tcount++;\\n\\t\\tif(count == M)break;\\n\\n\\t\\tis_nenkin[next] = true;\\n\\t\\tGroup.push_back(next);\\n\\t\\tLine new_line;\\n\\t\\tnew_line.set(point[from].x,point[from].y,point[next].x,point[next].y);\\n\\n\\t\\tfor(int i = 1; i <= N; i++){\\n\\t\\t\\tif(is_nenkin[i])continue;\\n\\n\\t\\t\\tmin_dist[i] = min(min_dist[i],getDistanceSP(new_line,point[i]));\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.0828,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2774_2559902\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 1120000000\\n\\nusing P = pair<int,int>;\\n\\nlong dist(P &a, P &b){\\n long x=a.fi-b.fi;\\n long y=a.se-b.se;\\n return x*x+y*y;\\n}\\n\\ndouble dist(P &a, P &b, P &c){\\n long ipa = (b.fi-a.fi)*(c.fi-a.fi) + (b.se-a.se)*(c.se-a.se);\\n long ipb = (a.fi-b.fi)*(c.fi-b.fi) + (a.se-b.se)*(c.se-b.se);\\n if(ipa<=0 || ipb<=0) return min(dist(a,c), dist(b,c));\\n else {\\n long outacab = (c.fi-a.fi)*(b.se-a.se) - (c.se-a.se)*(b.fi-a.fi);\\n return (double)outacab*outacab / dist(a,b);\\n }\\n}\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n vector<P> p(n+1);\\n cin>>p[0].fi>>p[0].se;\\n rep(i,1,n+1) cin>>p[i].fi>>p[i].se;\\n\\n n++;\\n\\n vector<bool> used(n, false);\\n used[0]=true;\\n vector<double> dd(n); // dist^2\\n rep(i,n) dd[i] = dist(p[0],p[i]);\\n dd[0] = INF;\\n\\n double ans = 0;\\n rep(_,m){\\n int cand = 0;\\n rep(j,1,n) if(!used[j] && dd[cand] > dd[j]) cand = j;\\n\\n double add = INF;\\n int from = 0;\\n rep(j,n) if(used[j] && dist(p[cand], p[j]) < add) from=j, add = dist(p[cand], p[j]);\\n\\n ans += sqrt(add);//dbg(add,from);\\n used[cand] = true;\\n\\n rep(j,n) if(!used[j]) dd[j] = min<double>(dd[j], dist(p[cand], p[from], p[j]));\\n }\\n\\n printf(\\\"%.10f\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 3248,\n \"score_of_the_acc\": -0.1229,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2774_2559901\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 1120000000\\n\\nusing P = pair<int,int>;\\n\\nlong dist(P &a, P &b){\\n long x=a.fi-b.fi;\\n long y=a.se-b.se;\\n return x*x+y*y;\\n}\\n\\ndouble dist(P &a, P &b, P &c){\\n long ipa = (b.fi-a.fi)*(c.fi-a.fi) + (b.se-a.se)*(c.se-a.se);\\n long ipb = (a.fi-b.fi)*(c.fi-b.fi) + (a.se-b.se)*(c.se-b.se);\\n if(ipa<=0 || ipb<=0) return min(dist(a,c), dist(b,c));\\n else {\\n long outacab = (c.fi-a.fi)*(b.se-a.se) - (c.se-a.se)*(b.fi-a.fi);\\n return (double)outacab*outacab / dist(a,b);\\n }\\n}\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n vector<P> p(n+1);\\n cin>>p[0].fi>>p[0].se;\\n rep(i,1,n+1) cin>>p[i].fi>>p[i].se;\\n\\n n++;\\n\\n vector<bool> used(n, false);\\n used[0]=true;\\n vector<int> dd(n); // dist^2\\n rep(i,n) dd[i] = dist(p[0],p[i]);\\n dd[0] = INF;\\n\\n double ans = 0;\\n rep(_,m){\\n int cand = 0;\\n rep(j,1,n) if(!used[j] && dd[cand] > dd[j]) cand = j;\\n\\n double add = INF;\\n int from = 0;\\n rep(j,n) if(used[j] && dist(p[cand], p[j]) < add) from=j, add = dist(p[cand], p[j]);\\n\\n ans += sqrt(add);//dbg(add,from);\\n used[cand] = true;\\n\\n rep(j,n) if(!used[j]) dd[j] = min<int>(dd[j], dist(p[cand], p[from], p[j]));\\n }\\n\\n printf(\\\"%.10f\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 260,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -0.0833,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1663,"cells":{"group_id":{"kind":"string","value":"aoj_2775_cpp"},"problem_description":{"kind":"string","value":"D: Complex Oracle - Complex Oracle -\n問題\n※この問題はリアクティブ問題です．すなわち，サーバー側に用意されたプログラムと対話的に応答することで正答を導くプログラムを作成する必要があります．\nまた、サーバー側のプログラムも計算機資源を共有する関係上、サーバーだけで最大 3 sec程度の実行時間、最大 300 MB程度のメモリを使用する場合がありますので、TLE・MLEにお気をつけください。\nあいずにゃんは若ヶ松高校のプログラミングコンテスト部、通称ぷろこん部に所属する2年生である。見目麗しい。あいずにゃんはその小さな体も無限に存在するチャームポイントの1つであるが、本人はコンプレックスを感じているようだ。そのせいか、一列に並んでいる人たちを見ると、それぞれの人の前方にその人より身長が高い人が何人並んでいるかを瞬時に数えられる能力を持っている。\nプロコンの名門・律命館大学中等部卒のエリート競技プログラマであり、ぷろこん部の部長であるりっつちゃんは、あいずにゃんのこの能力を使えば、並んでいる人たちがそれぞれ何番目に背が高いのかを当てることができるのではないかと考えた。\n今、りっつちゃんは\nN\n人が並んでいる列をあいずにゃんに見せている。りっつちゃんは、人が\nN\n人並んでいることは知っているが、その並び順がどうなっているかはわからない。りっつちゃんはあいずにゃんに “\nl\n番目の人から\nr\n番目の人までコンプレックス度” を教えてもらうことができる。ここで、\nl\n番目の人から\nr\n番目の人までのコンプレックス度とは、\ni\n(\nl \\≤ i \\≤ r\n) 番目の人それぞれに関して、\nl\n番目から\ni − 1\n番目までの間にいる自分 (\ni\n) より背が高い人の人数の総和である。(より厳密な定義は入出力形式を参照のこと)\n(うらやましいことに) ぷろこん部の部員であるあなたは、(とても、とても心苦しいが) あいずにゃんをオラクルとして利用することで身長順を当てるプログラムを書くようりっつちゃんに命じられた。つらい。せめてあいずにゃんに負担をかけないよう、少ない質問回数で求められるよう頑張ろう。\n入力出力形式\nサーバーは背の順を表す長さ\nN\nの数列\np\nを保持している。これは入力として与えられない。\np\nの各要素\np_i\nは\n1\n以上\nN\n以下であり、それぞれ値は異なる。\np_i\nが大きい値を持つ方が背が高いことを表す。\nサーバーはまず、\np\nの長さ\nN\nを表す\n1\nつの整数からなる\n1\n行を入力として解答プログラムに与える。\n次に解答プログラムが\n2\nつの整数\nl, r\n(\n1 \\≤ l \\≤ r \\≤ N\n) からなるクエリをサーバーに送る。クエリの出力形式は\n?\nl\nr\nである。これは例えばC/C++だと、\nprintf(\"? %d %d\\n\", l, r); fflush(stdout);\nなどと書けばよい。出力の度にフラッシュすることを推奨する。\nすると、サーバー側は以下の値を表す\n1\nつの整数\nC\nからなる1行を入力として解答プログラムに与える。\nC = (\\{ (i, j) | p_i > p_j\n{\\rm for}\nl \\≤ i<j \\≤ r \\}の要素数)\nただし、クエリとして正しくない\nl, r\n(\nl, r\nが\n1\n以上\nN\n以下の数ではない、または\nl>r\nである) が与えられた場合、サーバーは\n−1\nを\nC\nとして返す。\nこの応答を何度か繰り返し、解答プログラムが\np\nを推定できたならば、\np\nを以下の形式で出力する。\n!\np_1\n...\np_N\n推定した順列の出力は1度しかできず、この出力が\np\nと異なる場合、誤答となる。200,000回以内のクエリで正しい\np\nを出力できた場合、正答となる。\n各クエリで改行を行うよう気をつけること。\n入力制約\n1 \\≤ N \\≤ 100,000\n推定される長さ\nN\nの数列\np\nは順列。すなわち、\np_i \\in \\{1,\n...\n, N\\}\n{\\rm for}\n1 \\≤ i \\≤ N\n、および\np_i \\neq p_j\n{\\rm for}\n1 \\≤ i < j \\≤ N\nを満たす\nサーバーへのクエリ回数は200,000回まで\nサーバーから返答される\nC\nは32bit整数型では収まらない大きさになりうることに注意せよ\n入力出力例\nサーバーの出力\nサーバーへの入力\n4\n? 1 3\n2\n? 2 4\n1\n...\n...\n! 4 1 3 2"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2775_10850453","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\n#define FOR(i,s,t) for(int i =s; i < t;i++)\n#define SZ(a) (int)a.size()\n#define ALL(a) a.begin(),a.end()\n#define debug(a) cout<<#a<<\":=\"<<a<<endl;\n#define int long long\nstruct BIT {\n\tint N, nn; vector<int> data;\n\tBIT(int n) {\n\t\tN = n + 1;\n\t\tdata = vector<int>(n + 1, 0);\n\t\tnn = 1;\n\t\twhile (nn * 2 <= N)nn *= 2;\n\t}\n\tvoid add(int i, int w) {\n\t\ti++;\n\t\tfor (int x = i; x < N; x += x & -x) {\n\t\t\tdata[x] += w;\n\t\t}\n\t}\n\tint sum(int i) { // [0,i)\n\t\tint ret = 0;\n\t\tfor (int x = i; x > 0; x -= x & -x) {\n\t\t\tret += data[x];\n\t\t}\n\t\treturn ret;\n\t}\n\t// [l,r)\n\tint sum(int l, int r) {\n\t\treturn sum(r) - sum(l);\n\t}\n};\n\nvoid solve() {\n\tint N;\n\tcin >> N;\n\tBIT bit(N);\n\tFOR(i, 0, N) {\n\t\tbit.add(i, 1);\n\t}\n\tLL kim = N;\n\tVI ans(N, -1);\n\tVI SET(N, 0);\n\tcout << \"? 1 \" << N<< endl;\n\tcin >> kim;\n\tfor (int i = N - 1; i >= 1; i--) {\n\t\tcout << \"? 1 \" << i << endl;\n\t\tLL nx; cin >> nx;\n\t\tLL val = kim - nx + 1;\n\t\tint l = 0; int r = N;\n\t\tFOR(unchi, 0, 30) {\n\t\t\tint mid = (l + r) / 2;\n\t\t\tif (bit.sum(mid, N) >= val) {\n\t\t\t\tl = mid;\n\t\t\t}\n\t\t\telse r = mid;\n\t\t}\n\t\tans[i] = l;\n\t\tSET[l] = 1;\n\t\tif (bit.sum(l, l + 1) == 1)bit.add(l, -1);\n\t\tkim = nx;\n\t}\n\tFOR(i, 0, N) {\n\t\tif (!SET[i])ans[0] = i;// , debug(i);\n\t}\n\tcout << \"!\";\n\tFOR(i, 0, N) {\n\t\tassert(ans[i] != -1);\n\t\tcout << \" \" << ans[i] + 1;\n\t}\n\tcout << endl;\n\n}\n\nsigned main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\n\tsolve();\n\n\treturn 0;\n}","accuracy":1,"time_ms":1260,"memory_kb":291740,"score_of_the_acc":-1.2633,"final_rank":3},{"submission_id":"aoj_2775_10259994","code_snippet":"// AOJ #2775 Complex Oracle\n// 2025.3.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n \nstruct Fenw {\n int n;\n vector<int> f;\n Fenw(int n): n(n), f(n+1,0){}\n void upd(int i, int d) {\n for(; i<=n; i+= i&-i) f[i]+=d;\n }\n int sum(int i) {\n int s=0;\n for(; i; i-= i&-i) s+=f[i];\n return s;\n }\n int kth(int k) {\n int idx = 0;\n for (int bit = 1 << 20; bit; bit >>= 1) {\n int nxt = idx + bit;\n if(nxt<=n && f[nxt] < k){\n k -= f[nxt];\n idx = nxt;\n }\n }\n return idx+1;\n }\n};\n \nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N; cin >> N;\n vector<ll> P(N+1,0), b(N+1,0);\n\n for(int i=2;i<=N;i++){\n cout << \"? \" << 1 << \" \" << i << \"\\n\";\n cout.flush();\n ll r; cin >> r;\n P[i]=r;\n }\n b[1]=0;\n for(int i=2;i<=N;i++) b[i] = P[i]-P[i-1];\n\n Fenw fenw(N);\n for(int i=1;i<=N;i++) fenw.upd(i,1);\n\n vector<int> ans(N+1,0);\n for(int i=N;i>=1;i--){\n int sz = fenw.sum(N);\n int k = b[i] + 1;\n int pos = fenw.kth(sz - k + 1);\n ans[i] = pos;\n fenw.upd(pos, -1);\n }\n cout << \"!\";\n for(int i=1;i<=N;i++) cout << \" \" << ans[i];\n cout << endl;\n cout.flush();\n return 0;\n}","accuracy":1,"time_ms":1230,"memory_kb":291764,"score_of_the_acc":-1.2569,"final_rank":2},{"submission_id":"aoj_2775_8470731","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2775.cc: Complex Oracle\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;\n\ntemplate <typename T>\nstruct BIT {\n int n;\n vector<T> bits;\n \n BIT() {}\n BIT(int _n) { init(_n); }\n\n void init(int _n) {\n n = _n;\n bits.assign(n + 1, 0);\n }\n\n T sum(int x) {\n x = min(x, n);\n T s = 0;\n while (x > 0) {\n s += bits[x];\n x -= (x & -x);\n }\n return s;\n }\n\n void add(int x, T v) {\n if (x <= 0) return;\n while (x <= n) {\n bits[x] += v;\n x += (x & -x);\n }\n }\n\n int lower_bound(T v) {\n int\tk = 1;\n while ((k << 1) <= n) k <<=\t1;\n int\tx = 0;\n for\t(; k > 0; k >>= 1)\n if (x + k <= n && bits[x + k] < v) {\n x += k;\n v -= bits[x];\n }\n return x + 1;\n }\n};\n\n/* global variables */\n\nll cs[MAX_N];\nint ds[MAX_N], ps[MAX_N];\nBIT<int> bit;\n\n/* subroutines */\n\nll query(int i, int j) {\n printf(\"? %d %d\\n\", i + 1, j + 1); fflush(stdout);\n\n ll c;\n scanf(\"%lld\", &c);\n return c;\n}\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n\n cs[0] = 0;\n for (int i = 1; i < n; i++) {\n cs[i] = (ll)i * (i + 1) / 2 - query(0, i);\n ds[i] = cs[i] - cs[i - 1];\n }\n\n bit.init(n);\n for (int i = 1; i <= n; i++) bit.add(i, 1);\n\n for (int i = n - 1; i >= 0; i--) {\n int l = 0, r = n;\n while (l + 1 < r) {\n int m = (l + r) / 2;\n if (bit.sum(m) > ds[i]) r = m;\n else l = m;\n }\n\n ps[i] = r;\n bit.add(r, -1);\n }\n\n putchar('!');\n for (int i = 0; i < n; i++) printf(\" %d\", ps[i]);\n putchar('\\n'); fflush(stdout);\n\n return 0;\n}","accuracy":1,"time_ms":1220,"memory_kb":291764,"score_of_the_acc":-1.2548,"final_rank":1},{"submission_id":"aoj_2775_6940120","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=2167167167167167167;\nconst int INF=2100000000;\nconst ll mod=1e9+7;\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\";}\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\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;\n\tcin>>N;\n\tvector<ll> p(N);\n\tll tmp=0;\n\trep(i,N-1){\n\t\tcout<<\"? 1 \"<<i+2<<endl;\n\t\tll a;\n\t\tcin>>a;\n\t\tp[i+1]=i+1-(a-tmp);\n\t\ttmp=a;\n\t}\n\t//vec_out(p);\n\ttmp=0;\n\tfor(int i=N-2;i>=0;i--){\n\t\tcout<<\"? \"<<i+1<<\" \"<<N<<endl;\n\t\tll a;\n\t\tcin>>a;\n\t\tp[i]+=a-tmp;\n\t\ttmp=a;\n\t}\n\t//vec_out(p);\n\tcout<<\"!\";\n\trep(i,N){\n\t\tcout<<\" \"<<p[i]+1;\n\t}\n\tcout<<endl;\n}","accuracy":1,"time_ms":2190,"memory_kb":291716,"score_of_the_acc":-1.4623,"final_rank":10},{"submission_id":"aoj_2775_5535188","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#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}\n\n// 1-indexed\ntemplate<typename T>\nstruct BIT{\n int n;\n vector<T> bit;\n BIT(int n_=0):n(n_),bit(n+1){}\n T sum(int i){\n T res=0;\n for(;i>0;i-=(i&-i))res+=bit[i];\n return res;\n }\n void add(int i,T a){\n if(i==0)return;\n for(;i<=n;i+=(i&-i)){bit[i]+=a;}\n }\n int lower_bound(T k){ // k<=sum(res)\n if(k<=0)return 0;\n int res=0,i=1;\n while((i<<1)<=n)i<<=1;\n for(;i;i>>=1){\n if(res+i<=n&&bit[res+i]<k)k-=bit[res+=i];\n }\n return res+1;\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n; cin >> n;\n vector<ll> query(n+1);\n BIT<int> bit(n+1);\n for(int i=1;i<=n;i++){\n cout << \"? \" << i << \" \" << n << endl;\n cin >> query[i];\n bit.add(i,1);\n }\n vector<int> res(n+1);\n for(int i=1;i+1<=n;i++){\n ll u=query[i]-query[i+1]+1;\n int id=bit.lower_bound(u);\n bit.add(id,-1);\n res[i]=id;\n }\n res[n]=bit.lower_bound(1);\n cout << \"!\";\n for(int i=1;i<=n;i++){\n cout << \" \" << res[i];\n }\n cout << endl;\n}","accuracy":1,"time_ms":1340,"memory_kb":291776,"score_of_the_acc":-1.2805,"final_rank":5},{"submission_id":"aoj_2775_5535187","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#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}\n\n// 1-indexed\ntemplate<typename T>\nstruct BIT{\n int n;\n vector<T> bit;\n BIT(int n_=0):n(n_),bit(n+1){}\n T sum(int i){\n T res=0;\n for(;i>0;i-=(i&-i))res+=bit[i];\n return res;\n }\n void add(int i,T a){\n if(i==0)return;\n for(;i<=n;i+=(i&-i)){bit[i]+=a;}\n }\n int lower_bound(T k){ // k<=sum(res)\n if(k<=0)return 0;\n int res=0,i=1;\n while((i<<1)<=n)i<<=1;\n for(;i;i>>=1){\n if(res+i<=n&&bit[res+i]<k)k-=bit[res+=i];\n }\n return res+1;\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n; cin >> n;\n vector<int> query(n+1);\n BIT<int> bit(n+1);\n for(int i=1;i<=n;i++){\n cout << \"? \" << i << \" \" << n << endl;\n cin >> query[i];\n bit.add(i,1);\n }\n vector<int> res(n+1);\n for(int i=1;i+1<=n;i++){\n int u=query[i]-query[i+1]+1;\n int id=bit.lower_bound(u);\n bit.add(id,-1);\n res[i]=id;\n }\n res[n]=bit.lower_bound(1);\n cout << \"!\";\n for(int i=1;i<=n;i++){\n cout << \" \" << res[i];\n }\n cout << endl;\n}","accuracy":0.6176470588235294,"time_ms":30,"memory_kb":41248,"score_of_the_acc":-0.1041,"final_rank":20},{"submission_id":"aoj_2775_5532968","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) dat[k] = f(dat[k << 1], dat[(k << 1) | 1]);\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 // require: func(unit) == false\n // min left: st <= res && func(seg.query(st,res + 1))\n template <typename C>\n int find_left(int st, C &func, T &acc, int k, int l, int r) {\n if (l + 1 == r) {\n acc = f(acc, dat[k]);\n return func(acc) ? l : -1;\n }\n int mid = (l + r) >> 1;\n if (mid <= st) return find_left(st, func, acc, (k << 1) | 1, mid, r);\n if (st <= l && !func(f(acc, dat[k]))) {\n acc = f(acc, dat[k]);\n return -1;\n }\n int nres = find_left(st, func, acc, (k << 1), l, mid);\n if (~nres) return nres;\n return find_left(st, func, acc, (k << 1) | 1, mid, r);\n }\n template <typename C>\n int find_left(int st, C &func) {\n T acc = unit;\n return find_left(st, func, acc, 1, 0, n);\n }\n\n // max right: res <= st && func(seg.query(res - 1,st))\n template <typename C>\n int find_right(int st, C &func, T &acc, int k, int l, int r) {\n if (l + 1 == r) {\n acc = f(dat[k], acc);\n return func(acc) ? r : -1;\n }\n int mid = (l + r) >> 1;\n if (st <= mid) return find_right(st, func, acc, k << 1, l, mid);\n if (r <= st && !func(f(dat[k], acc))) {\n acc = f(dat[k], acc);\n return -1;\n }\n int nres = find_right(st, func, acc, (k << 1) | 1, mid, r);\n if (~nres) return nres;\n return find_right(st, func, acc, k << 1, l, mid);\n }\n template <typename C>\n int find_right(int st, C &func) {\n T acc = unit;\n return find_right(st, func, acc, 1, 0, n);\n }\n};\n\nint n;\nvector<long long> memo;\n\nvector<int> solve();\n\nint main() {\n cin >> n;\n memo.resize(n + 1);\n for (int i = 0; i < n - 1; ++i) {\n cout << \"? \" << i + 1 << \" \" << n << endl;\n cin >> memo[i];\n }\n auto res = solve();\n cout << \"!\";\n for (int i = 0; i < n; ++i) cout << \" \" << res[i] + 1;\n cout << endl;\n return 0;\n}\n\nvector<int> solve() {\n SegmentTree<int> seg(\n n, [](int l, int r) { return l + r; }, 0);\n vector<int> res(n);\n for (int i = 0; i < n; ++i) seg.update(i, 1);\n for (int i = 0; i < n; ++i) {\n int now = memo[i] - memo[i + 1] + 1;\n auto cmp = [&](int x) { return x >= now; };\n now = seg.find_left(0, cmp);\n res[i] = now;\n seg.update(now, 0);\n }\n return res;\n}","accuracy":1,"time_ms":1370,"memory_kb":291756,"score_of_the_acc":-1.2869,"final_rank":6},{"submission_id":"aoj_2775_5532668","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;\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;}\n// struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __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 cin>>n;\n V<ll> tmp(n),l(n);\n for(ll i=1;i<n;i++){\n cout<<\"? \"<<1<<\" \"<<i+1<<endl;\n ll v;\n cin>>v;\n tmp[i]=v;\n l[i]=i-(v-tmp[i-1]);\n }\n // print(tmp);\n tmp.assign(n,0);\n V<ll> r(n);\n for(int i=n-2;i>=0;i--){\n cout<<\"? \"<<i+1<<\" \"<<n<<endl;\n ll v;\n cin>>v;\n tmp[i]=v;\n r[i]=v-tmp[i+1];\n }\n V<ll> ans(n);\n for(int i=0;i<n;i++){\n ans[i]=l[i]+r[i]+1;\n }\n // print(l);\n // print(r);\n cout<<\"! \";\n for(int i=0;i<n;i++){\n cout<<ans[i];\n if(i==n-1){\n cout<<endl;\n }else{\n cout<<\" \";\n }\n }\n}","accuracy":1,"time_ms":2240,"memory_kb":291776,"score_of_the_acc":-1.4732,"final_rank":11},{"submission_id":"aoj_2775_5532597","code_snippet":"#include<bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n//#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"unroll-loops\")\nusing namespace std;\n//#include<boost/multiprecision/cpp_int.hpp>\n//#include<boost/multiprecision/cpp_dec_float.hpp>\n//namespace mp=boost::multiprecision;\n//#define mulint mp::cpp_int\n//#define mulfloat mp::cpp_dec_float_100\n//struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n#define INF (1<<30)\n#define LINF (lint)(1LL<<56)\n//#define endl \"\\n\"\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\n#define flc(x) __builtin_popcountll(x)\n#define pint pair<int,int>\n#define pdouble pair<double,double>\n#define plint pair<lint,lint>\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define vec vector<lint>\n#define nep(x) next_permutation(all(x))\ntypedef long long lint;\nint dx[8]={1,1,0,-1,-1,-1,0,1};\nint dy[8]={0,1,1,1,0,-1,-1,-1};\nconst int MAX_N=3e5+5;\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//vector<int> bucket[MAX_N/1000];\nconstexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n/*#include<atcoder/all>\nusing namespace atcoder;\ntypedef __int128_t llint;*/\n\ntemplate<typename U = unsigned, int B = 32>\nclass lazy_binary_trie {\n struct node {\n int cnt;\n U lazy;\n node *ch[2];\n node() : cnt(0), lazy(0), ch{ nullptr, nullptr } {}\n };\n void push(node* t, int b) {\n if ((t->lazy >> (U)b) & (U)1) swap(t->ch[0], t->ch[1]);\n if (t->ch[0]) t->ch[0]->lazy ^= t->lazy;\n if (t->ch[1]) t->ch[1]->lazy ^= t->lazy;\n t->lazy = 0;\n }\n node* add(node* t, U val, int b = B - 1) {\n if (!t) t = new node;\n t->cnt += 1;\n if (b < 0) return t;\n push(t, b);\n bool f = (val >> (U)b) & (U)1;\n t->ch[f] = add(t->ch[f], val, b - 1);\n return t;\n }\n node* sub(node* t, U val, int b = B - 1) {\n assert(t);\n t->cnt -= 1;\n if (t->cnt == 0) return nullptr;\n if (b < 0) return t;\n push(t, b);\n bool f = (val >> (U)b) & (U)1;\n t->ch[f] = sub(t->ch[f], val, b - 1);\n return t;\n }\n U get_min(node* t, U val, int b = B - 1) {\n assert(t);\n if (b < 0) return 0;\n push(t, b);\n bool f = (val >> (U)b) & (U)1; f ^= !t->ch[f];\n return get_min(t->ch[f], val, b - 1) | ((U)f << (U)b);\n }\n U get(node* t, int k, int b = B - 1) {\n if (b < 0) return 0;\n push(t, b);\n int m = t->ch[0] ? t->ch[0]->cnt : 0;\n return k < m ? get(t->ch[0], k, b - 1) : get(t->ch[1], k - m, b - 1) | ((U)1 << (U)b);\n }\n int count_lower(node* t, U val, int b = B - 1) {\n if (!t || b < 0) return 0;\n push(t, b);\n bool f = (val >> (U)b) & (U)1;\n return (f && t->ch[0] ? t->ch[0]->cnt : 0) + count_lower(t->ch[f], val, b - 1);\n }\n node *root;\npublic:\n lazy_binary_trie() : root(nullptr) {}\n int size() const {\n return root ? root->cnt : 0;\n }\n bool empty() const {\n return !root;\n }\n void insert(U val) {\n root = add(root, val);\n }\n void erase(U val) {\n root = sub(root, val);\n }\n void xor_all(U val) {\n if (root) root->lazy ^= val;\n }\n U max_element(U bias = 0) {\n return get_min(root, ~bias);\n }\n U min_element(U bias = 0) {\n return get_min(root, bias);\n }\n int lower_bound(U val) { // return id\n return count_lower(root, val);\n }\n int upper_bound(U val) { // return id\n return count_lower(root, val + 1);\n }\n U operator[](int k) {\n assert(0 <= k && k < size());\n return get(root, k);\n }\n int count(U val) {\n if (!root) return 0;\n node *t = root;\n for (int i = B - 1; i >= 0; i--) {\n push(t, i);\n t = t->ch[(val >> (U)i) & (U)1];\n if (!t) return 0;\n }\n return t->cnt;\n }\n};\n\nint main(void){\n int N;\n cin >> N;\n int ans[N];\n lint q[N];\n lazy_binary_trie<int,20> BT;\n rep(i,N) BT.insert(i+1);\n rep(i,N){\n cout << \"? \" << i+1 << \" \" << N << endl;\n cin >> q[i];\n if(i==0) continue;\n ans[i-1]=BT[q[i-1]-q[i]];\n BT.erase(ans[i-1]);\n }\n ans[N-1]=BT[0];\n cout << \"! \";\n rep(i,N){\n cout << ans[i];\n if(i!=N-1) cout << \" \";\n }\n cout << endl;\n}","accuracy":1,"time_ms":1400,"memory_kb":291776,"score_of_the_acc":-1.2934,"final_rank":7},{"submission_id":"aoj_2775_4926734","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#include <ext/rope>\nusing namespace __gnu_cxx;\n\n\nll query(ll l, ll r){\n l++;\n printf(\"? %lld %lld\\n\", l, r); fflush(stdout);\n scanf(\"%lld\", &l);\n return l;\n}\nvoid answer(vector<ll>a){\n putchar('!');\n for(ll i : a) printf(\" %lld\", i);\n puts(\"\");\n exit(0);\n}\nint main(){\n ll n;\n scanf(\"%lld\", &n);\n vector<ll> a(n + 1);\n for(ll i = 1; i <= n; i++) a[i] = query(0, i);\n rope<ll> x;\n for(ll i = n; i; i--) x.push_back(i);\n for(ll i = n; i; i--){\n auto p = x.mutable_begin() + (a[i] - a[i - 1]);\n a[i] = *p;\n x.erase(p);\n }\n a.erase(a.begin());\n answer(a);\n}","accuracy":1,"time_ms":1330,"memory_kb":291756,"score_of_the_acc":-1.2783,"final_rank":4},{"submission_id":"aoj_2775_4471789","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long int lli;\n\nint main(){\n int n;\n cin >> n;\n vector<lli> a(n), b(n);\n for(int i=0; i<n; i++){\n cout << \"? \" << 1 << \" \" << i+1 << endl;\n cin >> a[i];\n cout << \"? \" << i+1 << \" \" << n << endl;\n cin >> b[i];\n }\n for(int i=0; i<n-1; i++){\n a[n-1-i] -= a[n-2-i];\n b[i] -= b[i+1];\n }\n cout << \"!\";\n for(int i=0; i<n; i++){\n cout << \" \" << b[i]+1 +(i-a[i]);\n }\n cout << endl;\n return 0;\n}","accuracy":1,"time_ms":4650,"memory_kb":288960,"score_of_the_acc":-1.9792,"final_rank":16},{"submission_id":"aoj_2775_4471776","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long int lli;\n\nint main(){\n int n;\n cin >> n;\n vector<lli> a(n), b(n);\n for(int i=0; i<n; i++){\n cout << \"? \" << 1 << \" \" << i+1 << endl;\n cin >> a[i];\n cout << \"? \" << i+1 << \" \" << n << endl;\n cin >> b[i];\n }\n for(int i=n-2; i>=0; i--){\n a[i+1] -= a[i];\n b[n-i-2] -= b[n-i-1];\n }\n for(int i=0; i<n; i++){\n cout << a[i] << \" \" << b[i] << endl;\n }\n cout << \"!\";\n for(int i=0; i<n; i++){\n cout << \" \" << b[i]+1 +(i-a[i]);\n }\n cout << endl;\n return 0;\n}","accuracy":0.6176470588235294,"time_ms":130,"memory_kb":12140,"score_of_the_acc":-0.0214,"final_rank":19},{"submission_id":"aoj_2775_4471491","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\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; }\nconst ll INF=1LL<<60;\nconst int inf=(1<<30)-1;\nconst int mod=1e9+7;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;cin >> n;\n vector<int> p(n);\n vector<ll> l(n+1),r(n+1);\n for(int i=2;i<=n;i++){\n cout << \"? \" << 1 << \" \" << i << endl;\n cin >> l[i];\n }\n for(int i=1;i<=n-1;i++){\n cout << \"? \" << i << \" \" << n << endl;\n cin >> r[i-1];\n }\n for(int i=0;i<n;i++){\n ll u=l[i+1]-l[i];\n ll v=r[i]-r[i+1];\n p[i]=i-u+v;\n }\n cout << '!';\n for(int i=0;i<n;i++){\n cout << \" \" << p[i]+1;\n }\n cout << endl;\n}","accuracy":1,"time_ms":4600,"memory_kb":288900,"score_of_the_acc":-1.9683,"final_rank":15},{"submission_id":"aoj_2775_4096256","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint64_t question(int l, int r){\n cout << \"? \" << l + 1 << \" \" << r + 1 << endl;\n int64_t res;\n cin >> res;\n return res;\n}\n\nvoid output(vector<int> &A){\n cout << \"!\";\n for (const auto &a: A)\n cout << \" \" << a;\n cout << endl;\n}\n\nll INF = 1e9+7;\nll N, dat[2222222];\nvoid init(ll k){\n N = 1;\n while(N < k) N *= 2;\n for(ll i=0;i<2*N-1;i++) dat[i] = 0;\n}\n\nvoid update(ll k, ll num){\n k += N-1;\n dat[k] = num;\n while(k>0){\n k = (k-1)/2;\n dat[k] = dat[k*2 + 1] + dat[k*2+2];\n }\n}\n\n// query(a,b,0,0,n) → [a,b)\nll query(ll a, ll b, ll k, ll l, ll r){\n if(r<=a || b<=l) return 0;\n if(a<=l && r<=b) return dat[k];\n else{\n ll vl = query(a,b,k*2+1,l,(l+r)/2);\n ll vr = query(a,b,k*2+2,(l+r)/2,r);\n return vl+vr;\n }\n}\n\n\nsigned main(){\n ios::sync_with_stdio(false);\n\tcin.tie(0);\n cout << fixed << setprecision(20);\n\n int n;\n cin >> n;\n vector<int64_t> D(n);\n int64_t prev = 0;\n for (int i = 1; i < n; i++){\n auto res = question(0, i);\n D[i] = res - prev;\n prev = res;\n }\n init(n + 1);\n\n auto check = [&](auto k, auto d){\n return d < query(k, n + 1, 0, 0, N);\n };\n\n auto b_serach = [&](auto ok, auto ng, auto check, auto d){\n while (abs(ok - ng) > 1){\n auto mid = (ok + ng) / 2;\n (check(mid, d) ? ok : ng) = mid;\n }\n return ok;\n };\n\n for (int i = 1; i <= n; i++)\n update(i, 1);\n vector<int> ans(n);\n \n for (int i = n - 1; i >= 0; i--){\n int res = b_serach(0, n + 2, check, D[i]);\n update(res, 0);\n ans[i] = res;\n }\n\n output(ans);\n}","accuracy":1,"time_ms":2680,"memory_kb":288908,"score_of_the_acc":-1.5572,"final_rank":13},{"submission_id":"aoj_2775_4096005","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n\nusing namespace std;\n\nconstexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\n//constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-8;\n\n//int N, M, K, H, W, L, R;\nlong long int N, M, K, H, W, L, R;\n\nclass Add_Segment_Tree {\n\tvector<long long int>v;\n\tvector<long long int>add;\n\tvector<long long int>modi;\n\tvector<int>l;\n\tvector<int>r;\n\tint num;\n\tlong long int ret;\n\tvoid Left(int place) {\n\t\tif (place >= v.size() / 2) {\n\t\t\tl[place] = place - v.size() / 2;\n\t\t\treturn;\n\t\t}\n\t\tLeft(place * 2);\n\t\tLeft(place * 2 + 1);\n\t\tl[place] = l[place * 2];\n\t\treturn;\n\t}\n\tvoid Right(int place) {\n\t\tif (place >= v.size() / 2) {\n\t\t\tr[place] = place - v.size() / 2;\n\t\t\treturn;\n\t\t}\n\t\tRight(place * 2);\n\t\tRight(place * 2 + 1);\n\t\tr[place] = r[place * 2 + 1];\n\t\treturn;\n\t}\n\tlong long int Update(int place) {\n\t\tif (place >= v.size() / 2) {\n\t\t\treturn v[place];\n\t\t}\n\t\tv[place] = Update(place * 2) + Update(place * 2 + 1);\n\t\treturn v[place];\n\t}\n\tvoid Modify(int a, int b, long long int num, int place) {\n\t\tif (l[place] >= a && r[place] <= b) {\n\t\t\tmodi[place] = num * (r[place] - l[place] + 1);\n\t\t\tv[place] = num * (r[place] - l[place] + 1);\n\t\t\tadd[place] = 0;\n\t\t\treturn;\n\t\t}\n\t\tif (l[place] > b || r[place] < a)return;\n\t\tif (modi[place] != LLONG_MAX) {\n\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\n\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\n\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\tmodi[place] = LLONG_MAX;\n\t\t}\n\t\tadd[place * 2] += add[place] / 2;\n\t\tadd[place * 2 + 1] += add[place] / 2;\n\t\tadd[place] = 0;\n\t\tModify(a, b, num, place * 2);\n\t\tModify(a, b, num, place * 2 + 1);\n\t\tv[place] = v[place * 2] + add[place * 2] + v[place * 2 + 1] + add[place * 2 + 1];\n\t\treturn;\n\t}\n\tvoid Add(int a, int b, long long int num, int place) {\n\t\tif (l[place] >= a && r[place] <= b) {\n\t\t\tif (modi[place] != LLONG_MAX) {\n\t\t\t\tif (place * 2 < v.size()) {\n\t\t\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\n\t\t\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\n\t\t\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\t\t}\n\t\t\t\tmodi[place] = LLONG_MAX;\n\t\t\t}\n\t\t\tadd[place] += num * (r[place] - l[place] + 1);\n\t\t\treturn;\n\t\t}\n\t\tif (l[place] > b || r[place] < a)return;\n\t\tif (modi[place] != LLONG_MAX) {\n\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\n\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\n\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\tmodi[place] = LLONG_MAX;\n\t\t}\n\t\tadd[place * 2] += add[place] / 2;\n\t\tadd[place * 2 + 1] += add[place] / 2;\n\t\tadd[place] = 0;\n\t\tAdd(a, b, num, place * 2);\n\t\tAdd(a, b, num, place * 2 + 1);\n\t\tv[place] = v[place * 2] + add[place * 2] + v[place * 2 + 1] + add[place * 2 + 1];\n\t\treturn;\n\t}\n\tvoid Sum(int a, int b, int place) {\n\t\tif (l[place] >= a && r[place] <= b) {\n\t\t\tif (modi[place] != LLONG_MAX) {\n\t\t\t\tif (place * 2 < v.size()) {\n\t\t\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\n\t\t\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\n\t\t\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\t\t}\n\t\t\t\tmodi[place] = LLONG_MAX;\n\t\t\t}\n\t\t\tret += v[place] + add[place];\n\t\t\treturn;\n\t\t}\n\t\tif (l[place]>b || r[place]<a) return;\n\t\tif (modi[place] != LLONG_MAX) {\n\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\n\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\n\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\tmodi[place] = LLONG_MAX;\n\t\t}\n\t\tadd[place * 2] += add[place] / 2;\n\t\tadd[place * 2 + 1] += add[place] / 2;\n\t\tadd[place] = 0;\n\t\tSum(a, b, place * 2);\n\t\tSum(a, b, place * 2 + 1);\n\t\tv[place] = v[place * 2] + add[place * 2] + v[place * 2 + 1] + add[place * 2 + 1];\n\t\treturn;\n\t}\npublic:\n\tAdd_Segment_Tree(int n) {\n\t\tn++;\n\t\tnum = 1;\n\t\twhile (num < n * 2) {\n\t\t\tnum *= 2;\n\t\t}\n\t\tl.resize(num);\n\t\tr.resize(num);\n\t\tv.resize(num, 0);\n\t\tadd.resize(num, 0);\n\t\tmodi.resize(num, LLONG_MAX);\n\t\tLeft(1);\n\t\tRight(1);\n\t}\n\tvoid Insert(int place, long long int num, bool update) {\n\t\tplace += v.size() / 2;\n\t\tv[place] = num;\n\t\tif (!update)return;\n\t\tplace /= 2;\n\t\twhile (place) {\n\t\t\tv[place] = v[place * 2] + v[place * 2 + 1];\n\t\t\tplace /= 2;\n\t\t}\n\t}\n\tvoid Modify(int a, int b, long long int num) {\n\t\tModify(a, b, num, 1);\n\t}\n\tvoid Add(int a, int b, long long int num) {\n\t\tAdd(a, b, num, 1);\n\t}\n\tvoid Init() {\n\t\tUpdate(1);\n\t}\n\tlong long int Sum(int a, int b) {\n\t\tret = 0;\n\t\tSum(a, b, 1);\n\t\treturn ret;\n\t}\n};\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tcin >> N;\n\t//Add_Segment_Tree asg(N);\n\tAdd_Segment_Tree num(N);\n\tfor (int i = 0; i < N; i++) {\n\t\t//asg.Add(i, i, N - i);\n\t\tnum.Add(i, i, 1);\n\t}\n\tlong long int bef = 0;\n\tcout << \"? 1 \" << N << endl;\n\tcin >> bef;\n\tvector<int>ans(N);\n\tfor (int i = N - 2; i >= 0; i--) {\n\t\tcout << \"? 1 \" << i + 1 << endl;\n\t\tlong long int c;\n\t\tcin >> c;\n\t\t//int box= asg.Sum(bef - c, bef - c);\n\t\tint bag = i + 2 - (bef-c);\n\t\tL = 0;\n\t\tR = N;\n\t\t//cout << \"bag \" <<bag<< endl;\n\t\twhile (R - L > 1) {\n\t\t\tint mid = (R + L) / 2;\n\t\t\tif (num.Sum(1, mid) < bag)L = mid;\n\t\t\telse R = mid;\n\t\t}\n\t\tans[i + 1] = R;\n\t//\tasg.Add(bef-c, N, -1);\n\t\tnum.Add(ans[i + 1], ans[i+1], -1);\n\t\tbef = c;\n\t}\n\tlong long int nx = N * (N + 1) / 2 - accumulate(ans.begin(), ans.end(), 0LL);\n\tans[0] = nx;\n\tcout << \"!\";\n\tfor (auto i : ans)cout << \" \" << i;\n\tcout << endl;\n}","accuracy":1,"time_ms":3610,"memory_kb":288956,"score_of_the_acc":-1.7565,"final_rank":14},{"submission_id":"aoj_2775_3968164","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 main() {\n int N; scanf(\"%d\", &N);\n\n vector<int> A(N), B(N);\n ll pre = 0;\n for(int i=0; i<N; i++) {\n printf(\"? %d %d\\n\", 1, i+1);\n fflush(stdout);\n \n ll v; scanf(\"%lld\", &v);\n A[i] = i - (v - pre);\n pre = v;\n }\n\n pre = 0;\n for(int i=N-1; i>=0; i--) {\n printf(\"? %d %d\\n\", i+1, N);\n fflush(stdout);\n\n ll v; scanf(\"%lld\", &v);\n B[i] = v - pre;\n pre = v;\n }\n\n printf(\"!\");\n for(int i=0; i<N; i++) printf(\" %d\", A[i] + B[i] + 1);\n printf(\"\\n\");\n fflush(stdout);\n return 0;\n}","accuracy":1,"time_ms":2600,"memory_kb":288952,"score_of_the_acc":-1.5402,"final_rank":12},{"submission_id":"aoj_2775_2739174","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100000\n\nll to_N[NUM+1],from_1[NUM+1],ans[NUM+1];\n\n\nint main(){\n\n\tll N;\n\tscanf(\"%lld\",&N);\n\n\tto_N[N] = 0;\n\tfor(ll left = N-1; left >= 1; left--){\n\t\tprintf(\"? %lld %lld\\n\",left,N); fflush(stdout);\n\t\tscanf(\"%lld\",&to_N[left]);\n\t}\n\n\tfrom_1[1] = 0;\n\n\tfor(int right = 2; right <= N; right++){\n\t\tprintf(\"? 1 %d\\n\",right); fflush(stdout);\n\t\tscanf(\"%lld\",&from_1[right]);\n\t}\n\n\tans[1] = to_N[1]-to_N[2]+1;\n\tfor(int i = 2; i <= N-1; i++){\n\t\tans[i] = (to_N[i]-to_N[i+1])+((ll)i-(from_1[i]-from_1[i-1]+1))+1;\n\t}\n\tans[N] = N-(from_1[N]-from_1[N-1]+1)+1;\n\n\tprintf(\"!\");\n\tfor(int i = 1; i <=N; i++)printf(\" %lld\",ans[i]);\n\tprintf(\"\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":4670,"memory_kb":288940,"score_of_the_acc":-1.9834,"final_rank":17},{"submission_id":"aoj_2775_2739169","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100000\n\nll to_N[NUM+1],from_1[NUM+1],ans[NUM+1];\n\n\nint main(){\n\n\tll N;\n\tscanf(\"%lld\",&N);\n\n\tto_N[N] = 0;\n\t//右端にかけてのクエリを投げる<ans[left]より右にある小さい数の個数>\n\tfor(ll left = N-1; left >= 1; left--){\n\t\tprintf(\"? %lld %lld\\n\",left,N); fflush(stdout);\n\t\tscanf(\"%lld\",&to_N[left]);\n\t}\n\n\tfrom_1[1] = 0;\n\t//左端からのクエリを投げる\n\tfor(int right = 2; right <= N; right++){\n\t\tprintf(\"? 1 %d\\n\",right); fflush(stdout);\n\t\tscanf(\"%lld\",&from_1[right]);\n\t}\n\n\tans[1] = to_N[1]-to_N[2]+1;\t //自分の右にある、自分より小さい数の個数+1\n\tfor(int i = 2; i <= N-1; i++){\n\t\tans[i] = (to_N[i]-to_N[i+1])+((ll)i-(from_1[i]-from_1[i-1]+1))+1; //自分の右にある、自分より小さい数の個数+自分の左にある、自分より小さい数の個数+1\n\t}\n\tans[N] = N-(from_1[N]-from_1[N-1]+1)+1;\n\n\tprintf(\"!\");\n\tfor(int i = 1; i <=N; i++)printf(\" %lld\",ans[i]);\n\tprintf(\"\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":4700,"memory_kb":288940,"score_of_the_acc":-1.9899,"final_rank":18},{"submission_id":"aoj_2775_2558466","code_snippet":"#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\nstruct BIT{\n // [1,n]\n int n; vector<ll> bit;\n // ?????????\n BIT(int _n){\n n = _n;\n bit = vector<ll>(n+1,0);\n }\n // sum of [1,i]\n ll sum(int i){\n ll s = 0;\n while(i>0){\n s += bit[i];\n i -= i & -i;\n }\n return s;\n }\n // add x in i-th element\n void add(int i, ll x){\n while(i<=n){\n bit[i] += x;\n i += i & -i;\n }\n }\n};\n\nll query(int x)\n{\n printf(\"? 1 %d\\n\", x); fflush(stdout);\n ll ret;\n scanf(\" %lld\", &ret);\n return ret;\n}\n\nint main()\n{\n int n;\n scanf(\" %d\", &n);\n\n vector<int> ans(n);\n\n BIT bit(n);\n for(int i=1; i<=n; ++i) bit.add(i,1);\n\n ll x = query(n);\n for(int i=n-1; i>0; --i)\n {\n ll y = query(i);\n ll diff = x-y;\n\n int l=0, r=n;\n while(r-l>1)\n {\n int m = (l+r)/2;\n if(bit.sum(n)-bit.sum(m)<=diff) r=m;\n else l=m;\n }\n\n // dbg(l);dbg(r);\n ans[i] = r;\n bit.add(r,-1);\n x = y;\n }\n\n for(int i=1; i<=n; ++i) if(bit.sum(i)-bit.sum(i-1)>0) ans[0] = i;\n\n printf(\"!\");\n rep(i,n) printf(\" %d\", ans[i]);\n printf(\"\\n\");\n return 0;\n}","accuracy":1,"time_ms":1660,"memory_kb":288940,"score_of_the_acc":-1.3389,"final_rank":8},{"submission_id":"aoj_2775_2558240","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 1120000000\n\ntemplate<typename T>\nclass BIT {\nprivate:\n vector<T> bit;\n int n;\npublic:\n BIT(int _n) : n(_n) {\n bit = vector<T>(n+1, 0);\n }\n void add(int v, T a){ //0-indexed\n for(int x=v+1; x<=n; x += x&(-x)) bit[x] += a;\n }\n T sum(int v){ //0-indexed\n T ret=0;\n for(int x=v+1; x>0; x -= x&(-x)) ret += bit[x];\n return ret;\n }\n int lower_bound(T w){ //wテ、ツサツ・テ、ツクツ甘」ツ?ィテ」ツ?ェテ」ツつ凝ヲツ慊?・ツーツ湘」ツ?ョsumテ」ツ?ョテ、ツスツ催ァツスツョ(0-indexed)\n if(w<=0) return 0;\n int x=0, d=0;\n while(n > (1<<d)) d++;\n for(int k=(1<<(d-1)); k>0; k/=2){\n if(x+k<=n && bit[x+k]<w){\n w -= bit[x+k];\n x += k;\n }\n }\n return x;\n }\n};\n\nvector<int> ans;\n\nlong ask(int l, int r){\n cout << \"? \" << l << \" \" << r << endl;\n if(ans.size()>0){\n l--;\n long ret = 0;\n rep(i,l,r)rep(j,l,i) if(ans[j] > ans[i]) ret++;\n return ret;\n } else {\n long d;\n cin>>d;\n return d;\n }\n}\n\nint main(int argc, char* argv[]){\n if(argc>2){\n rep(i,1,argc) ans.pb(atoi(argv[i]));\n dbg(ans);\n }\n\n int n;\n cin>>n;\n\n vector<long> acc(n);\n acc[0] = 0;\n rep(i,1,n){\n acc[i] = ask(1,i+1);\n }\n vector<long> val(n);\n val[0] = 0;\n rep(i,1,n) val[i] = acc[i] - acc[i-1];\n\n BIT<int> bit(n+1);\n rep(i,n) bit.add(i+1,1);\n\n vector<int> res(n);\n for(int i=n-1; i>=0; i--){//dbg(i,val[i]);\n int idx = bit.lower_bound(i+1-val[i]);\n res[i] = idx;\n bit.add(idx, -1);\n }\n\n cout << \"!\";\n rep(i,n) cout << \" \" << res[i];\n cout<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":1700,"memory_kb":288896,"score_of_the_acc":-1.3473,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_2775_10850453\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing LL = long long; using ll = LL;\\nusing PII = pair<int, int>; using pii = PII;\\nusing PLL = pair<LL, LL>; using pll = PLL;\\nusing VI = vector<int>; using VL = vector<LL>;\\n#define FOR(i,s,t) for(int i =s; i < t;i++)\\n#define SZ(a) (int)a.size()\\n#define ALL(a) a.begin(),a.end()\\n#define debug(a) cout<<#a<<\\\":=\\\"<<a<<endl;\\n#define int long long\\nstruct BIT {\\n\\tint N, nn; vector<int> data;\\n\\tBIT(int n) {\\n\\t\\tN = n + 1;\\n\\t\\tdata = vector<int>(n + 1, 0);\\n\\t\\tnn = 1;\\n\\t\\twhile (nn * 2 <= N)nn *= 2;\\n\\t}\\n\\tvoid add(int i, int w) {\\n\\t\\ti++;\\n\\t\\tfor (int x = i; x < N; x += x & -x) {\\n\\t\\t\\tdata[x] += w;\\n\\t\\t}\\n\\t}\\n\\tint sum(int i) { // [0,i)\\n\\t\\tint ret = 0;\\n\\t\\tfor (int x = i; x > 0; x -= x & -x) {\\n\\t\\t\\tret += data[x];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t// [l,r)\\n\\tint sum(int l, int r) {\\n\\t\\treturn sum(r) - sum(l);\\n\\t}\\n};\\n\\nvoid solve() {\\n\\tint N;\\n\\tcin >> N;\\n\\tBIT bit(N);\\n\\tFOR(i, 0, N) {\\n\\t\\tbit.add(i, 1);\\n\\t}\\n\\tLL kim = N;\\n\\tVI ans(N, -1);\\n\\tVI SET(N, 0);\\n\\tcout << \\\"? 1 \\\" << N<< endl;\\n\\tcin >> kim;\\n\\tfor (int i = N - 1; i >= 1; i--) {\\n\\t\\tcout << \\\"? 1 \\\" << i << endl;\\n\\t\\tLL nx; cin >> nx;\\n\\t\\tLL val = kim - nx + 1;\\n\\t\\tint l = 0; int r = N;\\n\\t\\tFOR(unchi, 0, 30) {\\n\\t\\t\\tint mid = (l + r) / 2;\\n\\t\\t\\tif (bit.sum(mid, N) >= val) {\\n\\t\\t\\t\\tl = mid;\\n\\t\\t\\t}\\n\\t\\t\\telse r = mid;\\n\\t\\t}\\n\\t\\tans[i] = l;\\n\\t\\tSET[l] = 1;\\n\\t\\tif (bit.sum(l, l + 1) == 1)bit.add(l, -1);\\n\\t\\tkim = nx;\\n\\t}\\n\\tFOR(i, 0, N) {\\n\\t\\tif (!SET[i])ans[0] = i;// , debug(i);\\n\\t}\\n\\tcout << \\\"!\\\";\\n\\tFOR(i, 0, N) {\\n\\t\\tassert(ans[i] != -1);\\n\\t\\tcout << \\\" \\\" << ans[i] + 1;\\n\\t}\\n\\tcout << endl;\\n\\n}\\n\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(false);\\n\\n\\tsolve();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1260,\n \"memory_kb\": 291740,\n \"score_of_the_acc\": -1.2633,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2775_10259994\",\n \"code_snippet\": \"// AOJ #2775 Complex Oracle\\n// 2025.3.2\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n \\nstruct Fenw {\\n int n;\\n vector<int> f;\\n Fenw(int n): n(n), f(n+1,0){}\\n void upd(int i, int d) {\\n for(; i<=n; i+= i&-i) f[i]+=d;\\n }\\n int sum(int i) {\\n int s=0;\\n for(; i; i-= i&-i) s+=f[i];\\n return s;\\n }\\n int kth(int k) {\\n int idx = 0;\\n for (int bit = 1 << 20; bit; bit >>= 1) {\\n int nxt = idx + bit;\\n if(nxt<=n && f[nxt] < k){\\n k -= f[nxt];\\n idx = nxt;\\n }\\n }\\n return idx+1;\\n }\\n};\\n \\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int N; cin >> N;\\n vector<ll> P(N+1,0), b(N+1,0);\\n\\n for(int i=2;i<=N;i++){\\n cout << \\\"? \\\" << 1 << \\\" \\\" << i << \\\"\\\\n\\\";\\n cout.flush();\\n ll r; cin >> r;\\n P[i]=r;\\n }\\n b[1]=0;\\n for(int i=2;i<=N;i++) b[i] = P[i]-P[i-1];\\n\\n Fenw fenw(N);\\n for(int i=1;i<=N;i++) fenw.upd(i,1);\\n\\n vector<int> ans(N+1,0);\\n for(int i=N;i>=1;i--){\\n int sz = fenw.sum(N);\\n int k = b[i] + 1;\\n int pos = fenw.kth(sz - k + 1);\\n ans[i] = pos;\\n fenw.upd(pos, -1);\\n }\\n cout << \\\"!\\\";\\n for(int i=1;i<=N;i++) cout << \\\" \\\" << ans[i];\\n cout << endl;\\n cout.flush();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1230,\n \"memory_kb\": 291764,\n \"score_of_the_acc\": -1.2569,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2775_8470731\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2775.cc: Complex Oracle\\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;\\n\\ntemplate <typename T>\\nstruct BIT {\\n int n;\\n vector<T> bits;\\n \\n BIT() {}\\n BIT(int _n) { init(_n); }\\n\\n void init(int _n) {\\n n = _n;\\n bits.assign(n + 1, 0);\\n }\\n\\n T sum(int x) {\\n x = min(x, n);\\n T s = 0;\\n while (x > 0) {\\n s += bits[x];\\n x -= (x & -x);\\n }\\n return s;\\n }\\n\\n void add(int x, T v) {\\n if (x <= 0) return;\\n while (x <= n) {\\n bits[x] += v;\\n x += (x & -x);\\n }\\n }\\n\\n int lower_bound(T v) {\\n int\\tk = 1;\\n while ((k << 1) <= n) k <<=\\t1;\\n int\\tx = 0;\\n for\\t(; k > 0; k >>= 1)\\n if (x + k <= n && bits[x + k] < v) {\\n x += k;\\n v -= bits[x];\\n }\\n return x + 1;\\n }\\n};\\n\\n/* global variables */\\n\\nll cs[MAX_N];\\nint ds[MAX_N], ps[MAX_N];\\nBIT<int> bit;\\n\\n/* subroutines */\\n\\nll query(int i, int j) {\\n printf(\\\"? %d %d\\\\n\\\", i + 1, j + 1); fflush(stdout);\\n\\n ll c;\\n scanf(\\\"%lld\\\", &c);\\n return c;\\n}\\n\\n/* main */\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n\\n cs[0] = 0;\\n for (int i = 1; i < n; i++) {\\n cs[i] = (ll)i * (i + 1) / 2 - query(0, i);\\n ds[i] = cs[i] - cs[i - 1];\\n }\\n\\n bit.init(n);\\n for (int i = 1; i <= n; i++) bit.add(i, 1);\\n\\n for (int i = n - 1; i >= 0; i--) {\\n int l = 0, r = n;\\n while (l + 1 < r) {\\n int m = (l + r) / 2;\\n if (bit.sum(m) > ds[i]) r = m;\\n else l = m;\\n }\\n\\n ps[i] = r;\\n bit.add(r, -1);\\n }\\n\\n putchar('!');\\n for (int i = 0; i < n; i++) printf(\\\" %d\\\", ps[i]);\\n putchar('\\\\n'); fflush(stdout);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1220,\n \"memory_kb\": 291764,\n \"score_of_the_acc\": -1.2548,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2775_6940120\",\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=2167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=1e9+7;\\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\\\";}\\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\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;\\n\\tcin>>N;\\n\\tvector<ll> p(N);\\n\\tll tmp=0;\\n\\trep(i,N-1){\\n\\t\\tcout<<\\\"? 1 \\\"<<i+2<<endl;\\n\\t\\tll a;\\n\\t\\tcin>>a;\\n\\t\\tp[i+1]=i+1-(a-tmp);\\n\\t\\ttmp=a;\\n\\t}\\n\\t//vec_out(p);\\n\\ttmp=0;\\n\\tfor(int i=N-2;i>=0;i--){\\n\\t\\tcout<<\\\"? \\\"<<i+1<<\\\" \\\"<<N<<endl;\\n\\t\\tll a;\\n\\t\\tcin>>a;\\n\\t\\tp[i]+=a-tmp;\\n\\t\\ttmp=a;\\n\\t}\\n\\t//vec_out(p);\\n\\tcout<<\\\"!\\\";\\n\\trep(i,N){\\n\\t\\tcout<<\\\" \\\"<<p[i]+1;\\n\\t}\\n\\tcout<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2190,\n \"memory_kb\": 291716,\n \"score_of_the_acc\": -1.4623,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2775_5535188\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#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}\\n\\n// 1-indexed\\ntemplate<typename T>\\nstruct BIT{\\n int n;\\n vector<T> bit;\\n BIT(int n_=0):n(n_),bit(n+1){}\\n T sum(int i){\\n T res=0;\\n for(;i>0;i-=(i&-i))res+=bit[i];\\n return res;\\n }\\n void add(int i,T a){\\n if(i==0)return;\\n for(;i<=n;i+=(i&-i)){bit[i]+=a;}\\n }\\n int lower_bound(T k){ // k<=sum(res)\\n if(k<=0)return 0;\\n int res=0,i=1;\\n while((i<<1)<=n)i<<=1;\\n for(;i;i>>=1){\\n if(res+i<=n&&bit[res+i]<k)k-=bit[res+=i];\\n }\\n return res+1;\\n }\\n};\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n; cin >> n;\\n vector<ll> query(n+1);\\n BIT<int> bit(n+1);\\n for(int i=1;i<=n;i++){\\n cout << \\\"? \\\" << i << \\\" \\\" << n << endl;\\n cin >> query[i];\\n bit.add(i,1);\\n }\\n vector<int> res(n+1);\\n for(int i=1;i+1<=n;i++){\\n ll u=query[i]-query[i+1]+1;\\n int id=bit.lower_bound(u);\\n bit.add(id,-1);\\n res[i]=id;\\n }\\n res[n]=bit.lower_bound(1);\\n cout << \\\"!\\\";\\n for(int i=1;i<=n;i++){\\n cout << \\\" \\\" << res[i];\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1340,\n \"memory_kb\": 291776,\n \"score_of_the_acc\": -1.2805,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2775_5535187\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#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}\\n\\n// 1-indexed\\ntemplate<typename T>\\nstruct BIT{\\n int n;\\n vector<T> bit;\\n BIT(int n_=0):n(n_),bit(n+1){}\\n T sum(int i){\\n T res=0;\\n for(;i>0;i-=(i&-i))res+=bit[i];\\n return res;\\n }\\n void add(int i,T a){\\n if(i==0)return;\\n for(;i<=n;i+=(i&-i)){bit[i]+=a;}\\n }\\n int lower_bound(T k){ // k<=sum(res)\\n if(k<=0)return 0;\\n int res=0,i=1;\\n while((i<<1)<=n)i<<=1;\\n for(;i;i>>=1){\\n if(res+i<=n&&bit[res+i]<k)k-=bit[res+=i];\\n }\\n return res+1;\\n }\\n};\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n; cin >> n;\\n vector<int> query(n+1);\\n BIT<int> bit(n+1);\\n for(int i=1;i<=n;i++){\\n cout << \\\"? \\\" << i << \\\" \\\" << n << endl;\\n cin >> query[i];\\n bit.add(i,1);\\n }\\n vector<int> res(n+1);\\n for(int i=1;i+1<=n;i++){\\n int u=query[i]-query[i+1]+1;\\n int id=bit.lower_bound(u);\\n bit.add(id,-1);\\n res[i]=id;\\n }\\n res[n]=bit.lower_bound(1);\\n cout << \\\"!\\\";\\n for(int i=1;i<=n;i++){\\n cout << \\\" \\\" << res[i];\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 0.6176470588235294,\n \"time_ms\": 30,\n \"memory_kb\": 41248,\n \"score_of_the_acc\": -0.1041,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2775_5532968\",\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) dat[k] = f(dat[k << 1], dat[(k << 1) | 1]);\\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 // require: func(unit) == false\\n // min left: st <= res && func(seg.query(st,res + 1))\\n template <typename C>\\n int find_left(int st, C &func, T &acc, int k, int l, int r) {\\n if (l + 1 == r) {\\n acc = f(acc, dat[k]);\\n return func(acc) ? l : -1;\\n }\\n int mid = (l + r) >> 1;\\n if (mid <= st) return find_left(st, func, acc, (k << 1) | 1, mid, r);\\n if (st <= l && !func(f(acc, dat[k]))) {\\n acc = f(acc, dat[k]);\\n return -1;\\n }\\n int nres = find_left(st, func, acc, (k << 1), l, mid);\\n if (~nres) return nres;\\n return find_left(st, func, acc, (k << 1) | 1, mid, r);\\n }\\n template <typename C>\\n int find_left(int st, C &func) {\\n T acc = unit;\\n return find_left(st, func, acc, 1, 0, n);\\n }\\n\\n // max right: res <= st && func(seg.query(res - 1,st))\\n template <typename C>\\n int find_right(int st, C &func, T &acc, int k, int l, int r) {\\n if (l + 1 == r) {\\n acc = f(dat[k], acc);\\n return func(acc) ? r : -1;\\n }\\n int mid = (l + r) >> 1;\\n if (st <= mid) return find_right(st, func, acc, k << 1, l, mid);\\n if (r <= st && !func(f(dat[k], acc))) {\\n acc = f(dat[k], acc);\\n return -1;\\n }\\n int nres = find_right(st, func, acc, (k << 1) | 1, mid, r);\\n if (~nres) return nres;\\n return find_right(st, func, acc, k << 1, l, mid);\\n }\\n template <typename C>\\n int find_right(int st, C &func) {\\n T acc = unit;\\n return find_right(st, func, acc, 1, 0, n);\\n }\\n};\\n\\nint n;\\nvector<long long> memo;\\n\\nvector<int> solve();\\n\\nint main() {\\n cin >> n;\\n memo.resize(n + 1);\\n for (int i = 0; i < n - 1; ++i) {\\n cout << \\\"? \\\" << i + 1 << \\\" \\\" << n << endl;\\n cin >> memo[i];\\n }\\n auto res = solve();\\n cout << \\\"!\\\";\\n for (int i = 0; i < n; ++i) cout << \\\" \\\" << res[i] + 1;\\n cout << endl;\\n return 0;\\n}\\n\\nvector<int> solve() {\\n SegmentTree<int> seg(\\n n, [](int l, int r) { return l + r; }, 0);\\n vector<int> res(n);\\n for (int i = 0; i < n; ++i) seg.update(i, 1);\\n for (int i = 0; i < n; ++i) {\\n int now = memo[i] - memo[i + 1] + 1;\\n auto cmp = [&](int x) { return x >= now; };\\n now = seg.find_left(0, cmp);\\n res[i] = now;\\n seg.update(now, 0);\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1370,\n \"memory_kb\": 291756,\n \"score_of_the_acc\": -1.2869,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2775_5532668\",\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;\\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;}\\n// struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __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 cin>>n;\\n V<ll> tmp(n),l(n);\\n for(ll i=1;i<n;i++){\\n cout<<\\\"? \\\"<<1<<\\\" \\\"<<i+1<<endl;\\n ll v;\\n cin>>v;\\n tmp[i]=v;\\n l[i]=i-(v-tmp[i-1]);\\n }\\n // print(tmp);\\n tmp.assign(n,0);\\n V<ll> r(n);\\n for(int i=n-2;i>=0;i--){\\n cout<<\\\"? \\\"<<i+1<<\\\" \\\"<<n<<endl;\\n ll v;\\n cin>>v;\\n tmp[i]=v;\\n r[i]=v-tmp[i+1];\\n }\\n V<ll> ans(n);\\n for(int i=0;i<n;i++){\\n ans[i]=l[i]+r[i]+1;\\n }\\n // print(l);\\n // print(r);\\n cout<<\\\"! \\\";\\n for(int i=0;i<n;i++){\\n cout<<ans[i];\\n if(i==n-1){\\n cout<<endl;\\n }else{\\n cout<<\\\" \\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2240,\n \"memory_kb\": 291776,\n \"score_of_the_acc\": -1.4732,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2775_5532597\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n//#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\nusing namespace std;\\n//#include<boost/multiprecision/cpp_int.hpp>\\n//#include<boost/multiprecision/cpp_dec_float.hpp>\\n//namespace mp=boost::multiprecision;\\n//#define mulint mp::cpp_int\\n//#define mulfloat mp::cpp_dec_float_100\\n//struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\\n#define INF (1<<30)\\n#define LINF (lint)(1LL<<56)\\n//#define endl \\\"\\\\n\\\"\\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\\n#define flc(x) __builtin_popcountll(x)\\n#define pint pair<int,int>\\n#define pdouble pair<double,double>\\n#define plint pair<lint,lint>\\n#define fi first\\n#define se second\\n#define all(x) x.begin(),x.end()\\n#define vec vector<lint>\\n#define nep(x) next_permutation(all(x))\\ntypedef long long lint;\\nint dx[8]={1,1,0,-1,-1,-1,0,1};\\nint dy[8]={0,1,1,1,0,-1,-1,-1};\\nconst int MAX_N=3e5+5;\\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//vector<int> bucket[MAX_N/1000];\\nconstexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n/*#include<atcoder/all>\\nusing namespace atcoder;\\ntypedef __int128_t llint;*/\\n\\ntemplate<typename U = unsigned, int B = 32>\\nclass lazy_binary_trie {\\n struct node {\\n int cnt;\\n U lazy;\\n node *ch[2];\\n node() : cnt(0), lazy(0), ch{ nullptr, nullptr } {}\\n };\\n void push(node* t, int b) {\\n if ((t->lazy >> (U)b) & (U)1) swap(t->ch[0], t->ch[1]);\\n if (t->ch[0]) t->ch[0]->lazy ^= t->lazy;\\n if (t->ch[1]) t->ch[1]->lazy ^= t->lazy;\\n t->lazy = 0;\\n }\\n node* add(node* t, U val, int b = B - 1) {\\n if (!t) t = new node;\\n t->cnt += 1;\\n if (b < 0) return t;\\n push(t, b);\\n bool f = (val >> (U)b) & (U)1;\\n t->ch[f] = add(t->ch[f], val, b - 1);\\n return t;\\n }\\n node* sub(node* t, U val, int b = B - 1) {\\n assert(t);\\n t->cnt -= 1;\\n if (t->cnt == 0) return nullptr;\\n if (b < 0) return t;\\n push(t, b);\\n bool f = (val >> (U)b) & (U)1;\\n t->ch[f] = sub(t->ch[f], val, b - 1);\\n return t;\\n }\\n U get_min(node* t, U val, int b = B - 1) {\\n assert(t);\\n if (b < 0) return 0;\\n push(t, b);\\n bool f = (val >> (U)b) & (U)1; f ^= !t->ch[f];\\n return get_min(t->ch[f], val, b - 1) | ((U)f << (U)b);\\n }\\n U get(node* t, int k, int b = B - 1) {\\n if (b < 0) return 0;\\n push(t, b);\\n int m = t->ch[0] ? t->ch[0]->cnt : 0;\\n return k < m ? get(t->ch[0], k, b - 1) : get(t->ch[1], k - m, b - 1) | ((U)1 << (U)b);\\n }\\n int count_lower(node* t, U val, int b = B - 1) {\\n if (!t || b < 0) return 0;\\n push(t, b);\\n bool f = (val >> (U)b) & (U)1;\\n return (f && t->ch[0] ? t->ch[0]->cnt : 0) + count_lower(t->ch[f], val, b - 1);\\n }\\n node *root;\\npublic:\\n lazy_binary_trie() : root(nullptr) {}\\n int size() const {\\n return root ? root->cnt : 0;\\n }\\n bool empty() const {\\n return !root;\\n }\\n void insert(U val) {\\n root = add(root, val);\\n }\\n void erase(U val) {\\n root = sub(root, val);\\n }\\n void xor_all(U val) {\\n if (root) root->lazy ^= val;\\n }\\n U max_element(U bias = 0) {\\n return get_min(root, ~bias);\\n }\\n U min_element(U bias = 0) {\\n return get_min(root, bias);\\n }\\n int lower_bound(U val) { // return id\\n return count_lower(root, val);\\n }\\n int upper_bound(U val) { // return id\\n return count_lower(root, val + 1);\\n }\\n U operator[](int k) {\\n assert(0 <= k && k < size());\\n return get(root, k);\\n }\\n int count(U val) {\\n if (!root) return 0;\\n node *t = root;\\n for (int i = B - 1; i >= 0; i--) {\\n push(t, i);\\n t = t->ch[(val >> (U)i) & (U)1];\\n if (!t) return 0;\\n }\\n return t->cnt;\\n }\\n};\\n\\nint main(void){\\n int N;\\n cin >> N;\\n int ans[N];\\n lint q[N];\\n lazy_binary_trie<int,20> BT;\\n rep(i,N) BT.insert(i+1);\\n rep(i,N){\\n cout << \\\"? \\\" << i+1 << \\\" \\\" << N << endl;\\n cin >> q[i];\\n if(i==0) continue;\\n ans[i-1]=BT[q[i-1]-q[i]];\\n BT.erase(ans[i-1]);\\n }\\n ans[N-1]=BT[0];\\n cout << \\\"! \\\";\\n rep(i,N){\\n cout << ans[i];\\n if(i!=N-1) cout << \\\" \\\";\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1400,\n \"memory_kb\": 291776,\n \"score_of_the_acc\": -1.2934,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2775_4926734\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#include <ext/rope>\\nusing namespace __gnu_cxx;\\n\\n\\nll query(ll l, ll r){\\n l++;\\n printf(\\\"? %lld %lld\\\\n\\\", l, r); fflush(stdout);\\n scanf(\\\"%lld\\\", &l);\\n return l;\\n}\\nvoid answer(vector<ll>a){\\n putchar('!');\\n for(ll i : a) printf(\\\" %lld\\\", i);\\n puts(\\\"\\\");\\n exit(0);\\n}\\nint main(){\\n ll n;\\n scanf(\\\"%lld\\\", &n);\\n vector<ll> a(n + 1);\\n for(ll i = 1; i <= n; i++) a[i] = query(0, i);\\n rope<ll> x;\\n for(ll i = n; i; i--) x.push_back(i);\\n for(ll i = n; i; i--){\\n auto p = x.mutable_begin() + (a[i] - a[i - 1]);\\n a[i] = *p;\\n x.erase(p);\\n }\\n a.erase(a.begin());\\n answer(a);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1330,\n \"memory_kb\": 291756,\n \"score_of_the_acc\": -1.2783,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2775_4471789\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\ntypedef long long int lli;\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<lli> a(n), b(n);\\n for(int i=0; i<n; i++){\\n cout << \\\"? \\\" << 1 << \\\" \\\" << i+1 << endl;\\n cin >> a[i];\\n cout << \\\"? \\\" << i+1 << \\\" \\\" << n << endl;\\n cin >> b[i];\\n }\\n for(int i=0; i<n-1; i++){\\n a[n-1-i] -= a[n-2-i];\\n b[i] -= b[i+1];\\n }\\n cout << \\\"!\\\";\\n for(int i=0; i<n; i++){\\n cout << \\\" \\\" << b[i]+1 +(i-a[i]);\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4650,\n \"memory_kb\": 288960,\n \"score_of_the_acc\": -1.9792,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2775_4471776\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\ntypedef long long int lli;\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<lli> a(n), b(n);\\n for(int i=0; i<n; i++){\\n cout << \\\"? \\\" << 1 << \\\" \\\" << i+1 << endl;\\n cin >> a[i];\\n cout << \\\"? \\\" << i+1 << \\\" \\\" << n << endl;\\n cin >> b[i];\\n }\\n for(int i=n-2; i>=0; i--){\\n a[i+1] -= a[i];\\n b[n-i-2] -= b[n-i-1];\\n }\\n for(int i=0; i<n; i++){\\n cout << a[i] << \\\" \\\" << b[i] << endl;\\n }\\n cout << \\\"!\\\";\\n for(int i=0; i<n; i++){\\n cout << \\\" \\\" << b[i]+1 +(i-a[i]);\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.6176470588235294,\n \"time_ms\": 130,\n \"memory_kb\": 12140,\n \"score_of_the_acc\": -0.0214,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2775_4471491\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\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; }\\nconst ll INF=1LL<<60;\\nconst int inf=(1<<30)-1;\\nconst int mod=1e9+7;\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n;cin >> n;\\n vector<int> p(n);\\n vector<ll> l(n+1),r(n+1);\\n for(int i=2;i<=n;i++){\\n cout << \\\"? \\\" << 1 << \\\" \\\" << i << endl;\\n cin >> l[i];\\n }\\n for(int i=1;i<=n-1;i++){\\n cout << \\\"? \\\" << i << \\\" \\\" << n << endl;\\n cin >> r[i-1];\\n }\\n for(int i=0;i<n;i++){\\n ll u=l[i+1]-l[i];\\n ll v=r[i]-r[i+1];\\n p[i]=i-u+v;\\n }\\n cout << '!';\\n for(int i=0;i<n;i++){\\n cout << \\\" \\\" << p[i]+1;\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4600,\n \"memory_kb\": 288900,\n \"score_of_the_acc\": -1.9683,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2775_4096256\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\nint64_t question(int l, int r){\\n cout << \\\"? \\\" << l + 1 << \\\" \\\" << r + 1 << endl;\\n int64_t res;\\n cin >> res;\\n return res;\\n}\\n\\nvoid output(vector<int> &A){\\n cout << \\\"!\\\";\\n for (const auto &a: A)\\n cout << \\\" \\\" << a;\\n cout << endl;\\n}\\n\\nll INF = 1e9+7;\\nll N, dat[2222222];\\nvoid init(ll k){\\n N = 1;\\n while(N < k) N *= 2;\\n for(ll i=0;i<2*N-1;i++) dat[i] = 0;\\n}\\n\\nvoid update(ll k, ll num){\\n k += N-1;\\n dat[k] = num;\\n while(k>0){\\n k = (k-1)/2;\\n dat[k] = dat[k*2 + 1] + dat[k*2+2];\\n }\\n}\\n\\n// query(a,b,0,0,n) → [a,b)\\nll query(ll a, ll b, ll k, ll l, ll r){\\n if(r<=a || b<=l) return 0;\\n if(a<=l && r<=b) return dat[k];\\n else{\\n ll vl = query(a,b,k*2+1,l,(l+r)/2);\\n ll vr = query(a,b,k*2+2,(l+r)/2,r);\\n return vl+vr;\\n }\\n}\\n\\n\\nsigned main(){\\n ios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n cout << fixed << setprecision(20);\\n\\n int n;\\n cin >> n;\\n vector<int64_t> D(n);\\n int64_t prev = 0;\\n for (int i = 1; i < n; i++){\\n auto res = question(0, i);\\n D[i] = res - prev;\\n prev = res;\\n }\\n init(n + 1);\\n\\n auto check = [&](auto k, auto d){\\n return d < query(k, n + 1, 0, 0, N);\\n };\\n\\n auto b_serach = [&](auto ok, auto ng, auto check, auto d){\\n while (abs(ok - ng) > 1){\\n auto mid = (ok + ng) / 2;\\n (check(mid, d) ? ok : ng) = mid;\\n }\\n return ok;\\n };\\n\\n for (int i = 1; i <= n; i++)\\n update(i, 1);\\n vector<int> ans(n);\\n \\n for (int i = n - 1; i >= 0; i--){\\n int res = b_serach(0, n + 2, check, D[i]);\\n update(res, 0);\\n ans[i] = res;\\n }\\n\\n output(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2680,\n \"memory_kb\": 288908,\n \"score_of_the_acc\": -1.5572,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2775_4096005\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"ctime\\\"\\n\\nusing namespace std;\\n\\nconstexpr long long int MOD = 1000000007;\\n//constexpr int MOD = 1000000007;\\n//constexpr int MOD = 998244353;\\n//constexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-8;\\n\\n//int N, M, K, H, W, L, R;\\nlong long int N, M, K, H, W, L, R;\\n\\nclass Add_Segment_Tree {\\n\\tvector<long long int>v;\\n\\tvector<long long int>add;\\n\\tvector<long long int>modi;\\n\\tvector<int>l;\\n\\tvector<int>r;\\n\\tint num;\\n\\tlong long int ret;\\n\\tvoid Left(int place) {\\n\\t\\tif (place >= v.size() / 2) {\\n\\t\\t\\tl[place] = place - v.size() / 2;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tLeft(place * 2);\\n\\t\\tLeft(place * 2 + 1);\\n\\t\\tl[place] = l[place * 2];\\n\\t\\treturn;\\n\\t}\\n\\tvoid Right(int place) {\\n\\t\\tif (place >= v.size() / 2) {\\n\\t\\t\\tr[place] = place - v.size() / 2;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tRight(place * 2);\\n\\t\\tRight(place * 2 + 1);\\n\\t\\tr[place] = r[place * 2 + 1];\\n\\t\\treturn;\\n\\t}\\n\\tlong long int Update(int place) {\\n\\t\\tif (place >= v.size() / 2) {\\n\\t\\t\\treturn v[place];\\n\\t\\t}\\n\\t\\tv[place] = Update(place * 2) + Update(place * 2 + 1);\\n\\t\\treturn v[place];\\n\\t}\\n\\tvoid Modify(int a, int b, long long int num, int place) {\\n\\t\\tif (l[place] >= a && r[place] <= b) {\\n\\t\\t\\tmodi[place] = num * (r[place] - l[place] + 1);\\n\\t\\t\\tv[place] = num * (r[place] - l[place] + 1);\\n\\t\\t\\tadd[place] = 0;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif (l[place] > b || r[place] < a)return;\\n\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t}\\n\\t\\tadd[place * 2] += add[place] / 2;\\n\\t\\tadd[place * 2 + 1] += add[place] / 2;\\n\\t\\tadd[place] = 0;\\n\\t\\tModify(a, b, num, place * 2);\\n\\t\\tModify(a, b, num, place * 2 + 1);\\n\\t\\tv[place] = v[place * 2] + add[place * 2] + v[place * 2 + 1] + add[place * 2 + 1];\\n\\t\\treturn;\\n\\t}\\n\\tvoid Add(int a, int b, long long int num, int place) {\\n\\t\\tif (l[place] >= a && r[place] <= b) {\\n\\t\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\t\\tif (place * 2 < v.size()) {\\n\\t\\t\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t\\t}\\n\\t\\t\\tadd[place] += num * (r[place] - l[place] + 1);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif (l[place] > b || r[place] < a)return;\\n\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t}\\n\\t\\tadd[place * 2] += add[place] / 2;\\n\\t\\tadd[place * 2 + 1] += add[place] / 2;\\n\\t\\tadd[place] = 0;\\n\\t\\tAdd(a, b, num, place * 2);\\n\\t\\tAdd(a, b, num, place * 2 + 1);\\n\\t\\tv[place] = v[place * 2] + add[place * 2] + v[place * 2 + 1] + add[place * 2 + 1];\\n\\t\\treturn;\\n\\t}\\n\\tvoid Sum(int a, int b, int place) {\\n\\t\\tif (l[place] >= a && r[place] <= b) {\\n\\t\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\t\\tif (place * 2 < v.size()) {\\n\\t\\t\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t\\t}\\n\\t\\t\\tret += v[place] + add[place];\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif (l[place]>b || r[place]<a) return;\\n\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place] / 2;\\n\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t}\\n\\t\\tadd[place * 2] += add[place] / 2;\\n\\t\\tadd[place * 2 + 1] += add[place] / 2;\\n\\t\\tadd[place] = 0;\\n\\t\\tSum(a, b, place * 2);\\n\\t\\tSum(a, b, place * 2 + 1);\\n\\t\\tv[place] = v[place * 2] + add[place * 2] + v[place * 2 + 1] + add[place * 2 + 1];\\n\\t\\treturn;\\n\\t}\\npublic:\\n\\tAdd_Segment_Tree(int n) {\\n\\t\\tn++;\\n\\t\\tnum = 1;\\n\\t\\twhile (num < n * 2) {\\n\\t\\t\\tnum *= 2;\\n\\t\\t}\\n\\t\\tl.resize(num);\\n\\t\\tr.resize(num);\\n\\t\\tv.resize(num, 0);\\n\\t\\tadd.resize(num, 0);\\n\\t\\tmodi.resize(num, LLONG_MAX);\\n\\t\\tLeft(1);\\n\\t\\tRight(1);\\n\\t}\\n\\tvoid Insert(int place, long long int num, bool update) {\\n\\t\\tplace += v.size() / 2;\\n\\t\\tv[place] = num;\\n\\t\\tif (!update)return;\\n\\t\\tplace /= 2;\\n\\t\\twhile (place) {\\n\\t\\t\\tv[place] = v[place * 2] + v[place * 2 + 1];\\n\\t\\t\\tplace /= 2;\\n\\t\\t}\\n\\t}\\n\\tvoid Modify(int a, int b, long long int num) {\\n\\t\\tModify(a, b, num, 1);\\n\\t}\\n\\tvoid Add(int a, int b, long long int num) {\\n\\t\\tAdd(a, b, num, 1);\\n\\t}\\n\\tvoid Init() {\\n\\t\\tUpdate(1);\\n\\t}\\n\\tlong long int Sum(int a, int b) {\\n\\t\\tret = 0;\\n\\t\\tSum(a, b, 1);\\n\\t\\treturn ret;\\n\\t}\\n};\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tcin >> N;\\n\\t//Add_Segment_Tree asg(N);\\n\\tAdd_Segment_Tree num(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\t//asg.Add(i, i, N - i);\\n\\t\\tnum.Add(i, i, 1);\\n\\t}\\n\\tlong long int bef = 0;\\n\\tcout << \\\"? 1 \\\" << N << endl;\\n\\tcin >> bef;\\n\\tvector<int>ans(N);\\n\\tfor (int i = N - 2; i >= 0; i--) {\\n\\t\\tcout << \\\"? 1 \\\" << i + 1 << endl;\\n\\t\\tlong long int c;\\n\\t\\tcin >> c;\\n\\t\\t//int box= asg.Sum(bef - c, bef - c);\\n\\t\\tint bag = i + 2 - (bef-c);\\n\\t\\tL = 0;\\n\\t\\tR = N;\\n\\t\\t//cout << \\\"bag \\\" <<bag<< endl;\\n\\t\\twhile (R - L > 1) {\\n\\t\\t\\tint mid = (R + L) / 2;\\n\\t\\t\\tif (num.Sum(1, mid) < bag)L = mid;\\n\\t\\t\\telse R = mid;\\n\\t\\t}\\n\\t\\tans[i + 1] = R;\\n\\t//\\tasg.Add(bef-c, N, -1);\\n\\t\\tnum.Add(ans[i + 1], ans[i+1], -1);\\n\\t\\tbef = c;\\n\\t}\\n\\tlong long int nx = N * (N + 1) / 2 - accumulate(ans.begin(), ans.end(), 0LL);\\n\\tans[0] = nx;\\n\\tcout << \\\"!\\\";\\n\\tfor (auto i : ans)cout << \\\" \\\" << i;\\n\\tcout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3610,\n \"memory_kb\": 288956,\n \"score_of_the_acc\": -1.7565,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2775_3968164\",\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 main() {\\n int N; scanf(\\\"%d\\\", &N);\\n\\n vector<int> A(N), B(N);\\n ll pre = 0;\\n for(int i=0; i<N; i++) {\\n printf(\\\"? %d %d\\\\n\\\", 1, i+1);\\n fflush(stdout);\\n \\n ll v; scanf(\\\"%lld\\\", &v);\\n A[i] = i - (v - pre);\\n pre = v;\\n }\\n\\n pre = 0;\\n for(int i=N-1; i>=0; i--) {\\n printf(\\\"? %d %d\\\\n\\\", i+1, N);\\n fflush(stdout);\\n\\n ll v; scanf(\\\"%lld\\\", &v);\\n B[i] = v - pre;\\n pre = v;\\n }\\n\\n printf(\\\"!\\\");\\n for(int i=0; i<N; i++) printf(\\\" %d\\\", A[i] + B[i] + 1);\\n printf(\\\"\\\\n\\\");\\n fflush(stdout);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2600,\n \"memory_kb\": 288952,\n \"score_of_the_acc\": -1.5402,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2775_2739174\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100000\\n\\nll to_N[NUM+1],from_1[NUM+1],ans[NUM+1];\\n\\n\\nint main(){\\n\\n\\tll N;\\n\\tscanf(\\\"%lld\\\",&N);\\n\\n\\tto_N[N] = 0;\\n\\tfor(ll left = N-1; left >= 1; left--){\\n\\t\\tprintf(\\\"? %lld %lld\\\\n\\\",left,N); fflush(stdout);\\n\\t\\tscanf(\\\"%lld\\\",&to_N[left]);\\n\\t}\\n\\n\\tfrom_1[1] = 0;\\n\\n\\tfor(int right = 2; right <= N; right++){\\n\\t\\tprintf(\\\"? 1 %d\\\\n\\\",right); fflush(stdout);\\n\\t\\tscanf(\\\"%lld\\\",&from_1[right]);\\n\\t}\\n\\n\\tans[1] = to_N[1]-to_N[2]+1;\\n\\tfor(int i = 2; i <= N-1; i++){\\n\\t\\tans[i] = (to_N[i]-to_N[i+1])+((ll)i-(from_1[i]-from_1[i-1]+1))+1;\\n\\t}\\n\\tans[N] = N-(from_1[N]-from_1[N-1]+1)+1;\\n\\n\\tprintf(\\\"!\\\");\\n\\tfor(int i = 1; i <=N; i++)printf(\\\" %lld\\\",ans[i]);\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4670,\n \"memory_kb\": 288940,\n \"score_of_the_acc\": -1.9834,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2775_2739169\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100000\\n\\nll to_N[NUM+1],from_1[NUM+1],ans[NUM+1];\\n\\n\\nint main(){\\n\\n\\tll N;\\n\\tscanf(\\\"%lld\\\",&N);\\n\\n\\tto_N[N] = 0;\\n\\t//右端にかけてのクエリを投げる<ans[left]より右にある小さい数の個数>\\n\\tfor(ll left = N-1; left >= 1; left--){\\n\\t\\tprintf(\\\"? %lld %lld\\\\n\\\",left,N); fflush(stdout);\\n\\t\\tscanf(\\\"%lld\\\",&to_N[left]);\\n\\t}\\n\\n\\tfrom_1[1] = 0;\\n\\t//左端からのクエリを投げる\\n\\tfor(int right = 2; right <= N; right++){\\n\\t\\tprintf(\\\"? 1 %d\\\\n\\\",right); fflush(stdout);\\n\\t\\tscanf(\\\"%lld\\\",&from_1[right]);\\n\\t}\\n\\n\\tans[1] = to_N[1]-to_N[2]+1;\\t //自分の右にある、自分より小さい数の個数+1\\n\\tfor(int i = 2; i <= N-1; i++){\\n\\t\\tans[i] = (to_N[i]-to_N[i+1])+((ll)i-(from_1[i]-from_1[i-1]+1))+1; //自分の右にある、自分より小さい数の個数+自分の左にある、自分より小さい数の個数+1\\n\\t}\\n\\tans[N] = N-(from_1[N]-from_1[N-1]+1)+1;\\n\\n\\tprintf(\\\"!\\\");\\n\\tfor(int i = 1; i <=N; i++)printf(\\\" %lld\\\",ans[i]);\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4700,\n \"memory_kb\": 288940,\n \"score_of_the_acc\": -1.9899,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2775_2558466\",\n \"code_snippet\": \"#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\\nstruct BIT{\\n // [1,n]\\n int n; vector<ll> bit;\\n // ?????????\\n BIT(int _n){\\n n = _n;\\n bit = vector<ll>(n+1,0);\\n }\\n // sum of [1,i]\\n ll sum(int i){\\n ll s = 0;\\n while(i>0){\\n s += bit[i];\\n i -= i & -i;\\n }\\n return s;\\n }\\n // add x in i-th element\\n void add(int i, ll x){\\n while(i<=n){\\n bit[i] += x;\\n i += i & -i;\\n }\\n }\\n};\\n\\nll query(int x)\\n{\\n printf(\\\"? 1 %d\\\\n\\\", x); fflush(stdout);\\n ll ret;\\n scanf(\\\" %lld\\\", &ret);\\n return ret;\\n}\\n\\nint main()\\n{\\n int n;\\n scanf(\\\" %d\\\", &n);\\n\\n vector<int> ans(n);\\n\\n BIT bit(n);\\n for(int i=1; i<=n; ++i) bit.add(i,1);\\n\\n ll x = query(n);\\n for(int i=n-1; i>0; --i)\\n {\\n ll y = query(i);\\n ll diff = x-y;\\n\\n int l=0, r=n;\\n while(r-l>1)\\n {\\n int m = (l+r)/2;\\n if(bit.sum(n)-bit.sum(m)<=diff) r=m;\\n else l=m;\\n }\\n\\n // dbg(l);dbg(r);\\n ans[i] = r;\\n bit.add(r,-1);\\n x = y;\\n }\\n\\n for(int i=1; i<=n; ++i) if(bit.sum(i)-bit.sum(i-1)>0) ans[0] = i;\\n\\n printf(\\\"!\\\");\\n rep(i,n) printf(\\\" %d\\\", ans[i]);\\n printf(\\\"\\\\n\\\");\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1660,\n \"memory_kb\": 288940,\n \"score_of_the_acc\": -1.3389,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2775_2558240\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 1120000000\\n\\ntemplate<typename T>\\nclass BIT {\\nprivate:\\n vector<T> bit;\\n int n;\\npublic:\\n BIT(int _n) : n(_n) {\\n bit = vector<T>(n+1, 0);\\n }\\n void add(int v, T a){ //0-indexed\\n for(int x=v+1; x<=n; x += x&(-x)) bit[x] += a;\\n }\\n T sum(int v){ //0-indexed\\n T ret=0;\\n for(int x=v+1; x>0; x -= x&(-x)) ret += bit[x];\\n return ret;\\n }\\n int lower_bound(T w){ //wテ、ツサツ・テ、ツクツ甘」ツ?ィテ」ツ?ェテ」ツつ凝ヲツ慊?・ツーツ湘」ツ?ョsumテ」ツ?ョテ、ツスツ催ァツスツョ(0-indexed)\\n if(w<=0) return 0;\\n int x=0, d=0;\\n while(n > (1<<d)) d++;\\n for(int k=(1<<(d-1)); k>0; k/=2){\\n if(x+k<=n && bit[x+k]<w){\\n w -= bit[x+k];\\n x += k;\\n }\\n }\\n return x;\\n }\\n};\\n\\nvector<int> ans;\\n\\nlong ask(int l, int r){\\n cout << \\\"? \\\" << l << \\\" \\\" << r << endl;\\n if(ans.size()>0){\\n l--;\\n long ret = 0;\\n rep(i,l,r)rep(j,l,i) if(ans[j] > ans[i]) ret++;\\n return ret;\\n } else {\\n long d;\\n cin>>d;\\n return d;\\n }\\n}\\n\\nint main(int argc, char* argv[]){\\n if(argc>2){\\n rep(i,1,argc) ans.pb(atoi(argv[i]));\\n dbg(ans);\\n }\\n\\n int n;\\n cin>>n;\\n\\n vector<long> acc(n);\\n acc[0] = 0;\\n rep(i,1,n){\\n acc[i] = ask(1,i+1);\\n }\\n vector<long> val(n);\\n val[0] = 0;\\n rep(i,1,n) val[i] = acc[i] - acc[i-1];\\n\\n BIT<int> bit(n+1);\\n rep(i,n) bit.add(i+1,1);\\n\\n vector<int> res(n);\\n for(int i=n-1; i>=0; i--){//dbg(i,val[i]);\\n int idx = bit.lower_bound(i+1-val[i]);\\n res[i] = idx;\\n bit.add(idx, -1);\\n }\\n\\n cout << \\\"!\\\";\\n rep(i,n) cout << \\\" \\\" << res[i];\\n cout<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1700,\n \"memory_kb\": 288896,\n \"score_of_the_acc\": -1.3473,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":1664,"cells":{"group_id":{"kind":"string","value":"aoj_2776_cpp"},"problem_description":{"kind":"string","value":"E: Arai's - Arai's -\n問題\nスクールアイドル時代から、国民的人気を誇ってきた女性アイドルグループArai's。今では、たくさんの「あらい」さんが所属する大規模なグループとして、世界レベルで活躍している。そして今日、新たなるプロジェクトの始動が決定した。彼女たちは、小さなユニットをいくつか結成することで、さらなる売上の向上を試みることになったのである。\nArai'sには「荒井」さんが\nA\n人，「新井」さんが\nB\n人在籍しており、合計で\nA+B\n人の「あらい」さんからなる。新ユニットは、「荒井」さん一人と「新井」さん一人のペアで構成する。（ここで、同じ「あらい」さんが複数のユニットに所属していはいけない。）ただし、ある「荒井」さんが一部の「新井」さんのことを良く思っていないうえに、同様にある「新井」さんが一部の「荒井」さんのことを良く思っていない。「あらい」さんたちはユニットを組む際に、良く思っていない「あらい」さんをペアとして認めてくれず、一方でも認めてくれなければユニットを組むことはできない。\nArai'sのマネージャーであるあなたは、なるべくたくさんのユニットを作りたいと考えているが、メンバーの交友関係からその限界を感じていた。そこであなたは、「あらい」さんたちと個別に面談し、ユニットを組ませたい「あらい」さんについての、良い噂を聞かせることを考えた。面談をした「あらい」さんは、噂に聞いた「あらい」さんを見直し、ユニットのペアとして認めるようになる。\nしかし、あなたはそれほど時間をとることができないため、最大\nK\n回までしか噂を聞かせることができない。あなたは限られた時間の中で、結成できるユニットの数を最大化しようと試みた。あなたが結成できるユニットの数の最大値を求めよ。\n入力形式\nA\nB\nK\na_1\n...\na_A\nb_1\n...\nb_B\n1行目には、「荒井」さんの人数\nA\nと「新井」さんの人数\nB\n(\n1 \\≤ A, B \\≤ 200\nであり\nA\n,\nB\nは整数)、噂を聞かせることができる人数\nK\n(\n0 \\≤ K \\≤ 200\nであり\nK\nは整数)が空白区切りで与えられる。\n続く\nA\n行には、それぞれ長さ\nB\nの\n0\nと\n1\nのみからなる文字列が与えられる。そのうち\ni\n行目の文字列\na_i\nの\nj\n文字目が\n1\nであるとき、\ni\n番目の「荒井」さんは\nj\n番目の「新井」さんを良く思っていない。\n続く\nB\n行には、それぞれ長さ\nA\nの\n0\nと\n1\nのみからなる文字列が与えられる。そのうち\ni\n行目の文字列\nb_i\nの\nj\n文字目が\n1\nであるとき、\ni\n番目の「新井」さんは\nj\n番目の「荒井」さんを良く思っていない。\n出力形式\nあなたが結成できるユニット数の最大値を1行に出力せよ。\n入力例1\n3 3 4\n111\n111\n111\n111\n111\n111\n出力例1\n2\n入力例2\n3 3 2\n101\n100\n010\n001\n011\n111\n出力例2\n3\n入力例3\n5 6 3\n101101\n110110\n010111\n110110\n110111\n01010\n10101\n11101\n01011\n11011\n11011\n出力例3\n4"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2776_10851385","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst ll LINF = 1e18;\nconst int INF = 1e9;\n#define FOR(i,s,t) for(int i =s; i < t;i++)\n#define SZ(a) (int)a.size()\n#define ALL(a) a.begin(),a.end()\n\nstruct Primal_Dual {\n\tstruct edge {\n\t\tint to, rev;\n\t\tll cap, cost;\n\t\tedge() {}\n\t\tedge(int to, ll cap, ll cost, int rev) :to(to), cap(cap), cost(cost), rev(rev) {}\n\t};\n\tvector<vector<edge>> graph;\n\tvector<int> prevv, preve;\n\tvector<ll> potential, min_cost;\n\tPrimal_Dual(int V) :graph(V) {}\n\n\tvoid add_edge(int from, int to, ll cap, ll cost) {\n\t\tgraph[from].emplace_back(to, cap, cost, graph[to].size());\n\t\tgraph[to].emplace_back(from, 0, -cost, graph[from].size() - 1);\n\t}\n\n\tll min_cost_flow(int s, int t, int f) {\n\t\tint V = graph.size();\n\t\tll ret = 0;\n\t\tpriority_queue<pll, vector<pll>, greater<pll>> que;\n\t\tpotential.assign(V, 0);\n\t\tpreve.assign(V, -1);\n\t\tprevv.assign(V, -1);\n\n\t\twhile (f > 0) {\n\t\t\tmin_cost.assign(V, LINF);\n\t\t\tque.push({ 0,s });\n\t\t\tmin_cost[s] = 0;\n\n\t\t\twhile (que.size()) {\n\t\t\t\tpll p = que.top();\n\t\t\t\tque.pop();\n\t\t\t\tif (min_cost[p.second] < p.first) continue;\n\t\t\t\tfor (int i = 0; i < graph[p.second].size(); i++) {\n\t\t\t\t\tedge& e = graph[p.second][i];\n\t\t\t\t\tll nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];\n\t\t\t\t\tif (e.cap > 0 && min_cost[e.to] > nextCost) {\n\t\t\t\t\t\tmin_cost[e.to] = nextCost;\n\t\t\t\t\t\tprevv[e.to] = p.second; preve[e.to] = i;\n\t\t\t\t\t\tque.push(pll(min_cost[e.to], e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (min_cost[t] == LINF) return -1;\n\t\t\tfor (int v = 0; v < V; v++) potential[v] += min_cost[v];\n\t\t\tll add = f;\n\t\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\t\tadd = min(add, graph[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf -= add;\n\t\t\tret += add * potential[t];\n\t\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\t\tedge& e = graph[prevv[v]][preve[v]];\n\t\t\t\te.cap -= add;\n\t\t\t\tgraph[v][e.rev].cap += add;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n};\n\nvoid solve() {\n\tll A, B, K; cin >> A >> B >> K;\n\tvector<string> a(A), b(B);\n\tfor (auto& in : a) cin >> in;\n\tfor (auto& in : b) cin >> in;\n\n\tll S = A + B, T = A + B + 1;\n\tPrimal_Dual clojure(A + B + 2);\n\tfor (int i = 0; i < A; i++) clojure.add_edge(S, i, 1, 0);\n\tfor (int i = 0; i < B; i++) clojure.add_edge(A+i, T, 1, 0);\n\n\tfor (int i = 0; i < A; i++) {\n\t\tfor (int j = 0; j < B; j++) {\n\t\t\tll cost = 0;\n\t\t\tif (a[i][j] == '1') cost++;\n\t\t\tif (b[j][i] == '1') cost++;\n\t\t\t\n\t\t\tclojure.add_edge(i, A + j, 1, cost);\n\t\t}\n\t}\n\n\tll ans = 0;\n\twhile (true) {\n\t\tll ret = clojure.min_cost_flow(S, T, 1);\n//\t\tcout << ret << endl;\n\t\tif (ret == -1) break;\n\t\tif (ret > K) break;\n\t\tK -= ret;\n\t\tans++;\n\t}\n\tcout << ans << endl;\n}\n\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\n\tsolve();\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5720,"score_of_the_acc":-0.2737,"final_rank":11},{"submission_id":"aoj_2776_6941874","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=2167167167167167167;\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\";}\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\n\nnamespace atcoder {\nnamespace internal {\n\ntemplate <class E> struct csr {\n std::vector<int> start;\n std::vector<E> elist;\n explicit 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} // namespace internal\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\n\ntemplate <class Cap, class Cost> struct mcf_graph {\n public:\n mcf_graph() {}\n explicit mcf_graph(int n) : _n(n) {}\n\n int add_edge(int from, int to, Cap cap, Cost cost) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n assert(0 <= cost);\n int m = int(_edges.size());\n _edges.push_back({from, to, cap, 0, cost});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n Cost cost;\n };\n\n edge get_edge(int i) {\n int m = int(_edges.size());\n assert(0 <= i && i < m);\n return _edges[i];\n }\n std::vector<edge> edges() { return _edges; }\n\n std::pair<Cap, Cost> flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\n return slope(s, t, flow_limit).back();\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\n return slope(s, t, std::numeric_limits<Cap>::max());\n }\n std::vector<std::pair<Cap, Cost>> slope(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 int m = int(_edges.size());\n std::vector<int> edge_idx(m);\n\n auto g = [&]() {\n std::vector<int> degree(_n), redge_idx(m);\n std::vector<std::pair<int, _edge>> elist;\n elist.reserve(2 * m);\n for (int i = 0; i < m; i++) {\n auto e = _edges[i];\n edge_idx[i] = degree[e.from]++;\n redge_idx[i] = degree[e.to]++;\n elist.push_back({e.from, {e.to, -1, e.cap - e.flow, e.cost}});\n elist.push_back({e.to, {e.from, -1, e.flow, -e.cost}});\n }\n auto _g = internal::csr<_edge>(_n, elist);\n for (int i = 0; i < m; i++) {\n auto e = _edges[i];\n edge_idx[i] += _g.start[e.from];\n redge_idx[i] += _g.start[e.to];\n _g.elist[edge_idx[i]].rev = redge_idx[i];\n _g.elist[redge_idx[i]].rev = edge_idx[i];\n }\n return _g;\n }();\n\n auto result = slope(g, s, t, flow_limit);\n\n for (int i = 0; i < m; i++) {\n auto e = g.elist[edge_idx[i]];\n _edges[i].flow = _edges[i].cap - e.cap;\n }\n\n return result;\n }\n\tstd::vector<Cost> slope_all(int s, int t,Cap flow_limit) {\n std::vector<std::pair<Cap, Cost>> tmp=slope(s, t, flow_limit);\n\t\tstd::vector<Cost> ans((*tmp.rbegin()).first+1);\n\t\tans[0]=0;\n\t\tfor(int i=0;i<(int)(tmp.size())-1;i++){\n\t\t\tCost diff=(tmp[i+1].second-tmp[i].second)/(tmp[i+1].first-tmp[i].first);\n\t\t\tfor(int j=1+tmp[i].first;j<=tmp[i+1].first;j++){\n\t\t\t\tans[j]=ans[j-1]+diff;\n\t\t\t}\n\t\t}\n\t\treturn ans;\n }\n\tstd::vector<Cost> slope_all(int s, int t){\n\t\treturn slope_all(s,t,std::numeric_limits<Cap>::max());\n }\n\n private:\n int _n;\n std::vector<edge> _edges;\n\n // inside edge\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\n int s,\n int t,\n Cap flow_limit) {\n // variants (C = maxcost):\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\n\n // dual_dist[i] = (dual[i], dist[i])\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\n std::vector<int> prev_e(_n);\n std::vector<bool> vis(_n);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::vector<int> que_min;\n std::vector<Q> que;\n auto dual_ref = [&]() {\n for (int i = 0; i < _n; i++) {\n dual_dist[i].second = std::numeric_limits<Cost>::max();\n }\n std::fill(vis.begin(), vis.end(), false);\n que_min.clear();\n que.clear();\n\n // que[0..heap_r) was heapified\n size_t heap_r = 0;\n\n dual_dist[s].second = 0;\n que_min.push_back(s);\n while (!que_min.empty() || !que.empty()) {\n int v;\n if (!que_min.empty()) {\n v = que_min.back();\n que_min.pop_back();\n } else {\n while (heap_r < que.size()) {\n heap_r++;\n std::push_heap(que.begin(), que.begin() + heap_r);\n }\n v = que.front().to;\n std::pop_heap(que.begin(), que.end());\n que.pop_back();\n heap_r--;\n }\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\n // dist[v] >= 0 (all reduced cost are positive)\n // dist[v] <= (n-1)C\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto e = g.elist[i];\n if (!e.cap) continue;\n // |-dual[e.to] + dual[v]| <= (n-1)C\n // cost <= C - -(n-1)C + 0 = nC\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\n if (dual_dist[e.to].second - dist_v > cost) {\n Cost dist_to = dist_v + cost;\n dual_dist[e.to].second = dist_to;\n prev_e[e.to] = e.rev;\n if (dist_to == dist_v) {\n que_min.push_back(e.to);\n } else {\n que.push_back(Q{dist_to, e.to});\n }\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n // dual[v] = dual[v] - dist[t] + dist[v]\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\n // shortest(s, t) >= 0 - (n-1)C\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost_per_flow = -1;\n std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\n }\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n auto& e = g.elist[prev_e[v]];\n e.cap += c;\n g.elist[e.rev].cap -= c;\n }\n Cost d = -dual_dist[s].first;\n flow += c;\n cost += c * d;\n if (prev_cost_per_flow == d) {\n result.pop_back();\n }\n result.push_back({flow, cost});\n prev_cost_per_flow = d;\n }\n return result;\n }\n};\n\n\n} // namespace atcoder\nusing namespace atcoder;\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 A,B,K;\n\tcin>>A>>B>>K;\n\tmcf_graph<int,int> G(A+B+2);\n\tint S=A+B,T=S+1;\n\trep(i,A) G.add_edge(S,i,1,0);\n\trep(i,B) G.add_edge(i+A,T,1,0);\n\tvector<vector<int>> p(A,vector<int>(B));\n\trep(i,A) rep(j,B){\n\t\tchar c;\n\t\tcin>>c;\n\t\tp[i][j]+=(int)(c-'0');\n\t}\n\trep(j,B) rep(i,A){\n\t\tchar c;\n\t\tcin>>c;\n\t\tp[i][j]+=(int)(c-'0');\n\t}\n\trep(i,A) rep(j,B) G.add_edge(i,j+A,1,p[i][j]);\n\tauto ans=G.slope_all(S,T);\n\tans.push_back(INF);\n\tint a=UB(ans,K);\n\tcout<<a-1<<\"\\n\";\n}","accuracy":1,"time_ms":10,"memory_kb":7344,"score_of_the_acc":-0.6681,"final_rank":14},{"submission_id":"aoj_2776_5533033","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#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}\n\nstruct Primal_Dual{\n const int INF=(1<<30);\n struct edge{\n int to,cap,cost,rev;\n };\n vector<vector<edge>> G;\n vector<int> potential,min_cost,prevv,preve;\n Primal_Dual(int V):G(V){}\n void add_edge(int s,int t,int cap,int cost){\n G[s].push_back((edge){t,cap,cost,(int)(G[t].size())});\n G[t].push_back((edge){s,0,-cost,(int)(G[s].size()-1)});\n }\n int min_cost_flow(int s,int t,int f){\n int V=G.size(); int res=0;\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;\n potential.assign(V,0);\n preve.assign(V,-1);\n prevv.assign(V,-1);\n while(f>0){\n min_cost.assign(V,INF);\n pq.push(make_pair(0,s));\n min_cost[s]=0;\n while(pq.size()){\n auto p=pq.top(); pq.pop();\n if(min_cost[p.second]<p.first)continue;\n int i=-1;\n for(auto &e:G[p.second]){\n i++;\n int nextcost=min_cost[p.second]+e.cost+potential[p.second]-potential[e.to];\n if(e.cap>0 and min_cost[e.to]>nextcost){\n min_cost[e.to]=nextcost;\n prevv[e.to]=p.second;\n preve[e.to]=i;\n pq.push(make_pair(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++){\n potential[v]+=min_cost[v];\n }\n int Addflow=f;\n for(int v=t;v!=s;v=prevv[v]){\n Addflow=min(Addflow,G[prevv[v]][preve[v]].cap);\n }\n f-=Addflow;\n res+=Addflow*potential[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e=G[prevv[v]][preve[v]];\n e.cap-=Addflow;\n G[v][e.rev].cap+=Addflow;\n }\n }\n return res;\n }\n};\n\nchar a[211][211],b[211][211];\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int A,B,K; cin >> A >> B >> K;\n Primal_Dual G(A+B+2);\n int S=A+B,T=A+B+1;\n for(int i=0;i<A;i++){\n G.add_edge(S,i,1,0);\n }\n for(int i=0;i<B;i++){\n G.add_edge(A+i,T,1,0);\n }\n for(int i=0;i<A;i++){\n for(int j=0;j<B;j++){\n cin >> a[i][j];\n }\n }\n for(int i=0;i<B;i++){\n for(int j=0;j<A;j++){\n cin >> b[i][j];\n }\n }\n for(int i=0;i<A;i++){\n for(int j=0;j<B;j++){\n G.add_edge(i,A+j,1,(a[i][j]-'0')+(b[j][i]-'0'));\n }\n }\n int res=0;\n int sum=0;\n for(int i=1;i<=min(A,B);i++){\n int flow=G.min_cost_flow(S,T,1);\n if(flow==-1)break;\n sum+=flow;\n if(sum<=K )res=i;\n else break;\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":4960,"score_of_the_acc":-0.0606,"final_rank":5},{"submission_id":"aoj_2776_5532983","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <class T>\nstruct Primal_Dual {\n using Pa = pair<T, int>;\n int infinity = (int)(1e9);\n struct edge {\n int to;\n T cap, cost;\n int rev;\n };\n int v;\n vector<vector<edge>> edges;\n vector<T> h;\n vector<T> dist;\n vector<int> prevv, preve;\n Primal_Dual(int vsize = 1) {\n v = vsize;\n edges.resize(v);\n h.resize(v);\n dist.resize(v);\n prevv.resize(v);\n preve.resize(v);\n }\n bool add(int from, int to, T cap, T cost) {\n edges[from].push_back((edge){to, cap, cost, (int)edges[to].size()});\n edges[to].push_back((edge){from, 0, -cost, (int)edges[from].size() - 1});\n return 1;\n }\n T solve(int s, int t, T f) {\n T ans = 0;\n h.assign(v, 0);\n while (f > 0) {\n priority_queue<Pa, vector<Pa>, greater<Pa>> qu;\n dist.assign(v, infinity);\n dist[s] = 0;\n qu.push({0, s});\n while (!qu.empty()) {\n Pa now = qu.top();\n qu.pop();\n int nowv = now.second;\n if (dist[nowv] < now.first) continue;\n for (int i = 0; i < (int)edges[nowv].size(); ++i) {\n edge &e = edges[nowv][i];\n if (e.cap > 0 &&\n dist[e.to] > dist[nowv] + e.cost + h[nowv] - h[e.to]) {\n dist[e.to] = dist[nowv] + e.cost + h[nowv] - h[e.to];\n prevv[e.to] = nowv;\n preve[e.to] = i;\n qu.push({dist[e.to], e.to});\n }\n }\n }\n if (dist[t] == infinity) return -1;\n for (int i = 0; i < v; ++i) h[i] += dist[i];\n T d = f;\n for (int i = t; i != s; i = prevv[i])\n d = min(d, edges[prevv[i]][preve[i]].cap);\n f -= d;\n ans += d * h[t];\n for (int i = t; i != s; i = prevv[i]) {\n edge &e = edges[prevv[i]][preve[i]];\n e.cap -= d;\n edges[i][e.rev].cap += d;\n }\n }\n return ans;\n }\n};\n\nint a, b, k;\nvector<vector<int>> cnt;\n\nint main() {\n cin >> a >> b >> k;\n cnt.assign(a, vector<int>(b, 0));\n for (int i = 0; i < a; ++i) {\n string s;\n cin >> s;\n for (int j = 0; j < b; ++j) cnt[i][j] += s[j] - '0';\n }\n for (int i = 0; i < b; ++i) {\n string s;\n cin >> s;\n for (int j = 0; j < a; ++j) cnt[j][i] += s[j] - '0';\n }\n Primal_Dual<int> pd(a + b + 2);\n for (int i = 0; i < a; ++i) pd.add(a + b, i, 1, 0);\n for (int i = 0; i < b; ++i) pd.add(i + a, a + b + 1, 1, 0);\n for (int i = 0; i < a; ++i)\n for (int j = 0; j < b; ++j) pd.add(i, j + a, 1, cnt[i][j]);\n int res = 0;\n while (res < min(a, b)) {\n k -= pd.solve(a + b, a + b + 1, 1);\n if (k < 0) break;\n ++res;\n }\n cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":5324,"score_of_the_acc":-0.1556,"final_rank":8},{"submission_id":"aoj_2776_5532538","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;\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(15);}} __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\";}\nstruct PrimalDual{\n const ll INF=(1ll<<60);\n struct edge{\n int to,rev;ll cap,cost;bool isrev;\n edge(int to,ll cap,ll cost,int rev,bool isrev):to(to),cap(cap),cost(cost),rev(rev),isrev(isrev){}\n };\n vector<vector<edge>> graph;\n vector<ll> potential,min_cost;\n vector<int> prev_v,prev_e;\n\n PrimalDual(int V):graph(V){}\n\n void add_edge(int from,int to,ll cap, ll cost){\n graph[from].emplace_back(to,cap,cost,int(graph[to].size()),false);\n graph[to].emplace_back(from,0,-cost,int(graph[from].size())-1,true);\n }\n\n ll min_cost_flow(int s,int t,ll f){\n int N=graph.size();\n ll res=0;\n priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;\n potential.assign(N,0);\n prev_e.assign(N,-1);\n prev_v.assign(N,-1);\n\n while(f>0){\n min_cost.assign(N,INF);\n pq.emplace(0,s);\n min_cost[s]=0;\n while(pq.size()){\n ll cost=pq.top().fi,cur=pq.top().se;\n pq.pop();\n if(min_cost[cur]<cost)continue;\n for(int i=0;i<graph[cur].size();i++){\n edge &e=graph[cur][i];\n ll next_cost=min_cost[cur]+e.cost+potential[cur]-potential[e.to];\n if(e.cap>0&&min_cost[e.to]>next_cost){\n min_cost[e.to]=next_cost;\n prev_v[e.to]=cur;\n prev_e[e.to]=i;\n pq.emplace(min_cost[e.to],e.to);\n }\n }\n }\n if(min_cost[t]>=INF)return -1;\n for(int v=0;v<N;v++)potential[v]+=min_cost[v];\n ll add_flow=f;\n for(int v=t;v!=s;v=prev_v[v]){\n chmin(add_flow,graph[prev_v[v]][prev_e[v]].cap);\n }\n f-=add_flow;\n res+=add_flow*potential[t];\n for(int v=t;v!=s;v=prev_v[v]){\n edge &e=graph[prev_v[v]][prev_e[v]];\n e.cap-=add_flow;\n graph[v][e.rev].cap+=add_flow;\n }\n }\n return res;\n }\n};\nint main(){\n ll A,B,k;\n cin>>A>>B>>k;\n V<string> a(A),b(B);\n for(int i=0;i<A;i++)cin>>a[i];\n for(int i=0;i<B;i++)cin>>b[i];\n V<V<bool>> ngA(205,V<bool>(205,false)),ngB(205,V<bool>(205,false));;\n for(int i=0;i<A;i++){\n for(int j=0;j<B;j++){\n if(a[i][j]=='1'){\n ngA[i][j]=true;\n }\n }\n }\n for(int i=0;i<B;i++){\n for(int j=0;j<A;j++){\n if(b[i][j]=='1'){\n ngB[i][j]=true;\n } \n }\n }\n ll l=0,r=min(A,B)+1;\n int ma=A+B+5;\n while(r-l>1){\n ll mid=(l+r)/2;\n \n PrimalDual f(ma);\n int S=A+B+1,T=A+B+2;\n for(int i=0;i<A;i++){\n f.add_edge(S,i,1,0);\n }\n for(int i=0;i<B;i++){\n f.add_edge(i+A,T,1,0);\n }\n for(int i=0;i<A;i++){\n for(int j=0;j<B;j++){\n int cost=0;\n if(ngA[i][j])cost++;\n if(ngB[j][i])cost++;\n f.add_edge(i,j+A,1,cost);\n }\n }\n ll v=f.min_cost_flow(S,T,mid);\n // cout<<v<<\" \"<<mid<<\"\\n\";\n if(v==-1)v=inf;\n if(v>k)r=mid;\n else l=mid;\n }\n cout<<l<<\"\\n\";\n}","accuracy":1,"time_ms":180,"memory_kb":6692,"score_of_the_acc":-0.7479,"final_rank":15},{"submission_id":"aoj_2776_5532528","code_snippet":"#include<bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n//#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"unroll-loops\")\nusing namespace std;\n//#include<boost/multiprecision/cpp_int.hpp>\n//#include<boost/multiprecision/cpp_dec_float.hpp>\n//namespace mp=boost::multiprecision;\n//#define mulint mp::cpp_int\n//#define mulfloat mp::cpp_dec_float_100\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n#define INF (1<<30)\n#define LINF (lint)(1LL<<56)\n#define endl \"\\n\"\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\n#define flc(x) __builtin_popcountll(x)\n#define pint pair<int,int>\n#define pdouble pair<double,double>\n#define plint pair<lint,lint>\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define vec vector<lint>\n#define nep(x) next_permutation(all(x))\ntypedef long long lint;\nint dx[8]={1,1,0,-1,-1,-1,0,1};\nint dy[8]={0,1,1,1,0,-1,-1,-1};\nconst int MAX_N=3e5+5;\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//vector<int> bucket[MAX_N/1000];\nconstexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n/*#include<atcoder/all>\nusing namespace atcoder;\ntypedef __int128_t llint;*/\n\nnamespace atcoder {\nnamespace internal {\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} // namespace internal\n}\n\nnamespace atcoder {\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(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 struct edge {\n int from, to;\n Cap cap, flow;\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 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 std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\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 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 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 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\nnamespace atcoder {\ntemplate <class Cap, class Cost> struct mcf_graph {\n public:\n mcf_graph() {}\n mcf_graph(int n) : _n(n), g(n) {}\n int add_edge(int from, int to, Cap cap, Cost cost) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\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, cost});\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0, -cost});\n return m;\n }\n struct edge {\n int from, to;\n Cap cap, flow;\n Cost cost;\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{\n pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,\n };\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result(m);\n for (int i = 0; i < m; i++) {\n result[i] = get_edge(i);\n }\n return result;\n }\n std::pair<Cap, Cost> flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\n return slope(s, t, flow_limit).back();\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\n return slope(s, t, std::numeric_limits<Cap>::max());\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n // variants (C = maxcost):\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\n std::vector<Cost> dual(_n, 0), dist(_n);\n std::vector<int> pv(_n), pe(_n);\n std::vector<bool> vis(_n);\n auto dual_ref = [&]() {\n std::fill(dist.begin(), dist.end(),\n std::numeric_limits<Cost>::max());\n std::fill(pv.begin(), pv.end(), -1);\n std::fill(pe.begin(), pe.end(), -1);\n std::fill(vis.begin(), vis.end(), false);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::priority_queue<Q> que;\n dist[s] = 0;\n que.push(Q{0, s});\n while (!que.empty()) {\n int v = que.top().to;\n que.pop();\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\n // dist[v] >= 0 (all reduced cost are positive)\n // dist[v] <= (n-1)C\n for (int i = 0; i < int(g[v].size()); i++) {\n auto e = g[v][i];\n if (vis[e.to] || !e.cap) continue;\n // |-dual[e.to] + dual[v]| <= (n-1)C\n // cost <= C - -(n-1)C + 0 = nC\n Cost cost = e.cost - dual[e.to] + dual[v];\n if (dist[e.to] - dist[v] > cost) {\n dist[e.to] = dist[v] + cost;\n pv[e.to] = v;\n pe[e.to] = i;\n que.push(Q{dist[e.to], e.to});\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n // dual[v] = dual[v] - dist[t] + dist[v]\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) + (shortest(s, v) + dual[s] - dual[v])\n // = - shortest(s, t) + dual[t] + shortest(s, v)\n // = shortest(s, v) - shortest(s, t) >= 0 - (n-1)C\n dual[v] -= dist[t] - dist[v];\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost = -1;\n std::vector<std::pair<Cap, Cost>> result;\n result.push_back({flow, cost});\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = pv[v]) {\n c = std::min(c, g[pv[v]][pe[v]].cap);\n }\n for (int v = t; v != s; v = pv[v]) {\n auto& e = g[pv[v]][pe[v]];\n e.cap -= c;\n g[v][e.rev].cap += c;\n }\n Cost d = -dual[s];\n flow += c;\n cost += c * d;\n if (prev_cost == d) {\n result.pop_back();\n }\n result.push_back({flow, cost});\n prev_cost = cost;\n }\n return result;\n }\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n}\n\nusing namespace atcoder;\n\nint main(void){\n int A,B,K;\n cin >> A >> B >> K;\n mf_graph<int> G(A+B+2);\n rep(i,A) G.add_edge(A+B,i,1);\n rep(i,B) G.add_edge(A+i,A+B+1,1);\n string a[A],b[B];\n rep(i,A) cin >> a[i];\n rep(i,B) cin >> b[i];\n lint needs[A][B];\n /*rep(i,A) rep(j,B){\n if(a[i][j]=='0' && b[j][i]=='0') G.add_edge(i,A+j,1);\n else G.add_edge(i,A+j,0);\n }*/\n /*int ans=G.flow(A+B,A+B+1);\n vector<mf_graph<int>::edge> es=G.edges();\n int needs[A][B];\n bool used[A+B]={};\n rep(i,es.size()){\n if(es[i].from==A+B || es[i].to==A+B+1) continue;\n if(es[i].flow==1){\n int from=es[i].from,to=es[i].to;\n used[from]=true;\n used[to]=true;\n }\n }*/\n rep(i,A) rep(j,B) needs[i][j]=INF;\n /*rep(i,es.size()){\n if(es[i].from==A+B || es[i].to==A+B+1) continue;\n if(es[i].flow==0){\n int from=es[i].from,to=es[i].to-A;\n int cost=2;\n if(a[from][to]=='0') cost--;\n if(b[to][from]=='0') cost--;\n needs[from][to]=cost;\n if(used[from] || used[to]) needs[from][to]=INF;\n }\n }*/\n rep(i,A) rep(j,B){\n int cost=2;\n if(a[i][j]=='0') cost--;\n if(b[j][i]=='0') cost--;\n needs[i][j]=cost;\n }\n mcf_graph<lint,lint> G2(A+B+2);\n rep(i,A){\n G2.add_edge(A+B,i,1,0);\n }\n rep(i,B){\n G2.add_edge(A+i,A+B+1,1,0);\n }\n rep(i,A) rep(j,B){\n int from=i,to=A+j;\n G2.add_edge(from,to,1,needs[i][j]);\n }\n int lo=0,hi=300;\n while(hi-lo>1){\n int mid=(hi+lo)/2;\n mcf_graph<lint,lint> G3=G2;\n plint res=G3.flow(A+B,A+B+1,mid);\n if(res.se<=K && res.fi==mid) lo=mid;\n else hi=mid;\n }\n cout << lo << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":8616,"score_of_the_acc":-1.0441,"final_rank":19},{"submission_id":"aoj_2776_5532477","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#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}\n\nstruct Primal_Dual{\n const int INF=(1<<30);\n struct edge{\n int to,cap,cost,rev;\n };\n vector<vector<edge>> G;\n vector<int> potential,min_cost,prevv,preve;\n Primal_Dual(int V):G(V){}\n void add_edge(int s,int t,int cap,int cost){\n G[s].push_back((edge){t,cap,cost,(int)(G[t].size())});\n G[t].push_back((edge){s,0,-cost,(int)(G[s].size()-1)});\n }\n int min_cost_flow(int s,int t,int f){\n int V=G.size(); int res=0;\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;\n potential.assign(V,0);\n preve.assign(V,-1);\n prevv.assign(V,-1);\n while(f>0){\n min_cost.assign(V,INF);\n pq.push(make_pair(0,s));\n min_cost[s]=0;\n while(pq.size()){\n auto p=pq.top(); pq.pop();\n if(min_cost[p.second]<p.first)continue;\n int i=-1;\n for(auto &e:G[p.second]){\n i++;\n int nextcost=min_cost[p.second]+e.cost+potential[p.second]-potential[e.to];\n if(e.cap>0 and min_cost[e.to]>nextcost){\n min_cost[e.to]=nextcost;\n prevv[e.to]=p.second;\n preve[e.to]=i;\n pq.push(make_pair(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++){\n potential[v]+=min_cost[v];\n }\n int Addflow=f;\n for(int v=t;v!=s;v=prevv[v]){\n Addflow=min(Addflow,G[prevv[v]][preve[v]].cap);\n }\n f-=Addflow;\n res+=Addflow*potential[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e=G[prevv[v]][preve[v]];\n e.cap-=Addflow;\n G[v][e.rev].cap+=Addflow;\n }\n }\n return res;\n }\n};\n\nchar a[211][211],b[211][211];\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int A,B,K; cin >> A >> B >> K;\n Primal_Dual G(A+B+2);\n int S=A+B,T=A+B+1;\n for(int i=0;i<A;i++){\n G.add_edge(S,i,1,0);\n }\n for(int i=0;i<B;i++){\n G.add_edge(A+i,T,1,0);\n }\n for(int i=0;i<A;i++){\n for(int j=0;j<B;j++){\n cin >> a[i][j];\n }\n }\n for(int i=0;i<B;i++){\n for(int j=0;j<A;j++){\n cin >> b[i][j];\n }\n }\n for(int i=0;i<A;i++){\n for(int j=0;j<B;j++){\n G.add_edge(i,A+j,1,(a[i][j]-'0')+(b[j][i]-'0'));\n }\n }\n int res=0;\n int sum=0;\n for(int i=1;i<=min(A,B);i++){\n int flow=G.min_cost_flow(S,T,1);\n if(flow==-1)break;\n sum+=flow;\n if(sum<=K )res=i;\n else break;\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":4968,"score_of_the_acc":-0.0627,"final_rank":6},{"submission_id":"aoj_2776_4926720","code_snippet":"#include <bits/stdc++.h>\n\nconst int inf = 1000000000;\n\nusing namespace std;\n\nstruct MinimumCostFlow {\n typedef pair<int, int> P;\n\n struct edge {\n int to, cap, rev;\n int cost;\n edge(int a, int b, int c, int d): to(a), cap(b), rev(c), cost(d) {}\n };\n\n vector<vector<edge>> G;\n vector<int> prevv, preve;\n vector<int> h, dist;\n int V;\n\n MinimumCostFlow(int v): G(v, vector<edge>()), prevv(v, 0), preve(v, 0), V(v) {}\n\n int add_edge(int from, int to, int cap, int cost) {\n int id = G[from].size();\n G[from].push_back(edge(to, cap, G[to].size(), cost));\n G[to].push_back(edge(from, 0, G[from].size() - 1, -cost));\n return id;\n }\n\n int solve(int s, int t, int f) {\n int res = 0;\n h.assign(V, 0);\n while (f > 0) {\n priority_queue<P, vector<P>, greater<P>> pq;\n dist.assign(V, inf);\n dist[s] = 0;\n pq.push(P(0, s));\n while (pq.size()) {\n P p = pq.top();\n pq.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n\n for (int i = 0; i < (int)G[v].size(); i++) {\n edge &e = G[v][i];\n int d = dist[v] + e.cost + h[v] - h[e.to];\n if (e.cap > 0 && dist[e.to] > d) {\n dist[e.to] = d;\n prevv[e.to] = v;\n preve[e.to] = i;\n pq.push(P(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == inf) return -1;\n\n for (int v = 0; v < V; v++) h[v] += dist[v];\n\n int 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 * h[t];\n\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\n return res;\n }\n};\n\n#define SIZE 200\n\n\nint main() {\n int A, B, K;\n int a[SIZE][SIZE], b[SIZE][SIZE];\n\n scanf(\"%d%d%d\", &A, &B, &K);\n\n for (int i = 0; i < A; i++) {\n for (int j = 0; j < B; j++) {\n scanf(\"%1d\", a[i] + j);\n }\n }\n\n for (int i = 0; i < B; i++) {\n for (int j = 0; j < A; j++) {\n scanf(\"%1d\", b[j] + i);\n }\n }\n\n MinimumCostFlow flow(A + B + 2);\n\n int S = A + B;\n int T = S + 1;\n\n for (int i = 0; i < A; i++) flow.add_edge(S, i, 1, 0);\n for (int j = 0; j < B; j++) flow.add_edge(A + j, T, 1, 0);\n\n for (int i = 0; i < A; i++) {\n for (int j = 0; j < B; j++) {\n flow.add_edge(i, A + j, 1, a[i][j] + b[i][j]);\n }\n }\n\n int ans = 0;\n\n for (int i = 0; i < min(A, B); i++) {\n int res = flow.solve(S, T, 1);\n if (res < 0) break;\n if (K < res) break;\n ans++;\n K -= res;\n }\n\n printf(\"%d\\n\", ans);\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4948,"score_of_the_acc":-0.0722,"final_rank":7},{"submission_id":"aoj_2776_4471577","code_snippet":"#include <cassert>\n#include <cstdio>\n#include <vector>\n#include <queue>\n#include <utility>\n#include <iostream>\n#include <tuple>\n#include <limits>\nusing namespace std;\n\nstruct MinCostFlowGraph {\nprivate:\n using ll = long long;\n struct edge {\n int to;\n ll cap, cost;\n int r_idx;\n edge(int t, ll cap, ll cost, int r) :\n to(t), cap(cap), cost(cost), r_idx(r) {}\n };\n vector<vector<edge>> G;\n int sz;\n\npublic:\n MinCostFlowGraph(int n) : G(n), sz(n) {}\n\n void add_edge(int from, int to, ll cap, ll cost){\n int i = G[to].size(), i_ = G[from].size();\n G[from].emplace_back(to,cap,cost,i);\n G[to].emplace_back(from,0,-cost,i_);\n }\n \n ll solve(int from, int to, ll k){\n ll f = 0, cost_sum = 0;\n const ll INF = numeric_limits<ll>::max();\n vector<ll> potential(sz);\n while(1){\n vector<ll> dist(sz,INF);\n dist[from] = 0;\n vector<int> prev_v(sz,-1);\n vector<int> prev_e(sz,-1);\n priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<>> pq;\n pq.emplace(0,from);\n while(pq.size()){\n // auto [d, v] = pq.top();\n ll d = pq.top().first;\n ll v = pq.top().second;\n // d *= -1;\n pq.pop();\n if(dist[v] < d) continue;\n for(size_t i = 0; i < G[v].size(); ++i){\n const auto& e = G[v][i];\n if(e.cap == 0) continue;\n int v_ = e.to;\n ll d_ = d + e.cost + potential[v] - potential[v_];\n if(dist[v_] <= d_)\n continue;\n dist[v_] = d_;\n prev_v[v_] = v;\n prev_e[v_] = i;\n // pq.emplace(-d_,e.to);\n pq.emplace(d_,e.to);\n }\n }\n if(dist[to] >= INF) return f;\n for(int i = 0; i < sz; ++i)\n potential[i] += dist[i];\n int v = to;\n ll flow = 1;\n while(v != from){\n int v_ = prev_v[v];\n flow = min(flow,G[v_][prev_e[v]].cap);\n v = v_;\n }\n v = to;\n ll diff = 0;\n while(v != from){\n int v_ = prev_v[v];\n auto& e = G[v_][prev_e[v]];\n e.cap -= flow;\n diff += flow*e.cost;\n G[v][e.r_idx].cap += flow;\n v = v_;\n }\n if(cost_sum+diff > k)\n return f;\n f += flow;\n cost_sum += diff;\n }\n return f;\n }\n};\n\nint main(){\n int a, b, k;\n cin >> a >> b >> k;\n MinCostFlowGraph G(a+b+2);\n vector<vector<int>> E(a,vector<int>(b));\n for(int i = 0; i < a; ++i){\n string s;\n cin >> s;\n for(int j = 0; j < b; ++j){\n int c = s[j] - '0';\n E[i][j] += c;\n }\n }\n for(int j = 0; j < b; ++j){\n string s;\n cin >> s;\n for(int i = 0; i < a; ++i){\n int c = s[i] - '0';\n E[i][j] += c;\n }\n }\n for(int i = 0; i < a; ++i)\n for(int j = 0; j < b; ++j)\n G.add_edge(i,a+j,1,E[i][j]);\n int s = a+b, t = s+1;\n for(int i = 0; i < a; ++i)\n G.add_edge(s,i,1,0);\n for(int j = 0; j < b; ++j)\n G.add_edge(a+j,t,1,0);\n cout << G.solve(s,t,k) << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":6396,"score_of_the_acc":-0.4648,"final_rank":13},{"submission_id":"aoj_2776_4471440","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;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000007LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\n/* do your best */\n\n// 最小費用流\n// O(F E log V)\n// 与えられるもの\n// 有向グラフ G = (V, E)\n// 各辺 e に対して, 容量 u(e) >= 0\n// 各辺 e に対して, 費用 c(e) (負でも ok)\n\n// 使い方\n// PrimalDual(V) (コンストラクタ)\n// add_edge(int from, int to, flow_t cap, cost_t cost)\n// cost に関する負の閉路が存在する場合,だめ\n// veryfied : http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B&lang=jp\n// 流れなかったら -1 を返す\n\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\n lint A, B, K; cin >> A >> B >> K;\n vector<string> a(A);\n for (int i = 0; i < A; i++) {\n cin >> a[i];\n }\n vector<string> b(B);\n for (int i = 0; i < B; i++) {\n cin >> b[i];\n }\n \n\n // cost が k 以下の中の最大の F\n int ok = 0;\n int ng = min(A, B) + 1;\n while (ng - ok > 1) {\n int mid = (ok + ng) / 2;\n PrimalDual<int, int> pd(A + B + 2);\n int source = A + B;\n int sink = A + B + 1;\n\n for (int i = 0; i < A; i++) {\n int from = source;\n int to = i;\n pd.add_edge(from, to, 1, 0);\n }\n\n for (int i = 0; i < B; i++) {\n int from = A + i;\n int to = sink;\n pd.add_edge(from, to, 1, 0);\n }\n\n for (int i = 0; i < A; i++) {\n for (int j = 0; j < B; j++) {\n int from = i;\n int to = j + A;\n int cap = 1;\n int cost = 0;\n if (a[i][j] == '1') cost++;\n if (b[j][i] == '1') cost++;\n pd.add_edge(from, to, cap, cost);\n }\n }\n\n int cost = pd.min_cost_flow(source, sink, mid);\n\n if (cost <= K) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n\n cout << ok << endl;\n\n\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":5192,"score_of_the_acc":-0.4447,"final_rank":12},{"submission_id":"aoj_2776_3967902","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// 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;\n vector< pair<int, int> > r_edges;\n Flow(int N_, CapTp IA_=1<<29, CostTp IO_=1<<29)\n : G(N_), IA(IA_), IO(IO_), r_edges() {}\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 vector<CostTp> dist(G.size()); CostTp res(0);\n vector<int> prevv(G.size()), preve(G.size());\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 -1;\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 vector<CostTp> dist(G.size()), pot(G.size());\n vector<int> prevv(G.size()), preve(G.size());\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 INF;\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\n\nint main() {\n int A, B, K; cin >> A >> B >> K;\n vector<string> X(A), Y(B);\n for(int i=0; i<A; i++) cin >> X[i];\n for(int i=0; i<B; i++) cin >> Y[i];\n\n Flow<> fl(A + B + 2);\n int source = A + B, sink = source + 1;\n for(int i=0; i<A; i++) fl.add_edge(source, i, 1, 0);\n for(int i=0; i<B; i++) fl.add_edge(A+i, sink, 1, 0);\n \n for(int i=0; i<A; i++) {\n for(int j=0; j<B; j++) {\n int cnt = 0;\n if(X[i][j] == '1') cnt++;\n if(Y[j][i] == '1') cnt++;\n // fprintf(stderr, \"i = %d, j = %d, cnt = %d\\n\", i, j, cnt);\n fl.add_edge(i, A+j, 1, cnt);\n }\n }\n\n int ub = min(A, B) + 1, lb = 0;\n while(ub - lb > 1) {\n Flow<> fl_ = fl;\n int mid = (ub + lb) / 2;\n int res = fl_.fast_mincost_flow(source, sink, mid);\n // fprintf(stderr, \"mid = %d, res = %d\\n\", mid, res);\n if(res <= K) lb = mid;\n else ub = mid;\n }\n cout << lb << endl;\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":7464,"score_of_the_acc":-1.0376,"final_rank":18},{"submission_id":"aoj_2776_2917969","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\"; return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \" \";} return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \"{ \"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \":\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \", \"; } out << \" }\"; return out; }\n\n/*\n <url:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2776>\n 問題文============================================================\n =================================================================\n 解説=============================================================\n ================================================================\n */\ntypedef ll PD_Type;\nconst PD_Type PD_INF = INF;\nstruct Primal_Dual\n{\n typedef pair< PD_Type, int > pii;\n \n struct edge\n {\n int to, rev;\n PD_Type cap, cost;\n edge() {}\n edge(int to, PD_Type cap, PD_Type cost, int rev) :to(to), cap(cap), cost(cost), rev(rev) {}\n \n };\n vector< vector< edge > > graph;\n vector< int > prevv, preve;\n vector< PD_Type > potential, min_cost;\n Primal_Dual(int V) : graph(V) {}\n \n void add_edge(int from, int to, PD_Type cap, PD_Type cost)\n {\n graph[from].push_back(edge(to, cap, cost, (int)graph[to].size()));\n graph[to].push_back(edge(from, 0, -cost, (int)graph[from].size() - 1));\n }\n \n PD_Type min_cost_flow(int s, int t, int f)\n {\n int V = (int)graph.size();\n PD_Type ret = 0;\n priority_queue< pii, vector< pii >, greater< pii > > 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, PD_INF);\n que.push(pii(0, s));\n min_cost[s] = 0;\n \n while (!que.empty()) {\n pii p = que.top();\n que.pop();\n if (min_cost[p.second] < p.first) continue;\n for (int i = 0; i < (int)graph[p.second].size(); i++) {\n edge &e = graph[p.second][i];\n PD_Type 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.push(pii(min_cost[e.to], e.to));\n }\n }\n }\n if (min_cost[t] == PD_INF) return -1;\n for (int v = 0; v < V; v++) potential[v] += min_cost[v];\n PD_Type 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\nvoid solve() {\n int A, B, K; cin >> A >> B >> K;\n vector<string> a(A), b(B);\n for (auto& in : a) cin >> in;\n for (auto& in : b) cin >> in;\n \n int S = A + B, T = A + B + 1;\n Primal_Dual clojure(A + B + 2);\n for (int i = 0; i < A; i++) clojure.add_edge(S, i, 1, 0);\n for (int i = 0; i < B; i++) clojure.add_edge(A+i, T, 1, 0);\n \n for (int i = 0; i < A; i++) {\n for (int j = 0; j < B; j++) {\n ll cost = 0;\n if (a[i][j] == '1') cost++;\n if (b[j][i] == '1') cost++;\n clojure.add_edge(i, A + j, 1, cost);\n }\n }\n \n ll ans = 0;\n while (true) {\n ll ret = clojure.min_cost_flow(S, T, 1);\n if (ret == -1) break;\n if (ret > K) break;\n K -= ret;\n ans++;\n }\n cout << ans << endl;\n}\n\nint main() {\n cin.tie(0); ios_base::sync_with_stdio(false);\n solve();\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":5540,"score_of_the_acc":-0.2414,"final_rank":10},{"submission_id":"aoj_2776_2754638","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define NUM 410\n\n\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,int arg_cost,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\tcost = arg_cost;\n\t\trev_index = arg_rev_index;\n\t}\n\n\tint to,capacity,cost,rev_index;\n};\n\nint V;\nvector<Edge> G[NUM];\nint dist[NUM];\nint pre_node[NUM],pre_edge[NUM];\n\n\nvoid add_edge(int from,int to,int capacity,int cost){\n\tG[from].push_back(Edge(to,capacity,cost,G[to].size()));\n\tG[to].push_back(Edge(from,0,-cost,G[from].size()-1));\n}\n\nint min_cost_flow(int source,int sink,int flow){\n\tint ret = 0;\n\twhile(flow > 0){\n\n\t\tfor(int i = 0; i < V; i++)dist[i] = BIG_NUM;\n\t\tdist[source] = 0;\n\t\tbool update = true;\n\t\twhile(update){\n\t\t\tupdate = false;\n\t\t\tfor(int node_id = 0; node_id < V; node_id++){\n\t\t\t\tif(dist[node_id] == BIG_NUM)continue;\n\t\t\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\t\t\tEdge &e = G[node_id][i];\n\t\t\t\t\tif(e.capacity > 0 && dist[e.to] > dist[node_id]+e.cost){\n\t\t\t\t\t\tdist[e.to] = dist[node_id]+e.cost;\n\t\t\t\t\t\tpre_node[e.to] = node_id;\n\t\t\t\t\t\tpre_edge[e.to] = i;\n\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(dist[sink] == BIG_NUM){\n\t\t\treturn -1;\n\t\t}\n\n\t\tint tmp_flow = flow;\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\ttmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\n\t\t}\n\t\tflow -= tmp_flow;\n\t\tret += tmp_flow*dist[sink];\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\tEdge &e = G[pre_node[node_id]][pre_edge[node_id]];\n\t\t\te.capacity -= tmp_flow;\n\t\t\tG[node_id][e.rev_index].capacity += tmp_flow;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main(){\n\n\tint A,B,K;\n\tscanf(\"%d %d %d\",&A,&B,&K);\n\n\tchar table_1[A][B+1],table_2[B][A+1];\n\tint cost[A][B];\n\n\tfor(int i = 0; i < A; i++){\n\t\tscanf(\"%s\",table_1[i]);\n\t}\n\n\tfor(int i = 0; i < B; i++){\n\t\tscanf(\"%s\",table_2[i]);\n\t}\n\n\tfor(int i = 0; i < A; i++){\n\t\tfor(int k = 0; k < B; k++){\n\t\t\tcost[i][k] = (table_1[i][k]-'0')+(table_2[k][i]-'0');\n\t\t}\n\t}\n\n\tint source = 0,sink = 1,index = 2;\n\tint index_A[A],index_B[B];\n\n\tfor(int i = 0; i < A; i++){\n\t\tindex_A[i] = index++;\n\t\tadd_edge(source,index_A[i],1,0);\n\t}\n\n\tfor(int i = 0; i < B; i++){\n\t\tindex_B[i] = index++;\n\t\tadd_edge(index_B[i],sink,1,0);\n\t}\n\n\tfor(int i = 0; i < A; i++){\n\t\tfor(int k = 0; k < B; k++){\n\t\t\tadd_edge(index_A[i],index_B[k],1,cost[i][k]);\n\t\t}\n\t}\n\n\tint ans = 0,add_cost;\n\tint sum_cost = 0;\n\n\tV = index;\n\n\twhile(sum_cost <= K){\n\t\tadd_cost = min_cost_flow(source,sink,1);\n\n\t\tif(add_cost < 0)break;\n\n\t\tif(sum_cost+add_cost <= K){\n\t\t\tsum_cost += add_cost;\n\t\t\tans++;\n\t\t\tif(ans == min(A,B))break;\n\t\t}else{\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4932,"score_of_the_acc":-0.0533,"final_rank":4},{"submission_id":"aoj_2776_2558428","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 1120000000\n\ntemplate<typename T>\nclass MinCostFlow{\nprivate:\n struct edge{int to; T cap, cost; int rev;};\n using P = pair<T,int>;\n vector<vector<edge> > Graph;\n vector<int> prevv, preve;\n vector<T> h, d; // ??????????????£?????????????????¢\npublic:\n MinCostFlow(int v){\n // ????????°v??§?????????\n Graph.resize(v);\n prevv.resize(v);\n preve.resize(v);\n h.resize(v);\n d.resize(v);\n }\n T min_cost_flow(int s, int t, T f){\n T res = 0;\n fill(all(h), 0);\n // ??????????????????????????¨???\n // rep(v,Graph.size()){\n // rep(j,Graph[v].size()){\n // edge &e = Graph[v][j];\n // if(e.cap==0) continue;\n // int u = e.to;\n // h[u] = min(h[u],h[v]+e.cost);\n // }\n // }\n while(f>0){\n priority_queue<P, vector<P>, greater<P>> pq;\n fill(all(d), INF);\n d[s] = 0;\n pq.push(mp(0,s));\n while(!pq.empty()){\n auto p = pq.top(); pq.pop();\n int v = p.se;\n if(d[v] < p.fi) continue;\n rep(i,Graph[v].size()){\n edge &e = Graph[v][i];\n if(e.cap > 0 && d[e.to] > d[v] + e.cost + h[v] - h[e.to]){\n d[e.to] = d[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n pq.push(mp(d[e.to], e.to));\n }\n }\n }\n if(d[t] == INF) return -1;\n rep(i,Graph.size()) h[i] += d[i];\n\n T nf = f;\n for(int v=t; v!=s; v = prevv[v]){\n nf = min(nf, Graph[prevv[v]][preve[v]].cap);\n }\n f -= nf;\n res += nf * h[t];\n for(int v=t; v!=s; v=prevv[v]){\n edge &e = Graph[prevv[v]][preve[v]];\n e.cap -= nf;\n Graph[v][e.rev].cap += nf;\n }\n }\n return res;\n }\n void add_edge(int from ,int to, T cap, T cost){\n Graph[from].pb(((edge){to, cap, cost, (int)Graph[to].size()}));\n Graph[to].pb(((edge){from, 0, -cost, (int)Graph[from].size()-1}));\n }\n};\n\nint main(){\n int a,b,k;\n cin>>a>>b>>k;\n\n vector<string> va(a), vb(b);\n rep(i,a) cin>>va[i];\n rep(i,b) cin>>vb[i];\n\n MinCostFlow<int> flow(a+b+2);\n int s = a+b;\n int t = a+b+1;\n\n rep(i,a) rep(j,b){\n int cost = va[i][j] + vb[j][i] -'0'*2;\n flow.add_edge(i, a+j, 1, cost);\n }\n rep(i,a) flow.add_edge(s, i, 1, 0);\n rep(i,b) flow.add_edge(a+i, t, 1, 0);\n\n int crnt = 0;\n int totalcost = 0;\n while(true){\n int nv = flow.min_cost_flow(s, t, 1);\n if(nv == -1 || totalcost+nv > k) break;\n totalcost += nv;\n crnt++;\n }\n cout << crnt << endl;\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":4784,"score_of_the_acc":-0.0441,"final_rank":2},{"submission_id":"aoj_2776_2558246","code_snippet":"#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\nusing pi = pair<int,int>;\n\n// (ティツ。ツ古」ツ?催・ツ?? テ・ツョツケテゥツ?? テ」ツつウテ」ツつケテ」ツδ? テゥツ??ィツセツコ)\nstruct edge{ int to,cap,cost,rev; };\n\nint V; // TODO:initialize\nconst int MAX_V = 444; // TODO:initialize\nconst int INF = 19191919; // TODO:initialize\nvector<edge> G[MAX_V];\nint h[MAX_V]; // テ」ツδ敕」ツδ?」ツδウテ」ツつキテ」ツδ」テ」ツδォ\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V]; // テァツ崢エテ・ツ可催」ツ?ョテゥツ?づァツつケテ」ツ?ィティツセツコ\n\nvoid add_edge(int from, int to, int cap, int cost){\n G[from].pb({to,cap,cost,(int)G[to].size()});\n G[to].pb({from,0,-cost,(int)G[from].size()-1});\n}\n\n// sテ」ツ?凝」ツつ液テ」ツ?クテ」ツ?ョテヲツオツ?ゥツ?叔テ」ツ?ョテヲツ慊?・ツーツ湘ィツイツサテァツ板ィテヲツオツ?テ、ツクツ催・ツ渉ッティツδステ」ツ?ェテ」ツつ?1)\nint min_cost_flow(int s, int t, int f, bool neg = false){\n int res = 0;\n fill(h,h+V,0);\n while(f>0){\n priority_queue<pi,vector<pi>,greater<pi>> pq;\n fill(dist,dist+V,INF);\n dist[s]=0;\n if(neg)\n {\n // bellman-fordテ」ツ?ァhテ」ツつ津ヲツ崢エテヲツ鳴ー\n neg = false;\n bool update;\n do{\n update = false;\n rep(v,V){\n if(dist[v] == INF) continue;\n rep(i,G[v].size()){\n edge &e = G[v][i];\n if(e.cap>0 && dist[e.to]>dist[v]+e.cost){\n dist[e.to]=dist[v]+e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }while(update);\n }\n else\n {\n // dijkstraテ」ツ?ァhテ」ツつ津ヲツ崢エテヲツ鳴ー\n pq.push(pi(0,s));\n while(!pq.empty()){\n pi p = pq.top();\n pq.pop();\n int v = p.se;\n if(p.fi>dist[v]) continue;\n rep(i,G[v].size()){\n edge &e = G[v][i];\n if(e.cap>0 && dist[e.to]>dist[v]+e.cost+h[v]-h[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 pq.push(pi(dist[e.to],e.to));\n }\n }\n }\n }\n\n // テ」ツ?禿」ツつ古、ツサツ・テ、ツクツ甘ヲツオツ?」ツ?崚」ツ?ェテ」ツ??\n if(dist[t]==INF) return -1;\n\n rep(v,V) h[v] += dist[v];\n\n // s-tテゥツ鳴禿」ツ?ョテヲツ慊?ァツ淞ュティツキツッテ」ツ?ォテヲツイツソテ」ツ?」テ」ツ?ヲテァツ崢ョテ、ツクツ?ヲツ敖ッテヲツオツ?」ツ??\n int d=f;\n for(int v=t; v!=s; v=prevv[v]) d = min(d,G[prevv[v]][preve[v]].cap);\n f -= d;\n res += d*h[t];\n\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 return res;\n}\n\nint main()\n{\n int A,B,K;\n cin >>A >>B >>K;\n\n V = A+B+2;\n\n vector<string> a(A),b(B);\n rep(i,A) cin >>a[i];\n rep(i,B) cin >>b[i];\n\n int S = A+B, T = S+1;\n rep(i,A) add_edge(S,i,1,0);\n rep(i,B) add_edge(A+i,T,1,0);\n\n rep(i,A)rep(j,B)\n {\n int cost = 0;\n cost += a[i][j]-'0';\n cost += b[j][i]-'0';\n add_edge(i,A+j,1,cost);\n }\n\n int total = 0;\n int ans = 0;\n while(1)\n {\n int F = min_cost_flow(S,T,1);\n if(F==-1) break;\n\n total += F;\n if(total>K) break;\n ++ans;\n }\n\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4796,"score_of_the_acc":-0.0325,"final_rank":1},{"submission_id":"aoj_2776_2339842","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(auto i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\n\n\n\ntypedef int Weight;\ntypedef int Cap;\nconst Weight W_INF = INT_MAX;\nconst Weight W_ZERO = 0;\nconst Cap C_INF = INT_MAX;\nconst Cap C_ZERO = 0;\n\nstruct Edge {\n\tint src, dst;\n\tCap capacity;\n\tWeight cost;\n\tEdge(int src, int dst, const Cap& acap, const Weight& acost) :\n\t\tsrc(src), dst(dst), capacity(acap), cost(acost) {\n\t}\n};\nbool operator < (const Edge &e, const Edge &f) {\n\treturn e.cost > f.cost;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\n\n#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\n#define RCOST(u,v) (cost[u][v] + h[u] - h[v])\n\n//??°?????????????????§???????????????????????¨?????????\n\n//Graph &ag\n//????????§???????????????(u, v, capacity, cost) ??????????????????(u, v, 0, -cost) ???????????°????????????????????¶?????????????????§????´???°????????§???????????°???????????????\n//int s, int t\n//?????????????§??????¨?????????\n//?????????\n//?????¨??¨????????????????????????\npair<Weight, Cap> minimumCostFlow(const int amax,const Graph &ag, int s, int t) {\n\t//check???????´???°??????????????£???????????????\n\tGraph g(ag);\n\tfor (int i = 0; i < ag.size(); ++i) {\n\t\tfor (int j = 0; j < ag[i].size(); ++j) {\n\t\t\tint d = ag[i][j].dst;\n\t\t\tint s = ag[i][j].src;\n\n\t\t\tbool ok = false;\n\t\t\tfor (int k = 0; k < ag[d].size(); ++k) {\n\t\t\t\tif (ag[d][k].src == s) {\n\t\t\t\t\tok = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!ok) {\n\t\t\t\tg[d].push_back(Edge(d, s, C_ZERO, -ag[i][j].cost));\n\t\t\t}\n\t\t}\n\t}\n\tconst int n = g.size();\n\tvector<vector<Cap>> capacity(n, vector<Cap>(n)), flow(n, vector<Cap>(n));\n\tvector<vector<Weight>>cost(n, vector<Weight>(n));\n\tfor (int u = 0; u < n; ++u) {\n\t\tfor (auto e : g[u]) {\n\t\t\tcapacity[e.src][e.dst] = capacity[e.src][e.dst] + e.capacity;\n\t\t\tcost[e.src][e.dst] = cost[e.src][e.dst] + e.cost;\n\t\t}\n\t}\n\tpair<Weight, Cap> total; // (cost, flow)\n\tvector<Weight> h(n);\n\n\tfor (Cap F = amax; F > 0; ) { // residual flow\n\t\tvector<Weight> d(n, W_INF); d[s] = W_ZERO;\n\t\tvector<int> p(n, -1);\n\t\tpriority_queue<Edge> Q; // \"e < f\" <=> \"e.cost > f.cost\"\n\t\tfor (Q.push(Edge(-2, s, C_ZERO, W_ZERO)); !Q.empty(); ) {\n\t\t\tEdge e = Q.top(); Q.pop();\n\t\t\tif (p[e.dst] != -1) continue;\n\t\t\tp[e.dst] = e.src;\n\t\t\tFOR(f, g[e.dst]) {\n\t\t\t\tif (RESIDUE(f->src, f->dst) > 0) {\n\t\t\t\t\tif (d[f->dst] > d[f->src] + RCOST(f->src, f->dst)) {\n\t\t\t\t\t\td[f->dst] = d[f->src] + RCOST(f->src, f->dst);\n\t\t\t\t\t\tQ.push(Edge(f->src, f->dst, 0, d[f->dst]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (p[t] == -1) {\n\t\t\tbreak;\n\t\t}\n\n\t\tCap f = F;\n\t\tfor (int u = t; u != s; u = p[u]) {\n\t\t\tf = min(f, RESIDUE(p[u], u));\n\t\t}\n\t\tfor (int u = t; u != s; u = p[u]) {\n\t\t\ttotal.first = total.first + f * cost[p[u]][u];\n\t\t\tflow[p[u]][u] = flow[p[u]][u] + f; flow[u][p[u]] = flow[u][p[u]] - f;\n\t\t}\n\t\tF = F - f;\n\t\ttotal.second = total.second + f;\n\t\tfor (int u = 0; u < n; ++u) {\n\t\t\th[u] = h[u] + d[u];\n\t\t}\n\t}\n\treturn total;\n}\nvoid add_edge(Graph&g, const int from, const int to, const Cap& cap, const Weight& weight) {\n\tassert(weight >= 0);//????????¨?????°??????\n\tg[from].push_back(Edge(from, to, cap, weight));\n}\n\nint main() {\n\tint A, B, K; cin >> A >> B >> K;\n\tvector<vector<int>>costs(A, vector<int>(B));\n\tfor (int i = 0; i < A; ++i) {\n\t\tstring st; cin >> st;\n\t\tfor (int j = 0; j < B; ++j) {\n\t\t\tauto c = st[j] != '1';\n\t\t\tif (c == 0)costs[i][j] += 1;\n\t\t}\n\t}\n\tfor (int i = 0; i < B; ++i) {\n\t\tstring st; cin >> st;\n\t\tfor (int j = 0; j < A; ++j) {\n\t\t\tauto c = st[j]!= '1';\n\t\t\tif (c == 0)costs[j][i] += 1;\n\t\t}\n\t}\n\n\tconst int start = 0;\n\tconst int aa = start + 1;\n\tconst int bb=aa+A;\n\tconst int goal = bb + B;\n\tGraph g(goal + 1);\n\tfor (int i = 0; i < A; ++i) {\n\t\tg[start].push_back(Edge(start, aa + i, 1, 0));\n\t}\n\tfor (int i = 0; i < A; ++i) {\n\t\tfor (int j = 0; j < B; ++j) {\n\t\t\tg[aa + i].push_back(Edge(aa + i, bb + j, 1, costs[i][j]));\n\t\t}\n\t}\n\tfor (int j = 0; j < B; ++j) {\n\t\tg[bb + j].push_back(Edge(bb + j, goal, 1, 0));\n\t}\n\tint amin = 0;\n\tint amax = min(A,B)+1;\n\twhile (amin + 1 != amax) {\n\t\tint amid = (amin + amax) / 2;\n\t\tauto p = minimumCostFlow(amid, g, start, goal);\n\t\tif (minimumCostFlow(amid, g, start, goal).first <=K) {\n\t\t\tamin = amid;\n\t\t}\n\t\telse {\n\t\t\tamax = amid;\n\t\t}\n\t}\n\tcout << amin << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":690,"memory_kb":8064,"score_of_the_acc":-1.8559,"final_rank":20},{"submission_id":"aoj_2776_2270763","code_snippet":"#include<bits/stdc++.h>\n#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)\n#define rep(i,a) FOR(i,0,a)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define sz size()\n#define MP make_pair\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\n\nconst int INF = 1e8;\n\nstruct edge{\n int from, to, cost, cap, rev;\n edge(int a, int b, int c, int d, int e)\n :from(a), to(b), cost(c), cap(d), rev(e) {}\n};\n\n\nstruct minFlow{\n int v;\n vector< vector<edge> > graph;\n vi d, use, h, pv, pe;\n\n minFlow(int n):v(n){\n graph.resize(v);\n pv.resize(v); pe.resize(v);\n }\n\n void add(int s, int g, int c, int p){\n graph[s].pb(edge(s,g,c,p,graph[g].sz));\n graph[g].pb(edge(g,s,-c,0,graph[s].sz-1));\n }\n\n int maxFlow(int s, int t, int k){\n int res = 0, cost = 0;\n h = vi(v,0);\n\n while(1){\n int f = 1;\n priority_queue< pii, vector<pii>, greater<pii> > q;\n d = vi(v,INF);\n d[s] = 0; q.push(MP(0,s));\n \n while(q.sz){\n\tpii p = q.top(); q.pop();\n\tint u = p.second;\n\tif(d[u] < p.first) continue;\n\trep(i, graph[u].sz){\n\t edge &e = graph[u][i];\n\t if(e.cap>0 && d[e.to] > d[u] + e.cost + h[u] - h[e.to]){\n\t d[e.to] = d[u] + e.cost + h[u] - h[e.to];\n\t pv[e.to] = u; pe[e.to] = i;\n\t q.push( MP(d[e.to], e.to) );\n\t }\n\t}\n }\n if(d[t] == INF) break;\n rep(u,v) h[u] += d[u];\n \n int x = f;\n for(int u=t;u!=s;u=pv[u]) x = min(x, graph[pv[u]][pe[u]].cap);\n f -= x;\n cost += x*h[t];\n\n if(cost>k) break;\n res++;\n for(int u=t;u!=s;u=pv[u]){\n\tedge &e = graph[pv[u]][pe[u]];\n\te.cap -= x; graph[u][e.rev].cap += x;\n }\n\n }\n\n return res;\n }\n};\n\nint main(){\n int a,b,k;\n cin >> a >> b >> k;\n\n int n = a+b+2;\n int S = a+b, T = S+1;\n minFlow mf(n);\n\n vector<vi> w(a, vi(b,0));\n\n rep(i,a){\n string x; cin >> x;\n rep(j,b){\n if(x[j] == '1') w[i][j]++;\n }\n }\n\n rep(i,b){\n string x; cin >> x;\n rep(j,a){\n if(x[j] == '1') w[j][i]++;\n }\n }\n\n rep(i,a)rep(j,b){\n mf.add(i,j+a,w[i][j],1);\n }\n\n rep(i,a) mf.add(S,i,0,1);\n rep(i,b) mf.add(i+a,T,0,1);\n\n cout << mf.maxFlow(S,T,k) << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":5328,"score_of_the_acc":-0.1861,"final_rank":9},{"submission_id":"aoj_2776_2030185","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n \n#define int long long\ntypedef pair<int,int>pint;\ntypedef vector<int>vint;\ntypedef vector<pint>vpint;\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\n \nstruct edge{\n int to,cap,cost,rev;\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n};\n \nconst int INF=1001001001;\nconst int MAX_V=500;\nint S=MAX_V-2,T=MAX_V-1;\nvector<edge>G[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\n \nvoid init(){\n rep(i,MAX_V)G[i].clear();\n}\nvoid add_edge(int from,int to,int cap,int cost){\n G[from].pb(edge(to,cap,cost,G[to].size()));\n G[to].pb(edge(from,0,-cost,G[from].size()-1));\n}\n \nint min_cost_flow(int s,int t,int f){\n int res=0;\n while(f>0){\n fill_n(dist,MAX_V,INF);\n dist[s]=0;\n bool update=true;\n while(update){\n update=false;\n rep(v,MAX_V){\n if(dist[v]==INF)continue;\n rep(i,G[v].size()){\n edge &e=G[v][i];\n if(e.cap>0&&dist[e.to]>dist[v]+e.cost){\n dist[e.to]=dist[v]+e.cost;\n prevv[e.to]=v;\n preve[e.to]=i;\n update=true;\n }\n }\n }\n }\n \n if(dist[t]==INF)return -1;\n \n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n chmin(d,G[prevv[v]][preve[v]].cap);\n }\n \n f-=d;\n res+=d*dist[t];\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 \n return res;\n}\n \nint A,B,K;\nstring a[200],b[200];\nsigned main(){\n cin>>A>>B>>K;\n rep(i,A)cin>>a[i];\n rep(i,B)cin>>b[i];\n \n int lb=0,ub=300;\n while(ub-lb>1){\n int mid=(ub+lb)/2;\n \n init();\n rep(i,A)add_edge(S,i,1,0);\n rep(i,B)add_edge(i+A,T,1,0);\n rep(i,A)rep(j,B){\n int cnt=0;\n if(a[i][j]=='1')cnt++;\n if(b[j][i]=='1')cnt++;\n add_edge(i,j+A,1,cnt);\n }\n \n int tmp=min_cost_flow(S,T,mid);\n if(tmp==-1||tmp>K)ub=mid;\n else lb=mid;\n }\n cout<<lb<<endl;\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":6496,"score_of_the_acc":-0.785,"final_rank":16},{"submission_id":"aoj_2776_1971807","code_snippet":"#include<stdio.h>\n#include<iostream>\n#include<fstream>\n#include<string>\n#include<vector>\n#include<list>\n#include<map>\n#include<math.h>\n#include<algorithm>\nusing namespace std;\n\nclass MatrixIndex :public pair<int, int>\n{\npublic:\n\tMatrixIndex(int i, int j) :pair<int, int>(i, j){\n\t}\n};\n\nclass Matrix :public vector< vector<char> >\n{\npublic:\n\tMatrix(int col, int row)\n\t{\n\t\tresize(col);\n\t\tfor (size_t i = 0; i < size(); ++i)\n\t\t{\n\t\t\tvector<char> & t = (*this)[i];\n\t\t\tt.resize(row);\n\t\t}\n\t}\n};\n\n\nclass Keys //: public string\n{\npublic:\n\tstring keys;\n\tKeys(const Keys &_key) :keys(_key.keys)\n\t{\n\n\t}\n\tKeys(Matrix & c, list<int> & is, list<int> & js)\n\t{\n\t\tlist<pair<int,int> > sorted_is;\n\t\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\n\t\t{\n\t\t\tpair<int, int> sum(0,*it);\n\t\t\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\n\t\t\t{\n\t\t\t\tsum.first += c[*it][*jt];\n\t\t\t}\n\t\t\tsorted_is.push_back(sum);\n\t\t}\n\t\tsorted_is.sort();\n\n\t\tlist<pair<int, int> > sorted_js;\n\t\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\n\t\t{\n\t\t\tpair<int, int> sum(0, *jt);\n\t\t\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\n\t\t\t{\n\t\t\t\tsum.first += c[*it][*jt];\n\t\t\t}\n\t\t\tsorted_js.push_back(sum);\n\t\t}\n\t\tsorted_js.sort();\n\n\t\tkeys.resize((sorted_js.size() + 1) * sorted_is.size());\n\t\tint i = 0;\n\t\tfor (list<pair<int, int> >::iterator it = sorted_is.begin(); it != sorted_is.end(); ++it)\n\t\t{\n\t\t\tfor (list<pair<int, int> >::iterator jt = sorted_js.begin(); jt != sorted_js.end(); ++jt)\n\t\t\t{\n\t\t\t\tkeys[i++] = c[it->second][jt->second] + '0';\n\t\t\t}\n\t\t\tkeys[i++] = '_';\n\t\t}\n\t}\n};\n\n\n\n\n\n\nvoid normalize_two(Matrix & c, list<int> & is, list<int> & js, list<MatrixIndex> & twos)\n{\n\t//???\n\tlist<int> is2;\n\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\n\t{\n\t\tint & i = *it;\n\t\tbool b_ok = js.size()>0;\n\t\tint j=-1;\n\t\tfor (list<int>::iterator jt = js.begin(); jt != js.end() && b_ok; ++jt)\n\t\t{\n\t\t\tj = *jt;\n\t\t\tb_ok = (c[i][j] == 2);\n\t\t}\n\t\tif (b_ok)\n\t\t{\n\t\t\ttwos.push_back(MatrixIndex(i, j));\n\t\t\tjs.remove(j);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tis2.push_back(i);\n\t\t}\n\t}\n\tis = is2;\n\tlist<int> js2;\n\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\n\t{\n\t\tint & j = *jt;\n\t\tint i = -1;\n\t\tbool b_ok = is.size()>0;\n\t\tfor (list<int>::iterator it = is.begin(); it != is.end() && b_ok; ++it)\n\t\t{\n\t\t\ti = *it;\n\t\t\tb_ok = (c[i][j] == 2);\n\t\t}\n\t\tif (b_ok)\n\t\t{\n\t\t\ttwos.push_back(MatrixIndex(-1,j));\n\t\t\tis.remove(i);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tjs2.push_back(j);\n\t\t}\n\t}\n\tjs = js2;\n}\n\nclass info\n{\npublic:\n\tlist<MatrixIndex> indexpair[3];\n\tint maxpairs;\n\tint K;\n\tbool complete;\n\tinfo() :K(0), complete(false), maxpairs(-1)\n\t{\n\t}\n\tinfo(int _K) :info()\n\t{\n\t\tK = _K;\n\t}\n\tinfo(list<MatrixIndex> _indexpair[3], int _K) :info(_K)\n\t{\n\t\tinit(_indexpair);\n\t}\n\tinfo(const info & _inf, const int _K) :info(_K)\n\t{\n\t\tmaxpairs = _inf.maxpairs;\n\t\tcomplete = _inf.complete;\n\t\tinit(_inf.indexpair);\n\t}\n\tvoid init(const list<MatrixIndex> _indexpair[3])\n\t{\n\t\tfor (int i = 0; i < 3; ++i)\n\t\t{\n\t\t\tindexpair[i] = _indexpair[i];\n\t\t}\n\t\tupdate();\n\t}\n\tvoid update()\n\t{\n\t\tint k = K;\n\t\tmaxpairs = int(indexpair[0].size());\n\t\tif (k > 0)\n\t\t{\n\t\t\t//1\n\t\t\tint ones = min(k, int(indexpair[1].size()));\n\t\t\tk -= ones;\n\t\t\tmaxpairs += ones;\n\t\t}\n\t\tif (k/2 > 0)\n\t\t{\n\t\t\t//2\n\t\t\tint twos = min(k/2, int(indexpair[2].size()));\n\t\t\tk -= twos*2;\n\t\t\tmaxpairs += twos;\n\t\t}\n\t\tcomplete = (maxpairs == int(indexpair[0].size() + indexpair[1].size() + indexpair[2].size()));\n\t}\n};\nmap<string, info> g_cache;\n\ninfo & travers_all(Matrix & c, list<int> & is, list<int> & js, list<MatrixIndex> indexpair[3], int K)\n{\n\tKeys key(c, is, js);\n\tmap<string, info>::iterator it_inf = g_cache.find(key.keys);\n\tif (it_inf != g_cache.end())\n\t{\n\t\treturn it_inf->second;\n\t}\n\n\tinfo inf(K);\n\tbool b_one = false;\n\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\n\t{\n\t\tint & i = *it;\n\t\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\n\t\t{\n\t\t\tint & j = *jt;\n\t\t\tif (c[i][j] == 1)\n\t\t\t{\n\t\t\t\tlist<int> is2(is);\n\t\t\t\tis2.remove(i);\n\t\t\t\tlist<int> js2(js);\n\t\t\t\tjs2.remove(j);\n\t\t\t\tindexpair[1].push_back(MatrixIndex(i, j));\n\t\t\t\tinfo _inf = travers_all(c, is2, js2, indexpair, K);\n\t\t\t\t//info current(_inf);\n\t\t\t\t//current.indexpair[1].push_back(MatrixIndex(i, j));\n\t\t\t\t_inf.indexpair[1].push_back(MatrixIndex(i, j));\n\t\t\t\t//for (int previ = 0; previ < 2; ++previ)\n\t\t\t\t//{\n\t\t\t\t//\tfor (list<MatrixIndex>::iterator prev = indexpair[previ].begin(); prev != indexpair[previ].end(); prev++)\n\t\t\t\t//\t{\n\t\t\t\t//\t\tcurrent.indexpair[previ].push_back(*prev);\n\t\t\t\t//\t}\n\t\t\t\t//}\n\t\t\t\t//current.update();\n\t\t\t\tif (b_one)\n\t\t\t\t{\n\t\t\t\t\t//update\n\t\t\t\t\tif (_inf.indexpair[1].size() > inf.indexpair[1].size())\n\t\t\t\t\t{\n\t\t\t\t\t\tinf = _inf;\n\t\t\t\t\t}\n\t\t\t\t\t//if (current.maxpairs > inf.maxpairs)\n\t\t\t\t\t//{\n\t\t\t\t\t//\tinf = _inf;\n\t\t\t\t\t//}\n\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tb_one = true;\n\t\t\t\t\tinf = _inf;\n\t\t\t\t}\n\t\t\t\tindexpair[1].pop_back();\n\t\t\t\tif (inf.complete)\n\t\t\t\t{\n\t\t\t\t//\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (inf.complete)\n\t\t{\n\t\t\t//break;\n\t\t}\n\t}\n\tif (b_one == false)\n\t{\n\t\tlist<MatrixIndex> ip[3];\n\t\t//for (int i = 0; i < 3; ++i)\n\t\t//{\n\t\t//\tip[i] = indexpair[i];\n\t\t//}\n\t\t///one ???????????£???\n\t\tnormalize_two(c, is, js, ip[2]);\n\t\tinf = info(ip, K);\n\t\t//static info sinfo;\n\t\t//sinfo = inf;\n\t\t//return sinfo;\n\t}\n\t/// all complete\n\tg_cache[key.keys] = inf;\n\treturn g_cache[key.keys];\n}\n\ninfo & travers_select_zero(Matrix & c, list<int> & is, list<int> & js, list<MatrixIndex> indexpair[3], int K)\n{\n\tKeys key(c, is, js);\n\tmap<string, info>::iterator it_inf = g_cache.find(key.keys);\n\tif (it_inf != g_cache.end())\n\t{\n\t\treturn it_inf->second;\n\t}\n\tinfo inf(K);\n\tbool b_zero = false;\n\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\n\t{\n\t\tint & i = *it;\n\t\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\n\t\t{\n\t\t\tint & j = *jt;\n\t\t\tif (c[i][j] == 0)\n\t\t\t{\n\t\t\t\tlist<int> is2(is);\n\t\t\t\tis2.remove(i);\n\t\t\t\tlist<int> js2(js);\n\t\t\t\tjs2.remove(j);\n\t\t\t\tindexpair[0].push_back(MatrixIndex(i, j));\n\t\t\t\tinfo _inf = travers_select_zero(c, is2, js2, indexpair, K);\n\t\t\t\tinfo total(_inf);\n\t\t\t\tfor (list<MatrixIndex>::iterator prev = indexpair[0].begin(); prev != indexpair[0].end(); prev++)\n\t\t\t\t{\n\t\t\t\t\ttotal.indexpair[0].push_back(*prev);\n\t\t\t\t}\n\t\t\t\ttotal.update();\n\t\t\t\t_inf.indexpair[0].push_back(MatrixIndex(i, j));\n\t\t\t\tif (b_zero)\n\t\t\t\t{\n\t\t\t\t\t//update\n\t\t\t\t\tif (total.maxpairs > inf.maxpairs)\n\t\t\t\t\t{\n\t\t\t\t\t\tinf = _inf;\n\t\t\t\t\t\tinf.maxpairs = total.maxpairs;\n\t\t\t\t\t\tinf.complete = total.complete;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tb_zero = true;\n\t\t\t\t\tinf = _inf;\n\t\t\t\t\tinf.maxpairs = total.maxpairs;\n\t\t\t\t\tinf.complete = total.complete;\n\t\t\t\t}\n\t\t\t\tindexpair[0].pop_back();\n\t\t\t}\n\t\t\tif (inf.complete)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (inf.complete)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (b_zero == false)\n\t{\n\t\t///zero ???????????£???\n\t\tinf = travers_all(c, is, js, indexpair, K);\n\t\tinf.update();\n\t}\n\t/// all complete\n\tg_cache[key.keys] = inf;\n\treturn g_cache[key.keys];\n}\n\ninfo & search_maxpair(Matrix & c, list<int> & is, list<int> & js, int K)\n{\n\tlist<MatrixIndex> indexpair[3];\n\tinfo & inf = travers_select_zero(c, is, js, indexpair, K);\n\treturn inf;\n}\nint main(){\n\n\tstd::istream & c_in = cin;\n\n\tint A, B, K;\n\tc_in >> A >> B >> K;\n\tMatrix a(A, B);\n\tfor (size_t i = 0; i < a.size(); ++i)\n\t{\n\t\tvector<char> & t = a[i];\n\t\tfor (size_t j = 0; j < t.size(); ++j)\n\t\t{\n\t\t\tc_in >> t[j];\n\t\t\tt[j] -= '0';\n\t\t}\n\t}\n\tMatrix b(B, A);\n\tfor (size_t i = 0; i < b.size(); ++i)\n\t{\n\t\tvector<char> & t = b[i];\n\t\tfor (size_t j = 0; j < t.size(); ++j)\n\t\t{\n\t\t\tc_in >> t[j];\n\t\t\tt[j] -= '0';\n\t\t}\n\t}\n\n\tMatrix c(A, B);\n\tfor (size_t i = 0; i < c.size(); ++i)\n\t{\n\t\tfor (size_t j = 0; j < c[i].size(); ++j)\n\t\t{\n\t\t\tc[i][j] = a[i][j] + b[j][i];\n\t\t}\n\t}\n\tlist<int>is;\n\tlist<int>js;\n\tfor (int i = 0; i < A; ++i)\n\t{\n\t\tis.push_back(i);\n\t}\n\tfor (int j = 0; j < B; ++j)\n\t{\n\t\tjs.push_back(j);\n\t}\n\n\n\tinfo inf = search_maxpair(c, is, js, K);\n\tcout << inf.maxpairs << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":7852,"score_of_the_acc":-0.83,"final_rank":17},{"submission_id":"aoj_2776_1935188","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\nstruct CWW{\n CWW(){\n\tios::sync_with_stdio(false);cin.tie(0);\n }\n}cww;\n\n\n\n\n\nint A,B,K;\n#define ARAI(x) (x)\n#define arai(x) (A+x)\n#define S (A+B)\n#define G (S+1)\n\nstruct edge{\n int flow,to,rev,cost;\n};\ntypedef vector<edge> E;\ntypedef vector<E> Graph;\n\nvoid addedge(Graph &g,int from,int to,int f,int cost){\n int n=g[from].size();\n int m=g[to].size();\n g[from].push_back(edge{f,to,m,cost});\n g[to].push_back(edge{0,from,n,-cost});\n}\n\nnamespace _ssc{\n #define SZ 500\n int h[SZ];\n int d[SZ];\n int pV[SZ];\n int pE[SZ];\n};\nstruct ssc{\n int *h,*d,*pV,*pE;\n ssc(int V):h(_ssc::h),d(_ssc::d),pV(_ssc::pV),pE(_ssc::pE){\n\tfill(h,h+V,0);\n }\t \n};\nconst int INF=114514;\nint min_cost_flow(int s,int t,int f,Graph &g,ssc& info){\n using P=tuple<int,int>;\n\n const int V=g.size();\n int res=0;\n while(f>0){\n\tpriority_queue<P> que;\n\tfill(info.d,info.d+V,INF);\n\tinfo.d[s]=0;\n\tque.push(P(0,s));\n\twhile(que.size()){\n\t auto p=que.top();que.pop();\n\t int cost,v;tie(cost,v)=p;cost=-cost;\n\t if(info.d[v]<cost)continue;\n\t for(int i=0,sz=g[v].size();i<sz;i++){\n\t\tauto &e=g[v][i];\n\t\tif(e.flow>0&&info.d[e.to]>info.d[v]+e.cost+info.h[v]-info.h[e.to]){\n\t\t info.d[e.to]=info.d[v]+e.cost+info.h[v]-info.h[e.to];\n\t\t info.pV[e.to]=v;\n\t\t info.pE[e.to]=i;\n\t\t que.push(P(-info.d[e.to],e.to));\n\t\t}\n\t }\n\t}\n\tif(info.d[t]==INF)return -1;\n\t\n\tfor(int v=0;v<V;v++)info.h[v]+=info.d[v];\n\tint d=f;\n\tfor(int v=t;v!=s;v=info.pV[v])\n\t d=min(d,g[info.pV[v]][info.pE[v]].flow);\n\tf-=d;\n\tres+=d*info.h[t];\n\tfor(int v=t;v!=s;v=info.pV[v]){\n\t auto &e=g[info.pV[v]][info.pE[v]];\n\t e.flow-=d;\n\t g[v][e.rev].flow+=d;\n\t}\n }\n return res;\n}\nint main(){\n cin>>A>>B>>K;\n int V=A+B+2;\n Graph g(V);\n ssc info(V);\n for(int i=0;i<A;i++)addedge(g,S,ARAI(i),1,0);\n for(int i=0;i<B;i++)addedge(g,arai(i),G,1,0);\n vector<vector<int>> R(A,vector<int>(B,0));\n for(int i=0;i<A;i++){\n\tstring s;\n\tcin>>s;\n\tfor(int j=0;j<B;j++)if(s[j]=='1')R[i][j]++;\t\t\t \n }\n for(int i=0;i<B;i++){\n\tstring s;\n\tcin>>s;\n\tfor(int j=0;j<A;j++)if(s[j]=='1')R[j][i]++;\t\t\t \n }\n for(int i=0;i<A;i++)\n\tfor(int j=0;j<B;j++)\n\t addedge(g,ARAI(i),arai(j),1,R[i][j]);\n int res=0,cost,allcost=0;\n while((cost=min_cost_flow(S,G,1,g,info))!=-1){\n\tallcost+=cost;\n\tif(allcost<=K)res++;\n\telse break;\n }\n cout<<res<<endl;\n}","accuracy":1,"time_ms":40,"memory_kb":4808,"score_of_the_acc":-0.0504,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2776_10851385\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing LL = long long; using ll = LL;\\nusing PII = pair<int, int>; using pii = PII;\\nusing PLL = pair<LL, LL>; using pll = PLL;\\nusing VI = vector<int>; using VL = vector<LL>;\\nconst ll LINF = 1e18;\\nconst int INF = 1e9;\\n#define FOR(i,s,t) for(int i =s; i < t;i++)\\n#define SZ(a) (int)a.size()\\n#define ALL(a) a.begin(),a.end()\\n\\nstruct Primal_Dual {\\n\\tstruct edge {\\n\\t\\tint to, rev;\\n\\t\\tll cap, cost;\\n\\t\\tedge() {}\\n\\t\\tedge(int to, ll cap, ll cost, int rev) :to(to), cap(cap), cost(cost), rev(rev) {}\\n\\t};\\n\\tvector<vector<edge>> graph;\\n\\tvector<int> prevv, preve;\\n\\tvector<ll> potential, min_cost;\\n\\tPrimal_Dual(int V) :graph(V) {}\\n\\n\\tvoid add_edge(int from, int to, ll cap, ll cost) {\\n\\t\\tgraph[from].emplace_back(to, cap, cost, graph[to].size());\\n\\t\\tgraph[to].emplace_back(from, 0, -cost, graph[from].size() - 1);\\n\\t}\\n\\n\\tll min_cost_flow(int s, int t, int f) {\\n\\t\\tint V = graph.size();\\n\\t\\tll ret = 0;\\n\\t\\tpriority_queue<pll, vector<pll>, greater<pll>> que;\\n\\t\\tpotential.assign(V, 0);\\n\\t\\tpreve.assign(V, -1);\\n\\t\\tprevv.assign(V, -1);\\n\\n\\t\\twhile (f > 0) {\\n\\t\\t\\tmin_cost.assign(V, LINF);\\n\\t\\t\\tque.push({ 0,s });\\n\\t\\t\\tmin_cost[s] = 0;\\n\\n\\t\\t\\twhile (que.size()) {\\n\\t\\t\\t\\tpll p = que.top();\\n\\t\\t\\t\\tque.pop();\\n\\t\\t\\t\\tif (min_cost[p.second] < p.first) continue;\\n\\t\\t\\t\\tfor (int i = 0; i < graph[p.second].size(); i++) {\\n\\t\\t\\t\\t\\tedge& e = graph[p.second][i];\\n\\t\\t\\t\\t\\tll nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];\\n\\t\\t\\t\\t\\tif (e.cap > 0 && min_cost[e.to] > nextCost) {\\n\\t\\t\\t\\t\\t\\tmin_cost[e.to] = nextCost;\\n\\t\\t\\t\\t\\t\\tprevv[e.to] = p.second; preve[e.to] = i;\\n\\t\\t\\t\\t\\t\\tque.push(pll(min_cost[e.to], e.to));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (min_cost[t] == LINF) return -1;\\n\\t\\t\\tfor (int v = 0; v < V; v++) potential[v] += min_cost[v];\\n\\t\\t\\tll add = f;\\n\\t\\t\\tfor (int v = t; v != s; v = prevv[v]) {\\n\\t\\t\\t\\tadd = min(add, graph[prevv[v]][preve[v]].cap);\\n\\t\\t\\t}\\n\\t\\t\\tf -= add;\\n\\t\\t\\tret += add * potential[t];\\n\\t\\t\\tfor (int v = t; v != s; v = prevv[v]) {\\n\\t\\t\\t\\tedge& e = graph[prevv[v]][preve[v]];\\n\\t\\t\\t\\te.cap -= add;\\n\\t\\t\\t\\tgraph[v][e.rev].cap += add;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n};\\n\\nvoid solve() {\\n\\tll A, B, K; cin >> A >> B >> K;\\n\\tvector<string> a(A), b(B);\\n\\tfor (auto& in : a) cin >> in;\\n\\tfor (auto& in : b) cin >> in;\\n\\n\\tll S = A + B, T = A + B + 1;\\n\\tPrimal_Dual clojure(A + B + 2);\\n\\tfor (int i = 0; i < A; i++) clojure.add_edge(S, i, 1, 0);\\n\\tfor (int i = 0; i < B; i++) clojure.add_edge(A+i, T, 1, 0);\\n\\n\\tfor (int i = 0; i < A; i++) {\\n\\t\\tfor (int j = 0; j < B; j++) {\\n\\t\\t\\tll cost = 0;\\n\\t\\t\\tif (a[i][j] == '1') cost++;\\n\\t\\t\\tif (b[j][i] == '1') cost++;\\n\\t\\t\\t\\n\\t\\t\\tclojure.add_edge(i, A + j, 1, cost);\\n\\t\\t}\\n\\t}\\n\\n\\tll ans = 0;\\n\\twhile (true) {\\n\\t\\tll ret = clojure.min_cost_flow(S, T, 1);\\n//\\t\\tcout << ret << endl;\\n\\t\\tif (ret == -1) break;\\n\\t\\tif (ret > K) break;\\n\\t\\tK -= ret;\\n\\t\\tans++;\\n\\t}\\n\\tcout << ans << endl;\\n}\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(false);\\n\\n\\tsolve();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5720,\n \"score_of_the_acc\": -0.2737,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2776_6941874\",\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=2167167167167167167;\\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\\\";}\\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\n\\nnamespace atcoder {\\nnamespace internal {\\n\\ntemplate <class E> struct csr {\\n std::vector<int> start;\\n std::vector<E> elist;\\n explicit 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} // namespace internal\\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\\n\\ntemplate <class Cap, class Cost> struct mcf_graph {\\n public:\\n mcf_graph() {}\\n explicit mcf_graph(int n) : _n(n) {}\\n\\n int add_edge(int from, int to, Cap cap, Cost cost) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n assert(0 <= cost);\\n int m = int(_edges.size());\\n _edges.push_back({from, to, cap, 0, cost});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n Cost cost;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(_edges.size());\\n assert(0 <= i && i < m);\\n return _edges[i];\\n }\\n std::vector<edge> edges() { return _edges; }\\n\\n std::pair<Cap, Cost> flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\\n return slope(s, t, flow_limit).back();\\n }\\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\\n return slope(s, t, std::numeric_limits<Cap>::max());\\n }\\n std::vector<std::pair<Cap, Cost>> slope(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 int m = int(_edges.size());\\n std::vector<int> edge_idx(m);\\n\\n auto g = [&]() {\\n std::vector<int> degree(_n), redge_idx(m);\\n std::vector<std::pair<int, _edge>> elist;\\n elist.reserve(2 * m);\\n for (int i = 0; i < m; i++) {\\n auto e = _edges[i];\\n edge_idx[i] = degree[e.from]++;\\n redge_idx[i] = degree[e.to]++;\\n elist.push_back({e.from, {e.to, -1, e.cap - e.flow, e.cost}});\\n elist.push_back({e.to, {e.from, -1, e.flow, -e.cost}});\\n }\\n auto _g = internal::csr<_edge>(_n, elist);\\n for (int i = 0; i < m; i++) {\\n auto e = _edges[i];\\n edge_idx[i] += _g.start[e.from];\\n redge_idx[i] += _g.start[e.to];\\n _g.elist[edge_idx[i]].rev = redge_idx[i];\\n _g.elist[redge_idx[i]].rev = edge_idx[i];\\n }\\n return _g;\\n }();\\n\\n auto result = slope(g, s, t, flow_limit);\\n\\n for (int i = 0; i < m; i++) {\\n auto e = g.elist[edge_idx[i]];\\n _edges[i].flow = _edges[i].cap - e.cap;\\n }\\n\\n return result;\\n }\\n\\tstd::vector<Cost> slope_all(int s, int t,Cap flow_limit) {\\n std::vector<std::pair<Cap, Cost>> tmp=slope(s, t, flow_limit);\\n\\t\\tstd::vector<Cost> ans((*tmp.rbegin()).first+1);\\n\\t\\tans[0]=0;\\n\\t\\tfor(int i=0;i<(int)(tmp.size())-1;i++){\\n\\t\\t\\tCost diff=(tmp[i+1].second-tmp[i].second)/(tmp[i+1].first-tmp[i].first);\\n\\t\\t\\tfor(int j=1+tmp[i].first;j<=tmp[i+1].first;j++){\\n\\t\\t\\t\\tans[j]=ans[j-1]+diff;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ans;\\n }\\n\\tstd::vector<Cost> slope_all(int s, int t){\\n\\t\\treturn slope_all(s,t,std::numeric_limits<Cap>::max());\\n }\\n\\n private:\\n int _n;\\n std::vector<edge> _edges;\\n\\n // inside edge\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n };\\n\\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\\n int s,\\n int t,\\n Cap flow_limit) {\\n // variants (C = maxcost):\\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\\n\\n // dual_dist[i] = (dual[i], dist[i])\\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\\n std::vector<int> prev_e(_n);\\n std::vector<bool> vis(_n);\\n struct Q {\\n Cost key;\\n int to;\\n bool operator<(Q r) const { return key > r.key; }\\n };\\n std::vector<int> que_min;\\n std::vector<Q> que;\\n auto dual_ref = [&]() {\\n for (int i = 0; i < _n; i++) {\\n dual_dist[i].second = std::numeric_limits<Cost>::max();\\n }\\n std::fill(vis.begin(), vis.end(), false);\\n que_min.clear();\\n que.clear();\\n\\n // que[0..heap_r) was heapified\\n size_t heap_r = 0;\\n\\n dual_dist[s].second = 0;\\n que_min.push_back(s);\\n while (!que_min.empty() || !que.empty()) {\\n int v;\\n if (!que_min.empty()) {\\n v = que_min.back();\\n que_min.pop_back();\\n } else {\\n while (heap_r < que.size()) {\\n heap_r++;\\n std::push_heap(que.begin(), que.begin() + heap_r);\\n }\\n v = que.front().to;\\n std::pop_heap(que.begin(), que.end());\\n que.pop_back();\\n heap_r--;\\n }\\n if (vis[v]) continue;\\n vis[v] = true;\\n if (v == t) break;\\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\\n // dist[v] >= 0 (all reduced cost are positive)\\n // dist[v] <= (n-1)C\\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\\n auto e = g.elist[i];\\n if (!e.cap) continue;\\n // |-dual[e.to] + dual[v]| <= (n-1)C\\n // cost <= C - -(n-1)C + 0 = nC\\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\\n if (dual_dist[e.to].second - dist_v > cost) {\\n Cost dist_to = dist_v + cost;\\n dual_dist[e.to].second = dist_to;\\n prev_e[e.to] = e.rev;\\n if (dist_to == dist_v) {\\n que_min.push_back(e.to);\\n } else {\\n que.push_back(Q{dist_to, e.to});\\n }\\n }\\n }\\n }\\n if (!vis[t]) {\\n return false;\\n }\\n\\n for (int v = 0; v < _n; v++) {\\n if (!vis[v]) continue;\\n // dual[v] = dual[v] - dist[t] + dist[v]\\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\\n // shortest(s, t) >= 0 - (n-1)C\\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\\n }\\n return true;\\n };\\n Cap flow = 0;\\n Cost cost = 0, prev_cost_per_flow = -1;\\n std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};\\n while (flow < flow_limit) {\\n if (!dual_ref()) break;\\n Cap c = flow_limit - flow;\\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\\n }\\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\\n auto& e = g.elist[prev_e[v]];\\n e.cap += c;\\n g.elist[e.rev].cap -= c;\\n }\\n Cost d = -dual_dist[s].first;\\n flow += c;\\n cost += c * d;\\n if (prev_cost_per_flow == d) {\\n result.pop_back();\\n }\\n result.push_back({flow, cost});\\n prev_cost_per_flow = d;\\n }\\n return result;\\n }\\n};\\n\\n\\n} // namespace atcoder\\nusing namespace atcoder;\\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 A,B,K;\\n\\tcin>>A>>B>>K;\\n\\tmcf_graph<int,int> G(A+B+2);\\n\\tint S=A+B,T=S+1;\\n\\trep(i,A) G.add_edge(S,i,1,0);\\n\\trep(i,B) G.add_edge(i+A,T,1,0);\\n\\tvector<vector<int>> p(A,vector<int>(B));\\n\\trep(i,A) rep(j,B){\\n\\t\\tchar c;\\n\\t\\tcin>>c;\\n\\t\\tp[i][j]+=(int)(c-'0');\\n\\t}\\n\\trep(j,B) rep(i,A){\\n\\t\\tchar c;\\n\\t\\tcin>>c;\\n\\t\\tp[i][j]+=(int)(c-'0');\\n\\t}\\n\\trep(i,A) rep(j,B) G.add_edge(i,j+A,1,p[i][j]);\\n\\tauto ans=G.slope_all(S,T);\\n\\tans.push_back(INF);\\n\\tint a=UB(ans,K);\\n\\tcout<<a-1<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7344,\n \"score_of_the_acc\": -0.6681,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2776_5533033\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#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}\\n\\nstruct Primal_Dual{\\n const int INF=(1<<30);\\n struct edge{\\n int to,cap,cost,rev;\\n };\\n vector<vector<edge>> G;\\n vector<int> potential,min_cost,prevv,preve;\\n Primal_Dual(int V):G(V){}\\n void add_edge(int s,int t,int cap,int cost){\\n G[s].push_back((edge){t,cap,cost,(int)(G[t].size())});\\n G[t].push_back((edge){s,0,-cost,(int)(G[s].size()-1)});\\n }\\n int min_cost_flow(int s,int t,int f){\\n int V=G.size(); int res=0;\\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;\\n potential.assign(V,0);\\n preve.assign(V,-1);\\n prevv.assign(V,-1);\\n while(f>0){\\n min_cost.assign(V,INF);\\n pq.push(make_pair(0,s));\\n min_cost[s]=0;\\n while(pq.size()){\\n auto p=pq.top(); pq.pop();\\n if(min_cost[p.second]<p.first)continue;\\n int i=-1;\\n for(auto &e:G[p.second]){\\n i++;\\n int nextcost=min_cost[p.second]+e.cost+potential[p.second]-potential[e.to];\\n if(e.cap>0 and min_cost[e.to]>nextcost){\\n min_cost[e.to]=nextcost;\\n prevv[e.to]=p.second;\\n preve[e.to]=i;\\n pq.push(make_pair(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++){\\n potential[v]+=min_cost[v];\\n }\\n int Addflow=f;\\n for(int v=t;v!=s;v=prevv[v]){\\n Addflow=min(Addflow,G[prevv[v]][preve[v]].cap);\\n }\\n f-=Addflow;\\n res+=Addflow*potential[t];\\n for(int v=t;v!=s;v=prevv[v]){\\n edge &e=G[prevv[v]][preve[v]];\\n e.cap-=Addflow;\\n G[v][e.rev].cap+=Addflow;\\n }\\n }\\n return res;\\n }\\n};\\n\\nchar a[211][211],b[211][211];\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int A,B,K; cin >> A >> B >> K;\\n Primal_Dual G(A+B+2);\\n int S=A+B,T=A+B+1;\\n for(int i=0;i<A;i++){\\n G.add_edge(S,i,1,0);\\n }\\n for(int i=0;i<B;i++){\\n G.add_edge(A+i,T,1,0);\\n }\\n for(int i=0;i<A;i++){\\n for(int j=0;j<B;j++){\\n cin >> a[i][j];\\n }\\n }\\n for(int i=0;i<B;i++){\\n for(int j=0;j<A;j++){\\n cin >> b[i][j];\\n }\\n }\\n for(int i=0;i<A;i++){\\n for(int j=0;j<B;j++){\\n G.add_edge(i,A+j,1,(a[i][j]-'0')+(b[j][i]-'0'));\\n }\\n }\\n int res=0;\\n int sum=0;\\n for(int i=1;i<=min(A,B);i++){\\n int flow=G.min_cost_flow(S,T,1);\\n if(flow==-1)break;\\n sum+=flow;\\n if(sum<=K )res=i;\\n else break;\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4960,\n \"score_of_the_acc\": -0.0606,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2776_5532983\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <class T>\\nstruct Primal_Dual {\\n using Pa = pair<T, int>;\\n int infinity = (int)(1e9);\\n struct edge {\\n int to;\\n T cap, cost;\\n int rev;\\n };\\n int v;\\n vector<vector<edge>> edges;\\n vector<T> h;\\n vector<T> dist;\\n vector<int> prevv, preve;\\n Primal_Dual(int vsize = 1) {\\n v = vsize;\\n edges.resize(v);\\n h.resize(v);\\n dist.resize(v);\\n prevv.resize(v);\\n preve.resize(v);\\n }\\n bool add(int from, int to, T cap, T cost) {\\n edges[from].push_back((edge){to, cap, cost, (int)edges[to].size()});\\n edges[to].push_back((edge){from, 0, -cost, (int)edges[from].size() - 1});\\n return 1;\\n }\\n T solve(int s, int t, T f) {\\n T ans = 0;\\n h.assign(v, 0);\\n while (f > 0) {\\n priority_queue<Pa, vector<Pa>, greater<Pa>> qu;\\n dist.assign(v, infinity);\\n dist[s] = 0;\\n qu.push({0, s});\\n while (!qu.empty()) {\\n Pa now = qu.top();\\n qu.pop();\\n int nowv = now.second;\\n if (dist[nowv] < now.first) continue;\\n for (int i = 0; i < (int)edges[nowv].size(); ++i) {\\n edge &e = edges[nowv][i];\\n if (e.cap > 0 &&\\n dist[e.to] > dist[nowv] + e.cost + h[nowv] - h[e.to]) {\\n dist[e.to] = dist[nowv] + e.cost + h[nowv] - h[e.to];\\n prevv[e.to] = nowv;\\n preve[e.to] = i;\\n qu.push({dist[e.to], e.to});\\n }\\n }\\n }\\n if (dist[t] == infinity) return -1;\\n for (int i = 0; i < v; ++i) h[i] += dist[i];\\n T d = f;\\n for (int i = t; i != s; i = prevv[i])\\n d = min(d, edges[prevv[i]][preve[i]].cap);\\n f -= d;\\n ans += d * h[t];\\n for (int i = t; i != s; i = prevv[i]) {\\n edge &e = edges[prevv[i]][preve[i]];\\n e.cap -= d;\\n edges[i][e.rev].cap += d;\\n }\\n }\\n return ans;\\n }\\n};\\n\\nint a, b, k;\\nvector<vector<int>> cnt;\\n\\nint main() {\\n cin >> a >> b >> k;\\n cnt.assign(a, vector<int>(b, 0));\\n for (int i = 0; i < a; ++i) {\\n string s;\\n cin >> s;\\n for (int j = 0; j < b; ++j) cnt[i][j] += s[j] - '0';\\n }\\n for (int i = 0; i < b; ++i) {\\n string s;\\n cin >> s;\\n for (int j = 0; j < a; ++j) cnt[j][i] += s[j] - '0';\\n }\\n Primal_Dual<int> pd(a + b + 2);\\n for (int i = 0; i < a; ++i) pd.add(a + b, i, 1, 0);\\n for (int i = 0; i < b; ++i) pd.add(i + a, a + b + 1, 1, 0);\\n for (int i = 0; i < a; ++i)\\n for (int j = 0; j < b; ++j) pd.add(i, j + a, 1, cnt[i][j]);\\n int res = 0;\\n while (res < min(a, b)) {\\n k -= pd.solve(a + b, a + b + 1, 1);\\n if (k < 0) break;\\n ++res;\\n }\\n cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5324,\n \"score_of_the_acc\": -0.1556,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2776_5532538\",\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;\\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(15);}} __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\\\";}\\nstruct PrimalDual{\\n const ll INF=(1ll<<60);\\n struct edge{\\n int to,rev;ll cap,cost;bool isrev;\\n edge(int to,ll cap,ll cost,int rev,bool isrev):to(to),cap(cap),cost(cost),rev(rev),isrev(isrev){}\\n };\\n vector<vector<edge>> graph;\\n vector<ll> potential,min_cost;\\n vector<int> prev_v,prev_e;\\n\\n PrimalDual(int V):graph(V){}\\n\\n void add_edge(int from,int to,ll cap, ll cost){\\n graph[from].emplace_back(to,cap,cost,int(graph[to].size()),false);\\n graph[to].emplace_back(from,0,-cost,int(graph[from].size())-1,true);\\n }\\n\\n ll min_cost_flow(int s,int t,ll f){\\n int N=graph.size();\\n ll res=0;\\n priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;\\n potential.assign(N,0);\\n prev_e.assign(N,-1);\\n prev_v.assign(N,-1);\\n\\n while(f>0){\\n min_cost.assign(N,INF);\\n pq.emplace(0,s);\\n min_cost[s]=0;\\n while(pq.size()){\\n ll cost=pq.top().fi,cur=pq.top().se;\\n pq.pop();\\n if(min_cost[cur]<cost)continue;\\n for(int i=0;i<graph[cur].size();i++){\\n edge &e=graph[cur][i];\\n ll next_cost=min_cost[cur]+e.cost+potential[cur]-potential[e.to];\\n if(e.cap>0&&min_cost[e.to]>next_cost){\\n min_cost[e.to]=next_cost;\\n prev_v[e.to]=cur;\\n prev_e[e.to]=i;\\n pq.emplace(min_cost[e.to],e.to);\\n }\\n }\\n }\\n if(min_cost[t]>=INF)return -1;\\n for(int v=0;v<N;v++)potential[v]+=min_cost[v];\\n ll add_flow=f;\\n for(int v=t;v!=s;v=prev_v[v]){\\n chmin(add_flow,graph[prev_v[v]][prev_e[v]].cap);\\n }\\n f-=add_flow;\\n res+=add_flow*potential[t];\\n for(int v=t;v!=s;v=prev_v[v]){\\n edge &e=graph[prev_v[v]][prev_e[v]];\\n e.cap-=add_flow;\\n graph[v][e.rev].cap+=add_flow;\\n }\\n }\\n return res;\\n }\\n};\\nint main(){\\n ll A,B,k;\\n cin>>A>>B>>k;\\n V<string> a(A),b(B);\\n for(int i=0;i<A;i++)cin>>a[i];\\n for(int i=0;i<B;i++)cin>>b[i];\\n V<V<bool>> ngA(205,V<bool>(205,false)),ngB(205,V<bool>(205,false));;\\n for(int i=0;i<A;i++){\\n for(int j=0;j<B;j++){\\n if(a[i][j]=='1'){\\n ngA[i][j]=true;\\n }\\n }\\n }\\n for(int i=0;i<B;i++){\\n for(int j=0;j<A;j++){\\n if(b[i][j]=='1'){\\n ngB[i][j]=true;\\n } \\n }\\n }\\n ll l=0,r=min(A,B)+1;\\n int ma=A+B+5;\\n while(r-l>1){\\n ll mid=(l+r)/2;\\n \\n PrimalDual f(ma);\\n int S=A+B+1,T=A+B+2;\\n for(int i=0;i<A;i++){\\n f.add_edge(S,i,1,0);\\n }\\n for(int i=0;i<B;i++){\\n f.add_edge(i+A,T,1,0);\\n }\\n for(int i=0;i<A;i++){\\n for(int j=0;j<B;j++){\\n int cost=0;\\n if(ngA[i][j])cost++;\\n if(ngB[j][i])cost++;\\n f.add_edge(i,j+A,1,cost);\\n }\\n }\\n ll v=f.min_cost_flow(S,T,mid);\\n // cout<<v<<\\\" \\\"<<mid<<\\\"\\\\n\\\";\\n if(v==-1)v=inf;\\n if(v>k)r=mid;\\n else l=mid;\\n }\\n cout<<l<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 6692,\n \"score_of_the_acc\": -0.7479,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2776_5532528\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n//#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\nusing namespace std;\\n//#include<boost/multiprecision/cpp_int.hpp>\\n//#include<boost/multiprecision/cpp_dec_float.hpp>\\n//namespace mp=boost::multiprecision;\\n//#define mulint mp::cpp_int\\n//#define mulfloat mp::cpp_dec_float_100\\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\\n#define INF (1<<30)\\n#define LINF (lint)(1LL<<56)\\n#define endl \\\"\\\\n\\\"\\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\\n#define flc(x) __builtin_popcountll(x)\\n#define pint pair<int,int>\\n#define pdouble pair<double,double>\\n#define plint pair<lint,lint>\\n#define fi first\\n#define se second\\n#define all(x) x.begin(),x.end()\\n#define vec vector<lint>\\n#define nep(x) next_permutation(all(x))\\ntypedef long long lint;\\nint dx[8]={1,1,0,-1,-1,-1,0,1};\\nint dy[8]={0,1,1,1,0,-1,-1,-1};\\nconst int MAX_N=3e5+5;\\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//vector<int> bucket[MAX_N/1000];\\nconstexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n/*#include<atcoder/all>\\nusing namespace atcoder;\\ntypedef __int128_t llint;*/\\n\\nnamespace atcoder {\\nnamespace internal {\\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} // namespace internal\\n}\\n\\nnamespace atcoder {\\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(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 struct edge {\\n int from, to;\\n Cap cap, flow;\\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 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 std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\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 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 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 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\\nnamespace atcoder {\\ntemplate <class Cap, class Cost> struct mcf_graph {\\n public:\\n mcf_graph() {}\\n mcf_graph(int n) : _n(n), g(n) {}\\n int add_edge(int from, int to, Cap cap, Cost cost) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\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, cost});\\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0, -cost});\\n return m;\\n }\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n Cost cost;\\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{\\n pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,\\n };\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result(m);\\n for (int i = 0; i < m; i++) {\\n result[i] = get_edge(i);\\n }\\n return result;\\n }\\n std::pair<Cap, Cost> flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\\n return slope(s, t, flow_limit).back();\\n }\\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\\n return slope(s, t, std::numeric_limits<Cap>::max());\\n }\\n std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n // variants (C = maxcost):\\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\\n std::vector<Cost> dual(_n, 0), dist(_n);\\n std::vector<int> pv(_n), pe(_n);\\n std::vector<bool> vis(_n);\\n auto dual_ref = [&]() {\\n std::fill(dist.begin(), dist.end(),\\n std::numeric_limits<Cost>::max());\\n std::fill(pv.begin(), pv.end(), -1);\\n std::fill(pe.begin(), pe.end(), -1);\\n std::fill(vis.begin(), vis.end(), false);\\n struct Q {\\n Cost key;\\n int to;\\n bool operator<(Q r) const { return key > r.key; }\\n };\\n std::priority_queue<Q> que;\\n dist[s] = 0;\\n que.push(Q{0, s});\\n while (!que.empty()) {\\n int v = que.top().to;\\n que.pop();\\n if (vis[v]) continue;\\n vis[v] = true;\\n if (v == t) break;\\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\\n // dist[v] >= 0 (all reduced cost are positive)\\n // dist[v] <= (n-1)C\\n for (int i = 0; i < int(g[v].size()); i++) {\\n auto e = g[v][i];\\n if (vis[e.to] || !e.cap) continue;\\n // |-dual[e.to] + dual[v]| <= (n-1)C\\n // cost <= C - -(n-1)C + 0 = nC\\n Cost cost = e.cost - dual[e.to] + dual[v];\\n if (dist[e.to] - dist[v] > cost) {\\n dist[e.to] = dist[v] + cost;\\n pv[e.to] = v;\\n pe[e.to] = i;\\n que.push(Q{dist[e.to], e.to});\\n }\\n }\\n }\\n if (!vis[t]) {\\n return false;\\n }\\n for (int v = 0; v < _n; v++) {\\n if (!vis[v]) continue;\\n // dual[v] = dual[v] - dist[t] + dist[v]\\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) + (shortest(s, v) + dual[s] - dual[v])\\n // = - shortest(s, t) + dual[t] + shortest(s, v)\\n // = shortest(s, v) - shortest(s, t) >= 0 - (n-1)C\\n dual[v] -= dist[t] - dist[v];\\n }\\n return true;\\n };\\n Cap flow = 0;\\n Cost cost = 0, prev_cost = -1;\\n std::vector<std::pair<Cap, Cost>> result;\\n result.push_back({flow, cost});\\n while (flow < flow_limit) {\\n if (!dual_ref()) break;\\n Cap c = flow_limit - flow;\\n for (int v = t; v != s; v = pv[v]) {\\n c = std::min(c, g[pv[v]][pe[v]].cap);\\n }\\n for (int v = t; v != s; v = pv[v]) {\\n auto& e = g[pv[v]][pe[v]];\\n e.cap -= c;\\n g[v][e.rev].cap += c;\\n }\\n Cost d = -dual[s];\\n flow += c;\\n cost += c * d;\\n if (prev_cost == d) {\\n result.pop_back();\\n }\\n result.push_back({flow, cost});\\n prev_cost = cost;\\n }\\n return result;\\n }\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n}\\n\\nusing namespace atcoder;\\n\\nint main(void){\\n int A,B,K;\\n cin >> A >> B >> K;\\n mf_graph<int> G(A+B+2);\\n rep(i,A) G.add_edge(A+B,i,1);\\n rep(i,B) G.add_edge(A+i,A+B+1,1);\\n string a[A],b[B];\\n rep(i,A) cin >> a[i];\\n rep(i,B) cin >> b[i];\\n lint needs[A][B];\\n /*rep(i,A) rep(j,B){\\n if(a[i][j]=='0' && b[j][i]=='0') G.add_edge(i,A+j,1);\\n else G.add_edge(i,A+j,0);\\n }*/\\n /*int ans=G.flow(A+B,A+B+1);\\n vector<mf_graph<int>::edge> es=G.edges();\\n int needs[A][B];\\n bool used[A+B]={};\\n rep(i,es.size()){\\n if(es[i].from==A+B || es[i].to==A+B+1) continue;\\n if(es[i].flow==1){\\n int from=es[i].from,to=es[i].to;\\n used[from]=true;\\n used[to]=true;\\n }\\n }*/\\n rep(i,A) rep(j,B) needs[i][j]=INF;\\n /*rep(i,es.size()){\\n if(es[i].from==A+B || es[i].to==A+B+1) continue;\\n if(es[i].flow==0){\\n int from=es[i].from,to=es[i].to-A;\\n int cost=2;\\n if(a[from][to]=='0') cost--;\\n if(b[to][from]=='0') cost--;\\n needs[from][to]=cost;\\n if(used[from] || used[to]) needs[from][to]=INF;\\n }\\n }*/\\n rep(i,A) rep(j,B){\\n int cost=2;\\n if(a[i][j]=='0') cost--;\\n if(b[j][i]=='0') cost--;\\n needs[i][j]=cost;\\n }\\n mcf_graph<lint,lint> G2(A+B+2);\\n rep(i,A){\\n G2.add_edge(A+B,i,1,0);\\n }\\n rep(i,B){\\n G2.add_edge(A+i,A+B+1,1,0);\\n }\\n rep(i,A) rep(j,B){\\n int from=i,to=A+j;\\n G2.add_edge(from,to,1,needs[i][j]);\\n }\\n int lo=0,hi=300;\\n while(hi-lo>1){\\n int mid=(hi+lo)/2;\\n mcf_graph<lint,lint> G3=G2;\\n plint res=G3.flow(A+B,A+B+1,mid);\\n if(res.se<=K && res.fi==mid) lo=mid;\\n else hi=mid;\\n }\\n cout << lo << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 8616,\n \"score_of_the_acc\": -1.0441,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2776_5532477\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#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}\\n\\nstruct Primal_Dual{\\n const int INF=(1<<30);\\n struct edge{\\n int to,cap,cost,rev;\\n };\\n vector<vector<edge>> G;\\n vector<int> potential,min_cost,prevv,preve;\\n Primal_Dual(int V):G(V){}\\n void add_edge(int s,int t,int cap,int cost){\\n G[s].push_back((edge){t,cap,cost,(int)(G[t].size())});\\n G[t].push_back((edge){s,0,-cost,(int)(G[s].size()-1)});\\n }\\n int min_cost_flow(int s,int t,int f){\\n int V=G.size(); int res=0;\\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;\\n potential.assign(V,0);\\n preve.assign(V,-1);\\n prevv.assign(V,-1);\\n while(f>0){\\n min_cost.assign(V,INF);\\n pq.push(make_pair(0,s));\\n min_cost[s]=0;\\n while(pq.size()){\\n auto p=pq.top(); pq.pop();\\n if(min_cost[p.second]<p.first)continue;\\n int i=-1;\\n for(auto &e:G[p.second]){\\n i++;\\n int nextcost=min_cost[p.second]+e.cost+potential[p.second]-potential[e.to];\\n if(e.cap>0 and min_cost[e.to]>nextcost){\\n min_cost[e.to]=nextcost;\\n prevv[e.to]=p.second;\\n preve[e.to]=i;\\n pq.push(make_pair(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++){\\n potential[v]+=min_cost[v];\\n }\\n int Addflow=f;\\n for(int v=t;v!=s;v=prevv[v]){\\n Addflow=min(Addflow,G[prevv[v]][preve[v]].cap);\\n }\\n f-=Addflow;\\n res+=Addflow*potential[t];\\n for(int v=t;v!=s;v=prevv[v]){\\n edge &e=G[prevv[v]][preve[v]];\\n e.cap-=Addflow;\\n G[v][e.rev].cap+=Addflow;\\n }\\n }\\n return res;\\n }\\n};\\n\\nchar a[211][211],b[211][211];\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int A,B,K; cin >> A >> B >> K;\\n Primal_Dual G(A+B+2);\\n int S=A+B,T=A+B+1;\\n for(int i=0;i<A;i++){\\n G.add_edge(S,i,1,0);\\n }\\n for(int i=0;i<B;i++){\\n G.add_edge(A+i,T,1,0);\\n }\\n for(int i=0;i<A;i++){\\n for(int j=0;j<B;j++){\\n cin >> a[i][j];\\n }\\n }\\n for(int i=0;i<B;i++){\\n for(int j=0;j<A;j++){\\n cin >> b[i][j];\\n }\\n }\\n for(int i=0;i<A;i++){\\n for(int j=0;j<B;j++){\\n G.add_edge(i,A+j,1,(a[i][j]-'0')+(b[j][i]-'0'));\\n }\\n }\\n int res=0;\\n int sum=0;\\n for(int i=1;i<=min(A,B);i++){\\n int flow=G.min_cost_flow(S,T,1);\\n if(flow==-1)break;\\n sum+=flow;\\n if(sum<=K )res=i;\\n else break;\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4968,\n \"score_of_the_acc\": -0.0627,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2776_4926720\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconst int inf = 1000000000;\\n\\nusing namespace std;\\n\\nstruct MinimumCostFlow {\\n typedef pair<int, int> P;\\n\\n struct edge {\\n int to, cap, rev;\\n int cost;\\n edge(int a, int b, int c, int d): to(a), cap(b), rev(c), cost(d) {}\\n };\\n\\n vector<vector<edge>> G;\\n vector<int> prevv, preve;\\n vector<int> h, dist;\\n int V;\\n\\n MinimumCostFlow(int v): G(v, vector<edge>()), prevv(v, 0), preve(v, 0), V(v) {}\\n\\n int add_edge(int from, int to, int cap, int cost) {\\n int id = G[from].size();\\n G[from].push_back(edge(to, cap, G[to].size(), cost));\\n G[to].push_back(edge(from, 0, G[from].size() - 1, -cost));\\n return id;\\n }\\n\\n int solve(int s, int t, int f) {\\n int res = 0;\\n h.assign(V, 0);\\n while (f > 0) {\\n priority_queue<P, vector<P>, greater<P>> pq;\\n dist.assign(V, inf);\\n dist[s] = 0;\\n pq.push(P(0, s));\\n while (pq.size()) {\\n P p = pq.top();\\n pq.pop();\\n int v = p.second;\\n if (dist[v] < p.first) continue;\\n\\n for (int i = 0; i < (int)G[v].size(); i++) {\\n edge &e = G[v][i];\\n int d = dist[v] + e.cost + h[v] - h[e.to];\\n if (e.cap > 0 && dist[e.to] > d) {\\n dist[e.to] = d;\\n prevv[e.to] = v;\\n preve[e.to] = i;\\n pq.push(P(dist[e.to], e.to));\\n }\\n }\\n }\\n if (dist[t] == inf) return -1;\\n\\n for (int v = 0; v < V; v++) h[v] += dist[v];\\n\\n int 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 * h[t];\\n\\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\\n return res;\\n }\\n};\\n\\n#define SIZE 200\\n\\n\\nint main() {\\n int A, B, K;\\n int a[SIZE][SIZE], b[SIZE][SIZE];\\n\\n scanf(\\\"%d%d%d\\\", &A, &B, &K);\\n\\n for (int i = 0; i < A; i++) {\\n for (int j = 0; j < B; j++) {\\n scanf(\\\"%1d\\\", a[i] + j);\\n }\\n }\\n\\n for (int i = 0; i < B; i++) {\\n for (int j = 0; j < A; j++) {\\n scanf(\\\"%1d\\\", b[j] + i);\\n }\\n }\\n\\n MinimumCostFlow flow(A + B + 2);\\n\\n int S = A + B;\\n int T = S + 1;\\n\\n for (int i = 0; i < A; i++) flow.add_edge(S, i, 1, 0);\\n for (int j = 0; j < B; j++) flow.add_edge(A + j, T, 1, 0);\\n\\n for (int i = 0; i < A; i++) {\\n for (int j = 0; j < B; j++) {\\n flow.add_edge(i, A + j, 1, a[i][j] + b[i][j]);\\n }\\n }\\n\\n int ans = 0;\\n\\n for (int i = 0; i < min(A, B); i++) {\\n int res = flow.solve(S, T, 1);\\n if (res < 0) break;\\n if (K < res) break;\\n ans++;\\n K -= res;\\n }\\n\\n printf(\\\"%d\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4948,\n \"score_of_the_acc\": -0.0722,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2776_4471577\",\n \"code_snippet\": \"#include <cassert>\\n#include <cstdio>\\n#include <vector>\\n#include <queue>\\n#include <utility>\\n#include <iostream>\\n#include <tuple>\\n#include <limits>\\nusing namespace std;\\n\\nstruct MinCostFlowGraph {\\nprivate:\\n using ll = long long;\\n struct edge {\\n int to;\\n ll cap, cost;\\n int r_idx;\\n edge(int t, ll cap, ll cost, int r) :\\n to(t), cap(cap), cost(cost), r_idx(r) {}\\n };\\n vector<vector<edge>> G;\\n int sz;\\n\\npublic:\\n MinCostFlowGraph(int n) : G(n), sz(n) {}\\n\\n void add_edge(int from, int to, ll cap, ll cost){\\n int i = G[to].size(), i_ = G[from].size();\\n G[from].emplace_back(to,cap,cost,i);\\n G[to].emplace_back(from,0,-cost,i_);\\n }\\n \\n ll solve(int from, int to, ll k){\\n ll f = 0, cost_sum = 0;\\n const ll INF = numeric_limits<ll>::max();\\n vector<ll> potential(sz);\\n while(1){\\n vector<ll> dist(sz,INF);\\n dist[from] = 0;\\n vector<int> prev_v(sz,-1);\\n vector<int> prev_e(sz,-1);\\n priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<>> pq;\\n pq.emplace(0,from);\\n while(pq.size()){\\n // auto [d, v] = pq.top();\\n ll d = pq.top().first;\\n ll v = pq.top().second;\\n // d *= -1;\\n pq.pop();\\n if(dist[v] < d) continue;\\n for(size_t i = 0; i < G[v].size(); ++i){\\n const auto& e = G[v][i];\\n if(e.cap == 0) continue;\\n int v_ = e.to;\\n ll d_ = d + e.cost + potential[v] - potential[v_];\\n if(dist[v_] <= d_)\\n continue;\\n dist[v_] = d_;\\n prev_v[v_] = v;\\n prev_e[v_] = i;\\n // pq.emplace(-d_,e.to);\\n pq.emplace(d_,e.to);\\n }\\n }\\n if(dist[to] >= INF) return f;\\n for(int i = 0; i < sz; ++i)\\n potential[i] += dist[i];\\n int v = to;\\n ll flow = 1;\\n while(v != from){\\n int v_ = prev_v[v];\\n flow = min(flow,G[v_][prev_e[v]].cap);\\n v = v_;\\n }\\n v = to;\\n ll diff = 0;\\n while(v != from){\\n int v_ = prev_v[v];\\n auto& e = G[v_][prev_e[v]];\\n e.cap -= flow;\\n diff += flow*e.cost;\\n G[v][e.r_idx].cap += flow;\\n v = v_;\\n }\\n if(cost_sum+diff > k)\\n return f;\\n f += flow;\\n cost_sum += diff;\\n }\\n return f;\\n }\\n};\\n\\nint main(){\\n int a, b, k;\\n cin >> a >> b >> k;\\n MinCostFlowGraph G(a+b+2);\\n vector<vector<int>> E(a,vector<int>(b));\\n for(int i = 0; i < a; ++i){\\n string s;\\n cin >> s;\\n for(int j = 0; j < b; ++j){\\n int c = s[j] - '0';\\n E[i][j] += c;\\n }\\n }\\n for(int j = 0; j < b; ++j){\\n string s;\\n cin >> s;\\n for(int i = 0; i < a; ++i){\\n int c = s[i] - '0';\\n E[i][j] += c;\\n }\\n }\\n for(int i = 0; i < a; ++i)\\n for(int j = 0; j < b; ++j)\\n G.add_edge(i,a+j,1,E[i][j]);\\n int s = a+b, t = s+1;\\n for(int i = 0; i < a; ++i)\\n G.add_edge(s,i,1,0);\\n for(int j = 0; j < b; ++j)\\n G.add_edge(a+j,t,1,0);\\n cout << G.solve(s,t,k) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6396,\n \"score_of_the_acc\": -0.4648,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2776_4471440\",\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;\\nusing lint = long long int;\\nlong long int INF = 1001001001001001LL;\\nint inf = 1000000007;\\nlong long int MOD = 1000000007LL;\\ndouble PI = 3.1415926535897932;\\n\\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\\n\\n#define ALL(a) a.begin(),a.end()\\n#define RALL(a) a.rbegin(),a.rend()\\n\\n/* do your best */\\n\\n// 最小費用流\\n// O(F E log V)\\n// 与えられるもの\\n// 有向グラフ G = (V, E)\\n// 各辺 e に対して, 容量 u(e) >= 0\\n// 各辺 e に対して, 費用 c(e) (負でも ok)\\n\\n// 使い方\\n// PrimalDual(V) (コンストラクタ)\\n// add_edge(int from, int to, flow_t cap, cost_t cost)\\n// cost に関する負の閉路が存在する場合,だめ\\n// veryfied : http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B&lang=jp\\n// 流れなかったら -1 を返す\\n\\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\\n lint A, B, K; cin >> A >> B >> K;\\n vector<string> a(A);\\n for (int i = 0; i < A; i++) {\\n cin >> a[i];\\n }\\n vector<string> b(B);\\n for (int i = 0; i < B; i++) {\\n cin >> b[i];\\n }\\n \\n\\n // cost が k 以下の中の最大の F\\n int ok = 0;\\n int ng = min(A, B) + 1;\\n while (ng - ok > 1) {\\n int mid = (ok + ng) / 2;\\n PrimalDual<int, int> pd(A + B + 2);\\n int source = A + B;\\n int sink = A + B + 1;\\n\\n for (int i = 0; i < A; i++) {\\n int from = source;\\n int to = i;\\n pd.add_edge(from, to, 1, 0);\\n }\\n\\n for (int i = 0; i < B; i++) {\\n int from = A + i;\\n int to = sink;\\n pd.add_edge(from, to, 1, 0);\\n }\\n\\n for (int i = 0; i < A; i++) {\\n for (int j = 0; j < B; j++) {\\n int from = i;\\n int to = j + A;\\n int cap = 1;\\n int cost = 0;\\n if (a[i][j] == '1') cost++;\\n if (b[j][i] == '1') cost++;\\n pd.add_edge(from, to, cap, cost);\\n }\\n }\\n\\n int cost = pd.min_cost_flow(source, sink, mid);\\n\\n if (cost <= K) {\\n ok = mid;\\n } else {\\n ng = mid;\\n }\\n }\\n\\n cout << ok << endl;\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 5192,\n \"score_of_the_acc\": -0.4447,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2776_3967902\",\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// 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;\\n vector< pair<int, int> > r_edges;\\n Flow(int N_, CapTp IA_=1<<29, CostTp IO_=1<<29)\\n : G(N_), IA(IA_), IO(IO_), r_edges() {}\\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 vector<CostTp> dist(G.size()); CostTp res(0);\\n vector<int> prevv(G.size()), preve(G.size());\\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 -1;\\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 vector<CostTp> dist(G.size()), pot(G.size());\\n vector<int> prevv(G.size()), preve(G.size());\\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 INF;\\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\\n\\nint main() {\\n int A, B, K; cin >> A >> B >> K;\\n vector<string> X(A), Y(B);\\n for(int i=0; i<A; i++) cin >> X[i];\\n for(int i=0; i<B; i++) cin >> Y[i];\\n\\n Flow<> fl(A + B + 2);\\n int source = A + B, sink = source + 1;\\n for(int i=0; i<A; i++) fl.add_edge(source, i, 1, 0);\\n for(int i=0; i<B; i++) fl.add_edge(A+i, sink, 1, 0);\\n \\n for(int i=0; i<A; i++) {\\n for(int j=0; j<B; j++) {\\n int cnt = 0;\\n if(X[i][j] == '1') cnt++;\\n if(Y[j][i] == '1') cnt++;\\n // fprintf(stderr, \\\"i = %d, j = %d, cnt = %d\\\\n\\\", i, j, cnt);\\n fl.add_edge(i, A+j, 1, cnt);\\n }\\n }\\n\\n int ub = min(A, B) + 1, lb = 0;\\n while(ub - lb > 1) {\\n Flow<> fl_ = fl;\\n int mid = (ub + lb) / 2;\\n int res = fl_.fast_mincost_flow(source, sink, mid);\\n // fprintf(stderr, \\\"mid = %d, res = %d\\\\n\\\", mid, res);\\n if(res <= K) lb = mid;\\n else ub = mid;\\n }\\n cout << lb << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 7464,\n \"score_of_the_acc\": -1.0376,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2776_2917969\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \\\"(\\\" << o.first << \\\",\\\" << o.second << \\\")\\\"; return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \\\" \\\";} return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \\\"{ \\\"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \\\":\\\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \\\", \\\"; } out << \\\" }\\\"; return out; }\\n\\n/*\\n <url:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2776>\\n 問題文============================================================\\n =================================================================\\n 解説=============================================================\\n ================================================================\\n */\\ntypedef ll PD_Type;\\nconst PD_Type PD_INF = INF;\\nstruct Primal_Dual\\n{\\n typedef pair< PD_Type, int > pii;\\n \\n struct edge\\n {\\n int to, rev;\\n PD_Type cap, cost;\\n edge() {}\\n edge(int to, PD_Type cap, PD_Type cost, int rev) :to(to), cap(cap), cost(cost), rev(rev) {}\\n \\n };\\n vector< vector< edge > > graph;\\n vector< int > prevv, preve;\\n vector< PD_Type > potential, min_cost;\\n Primal_Dual(int V) : graph(V) {}\\n \\n void add_edge(int from, int to, PD_Type cap, PD_Type cost)\\n {\\n graph[from].push_back(edge(to, cap, cost, (int)graph[to].size()));\\n graph[to].push_back(edge(from, 0, -cost, (int)graph[from].size() - 1));\\n }\\n \\n PD_Type min_cost_flow(int s, int t, int f)\\n {\\n int V = (int)graph.size();\\n PD_Type ret = 0;\\n priority_queue< pii, vector< pii >, greater< pii > > 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, PD_INF);\\n que.push(pii(0, s));\\n min_cost[s] = 0;\\n \\n while (!que.empty()) {\\n pii p = que.top();\\n que.pop();\\n if (min_cost[p.second] < p.first) continue;\\n for (int i = 0; i < (int)graph[p.second].size(); i++) {\\n edge &e = graph[p.second][i];\\n PD_Type 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.push(pii(min_cost[e.to], e.to));\\n }\\n }\\n }\\n if (min_cost[t] == PD_INF) return -1;\\n for (int v = 0; v < V; v++) potential[v] += min_cost[v];\\n PD_Type 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\\nvoid solve() {\\n int A, B, K; cin >> A >> B >> K;\\n vector<string> a(A), b(B);\\n for (auto& in : a) cin >> in;\\n for (auto& in : b) cin >> in;\\n \\n int S = A + B, T = A + B + 1;\\n Primal_Dual clojure(A + B + 2);\\n for (int i = 0; i < A; i++) clojure.add_edge(S, i, 1, 0);\\n for (int i = 0; i < B; i++) clojure.add_edge(A+i, T, 1, 0);\\n \\n for (int i = 0; i < A; i++) {\\n for (int j = 0; j < B; j++) {\\n ll cost = 0;\\n if (a[i][j] == '1') cost++;\\n if (b[j][i] == '1') cost++;\\n clojure.add_edge(i, A + j, 1, cost);\\n }\\n }\\n \\n ll ans = 0;\\n while (true) {\\n ll ret = clojure.min_cost_flow(S, T, 1);\\n if (ret == -1) break;\\n if (ret > K) break;\\n K -= ret;\\n ans++;\\n }\\n cout << ans << endl;\\n}\\n\\nint main() {\\n cin.tie(0); ios_base::sync_with_stdio(false);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5540,\n \"score_of_the_acc\": -0.2414,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2776_2754638\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define NUM 410\\n\\n\\nstruct Edge{\\n\\tEdge(int arg_to,int arg_capacity,int arg_cost,int arg_rev_index){\\n\\t\\tto = arg_to;\\n\\t\\tcapacity = arg_capacity;\\n\\t\\tcost = arg_cost;\\n\\t\\trev_index = arg_rev_index;\\n\\t}\\n\\n\\tint to,capacity,cost,rev_index;\\n};\\n\\nint V;\\nvector<Edge> G[NUM];\\nint dist[NUM];\\nint pre_node[NUM],pre_edge[NUM];\\n\\n\\nvoid add_edge(int from,int to,int capacity,int cost){\\n\\tG[from].push_back(Edge(to,capacity,cost,G[to].size()));\\n\\tG[to].push_back(Edge(from,0,-cost,G[from].size()-1));\\n}\\n\\nint min_cost_flow(int source,int sink,int flow){\\n\\tint ret = 0;\\n\\twhile(flow > 0){\\n\\n\\t\\tfor(int i = 0; i < V; i++)dist[i] = BIG_NUM;\\n\\t\\tdist[source] = 0;\\n\\t\\tbool update = true;\\n\\t\\twhile(update){\\n\\t\\t\\tupdate = false;\\n\\t\\t\\tfor(int node_id = 0; node_id < V; node_id++){\\n\\t\\t\\t\\tif(dist[node_id] == BIG_NUM)continue;\\n\\t\\t\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\t\\t\\t\\tEdge &e = G[node_id][i];\\n\\t\\t\\t\\t\\tif(e.capacity > 0 && dist[e.to] > dist[node_id]+e.cost){\\n\\t\\t\\t\\t\\t\\tdist[e.to] = dist[node_id]+e.cost;\\n\\t\\t\\t\\t\\t\\tpre_node[e.to] = node_id;\\n\\t\\t\\t\\t\\t\\tpre_edge[e.to] = i;\\n\\t\\t\\t\\t\\t\\tupdate = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(dist[sink] == BIG_NUM){\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\n\\t\\tint tmp_flow = flow;\\n\\t\\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\\n\\t\\t\\ttmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\\n\\t\\t}\\n\\t\\tflow -= tmp_flow;\\n\\t\\tret += tmp_flow*dist[sink];\\n\\t\\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\\n\\t\\t\\tEdge &e = G[pre_node[node_id]][pre_edge[node_id]];\\n\\t\\t\\te.capacity -= tmp_flow;\\n\\t\\t\\tG[node_id][e.rev_index].capacity += tmp_flow;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nint main(){\\n\\n\\tint A,B,K;\\n\\tscanf(\\\"%d %d %d\\\",&A,&B,&K);\\n\\n\\tchar table_1[A][B+1],table_2[B][A+1];\\n\\tint cost[A][B];\\n\\n\\tfor(int i = 0; i < A; i++){\\n\\t\\tscanf(\\\"%s\\\",table_1[i]);\\n\\t}\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\t\\tscanf(\\\"%s\\\",table_2[i]);\\n\\t}\\n\\n\\tfor(int i = 0; i < A; i++){\\n\\t\\tfor(int k = 0; k < B; k++){\\n\\t\\t\\tcost[i][k] = (table_1[i][k]-'0')+(table_2[k][i]-'0');\\n\\t\\t}\\n\\t}\\n\\n\\tint source = 0,sink = 1,index = 2;\\n\\tint index_A[A],index_B[B];\\n\\n\\tfor(int i = 0; i < A; i++){\\n\\t\\tindex_A[i] = index++;\\n\\t\\tadd_edge(source,index_A[i],1,0);\\n\\t}\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\t\\tindex_B[i] = index++;\\n\\t\\tadd_edge(index_B[i],sink,1,0);\\n\\t}\\n\\n\\tfor(int i = 0; i < A; i++){\\n\\t\\tfor(int k = 0; k < B; k++){\\n\\t\\t\\tadd_edge(index_A[i],index_B[k],1,cost[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0,add_cost;\\n\\tint sum_cost = 0;\\n\\n\\tV = index;\\n\\n\\twhile(sum_cost <= K){\\n\\t\\tadd_cost = min_cost_flow(source,sink,1);\\n\\n\\t\\tif(add_cost < 0)break;\\n\\n\\t\\tif(sum_cost+add_cost <= K){\\n\\t\\t\\tsum_cost += add_cost;\\n\\t\\t\\tans++;\\n\\t\\t\\tif(ans == min(A,B))break;\\n\\t\\t}else{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4932,\n \"score_of_the_acc\": -0.0533,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2776_2558428\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 1120000000\\n\\ntemplate<typename T>\\nclass MinCostFlow{\\nprivate:\\n struct edge{int to; T cap, cost; int rev;};\\n using P = pair<T,int>;\\n vector<vector<edge> > Graph;\\n vector<int> prevv, preve;\\n vector<T> h, d; // ??????????????£?????????????????¢\\npublic:\\n MinCostFlow(int v){\\n // ????????°v??§?????????\\n Graph.resize(v);\\n prevv.resize(v);\\n preve.resize(v);\\n h.resize(v);\\n d.resize(v);\\n }\\n T min_cost_flow(int s, int t, T f){\\n T res = 0;\\n fill(all(h), 0);\\n // ??????????????????????????¨???\\n // rep(v,Graph.size()){\\n // rep(j,Graph[v].size()){\\n // edge &e = Graph[v][j];\\n // if(e.cap==0) continue;\\n // int u = e.to;\\n // h[u] = min(h[u],h[v]+e.cost);\\n // }\\n // }\\n while(f>0){\\n priority_queue<P, vector<P>, greater<P>> pq;\\n fill(all(d), INF);\\n d[s] = 0;\\n pq.push(mp(0,s));\\n while(!pq.empty()){\\n auto p = pq.top(); pq.pop();\\n int v = p.se;\\n if(d[v] < p.fi) continue;\\n rep(i,Graph[v].size()){\\n edge &e = Graph[v][i];\\n if(e.cap > 0 && d[e.to] > d[v] + e.cost + h[v] - h[e.to]){\\n d[e.to] = d[v] + e.cost + h[v] - h[e.to];\\n prevv[e.to] = v;\\n preve[e.to] = i;\\n pq.push(mp(d[e.to], e.to));\\n }\\n }\\n }\\n if(d[t] == INF) return -1;\\n rep(i,Graph.size()) h[i] += d[i];\\n\\n T nf = f;\\n for(int v=t; v!=s; v = prevv[v]){\\n nf = min(nf, Graph[prevv[v]][preve[v]].cap);\\n }\\n f -= nf;\\n res += nf * h[t];\\n for(int v=t; v!=s; v=prevv[v]){\\n edge &e = Graph[prevv[v]][preve[v]];\\n e.cap -= nf;\\n Graph[v][e.rev].cap += nf;\\n }\\n }\\n return res;\\n }\\n void add_edge(int from ,int to, T cap, T cost){\\n Graph[from].pb(((edge){to, cap, cost, (int)Graph[to].size()}));\\n Graph[to].pb(((edge){from, 0, -cost, (int)Graph[from].size()-1}));\\n }\\n};\\n\\nint main(){\\n int a,b,k;\\n cin>>a>>b>>k;\\n\\n vector<string> va(a), vb(b);\\n rep(i,a) cin>>va[i];\\n rep(i,b) cin>>vb[i];\\n\\n MinCostFlow<int> flow(a+b+2);\\n int s = a+b;\\n int t = a+b+1;\\n\\n rep(i,a) rep(j,b){\\n int cost = va[i][j] + vb[j][i] -'0'*2;\\n flow.add_edge(i, a+j, 1, cost);\\n }\\n rep(i,a) flow.add_edge(s, i, 1, 0);\\n rep(i,b) flow.add_edge(a+i, t, 1, 0);\\n\\n int crnt = 0;\\n int totalcost = 0;\\n while(true){\\n int nv = flow.min_cost_flow(s, t, 1);\\n if(nv == -1 || totalcost+nv > k) break;\\n totalcost += nv;\\n crnt++;\\n }\\n cout << crnt << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4784,\n \"score_of_the_acc\": -0.0441,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2776_2558246\",\n \"code_snippet\": \"#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\\nusing pi = pair<int,int>;\\n\\n// (ティツ。ツ古」ツ?催・ツ?? テ・ツョツケテゥツ?? テ」ツつウテ」ツつケテ」ツδ? テゥツ??ィツセツコ)\\nstruct edge{ int to,cap,cost,rev; };\\n\\nint V; // TODO:initialize\\nconst int MAX_V = 444; // TODO:initialize\\nconst int INF = 19191919; // TODO:initialize\\nvector<edge> G[MAX_V];\\nint h[MAX_V]; // テ」ツδ敕」ツδ?」ツδウテ」ツつキテ」ツδ」テ」ツδォ\\nint dist[MAX_V];\\nint prevv[MAX_V], preve[MAX_V]; // テァツ崢エテ・ツ可催」ツ?ョテゥツ?づァツつケテ」ツ?ィティツセツコ\\n\\nvoid add_edge(int from, int to, int cap, int cost){\\n G[from].pb({to,cap,cost,(int)G[to].size()});\\n G[to].pb({from,0,-cost,(int)G[from].size()-1});\\n}\\n\\n// sテ」ツ?凝」ツつ液テ」ツ?クテ」ツ?ョテヲツオツ?ゥツ?叔テ」ツ?ョテヲツ慊?・ツーツ湘ィツイツサテァツ板ィテヲツオツ?テ、ツクツ催・ツ渉ッティツδステ」ツ?ェテ」ツつ?1)\\nint min_cost_flow(int s, int t, int f, bool neg = false){\\n int res = 0;\\n fill(h,h+V,0);\\n while(f>0){\\n priority_queue<pi,vector<pi>,greater<pi>> pq;\\n fill(dist,dist+V,INF);\\n dist[s]=0;\\n if(neg)\\n {\\n // bellman-fordテ」ツ?ァhテ」ツつ津ヲツ崢エテヲツ鳴ー\\n neg = false;\\n bool update;\\n do{\\n update = false;\\n rep(v,V){\\n if(dist[v] == INF) continue;\\n rep(i,G[v].size()){\\n edge &e = G[v][i];\\n if(e.cap>0 && dist[e.to]>dist[v]+e.cost){\\n dist[e.to]=dist[v]+e.cost;\\n prevv[e.to] = v;\\n preve[e.to] = i;\\n update = true;\\n }\\n }\\n }\\n }while(update);\\n }\\n else\\n {\\n // dijkstraテ」ツ?ァhテ」ツつ津ヲツ崢エテヲツ鳴ー\\n pq.push(pi(0,s));\\n while(!pq.empty()){\\n pi p = pq.top();\\n pq.pop();\\n int v = p.se;\\n if(p.fi>dist[v]) continue;\\n rep(i,G[v].size()){\\n edge &e = G[v][i];\\n if(e.cap>0 && dist[e.to]>dist[v]+e.cost+h[v]-h[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 pq.push(pi(dist[e.to],e.to));\\n }\\n }\\n }\\n }\\n\\n // テ」ツ?禿」ツつ古、ツサツ・テ、ツクツ甘ヲツオツ?」ツ?崚」ツ?ェテ」ツ??\\n if(dist[t]==INF) return -1;\\n\\n rep(v,V) h[v] += dist[v];\\n\\n // s-tテゥツ鳴禿」ツ?ョテヲツ慊?ァツ淞ュティツキツッテ」ツ?ォテヲツイツソテ」ツ?」テ」ツ?ヲテァツ崢ョテ、ツクツ?ヲツ敖ッテヲツオツ?」ツ??\\n int d=f;\\n for(int v=t; v!=s; v=prevv[v]) d = min(d,G[prevv[v]][preve[v]].cap);\\n f -= d;\\n res += d*h[t];\\n\\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 return res;\\n}\\n\\nint main()\\n{\\n int A,B,K;\\n cin >>A >>B >>K;\\n\\n V = A+B+2;\\n\\n vector<string> a(A),b(B);\\n rep(i,A) cin >>a[i];\\n rep(i,B) cin >>b[i];\\n\\n int S = A+B, T = S+1;\\n rep(i,A) add_edge(S,i,1,0);\\n rep(i,B) add_edge(A+i,T,1,0);\\n\\n rep(i,A)rep(j,B)\\n {\\n int cost = 0;\\n cost += a[i][j]-'0';\\n cost += b[j][i]-'0';\\n add_edge(i,A+j,1,cost);\\n }\\n\\n int total = 0;\\n int ans = 0;\\n while(1)\\n {\\n int F = min_cost_flow(S,T,1);\\n if(F==-1) break;\\n\\n total += F;\\n if(total>K) break;\\n ++ans;\\n }\\n\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4796,\n \"score_of_the_acc\": -0.0325,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2776_2339842\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(auto i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\n\\n\\n\\ntypedef int Weight;\\ntypedef int Cap;\\nconst Weight W_INF = INT_MAX;\\nconst Weight W_ZERO = 0;\\nconst Cap C_INF = INT_MAX;\\nconst Cap C_ZERO = 0;\\n\\nstruct Edge {\\n\\tint src, dst;\\n\\tCap capacity;\\n\\tWeight cost;\\n\\tEdge(int src, int dst, const Cap& acap, const Weight& acost) :\\n\\t\\tsrc(src), dst(dst), capacity(acap), cost(acost) {\\n\\t}\\n};\\nbool operator < (const Edge &e, const Edge &f) {\\n\\treturn e.cost > f.cost;\\n}\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\n\\n#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\\n#define RCOST(u,v) (cost[u][v] + h[u] - h[v])\\n\\n//??°?????????????????§???????????????????????¨?????????\\n\\n//Graph &ag\\n//????????§???????????????(u, v, capacity, cost) ??????????????????(u, v, 0, -cost) ???????????°????????????????????¶?????????????????§????´???°????????§???????????°???????????????\\n//int s, int t\\n//?????????????§??????¨?????????\\n//?????????\\n//?????¨??¨????????????????????????\\npair<Weight, Cap> minimumCostFlow(const int amax,const Graph &ag, int s, int t) {\\n\\t//check???????´???°??????????????£???????????????\\n\\tGraph g(ag);\\n\\tfor (int i = 0; i < ag.size(); ++i) {\\n\\t\\tfor (int j = 0; j < ag[i].size(); ++j) {\\n\\t\\t\\tint d = ag[i][j].dst;\\n\\t\\t\\tint s = ag[i][j].src;\\n\\n\\t\\t\\tbool ok = false;\\n\\t\\t\\tfor (int k = 0; k < ag[d].size(); ++k) {\\n\\t\\t\\t\\tif (ag[d][k].src == s) {\\n\\t\\t\\t\\t\\tok = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!ok) {\\n\\t\\t\\t\\tg[d].push_back(Edge(d, s, C_ZERO, -ag[i][j].cost));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tconst int n = g.size();\\n\\tvector<vector<Cap>> capacity(n, vector<Cap>(n)), flow(n, vector<Cap>(n));\\n\\tvector<vector<Weight>>cost(n, vector<Weight>(n));\\n\\tfor (int u = 0; u < n; ++u) {\\n\\t\\tfor (auto e : g[u]) {\\n\\t\\t\\tcapacity[e.src][e.dst] = capacity[e.src][e.dst] + e.capacity;\\n\\t\\t\\tcost[e.src][e.dst] = cost[e.src][e.dst] + e.cost;\\n\\t\\t}\\n\\t}\\n\\tpair<Weight, Cap> total; // (cost, flow)\\n\\tvector<Weight> h(n);\\n\\n\\tfor (Cap F = amax; F > 0; ) { // residual flow\\n\\t\\tvector<Weight> d(n, W_INF); d[s] = W_ZERO;\\n\\t\\tvector<int> p(n, -1);\\n\\t\\tpriority_queue<Edge> Q; // \\\"e < f\\\" <=> \\\"e.cost > f.cost\\\"\\n\\t\\tfor (Q.push(Edge(-2, s, C_ZERO, W_ZERO)); !Q.empty(); ) {\\n\\t\\t\\tEdge e = Q.top(); Q.pop();\\n\\t\\t\\tif (p[e.dst] != -1) continue;\\n\\t\\t\\tp[e.dst] = e.src;\\n\\t\\t\\tFOR(f, g[e.dst]) {\\n\\t\\t\\t\\tif (RESIDUE(f->src, f->dst) > 0) {\\n\\t\\t\\t\\t\\tif (d[f->dst] > d[f->src] + RCOST(f->src, f->dst)) {\\n\\t\\t\\t\\t\\t\\td[f->dst] = d[f->src] + RCOST(f->src, f->dst);\\n\\t\\t\\t\\t\\t\\tQ.push(Edge(f->src, f->dst, 0, d[f->dst]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (p[t] == -1) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tCap f = F;\\n\\t\\tfor (int u = t; u != s; u = p[u]) {\\n\\t\\t\\tf = min(f, RESIDUE(p[u], u));\\n\\t\\t}\\n\\t\\tfor (int u = t; u != s; u = p[u]) {\\n\\t\\t\\ttotal.first = total.first + f * cost[p[u]][u];\\n\\t\\t\\tflow[p[u]][u] = flow[p[u]][u] + f; flow[u][p[u]] = flow[u][p[u]] - f;\\n\\t\\t}\\n\\t\\tF = F - f;\\n\\t\\ttotal.second = total.second + f;\\n\\t\\tfor (int u = 0; u < n; ++u) {\\n\\t\\t\\th[u] = h[u] + d[u];\\n\\t\\t}\\n\\t}\\n\\treturn total;\\n}\\nvoid add_edge(Graph&g, const int from, const int to, const Cap& cap, const Weight& weight) {\\n\\tassert(weight >= 0);//????????¨?????°??????\\n\\tg[from].push_back(Edge(from, to, cap, weight));\\n}\\n\\nint main() {\\n\\tint A, B, K; cin >> A >> B >> K;\\n\\tvector<vector<int>>costs(A, vector<int>(B));\\n\\tfor (int i = 0; i < A; ++i) {\\n\\t\\tstring st; cin >> st;\\n\\t\\tfor (int j = 0; j < B; ++j) {\\n\\t\\t\\tauto c = st[j] != '1';\\n\\t\\t\\tif (c == 0)costs[i][j] += 1;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < B; ++i) {\\n\\t\\tstring st; cin >> st;\\n\\t\\tfor (int j = 0; j < A; ++j) {\\n\\t\\t\\tauto c = st[j]!= '1';\\n\\t\\t\\tif (c == 0)costs[j][i] += 1;\\n\\t\\t}\\n\\t}\\n\\n\\tconst int start = 0;\\n\\tconst int aa = start + 1;\\n\\tconst int bb=aa+A;\\n\\tconst int goal = bb + B;\\n\\tGraph g(goal + 1);\\n\\tfor (int i = 0; i < A; ++i) {\\n\\t\\tg[start].push_back(Edge(start, aa + i, 1, 0));\\n\\t}\\n\\tfor (int i = 0; i < A; ++i) {\\n\\t\\tfor (int j = 0; j < B; ++j) {\\n\\t\\t\\tg[aa + i].push_back(Edge(aa + i, bb + j, 1, costs[i][j]));\\n\\t\\t}\\n\\t}\\n\\tfor (int j = 0; j < B; ++j) {\\n\\t\\tg[bb + j].push_back(Edge(bb + j, goal, 1, 0));\\n\\t}\\n\\tint amin = 0;\\n\\tint amax = min(A,B)+1;\\n\\twhile (amin + 1 != amax) {\\n\\t\\tint amid = (amin + amax) / 2;\\n\\t\\tauto p = minimumCostFlow(amid, g, start, goal);\\n\\t\\tif (minimumCostFlow(amid, g, start, goal).first <=K) {\\n\\t\\t\\tamin = amid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamax = amid;\\n\\t\\t}\\n\\t}\\n\\tcout << amin << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 8064,\n \"score_of_the_acc\": -1.8559,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2776_2270763\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)\\n#define rep(i,a) FOR(i,0,a)\\n#define all(a) (a).begin(),(a).end()\\n#define pb push_back\\n#define sz size()\\n#define MP make_pair\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\n\\nconst int INF = 1e8;\\n\\nstruct edge{\\n int from, to, cost, cap, rev;\\n edge(int a, int b, int c, int d, int e)\\n :from(a), to(b), cost(c), cap(d), rev(e) {}\\n};\\n\\n\\nstruct minFlow{\\n int v;\\n vector< vector<edge> > graph;\\n vi d, use, h, pv, pe;\\n\\n minFlow(int n):v(n){\\n graph.resize(v);\\n pv.resize(v); pe.resize(v);\\n }\\n\\n void add(int s, int g, int c, int p){\\n graph[s].pb(edge(s,g,c,p,graph[g].sz));\\n graph[g].pb(edge(g,s,-c,0,graph[s].sz-1));\\n }\\n\\n int maxFlow(int s, int t, int k){\\n int res = 0, cost = 0;\\n h = vi(v,0);\\n\\n while(1){\\n int f = 1;\\n priority_queue< pii, vector<pii>, greater<pii> > q;\\n d = vi(v,INF);\\n d[s] = 0; q.push(MP(0,s));\\n \\n while(q.sz){\\n\\tpii p = q.top(); q.pop();\\n\\tint u = p.second;\\n\\tif(d[u] < p.first) continue;\\n\\trep(i, graph[u].sz){\\n\\t edge &e = graph[u][i];\\n\\t if(e.cap>0 && d[e.to] > d[u] + e.cost + h[u] - h[e.to]){\\n\\t d[e.to] = d[u] + e.cost + h[u] - h[e.to];\\n\\t pv[e.to] = u; pe[e.to] = i;\\n\\t q.push( MP(d[e.to], e.to) );\\n\\t }\\n\\t}\\n }\\n if(d[t] == INF) break;\\n rep(u,v) h[u] += d[u];\\n \\n int x = f;\\n for(int u=t;u!=s;u=pv[u]) x = min(x, graph[pv[u]][pe[u]].cap);\\n f -= x;\\n cost += x*h[t];\\n\\n if(cost>k) break;\\n res++;\\n for(int u=t;u!=s;u=pv[u]){\\n\\tedge &e = graph[pv[u]][pe[u]];\\n\\te.cap -= x; graph[u][e.rev].cap += x;\\n }\\n\\n }\\n\\n return res;\\n }\\n};\\n\\nint main(){\\n int a,b,k;\\n cin >> a >> b >> k;\\n\\n int n = a+b+2;\\n int S = a+b, T = S+1;\\n minFlow mf(n);\\n\\n vector<vi> w(a, vi(b,0));\\n\\n rep(i,a){\\n string x; cin >> x;\\n rep(j,b){\\n if(x[j] == '1') w[i][j]++;\\n }\\n }\\n\\n rep(i,b){\\n string x; cin >> x;\\n rep(j,a){\\n if(x[j] == '1') w[j][i]++;\\n }\\n }\\n\\n rep(i,a)rep(j,b){\\n mf.add(i,j+a,w[i][j],1);\\n }\\n\\n rep(i,a) mf.add(S,i,0,1);\\n rep(i,b) mf.add(i+a,T,0,1);\\n\\n cout << mf.maxFlow(S,T,k) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5328,\n \"score_of_the_acc\": -0.1861,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2776_2030185\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n \\n#define int long long\\ntypedef pair<int,int>pint;\\ntypedef vector<int>vint;\\ntypedef vector<pint>vpint;\\n#define pb push_back\\n#define mp make_pair\\n#define fi first\\n#define se second\\n#define all(v) (v).begin(),(v).end()\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\\n \\nstruct edge{\\n int to,cap,cost,rev;\\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\\n};\\n \\nconst int INF=1001001001;\\nconst int MAX_V=500;\\nint S=MAX_V-2,T=MAX_V-1;\\nvector<edge>G[MAX_V];\\nint dist[MAX_V];\\nint prevv[MAX_V],preve[MAX_V];\\n \\nvoid init(){\\n rep(i,MAX_V)G[i].clear();\\n}\\nvoid add_edge(int from,int to,int cap,int cost){\\n G[from].pb(edge(to,cap,cost,G[to].size()));\\n G[to].pb(edge(from,0,-cost,G[from].size()-1));\\n}\\n \\nint min_cost_flow(int s,int t,int f){\\n int res=0;\\n while(f>0){\\n fill_n(dist,MAX_V,INF);\\n dist[s]=0;\\n bool update=true;\\n while(update){\\n update=false;\\n rep(v,MAX_V){\\n if(dist[v]==INF)continue;\\n rep(i,G[v].size()){\\n edge &e=G[v][i];\\n if(e.cap>0&&dist[e.to]>dist[v]+e.cost){\\n dist[e.to]=dist[v]+e.cost;\\n prevv[e.to]=v;\\n preve[e.to]=i;\\n update=true;\\n }\\n }\\n }\\n }\\n \\n if(dist[t]==INF)return -1;\\n \\n int d=f;\\n for(int v=t;v!=s;v=prevv[v]){\\n chmin(d,G[prevv[v]][preve[v]].cap);\\n }\\n \\n f-=d;\\n res+=d*dist[t];\\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 \\n return res;\\n}\\n \\nint A,B,K;\\nstring a[200],b[200];\\nsigned main(){\\n cin>>A>>B>>K;\\n rep(i,A)cin>>a[i];\\n rep(i,B)cin>>b[i];\\n \\n int lb=0,ub=300;\\n while(ub-lb>1){\\n int mid=(ub+lb)/2;\\n \\n init();\\n rep(i,A)add_edge(S,i,1,0);\\n rep(i,B)add_edge(i+A,T,1,0);\\n rep(i,A)rep(j,B){\\n int cnt=0;\\n if(a[i][j]=='1')cnt++;\\n if(b[j][i]=='1')cnt++;\\n add_edge(i,j+A,1,cnt);\\n }\\n \\n int tmp=min_cost_flow(S,T,mid);\\n if(tmp==-1||tmp>K)ub=mid;\\n else lb=mid;\\n }\\n cout<<lb<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 6496,\n \"score_of_the_acc\": -0.785,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2776_1971807\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<iostream>\\n#include<fstream>\\n#include<string>\\n#include<vector>\\n#include<list>\\n#include<map>\\n#include<math.h>\\n#include<algorithm>\\nusing namespace std;\\n\\nclass MatrixIndex :public pair<int, int>\\n{\\npublic:\\n\\tMatrixIndex(int i, int j) :pair<int, int>(i, j){\\n\\t}\\n};\\n\\nclass Matrix :public vector< vector<char> >\\n{\\npublic:\\n\\tMatrix(int col, int row)\\n\\t{\\n\\t\\tresize(col);\\n\\t\\tfor (size_t i = 0; i < size(); ++i)\\n\\t\\t{\\n\\t\\t\\tvector<char> & t = (*this)[i];\\n\\t\\t\\tt.resize(row);\\n\\t\\t}\\n\\t}\\n};\\n\\n\\nclass Keys //: public string\\n{\\npublic:\\n\\tstring keys;\\n\\tKeys(const Keys &_key) :keys(_key.keys)\\n\\t{\\n\\n\\t}\\n\\tKeys(Matrix & c, list<int> & is, list<int> & js)\\n\\t{\\n\\t\\tlist<pair<int,int> > sorted_is;\\n\\t\\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\\n\\t\\t{\\n\\t\\t\\tpair<int, int> sum(0,*it);\\n\\t\\t\\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\\n\\t\\t\\t{\\n\\t\\t\\t\\tsum.first += c[*it][*jt];\\n\\t\\t\\t}\\n\\t\\t\\tsorted_is.push_back(sum);\\n\\t\\t}\\n\\t\\tsorted_is.sort();\\n\\n\\t\\tlist<pair<int, int> > sorted_js;\\n\\t\\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\\n\\t\\t{\\n\\t\\t\\tpair<int, int> sum(0, *jt);\\n\\t\\t\\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\\n\\t\\t\\t{\\n\\t\\t\\t\\tsum.first += c[*it][*jt];\\n\\t\\t\\t}\\n\\t\\t\\tsorted_js.push_back(sum);\\n\\t\\t}\\n\\t\\tsorted_js.sort();\\n\\n\\t\\tkeys.resize((sorted_js.size() + 1) * sorted_is.size());\\n\\t\\tint i = 0;\\n\\t\\tfor (list<pair<int, int> >::iterator it = sorted_is.begin(); it != sorted_is.end(); ++it)\\n\\t\\t{\\n\\t\\t\\tfor (list<pair<int, int> >::iterator jt = sorted_js.begin(); jt != sorted_js.end(); ++jt)\\n\\t\\t\\t{\\n\\t\\t\\t\\tkeys[i++] = c[it->second][jt->second] + '0';\\n\\t\\t\\t}\\n\\t\\t\\tkeys[i++] = '_';\\n\\t\\t}\\n\\t}\\n};\\n\\n\\n\\n\\n\\n\\nvoid normalize_two(Matrix & c, list<int> & is, list<int> & js, list<MatrixIndex> & twos)\\n{\\n\\t//???\\n\\tlist<int> is2;\\n\\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\\n\\t{\\n\\t\\tint & i = *it;\\n\\t\\tbool b_ok = js.size()>0;\\n\\t\\tint j=-1;\\n\\t\\tfor (list<int>::iterator jt = js.begin(); jt != js.end() && b_ok; ++jt)\\n\\t\\t{\\n\\t\\t\\tj = *jt;\\n\\t\\t\\tb_ok = (c[i][j] == 2);\\n\\t\\t}\\n\\t\\tif (b_ok)\\n\\t\\t{\\n\\t\\t\\ttwos.push_back(MatrixIndex(i, j));\\n\\t\\t\\tjs.remove(j);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tis2.push_back(i);\\n\\t\\t}\\n\\t}\\n\\tis = is2;\\n\\tlist<int> js2;\\n\\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\\n\\t{\\n\\t\\tint & j = *jt;\\n\\t\\tint i = -1;\\n\\t\\tbool b_ok = is.size()>0;\\n\\t\\tfor (list<int>::iterator it = is.begin(); it != is.end() && b_ok; ++it)\\n\\t\\t{\\n\\t\\t\\ti = *it;\\n\\t\\t\\tb_ok = (c[i][j] == 2);\\n\\t\\t}\\n\\t\\tif (b_ok)\\n\\t\\t{\\n\\t\\t\\ttwos.push_back(MatrixIndex(-1,j));\\n\\t\\t\\tis.remove(i);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tjs2.push_back(j);\\n\\t\\t}\\n\\t}\\n\\tjs = js2;\\n}\\n\\nclass info\\n{\\npublic:\\n\\tlist<MatrixIndex> indexpair[3];\\n\\tint maxpairs;\\n\\tint K;\\n\\tbool complete;\\n\\tinfo() :K(0), complete(false), maxpairs(-1)\\n\\t{\\n\\t}\\n\\tinfo(int _K) :info()\\n\\t{\\n\\t\\tK = _K;\\n\\t}\\n\\tinfo(list<MatrixIndex> _indexpair[3], int _K) :info(_K)\\n\\t{\\n\\t\\tinit(_indexpair);\\n\\t}\\n\\tinfo(const info & _inf, const int _K) :info(_K)\\n\\t{\\n\\t\\tmaxpairs = _inf.maxpairs;\\n\\t\\tcomplete = _inf.complete;\\n\\t\\tinit(_inf.indexpair);\\n\\t}\\n\\tvoid init(const list<MatrixIndex> _indexpair[3])\\n\\t{\\n\\t\\tfor (int i = 0; i < 3; ++i)\\n\\t\\t{\\n\\t\\t\\tindexpair[i] = _indexpair[i];\\n\\t\\t}\\n\\t\\tupdate();\\n\\t}\\n\\tvoid update()\\n\\t{\\n\\t\\tint k = K;\\n\\t\\tmaxpairs = int(indexpair[0].size());\\n\\t\\tif (k > 0)\\n\\t\\t{\\n\\t\\t\\t//1\\n\\t\\t\\tint ones = min(k, int(indexpair[1].size()));\\n\\t\\t\\tk -= ones;\\n\\t\\t\\tmaxpairs += ones;\\n\\t\\t}\\n\\t\\tif (k/2 > 0)\\n\\t\\t{\\n\\t\\t\\t//2\\n\\t\\t\\tint twos = min(k/2, int(indexpair[2].size()));\\n\\t\\t\\tk -= twos*2;\\n\\t\\t\\tmaxpairs += twos;\\n\\t\\t}\\n\\t\\tcomplete = (maxpairs == int(indexpair[0].size() + indexpair[1].size() + indexpair[2].size()));\\n\\t}\\n};\\nmap<string, info> g_cache;\\n\\ninfo & travers_all(Matrix & c, list<int> & is, list<int> & js, list<MatrixIndex> indexpair[3], int K)\\n{\\n\\tKeys key(c, is, js);\\n\\tmap<string, info>::iterator it_inf = g_cache.find(key.keys);\\n\\tif (it_inf != g_cache.end())\\n\\t{\\n\\t\\treturn it_inf->second;\\n\\t}\\n\\n\\tinfo inf(K);\\n\\tbool b_one = false;\\n\\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\\n\\t{\\n\\t\\tint & i = *it;\\n\\t\\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\\n\\t\\t{\\n\\t\\t\\tint & j = *jt;\\n\\t\\t\\tif (c[i][j] == 1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tlist<int> is2(is);\\n\\t\\t\\t\\tis2.remove(i);\\n\\t\\t\\t\\tlist<int> js2(js);\\n\\t\\t\\t\\tjs2.remove(j);\\n\\t\\t\\t\\tindexpair[1].push_back(MatrixIndex(i, j));\\n\\t\\t\\t\\tinfo _inf = travers_all(c, is2, js2, indexpair, K);\\n\\t\\t\\t\\t//info current(_inf);\\n\\t\\t\\t\\t//current.indexpair[1].push_back(MatrixIndex(i, j));\\n\\t\\t\\t\\t_inf.indexpair[1].push_back(MatrixIndex(i, j));\\n\\t\\t\\t\\t//for (int previ = 0; previ < 2; ++previ)\\n\\t\\t\\t\\t//{\\n\\t\\t\\t\\t//\\tfor (list<MatrixIndex>::iterator prev = indexpair[previ].begin(); prev != indexpair[previ].end(); prev++)\\n\\t\\t\\t\\t//\\t{\\n\\t\\t\\t\\t//\\t\\tcurrent.indexpair[previ].push_back(*prev);\\n\\t\\t\\t\\t//\\t}\\n\\t\\t\\t\\t//}\\n\\t\\t\\t\\t//current.update();\\n\\t\\t\\t\\tif (b_one)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//update\\n\\t\\t\\t\\t\\tif (_inf.indexpair[1].size() > inf.indexpair[1].size())\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tinf = _inf;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//if (current.maxpairs > inf.maxpairs)\\n\\t\\t\\t\\t\\t//{\\n\\t\\t\\t\\t\\t//\\tinf = _inf;\\n\\t\\t\\t\\t\\t//}\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tb_one = true;\\n\\t\\t\\t\\t\\tinf = _inf;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tindexpair[1].pop_back();\\n\\t\\t\\t\\tif (inf.complete)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t//\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (inf.complete)\\n\\t\\t{\\n\\t\\t\\t//break;\\n\\t\\t}\\n\\t}\\n\\tif (b_one == false)\\n\\t{\\n\\t\\tlist<MatrixIndex> ip[3];\\n\\t\\t//for (int i = 0; i < 3; ++i)\\n\\t\\t//{\\n\\t\\t//\\tip[i] = indexpair[i];\\n\\t\\t//}\\n\\t\\t///one ???????????£???\\n\\t\\tnormalize_two(c, is, js, ip[2]);\\n\\t\\tinf = info(ip, K);\\n\\t\\t//static info sinfo;\\n\\t\\t//sinfo = inf;\\n\\t\\t//return sinfo;\\n\\t}\\n\\t/// all complete\\n\\tg_cache[key.keys] = inf;\\n\\treturn g_cache[key.keys];\\n}\\n\\ninfo & travers_select_zero(Matrix & c, list<int> & is, list<int> & js, list<MatrixIndex> indexpair[3], int K)\\n{\\n\\tKeys key(c, is, js);\\n\\tmap<string, info>::iterator it_inf = g_cache.find(key.keys);\\n\\tif (it_inf != g_cache.end())\\n\\t{\\n\\t\\treturn it_inf->second;\\n\\t}\\n\\tinfo inf(K);\\n\\tbool b_zero = false;\\n\\tfor (list<int>::iterator it = is.begin(); it != is.end(); ++it)\\n\\t{\\n\\t\\tint & i = *it;\\n\\t\\tfor (list<int>::iterator jt = js.begin(); jt != js.end(); ++jt)\\n\\t\\t{\\n\\t\\t\\tint & j = *jt;\\n\\t\\t\\tif (c[i][j] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tlist<int> is2(is);\\n\\t\\t\\t\\tis2.remove(i);\\n\\t\\t\\t\\tlist<int> js2(js);\\n\\t\\t\\t\\tjs2.remove(j);\\n\\t\\t\\t\\tindexpair[0].push_back(MatrixIndex(i, j));\\n\\t\\t\\t\\tinfo _inf = travers_select_zero(c, is2, js2, indexpair, K);\\n\\t\\t\\t\\tinfo total(_inf);\\n\\t\\t\\t\\tfor (list<MatrixIndex>::iterator prev = indexpair[0].begin(); prev != indexpair[0].end(); prev++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttotal.indexpair[0].push_back(*prev);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttotal.update();\\n\\t\\t\\t\\t_inf.indexpair[0].push_back(MatrixIndex(i, j));\\n\\t\\t\\t\\tif (b_zero)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//update\\n\\t\\t\\t\\t\\tif (total.maxpairs > inf.maxpairs)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tinf = _inf;\\n\\t\\t\\t\\t\\t\\tinf.maxpairs = total.maxpairs;\\n\\t\\t\\t\\t\\t\\tinf.complete = total.complete;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tb_zero = true;\\n\\t\\t\\t\\t\\tinf = _inf;\\n\\t\\t\\t\\t\\tinf.maxpairs = total.maxpairs;\\n\\t\\t\\t\\t\\tinf.complete = total.complete;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tindexpair[0].pop_back();\\n\\t\\t\\t}\\n\\t\\t\\tif (inf.complete)\\n\\t\\t\\t{\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (inf.complete)\\n\\t\\t{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tif (b_zero == false)\\n\\t{\\n\\t\\t///zero ???????????£???\\n\\t\\tinf = travers_all(c, is, js, indexpair, K);\\n\\t\\tinf.update();\\n\\t}\\n\\t/// all complete\\n\\tg_cache[key.keys] = inf;\\n\\treturn g_cache[key.keys];\\n}\\n\\ninfo & search_maxpair(Matrix & c, list<int> & is, list<int> & js, int K)\\n{\\n\\tlist<MatrixIndex> indexpair[3];\\n\\tinfo & inf = travers_select_zero(c, is, js, indexpair, K);\\n\\treturn inf;\\n}\\nint main(){\\n\\n\\tstd::istream & c_in = cin;\\n\\n\\tint A, B, K;\\n\\tc_in >> A >> B >> K;\\n\\tMatrix a(A, B);\\n\\tfor (size_t i = 0; i < a.size(); ++i)\\n\\t{\\n\\t\\tvector<char> & t = a[i];\\n\\t\\tfor (size_t j = 0; j < t.size(); ++j)\\n\\t\\t{\\n\\t\\t\\tc_in >> t[j];\\n\\t\\t\\tt[j] -= '0';\\n\\t\\t}\\n\\t}\\n\\tMatrix b(B, A);\\n\\tfor (size_t i = 0; i < b.size(); ++i)\\n\\t{\\n\\t\\tvector<char> & t = b[i];\\n\\t\\tfor (size_t j = 0; j < t.size(); ++j)\\n\\t\\t{\\n\\t\\t\\tc_in >> t[j];\\n\\t\\t\\tt[j] -= '0';\\n\\t\\t}\\n\\t}\\n\\n\\tMatrix c(A, B);\\n\\tfor (size_t i = 0; i < c.size(); ++i)\\n\\t{\\n\\t\\tfor (size_t j = 0; j < c[i].size(); ++j)\\n\\t\\t{\\n\\t\\t\\tc[i][j] = a[i][j] + b[j][i];\\n\\t\\t}\\n\\t}\\n\\tlist<int>is;\\n\\tlist<int>js;\\n\\tfor (int i = 0; i < A; ++i)\\n\\t{\\n\\t\\tis.push_back(i);\\n\\t}\\n\\tfor (int j = 0; j < B; ++j)\\n\\t{\\n\\t\\tjs.push_back(j);\\n\\t}\\n\\n\\n\\tinfo inf = search_maxpair(c, is, js, K);\\n\\tcout << inf.maxpairs << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7852,\n \"score_of_the_acc\": -0.83,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2776_1935188\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\nstruct CWW{\\n CWW(){\\n\\tios::sync_with_stdio(false);cin.tie(0);\\n }\\n}cww;\\n\\n\\n\\n\\n\\nint A,B,K;\\n#define ARAI(x) (x)\\n#define arai(x) (A+x)\\n#define S (A+B)\\n#define G (S+1)\\n\\nstruct edge{\\n int flow,to,rev,cost;\\n};\\ntypedef vector<edge> E;\\ntypedef vector<E> Graph;\\n\\nvoid addedge(Graph &g,int from,int to,int f,int cost){\\n int n=g[from].size();\\n int m=g[to].size();\\n g[from].push_back(edge{f,to,m,cost});\\n g[to].push_back(edge{0,from,n,-cost});\\n}\\n\\nnamespace _ssc{\\n #define SZ 500\\n int h[SZ];\\n int d[SZ];\\n int pV[SZ];\\n int pE[SZ];\\n};\\nstruct ssc{\\n int *h,*d,*pV,*pE;\\n ssc(int V):h(_ssc::h),d(_ssc::d),pV(_ssc::pV),pE(_ssc::pE){\\n\\tfill(h,h+V,0);\\n }\\t \\n};\\nconst int INF=114514;\\nint min_cost_flow(int s,int t,int f,Graph &g,ssc& info){\\n using P=tuple<int,int>;\\n\\n const int V=g.size();\\n int res=0;\\n while(f>0){\\n\\tpriority_queue<P> que;\\n\\tfill(info.d,info.d+V,INF);\\n\\tinfo.d[s]=0;\\n\\tque.push(P(0,s));\\n\\twhile(que.size()){\\n\\t auto p=que.top();que.pop();\\n\\t int cost,v;tie(cost,v)=p;cost=-cost;\\n\\t if(info.d[v]<cost)continue;\\n\\t for(int i=0,sz=g[v].size();i<sz;i++){\\n\\t\\tauto &e=g[v][i];\\n\\t\\tif(e.flow>0&&info.d[e.to]>info.d[v]+e.cost+info.h[v]-info.h[e.to]){\\n\\t\\t info.d[e.to]=info.d[v]+e.cost+info.h[v]-info.h[e.to];\\n\\t\\t info.pV[e.to]=v;\\n\\t\\t info.pE[e.to]=i;\\n\\t\\t que.push(P(-info.d[e.to],e.to));\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tif(info.d[t]==INF)return -1;\\n\\t\\n\\tfor(int v=0;v<V;v++)info.h[v]+=info.d[v];\\n\\tint d=f;\\n\\tfor(int v=t;v!=s;v=info.pV[v])\\n\\t d=min(d,g[info.pV[v]][info.pE[v]].flow);\\n\\tf-=d;\\n\\tres+=d*info.h[t];\\n\\tfor(int v=t;v!=s;v=info.pV[v]){\\n\\t auto &e=g[info.pV[v]][info.pE[v]];\\n\\t e.flow-=d;\\n\\t g[v][e.rev].flow+=d;\\n\\t}\\n }\\n return res;\\n}\\nint main(){\\n cin>>A>>B>>K;\\n int V=A+B+2;\\n Graph g(V);\\n ssc info(V);\\n for(int i=0;i<A;i++)addedge(g,S,ARAI(i),1,0);\\n for(int i=0;i<B;i++)addedge(g,arai(i),G,1,0);\\n vector<vector<int>> R(A,vector<int>(B,0));\\n for(int i=0;i<A;i++){\\n\\tstring s;\\n\\tcin>>s;\\n\\tfor(int j=0;j<B;j++)if(s[j]=='1')R[i][j]++;\\t\\t\\t \\n }\\n for(int i=0;i<B;i++){\\n\\tstring s;\\n\\tcin>>s;\\n\\tfor(int j=0;j<A;j++)if(s[j]=='1')R[j][i]++;\\t\\t\\t \\n }\\n for(int i=0;i<A;i++)\\n\\tfor(int j=0;j<B;j++)\\n\\t addedge(g,ARAI(i),arai(j),1,R[i][j]);\\n int res=0,cost,allcost=0;\\n while((cost=min_cost_flow(S,G,1,g,info))!=-1){\\n\\tallcost+=cost;\\n\\tif(allcost<=K)res++;\\n\\telse break;\\n }\\n cout<<res<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4808,\n \"score_of_the_acc\": -0.0504,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1665,"cells":{"group_id":{"kind":"string","value":"aoj_2777_cpp"},"problem_description":{"kind":"string","value":"F: きっちり - Kitsuchiri -\n問題\n若ヶ松高校二年へ組の合津千里（あつちり）さんは数列が「きっちり」していなければ気がすまない。\n合津さんによると、「きっちり」した数列とは、長さが偶数で左右対称である数列のことである。\nすなわち、長さ\nN\n(\nN\nは偶数)の数列\nS\nについて、次の条件を満たせば数列\nS\nは「きっちり」している。\nS_1 = S_N, S_2 = S_{N − 1},\n...\n, S_{N/2} = S_{N − N/2 + 1}\n二年へ組の数学担当の先生は、合津さんから「きっちりしてください。」と要望され、授業で用いる数列を作り直さなければならない。\n先生は、数列の\nl\n番目から\nr\n番目までのそれぞれの要素に数字\nx\nを足すクエリをいくつも適用することで、数列を「きっちり」させようと奮闘しているが、うまくいかないようだ。\n二年へ組に所属する凄腕プログラマーのあなたの仕事は、先生が絶望してしまう前に、先生が作り直している数列が「きっちり」しているかを調べるプログラムを作ることだ。\n入力形式\n入力は以下の形式からなる。\nN\nS_1\n...\nS_N\nQ\nq_1\n...\nq_Q\nQ\nはクエリの総数であり、\n1 \\≤ i \\≤ Q\nについて、各\nq_i\nは\nl\n,\nr\n,\nx\nを順に1つの半角スペースで区切って与えらる。\nまた、次の制約を満たす。\n2 \\≤ N \\≤ 500,000\nである。\nN\nは偶数である。\n1 \\≤ j \\≤ N\nについて、\n−100,000,000 \\≤ S_j \\≤ 100,000,000\nである。\ni\n番目の各クエリを適用した後の数列の各要素\nT_{i,j}\nは\n−100,000,000 \\≤ T_{i,j} \\≤ 100,000,000\nを満たす。\n1 \\≤ Q \\≤ 100,000\nである。\n1 \\≤ l \\≤ r \\≤ N\nである。\n−1,000 \\≤ x \\≤ 1,000\nである。\n出力形式\nクエリ\ni\nまで処理した後の数列が「きっちり」していれば“1”を、そうでなければ“0”を\ni\n行目に出力せよ。\n入力例1\n10\n0 1 2 3 4 4 3 2 1 0\n7\n2 6 0\n2 4 5\n7 9 10\n2 4 5\n3 8 100\n4 6 1000\n7 7 1000\n出力例1\n1\n0\n0\n1\n1\n0\n1\n入力例2\n10\n4 4 4 4 4 4 4 4 6 4\n5\n9 9 -2\n1 10 1000\n1 10 -1000\n3 8 100\n5 6 1\n出力例2\n1\n1\n1\n1\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2777_10850964","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst ll LINF = 1e18;\nconst int INF = 1e9;\n#define FOR(i,s,t) for(int i =s; i < t;i++)\n#define SZ(a) (int)a.size()\n#define ALL(a) a.begin(),a.end()\n\nconst ll INIT = 0;\nstruct SegTree {\n\tint N;\n\tll init_v;\n\tvector<pll> node;\n\tVL lazy;\n\tSegTree(int _N) :init_v(INIT) {\n\t\tinit_v = 0;\n\t\tN = 1;\n\t\twhile (N < _N) N *= 2;\n\t\tnode.resize(2 * N - 1, pll(0,0));\n\t\tlazy.resize(2 * N - 1, 0);\n\t}\n\n\tpll merge(pll a, pll b) {\n\t\tpll ret = pll(-1e9, 1e9);\n\t\tret.first = max(a.first, b.first);\n\t\tret.second = min(a.second, b.second);\n\t\treturn ret;\n\t}\n\tvoid lazy_e(int l, int r, int k) {\n\t\tnode[k].first += lazy[k];\n\t\tnode[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\n\tvoid update(int a, int b, ll x) {\n\t\tupdate(a, b, 0, 0, N, x);\n\t}\n\tvoid update(int a, int b, int k, int l, int r, ll x) {\n\t\tlazy_e(l, r, k);\n\t\tif (r <= a || b <= l) return;\n\t\tif (a <= l && r <= b) {\n\t\t\tlazy[k] += x;\n\t\t\tlazy_e(l, r, k);\n\t\t}\n\t\telse {\n\t\t\tupdate(a, b, 2 * k + 1, l, (l + r) / 2, x);\n\t\t\tupdate(a, b, 2 * k + 2, (l + r) / 2, r, x);\n\t\t\tnode[k] = merge(node[2 * k + 1], node[2 * k + 2]);\n\t\t}\n\t}\n\n\tpll query(int a, int b) { return query(a, b, 0, 0, N); }\n\tpll query(int a, int b, int k, int l, int r) {\n\t\tlazy_e(l, r, k);\n\t\tif (r <= a || b <= l) return pll(-1e9, 1e9);\n\t\tif (a <= l && r <= b) {\n\t\t\treturn node[k];\n\t\t}\n\t\telse {\n\t\t\treturn merge(\n\t\t\t\tquery(a, b, 2 * k + 1, l, (l + r) / 2),\n\t\t\t\tquery(a, b, 2 * k + 2, (l + r) / 2, r)\n\t\t\t);\n\t\t}\n\t}\n};\n\nvoid solve() {\n\tll N; cin >> N;\n\tvector<ll> kassa(N); for (auto& in : kassa) cin >> in;\n\tll Q; cin >> Q;\n\tll S = N / 2;\n\tSegTree ST(S);\n\tfor (int i = 0; i < S; i++) {\n\n\t\tST.update(i, i + 1, kassa[i]);\n\t}\n\tfor (int i = S; i < N; i++) {\n\t\t//\tcout << N - i << endl;\n\t\tST.update(N - i - 1, N - i, -kassa[i]);\n\t}\n\n\t//\tcout << ST.query(0, S) << endl;\n\t//return;\n\twhile (Q--) {\n\t\tll l, r, x; cin >> l >> r >> x;\n\t\tl--; r--;\n\t\tif (r < S) {\n\t\t\tST.update(l, r + 1, x);\n\t\t}\n\t\telse if (l >= S) {\n\t\t\tST.update(N - r - 1, N - l, -x);\n\t\t}\n\t\telse {\n\t\t\tST.update(l, S, x);\n\t\t\tST.update(N - r - 1, S, -x);\n\t\t}\n\t\t//cout << string(10, '=') << endl;\n\t\t//\tcout << ST.query(0,S) << endl;\n\t\tpll a = ST.query(0, S);\n\t\tif (a.first == a.second && a.first == 0) {\n\t\t\tcout << 1 << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << 0 << endl;\n\t\t}\n//\t\tcout << (ST.query(0, S) == 0) << endl;\n\t\t//\t\tcout << string(10, '-') << endl;\n\t}\n}\n\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\n\tsolve();\n\n\treturn 0;\n}","accuracy":1,"time_ms":310,"memory_kb":19376,"score_of_the_acc":-0.8112,"final_rank":10},{"submission_id":"aoj_2777_9522215","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) { return (ull)rng() % B; }\n\nstruct Node {\n int n;\n using NP = Node *;\n NP L, R;\n ll mi, mx, lz;\n\n void initNode() { mi = 0, mx = 0, lz = 0; }\n void update() { mi = min(L->mi, R->mi), mx = max(L->mx, R->mx); }\n void push() { L->lazy(lz), R->lazy(lz), lz = 0; }\n void lazy(ll x) { mi += x, mx += x, lz += x; }\n void add(int l, int r, ll x) {\n if (r <= 0 or n <= l) return;\n if (l <= 0 and n <= r) {\n lazy(x);\n return;\n }\n push();\n L->add(l, r, x);\n R->add(l - n / 2, r - n / 2, x);\n update();\n }\n Node(int n) : n(n) {\n initNode();\n if (n == 1) return;\n L = new Node(n / 2);\n R = new Node(n - n / 2);\n }\n};\n// sst = new Node(sz);\nNode *sst = nullptr;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vector<ll> a(n);\n for (int i = 0; i < n; ++i) {\n cin >> a[i];\n }\n sst = new Node(n);\n for (int i = 0; i < n; ++i) {\n sst->add(i, i + 1, a[i] - a[n - 1 - i]);\n }\n int q;\n cin >> q;\n while (q--) {\n int l, r, x;\n cin >> l >> r >> x;\n l -= 1;\n sst->add(l, r, x);\n sst->add(n - r, n - l, -x);\n if (sst->mi == 0 and sst->mx == 0) cout << 1 << \"\\n\";\n else cout << 0 << \"\\n\";\n }\n}","accuracy":1,"time_ms":260,"memory_kb":69580,"score_of_the_acc":-1.5,"final_rank":18},{"submission_id":"aoj_2777_6941925","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=2167167167167167167;\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\";}\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\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;\n\tcin>>N;\n\tvector<int> S(N);\n\trep(i,N) cin>>S[i];\n\tvector<int> p(N/2+2);\n\tvector<int> q(N/2+1);\n\trep(i,N/2) p[i+1]=S[i]-S[N-i-1];\n\trep(i,N/2+1) q[i]=p[i+1]-p[i];\n\tint ans=0;\n\trep(i,N/2+1) if(q[i]!=0) ans++;\n\tint Q;\n\tcin>>Q;\n\trep(i,Q){\n\t\tint l,r;\n\t\tll x;\n\t\tcin>>l>>r>>x;\n\t\tif(N/2<l){\n\t\t\tl=N+1-l;\n\t\t\tr=N+1-r;\n\t\t\tswap(l,r);\n\t\t\tx=-x;\n\t\t\tr++;\n\t\t}else if(l<=N/2&&N/2<r){\n\t\t\tr=N+1-r;\n\t\t\tif(l>r) swap(l,r),x=-x;\n\t\t\tif(l==r) x=0;\n\t\t}else{\n\t\t\tr++;\n\t\t}\n\t\tif(q[l-1]!=0) ans--;\n\t\tq[l-1]+=x;\n\t\tif(q[l-1]!=0) ans++;\n\t\tif(q[r-1]!=0) ans--;\n\t\tq[r-1]-=x;\n\t\tif(q[r-1]!=0) ans++;\n\t\t//cout<<l<<\" \"<<r<<\" \"<<x<<\"\\n\";\n\t\tif(ans==0) cout<<\"1\\n\";\n\t\telse cout<<\"0\\n\";\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":7016,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2777_5532969","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// 0-indexed\ntemplate <class T, class E>\nstruct SegmentTreeLaze {\n // a,b:T c,d:E e:E(unit)\n // g(f(a,b),c) = f(g(a,c),g(b,c))\n // g(g(a,c),d) = g(a,h(c,d))\n // g(a,e) = a\n typedef function<T(T, T)> F;\n typedef function<T(T, E)> G;\n typedef function<E(E, E)> H;\n int n, height;\n F f;\n G g;\n H h;\n T tunit;\n E eunit;\n vector<T> dat;\n vector<E> laz;\n SegmentTreeLaze(){};\n SegmentTreeLaze(int newn, F f, G g, H h, T nt, E ne)\n : f(f), g(g), h(h), tunit(nt), eunit(ne) {\n init(newn);\n }\n SegmentTreeLaze(const vector<T> &v, F f, G g, H h, T nt, E ne)\n : f(f), g(g), h(h), tunit(nt), eunit(ne) {\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, height = 0;\n while (n < newn) n <<= 1, ++height;\n dat.assign(n << 1, tunit);\n laz.assign(n << 1, eunit);\n }\n\n inline T reflect(int k) {\n return laz[k] == eunit ? dat[k] : g(dat[k], laz[k]);\n }\n\n inline void eval(int k) {\n if (laz[k] == eunit) return;\n laz[k << 1] = h(laz[k << 1], laz[k]);\n laz[(k << 1) | 1] = h(laz[(k << 1) | 1], laz[k]);\n dat[k] = reflect(k);\n laz[k] = eunit;\n }\n\n inline void thrust(int k) {\n for (int i = height; i; --i) eval(k >> i);\n // reset query\n // dat[k] = reflect(k);\n // laz[k] = eunit;\n }\n\n void recalc(int k) {\n while (k >>= 1) dat[k] = f(reflect(k << 1), reflect((k << 1) | 1));\n }\n // [a,b)\n void update(int a, int b, E newdata) {\n thrust(a += n);\n thrust(b += n - 1);\n for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n if (l & 1) laz[l] = h(laz[l], newdata), l++;\n if (r & 1) --r, laz[r] = h(laz[r], newdata);\n }\n recalc(a);\n recalc(b);\n }\n\n void set_val(int k, T newdata) {\n thrust(k += n);\n dat[k] = newdata;\n laz[k] = eunit;\n recalc(k);\n }\n\n // [a,b)\n T query(int a, int b) {\n thrust(a += n);\n thrust(b += n - 1);\n T vl = tunit, vr = tunit;\n for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n if (l & 1) vl = f(vl, reflect(l++));\n if (r & 1) vr = f(reflect(--r), vr);\n }\n return f(vl, vr);\n }\n\n // require: func(unit) == false\n // min left: st <= res && func(seg.query(st,res + 1))\n template <typename C>\n int find_left(int st, C &func, T &acc, int k, int l, int r) {\n if (l + 1 == r) {\n acc = f(acc, reflect(k));\n return func(acc) ? l : -1;\n }\n eval(k);\n int mid = (l + r) >> 1;\n if (mid <= st) return find_left(st, func, acc, (k << 1) | 1, mid, r);\n if (st <= l && !func(f(acc, dat[k]))) {\n acc = f(acc, dat[k]);\n return -1;\n }\n int nres = find_left(st, func, acc, (k << 1), l, mid);\n if (~nres) return nres;\n return find_left(st, func, acc, (k << 1) | 1, mid, r);\n }\n template <typename C>\n int find_left(int st, C &func) {\n T acc = tunit;\n return find_left(st, func, acc, 1, 0, n);\n }\n\n // max right: res <= st && func(seg.query(res - 1,st))\n template <typename C>\n int find_right(int st, C &func, T &acc, int k, int l, int r) {\n if (l + 1 == r) {\n acc = f(reflect(k), acc);\n return func(acc) ? r : -1;\n }\n eval(k);\n int mid = (l + r) >> 1;\n if (st <= mid) return find_right(st, func, acc, k << 1, l, mid);\n if (r <= st && !func(f(dat[k], acc))) {\n acc = f(dat[k], acc);\n return -1;\n }\n int nres = find_right(st, func, acc, (k << 1) | 1, mid, r);\n if (~nres) return nres;\n return find_right(st, func, acc, k << 1, l, mid);\n }\n template <typename C>\n int find_right(int st, C &func) {\n T acc = tunit;\n return find_right(st, func, acc, 1, 0, n);\n }\n};\n\nint n, q;\nSegmentTreeLaze<int, int> segmax, segmin;\n\nint main() {\n cin >> n;\n {\n n >>= 1;\n vector<int> s(n);\n for (int i = 0; i < n; ++i) cin >> s[i];\n for (int i = n - 1; i >= 0; --i) {\n int p;\n cin >> p;\n s[i] -= p;\n }\n auto minf = [](int l, int r) { return min(l, r); };\n auto maxf = [](int l, int r) { return max(l, r); };\n auto gh = [](int l, int r) { return l + r; };\n segmin = SegmentTreeLaze<int, int>(s, minf, gh, gh, 0, 0);\n segmax = SegmentTreeLaze<int, int>(s, maxf, gh, gh, 0, 0);\n }\n cin >> q;\n while (q--) {\n int l, r, x;\n cin >> l >> r >> x;\n if (--l < n) {\n segmin.update(l, min(r, n), x);\n segmax.update(l, min(r, n), x);\n }\n if (r-- > n) {\n l = max(l, n);\n l -= n, r -= n;\n swap(l, r);\n l = n - 1 - l;\n r = n - r;\n segmin.update(l, r, -x);\n segmax.update(l, r, -x);\n }\n cout << (!segmin.query(0, n) && !segmax.query(0, n)) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":350,"memory_kb":12372,"score_of_the_acc":-0.7902,"final_rank":9},{"submission_id":"aoj_2777_5532484","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;\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(15);}} __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\";}\ntemplate <typename T,typename E>\nstruct lazysegtree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n lazysegtree(F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){}\n \n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(const vector<T> &v){\n int n_=v.size();\n init(n_);\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n inline T reflect(int k){\n return laz[k]==ei?dat[k]:g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n inline void thrust(int k){\n for(int i=height;i;i--) eval(k>>i);\n }\n inline void recalc(int k){ \n while(k>>=1)\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));\n }\n void update(int a,int b,E x){\n thrust(a+=n);\n thrust(b+=n-1);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n recalc(a);\n recalc(b);\n }\n void set_val(int a,T x){\n thrust(a+=n);\n dat[a]=x;laz[a]=ei;\n recalc(a);\n }\n T query(int a,int b){\n thrust(a+=n);\n thrust(b+=n-1);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n};\nint main(){\n auto f1=[&](ll a,ll b){\n if(a>b)return a;\n return b;\n };\n auto f2=[&](ll a,ll b){\n if(a<b)return a;\n return b;\n\n };\n auto g=[&](ll a,ll b){\n return a+b;\n };\n ll n;\n cin>>n;\n V<ll> a(n);\n for(int i=0;i<n;i++)cin>>a[i];\n V<ll> d(n/2);\n for(int i=0;i<n/2;i++){\n d[i]=a[i]-a[n-i-1];\n }\n lazysegtree<ll,ll> dpa(f1,g,g,-inf,0ll),dpb(f2,g,g,inf,0);\n dpa.build(d);\n dpb.build(d);\n // print(d);\n int q;\n cin>>q;\n while(q--){\n ll l,r,x;\n cin>>l>>r>>x;\n l--;\n ll L=min(l,n/2),R=min(n/2,r);\n if(L!=R){\n dpa.update(L,R,x);\n dpb.update(L,R,x);\n }\n // L=max(n/2,l)-n/2,R=max(n/2,r)-n/2;\n L=n/2-(max(n/2,r)-n/2); R=n/2-(max(n/2,l)-n/2);\n if(L!=R){\n dpa.update(L,R,-x);\n dpb.update(L,R,-x);\n }\n\n cout<<(dpa.query(0,n/2)==0&&dpb.query(0,n/2)==0)<<\"\\n\";\n // for(int i=0;i<n/2;i++)cout<<dpa.query(i,i+1)<<\" \";\n // cout<<\"\\n\";\n // for(int i=0;i<n/2;i++)cout<<dpb.query(i,i+1)<<\" \";\n // cout<<\"\\n\";\n // cout<<dpa.query(0,n/2)<<\" \"<<dpb.query(0,n/2)<<\"\\n\";\n // cout<<\"\\n\";\n }\n}","accuracy":1,"time_ms":210,"memory_kb":25460,"score_of_the_acc":-0.6812,"final_rank":7},{"submission_id":"aoj_2777_5532400","code_snippet":"#include<bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n//#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"unroll-loops\")\nusing namespace std;\n//#include<boost/multiprecision/cpp_int.hpp>\n//#include<boost/multiprecision/cpp_dec_float.hpp>\n//namespace mp=boost::multiprecision;\n//#define mulint mp::cpp_int\n//#define mulfloat mp::cpp_dec_float_100\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n#define INF (1<<30)\n#define LINF (lint)(1LL<<56)\n#define endl \"\\n\"\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\n#define flc(x) __builtin_popcountll(x)\n#define pint pair<int,int>\n#define pdouble pair<double,double>\n#define plint pair<lint,lint>\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define vec vector<lint>\n#define nep(x) next_permutation(all(x))\ntypedef long long lint;\nint dx[8]={1,1,0,-1,-1,-1,0,1};\nint dy[8]={0,1,1,1,0,-1,-1,-1};\nconst int MAX_N=3e5+5;\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//vector<int> bucket[MAX_N/1000];\nconstexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n/*#include<atcoder/all>\nusing namespace atcoder;\ntypedef __int128_t llint;*/\n\n// Segment Tree Beats\n// - l<=i<r について、 A_i の値を min(A_i, x) に更新\n// - l<=i<r について、 A_i の値を max(A_i, x) に更新\n// - l<=i<r の中の A_i の最大値を求める\n// - l<=i<r の中の A_i の最小値を求める\n// - l<=i<r の A_i の和を求める\n// - l<=i<r について、 A_i の値に x を加える\n// - l<=i<r について、 A_i の値を x に更新\n\nclass SegmentTreeBeats{\n static const lint inf = 1e18;\n struct Node{\n Node *left, *right;\n lint max_v, smax_v, max_c;\n lint min_v, smin_v, min_c;\n lint sum;\n lint len, ladd, lval;\n\n Node() : left(0), right(0), ladd(0), lval(inf) {}\n\n void init(lint x){\n max_v = min_v = sum = x;\n smax_v = -inf;\n smin_v = inf;\n max_c = min_c = 1;\n }\n\n void init_empty(){\n max_v = smax_v = -inf;\n min_v = smin_v = inf;\n max_c = min_c = 0;\n }\n\n void update_max(lint x){\n sum += (x - max_v) * max_c;\n\n if (max_v == min_v){\n max_v = min_v = x;\n }\n else if (max_v == smin_v){\n max_v = smin_v = x;\n }\n else{\n max_v = x;\n }\n\n if (lval != inf && x < lval){\n lval = x;\n }\n }\n\n void update_min(lint x){\n sum += (x - min_v) * min_c;\n\n if (max_v == min_v){\n max_v = min_v = x;\n }\n else if (max_v == smin_v){\n min_v = smax_v = x;\n }\n else{\n min_v = x;\n }\n\n if (lval != inf && lval < x){\n lval = x;\n }\n }\n\n void addalint(lint x)\n {\n max_v += x;\n if (smax_v != -inf) smax_v += x;\n min_v += x;\n if (smin_v != inf) smin_v += x;\n sum += len * x;\n if (lval != inf){\n lval += x;\n }\n else{\n ladd += x;\n }\n }\n\n void updatealint(lint x){\n max_v = min_v = x;\n smax_v = -inf;\n smin_v = inf;\n max_c = min_c = len;\n\n sum = len * x;\n lval = x;\n ladd = 0;\n }\n\n void push(){\n\n if (lval != inf){\n left->updatealint(lval);\n right->updatealint(lval);\n lval = inf;\n return;\n }\n\n if (ladd != 0){\n left->addalint(ladd);\n right->addalint(ladd);\n ladd = 0;\n }\n\n if (max_v < left->max_v){\n left->update_max(max_v);\n }\n if (left->min_v < min_v){\n left->update_min(min_v);\n }\n\n if (max_v < right->max_v){\n right->update_max(max_v);\n }\n if (right->min_v < min_v){\n right->update_min(min_v);\n }\n }\n\n void update(){\n sum = left->sum + right->sum;\n\n if (left->max_v < right->max_v){\n max_v = right->max_v;\n max_c = right->max_c;\n smax_v = max(left->max_v, right->smax_v);\n }\n else if (left->max_v > right->max_v){\n max_v = left->max_v;\n max_c = left->max_c;\n smax_v = max(left->smax_v, right->max_v);\n }\n else{\n max_v = left->max_v;\n max_c = left->max_c + right->max_c;\n smax_v = max(left->smax_v, right->smax_v);\n }\n\n if (left->min_v < right->min_v){\n min_v = left->min_v;\n min_c = left->min_c;\n smin_v = min(left->smin_v, right->min_v);\n }\n else if (left->min_v > right->min_v){\n min_v = right->min_v;\n min_c = right->min_c;\n smin_v = min(left->min_v, right->smin_v);\n }\n else{\n min_v = left->min_v;\n min_c = left->min_c + right->min_c;\n smin_v = min(left->smin_v, right->smin_v);\n }\n }\n };\n\n int n, n0;\n Node *root;\n\n void _update_min(lint x, int a, int b, Node *nd, int l, int r){\n if (b <= l || r <= a || nd->max_v <= x){\n return;\n }\n if (a <= l && r <= b && nd->smax_v < x){\n nd->update_max(x);\n return;\n }\n\n nd->push();\n _update_min(x, a, b, nd->left, l, (l + r) / 2);\n _update_min(x, a, b, nd->right, (l + r) / 2, r);\n nd->update();\n }\n\n void _update_max(lint x, int a, int b, Node *nd, int l, int r){\n if (b <= l || r <= a || x <= nd->min_v){\n return;\n }\n if (a <= l && r <= b && x < nd->smin_v){\n nd->update_min(x);\n return;\n }\n\n nd->push();\n _update_max(x, a, b, nd->left, l, (l + r) / 2);\n _update_max(x, a, b, nd->right, (l + r) / 2, r);\n nd->update();\n }\n\n void _add_val(lint x, int a, int b, Node *nd, int l, int r){\n if (b <= l || r <= a){\n return;\n }\n if (a <= l && r <= b){\n nd->addalint(x);\n return;\n }\n\n nd->push();\n _add_val(x, a, b, nd->left, l, (l + r) / 2);\n _add_val(x, a, b, nd->right, (l + r) / 2, r);\n nd->update();\n }\n\n void _update_val(lint x, int a, int b, Node *nd, int l, int r){\n if (b <= l || r <= a){\n return;\n }\n if (a <= l && r <= b){\n nd->updatealint(x);\n return;\n }\n\n nd->push();\n _update_val(x, a, b, nd->left, l, (l + r) / 2);\n _update_val(x, a, b, nd->right, (l + r) / 2, r);\n nd->update();\n }\n\n lint _query_max(int a, int b, Node *nd, int l, int r){\n if (b <= l || r <= a){\n return -inf;\n }\n if (a <= l && r <= b){\n return nd->max_v;\n }\n nd->push();\n lint lv = _query_max(a, b, nd->left, l, (l + r) / 2);\n lint rv = _query_max(a, b, nd->right, (l + r) / 2, r);\n return max(lv, rv);\n }\n\n lint _query_min(int a, int b, Node *nd, int l, int r){\n if (b <= l || r <= a){\n return inf;\n }\n if (a <= l && r <= b){\n return nd->min_v;\n }\n nd->push();\n lint lv = _query_min(a, b, nd->left, l, (l + r) / 2);\n lint rv = _query_min(a, b, nd->right, (l + r) / 2, r);\n return min(lv, rv);\n }\n\n lint _query_sum(int a, int b, Node *nd, int l, int r){\n if (b <= l || r <= a){\n return 0;\n }\n if (a <= l && r <= b){\n return nd->sum;\n }\n nd->push();\n lint lv = _query_sum(a, b, nd->left, l, (l + r) / 2);\n lint rv = _query_sum(a, b, nd->right, (l + r) / 2, r);\n return lv + rv;\n }\n\npublic:\n SegmentTreeBeats(int n, vector<lint> a) : n(n){\n n0 = 1;\n while (n0 < n) n0 <<= 1;\n\n Node *nds = new Node[2 * n0];\n root = nds;\n\n nds[0].len = n0;\n for (int i = 0; i < n0 - 1; ++i){\n nds[i].left = &nds[2 * i + 1];\n nds[i].right = &nds[2 * i + 2];\n nds[2 * i + 1].len = nds[2 * i + 2].len = (nds[i].len >> 1);\n }\n\n for (int i = 0; i < n; ++i) nds[n0 - 1 + i].init(a[i]);\n for (int i = n; i < n0; ++i) nds[n0 - 1 + i].init_empty();\n for (int i = n0 - 2; i >= 0; i--) nds[i].update();\n }\n SegmentTreeBeats(int n) : n(n){\n n0 = 1;\n while (n0 < n) n0 <<= 1;\n\n Node *nds = new Node[2 * n0];\n root = nds;\n\n nds[0].len = n0;\n for (int i = 0; i < n0 - 1; ++i){\n nds[i].left = &nds[2 * i + 1];\n nds[i].right = &nds[2 * i + 2];\n nds[2 * i + 1].len = nds[2 * i + 2].len = (nds[i].len >> 1);\n }\n\n for (int i = 0; i < n; ++i) nds[n0 - 1 + i].init(0);\n for (int i = n; i < n0; ++i) nds[n0 - 1 + i].init_empty();\n for (int i = n0 - 2; i >= 0; i--) nds[i].update();\n }\n\n void update_min(int a, int b, lint x){\n _update_min(x, a, b, root, 0, n0);\n }\n\n void update_max(int a, int b, lint x){\n _update_max(x, a, b, root, 0, n0);\n }\n\n void add_val(int a, int b, lint x){\n _add_val(x, a, b, root, 0, n0);\n }\n\n void update_val(int a, int b, lint x){\n _update_val(x, a, b, root, 0, n0);\n }\n\n lint query_max(int a, int b){\n return _query_max(a, b, root, 0, n0);\n }\n\n lint query_min(int a, int b){\n return _query_min(a, b, root, 0, n0);\n }\n\n lint query_sum(int a, int b){\n return _query_sum(a, b, root, 0, n0);\n }\n};\n\n\nint main(void){\n int N;\n cin >> N;\n int A[N];\n rep(i,N) cin >> A[i];\n int n=N/2;\n SegmentTreeBeats seg(n);\n rep(i,n) seg.update_val(i,i+1,A[i]);\n for(int i=n;i<N;i++) seg.add_val(n-1+(n-i),n+(n-i),-A[i]);\n int Q;\n cin >> Q;\n rep(i,Q){\n int l,r,x;\n cin >> l >> r >> x;\n l--,r--;\n if(l<n){\n seg.add_val(l,min(n,r+1),x);\n }\n if(r>=n){\n int R=(N-1-l);\n if(l<n) R=n-1;\n int L=(N-1-r);\n seg.add_val(L,R+1,-x);\n }\n bool chk=true;\n if(seg.query_min(0,n)!=0) chk=false;\n if(seg.query_max(0,n)!=0) chk=false;\n if(chk) cout << 1 << endl;\n else cout << 0 << endl;\n }\n}","accuracy":1,"time_ms":270,"memory_kb":54604,"score_of_the_acc":-1.2834,"final_rank":16},{"submission_id":"aoj_2777_4927055","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\nint main(){\n int n;\n cin >> n;\n vector<int> a(n);\n for(int& x : a) cin >> x;\n for(int i = 0; i < n / 2; i++){\n a[i] -= a.rbegin()[i];\n a.rbegin()[i] = -a[i];\n }\n a.push_back(0);\n adjacent_difference(a.begin(), a.end(), a.begin());\n int zero = 0;\n for(int x : a) zero += !x;\n int q;\n cin >> q;\n while(q--){\n int l, r, x;\n cin >> l >> r >> x;\n l--;\n {\n zero -= !a[l];\n a[l] += x;\n zero += !a[l];\n zero -= !a[r];\n a[r] -= x;\n zero += !a[r];\n }\n tie(l, r) = pair{n - r, n - l};\n x = -x;\n {\n zero -= !a[l];\n a[l] += x;\n zero += !a[l];\n zero -= !a[r];\n a[r] -= x;\n zero += !a[r];\n }\n cout << (zero == n + 1) << '\\n';\n }\n}","accuracy":1,"time_ms":200,"memory_kb":8608,"score_of_the_acc":-0.3891,"final_rank":5},{"submission_id":"aoj_2777_4926816","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\n#define LLINF 100000000000000\n\nstruct StarrySkyTree {\n int segn2;\n vector<ll> data, s_data;\n\n StarrySkyTree(int n) {\n for (segn2 = 1; segn2 < n; segn2 *= 2)\n ;\n data.assign(segn2 * 2, 0);\n s_data.assign(segn2 * 2, 0);\n }\n\n ll query(int a, int b, int l = 0, int r = -1, int k = 0) {\n if (r == -1) r = segn2;\n if (r <= a || b <= l) return LLINF;\n if (a <= l && r <= b) return data[k] + s_data[k];\n return min(query(a, b, l, (l + r) / 2, k * 2 + 1), query(a, b, (l + r) / 2, r, k * 2 + 2));\n }\n\n ll add(int a, int b, ll x, int l = 0, int r = -1, int k = 0) {\n if (r == -1) r = segn2;\n if (a <= l && r <= b)\n s_data[k] += x;\n else if (a < r && l < b)\n data[k] = min(add(a, b, x, l, (l + r) / 2, k * 2 + 1), add(a, b, x, (l + r) / 2, r, k * 2 + 2));\n\n return data[k] + s_data[k];\n }\n};\n\nint main() {\n int N;\n\n scanf(\"%d\", &N);\n\n StarrySkyTree seg1(N / 2), seg2(N / 2);\n\n auto add = [&](int l, int r, ll x) {\n if (l < N / 2) {\n seg1.add(l, min(r, N / 2), x);\n seg2.add(l, min(r, N / 2), -x);\n }\n r = N - r;\n l = N - l;\n swap(l, r);\n if (l < N / 2) {\n seg1.add(l, min(r, N / 2), -x);\n seg2.add(l, min(r, N / 2), x);\n }\n };\n\n for (int i = 0; i < N; i++) {\n int S;\n scanf(\"%d\", &S);\n add(i, i + 1, S);\n }\n\n int Q;\n\n scanf(\"%d\", &Q);\n\n for (int i = 0; i < Q; i++) {\n int l, r, x;\n scanf(\"%d%d%d\", &l, &r, &x);\n l--;\n add(l, r, x);\n\n int a = seg1.query(0, N / 2);\n int b = seg2.query(0, N / 2);\n\n puts(a == 0 && b == 0 ? \"1\" : \"0\");\n }\n\n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":19216,"score_of_the_acc":-0.8314,"final_rank":12},{"submission_id":"aoj_2777_4471608","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;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000007LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\n/* do your best */\n\n// quoted from beet-aizu\ntemplate <typename T,typename E, typename F, typename G, typename H>\nstruct LazySegmentTree{\n //using F = function<T(T,T)>;\n //using G = function<T(T,E)>;\n //using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n LazySegmentTree(F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){}\n\n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(const vector<T> &v){\n int n_=v.size();\n init(n_);\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n inline T reflect(int k){\n return laz[k]==ei?dat[k]:g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n inline void thrust(int k){\n for(int i=height;i;i--) eval(k>>i);\n }\n inline void recalc(int k){ \n while(k>>=1)\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));\n }\n void update(int a,int b,E x){\n thrust(a+=n);\n thrust(b+=n-1);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n recalc(a);\n recalc(b);\n }\n void set_val(int a,T x){\n thrust(a+=n);\n dat[a]=x;laz[a]=ei;\n recalc(a);\n }\n T query(int a,int b){\n thrust(a+=n);\n thrust(b+=n-1);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n};\n\n/* \n * [考えるべきこと]\n * 区間をマージしてから作用素を作用させても、作用素を作用させてから区間をマージするのと結果が同じ\n * 複数の作用素をマージして一度に作用させられること\n * 作用素を伝搬し終わっているのかの判定に必要（まあこれは満たされていなくても最悪どうにかなる）\n * O(N) とかだと困る（setのマージとか）\n * 区間の長さに比例して作用が変わるときは，practice/RSRA や Library-Checher の RangeAffineRangeSum を参照する\n * \n */\n\n/** テンプレ\nint main(){\n using T = ***; // type T\n using E = ***; // type E\n auto f = [](T a, T b){ // return type T value\n return ***;\n };\n auto g = [](T a, E b){ // return type T value\n return ***;\n };\n auto h = [](E a, E b){ // return type E value\n return ***;\n };\n T ti = ***; // identity element\n E ei = ***; // identity element\n LazySegmentTree<T, E, decltype(f), decltype(g), decltype(h)> sg(f, g, h, ti, ei); // don't change\n sg.build(***);\n}\n**/\n\n\n#define int long long\n\n\nsigned main() {\n \n int n; cin >> n;\n vector<lint> s(n);\n for (int i = 0; i < n; i++) {\n cin >> s[i];\n }\n\n vector<lint> dat(n / 2);\n for (int i = 0; i < n / 2; i++) {\n dat[i] = s[i] - s[n - i - 1];\n }\n\n auto f1 = [](int a, int b){ return min(a, b); };\n auto g1 = [](int a, int b){ return a + b; };\n auto h1 = [](int a, int b){ return a + b; };\n LazySegmentTree<int, int, decltype(f1), decltype(g1), decltype(h1)> sgmin(f1, g1, h1, INT_MAX, 0);\n sgmin.build(dat);\n\n auto f2 = [](int a, int b){ return max(a, b); };\n auto g2 = [](int a, int b){ return a + b; };\n auto h2 = [](int a, int b){ return a + b; };\n LazySegmentTree<int, int, decltype(f2), decltype(g2), decltype(h2)> sgmax(f2, g2, h2, -INT_MAX, 0);\n sgmax.build(dat);\n \n /*cerr << \"min\" << endl;\n for (int i = 0; i < n / 2; i++) {\n cerr << sgmin.query(i, i + 1) << \" \";\n }\n cerr << endl;\n cerr << \"max\" << endl;\n for (int i = 0; i < n / 2; i++) {\n cerr << sgmax.query(i, i + 1) << \" \";\n }\n cerr << endl;\n */\n\n int q; cin >> q;\n for (int i = 0; i < q; i++) {\n int l, r, x; cin >> l >> r >> x;\n l--;\n r--;\n \n // [0, n / 2)\n // [n / 2, n)\n if (r < n / 2) {\n sgmin.update(l, r + 1, x);\n sgmax.update(l, r + 1, x);\n } else if (l >= n / 2) {\n int ll = n - r - 1;\n int rr = n - l - 1;\n\n sgmin.update(ll, rr + 1, -x);\n sgmax.update(ll, rr + 1, -x);\n } else {\n // cerr << l << \" \" << n / 2 << \" \" << x << endl;\n sgmin.update(l, n / 2, x);\n sgmax.update(l, n / 2, x);\n \n int ll = n - r - 1;\n // cerr << ll << \" \" << n / 2 << \" \" << -x << endl;\n sgmin.update(ll, n / 2, -x);\n sgmax.update(ll, n / 2, -x);\n }\n\n // cerr << \"min\" << endl;\n /*\n for (int i = 0; i < n / 2; i++) {\n cerr << sgmin.query(i, i + 1) << \" \";\n }\n cerr << endl;\n cerr << \"max\" << endl;\n for (int i = 0; i < n / 2; i++) {\n cerr << sgmax.query(i, i + 1) << \" \";\n }\n cerr << endl;\n\n\n // 左 - 右をしているので\n cerr << sgmin.query(0, n / 2) << \" \" << sgmax.query(0, n / 2) << endl;\n\n */\n cout << (sgmin.query(0, n / 2) == 0 and sgmax.query(0, n / 2) == 0) << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":420,"memory_kb":25028,"score_of_the_acc":-1.1515,"final_rank":15},{"submission_id":"aoj_2777_4471497","code_snippet":"#include <iostream>\n#include <vector>\n#include <functional>\nusing namespace std;\n\ntemplate <typename T, typename E>\nstruct LazySegmentTree{\nprivate:\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n int n, height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n T reflect(int k){\n return laz[k] == ei ? dat[k] : g(dat[k],laz[k]);\n }\n void propagate(int k){\n if(laz[k] == ei) return;\n if(k >= n){\n dat[k] = reflect(k);\n laz[k] = ei;\n return;\n }\n laz[k<<1|0] = h(laz[k<<1|0],laz[k]);\n laz[k<<1|1] = h(laz[k<<1|1],laz[k]);\n dat[k] = reflect(k);\n laz[k] = ei;\n }\n void thrust(int k){\n for(int i = height; i >= 0; --i)\n propagate(k>>i);\n }\n void recalc(int k){\n while(k >>= 1){\n dat[k] = f(reflect(k<<1|0),reflect(k<<1|1));\n }\n }\npublic:\n LazySegmentTree(F f,G g, H h, T ti, E ei) :\n f(f), g(g), h(h), ti(ti), ei(ei) {}\n void build(int n_){\n n = n_;\n height = 2;\n while(n_ >>= 1) ++height;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(const vector<T> &v){\n int n_ = v.size();\n build(n_);\n for(int i = 0; i < n; ++i) dat[n+i]=v[i];\n for(int i = n-1; i >= 0; --i)\n dat[i]=f(dat[i<<1|0],dat[i<<1|1]);\n }\n void update(int l_, int r_, E x){\n if(l_ >= r_) return;\n l_ += n, r_ += n;\n thrust(l_);\n thrust(r_-1);\n for(int l = l_, r = r_;l < r; l >>= 1, r >>= 1){\n if(l&1) laz[l] = h(laz[l],x), ++l;\n if(r&1) --r, laz[r] = h(laz[r],x);\n }\n recalc(l_);\n recalc(r_-1);\n }\n void set_val(int a, T x){\n thrust(a+=n);\n dat[a] = x;\n laz[a] = ei;\n recalc(a);\n }\n T query(int l, int r){\n if(l >= r) return ti;\n l += n;\n r += n;\n thrust(l);\n thrust(r-1);\n T vl = ti, vr = ti;\n for(; l < r; l >>= 1, r >>= 1){\n if(l&1) vl = f(vl,reflect(l++));\n if(r&1) vr = f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n};\n\nint main(){\n using ll = long long;\n using T = pair<ll,ll>;\n using E = ll;\n function<T(T,T)> f = [](T a, T b) -> T {\n return {max(a.first,b.first),min(a.second,b.second)};\n };\n function<T(T,E)> g = [](T a, E b) -> T {\n return {a.first+b,a.second+b};\n };\n function<E(E,E)> h = [](E a, E b){\n return a+b;\n };\n const ll INF = 1e9;\n T ti = {-INF,INF};\n E ei = 0;\n LazySegmentTree<T,E> st(f,g,h,ti,ei);\n\n int N;\n cin >> N;\n vector<int> S(N);\n for(int i = 0; i < N; ++i){\n cin >> S[i];\n }\n int n = N/2;\n vector<T> A(n);\n for(int i = 0; i < n; ++i){\n A[i] = {S[i]-S[N-1-i], S[i]-S[N-1-i]};\n }\n\n int Q;\n cin >> Q;\n st.build(A);\n while(Q--){\n int l, r, x;\n cin >> l >> r >> x;\n --l, --r;\n if(l >= n){\n l = n - 1 - (l-n);\n r = n - 1 - (r-n);\n // cerr << l << \" \" << r << endl;\n st.update(r,l+1,-x);\n }else if(r < n){\n st.update(l,r+1,x);\n }else{\n st.update(l,n,x);\n r = n - 1 - (r-n);\n // cerr << r << endl;\n st.update(r,n,-x);\n }\n // for(int i = 0; i < n; ++i){\n // cerr << \"(\" << st.query(i,i+1).first << \", \" << st.query(i,i+1).second << \") \";\n // }\n // cerr << endl;\n cout << (st.query(0,n) == make_pair(0LL,0LL)) << \"\\n\";\n }\n}","accuracy":1,"time_ms":380,"memory_kb":20492,"score_of_the_acc":-0.9881,"final_rank":13},{"submission_id":"aoj_2777_4096580","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n// Segment Tree\ntemplate<class Monoid, class Action> struct SegTree {\n using FuncMonoid = function< Monoid(Monoid, Monoid) >;\n using FuncAction = function< void(Monoid&, Action) >;\n using FuncLazy = function< void(Action&, Action) >;\n FuncMonoid FM;\n FuncAction FA;\n FuncLazy FL;\n Monoid UNITY_MONOID;\n Action UNITY_LAZY;\n int SIZE, HEIGHT;\n vector<Monoid> dat;\n vector<Action> lazy;\n\n SegTree() { }\n SegTree(int n, const FuncMonoid fm, const FuncAction fa, const FuncLazy fl,\n const Monoid &unity_monoid, const Action &unity_lazy)\n : FM(fm), FA(fa), FL(fl), UNITY_MONOID(unity_monoid), UNITY_LAZY(unity_lazy) {\n SIZE = 1; HEIGHT = 0;\n while (SIZE < n) SIZE <<= 1, ++HEIGHT;\n dat.assign(SIZE * 2, UNITY_MONOID);\n lazy.assign(SIZE * 2, UNITY_LAZY);\n }\n void init(int n, const FuncMonoid fm, const FuncAction fa, const FuncLazy fl,\n const Monoid &unity_monoid, const Action &unity_lazy) {\n FM = fm; FA = fa; FL = fl;\n UNITY_MONOID = unity_monoid; UNITY_LAZY = unity_lazy;\n SIZE = 1; HEIGHT = 0;\n while (SIZE < n) SIZE <<= 1, ++HEIGHT;\n dat.assign(SIZE * 2, UNITY_MONOID);\n lazy.assign(SIZE * 2, UNITY_LAZY);\n }\n\n /* set, a is 0-indexed */\n void set(int a, const Monoid &v) { dat[a + SIZE] = v; }\n void build() {\n for (int k = SIZE - 1; k > 0; --k)\n dat[k] = FM(dat[k*2], dat[k*2+1]);\n }\n\n /* update [a, b) */\n inline void evaluate(int k) {\n if (lazy[k] == UNITY_LAZY) return;\n if (k < SIZE) FL(lazy[k*2], lazy[k]), FL(lazy[k*2+1], lazy[k]);\n FA(dat[k], lazy[k]);\n lazy[k] = UNITY_LAZY;\n }\n inline void update(int a, int b, const Action &v, int k, int l, int r) {\n evaluate(k);\n if (a <= l && r <= b) FL(lazy[k], v), evaluate(k);\n else if (a < r && l < b) {\n update(a, b, v, k*2, l, (l+r)>>1), update(a, b, v, k*2+1, (l+r)>>1, r);\n dat[k] = FM(dat[k*2], dat[k*2+1]);\n }\n }\n inline void update(int a, int b, const Action &v) { update(a, b, v, 1, 0, SIZE); }\n\n /* get [a, b) */\n inline Monoid get(int a, int b, int k, int l, int r) {\n evaluate(k);\n if (a <= l && r <= b)\n return dat[k];\n else if (a < r && l < b)\n return FM(get(a, b, k*2, l, (l+r)>>1), get(a, b, k*2+1, (l+r)>>1, r));\n else\n return UNITY_MONOID;\n }\n inline Monoid get(int a, int b) { return get(a, b, 1, 0, SIZE); }\n inline Monoid operator [] (int a) { return get(a, a+1); }\n /* debug */\n void print() {\n for (int i = 0; i < SIZE; ++i) { cout << (*this)[i]; if (i != SIZE) cout << \",\"; }\n cout << endl;\n }\n};\n\nsigned main(){\n ios::sync_with_stdio(false);\n\tcin.tie(0);\n cout << fixed << setprecision(20);\n\n ll m;\n cin>>m;\n ll a[m];\n for(int i=0;i<m;i++){\n cin>>a[i];\n }\n ll n = m/2;\n ll INF = 1e10;\n auto fm = [](long long a, long long b) { return max(a,b);};\n auto fm2 = [](ll a,ll b){ return min(a,b);};\n auto fa = [](long long &a, long long d) { a = a + d; };\n auto fl = [](long long &d, long long e) { d = d + e; };\n SegTree<long long, long long> seg(n+1, fm, fa, fl, 0, 0);\n SegTree<ll,ll> seg2(n+1,fm2,fa,fl,0,0);\n\n for(int i=0;i<n;i++){\n seg.update(i,i+1,a[i]-a[m-1-i]);\n seg2.update(i,i+1,a[i]-a[m-1-i]);\n }\n int q;\n cin>>q;\n while(q--){\n ll a,b,x;\n cin>>a>>b>>x;\n a--,b--;\n seg.update(min(a,n),min(b+1,n),x);\n seg2.update(min(a,n),min(b+1,n),x);\n seg.update(min(m-1-b,n),min(m-a,n),-x);\n seg2.update(min(m-1-b,n),min(n,m-a),-x);\n\n // cerr << \"d1 \"<<min(a,n) << \" \" << min(b+1,n) <<endl;\n // cerr << \"d2 \"<<min(n,m-b) << \" \" << min(m-a,n) << endl;\n // cerr<< seg.get(0,n) << \" \" << seg2.get(0,n) << \" \";\n if(seg.get(0,n) == 0 && seg2.get(0,n)==0){\n cout << 1 << \"\\n\";\n }\n else cout <<0 << \"\\n\";\n }\n}","accuracy":1,"time_ms":380,"memory_kb":23168,"score_of_the_acc":-1.0309,"final_rank":14},{"submission_id":"aoj_2777_4096071","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n\nusing namespace std;\n\nconstexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\n//constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-8;\n\n//int N, M, K, H, W, L, R;\nlong long int N, M, K, H, W, L, R;\n\nclass Segment_Tree {\n\tvector<long long int>v;\n\tvector<long long int>add;\n\tvector<long long int>modi;\n\tvector<int>l;\n\tvector<int>r;\n\tint num;\n\tlong long int ret;\n\tbool is_min;\n\tvoid Left(int place) {\n\t\tif (place >= v.size() / 2) {\n\t\t\tl[place] = place - v.size() / 2;\n\t\t\treturn;\n\t\t}\n\t\tLeft(place * 2);\n\t\tLeft(place * 2 + 1);\n\t\tl[place] = l[place * 2];\n\t\treturn;\n\t}\n\tvoid Right(int place) {\n\t\tif (place >= v.size() / 2) {\n\t\t\tr[place] = place - v.size() / 2;\n\t\t\treturn;\n\t\t}\n\t\tRight(place * 2);\n\t\tRight(place * 2 + 1);\n\t\tr[place] = r[place * 2 + 1];\n\t\treturn;\n\t}\n\tlong long int Update(int place) {\n\t\tif (place >= v.size() / 2) {\n\t\t\treturn v[place];\n\t\t}\n\t\tif (is_min) {\n\t\t\tv[place] = min(Update(place * 2), Update(place * 2 + 1));\n\t\t\treturn v[place];\n\t\t}\n\t\tv[place] = max(Update(place * 2), Update(place * 2 + 1));\n\t\treturn v[place];\n\t}\n\tvoid Modify(int a, int b, long long int num, int place) {\n\t\tif (l[place] >= a && r[place] <= b) {\n\t\t\tmodi[place] = num;\n\t\t\tv[place] = num;\n\t\t\tadd[place] = 0;\n\t\t\treturn;\n\t\t}\n\t\tif (l[place] > b || r[place] < a)return;\n\t\tif (modi[place] != LLONG_MAX) {\n\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\n\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place];\n\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\tmodi[place] = LLONG_MAX;\n\t\t}\n\t\tadd[place * 2] += add[place];\n\t\tadd[place * 2 + 1] += add[place];\n\t\tadd[place] = 0;\n\t\tModify(a, b, num, place * 2);\n\t\tModify(a, b, num, place * 2 + 1);\n\t\tif (is_min)v[place] = min(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\n\t\telse v[place] = max(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\n\t\treturn;\n\t}\n\tvoid Add(int a, int b, long long int num, int place) {\n\t\tif (l[place] >= a && r[place] <= b) {\n\t\t\tif (modi[place] != LLONG_MAX) {\n\t\t\t\tif (place * 2 < v.size()) {\n\t\t\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\n\t\t\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place];\n\t\t\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\t\t}\n\t\t\t\tmodi[place] = LLONG_MAX;\n\t\t\t}\n\t\t\tadd[place] += num;\n\t\t\treturn;\n\t\t}\n\t\tif (l[place] > b || r[place] < a)return;\n\t\tif (modi[place] != LLONG_MAX) {\n\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\n\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place];\n\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\tmodi[place] = LLONG_MAX;\n\t\t}\n\t\tadd[place * 2] += add[place];\n\t\tadd[place * 2 + 1] += add[place];\n\t\tadd[place] = 0;\n\t\tAdd(a, b, num, place * 2);\n\t\tAdd(a, b, num, place * 2 + 1);\n\t\tif (is_min)v[place] = min(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\n\t\telse v[place] = max(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\n\t\treturn;\n\t}\n\tvoid RMQ(int a, int b, int place) {\n\t\tif (l[place] >= a && r[place] <= b) {\n\t\t\tif (modi[place] != LLONG_MAX) {\n\t\t\t\tif (place * 2 < v.size()) {\n\t\t\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\n\t\t\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place];\n\t\t\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\t\t}\n\t\t\t\tmodi[place] = LLONG_MAX;\n\t\t\t}\n\t\t\tif (is_min)ret = min(ret, v[place] + add[place]);\n\t\t\telse ret = max(ret, v[place] + add[place]);\n\t\t\treturn;\n\t\t}\n\t\tif (l[place]>b || r[place]<a) return;\n\t\tif (modi[place] != LLONG_MAX) {\n\t\t\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\n\t\t\tv[place * 2] = v[place * 2 + 1] = modi[place];\n\t\t\tadd[place * 2] = add[place * 2 + 1] = 0;\n\t\t\tmodi[place] = LLONG_MAX;\n\t\t}\n\t\tadd[place * 2] += add[place];\n\t\tadd[place * 2 + 1] += add[place];\n\t\tadd[place] = 0;\n\t\tRMQ(a, b, place * 2);\n\t\tRMQ(a, b, place * 2 + 1);\n\t\tif (is_min)v[place] = min(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\n\t\telse v[place] = max(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\n\t\treturn;\n\t}\npublic:\n\tSegment_Tree(int n, bool min) {\n\t\tn++;\n\t\tnum = 1;\n\t\twhile (num < n * 2) {\n\t\t\tnum *= 2;\n\t\t}\n\t\tl.resize(num);\n\t\tr.resize(num);\n\t\tis_min = min;\n\t\tif (min) {\n\t\t\tv.resize(num, MOD*MOD);\n\t\t}\n\t\telse v.resize(num, -MOD * MOD);\n\t\tadd.resize(num, 0);\n\t\tmodi.resize(num, MOD*MOD);\n\t\tLeft(1);\n\t\tRight(1);\n\t}\n\tvoid Insert(int place, long long int num, bool update) {\n\t\tplace += v.size() / 2;\n\t\tv[place] = num;\n\t\tif (!update)return;\n\t\tplace /= 2;\n\t\twhile (place) {\n\t\t\tif (is_min)v[place] = min(v[place * 2], v[place * 2 + 1]);\n\t\t\telse v[place] = max(v[place * 2], v[place * 2 + 1]);\n\t\t\tplace /= 2;\n\t\t}\n\t}\n\tvoid Modify(int a, int b, long long int num) {\n\t\tModify(a, b, num, 1);\n\t}\n\tvoid Add(int a, int b, long long int num) {\n\t\tAdd(a, b, num, 1);\n\t}\n\tvoid Init() {\n\t\tUpdate(1);\n\t}\n\tlong long int RMQ(int a, int b) {\n\t\tif (is_min)ret = LLONG_MAX;\n\t\telse ret = LLONG_MIN;\n\t\tRMQ(a, b, 1);\n\t\treturn ret;\n\t}\n};\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tlong long int sum = 0;\n\tcin >> N;\n\tSegment_Tree sg(N/2, true);\n\tvector<int>v(N);\n\tfor (auto &i : v)cin >> i;\n\tvector<long long int>w(N / 2);\n\tfor (int i = 0; i < N / 2; i++) {\n\t\tw[i] = v[i] - v[N - 1 - i];\n\t\tsum += w[i];\n\t\tsg.Modify(i, i, w[i]);\n\t}\n\tcin >> K;\n\twhile (K--) {\n\t\tcin >> L >> R >> M;\n\t\tL--, R--;\n\t\tif (R < N / 2) {\n\t\t\tsum += M * (R - L + 1);\n\t\t\tsg.Add(L, R, M);\n\t\t}\n\t\telse if (L >= N - N / 2) {\n\t\t\tsum -= M * (R - L + 1);\n\t\t\tsg.Add(N - 1 - R, N - 1 - L, -M);\n\t\t}\n\t\telse {\n\t\t\tsum += M * (N / 2 - L);\n\t\t\tsg.Add(L, N / 2, M);\n\t\t\tsum -= M * (R + 1 - (N - (N / 2)));\n\t\t\tsg.Add(N - 1 - R, N / 2, -M);\n\t\t}\n\t\tif (sg.RMQ(0, N/2) == 0 && !sum)cout << 1 << endl;\n\t\telse cout << 0 << endl;\n\t}\n}","accuracy":1,"time_ms":270,"memory_kb":23188,"score_of_the_acc":-0.7812,"final_rank":8},{"submission_id":"aoj_2777_3967954","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\ntemplate <typename MonoidType, typename OperatorType>\nstruct LazySegmentTree {\n using MMtoM = function< MonoidType(MonoidType, MonoidType) >;\n using OOtoO = function< OperatorType(OperatorType, OperatorType) >;\n using MOtoM = function< MonoidType(MonoidType, OperatorType) >;\n using OItoO = function< OperatorType(OperatorType, int) >;\n\n // node, lazy, update flag (for lazy), identity element\n int n;\n vector<MonoidType> node;\n vector<OperatorType> lazy;\n vector<bool> need_update;\n MonoidType E0;\n OperatorType E1;\n\n // update / combine / lazy / accumulate function\n MOtoM upd_f;\n MMtoM cmb_f;\n OOtoO lzy_f;\n OItoO acc_f;\n\n void build(int m, vector<MonoidType> v = vector<MonoidType>()) {\n if(v != vector<MonoidType>()) m = v.size();\n n = 1; while(n < m) n *= 2;\n\n node = vector<MonoidType>(2*n-1, E0);\n lazy = vector<OperatorType>(2*n-1, E1);\n need_update = vector<bool>(2*n-1, false);\n if(v != vector<MonoidType>()) {\n for(int i=0; i<m; i++) {\n node[n-1+i] = v[i];\n }\n for(int i=n-2; i>=0; i--) {\n node[i] = cmb_f(node[2*i+1], node[2*i+2]);\n }\n }\n }\n\n // initialize\n LazySegmentTree() {}\n LazySegmentTree(int n_, MonoidType E0_, OperatorType E1_,\n MOtoM upd_f_, MMtoM cmb_f_, OOtoO lzy_f_, OItoO acc_f_,\n vector<MonoidType> v = vector<MonoidType>()) :\n E0(E0_), E1(E1_),\n upd_f(upd_f_), cmb_f(cmb_f_), lzy_f(lzy_f_), acc_f(acc_f_) {\n build(n_, v);\n }\n\n void eval(int k, int l, int r) {\n if(!need_update[k]) return;\n node[k] = upd_f(node[k], acc_f(lazy[k], r - l));\n if(r - l > 1) {\n lazy[2*k+1] = lzy_f(lazy[2*k+1], lazy[k]);\n lazy[2*k+2] = lzy_f(lazy[2*k+2], lazy[k]);\n need_update[2*k+1] = need_update[2*k+2] = true;\n }\n lazy[k] = E1;\n need_update[k] = false;\n }\n\n void update(int a, int b, OperatorType x, int l, int r, int k) {\n eval(k, l, r);\n if(b <= l or r <= a) return;\n if(a <= l and r <= b) {\n lazy[k] = lzy_f(lazy[k], x);\n need_update[k] = true;\n eval(k, l, r);\n }\n else {\n int mid = (l + r) / 2;\n update(a, b, x, l, mid, 2*k+1);\n update(a, b, x, mid, r, 2*k+2);\n node[k] = cmb_f(node[2*k+1], node[2*k+2]);\n }\n }\n\n MonoidType query(int a, int b, int l, int r, int k) {\n if(b <= l or r <= a) return E0;\n eval(k, l, r);\n if(a <= l and r <= b) return node[k];\n int mid = (l + r) / 2;\n MonoidType vl = query(a, b, l, mid, 2*k+1);\n MonoidType vr = query(a, b, mid, r, 2*k+2);\n return cmb_f(vl, vr);\n }\n\n // update [a, b)-th element (applied value, x)\n void update(int a, int b, OperatorType x) {\n update(a, b, x, 0, n, 0);\n }\n\n // range query for [a, b)\n MonoidType query(int a, int b) {\n return query(a, b, 0, n, 0);\n }\n\n void dump() {\n fprintf(stderr, \"[lazy]\\n\");\n for(int i=0; i<2*n-1; i++) {\n if(i == n-1) fprintf(stderr, \"xxx \");\n if(lazy[i] == E1) fprintf(stderr, \" E \");\n else fprintf(stderr, \"%3d \", lazy[i]);\n }\n fprintf(stderr, \"\\n\");\n\n fprintf(stderr, \"[node]\\n\");\n for(int i=0; i<2*n-1; i++) {\n if(i == n-1) fprintf(stderr, \"xxx \");\n if(node[i] == E0) fprintf(stderr, \" E \");\n else fprintf(stderr, \"%3d \", node[i]);\n }\n fprintf(stderr, \"\\n\");\n }\n};\n\nint main() {\n int N; cin >> N;\n vector<int> A(N);\n for(int i=0; i<N; i++) cin >> A[i];\n\n // 差分: 左 - 右\n vector<int> B(N);\n int H = N / 2;\n for(int i=0; i<H; i++) {\n B[i] = A[i] - A[N-1-i];\n }\n\n using PI = pair<ll, ll>;\n\n const PI E0(LONGINF, -LONGINF);\n const ll E1 = 0;\n LazySegmentTree<PI, ll> seg(H, E0, E1,\n [](PI a, ll b) {\n a.first += b;\n a.second += b;\n return a;\n },\n [](PI a, PI b) {\n ll x = min(a.first, b.first);\n ll y = max(a.second, b.second);\n return make_pair(x, y);\n },\n [](ll a, ll b) {\n return a + b;\n },\n [](ll a, int x) {\n return a;\n },\n vector<PI>(H, make_pair(0, 0)));\n for(int i=0; i<H; i++) seg.update(i, i+1, B[i]);\n\n int Q; cin >> Q;\n for(int i=0; i<Q; i++) {\n int l, r, x; cin >> l >> r >> x; l--;\n\n int dl = max(H - l, 0);\n int dr = max(r - H, 0);\n\n int d = min(dl, dr);\n // fprintf(stderr, \"### query %d: d = %d\\n\", i, d);\n if(d > 0) {\n int ql = l, qr = H - d;\n // fprintf(stderr, \"? 1: l = %d, r = %d\\n\", ql, qr);\n if(ql < qr) {\n // fprintf(stderr, \"q1: l = %d, r = %d\\n\", ql, qr);\n seg.update(ql, qr, x);\n }\n }\n if(d > 0) {\n int ql = N - r, qr = H - d;\n // fprintf(stderr, \"? 2: l = %d, r = %d\\n\", ql, qr);\n if(ql < qr) {\n // fprintf(stderr, \"q2: l = %d, r = %d\\n\", ql, qr);\n seg.update(ql, qr, -x);\n }\n }\n if(d == 0) {\n int ql = l, qr = r;\n if(ql >= H) {\n swap(ql, qr);\n ql = N - ql, qr = N - qr, x = -x;\n }\n // fprintf(stderr, \"q3: l = %d, r = %d\\n\", ql, qr);\n seg.update(ql, qr, x);\n }\n\n auto res = seg.query(0, H);\n if(res.first == 0 and res.second == 0) cout << 1 << endl;\n else cout << 0 << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":480,"memory_kb":26868,"score_of_the_acc":-1.3173,"final_rank":17},{"submission_id":"aoj_2777_3858356","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=pair<ll,pll>;\nusing tuplis2=pair<pll,ll>;\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 ll MOD=1000000007;\nconst ll MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.141592653589793238462643383279;\nconst vector<ll>four{0,1,0,-1,0};\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,a) for(auto &i:a)\n#define sum(...) accumulate(range(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(range(__VA_ARGS__),double(0))\n#define _range(i) (i).begin(),(i).end()\n#define _range2(i,k) (i).begin(),(i).begin()+k\n#define _range3(i,a,b) (i).begin()+a,(i).begin()+b\n#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)\n#define _rrange(i) (i).rbegin(),(i).rend()\n#define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k\n#define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__)\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 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,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ninline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;while(b){ll c=b;b=a%b;a=c;}return a;}\ninline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,b);}\ntemplate<class T> inline constexpr T min(vector<T> &v){return *min_element(range(v));}\ninline char min(string &v){return *min_element(range(v));}\ntemplate<class T> inline constexpr T max(vector<T> &v){return *max_element(range(v));}\ninline char max(string &v){return *max_element(range(v));}\ninline constexpr ll intpow(ll a,ll b){ll ans=1;for(ll i=1;b;i*=2){if(b&i){b^=i;ans*=a;}a*=a;}return ans;}\ntemplate<typename T>\ninline constexpr bool chmin(T &mn,const T &cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}\ntemplate<typename T>\ninline constexpr bool chmax(T &mx,const T &cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}\ntemplate<class T> unordered_map<T,ll> press(vector<T> &a){ auto b = a; sort(range(b)); b.erase(unique(range(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(range(b)); b.erase(unique(range(b)), b.end()); map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }\ninline int scan(){ return getchar(); }\ninline void scan(int &a){ scanf(\"%d\", &a); }\ninline void scan(unsigned &a){ scanf(\"%u\", &a); }\ninline void scan(long &a){ scanf(\"%ld\", &a); }\ninline void scan(long long &a){ scanf(\"%lld\", &a); }\ninline void scan(unsigned long long &a){ scanf(\"%llu\", &a); }\ninline void scan(char &a){ cin >> a; }\ninline void scan(float &a){ scanf(\"%f\", &a); }\ninline void scan(double &a){ scanf(\"%lf\", &a); }\ninline void scan(long double &a){ scanf(\"%Lf\", &a); }\ninline void scan(vector<bool> &vec){ for(unsigned i = 0; i < vec.size(); i++) { int a; scan(a); vec[i] = a; } }\ninline void scan(string &a){ cin >> a; }\ntemplate<class T> inline void scan(vector<T> &vec);\ntemplate<class T, size_t size> inline void scan(array<T, size> &vec);\ntemplate<class T, class L> inline void scan(pair<T, L> &p);\ntemplate<class T, size_t size> inline void scan(T (&vec)[size]);\ntemplate<class T> inline void scan(vector<T> &vec){ for(auto &i : vec) scan(i); }\ntemplate<class T, size_t size> inline void scan(array<T, size> &vec){ for(auto &i : vec) scan(i); }\ntemplate<class T, class L> inline void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> inline void scan(T (&vec)[size]){ for(auto &i : vec) scan(i); }\ntemplate<class T> inline void scan(T &a){ cin>>a; }\ninline void in(){}\ntemplate <class Head, class... Tail> inline void in(Head &head, Tail&... tail){ scan(head); in(tail...); }\ninline void print(){ putchar(' '); }\ninline void print(const bool &a){ printf(\"%d\", a); }\ninline void print(const int &a){ printf(\"%d\", a); }\ninline void print(const unsigned &a){ printf(\"%u\", a); }\ninline void print(const long &a){ printf(\"%ld\", a); }\ninline void print(const long long &a){ printf(\"%lld\", a); }\ninline void print(const unsigned long long &a){ printf(\"%llu\", a); }\ninline void print(const char &a){ printf(\"%c\", a); }\ninline void print(const char a[]){ printf(\"%s\", a); }\ninline void print(const float &a){ printf(\"%.15f\", a); }\ninline void print(const double &a){ printf(\"%.15f\", a); }\ninline void print(const long double &a){ printf(\"%.15Lf\", a); }\ntemplate<class T> void print(const vector<T> &vec);\ntemplate<class T, size_t size> void print(const array<T, size> &vec);\ntemplate<class T, class L> void print(const pair<T, L> &p);\ntemplate<class T, size_t size> inline void print(const T (&vec)[size]);\ntemplate<class T> void print(const vector<T> &vec){ if(vec.empty()) return; print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size> &vec){ print(vec[0]); for(auto i = vec.begin(); ++i != vec.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> inline void print(const T (&vec)[size]){ print(vec[0]); for(auto i = vec; ++i != end(vec); ){ putchar(' '); print(*i); } }\ntemplate<class T> inline void print(const T &a){ cout << a; }\ninline int out(){ putchar('\\n'); return 0; }\ntemplate<class T> inline int out(const T &t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> inline int out(const Head &head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\ntemplate <class T> inline void err(T t){cerr<<t<<'\\n';}\ninline void err(){cerr<<'\\n';}\ninline int first(const bool &i){return out(i?\"first\":\"second\");}\ninline int yes(const bool &i){return out(i?\"yes\":\"no\");}\ninline int Yes(const bool &i){return out(i?\"Yes\":\"No\");}\ninline int YES(const bool &i){return out(i?\"YES\":\"NO\");}\ninline int Yay(const bool &i){return out(i?\"Yay!\":\":(\");}\ninline int Possible(const bool &i){return out(i?\"Possible\":\"Impossible\");}\ninline int POSSIBLE(const bool &i){return out(i?\"POSSIBLE\":\"IMPOSSIBLE\");}\ninline void Case(ll i){printf(\"Case #%lld: \",i);}\n\n\n\ntemplate<class T>\nstruct SegmentTree{\n using F = function<T(T, T)>;\n ll size = 1;\n vector<T> data;\n const F f;\n const T def_value;\n SegmentTree(ll n, const T& def_value, const F& f): f(f), def_value(def_value){\n while(size < n) size *= 2;\n data.assign(size * 2, def_value);\n }\n SegmentTree(const vector<T>& v, const T& def_value, const F& f): f(f), def_value(def_value){\n while(size < v.size()) size *= 2;\n data.assign(size * 2, def_value);\n for(ll i = 0; i < v.size(); i++) data[size + i] = v[i];\n for(ll i = size; --i;) data[i] = f(data[i * 2], data[i * 2 + 1]);\n }\n T operator[](ll at) const {\n return data[size + at];\n }\n void update(ll at){\n while(at /= 2) data[at] = f(data[at * 2], data[at * 2 + 1]);\n }\n void set(ll at, const T& val){\n at += size;\n data[at] = val;\n update(at);\n }\n void add(ll at, const T& val){\n at += size;\n data[at] += val;\n update(at);\n }\n T get(ll l, ll r) const {\n T L = def_value, R = def_value;\n l += size; r += size;\n for(; l < r; l /= 2, r /= 2){\n if(l & 1) L = f(L, data[l++]);\n if(r & 1) R = f(data[--r], R);\n }\n return f(L, R);\n }\n void clear(){\n for(auto& i : data) i = def_value;\n }\n};\ntemplate<class T>\nstruct SegmentTreeMin : SegmentTree<T>{\n SegmentTreeMin(ll n, const T& def_value) : SegmentTree<T>(n, def_value, [](T a, T b){return min(a, b);}){}\n SegmentTreeMin(const vector<T>& v, const T& def_value) : SegmentTree<T>(v, def_value, [](T a, T b){return min(a, b);}){}\n};\ntemplate<class T>\nstruct SegmentTreeMax : SegmentTree<T>{\n SegmentTreeMax(ll n, const T& def_value) : SegmentTree<T>(n, def_value, [](T a, T b){return max(a, b);}){}\n SegmentTreeMax(const vector<T>& v, const T& def_value) : SegmentTree<T>(v, def_value, [](T a, T b){return max(a, b);}){}\n};\ntemplate<class T>\nstruct SegmentTreeSum : SegmentTree<T>{\n SegmentTreeSum(ll n, const T& def_value = T()) : SegmentTree<T>(n, def_value, [](T a, T b){return a + b;}){}\n SegmentTreeSum(const vector<T>& v, const T& def_value = T()) : SegmentTree<T>(v, def_value, [](T a, T b){return a + b;}){}\n};\nsigned main(){\n LL(n);\n VEC(ll,a,n);\n rep(n/2)a[i]-=a[n-1-i];\n a.resize(n/=2);\n vec(ll,b,n+1);\n b[0]=a[0];\n rep(n-1)b[i+1]=a[i+1]-a[i];\n b[n]=-sum(b);\n SegmentTreeMax<ll>seg(b,0);\n LL(q);\n rep(_,q){\n LL(l,r,x);\n if(r<=n){\n seg.add(l-1,x);\n seg.add(r,-x);\n }\n elif(l>n){\n l=2*n-l;\n r=2*n-r;\n seg.add(r,-x);\n seg.add(l+1,x);\n }\n else{\n seg.add(l-1,x);\n r=2*n-r;\n seg.add(r,-x);\n }\n out(!seg.data[1]);\n }\n}","accuracy":1,"time_ms":70,"memory_kb":12844,"score_of_the_acc":-0.1613,"final_rank":2},{"submission_id":"aoj_2777_3234237","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2777.cc: Kitsuchiri\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 500000;\nconst int MAX_M = MAX_N / 2; // = 250000\nconst int MAX_E2 = 1 << 19; // = 524288\nconst int INF = 1 << 30;\n\n/* typedef */\n\ntemplate <typename T, const int MAX_E2>\nstruct SegTreeSumMinMax {\n int n, e2, inf;\n T sums[MAX_E2], mins[MAX_E2], maxs[MAX_E2], ds[MAX_E2];\n SegTreeSumMinMax() {}\n\n void init(int _n, int _inf) {\n n = _n, inf = _inf;\n for (e2 = 1; e2 < n; e2 <<= 1);\n fill(sums, sums + MAX_E2, 0);\n fill(mins, mins + MAX_E2, inf);\n fill(maxs, maxs + MAX_E2, -inf);\n fill(ds, ds + MAX_E2, 0);\n }\n\n void set(int i, T v) { sums[e2 - 1 + i] = v; }\n \n void setall() {\n for (int i = e2 * 2 - 2; i >= e2 - 1; i--)\n mins[i] = maxs[i] = sums[i];\n for (int i = e2 - 2; i >= 0; i--) {\n int i0 = i * 2 + 1, i1 = i0 + 1;\n sums[i] = sums[i0] + sums[i1];\n mins[i] = min(mins[i0], mins[i1]);\n maxs[i] = max(maxs[i0], maxs[i1]);\n }\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 sums[k] += v, mins[k] += v, maxs[k] += v, ds[k] += v;\n return;\n }\n\n int im = (i0 + i1) / 2, k0 = k * 2 + 1, k1 = k0 + 1;\n if (ds[k] != 0) {\n sums[k0] += ds[k], mins[k0] += ds[k], maxs[k0] += ds[k], ds[k0] += ds[k];\n sums[k1] += ds[k], mins[k1] += ds[k], maxs[k1] += ds[k], ds[k1] += ds[k];\n ds[k] = 0;\n }\n\n add_range(r0, r1, v, k0, i0, im);\n add_range(r0, r1, v, k1, im, i1);\n\n sums[k] = sums[k0] + sums[k1];\n mins[k] = min(mins[k0], mins[k1]);\n maxs[k] = max(maxs[k0], maxs[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\nint as[MAX_N];\nSegTreeSumMinMax<int,MAX_E2> st;\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 int m = n / 2;\n\n st.init(m, INF);\n for (int i = 0; i < m; i++) st.set(i, as[i] - as[n - 1 - i]);\n st.setall();\n\n int q;\n scanf(\"%d\", &q);\n while (q--) {\n int l, r, x;\n scanf(\"%d%d%d\", &l, &r, &x);\n l--;\n\n if (r <= m) st.add_range(l, r, x);\n else if (m <= l) st.add_range(n - r, n - l, -x);\n else {\n int l0 = m - l, r0 = r - m;\n if (l0 > r0) st.add_range(l, n - r, x);\n else if (l0 < r0) st.add_range(n - r, l, -x);\n }\n\n printf(\"%d\\n\", (st.mins[0] == 0 && st.maxs[0] == 0) ? 1 : 0);\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":13348,"score_of_the_acc":-0.283,"final_rank":3},{"submission_id":"aoj_2777_2917979","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\"; return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \" \";} return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \"{ \"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \":\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \", \"; } out << \" }\"; return out; }\n\n/* [0..N-1] */\nconst ll INIT = 0; // 問題に合わせる\nstruct SegTree {\n int N;\n ll init_v;\n vector<pll> node;\n vector<ll> lazy;\n \n SegTree(int _N):init_v(INIT) {\n N = 1;\n while (N < _N) N *= 2;\n node.resize(2 * N - 1, {init_v,init_v});\n lazy.resize(2 * N - 1, init_v);\n }\n pll merge(pll a, pll b) {\n pll ret = pll(-1e9, 1e9);\n ret.first = max(a.first, b.first);\n ret.second = min(a.second, b.second);\n return ret;\n }\n void lazy_evaluate(int l, int r,int k){\n node[k].first += lazy[k];\n node[k].second += lazy[k];\n if(r - l > 1){\n lazy[2 * k + 1] += lazy[k];\n lazy[2 * k + 2] += lazy[k];\n }\n lazy[k] = 0;\n }\n \n /* [a,b) 引数の範囲に注意!! s~tまでを更新→update(s,t+1,~) */\n void update(int a, int b, ll x) { update(a, b, 0, 0, N, x); }\n void update(int a, int b, int k, int l, int r, ll x) {\n lazy_evaluate(l,r,k);\n if (r <= a || b <= l) return;\n if (a <= l && r <= b) {\n lazy[k] += x;\n lazy_evaluate(l,r,k);\n }\n else {\n update(a, b, 2 * k + 1, l, (l + r) / 2, x);\n update(a, b, 2 * k + 2, (l + r) / 2, r, x);\n node[k] = merge(node[2 * k + 1],node[2 * k + 2]);\n }\n }\n \n /* [a,b) 引数の範囲に注意!! */\n pll query(int a, int b) { return query(a, b, 0, 0, N); }\n pll query(int a, int b, int k, int l, int r) {\n lazy_evaluate(l, r, k);\n if (r <= a || b <= l) return {-INF,INF}; // min : LLONG_MAX , max : LLONG_MIN\n if (a <= l && r <= b) {\n return node[k];\n }\n else {\n pll vl = query(a, b, 2 * k + 1, l, (l + r) / 2);\n pll vr = query(a, b, 2 * k + 2, (l + r) / 2, r);\n return merge(vl, vr);\n }\n }\n};\n\nvoid solve() {\n int N; cin >> N;\n vector<ll> kassa(N); for (auto& in : kassa) cin >> in;\n int Q; cin >> Q;\n int S = N / 2;\n SegTree ST(S);\n for (int i = 0; i < S; i++) {\n ST.update(i, i + 1, kassa[i]);\n }\n for (int i = S; i < N; i++) {\n ST.update(N - i - 1, N - i, -kassa[i]);\n }\n while (Q--) {\n int l, r, x; cin >> l >> r >> x;\n l--; r--;\n if (r < S) {\n ST.update(l, r + 1, x);\n }\n else if (l >= S) {\n ST.update(N - r - 1, N - l, -x);\n }\n else {\n ST.update(l, S, x);\n ST.update(N - r - 1, S, -x);\n }\n pll a = ST.query(0, S);\n if (a.first == a.second && a.first == 0) {\n cout << 1 << endl;\n } else {\n cout << 0 << endl;\n }\n }\n}\n\nint main() {\n cin.tie(0); ios_base::sync_with_stdio(false);\n solve();\n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":18948,"score_of_the_acc":-0.8271,"final_rank":11},{"submission_id":"aoj_2777_2675475","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nint *min_data,*max_data,*add_data;\nint first_table[500000];\nint N = 1;\n\nvoid init(ll first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid add(int left,int right,int value,int node_id,int node_left,int node_right){\n\n\tif(right < node_left || left > node_right){\n\t\treturn;\n\t}\n\telse if(left <= node_left && right >= node_right){\n\n\t\tadd_data[node_id] += value;\n\n\t\twhile(node_id != 0){\n\n\t\t\tnode_id = (node_id-1)/2;\n\t\t\tmin_data[node_id] = min(min_data[2*node_id+1]+add_data[2*node_id+1],min_data[2*node_id+2]+add_data[2*node_id+2]);\n\t\t\tmax_data[node_id] = max(max_data[2*node_id+1]+add_data[2*node_id+1],max_data[2*node_id+2]+add_data[2*node_id+2]);\n\t\t}\n\t}else{\n\n\t\tadd(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tadd(left,right,value,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t}\n}\n\nint getMin(int left,int right,int node_id,int node_left,int node_right){\n\tif(right < node_left || left > node_right)return BIG_NUM;\n\telse if(left <= node_left && right >= node_right){\n\t\treturn min_data[node_id]+add_data[node_id];\n\n\t}else{\n\n\t\tint left_min = getMin(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tint right_min = getMin(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t\treturn min(left_min,right_min)+add_data[node_id];\n\t}\n}\n\nint getMax(int left,int right,int node_id,int node_left,int node_right){\n\tif(right < node_left || left > node_right)return -BIG_NUM;\n\telse if(left <= node_left && right >= node_right){\n\t\treturn max_data[node_id]+add_data[node_id];\n\n\t}else{\n\n\t\tint left_max = getMax(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tint right_max = getMax(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t\treturn max(left_max,right_max)+add_data[node_id];\n\t}\n}\n\nint main(){\n\n\tint first_N;\n\tscanf(\"%d\",&first_N);\n\n\tfor(int i = 0; i < first_N; i++)scanf(\"%lld\",&first_table[i]);\n\n\tfor(int i = 0; i < first_N/2; i++){\n\t\tfirst_table[i] -= first_table[(first_N-1)-i];\n\t}\n\n\tfirst_N /= 2;\n\tinit(first_N);\n\n\tmin_data = new int[2*N-1];\n\tmax_data = new int[2*N-1];\n\tadd_data = new int[2*N-1];\n\n\tfor(ll i = 0; i <= 2*N-2; i++){\n\t\tmin_data[i] = 0;\n\t\tmax_data[i] = 0;\n\t\tadd_data[i] = 0;\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\t\tadd(i,i,first_table[i],0,0,N-1);\n\t}\n\n\tint Q;\n\tscanf(\"%d\",&Q);\n\n\tint left,right,tmp,calc_left;\n\tint add_value;\n\n\tfor(int i = 0; i < Q; i++){\n\t\tscanf(\"%d %d %d\",&left,&right,&add_value);\n\t\tleft--;\n\t\tright--;\n\n\t\tif(left >= first_N){\n\n\t\t\ttmp = right;\n\t\t\tright = (2*first_N-1)-left;\n\t\t\tleft = (2*first_N-1)-tmp;\n\n\t\t\tadd(left,right,-add_value,0,0,N-1);\n\n\t\t}else{ // left < first_N\n\n\t\t\tif(right < first_N){\n\t\t\t\tadd(left,right,add_value,0,0,N-1);\n\n\t\t\t}else{ //right > first_N\n\n\t\t\t\tif(left+right == 2*first_N-1){\n\t\t\t\t\t//Do nothing\n\t\t\t\t}else{\n\n\t\t\t\t\tcalc_left = (2*first_N-1)-right;\n\n\t\t\t\t\tif(calc_left < left){\n\n\t\t\t\t\t\tright = left-1;\n\t\t\t\t\t\tleft = calc_left;\n\t\t\t\t\t\tadd(left,right,-add_value,0,0,N-1);\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tright = calc_left-1;\n\t\t\t\t\t\tadd(left,right,add_value,0,0,N-1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(getMin(0,first_N-1,0,0,N-1) == 0 && getMax(0,first_N-1,0,0,N-1) == 0){\n\t\t\tprintf(\"1\\n\");\n\t\t}else{\n\t\t\tprintf(\"0\\n\");\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":180,"memory_kb":11252,"score_of_the_acc":-0.3859,"final_rank":4},{"submission_id":"aoj_2777_2675472","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nll *min_data,*max_data,*add_data;\nll first_table[500000];\nint N = 1;\n\nvoid init(ll first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid add(int left,int right,ll value,int node_id,int node_left,int node_right){\n\n\tif(right < node_left || left > node_right){\n\t\treturn;\n\t}\n\telse if(left <= node_left && right >= node_right){\n\n\t\tadd_data[node_id] += value;\n\n\t\twhile(node_id != 0){\n\n\t\t\tnode_id = (node_id-1)/2;\n\t\t\tmin_data[node_id] = min(min_data[2*node_id+1]+add_data[2*node_id+1],min_data[2*node_id+2]+add_data[2*node_id+2]);\n\t\t\tmax_data[node_id] = max(max_data[2*node_id+1]+add_data[2*node_id+1],max_data[2*node_id+2]+add_data[2*node_id+2]);\n\t\t}\n\t}else{\n\n\t\tadd(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tadd(left,right,value,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t}\n}\n\nll getMin(int left,int right,int node_id,int node_left,int node_right){\n\tif(right < node_left || left > node_right)return BIG_NUM;\n\telse if(left <= node_left && right >= node_right){\n\t\treturn min_data[node_id]+add_data[node_id];\n\n\t}else{\n\n\t\tll left_min = getMin(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right_min = getMin(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t\treturn min(left_min,right_min)+add_data[node_id];\n\t}\n}\n\nll getMax(int left,int right,int node_id,int node_left,int node_right){\n\tif(right < node_left || left > node_right)return -BIG_NUM;\n\telse if(left <= node_left && right >= node_right){\n\t\treturn max_data[node_id]+add_data[node_id];\n\n\t}else{\n\n\t\tll left_max = getMax(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right_max = getMax(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t\treturn max(left_max,right_max)+add_data[node_id];\n\t}\n}\n\nint main(){\n\n\tint first_N;\n\tscanf(\"%d\",&first_N);\n\n\tfor(int i = 0; i < first_N; i++)scanf(\"%lld\",&first_table[i]);\n\n\tfor(int i = 0; i < first_N/2; i++){\n\t\tfirst_table[i] -= first_table[(first_N-1)-i];\n\t}\n\n\tfirst_N /= 2;\n\tinit(first_N);\n\n\tmin_data = new ll[2*N-1];\n\tmax_data = new ll[2*N-1];\n\tadd_data = new ll[2*N-1];\n\n\tfor(ll i = 0; i <= 2*N-2; i++){\n\t\tmin_data[i] = 0;\n\t\tmax_data[i] = 0;\n\t\tadd_data[i] = 0;\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\t\tadd(i,i,first_table[i],0,0,N-1);\n\t}\n\n\tint Q;\n\tscanf(\"%d\",&Q);\n\n\tint left,right,tmp,calc_left,pre = -1;\n\tll add_value;\n\n\tfor(int i = 0; i < Q; i++){\n\t\tscanf(\"%d %d %lld\",&left,&right,&add_value);\n\t\tleft--;\n\t\tright--;\n\n\t\tif(left >= first_N){\n\n\t\t\ttmp = right;\n\t\t\tright = (2*first_N-1)-left;\n\t\t\tleft = (2*first_N-1)-tmp;\n\n\t\t\tadd(left,right,-add_value,0,0,N-1);\n\n\t\t\tif(pre == 1){\n\t\t\t\tprintf(\"0\\n\");\n\t\t\t\tpre = 0;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t}else{ // left < first_N\n\n\t\t\tif(right < first_N){\n\t\t\t\tadd(left,right,add_value,0,0,N-1);\n\n\t\t\t\tif(pre == 1){\n\t\t\t\t\tprintf(\"0\\n\");\n\t\t\t\t\tpre = 0;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\tif(left+right == 2*first_N-1){\n\t\t\t\t\tif(pre != -1){\n\t\t\t\t\t\tprintf(\"%d\\n\",pre);\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}else{\n\n\t\t\t\t\tcalc_left = (2*first_N-1)-right;\n\n\t\t\t\t\tif(calc_left < left){\n\n\t\t\t\t\t\tright = left-1;\n\t\t\t\t\t\tleft = calc_left;\n\t\t\t\t\t\tadd(left,right,-add_value,0,0,N-1);\n\n\t\t\t\t\t\tif(pre == 1){\n\t\t\t\t\t\t\tprintf(\"0\\n\");\n\t\t\t\t\t\t\tpre = 0;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tright = calc_left-1;\n\t\t\t\t\t\tadd(left,right,add_value,0,0,N-1);\n\n\t\t\t\t\t\tif(pre == 1){\n\t\t\t\t\t\t\tprintf(\"0\\n\");\n\t\t\t\t\t\t\tpre = 0;\n\t\t\t\t\t\t\tcontinue;\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}\n\n\t\tif(getMin(0,first_N-1,0,0,N-1) == 0 && getMax(0,first_N-1,0,0,N-1) == 0){\n\t\t\tprintf(\"1\\n\");\n\t\t\tpre = 1;\n\t\t}else{\n\t\t\tprintf(\"0\\n\");\n\t\t\tpre = 0;\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":0.6753246753246753,"time_ms":190,"memory_kb":19352,"score_of_the_acc":-0.5381,"final_rank":19},{"submission_id":"aoj_2777_2675470","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nll *min_data,*max_data,*add_data;\nll first_table[500000];\nint N = 1;\n\nvoid init(ll first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid add(int left,int right,ll value,int node_id,int node_left,int node_right){\n\n\tif(right < node_left || left > node_right){\n\t\treturn;\n\t}\n\telse if(left <= node_left && right >= node_right){\n\n\t\tadd_data[node_id] += value;\n\n\t\twhile(node_id != 0){\n\n\t\t\tnode_id = (node_id-1)/2;\n\t\t\tmin_data[node_id] = min(min_data[2*node_id+1]+add_data[2*node_id+1],min_data[2*node_id+2]+add_data[2*node_id+2]);\n\t\t\tmax_data[node_id] = max(max_data[2*node_id+1]+add_data[2*node_id+1],max_data[2*node_id+2]+add_data[2*node_id+2]);\n\t\t}\n\t}else{\n\n\t\tadd(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tadd(left,right,value,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t}\n}\n\nll getMin(int left,int right,int node_id,int node_left,int node_right){\n\tif(right < node_left || left > node_right)return BIG_NUM;\n\telse if(left <= node_left && right >= node_right){\n\t\treturn min_data[node_id]+add_data[node_id];\n\n\t}else{\n\n\t\tll left_min = getMin(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right_min = getMin(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t\treturn min(left_min,right_min)+add_data[node_id];\n\t}\n}\n\nll getMax(int left,int right,int node_id,int node_left,int node_right){\n\tif(right < node_left || left > node_right)return -BIG_NUM;\n\telse if(left <= node_left && right >= node_right){\n\t\treturn max_data[node_id]+add_data[node_id];\n\n\t}else{\n\n\t\tll left_max = getMax(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right_max = getMax(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t\treturn max(left_max,right_max)+add_data[node_id];\n\t}\n}\n\nint main(){\n\n\tint first_N;\n\tscanf(\"%d\",&first_N);\n\n\tfor(int i = 0; i < first_N; i++)scanf(\"%lld\",&first_table[i]);\n\n\tfor(int i = 0; i < first_N/2; i++){\n\t\tfirst_table[i] -= first_table[(first_N-1)-i];\n\t}\n\n\tfirst_N /= 2;\n\tinit(first_N);\n\n\tmin_data = new ll[2*N-1];\n\tmax_data = new ll[2*N-1];\n\tadd_data = new ll[2*N-1];\n\n\tfor(ll i = 0; i <= 2*N-2; i++){\n\t\tmin_data[i] = 0;\n\t\tmax_data[i] = 0;\n\t\tadd_data[i] = 0;\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\t\tadd(i,i,first_table[i],0,0,N-1);\n\t}\n\n\tint Q;\n\tscanf(\"%d\",&Q);\n\n\tint left,right,tmp,calc_left;\n\tll add_value;\n\n\tfor(int i = 0; i < Q; i++){\n\t\tscanf(\"%d %d %lld\",&left,&right,&add_value);\n\t\tleft--;\n\t\tright--;\n\n\t\tif(left >= first_N){\n\n\t\t\ttmp = right;\n\t\t\tright = (2*first_N-1)-left;\n\t\t\tleft = (2*first_N-1)-tmp;\n\n\t\t\tadd(left,right,-add_value,0,0,N-1);\n\n\t\t}else{ // left < first_N\n\n\t\t\tif(right < first_N){\n\t\t\t\tadd(left,right,add_value,0,0,N-1);\n\n\t\t\t}else{ //right > first_N\n\n\t\t\t\tif(left+right == 2*first_N-1){\n\t\t\t\t\t//Do nothing\n\t\t\t\t}else{\n\n\t\t\t\t\tcalc_left = (2*first_N-1)-right;\n\n\t\t\t\t\tif(calc_left < left){\n\n\t\t\t\t\t\tright = left-1;\n\t\t\t\t\t\tleft = calc_left;\n\t\t\t\t\t\tadd(left,right,-add_value,0,0,N-1);\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tright = calc_left-1;\n\t\t\t\t\t\tadd(left,right,add_value,0,0,N-1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(getMin(0,first_N-1,0,0,N-1) == 0 && getMax(0,first_N-1,0,0,N-1) == 0){\n\t\t\tprintf(\"1\\n\");\n\t\t}else{\n\t\t\tprintf(\"0\\n\");\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":190,"memory_kb":19364,"score_of_the_acc":-0.5383,"final_rank":6},{"submission_id":"aoj_2777_2675469","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nll *min_data,*max_data,*add_data;\nll first_table[500000];\nint N = 1;\n\nvoid init(ll first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid add(int left,int right,ll value,int node_id,int node_left,int node_right){\n\n\tif(right < node_left || left > node_right){\n\t\treturn;\n\t}\n\telse if(left <= node_left && right >= node_right){\n\n\t\tadd_data[node_id] += value;\n\n\t\twhile(node_id != 0){\n\n\t\t\tnode_id = (node_id-1)/2;\n\t\t\tmin_data[node_id] = min(min_data[2*node_id+1]+add_data[2*node_id+1],min_data[2*node_id+2]+add_data[2*node_id+2]);\n\t\t\tmax_data[node_id] = max(max_data[2*node_id+1]+add_data[2*node_id+1],max_data[2*node_id+2]+add_data[2*node_id+2]);\n\t\t}\n\t}else{\n\n\t\tadd(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tadd(left,right,value,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t}\n}\n\nll getMin(int left,int right,int node_id,int node_left,int node_right){\n\tif(right < node_left || left > node_right)return BIG_NUM;\n\telse if(left <= node_left && right >= node_right){\n\t\treturn min_data[node_id]+add_data[node_id];\n\n\t}else{\n\n\t\tll left_min = getMin(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right_min = getMin(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t\treturn min(left_min,right_min)+add_data[node_id];\n\t}\n}\n\nll getMax(int left,int right,int node_id,int node_left,int node_right){\n\tif(right < node_left || left > node_right)return -BIG_NUM;\n\telse if(left <= node_left && right >= node_right){\n\t\treturn max_data[node_id]+add_data[node_id];\n\n\t}else{\n\n\t\tll left_max = getMax(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right_max = getMax(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\t\treturn max(left_max,right_max)+add_data[node_id];\n\t}\n}\n\nint main(){\n\n\tint first_N;\n\tscanf(\"%d\",&first_N);\n\n\tfor(int i = 0; i < first_N; i++)scanf(\"%lld\",&first_table[i]);\n\n\tfor(int i = 0; i < first_N/2; i++){\n\t\tfirst_table[i] -= first_table[(first_N-1)-i];\n\t}\n\n\tfirst_N /= 2;\n\tinit(first_N);\n\n\tmin_data = new ll[2*N-1];\n\tmax_data = new ll[2*N-1];\n\tadd_data = new ll[2*N-1];\n\n\tfor(ll i = 0; i <= 2*N-2; i++){\n\t\tmin_data[i] = 0;\n\t\tmax_data[i] = 0;\n\t\tadd_data[i] = 0;\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\t\tadd(i,i,first_table[i],0,0,N-1);\n\t}\n\n\tint Q;\n\tscanf(\"%d\",&Q);\n\n\tint left,right,tmp,calc_left,pre = -1;\n\tll add_value;\n\n\tfor(int i = 0; i < Q; i++){\n\t\tscanf(\"%d %d %lld\",&left,&right,&add_value);\n\t\tleft--;\n\t\tright--;\n\n\t\tif(left >= first_N){\n\n\t\t\ttmp = right;\n\t\t\tright = (2*first_N-1)-left;\n\t\t\tleft = (2*first_N-1)-tmp;\n\n\t\t\tadd(left,right,-add_value,0,0,N-1);\n\n\t\t\tif(pre == 1){\n\t\t\t\tprintf(\"0\\n\");\n\t\t\t\tpre = 0;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t}else{ // left < first_N\n\n\t\t\tif(right < first_N){\n\t\t\t\tadd(left,right,add_value,0,0,N-1);\n\n\t\t\t\tif(pre == 1){\n\t\t\t\t\tprintf(\"0\\n\");\n\t\t\t\t\tpre = 0;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t}else{ //right > first_N\n\n\t\t\t\tif(left+right == 2*first_N-1){\n\t\t\t\t\tprintf(\"%d\\n\",pre);\n\t\t\t\t\tcontinue;\n\t\t\t\t}else{\n\n\t\t\t\t\tcalc_left = (2*first_N-1)-right;\n\n\t\t\t\t\tif(calc_left < left){\n\n\t\t\t\t\t\tright = left-1;\n\t\t\t\t\t\tleft = calc_left;\n\t\t\t\t\t\tadd(left,right,-add_value,0,0,N-1);\n\n\t\t\t\t\t\tif(pre == 1){\n\t\t\t\t\t\t\tprintf(\"0\\n\");\n\t\t\t\t\t\t\tpre = 0;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tright = calc_left-1;\n\t\t\t\t\t\tadd(left,right,add_value,0,0,N-1);\n\n\t\t\t\t\t\tif(pre == 1){\n\t\t\t\t\t\t\tprintf(\"0\\n\");\n\t\t\t\t\t\t\tpre = 0;\n\t\t\t\t\t\t\tcontinue;\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}\n\n\t\tif(getMin(0,first_N-1,0,0,N-1) == 0 && getMax(0,first_N-1,0,0,N-1) == 0){\n\t\t\tprintf(\"1\\n\");\n\t\t\tpre = 1;\n\t\t}else{\n\t\t\tprintf(\"0\\n\");\n\t\t\tpre = 0;\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":0.6753246753246753,"time_ms":190,"memory_kb":19388,"score_of_the_acc":-0.5387,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_2777_10850964\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing LL = long long; using ll = LL;\\nusing PII = pair<int, int>; using pii = PII;\\nusing PLL = pair<LL, LL>; using pll = PLL;\\nusing VI = vector<int>; using VL = vector<LL>;\\nconst ll LINF = 1e18;\\nconst int INF = 1e9;\\n#define FOR(i,s,t) for(int i =s; i < t;i++)\\n#define SZ(a) (int)a.size()\\n#define ALL(a) a.begin(),a.end()\\n\\nconst ll INIT = 0;\\nstruct SegTree {\\n\\tint N;\\n\\tll init_v;\\n\\tvector<pll> node;\\n\\tVL lazy;\\n\\tSegTree(int _N) :init_v(INIT) {\\n\\t\\tinit_v = 0;\\n\\t\\tN = 1;\\n\\t\\twhile (N < _N) N *= 2;\\n\\t\\tnode.resize(2 * N - 1, pll(0,0));\\n\\t\\tlazy.resize(2 * N - 1, 0);\\n\\t}\\n\\n\\tpll merge(pll a, pll b) {\\n\\t\\tpll ret = pll(-1e9, 1e9);\\n\\t\\tret.first = max(a.first, b.first);\\n\\t\\tret.second = min(a.second, b.second);\\n\\t\\treturn ret;\\n\\t}\\n\\tvoid lazy_e(int l, int r, int k) {\\n\\t\\tnode[k].first += lazy[k];\\n\\t\\tnode[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\\n\\tvoid update(int a, int b, ll x) {\\n\\t\\tupdate(a, b, 0, 0, N, x);\\n\\t}\\n\\tvoid update(int a, int b, int k, int l, int r, ll x) {\\n\\t\\tlazy_e(l, r, k);\\n\\t\\tif (r <= a || b <= l) return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tlazy[k] += x;\\n\\t\\t\\tlazy_e(l, r, k);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tupdate(a, b, 2 * k + 1, l, (l + r) / 2, x);\\n\\t\\t\\tupdate(a, b, 2 * k + 2, (l + r) / 2, r, x);\\n\\t\\t\\tnode[k] = merge(node[2 * k + 1], node[2 * k + 2]);\\n\\t\\t}\\n\\t}\\n\\n\\tpll query(int a, int b) { return query(a, b, 0, 0, N); }\\n\\tpll query(int a, int b, int k, int l, int r) {\\n\\t\\tlazy_e(l, r, k);\\n\\t\\tif (r <= a || b <= l) return pll(-1e9, 1e9);\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\treturn node[k];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn merge(\\n\\t\\t\\t\\tquery(a, b, 2 * k + 1, l, (l + r) / 2),\\n\\t\\t\\t\\tquery(a, b, 2 * k + 2, (l + r) / 2, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n};\\n\\nvoid solve() {\\n\\tll N; cin >> N;\\n\\tvector<ll> kassa(N); for (auto& in : kassa) cin >> in;\\n\\tll Q; cin >> Q;\\n\\tll S = N / 2;\\n\\tSegTree ST(S);\\n\\tfor (int i = 0; i < S; i++) {\\n\\n\\t\\tST.update(i, i + 1, kassa[i]);\\n\\t}\\n\\tfor (int i = S; i < N; i++) {\\n\\t\\t//\\tcout << N - i << endl;\\n\\t\\tST.update(N - i - 1, N - i, -kassa[i]);\\n\\t}\\n\\n\\t//\\tcout << ST.query(0, S) << endl;\\n\\t//return;\\n\\twhile (Q--) {\\n\\t\\tll l, r, x; cin >> l >> r >> x;\\n\\t\\tl--; r--;\\n\\t\\tif (r < S) {\\n\\t\\t\\tST.update(l, r + 1, x);\\n\\t\\t}\\n\\t\\telse if (l >= S) {\\n\\t\\t\\tST.update(N - r - 1, N - l, -x);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tST.update(l, S, x);\\n\\t\\t\\tST.update(N - r - 1, S, -x);\\n\\t\\t}\\n\\t\\t//cout << string(10, '=') << endl;\\n\\t\\t//\\tcout << ST.query(0,S) << endl;\\n\\t\\tpll a = ST.query(0, S);\\n\\t\\tif (a.first == a.second && a.first == 0) {\\n\\t\\t\\tcout << 1 << endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout << 0 << endl;\\n\\t\\t}\\n//\\t\\tcout << (ST.query(0, S) == 0) << endl;\\n\\t\\t//\\t\\tcout << string(10, '-') << endl;\\n\\t}\\n}\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(false);\\n\\n\\tsolve();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 19376,\n \"score_of_the_acc\": -0.8112,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2777_9522215\",\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) { return (ull)rng() % B; }\\n\\nstruct Node {\\n int n;\\n using NP = Node *;\\n NP L, R;\\n ll mi, mx, lz;\\n\\n void initNode() { mi = 0, mx = 0, lz = 0; }\\n void update() { mi = min(L->mi, R->mi), mx = max(L->mx, R->mx); }\\n void push() { L->lazy(lz), R->lazy(lz), lz = 0; }\\n void lazy(ll x) { mi += x, mx += x, lz += x; }\\n void add(int l, int r, ll x) {\\n if (r <= 0 or n <= l) return;\\n if (l <= 0 and n <= r) {\\n lazy(x);\\n return;\\n }\\n push();\\n L->add(l, r, x);\\n R->add(l - n / 2, r - n / 2, x);\\n update();\\n }\\n Node(int n) : n(n) {\\n initNode();\\n if (n == 1) return;\\n L = new Node(n / 2);\\n R = new Node(n - n / 2);\\n }\\n};\\n// sst = new Node(sz);\\nNode *sst = nullptr;\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n;\\n cin >> n;\\n vector<ll> a(n);\\n for (int i = 0; i < n; ++i) {\\n cin >> a[i];\\n }\\n sst = new Node(n);\\n for (int i = 0; i < n; ++i) {\\n sst->add(i, i + 1, a[i] - a[n - 1 - i]);\\n }\\n int q;\\n cin >> q;\\n while (q--) {\\n int l, r, x;\\n cin >> l >> r >> x;\\n l -= 1;\\n sst->add(l, r, x);\\n sst->add(n - r, n - l, -x);\\n if (sst->mi == 0 and sst->mx == 0) cout << 1 << \\\"\\\\n\\\";\\n else cout << 0 << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 69580,\n \"score_of_the_acc\": -1.5,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2777_6941925\",\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=2167167167167167167;\\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\\\";}\\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\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;\\n\\tcin>>N;\\n\\tvector<int> S(N);\\n\\trep(i,N) cin>>S[i];\\n\\tvector<int> p(N/2+2);\\n\\tvector<int> q(N/2+1);\\n\\trep(i,N/2) p[i+1]=S[i]-S[N-i-1];\\n\\trep(i,N/2+1) q[i]=p[i+1]-p[i];\\n\\tint ans=0;\\n\\trep(i,N/2+1) if(q[i]!=0) ans++;\\n\\tint Q;\\n\\tcin>>Q;\\n\\trep(i,Q){\\n\\t\\tint l,r;\\n\\t\\tll x;\\n\\t\\tcin>>l>>r>>x;\\n\\t\\tif(N/2<l){\\n\\t\\t\\tl=N+1-l;\\n\\t\\t\\tr=N+1-r;\\n\\t\\t\\tswap(l,r);\\n\\t\\t\\tx=-x;\\n\\t\\t\\tr++;\\n\\t\\t}else if(l<=N/2&&N/2<r){\\n\\t\\t\\tr=N+1-r;\\n\\t\\t\\tif(l>r) swap(l,r),x=-x;\\n\\t\\t\\tif(l==r) x=0;\\n\\t\\t}else{\\n\\t\\t\\tr++;\\n\\t\\t}\\n\\t\\tif(q[l-1]!=0) ans--;\\n\\t\\tq[l-1]+=x;\\n\\t\\tif(q[l-1]!=0) ans++;\\n\\t\\tif(q[r-1]!=0) ans--;\\n\\t\\tq[r-1]-=x;\\n\\t\\tif(q[r-1]!=0) ans++;\\n\\t\\t//cout<<l<<\\\" \\\"<<r<<\\\" \\\"<<x<<\\\"\\\\n\\\";\\n\\t\\tif(ans==0) cout<<\\\"1\\\\n\\\";\\n\\t\\telse cout<<\\\"0\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7016,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2777_5532969\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 0-indexed\\ntemplate <class T, class E>\\nstruct SegmentTreeLaze {\\n // a,b:T c,d:E e:E(unit)\\n // g(f(a,b),c) = f(g(a,c),g(b,c))\\n // g(g(a,c),d) = g(a,h(c,d))\\n // g(a,e) = a\\n typedef function<T(T, T)> F;\\n typedef function<T(T, E)> G;\\n typedef function<E(E, E)> H;\\n int n, height;\\n F f;\\n G g;\\n H h;\\n T tunit;\\n E eunit;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTreeLaze(){};\\n SegmentTreeLaze(int newn, F f, G g, H h, T nt, E ne)\\n : f(f), g(g), h(h), tunit(nt), eunit(ne) {\\n init(newn);\\n }\\n SegmentTreeLaze(const vector<T> &v, F f, G g, H h, T nt, E ne)\\n : f(f), g(g), h(h), tunit(nt), eunit(ne) {\\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, height = 0;\\n while (n < newn) n <<= 1, ++height;\\n dat.assign(n << 1, tunit);\\n laz.assign(n << 1, eunit);\\n }\\n\\n inline T reflect(int k) {\\n return laz[k] == eunit ? dat[k] : g(dat[k], laz[k]);\\n }\\n\\n inline void eval(int k) {\\n if (laz[k] == eunit) return;\\n laz[k << 1] = h(laz[k << 1], laz[k]);\\n laz[(k << 1) | 1] = h(laz[(k << 1) | 1], laz[k]);\\n dat[k] = reflect(k);\\n laz[k] = eunit;\\n }\\n\\n inline void thrust(int k) {\\n for (int i = height; i; --i) eval(k >> i);\\n // reset query\\n // dat[k] = reflect(k);\\n // laz[k] = eunit;\\n }\\n\\n void recalc(int k) {\\n while (k >>= 1) dat[k] = f(reflect(k << 1), reflect((k << 1) | 1));\\n }\\n // [a,b)\\n void update(int a, int b, E newdata) {\\n thrust(a += n);\\n thrust(b += n - 1);\\n for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\\n if (l & 1) laz[l] = h(laz[l], newdata), l++;\\n if (r & 1) --r, laz[r] = h(laz[r], newdata);\\n }\\n recalc(a);\\n recalc(b);\\n }\\n\\n void set_val(int k, T newdata) {\\n thrust(k += n);\\n dat[k] = newdata;\\n laz[k] = eunit;\\n recalc(k);\\n }\\n\\n // [a,b)\\n T query(int a, int b) {\\n thrust(a += n);\\n thrust(b += n - 1);\\n T vl = tunit, vr = tunit;\\n for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\\n if (l & 1) vl = f(vl, reflect(l++));\\n if (r & 1) vr = f(reflect(--r), vr);\\n }\\n return f(vl, vr);\\n }\\n\\n // require: func(unit) == false\\n // min left: st <= res && func(seg.query(st,res + 1))\\n template <typename C>\\n int find_left(int st, C &func, T &acc, int k, int l, int r) {\\n if (l + 1 == r) {\\n acc = f(acc, reflect(k));\\n return func(acc) ? l : -1;\\n }\\n eval(k);\\n int mid = (l + r) >> 1;\\n if (mid <= st) return find_left(st, func, acc, (k << 1) | 1, mid, r);\\n if (st <= l && !func(f(acc, dat[k]))) {\\n acc = f(acc, dat[k]);\\n return -1;\\n }\\n int nres = find_left(st, func, acc, (k << 1), l, mid);\\n if (~nres) return nres;\\n return find_left(st, func, acc, (k << 1) | 1, mid, r);\\n }\\n template <typename C>\\n int find_left(int st, C &func) {\\n T acc = tunit;\\n return find_left(st, func, acc, 1, 0, n);\\n }\\n\\n // max right: res <= st && func(seg.query(res - 1,st))\\n template <typename C>\\n int find_right(int st, C &func, T &acc, int k, int l, int r) {\\n if (l + 1 == r) {\\n acc = f(reflect(k), acc);\\n return func(acc) ? r : -1;\\n }\\n eval(k);\\n int mid = (l + r) >> 1;\\n if (st <= mid) return find_right(st, func, acc, k << 1, l, mid);\\n if (r <= st && !func(f(dat[k], acc))) {\\n acc = f(dat[k], acc);\\n return -1;\\n }\\n int nres = find_right(st, func, acc, (k << 1) | 1, mid, r);\\n if (~nres) return nres;\\n return find_right(st, func, acc, k << 1, l, mid);\\n }\\n template <typename C>\\n int find_right(int st, C &func) {\\n T acc = tunit;\\n return find_right(st, func, acc, 1, 0, n);\\n }\\n};\\n\\nint n, q;\\nSegmentTreeLaze<int, int> segmax, segmin;\\n\\nint main() {\\n cin >> n;\\n {\\n n >>= 1;\\n vector<int> s(n);\\n for (int i = 0; i < n; ++i) cin >> s[i];\\n for (int i = n - 1; i >= 0; --i) {\\n int p;\\n cin >> p;\\n s[i] -= p;\\n }\\n auto minf = [](int l, int r) { return min(l, r); };\\n auto maxf = [](int l, int r) { return max(l, r); };\\n auto gh = [](int l, int r) { return l + r; };\\n segmin = SegmentTreeLaze<int, int>(s, minf, gh, gh, 0, 0);\\n segmax = SegmentTreeLaze<int, int>(s, maxf, gh, gh, 0, 0);\\n }\\n cin >> q;\\n while (q--) {\\n int l, r, x;\\n cin >> l >> r >> x;\\n if (--l < n) {\\n segmin.update(l, min(r, n), x);\\n segmax.update(l, min(r, n), x);\\n }\\n if (r-- > n) {\\n l = max(l, n);\\n l -= n, r -= n;\\n swap(l, r);\\n l = n - 1 - l;\\n r = n - r;\\n segmin.update(l, r, -x);\\n segmax.update(l, r, -x);\\n }\\n cout << (!segmin.query(0, n) && !segmax.query(0, n)) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 12372,\n \"score_of_the_acc\": -0.7902,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2777_5532484\",\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;\\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(15);}} __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\\\";}\\ntemplate <typename T,typename E>\\nstruct lazysegtree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n lazysegtree(F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){}\\n \\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(const vector<T> &v){\\n int n_=v.size();\\n init(n_);\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n inline T reflect(int k){\\n return laz[k]==ei?dat[k]:g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n inline void thrust(int k){\\n for(int i=height;i;i--) eval(k>>i);\\n }\\n inline void recalc(int k){ \\n while(k>>=1)\\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));\\n }\\n void update(int a,int b,E x){\\n thrust(a+=n);\\n thrust(b+=n-1);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n recalc(a);\\n recalc(b);\\n }\\n void set_val(int a,T x){\\n thrust(a+=n);\\n dat[a]=x;laz[a]=ei;\\n recalc(a);\\n }\\n T query(int a,int b){\\n thrust(a+=n);\\n thrust(b+=n-1);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n};\\nint main(){\\n auto f1=[&](ll a,ll b){\\n if(a>b)return a;\\n return b;\\n };\\n auto f2=[&](ll a,ll b){\\n if(a<b)return a;\\n return b;\\n\\n };\\n auto g=[&](ll a,ll b){\\n return a+b;\\n };\\n ll n;\\n cin>>n;\\n V<ll> a(n);\\n for(int i=0;i<n;i++)cin>>a[i];\\n V<ll> d(n/2);\\n for(int i=0;i<n/2;i++){\\n d[i]=a[i]-a[n-i-1];\\n }\\n lazysegtree<ll,ll> dpa(f1,g,g,-inf,0ll),dpb(f2,g,g,inf,0);\\n dpa.build(d);\\n dpb.build(d);\\n // print(d);\\n int q;\\n cin>>q;\\n while(q--){\\n ll l,r,x;\\n cin>>l>>r>>x;\\n l--;\\n ll L=min(l,n/2),R=min(n/2,r);\\n if(L!=R){\\n dpa.update(L,R,x);\\n dpb.update(L,R,x);\\n }\\n // L=max(n/2,l)-n/2,R=max(n/2,r)-n/2;\\n L=n/2-(max(n/2,r)-n/2); R=n/2-(max(n/2,l)-n/2);\\n if(L!=R){\\n dpa.update(L,R,-x);\\n dpb.update(L,R,-x);\\n }\\n\\n cout<<(dpa.query(0,n/2)==0&&dpb.query(0,n/2)==0)<<\\\"\\\\n\\\";\\n // for(int i=0;i<n/2;i++)cout<<dpa.query(i,i+1)<<\\\" \\\";\\n // cout<<\\\"\\\\n\\\";\\n // for(int i=0;i<n/2;i++)cout<<dpb.query(i,i+1)<<\\\" \\\";\\n // cout<<\\\"\\\\n\\\";\\n // cout<<dpa.query(0,n/2)<<\\\" \\\"<<dpb.query(0,n/2)<<\\\"\\\\n\\\";\\n // cout<<\\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 25460,\n \"score_of_the_acc\": -0.6812,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2777_5532400\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n//#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\nusing namespace std;\\n//#include<boost/multiprecision/cpp_int.hpp>\\n//#include<boost/multiprecision/cpp_dec_float.hpp>\\n//namespace mp=boost::multiprecision;\\n//#define mulint mp::cpp_int\\n//#define mulfloat mp::cpp_dec_float_100\\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\\n#define INF (1<<30)\\n#define LINF (lint)(1LL<<56)\\n#define endl \\\"\\\\n\\\"\\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\\n#define flc(x) __builtin_popcountll(x)\\n#define pint pair<int,int>\\n#define pdouble pair<double,double>\\n#define plint pair<lint,lint>\\n#define fi first\\n#define se second\\n#define all(x) x.begin(),x.end()\\n#define vec vector<lint>\\n#define nep(x) next_permutation(all(x))\\ntypedef long long lint;\\nint dx[8]={1,1,0,-1,-1,-1,0,1};\\nint dy[8]={0,1,1,1,0,-1,-1,-1};\\nconst int MAX_N=3e5+5;\\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//vector<int> bucket[MAX_N/1000];\\nconstexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n/*#include<atcoder/all>\\nusing namespace atcoder;\\ntypedef __int128_t llint;*/\\n\\n// Segment Tree Beats\\n// - l<=i<r について、 A_i の値を min(A_i, x) に更新\\n// - l<=i<r について、 A_i の値を max(A_i, x) に更新\\n// - l<=i<r の中の A_i の最大値を求める\\n// - l<=i<r の中の A_i の最小値を求める\\n// - l<=i<r の A_i の和を求める\\n// - l<=i<r について、 A_i の値に x を加える\\n// - l<=i<r について、 A_i の値を x に更新\\n\\nclass SegmentTreeBeats{\\n static const lint inf = 1e18;\\n struct Node{\\n Node *left, *right;\\n lint max_v, smax_v, max_c;\\n lint min_v, smin_v, min_c;\\n lint sum;\\n lint len, ladd, lval;\\n\\n Node() : left(0), right(0), ladd(0), lval(inf) {}\\n\\n void init(lint x){\\n max_v = min_v = sum = x;\\n smax_v = -inf;\\n smin_v = inf;\\n max_c = min_c = 1;\\n }\\n\\n void init_empty(){\\n max_v = smax_v = -inf;\\n min_v = smin_v = inf;\\n max_c = min_c = 0;\\n }\\n\\n void update_max(lint x){\\n sum += (x - max_v) * max_c;\\n\\n if (max_v == min_v){\\n max_v = min_v = x;\\n }\\n else if (max_v == smin_v){\\n max_v = smin_v = x;\\n }\\n else{\\n max_v = x;\\n }\\n\\n if (lval != inf && x < lval){\\n lval = x;\\n }\\n }\\n\\n void update_min(lint x){\\n sum += (x - min_v) * min_c;\\n\\n if (max_v == min_v){\\n max_v = min_v = x;\\n }\\n else if (max_v == smin_v){\\n min_v = smax_v = x;\\n }\\n else{\\n min_v = x;\\n }\\n\\n if (lval != inf && lval < x){\\n lval = x;\\n }\\n }\\n\\n void addalint(lint x)\\n {\\n max_v += x;\\n if (smax_v != -inf) smax_v += x;\\n min_v += x;\\n if (smin_v != inf) smin_v += x;\\n sum += len * x;\\n if (lval != inf){\\n lval += x;\\n }\\n else{\\n ladd += x;\\n }\\n }\\n\\n void updatealint(lint x){\\n max_v = min_v = x;\\n smax_v = -inf;\\n smin_v = inf;\\n max_c = min_c = len;\\n\\n sum = len * x;\\n lval = x;\\n ladd = 0;\\n }\\n\\n void push(){\\n\\n if (lval != inf){\\n left->updatealint(lval);\\n right->updatealint(lval);\\n lval = inf;\\n return;\\n }\\n\\n if (ladd != 0){\\n left->addalint(ladd);\\n right->addalint(ladd);\\n ladd = 0;\\n }\\n\\n if (max_v < left->max_v){\\n left->update_max(max_v);\\n }\\n if (left->min_v < min_v){\\n left->update_min(min_v);\\n }\\n\\n if (max_v < right->max_v){\\n right->update_max(max_v);\\n }\\n if (right->min_v < min_v){\\n right->update_min(min_v);\\n }\\n }\\n\\n void update(){\\n sum = left->sum + right->sum;\\n\\n if (left->max_v < right->max_v){\\n max_v = right->max_v;\\n max_c = right->max_c;\\n smax_v = max(left->max_v, right->smax_v);\\n }\\n else if (left->max_v > right->max_v){\\n max_v = left->max_v;\\n max_c = left->max_c;\\n smax_v = max(left->smax_v, right->max_v);\\n }\\n else{\\n max_v = left->max_v;\\n max_c = left->max_c + right->max_c;\\n smax_v = max(left->smax_v, right->smax_v);\\n }\\n\\n if (left->min_v < right->min_v){\\n min_v = left->min_v;\\n min_c = left->min_c;\\n smin_v = min(left->smin_v, right->min_v);\\n }\\n else if (left->min_v > right->min_v){\\n min_v = right->min_v;\\n min_c = right->min_c;\\n smin_v = min(left->min_v, right->smin_v);\\n }\\n else{\\n min_v = left->min_v;\\n min_c = left->min_c + right->min_c;\\n smin_v = min(left->smin_v, right->smin_v);\\n }\\n }\\n };\\n\\n int n, n0;\\n Node *root;\\n\\n void _update_min(lint x, int a, int b, Node *nd, int l, int r){\\n if (b <= l || r <= a || nd->max_v <= x){\\n return;\\n }\\n if (a <= l && r <= b && nd->smax_v < x){\\n nd->update_max(x);\\n return;\\n }\\n\\n nd->push();\\n _update_min(x, a, b, nd->left, l, (l + r) / 2);\\n _update_min(x, a, b, nd->right, (l + r) / 2, r);\\n nd->update();\\n }\\n\\n void _update_max(lint x, int a, int b, Node *nd, int l, int r){\\n if (b <= l || r <= a || x <= nd->min_v){\\n return;\\n }\\n if (a <= l && r <= b && x < nd->smin_v){\\n nd->update_min(x);\\n return;\\n }\\n\\n nd->push();\\n _update_max(x, a, b, nd->left, l, (l + r) / 2);\\n _update_max(x, a, b, nd->right, (l + r) / 2, r);\\n nd->update();\\n }\\n\\n void _add_val(lint x, int a, int b, Node *nd, int l, int r){\\n if (b <= l || r <= a){\\n return;\\n }\\n if (a <= l && r <= b){\\n nd->addalint(x);\\n return;\\n }\\n\\n nd->push();\\n _add_val(x, a, b, nd->left, l, (l + r) / 2);\\n _add_val(x, a, b, nd->right, (l + r) / 2, r);\\n nd->update();\\n }\\n\\n void _update_val(lint x, int a, int b, Node *nd, int l, int r){\\n if (b <= l || r <= a){\\n return;\\n }\\n if (a <= l && r <= b){\\n nd->updatealint(x);\\n return;\\n }\\n\\n nd->push();\\n _update_val(x, a, b, nd->left, l, (l + r) / 2);\\n _update_val(x, a, b, nd->right, (l + r) / 2, r);\\n nd->update();\\n }\\n\\n lint _query_max(int a, int b, Node *nd, int l, int r){\\n if (b <= l || r <= a){\\n return -inf;\\n }\\n if (a <= l && r <= b){\\n return nd->max_v;\\n }\\n nd->push();\\n lint lv = _query_max(a, b, nd->left, l, (l + r) / 2);\\n lint rv = _query_max(a, b, nd->right, (l + r) / 2, r);\\n return max(lv, rv);\\n }\\n\\n lint _query_min(int a, int b, Node *nd, int l, int r){\\n if (b <= l || r <= a){\\n return inf;\\n }\\n if (a <= l && r <= b){\\n return nd->min_v;\\n }\\n nd->push();\\n lint lv = _query_min(a, b, nd->left, l, (l + r) / 2);\\n lint rv = _query_min(a, b, nd->right, (l + r) / 2, r);\\n return min(lv, rv);\\n }\\n\\n lint _query_sum(int a, int b, Node *nd, int l, int r){\\n if (b <= l || r <= a){\\n return 0;\\n }\\n if (a <= l && r <= b){\\n return nd->sum;\\n }\\n nd->push();\\n lint lv = _query_sum(a, b, nd->left, l, (l + r) / 2);\\n lint rv = _query_sum(a, b, nd->right, (l + r) / 2, r);\\n return lv + rv;\\n }\\n\\npublic:\\n SegmentTreeBeats(int n, vector<lint> a) : n(n){\\n n0 = 1;\\n while (n0 < n) n0 <<= 1;\\n\\n Node *nds = new Node[2 * n0];\\n root = nds;\\n\\n nds[0].len = n0;\\n for (int i = 0; i < n0 - 1; ++i){\\n nds[i].left = &nds[2 * i + 1];\\n nds[i].right = &nds[2 * i + 2];\\n nds[2 * i + 1].len = nds[2 * i + 2].len = (nds[i].len >> 1);\\n }\\n\\n for (int i = 0; i < n; ++i) nds[n0 - 1 + i].init(a[i]);\\n for (int i = n; i < n0; ++i) nds[n0 - 1 + i].init_empty();\\n for (int i = n0 - 2; i >= 0; i--) nds[i].update();\\n }\\n SegmentTreeBeats(int n) : n(n){\\n n0 = 1;\\n while (n0 < n) n0 <<= 1;\\n\\n Node *nds = new Node[2 * n0];\\n root = nds;\\n\\n nds[0].len = n0;\\n for (int i = 0; i < n0 - 1; ++i){\\n nds[i].left = &nds[2 * i + 1];\\n nds[i].right = &nds[2 * i + 2];\\n nds[2 * i + 1].len = nds[2 * i + 2].len = (nds[i].len >> 1);\\n }\\n\\n for (int i = 0; i < n; ++i) nds[n0 - 1 + i].init(0);\\n for (int i = n; i < n0; ++i) nds[n0 - 1 + i].init_empty();\\n for (int i = n0 - 2; i >= 0; i--) nds[i].update();\\n }\\n\\n void update_min(int a, int b, lint x){\\n _update_min(x, a, b, root, 0, n0);\\n }\\n\\n void update_max(int a, int b, lint x){\\n _update_max(x, a, b, root, 0, n0);\\n }\\n\\n void add_val(int a, int b, lint x){\\n _add_val(x, a, b, root, 0, n0);\\n }\\n\\n void update_val(int a, int b, lint x){\\n _update_val(x, a, b, root, 0, n0);\\n }\\n\\n lint query_max(int a, int b){\\n return _query_max(a, b, root, 0, n0);\\n }\\n\\n lint query_min(int a, int b){\\n return _query_min(a, b, root, 0, n0);\\n }\\n\\n lint query_sum(int a, int b){\\n return _query_sum(a, b, root, 0, n0);\\n }\\n};\\n\\n\\nint main(void){\\n int N;\\n cin >> N;\\n int A[N];\\n rep(i,N) cin >> A[i];\\n int n=N/2;\\n SegmentTreeBeats seg(n);\\n rep(i,n) seg.update_val(i,i+1,A[i]);\\n for(int i=n;i<N;i++) seg.add_val(n-1+(n-i),n+(n-i),-A[i]);\\n int Q;\\n cin >> Q;\\n rep(i,Q){\\n int l,r,x;\\n cin >> l >> r >> x;\\n l--,r--;\\n if(l<n){\\n seg.add_val(l,min(n,r+1),x);\\n }\\n if(r>=n){\\n int R=(N-1-l);\\n if(l<n) R=n-1;\\n int L=(N-1-r);\\n seg.add_val(L,R+1,-x);\\n }\\n bool chk=true;\\n if(seg.query_min(0,n)!=0) chk=false;\\n if(seg.query_max(0,n)!=0) chk=false;\\n if(chk) cout << 1 << endl;\\n else cout << 0 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 54604,\n \"score_of_the_acc\": -1.2834,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2777_4927055\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n for(int& x : a) cin >> x;\\n for(int i = 0; i < n / 2; i++){\\n a[i] -= a.rbegin()[i];\\n a.rbegin()[i] = -a[i];\\n }\\n a.push_back(0);\\n adjacent_difference(a.begin(), a.end(), a.begin());\\n int zero = 0;\\n for(int x : a) zero += !x;\\n int q;\\n cin >> q;\\n while(q--){\\n int l, r, x;\\n cin >> l >> r >> x;\\n l--;\\n {\\n zero -= !a[l];\\n a[l] += x;\\n zero += !a[l];\\n zero -= !a[r];\\n a[r] -= x;\\n zero += !a[r];\\n }\\n tie(l, r) = pair{n - r, n - l};\\n x = -x;\\n {\\n zero -= !a[l];\\n a[l] += x;\\n zero += !a[l];\\n zero -= !a[r];\\n a[r] -= x;\\n zero += !a[r];\\n }\\n cout << (zero == n + 1) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 8608,\n \"score_of_the_acc\": -0.3891,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2777_4926816\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\n#define LLINF 100000000000000\\n\\nstruct StarrySkyTree {\\n int segn2;\\n vector<ll> data, s_data;\\n\\n StarrySkyTree(int n) {\\n for (segn2 = 1; segn2 < n; segn2 *= 2)\\n ;\\n data.assign(segn2 * 2, 0);\\n s_data.assign(segn2 * 2, 0);\\n }\\n\\n ll query(int a, int b, int l = 0, int r = -1, int k = 0) {\\n if (r == -1) r = segn2;\\n if (r <= a || b <= l) return LLINF;\\n if (a <= l && r <= b) return data[k] + s_data[k];\\n return min(query(a, b, l, (l + r) / 2, k * 2 + 1), query(a, b, (l + r) / 2, r, k * 2 + 2));\\n }\\n\\n ll add(int a, int b, ll x, int l = 0, int r = -1, int k = 0) {\\n if (r == -1) r = segn2;\\n if (a <= l && r <= b)\\n s_data[k] += x;\\n else if (a < r && l < b)\\n data[k] = min(add(a, b, x, l, (l + r) / 2, k * 2 + 1), add(a, b, x, (l + r) / 2, r, k * 2 + 2));\\n\\n return data[k] + s_data[k];\\n }\\n};\\n\\nint main() {\\n int N;\\n\\n scanf(\\\"%d\\\", &N);\\n\\n StarrySkyTree seg1(N / 2), seg2(N / 2);\\n\\n auto add = [&](int l, int r, ll x) {\\n if (l < N / 2) {\\n seg1.add(l, min(r, N / 2), x);\\n seg2.add(l, min(r, N / 2), -x);\\n }\\n r = N - r;\\n l = N - l;\\n swap(l, r);\\n if (l < N / 2) {\\n seg1.add(l, min(r, N / 2), -x);\\n seg2.add(l, min(r, N / 2), x);\\n }\\n };\\n\\n for (int i = 0; i < N; i++) {\\n int S;\\n scanf(\\\"%d\\\", &S);\\n add(i, i + 1, S);\\n }\\n\\n int Q;\\n\\n scanf(\\\"%d\\\", &Q);\\n\\n for (int i = 0; i < Q; i++) {\\n int l, r, x;\\n scanf(\\\"%d%d%d\\\", &l, &r, &x);\\n l--;\\n add(l, r, x);\\n\\n int a = seg1.query(0, N / 2);\\n int b = seg2.query(0, N / 2);\\n\\n puts(a == 0 && b == 0 ? \\\"1\\\" : \\\"0\\\");\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 19216,\n \"score_of_the_acc\": -0.8314,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2777_4471608\",\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;\\nusing lint = long long int;\\nlong long int INF = 1001001001001001LL;\\nint inf = 1000000007;\\nlong long int MOD = 1000000007LL;\\ndouble PI = 3.1415926535897932;\\n\\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\\n\\n#define ALL(a) a.begin(),a.end()\\n#define RALL(a) a.rbegin(),a.rend()\\n\\n/* do your best */\\n\\n// quoted from beet-aizu\\ntemplate <typename T,typename E, typename F, typename G, typename H>\\nstruct LazySegmentTree{\\n //using F = function<T(T,T)>;\\n //using G = function<T(T,E)>;\\n //using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n LazySegmentTree(F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){}\\n\\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(const vector<T> &v){\\n int n_=v.size();\\n init(n_);\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n inline T reflect(int k){\\n return laz[k]==ei?dat[k]:g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n inline void thrust(int k){\\n for(int i=height;i;i--) eval(k>>i);\\n }\\n inline void recalc(int k){ \\n while(k>>=1)\\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));\\n }\\n void update(int a,int b,E x){\\n thrust(a+=n);\\n thrust(b+=n-1);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n recalc(a);\\n recalc(b);\\n }\\n void set_val(int a,T x){\\n thrust(a+=n);\\n dat[a]=x;laz[a]=ei;\\n recalc(a);\\n }\\n T query(int a,int b){\\n thrust(a+=n);\\n thrust(b+=n-1);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n};\\n\\n/* \\n * [考えるべきこと]\\n * 区間をマージしてから作用素を作用させても、作用素を作用させてから区間をマージするのと結果が同じ\\n * 複数の作用素をマージして一度に作用させられること\\n * 作用素を伝搬し終わっているのかの判定に必要（まあこれは満たされていなくても最悪どうにかなる）\\n * O(N) とかだと困る（setのマージとか）\\n * 区間の長さに比例して作用が変わるときは，practice/RSRA や Library-Checher の RangeAffineRangeSum を参照する\\n * \\n */\\n\\n/** テンプレ\\nint main(){\\n using T = ***; // type T\\n using E = ***; // type E\\n auto f = [](T a, T b){ // return type T value\\n return ***;\\n };\\n auto g = [](T a, E b){ // return type T value\\n return ***;\\n };\\n auto h = [](E a, E b){ // return type E value\\n return ***;\\n };\\n T ti = ***; // identity element\\n E ei = ***; // identity element\\n LazySegmentTree<T, E, decltype(f), decltype(g), decltype(h)> sg(f, g, h, ti, ei); // don't change\\n sg.build(***);\\n}\\n**/\\n\\n\\n#define int long long\\n\\n\\nsigned main() {\\n \\n int n; cin >> n;\\n vector<lint> s(n);\\n for (int i = 0; i < n; i++) {\\n cin >> s[i];\\n }\\n\\n vector<lint> dat(n / 2);\\n for (int i = 0; i < n / 2; i++) {\\n dat[i] = s[i] - s[n - i - 1];\\n }\\n\\n auto f1 = [](int a, int b){ return min(a, b); };\\n auto g1 = [](int a, int b){ return a + b; };\\n auto h1 = [](int a, int b){ return a + b; };\\n LazySegmentTree<int, int, decltype(f1), decltype(g1), decltype(h1)> sgmin(f1, g1, h1, INT_MAX, 0);\\n sgmin.build(dat);\\n\\n auto f2 = [](int a, int b){ return max(a, b); };\\n auto g2 = [](int a, int b){ return a + b; };\\n auto h2 = [](int a, int b){ return a + b; };\\n LazySegmentTree<int, int, decltype(f2), decltype(g2), decltype(h2)> sgmax(f2, g2, h2, -INT_MAX, 0);\\n sgmax.build(dat);\\n \\n /*cerr << \\\"min\\\" << endl;\\n for (int i = 0; i < n / 2; i++) {\\n cerr << sgmin.query(i, i + 1) << \\\" \\\";\\n }\\n cerr << endl;\\n cerr << \\\"max\\\" << endl;\\n for (int i = 0; i < n / 2; i++) {\\n cerr << sgmax.query(i, i + 1) << \\\" \\\";\\n }\\n cerr << endl;\\n */\\n\\n int q; cin >> q;\\n for (int i = 0; i < q; i++) {\\n int l, r, x; cin >> l >> r >> x;\\n l--;\\n r--;\\n \\n // [0, n / 2)\\n // [n / 2, n)\\n if (r < n / 2) {\\n sgmin.update(l, r + 1, x);\\n sgmax.update(l, r + 1, x);\\n } else if (l >= n / 2) {\\n int ll = n - r - 1;\\n int rr = n - l - 1;\\n\\n sgmin.update(ll, rr + 1, -x);\\n sgmax.update(ll, rr + 1, -x);\\n } else {\\n // cerr << l << \\\" \\\" << n / 2 << \\\" \\\" << x << endl;\\n sgmin.update(l, n / 2, x);\\n sgmax.update(l, n / 2, x);\\n \\n int ll = n - r - 1;\\n // cerr << ll << \\\" \\\" << n / 2 << \\\" \\\" << -x << endl;\\n sgmin.update(ll, n / 2, -x);\\n sgmax.update(ll, n / 2, -x);\\n }\\n\\n // cerr << \\\"min\\\" << endl;\\n /*\\n for (int i = 0; i < n / 2; i++) {\\n cerr << sgmin.query(i, i + 1) << \\\" \\\";\\n }\\n cerr << endl;\\n cerr << \\\"max\\\" << endl;\\n for (int i = 0; i < n / 2; i++) {\\n cerr << sgmax.query(i, i + 1) << \\\" \\\";\\n }\\n cerr << endl;\\n\\n\\n // 左 - 右をしているので\\n cerr << sgmin.query(0, n / 2) << \\\" \\\" << sgmax.query(0, n / 2) << endl;\\n\\n */\\n cout << (sgmin.query(0, n / 2) == 0 and sgmax.query(0, n / 2) == 0) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 25028,\n \"score_of_the_acc\": -1.1515,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2777_4471497\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <functional>\\nusing namespace std;\\n\\ntemplate <typename T, typename E>\\nstruct LazySegmentTree{\\nprivate:\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n int n, height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n T reflect(int k){\\n return laz[k] == ei ? dat[k] : g(dat[k],laz[k]);\\n }\\n void propagate(int k){\\n if(laz[k] == ei) return;\\n if(k >= n){\\n dat[k] = reflect(k);\\n laz[k] = ei;\\n return;\\n }\\n laz[k<<1|0] = h(laz[k<<1|0],laz[k]);\\n laz[k<<1|1] = h(laz[k<<1|1],laz[k]);\\n dat[k] = reflect(k);\\n laz[k] = ei;\\n }\\n void thrust(int k){\\n for(int i = height; i >= 0; --i)\\n propagate(k>>i);\\n }\\n void recalc(int k){\\n while(k >>= 1){\\n dat[k] = f(reflect(k<<1|0),reflect(k<<1|1));\\n }\\n }\\npublic:\\n LazySegmentTree(F f,G g, H h, T ti, E ei) :\\n f(f), g(g), h(h), ti(ti), ei(ei) {}\\n void build(int n_){\\n n = n_;\\n height = 2;\\n while(n_ >>= 1) ++height;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(const vector<T> &v){\\n int n_ = v.size();\\n build(n_);\\n for(int i = 0; i < n; ++i) dat[n+i]=v[i];\\n for(int i = n-1; i >= 0; --i)\\n dat[i]=f(dat[i<<1|0],dat[i<<1|1]);\\n }\\n void update(int l_, int r_, E x){\\n if(l_ >= r_) return;\\n l_ += n, r_ += n;\\n thrust(l_);\\n thrust(r_-1);\\n for(int l = l_, r = r_;l < r; l >>= 1, r >>= 1){\\n if(l&1) laz[l] = h(laz[l],x), ++l;\\n if(r&1) --r, laz[r] = h(laz[r],x);\\n }\\n recalc(l_);\\n recalc(r_-1);\\n }\\n void set_val(int a, T x){\\n thrust(a+=n);\\n dat[a] = x;\\n laz[a] = ei;\\n recalc(a);\\n }\\n T query(int l, int r){\\n if(l >= r) return ti;\\n l += n;\\n r += n;\\n thrust(l);\\n thrust(r-1);\\n T vl = ti, vr = ti;\\n for(; l < r; l >>= 1, r >>= 1){\\n if(l&1) vl = f(vl,reflect(l++));\\n if(r&1) vr = f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n};\\n\\nint main(){\\n using ll = long long;\\n using T = pair<ll,ll>;\\n using E = ll;\\n function<T(T,T)> f = [](T a, T b) -> T {\\n return {max(a.first,b.first),min(a.second,b.second)};\\n };\\n function<T(T,E)> g = [](T a, E b) -> T {\\n return {a.first+b,a.second+b};\\n };\\n function<E(E,E)> h = [](E a, E b){\\n return a+b;\\n };\\n const ll INF = 1e9;\\n T ti = {-INF,INF};\\n E ei = 0;\\n LazySegmentTree<T,E> st(f,g,h,ti,ei);\\n\\n int N;\\n cin >> N;\\n vector<int> S(N);\\n for(int i = 0; i < N; ++i){\\n cin >> S[i];\\n }\\n int n = N/2;\\n vector<T> A(n);\\n for(int i = 0; i < n; ++i){\\n A[i] = {S[i]-S[N-1-i], S[i]-S[N-1-i]};\\n }\\n\\n int Q;\\n cin >> Q;\\n st.build(A);\\n while(Q--){\\n int l, r, x;\\n cin >> l >> r >> x;\\n --l, --r;\\n if(l >= n){\\n l = n - 1 - (l-n);\\n r = n - 1 - (r-n);\\n // cerr << l << \\\" \\\" << r << endl;\\n st.update(r,l+1,-x);\\n }else if(r < n){\\n st.update(l,r+1,x);\\n }else{\\n st.update(l,n,x);\\n r = n - 1 - (r-n);\\n // cerr << r << endl;\\n st.update(r,n,-x);\\n }\\n // for(int i = 0; i < n; ++i){\\n // cerr << \\\"(\\\" << st.query(i,i+1).first << \\\", \\\" << st.query(i,i+1).second << \\\") \\\";\\n // }\\n // cerr << endl;\\n cout << (st.query(0,n) == make_pair(0LL,0LL)) << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 20492,\n \"score_of_the_acc\": -0.9881,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2777_4096580\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\n// Segment Tree\\ntemplate<class Monoid, class Action> struct SegTree {\\n using FuncMonoid = function< Monoid(Monoid, Monoid) >;\\n using FuncAction = function< void(Monoid&, Action) >;\\n using FuncLazy = function< void(Action&, Action) >;\\n FuncMonoid FM;\\n FuncAction FA;\\n FuncLazy FL;\\n Monoid UNITY_MONOID;\\n Action UNITY_LAZY;\\n int SIZE, HEIGHT;\\n vector<Monoid> dat;\\n vector<Action> lazy;\\n\\n SegTree() { }\\n SegTree(int n, const FuncMonoid fm, const FuncAction fa, const FuncLazy fl,\\n const Monoid &unity_monoid, const Action &unity_lazy)\\n : FM(fm), FA(fa), FL(fl), UNITY_MONOID(unity_monoid), UNITY_LAZY(unity_lazy) {\\n SIZE = 1; HEIGHT = 0;\\n while (SIZE < n) SIZE <<= 1, ++HEIGHT;\\n dat.assign(SIZE * 2, UNITY_MONOID);\\n lazy.assign(SIZE * 2, UNITY_LAZY);\\n }\\n void init(int n, const FuncMonoid fm, const FuncAction fa, const FuncLazy fl,\\n const Monoid &unity_monoid, const Action &unity_lazy) {\\n FM = fm; FA = fa; FL = fl;\\n UNITY_MONOID = unity_monoid; UNITY_LAZY = unity_lazy;\\n SIZE = 1; HEIGHT = 0;\\n while (SIZE < n) SIZE <<= 1, ++HEIGHT;\\n dat.assign(SIZE * 2, UNITY_MONOID);\\n lazy.assign(SIZE * 2, UNITY_LAZY);\\n }\\n\\n /* set, a is 0-indexed */\\n void set(int a, const Monoid &v) { dat[a + SIZE] = v; }\\n void build() {\\n for (int k = SIZE - 1; k > 0; --k)\\n dat[k] = FM(dat[k*2], dat[k*2+1]);\\n }\\n\\n /* update [a, b) */\\n inline void evaluate(int k) {\\n if (lazy[k] == UNITY_LAZY) return;\\n if (k < SIZE) FL(lazy[k*2], lazy[k]), FL(lazy[k*2+1], lazy[k]);\\n FA(dat[k], lazy[k]);\\n lazy[k] = UNITY_LAZY;\\n }\\n inline void update(int a, int b, const Action &v, int k, int l, int r) {\\n evaluate(k);\\n if (a <= l && r <= b) FL(lazy[k], v), evaluate(k);\\n else if (a < r && l < b) {\\n update(a, b, v, k*2, l, (l+r)>>1), update(a, b, v, k*2+1, (l+r)>>1, r);\\n dat[k] = FM(dat[k*2], dat[k*2+1]);\\n }\\n }\\n inline void update(int a, int b, const Action &v) { update(a, b, v, 1, 0, SIZE); }\\n\\n /* get [a, b) */\\n inline Monoid get(int a, int b, int k, int l, int r) {\\n evaluate(k);\\n if (a <= l && r <= b)\\n return dat[k];\\n else if (a < r && l < b)\\n return FM(get(a, b, k*2, l, (l+r)>>1), get(a, b, k*2+1, (l+r)>>1, r));\\n else\\n return UNITY_MONOID;\\n }\\n inline Monoid get(int a, int b) { return get(a, b, 1, 0, SIZE); }\\n inline Monoid operator [] (int a) { return get(a, a+1); }\\n /* debug */\\n void print() {\\n for (int i = 0; i < SIZE; ++i) { cout << (*this)[i]; if (i != SIZE) cout << \\\",\\\"; }\\n cout << endl;\\n }\\n};\\n\\nsigned main(){\\n ios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n cout << fixed << setprecision(20);\\n\\n ll m;\\n cin>>m;\\n ll a[m];\\n for(int i=0;i<m;i++){\\n cin>>a[i];\\n }\\n ll n = m/2;\\n ll INF = 1e10;\\n auto fm = [](long long a, long long b) { return max(a,b);};\\n auto fm2 = [](ll a,ll b){ return min(a,b);};\\n auto fa = [](long long &a, long long d) { a = a + d; };\\n auto fl = [](long long &d, long long e) { d = d + e; };\\n SegTree<long long, long long> seg(n+1, fm, fa, fl, 0, 0);\\n SegTree<ll,ll> seg2(n+1,fm2,fa,fl,0,0);\\n\\n for(int i=0;i<n;i++){\\n seg.update(i,i+1,a[i]-a[m-1-i]);\\n seg2.update(i,i+1,a[i]-a[m-1-i]);\\n }\\n int q;\\n cin>>q;\\n while(q--){\\n ll a,b,x;\\n cin>>a>>b>>x;\\n a--,b--;\\n seg.update(min(a,n),min(b+1,n),x);\\n seg2.update(min(a,n),min(b+1,n),x);\\n seg.update(min(m-1-b,n),min(m-a,n),-x);\\n seg2.update(min(m-1-b,n),min(n,m-a),-x);\\n\\n // cerr << \\\"d1 \\\"<<min(a,n) << \\\" \\\" << min(b+1,n) <<endl;\\n // cerr << \\\"d2 \\\"<<min(n,m-b) << \\\" \\\" << min(m-a,n) << endl;\\n // cerr<< seg.get(0,n) << \\\" \\\" << seg2.get(0,n) << \\\" \\\";\\n if(seg.get(0,n) == 0 && seg2.get(0,n)==0){\\n cout << 1 << \\\"\\\\n\\\";\\n }\\n else cout <<0 << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 23168,\n \"score_of_the_acc\": -1.0309,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2777_4096071\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"ctime\\\"\\n\\nusing namespace std;\\n\\nconstexpr long long int MOD = 1000000007;\\n//constexpr int MOD = 1000000007;\\n//constexpr int MOD = 998244353;\\n//constexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-8;\\n\\n//int N, M, K, H, W, L, R;\\nlong long int N, M, K, H, W, L, R;\\n\\nclass Segment_Tree {\\n\\tvector<long long int>v;\\n\\tvector<long long int>add;\\n\\tvector<long long int>modi;\\n\\tvector<int>l;\\n\\tvector<int>r;\\n\\tint num;\\n\\tlong long int ret;\\n\\tbool is_min;\\n\\tvoid Left(int place) {\\n\\t\\tif (place >= v.size() / 2) {\\n\\t\\t\\tl[place] = place - v.size() / 2;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tLeft(place * 2);\\n\\t\\tLeft(place * 2 + 1);\\n\\t\\tl[place] = l[place * 2];\\n\\t\\treturn;\\n\\t}\\n\\tvoid Right(int place) {\\n\\t\\tif (place >= v.size() / 2) {\\n\\t\\t\\tr[place] = place - v.size() / 2;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tRight(place * 2);\\n\\t\\tRight(place * 2 + 1);\\n\\t\\tr[place] = r[place * 2 + 1];\\n\\t\\treturn;\\n\\t}\\n\\tlong long int Update(int place) {\\n\\t\\tif (place >= v.size() / 2) {\\n\\t\\t\\treturn v[place];\\n\\t\\t}\\n\\t\\tif (is_min) {\\n\\t\\t\\tv[place] = min(Update(place * 2), Update(place * 2 + 1));\\n\\t\\t\\treturn v[place];\\n\\t\\t}\\n\\t\\tv[place] = max(Update(place * 2), Update(place * 2 + 1));\\n\\t\\treturn v[place];\\n\\t}\\n\\tvoid Modify(int a, int b, long long int num, int place) {\\n\\t\\tif (l[place] >= a && r[place] <= b) {\\n\\t\\t\\tmodi[place] = num;\\n\\t\\t\\tv[place] = num;\\n\\t\\t\\tadd[place] = 0;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif (l[place] > b || r[place] < a)return;\\n\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\\n\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place];\\n\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t}\\n\\t\\tadd[place * 2] += add[place];\\n\\t\\tadd[place * 2 + 1] += add[place];\\n\\t\\tadd[place] = 0;\\n\\t\\tModify(a, b, num, place * 2);\\n\\t\\tModify(a, b, num, place * 2 + 1);\\n\\t\\tif (is_min)v[place] = min(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\\n\\t\\telse v[place] = max(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\\n\\t\\treturn;\\n\\t}\\n\\tvoid Add(int a, int b, long long int num, int place) {\\n\\t\\tif (l[place] >= a && r[place] <= b) {\\n\\t\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\t\\tif (place * 2 < v.size()) {\\n\\t\\t\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\\n\\t\\t\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place];\\n\\t\\t\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t\\t}\\n\\t\\t\\tadd[place] += num;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif (l[place] > b || r[place] < a)return;\\n\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\\n\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place];\\n\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t}\\n\\t\\tadd[place * 2] += add[place];\\n\\t\\tadd[place * 2 + 1] += add[place];\\n\\t\\tadd[place] = 0;\\n\\t\\tAdd(a, b, num, place * 2);\\n\\t\\tAdd(a, b, num, place * 2 + 1);\\n\\t\\tif (is_min)v[place] = min(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\\n\\t\\telse v[place] = max(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\\n\\t\\treturn;\\n\\t}\\n\\tvoid RMQ(int a, int b, int place) {\\n\\t\\tif (l[place] >= a && r[place] <= b) {\\n\\t\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\t\\tif (place * 2 < v.size()) {\\n\\t\\t\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\\n\\t\\t\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place];\\n\\t\\t\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t\\t}\\n\\t\\t\\tif (is_min)ret = min(ret, v[place] + add[place]);\\n\\t\\t\\telse ret = max(ret, v[place] + add[place]);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif (l[place]>b || r[place]<a) return;\\n\\t\\tif (modi[place] != LLONG_MAX) {\\n\\t\\t\\tmodi[place * 2] = modi[place * 2 + 1] = modi[place];\\n\\t\\t\\tv[place * 2] = v[place * 2 + 1] = modi[place];\\n\\t\\t\\tadd[place * 2] = add[place * 2 + 1] = 0;\\n\\t\\t\\tmodi[place] = LLONG_MAX;\\n\\t\\t}\\n\\t\\tadd[place * 2] += add[place];\\n\\t\\tadd[place * 2 + 1] += add[place];\\n\\t\\tadd[place] = 0;\\n\\t\\tRMQ(a, b, place * 2);\\n\\t\\tRMQ(a, b, place * 2 + 1);\\n\\t\\tif (is_min)v[place] = min(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\\n\\t\\telse v[place] = max(v[place * 2] + add[place * 2], v[place * 2 + 1] + add[place * 2 + 1]);\\n\\t\\treturn;\\n\\t}\\npublic:\\n\\tSegment_Tree(int n, bool min) {\\n\\t\\tn++;\\n\\t\\tnum = 1;\\n\\t\\twhile (num < n * 2) {\\n\\t\\t\\tnum *= 2;\\n\\t\\t}\\n\\t\\tl.resize(num);\\n\\t\\tr.resize(num);\\n\\t\\tis_min = min;\\n\\t\\tif (min) {\\n\\t\\t\\tv.resize(num, MOD*MOD);\\n\\t\\t}\\n\\t\\telse v.resize(num, -MOD * MOD);\\n\\t\\tadd.resize(num, 0);\\n\\t\\tmodi.resize(num, MOD*MOD);\\n\\t\\tLeft(1);\\n\\t\\tRight(1);\\n\\t}\\n\\tvoid Insert(int place, long long int num, bool update) {\\n\\t\\tplace += v.size() / 2;\\n\\t\\tv[place] = num;\\n\\t\\tif (!update)return;\\n\\t\\tplace /= 2;\\n\\t\\twhile (place) {\\n\\t\\t\\tif (is_min)v[place] = min(v[place * 2], v[place * 2 + 1]);\\n\\t\\t\\telse v[place] = max(v[place * 2], v[place * 2 + 1]);\\n\\t\\t\\tplace /= 2;\\n\\t\\t}\\n\\t}\\n\\tvoid Modify(int a, int b, long long int num) {\\n\\t\\tModify(a, b, num, 1);\\n\\t}\\n\\tvoid Add(int a, int b, long long int num) {\\n\\t\\tAdd(a, b, num, 1);\\n\\t}\\n\\tvoid Init() {\\n\\t\\tUpdate(1);\\n\\t}\\n\\tlong long int RMQ(int a, int b) {\\n\\t\\tif (is_min)ret = LLONG_MAX;\\n\\t\\telse ret = LLONG_MIN;\\n\\t\\tRMQ(a, b, 1);\\n\\t\\treturn ret;\\n\\t}\\n};\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tlong long int sum = 0;\\n\\tcin >> N;\\n\\tSegment_Tree sg(N/2, true);\\n\\tvector<int>v(N);\\n\\tfor (auto &i : v)cin >> i;\\n\\tvector<long long int>w(N / 2);\\n\\tfor (int i = 0; i < N / 2; i++) {\\n\\t\\tw[i] = v[i] - v[N - 1 - i];\\n\\t\\tsum += w[i];\\n\\t\\tsg.Modify(i, i, w[i]);\\n\\t}\\n\\tcin >> K;\\n\\twhile (K--) {\\n\\t\\tcin >> L >> R >> M;\\n\\t\\tL--, R--;\\n\\t\\tif (R < N / 2) {\\n\\t\\t\\tsum += M * (R - L + 1);\\n\\t\\t\\tsg.Add(L, R, M);\\n\\t\\t}\\n\\t\\telse if (L >= N - N / 2) {\\n\\t\\t\\tsum -= M * (R - L + 1);\\n\\t\\t\\tsg.Add(N - 1 - R, N - 1 - L, -M);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tsum += M * (N / 2 - L);\\n\\t\\t\\tsg.Add(L, N / 2, M);\\n\\t\\t\\tsum -= M * (R + 1 - (N - (N / 2)));\\n\\t\\t\\tsg.Add(N - 1 - R, N / 2, -M);\\n\\t\\t}\\n\\t\\tif (sg.RMQ(0, N/2) == 0 && !sum)cout << 1 << endl;\\n\\t\\telse cout << 0 << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 23188,\n \"score_of_the_acc\": -0.7812,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2777_3967954\",\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\\ntemplate <typename MonoidType, typename OperatorType>\\nstruct LazySegmentTree {\\n using MMtoM = function< MonoidType(MonoidType, MonoidType) >;\\n using OOtoO = function< OperatorType(OperatorType, OperatorType) >;\\n using MOtoM = function< MonoidType(MonoidType, OperatorType) >;\\n using OItoO = function< OperatorType(OperatorType, int) >;\\n\\n // node, lazy, update flag (for lazy), identity element\\n int n;\\n vector<MonoidType> node;\\n vector<OperatorType> lazy;\\n vector<bool> need_update;\\n MonoidType E0;\\n OperatorType E1;\\n\\n // update / combine / lazy / accumulate function\\n MOtoM upd_f;\\n MMtoM cmb_f;\\n OOtoO lzy_f;\\n OItoO acc_f;\\n\\n void build(int m, vector<MonoidType> v = vector<MonoidType>()) {\\n if(v != vector<MonoidType>()) m = v.size();\\n n = 1; while(n < m) n *= 2;\\n\\n node = vector<MonoidType>(2*n-1, E0);\\n lazy = vector<OperatorType>(2*n-1, E1);\\n need_update = vector<bool>(2*n-1, false);\\n if(v != vector<MonoidType>()) {\\n for(int i=0; i<m; i++) {\\n node[n-1+i] = v[i];\\n }\\n for(int i=n-2; i>=0; i--) {\\n node[i] = cmb_f(node[2*i+1], node[2*i+2]);\\n }\\n }\\n }\\n\\n // initialize\\n LazySegmentTree() {}\\n LazySegmentTree(int n_, MonoidType E0_, OperatorType E1_,\\n MOtoM upd_f_, MMtoM cmb_f_, OOtoO lzy_f_, OItoO acc_f_,\\n vector<MonoidType> v = vector<MonoidType>()) :\\n E0(E0_), E1(E1_),\\n upd_f(upd_f_), cmb_f(cmb_f_), lzy_f(lzy_f_), acc_f(acc_f_) {\\n build(n_, v);\\n }\\n\\n void eval(int k, int l, int r) {\\n if(!need_update[k]) return;\\n node[k] = upd_f(node[k], acc_f(lazy[k], r - l));\\n if(r - l > 1) {\\n lazy[2*k+1] = lzy_f(lazy[2*k+1], lazy[k]);\\n lazy[2*k+2] = lzy_f(lazy[2*k+2], lazy[k]);\\n need_update[2*k+1] = need_update[2*k+2] = true;\\n }\\n lazy[k] = E1;\\n need_update[k] = false;\\n }\\n\\n void update(int a, int b, OperatorType x, int l, int r, int k) {\\n eval(k, l, r);\\n if(b <= l or r <= a) return;\\n if(a <= l and r <= b) {\\n lazy[k] = lzy_f(lazy[k], x);\\n need_update[k] = true;\\n eval(k, l, r);\\n }\\n else {\\n int mid = (l + r) / 2;\\n update(a, b, x, l, mid, 2*k+1);\\n update(a, b, x, mid, r, 2*k+2);\\n node[k] = cmb_f(node[2*k+1], node[2*k+2]);\\n }\\n }\\n\\n MonoidType query(int a, int b, int l, int r, int k) {\\n if(b <= l or r <= a) return E0;\\n eval(k, l, r);\\n if(a <= l and r <= b) return node[k];\\n int mid = (l + r) / 2;\\n MonoidType vl = query(a, b, l, mid, 2*k+1);\\n MonoidType vr = query(a, b, mid, r, 2*k+2);\\n return cmb_f(vl, vr);\\n }\\n\\n // update [a, b)-th element (applied value, x)\\n void update(int a, int b, OperatorType x) {\\n update(a, b, x, 0, n, 0);\\n }\\n\\n // range query for [a, b)\\n MonoidType query(int a, int b) {\\n return query(a, b, 0, n, 0);\\n }\\n\\n void dump() {\\n fprintf(stderr, \\\"[lazy]\\\\n\\\");\\n for(int i=0; i<2*n-1; i++) {\\n if(i == n-1) fprintf(stderr, \\\"xxx \\\");\\n if(lazy[i] == E1) fprintf(stderr, \\\" E \\\");\\n else fprintf(stderr, \\\"%3d \\\", lazy[i]);\\n }\\n fprintf(stderr, \\\"\\\\n\\\");\\n\\n fprintf(stderr, \\\"[node]\\\\n\\\");\\n for(int i=0; i<2*n-1; i++) {\\n if(i == n-1) fprintf(stderr, \\\"xxx \\\");\\n if(node[i] == E0) fprintf(stderr, \\\" E \\\");\\n else fprintf(stderr, \\\"%3d \\\", node[i]);\\n }\\n fprintf(stderr, \\\"\\\\n\\\");\\n }\\n};\\n\\nint main() {\\n int N; cin >> N;\\n vector<int> A(N);\\n for(int i=0; i<N; i++) cin >> A[i];\\n\\n // 差分: 左 - 右\\n vector<int> B(N);\\n int H = N / 2;\\n for(int i=0; i<H; i++) {\\n B[i] = A[i] - A[N-1-i];\\n }\\n\\n using PI = pair<ll, ll>;\\n\\n const PI E0(LONGINF, -LONGINF);\\n const ll E1 = 0;\\n LazySegmentTree<PI, ll> seg(H, E0, E1,\\n [](PI a, ll b) {\\n a.first += b;\\n a.second += b;\\n return a;\\n },\\n [](PI a, PI b) {\\n ll x = min(a.first, b.first);\\n ll y = max(a.second, b.second);\\n return make_pair(x, y);\\n },\\n [](ll a, ll b) {\\n return a + b;\\n },\\n [](ll a, int x) {\\n return a;\\n },\\n vector<PI>(H, make_pair(0, 0)));\\n for(int i=0; i<H; i++) seg.update(i, i+1, B[i]);\\n\\n int Q; cin >> Q;\\n for(int i=0; i<Q; i++) {\\n int l, r, x; cin >> l >> r >> x; l--;\\n\\n int dl = max(H - l, 0);\\n int dr = max(r - H, 0);\\n\\n int d = min(dl, dr);\\n // fprintf(stderr, \\\"### query %d: d = %d\\\\n\\\", i, d);\\n if(d > 0) {\\n int ql = l, qr = H - d;\\n // fprintf(stderr, \\\"? 1: l = %d, r = %d\\\\n\\\", ql, qr);\\n if(ql < qr) {\\n // fprintf(stderr, \\\"q1: l = %d, r = %d\\\\n\\\", ql, qr);\\n seg.update(ql, qr, x);\\n }\\n }\\n if(d > 0) {\\n int ql = N - r, qr = H - d;\\n // fprintf(stderr, \\\"? 2: l = %d, r = %d\\\\n\\\", ql, qr);\\n if(ql < qr) {\\n // fprintf(stderr, \\\"q2: l = %d, r = %d\\\\n\\\", ql, qr);\\n seg.update(ql, qr, -x);\\n }\\n }\\n if(d == 0) {\\n int ql = l, qr = r;\\n if(ql >= H) {\\n swap(ql, qr);\\n ql = N - ql, qr = N - qr, x = -x;\\n }\\n // fprintf(stderr, \\\"q3: l = %d, r = %d\\\\n\\\", ql, qr);\\n seg.update(ql, qr, x);\\n }\\n\\n auto res = seg.query(0, H);\\n if(res.first == 0 and res.second == 0) cout << 1 << endl;\\n else cout << 0 << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 26868,\n \"score_of_the_acc\": -1.3173,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2777_3858356\",\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=pair<ll,pll>;\\nusing tuplis2=pair<pll,ll>;\\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 ll MOD=1000000007;\\nconst ll MODD=998244353;\\nconst ld DINF=numeric_limits<ld>::infinity();\\nconst ld EPS=1e-9;\\nconst ld PI=3.141592653589793238462643383279;\\nconst vector<ll>four{0,1,0,-1,0};\\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,a) for(auto &i:a)\\n#define sum(...) accumulate(range(__VA_ARGS__),0LL)\\n#define dsum(...) accumulate(range(__VA_ARGS__),double(0))\\n#define _range(i) (i).begin(),(i).end()\\n#define _range2(i,k) (i).begin(),(i).begin()+k\\n#define _range3(i,a,b) (i).begin()+a,(i).begin()+b\\n#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)\\n#define _rrange(i) (i).rbegin(),(i).rend()\\n#define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k\\n#define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\\n#define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__)\\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 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,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ninline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;while(b){ll c=b;b=a%b;a=c;}return a;}\\ninline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,b);}\\ntemplate<class T> inline constexpr T min(vector<T> &v){return *min_element(range(v));}\\ninline char min(string &v){return *min_element(range(v));}\\ntemplate<class T> inline constexpr T max(vector<T> &v){return *max_element(range(v));}\\ninline char max(string &v){return *max_element(range(v));}\\ninline constexpr ll intpow(ll a,ll b){ll ans=1;for(ll i=1;b;i*=2){if(b&i){b^=i;ans*=a;}a*=a;}return ans;}\\ntemplate<typename T>\\ninline constexpr bool chmin(T &mn,const T &cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}\\ntemplate<typename T>\\ninline constexpr bool chmax(T &mx,const T &cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}\\ntemplate<class T> unordered_map<T,ll> press(vector<T> &a){ auto b = a; sort(range(b)); b.erase(unique(range(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(range(b)); b.erase(unique(range(b)), b.end()); map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }\\ninline int scan(){ return getchar(); }\\ninline void scan(int &a){ scanf(\\\"%d\\\", &a); }\\ninline void scan(unsigned &a){ scanf(\\\"%u\\\", &a); }\\ninline void scan(long &a){ scanf(\\\"%ld\\\", &a); }\\ninline void scan(long long &a){ scanf(\\\"%lld\\\", &a); }\\ninline void scan(unsigned long long &a){ scanf(\\\"%llu\\\", &a); }\\ninline void scan(char &a){ cin >> a; }\\ninline void scan(float &a){ scanf(\\\"%f\\\", &a); }\\ninline void scan(double &a){ scanf(\\\"%lf\\\", &a); }\\ninline void scan(long double &a){ scanf(\\\"%Lf\\\", &a); }\\ninline void scan(vector<bool> &vec){ for(unsigned i = 0; i < vec.size(); i++) { int a; scan(a); vec[i] = a; } }\\ninline void scan(string &a){ cin >> a; }\\ntemplate<class T> inline void scan(vector<T> &vec);\\ntemplate<class T, size_t size> inline void scan(array<T, size> &vec);\\ntemplate<class T, class L> inline void scan(pair<T, L> &p);\\ntemplate<class T, size_t size> inline void scan(T (&vec)[size]);\\ntemplate<class T> inline void scan(vector<T> &vec){ for(auto &i : vec) scan(i); }\\ntemplate<class T, size_t size> inline void scan(array<T, size> &vec){ for(auto &i : vec) scan(i); }\\ntemplate<class T, class L> inline void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }\\ntemplate<class T, size_t size> inline void scan(T (&vec)[size]){ for(auto &i : vec) scan(i); }\\ntemplate<class T> inline void scan(T &a){ cin>>a; }\\ninline void in(){}\\ntemplate <class Head, class... Tail> inline void in(Head &head, Tail&... tail){ scan(head); in(tail...); }\\ninline void print(){ putchar(' '); }\\ninline void print(const bool &a){ printf(\\\"%d\\\", a); }\\ninline void print(const int &a){ printf(\\\"%d\\\", a); }\\ninline void print(const unsigned &a){ printf(\\\"%u\\\", a); }\\ninline void print(const long &a){ printf(\\\"%ld\\\", a); }\\ninline void print(const long long &a){ printf(\\\"%lld\\\", a); }\\ninline void print(const unsigned long long &a){ printf(\\\"%llu\\\", a); }\\ninline void print(const char &a){ printf(\\\"%c\\\", a); }\\ninline void print(const char a[]){ printf(\\\"%s\\\", a); }\\ninline void print(const float &a){ printf(\\\"%.15f\\\", a); }\\ninline void print(const double &a){ printf(\\\"%.15f\\\", a); }\\ninline void print(const long double &a){ printf(\\\"%.15Lf\\\", a); }\\ntemplate<class T> void print(const vector<T> &vec);\\ntemplate<class T, size_t size> void print(const array<T, size> &vec);\\ntemplate<class T, class L> void print(const pair<T, L> &p);\\ntemplate<class T, size_t size> inline void print(const T (&vec)[size]);\\ntemplate<class T> void print(const vector<T> &vec){ if(vec.empty()) return; print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, size_t size> void print(const array<T, size> &vec){ print(vec[0]); for(auto i = vec.begin(); ++i != vec.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> inline void print(const T (&vec)[size]){ print(vec[0]); for(auto i = vec; ++i != end(vec); ){ putchar(' '); print(*i); } }\\ntemplate<class T> inline void print(const T &a){ cout << a; }\\ninline int out(){ putchar('\\\\n'); return 0; }\\ntemplate<class T> inline int out(const T &t){ print(t); putchar('\\\\n'); return 0; }\\ntemplate<class Head, class... Tail> inline int out(const Head &head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\\ntemplate <class T> inline void err(T t){cerr<<t<<'\\\\n';}\\ninline void err(){cerr<<'\\\\n';}\\ninline int first(const bool &i){return out(i?\\\"first\\\":\\\"second\\\");}\\ninline int yes(const bool &i){return out(i?\\\"yes\\\":\\\"no\\\");}\\ninline int Yes(const bool &i){return out(i?\\\"Yes\\\":\\\"No\\\");}\\ninline int YES(const bool &i){return out(i?\\\"YES\\\":\\\"NO\\\");}\\ninline int Yay(const bool &i){return out(i?\\\"Yay!\\\":\\\":(\\\");}\\ninline int Possible(const bool &i){return out(i?\\\"Possible\\\":\\\"Impossible\\\");}\\ninline int POSSIBLE(const bool &i){return out(i?\\\"POSSIBLE\\\":\\\"IMPOSSIBLE\\\");}\\ninline void Case(ll i){printf(\\\"Case #%lld: \\\",i);}\\n\\n\\n\\ntemplate<class T>\\nstruct SegmentTree{\\n using F = function<T(T, T)>;\\n ll size = 1;\\n vector<T> data;\\n const F f;\\n const T def_value;\\n SegmentTree(ll n, const T& def_value, const F& f): f(f), def_value(def_value){\\n while(size < n) size *= 2;\\n data.assign(size * 2, def_value);\\n }\\n SegmentTree(const vector<T>& v, const T& def_value, const F& f): f(f), def_value(def_value){\\n while(size < v.size()) size *= 2;\\n data.assign(size * 2, def_value);\\n for(ll i = 0; i < v.size(); i++) data[size + i] = v[i];\\n for(ll i = size; --i;) data[i] = f(data[i * 2], data[i * 2 + 1]);\\n }\\n T operator[](ll at) const {\\n return data[size + at];\\n }\\n void update(ll at){\\n while(at /= 2) data[at] = f(data[at * 2], data[at * 2 + 1]);\\n }\\n void set(ll at, const T& val){\\n at += size;\\n data[at] = val;\\n update(at);\\n }\\n void add(ll at, const T& val){\\n at += size;\\n data[at] += val;\\n update(at);\\n }\\n T get(ll l, ll r) const {\\n T L = def_value, R = def_value;\\n l += size; r += size;\\n for(; l < r; l /= 2, r /= 2){\\n if(l & 1) L = f(L, data[l++]);\\n if(r & 1) R = f(data[--r], R);\\n }\\n return f(L, R);\\n }\\n void clear(){\\n for(auto& i : data) i = def_value;\\n }\\n};\\ntemplate<class T>\\nstruct SegmentTreeMin : SegmentTree<T>{\\n SegmentTreeMin(ll n, const T& def_value) : SegmentTree<T>(n, def_value, [](T a, T b){return min(a, b);}){}\\n SegmentTreeMin(const vector<T>& v, const T& def_value) : SegmentTree<T>(v, def_value, [](T a, T b){return min(a, b);}){}\\n};\\ntemplate<class T>\\nstruct SegmentTreeMax : SegmentTree<T>{\\n SegmentTreeMax(ll n, const T& def_value) : SegmentTree<T>(n, def_value, [](T a, T b){return max(a, b);}){}\\n SegmentTreeMax(const vector<T>& v, const T& def_value) : SegmentTree<T>(v, def_value, [](T a, T b){return max(a, b);}){}\\n};\\ntemplate<class T>\\nstruct SegmentTreeSum : SegmentTree<T>{\\n SegmentTreeSum(ll n, const T& def_value = T()) : SegmentTree<T>(n, def_value, [](T a, T b){return a + b;}){}\\n SegmentTreeSum(const vector<T>& v, const T& def_value = T()) : SegmentTree<T>(v, def_value, [](T a, T b){return a + b;}){}\\n};\\nsigned main(){\\n LL(n);\\n VEC(ll,a,n);\\n rep(n/2)a[i]-=a[n-1-i];\\n a.resize(n/=2);\\n vec(ll,b,n+1);\\n b[0]=a[0];\\n rep(n-1)b[i+1]=a[i+1]-a[i];\\n b[n]=-sum(b);\\n SegmentTreeMax<ll>seg(b,0);\\n LL(q);\\n rep(_,q){\\n LL(l,r,x);\\n if(r<=n){\\n seg.add(l-1,x);\\n seg.add(r,-x);\\n }\\n elif(l>n){\\n l=2*n-l;\\n r=2*n-r;\\n seg.add(r,-x);\\n seg.add(l+1,x);\\n }\\n else{\\n seg.add(l-1,x);\\n r=2*n-r;\\n seg.add(r,-x);\\n }\\n out(!seg.data[1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 12844,\n \"score_of_the_acc\": -0.1613,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2777_3234237\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2777.cc: Kitsuchiri\\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 500000;\\nconst int MAX_M = MAX_N / 2; // = 250000\\nconst int MAX_E2 = 1 << 19; // = 524288\\nconst int INF = 1 << 30;\\n\\n/* typedef */\\n\\ntemplate <typename T, const int MAX_E2>\\nstruct SegTreeSumMinMax {\\n int n, e2, inf;\\n T sums[MAX_E2], mins[MAX_E2], maxs[MAX_E2], ds[MAX_E2];\\n SegTreeSumMinMax() {}\\n\\n void init(int _n, int _inf) {\\n n = _n, inf = _inf;\\n for (e2 = 1; e2 < n; e2 <<= 1);\\n fill(sums, sums + MAX_E2, 0);\\n fill(mins, mins + MAX_E2, inf);\\n fill(maxs, maxs + MAX_E2, -inf);\\n fill(ds, ds + MAX_E2, 0);\\n }\\n\\n void set(int i, T v) { sums[e2 - 1 + i] = v; }\\n \\n void setall() {\\n for (int i = e2 * 2 - 2; i >= e2 - 1; i--)\\n mins[i] = maxs[i] = sums[i];\\n for (int i = e2 - 2; i >= 0; i--) {\\n int i0 = i * 2 + 1, i1 = i0 + 1;\\n sums[i] = sums[i0] + sums[i1];\\n mins[i] = min(mins[i0], mins[i1]);\\n maxs[i] = max(maxs[i0], maxs[i1]);\\n }\\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 sums[k] += v, mins[k] += v, maxs[k] += v, ds[k] += v;\\n return;\\n }\\n\\n int im = (i0 + i1) / 2, k0 = k * 2 + 1, k1 = k0 + 1;\\n if (ds[k] != 0) {\\n sums[k0] += ds[k], mins[k0] += ds[k], maxs[k0] += ds[k], ds[k0] += ds[k];\\n sums[k1] += ds[k], mins[k1] += ds[k], maxs[k1] += ds[k], ds[k1] += ds[k];\\n ds[k] = 0;\\n }\\n\\n add_range(r0, r1, v, k0, i0, im);\\n add_range(r0, r1, v, k1, im, i1);\\n\\n sums[k] = sums[k0] + sums[k1];\\n mins[k] = min(mins[k0], mins[k1]);\\n maxs[k] = max(maxs[k0], maxs[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\\nint as[MAX_N];\\nSegTreeSumMinMax<int,MAX_E2> st;\\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 int m = n / 2;\\n\\n st.init(m, INF);\\n for (int i = 0; i < m; i++) st.set(i, as[i] - as[n - 1 - i]);\\n st.setall();\\n\\n int q;\\n scanf(\\\"%d\\\", &q);\\n while (q--) {\\n int l, r, x;\\n scanf(\\\"%d%d%d\\\", &l, &r, &x);\\n l--;\\n\\n if (r <= m) st.add_range(l, r, x);\\n else if (m <= l) st.add_range(n - r, n - l, -x);\\n else {\\n int l0 = m - l, r0 = r - m;\\n if (l0 > r0) st.add_range(l, n - r, x);\\n else if (l0 < r0) st.add_range(n - r, l, -x);\\n }\\n\\n printf(\\\"%d\\\\n\\\", (st.mins[0] == 0 && st.maxs[0] == 0) ? 1 : 0);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 13348,\n \"score_of_the_acc\": -0.283,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2777_2917979\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \\\"(\\\" << o.first << \\\",\\\" << o.second << \\\")\\\"; return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \\\" \\\";} return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \\\"{ \\\"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \\\":\\\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \\\", \\\"; } out << \\\" }\\\"; return out; }\\n\\n/* [0..N-1] */\\nconst ll INIT = 0; // 問題に合わせる\\nstruct SegTree {\\n int N;\\n ll init_v;\\n vector<pll> node;\\n vector<ll> lazy;\\n \\n SegTree(int _N):init_v(INIT) {\\n N = 1;\\n while (N < _N) N *= 2;\\n node.resize(2 * N - 1, {init_v,init_v});\\n lazy.resize(2 * N - 1, init_v);\\n }\\n pll merge(pll a, pll b) {\\n pll ret = pll(-1e9, 1e9);\\n ret.first = max(a.first, b.first);\\n ret.second = min(a.second, b.second);\\n return ret;\\n }\\n void lazy_evaluate(int l, int r,int k){\\n node[k].first += lazy[k];\\n node[k].second += lazy[k];\\n if(r - l > 1){\\n lazy[2 * k + 1] += lazy[k];\\n lazy[2 * k + 2] += lazy[k];\\n }\\n lazy[k] = 0;\\n }\\n \\n /* [a,b) 引数の範囲に注意!! s~tまでを更新→update(s,t+1,~) */\\n void update(int a, int b, ll x) { update(a, b, 0, 0, N, x); }\\n void update(int a, int b, int k, int l, int r, ll x) {\\n lazy_evaluate(l,r,k);\\n if (r <= a || b <= l) return;\\n if (a <= l && r <= b) {\\n lazy[k] += x;\\n lazy_evaluate(l,r,k);\\n }\\n else {\\n update(a, b, 2 * k + 1, l, (l + r) / 2, x);\\n update(a, b, 2 * k + 2, (l + r) / 2, r, x);\\n node[k] = merge(node[2 * k + 1],node[2 * k + 2]);\\n }\\n }\\n \\n /* [a,b) 引数の範囲に注意!! */\\n pll query(int a, int b) { return query(a, b, 0, 0, N); }\\n pll query(int a, int b, int k, int l, int r) {\\n lazy_evaluate(l, r, k);\\n if (r <= a || b <= l) return {-INF,INF}; // min : LLONG_MAX , max : LLONG_MIN\\n if (a <= l && r <= b) {\\n return node[k];\\n }\\n else {\\n pll vl = query(a, b, 2 * k + 1, l, (l + r) / 2);\\n pll vr = query(a, b, 2 * k + 2, (l + r) / 2, r);\\n return merge(vl, vr);\\n }\\n }\\n};\\n\\nvoid solve() {\\n int N; cin >> N;\\n vector<ll> kassa(N); for (auto& in : kassa) cin >> in;\\n int Q; cin >> Q;\\n int S = N / 2;\\n SegTree ST(S);\\n for (int i = 0; i < S; i++) {\\n ST.update(i, i + 1, kassa[i]);\\n }\\n for (int i = S; i < N; i++) {\\n ST.update(N - i - 1, N - i, -kassa[i]);\\n }\\n while (Q--) {\\n int l, r, x; cin >> l >> r >> x;\\n l--; r--;\\n if (r < S) {\\n ST.update(l, r + 1, x);\\n }\\n else if (l >= S) {\\n ST.update(N - r - 1, N - l, -x);\\n }\\n else {\\n ST.update(l, S, x);\\n ST.update(N - r - 1, S, -x);\\n }\\n pll a = ST.query(0, S);\\n if (a.first == a.second && a.first == 0) {\\n cout << 1 << endl;\\n } else {\\n cout << 0 << endl;\\n }\\n }\\n}\\n\\nint main() {\\n cin.tie(0); ios_base::sync_with_stdio(false);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 18948,\n \"score_of_the_acc\": -0.8271,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2777_2675475\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nint *min_data,*max_data,*add_data;\\nint first_table[500000];\\nint N = 1;\\n\\nvoid init(ll first_N){\\n\\twhile(N < first_N)N *= 2;\\n}\\n\\nvoid add(int left,int right,int value,int node_id,int node_left,int node_right){\\n\\n\\tif(right < node_left || left > node_right){\\n\\t\\treturn;\\n\\t}\\n\\telse if(left <= node_left && right >= node_right){\\n\\n\\t\\tadd_data[node_id] += value;\\n\\n\\t\\twhile(node_id != 0){\\n\\n\\t\\t\\tnode_id = (node_id-1)/2;\\n\\t\\t\\tmin_data[node_id] = min(min_data[2*node_id+1]+add_data[2*node_id+1],min_data[2*node_id+2]+add_data[2*node_id+2]);\\n\\t\\t\\tmax_data[node_id] = max(max_data[2*node_id+1]+add_data[2*node_id+1],max_data[2*node_id+2]+add_data[2*node_id+2]);\\n\\t\\t}\\n\\t}else{\\n\\n\\t\\tadd(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tadd(left,right,value,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t}\\n}\\n\\nint getMin(int left,int right,int node_id,int node_left,int node_right){\\n\\tif(right < node_left || left > node_right)return BIG_NUM;\\n\\telse if(left <= node_left && right >= node_right){\\n\\t\\treturn min_data[node_id]+add_data[node_id];\\n\\n\\t}else{\\n\\n\\t\\tint left_min = getMin(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tint right_min = getMin(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t\\treturn min(left_min,right_min)+add_data[node_id];\\n\\t}\\n}\\n\\nint getMax(int left,int right,int node_id,int node_left,int node_right){\\n\\tif(right < node_left || left > node_right)return -BIG_NUM;\\n\\telse if(left <= node_left && right >= node_right){\\n\\t\\treturn max_data[node_id]+add_data[node_id];\\n\\n\\t}else{\\n\\n\\t\\tint left_max = getMax(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tint right_max = getMax(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t\\treturn max(left_max,right_max)+add_data[node_id];\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint first_N;\\n\\tscanf(\\\"%d\\\",&first_N);\\n\\n\\tfor(int i = 0; i < first_N; i++)scanf(\\\"%lld\\\",&first_table[i]);\\n\\n\\tfor(int i = 0; i < first_N/2; i++){\\n\\t\\tfirst_table[i] -= first_table[(first_N-1)-i];\\n\\t}\\n\\n\\tfirst_N /= 2;\\n\\tinit(first_N);\\n\\n\\tmin_data = new int[2*N-1];\\n\\tmax_data = new int[2*N-1];\\n\\tadd_data = new int[2*N-1];\\n\\n\\tfor(ll i = 0; i <= 2*N-2; i++){\\n\\t\\tmin_data[i] = 0;\\n\\t\\tmax_data[i] = 0;\\n\\t\\tadd_data[i] = 0;\\n\\t}\\n\\n\\tfor(int i = 0; i < first_N; i++){\\n\\t\\tadd(i,i,first_table[i],0,0,N-1);\\n\\t}\\n\\n\\tint Q;\\n\\tscanf(\\\"%d\\\",&Q);\\n\\n\\tint left,right,tmp,calc_left;\\n\\tint add_value;\\n\\n\\tfor(int i = 0; i < Q; i++){\\n\\t\\tscanf(\\\"%d %d %d\\\",&left,&right,&add_value);\\n\\t\\tleft--;\\n\\t\\tright--;\\n\\n\\t\\tif(left >= first_N){\\n\\n\\t\\t\\ttmp = right;\\n\\t\\t\\tright = (2*first_N-1)-left;\\n\\t\\t\\tleft = (2*first_N-1)-tmp;\\n\\n\\t\\t\\tadd(left,right,-add_value,0,0,N-1);\\n\\n\\t\\t}else{ // left < first_N\\n\\n\\t\\t\\tif(right < first_N){\\n\\t\\t\\t\\tadd(left,right,add_value,0,0,N-1);\\n\\n\\t\\t\\t}else{ //right > first_N\\n\\n\\t\\t\\t\\tif(left+right == 2*first_N-1){\\n\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tcalc_left = (2*first_N-1)-right;\\n\\n\\t\\t\\t\\t\\tif(calc_left < left){\\n\\n\\t\\t\\t\\t\\t\\tright = left-1;\\n\\t\\t\\t\\t\\t\\tleft = calc_left;\\n\\t\\t\\t\\t\\t\\tadd(left,right,-add_value,0,0,N-1);\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tright = calc_left-1;\\n\\t\\t\\t\\t\\t\\tadd(left,right,add_value,0,0,N-1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(getMin(0,first_N-1,0,0,N-1) == 0 && getMax(0,first_N-1,0,0,N-1) == 0){\\n\\t\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t}else{\\n\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 11252,\n \"score_of_the_acc\": -0.3859,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2777_2675472\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nll *min_data,*max_data,*add_data;\\nll first_table[500000];\\nint N = 1;\\n\\nvoid init(ll first_N){\\n\\twhile(N < first_N)N *= 2;\\n}\\n\\nvoid add(int left,int right,ll value,int node_id,int node_left,int node_right){\\n\\n\\tif(right < node_left || left > node_right){\\n\\t\\treturn;\\n\\t}\\n\\telse if(left <= node_left && right >= node_right){\\n\\n\\t\\tadd_data[node_id] += value;\\n\\n\\t\\twhile(node_id != 0){\\n\\n\\t\\t\\tnode_id = (node_id-1)/2;\\n\\t\\t\\tmin_data[node_id] = min(min_data[2*node_id+1]+add_data[2*node_id+1],min_data[2*node_id+2]+add_data[2*node_id+2]);\\n\\t\\t\\tmax_data[node_id] = max(max_data[2*node_id+1]+add_data[2*node_id+1],max_data[2*node_id+2]+add_data[2*node_id+2]);\\n\\t\\t}\\n\\t}else{\\n\\n\\t\\tadd(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tadd(left,right,value,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t}\\n}\\n\\nll getMin(int left,int right,int node_id,int node_left,int node_right){\\n\\tif(right < node_left || left > node_right)return BIG_NUM;\\n\\telse if(left <= node_left && right >= node_right){\\n\\t\\treturn min_data[node_id]+add_data[node_id];\\n\\n\\t}else{\\n\\n\\t\\tll left_min = getMin(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tll right_min = getMin(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t\\treturn min(left_min,right_min)+add_data[node_id];\\n\\t}\\n}\\n\\nll getMax(int left,int right,int node_id,int node_left,int node_right){\\n\\tif(right < node_left || left > node_right)return -BIG_NUM;\\n\\telse if(left <= node_left && right >= node_right){\\n\\t\\treturn max_data[node_id]+add_data[node_id];\\n\\n\\t}else{\\n\\n\\t\\tll left_max = getMax(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tll right_max = getMax(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t\\treturn max(left_max,right_max)+add_data[node_id];\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint first_N;\\n\\tscanf(\\\"%d\\\",&first_N);\\n\\n\\tfor(int i = 0; i < first_N; i++)scanf(\\\"%lld\\\",&first_table[i]);\\n\\n\\tfor(int i = 0; i < first_N/2; i++){\\n\\t\\tfirst_table[i] -= first_table[(first_N-1)-i];\\n\\t}\\n\\n\\tfirst_N /= 2;\\n\\tinit(first_N);\\n\\n\\tmin_data = new ll[2*N-1];\\n\\tmax_data = new ll[2*N-1];\\n\\tadd_data = new ll[2*N-1];\\n\\n\\tfor(ll i = 0; i <= 2*N-2; i++){\\n\\t\\tmin_data[i] = 0;\\n\\t\\tmax_data[i] = 0;\\n\\t\\tadd_data[i] = 0;\\n\\t}\\n\\n\\tfor(int i = 0; i < first_N; i++){\\n\\t\\tadd(i,i,first_table[i],0,0,N-1);\\n\\t}\\n\\n\\tint Q;\\n\\tscanf(\\\"%d\\\",&Q);\\n\\n\\tint left,right,tmp,calc_left,pre = -1;\\n\\tll add_value;\\n\\n\\tfor(int i = 0; i < Q; i++){\\n\\t\\tscanf(\\\"%d %d %lld\\\",&left,&right,&add_value);\\n\\t\\tleft--;\\n\\t\\tright--;\\n\\n\\t\\tif(left >= first_N){\\n\\n\\t\\t\\ttmp = right;\\n\\t\\t\\tright = (2*first_N-1)-left;\\n\\t\\t\\tleft = (2*first_N-1)-tmp;\\n\\n\\t\\t\\tadd(left,right,-add_value,0,0,N-1);\\n\\n\\t\\t\\tif(pre == 1){\\n\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\tpre = 0;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ // left < first_N\\n\\n\\t\\t\\tif(right < first_N){\\n\\t\\t\\t\\tadd(left,right,add_value,0,0,N-1);\\n\\n\\t\\t\\t\\tif(pre == 1){\\n\\t\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\t\\tpre = 0;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tif(left+right == 2*first_N-1){\\n\\t\\t\\t\\t\\tif(pre != -1){\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",pre);\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tcalc_left = (2*first_N-1)-right;\\n\\n\\t\\t\\t\\t\\tif(calc_left < left){\\n\\n\\t\\t\\t\\t\\t\\tright = left-1;\\n\\t\\t\\t\\t\\t\\tleft = calc_left;\\n\\t\\t\\t\\t\\t\\tadd(left,right,-add_value,0,0,N-1);\\n\\n\\t\\t\\t\\t\\t\\tif(pre == 1){\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\tpre = 0;\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tright = calc_left-1;\\n\\t\\t\\t\\t\\t\\tadd(left,right,add_value,0,0,N-1);\\n\\n\\t\\t\\t\\t\\t\\tif(pre == 1){\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\tpre = 0;\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\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}\\n\\n\\t\\tif(getMin(0,first_N-1,0,0,N-1) == 0 && getMax(0,first_N-1,0,0,N-1) == 0){\\n\\t\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t\\tpre = 1;\\n\\t\\t}else{\\n\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\tpre = 0;\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6753246753246753,\n \"time_ms\": 190,\n \"memory_kb\": 19352,\n \"score_of_the_acc\": -0.5381,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2777_2675470\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nll *min_data,*max_data,*add_data;\\nll first_table[500000];\\nint N = 1;\\n\\nvoid init(ll first_N){\\n\\twhile(N < first_N)N *= 2;\\n}\\n\\nvoid add(int left,int right,ll value,int node_id,int node_left,int node_right){\\n\\n\\tif(right < node_left || left > node_right){\\n\\t\\treturn;\\n\\t}\\n\\telse if(left <= node_left && right >= node_right){\\n\\n\\t\\tadd_data[node_id] += value;\\n\\n\\t\\twhile(node_id != 0){\\n\\n\\t\\t\\tnode_id = (node_id-1)/2;\\n\\t\\t\\tmin_data[node_id] = min(min_data[2*node_id+1]+add_data[2*node_id+1],min_data[2*node_id+2]+add_data[2*node_id+2]);\\n\\t\\t\\tmax_data[node_id] = max(max_data[2*node_id+1]+add_data[2*node_id+1],max_data[2*node_id+2]+add_data[2*node_id+2]);\\n\\t\\t}\\n\\t}else{\\n\\n\\t\\tadd(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tadd(left,right,value,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t}\\n}\\n\\nll getMin(int left,int right,int node_id,int node_left,int node_right){\\n\\tif(right < node_left || left > node_right)return BIG_NUM;\\n\\telse if(left <= node_left && right >= node_right){\\n\\t\\treturn min_data[node_id]+add_data[node_id];\\n\\n\\t}else{\\n\\n\\t\\tll left_min = getMin(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tll right_min = getMin(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t\\treturn min(left_min,right_min)+add_data[node_id];\\n\\t}\\n}\\n\\nll getMax(int left,int right,int node_id,int node_left,int node_right){\\n\\tif(right < node_left || left > node_right)return -BIG_NUM;\\n\\telse if(left <= node_left && right >= node_right){\\n\\t\\treturn max_data[node_id]+add_data[node_id];\\n\\n\\t}else{\\n\\n\\t\\tll left_max = getMax(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tll right_max = getMax(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t\\treturn max(left_max,right_max)+add_data[node_id];\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint first_N;\\n\\tscanf(\\\"%d\\\",&first_N);\\n\\n\\tfor(int i = 0; i < first_N; i++)scanf(\\\"%lld\\\",&first_table[i]);\\n\\n\\tfor(int i = 0; i < first_N/2; i++){\\n\\t\\tfirst_table[i] -= first_table[(first_N-1)-i];\\n\\t}\\n\\n\\tfirst_N /= 2;\\n\\tinit(first_N);\\n\\n\\tmin_data = new ll[2*N-1];\\n\\tmax_data = new ll[2*N-1];\\n\\tadd_data = new ll[2*N-1];\\n\\n\\tfor(ll i = 0; i <= 2*N-2; i++){\\n\\t\\tmin_data[i] = 0;\\n\\t\\tmax_data[i] = 0;\\n\\t\\tadd_data[i] = 0;\\n\\t}\\n\\n\\tfor(int i = 0; i < first_N; i++){\\n\\t\\tadd(i,i,first_table[i],0,0,N-1);\\n\\t}\\n\\n\\tint Q;\\n\\tscanf(\\\"%d\\\",&Q);\\n\\n\\tint left,right,tmp,calc_left;\\n\\tll add_value;\\n\\n\\tfor(int i = 0; i < Q; i++){\\n\\t\\tscanf(\\\"%d %d %lld\\\",&left,&right,&add_value);\\n\\t\\tleft--;\\n\\t\\tright--;\\n\\n\\t\\tif(left >= first_N){\\n\\n\\t\\t\\ttmp = right;\\n\\t\\t\\tright = (2*first_N-1)-left;\\n\\t\\t\\tleft = (2*first_N-1)-tmp;\\n\\n\\t\\t\\tadd(left,right,-add_value,0,0,N-1);\\n\\n\\t\\t}else{ // left < first_N\\n\\n\\t\\t\\tif(right < first_N){\\n\\t\\t\\t\\tadd(left,right,add_value,0,0,N-1);\\n\\n\\t\\t\\t}else{ //right > first_N\\n\\n\\t\\t\\t\\tif(left+right == 2*first_N-1){\\n\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tcalc_left = (2*first_N-1)-right;\\n\\n\\t\\t\\t\\t\\tif(calc_left < left){\\n\\n\\t\\t\\t\\t\\t\\tright = left-1;\\n\\t\\t\\t\\t\\t\\tleft = calc_left;\\n\\t\\t\\t\\t\\t\\tadd(left,right,-add_value,0,0,N-1);\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tright = calc_left-1;\\n\\t\\t\\t\\t\\t\\tadd(left,right,add_value,0,0,N-1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(getMin(0,first_N-1,0,0,N-1) == 0 && getMax(0,first_N-1,0,0,N-1) == 0){\\n\\t\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t}else{\\n\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 19364,\n \"score_of_the_acc\": -0.5383,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2777_2675469\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nll *min_data,*max_data,*add_data;\\nll first_table[500000];\\nint N = 1;\\n\\nvoid init(ll first_N){\\n\\twhile(N < first_N)N *= 2;\\n}\\n\\nvoid add(int left,int right,ll value,int node_id,int node_left,int node_right){\\n\\n\\tif(right < node_left || left > node_right){\\n\\t\\treturn;\\n\\t}\\n\\telse if(left <= node_left && right >= node_right){\\n\\n\\t\\tadd_data[node_id] += value;\\n\\n\\t\\twhile(node_id != 0){\\n\\n\\t\\t\\tnode_id = (node_id-1)/2;\\n\\t\\t\\tmin_data[node_id] = min(min_data[2*node_id+1]+add_data[2*node_id+1],min_data[2*node_id+2]+add_data[2*node_id+2]);\\n\\t\\t\\tmax_data[node_id] = max(max_data[2*node_id+1]+add_data[2*node_id+1],max_data[2*node_id+2]+add_data[2*node_id+2]);\\n\\t\\t}\\n\\t}else{\\n\\n\\t\\tadd(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tadd(left,right,value,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t}\\n}\\n\\nll getMin(int left,int right,int node_id,int node_left,int node_right){\\n\\tif(right < node_left || left > node_right)return BIG_NUM;\\n\\telse if(left <= node_left && right >= node_right){\\n\\t\\treturn min_data[node_id]+add_data[node_id];\\n\\n\\t}else{\\n\\n\\t\\tll left_min = getMin(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tll right_min = getMin(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t\\treturn min(left_min,right_min)+add_data[node_id];\\n\\t}\\n}\\n\\nll getMax(int left,int right,int node_id,int node_left,int node_right){\\n\\tif(right < node_left || left > node_right)return -BIG_NUM;\\n\\telse if(left <= node_left && right >= node_right){\\n\\t\\treturn max_data[node_id]+add_data[node_id];\\n\\n\\t}else{\\n\\n\\t\\tll left_max = getMax(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\\n\\t\\tll right_max = getMax(left,right,2*node_id+2,(node_left+node_right)/2+1,node_right);\\n\\t\\treturn max(left_max,right_max)+add_data[node_id];\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint first_N;\\n\\tscanf(\\\"%d\\\",&first_N);\\n\\n\\tfor(int i = 0; i < first_N; i++)scanf(\\\"%lld\\\",&first_table[i]);\\n\\n\\tfor(int i = 0; i < first_N/2; i++){\\n\\t\\tfirst_table[i] -= first_table[(first_N-1)-i];\\n\\t}\\n\\n\\tfirst_N /= 2;\\n\\tinit(first_N);\\n\\n\\tmin_data = new ll[2*N-1];\\n\\tmax_data = new ll[2*N-1];\\n\\tadd_data = new ll[2*N-1];\\n\\n\\tfor(ll i = 0; i <= 2*N-2; i++){\\n\\t\\tmin_data[i] = 0;\\n\\t\\tmax_data[i] = 0;\\n\\t\\tadd_data[i] = 0;\\n\\t}\\n\\n\\tfor(int i = 0; i < first_N; i++){\\n\\t\\tadd(i,i,first_table[i],0,0,N-1);\\n\\t}\\n\\n\\tint Q;\\n\\tscanf(\\\"%d\\\",&Q);\\n\\n\\tint left,right,tmp,calc_left,pre = -1;\\n\\tll add_value;\\n\\n\\tfor(int i = 0; i < Q; i++){\\n\\t\\tscanf(\\\"%d %d %lld\\\",&left,&right,&add_value);\\n\\t\\tleft--;\\n\\t\\tright--;\\n\\n\\t\\tif(left >= first_N){\\n\\n\\t\\t\\ttmp = right;\\n\\t\\t\\tright = (2*first_N-1)-left;\\n\\t\\t\\tleft = (2*first_N-1)-tmp;\\n\\n\\t\\t\\tadd(left,right,-add_value,0,0,N-1);\\n\\n\\t\\t\\tif(pre == 1){\\n\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\tpre = 0;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ // left < first_N\\n\\n\\t\\t\\tif(right < first_N){\\n\\t\\t\\t\\tadd(left,right,add_value,0,0,N-1);\\n\\n\\t\\t\\t\\tif(pre == 1){\\n\\t\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\t\\tpre = 0;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{ //right > first_N\\n\\n\\t\\t\\t\\tif(left+right == 2*first_N-1){\\n\\t\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",pre);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tcalc_left = (2*first_N-1)-right;\\n\\n\\t\\t\\t\\t\\tif(calc_left < left){\\n\\n\\t\\t\\t\\t\\t\\tright = left-1;\\n\\t\\t\\t\\t\\t\\tleft = calc_left;\\n\\t\\t\\t\\t\\t\\tadd(left,right,-add_value,0,0,N-1);\\n\\n\\t\\t\\t\\t\\t\\tif(pre == 1){\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\tpre = 0;\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tright = calc_left-1;\\n\\t\\t\\t\\t\\t\\tadd(left,right,add_value,0,0,N-1);\\n\\n\\t\\t\\t\\t\\t\\tif(pre == 1){\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\tpre = 0;\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\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}\\n\\n\\t\\tif(getMin(0,first_N-1,0,0,N-1) == 0 && getMax(0,first_N-1,0,0,N-1) == 0){\\n\\t\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t\\tpre = 1;\\n\\t\\t}else{\\n\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\tpre = 0;\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6753246753246753,\n \"time_ms\": 190,\n \"memory_kb\": 19388,\n \"score_of_the_acc\": -0.5387,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1666,"cells":{"group_id":{"kind":"string","value":"aoj_2779_cpp"},"problem_description":{"kind":"string","value":"H: われわれの努力について - About Our Effort -\n問題\n※この問題はおまけの問題と捉えていただけるとありがたく、\nできれば先に他の問題のほうをお楽しみいただければと思っておりまして，ですので他の問題を通し終えて暇になり，かつその暇を\nこのコンテストで潰そうという気になってくれた方に挑戦していただければと思います。\nD問題のクエリが遅くてすみませんでした。\nしかし我々といたしましても決してただ怠慢をしていたわけではないのです。\n私たちなりに努力したのです。\nその努力の片鱗を味わっていただくため、このような問題を出題した次第であります。\n問題: D問題のサーバー側の処理をするプログラムを作成せよ。\nなおこの問題は本当にD問題の要求を満たすプログラムを作成することが目標ということですので、言語による向き/不向きなどは一切考慮いたしませんのであしからず。最速実行速度を達成された方はもれなくAOJに収録される際にジャッジプログラムとして採用される可能性がありますのでぜひ挑戦下さい。\n入力形式\n入力は以下の形式で与えられる。\nN\np_1\n...\np_N\nQ\nl_1\nr_1\n...\nl_Q\nr_Q\n1行目では順列\np\nの長さ\nN\nが与えられる。2行目では順列\np\nを表す\nN\n個の整数が空白区切りで与えられる。3行目ではクエリの数を表す整数\nQ\nが与えられる。続く\nQ\n行の\ni\n行目は空白区切りの2つの整数\nl_i\n,\nr_i\nからなり、クエリが区間\n[l_i, r_i]\nのコンプレックス度を聞くものであることを表す。\n入力は以下の制約を満たす。\n1 \\≤ N \\≤ 100,000\n1 \\≤ p_i \\≤ N\n,\np_i \\neq p_j (i \\neq j)\n1 \\≤ Q \\≤ 200,000\n1 \\≤ l_i \\≤ r_i \\≤ N\n出力形式\nQ\n個の各クエリ\ni\nに関して、\np\nの区間\n[l_i, r_i]\nのコンプレックス度を\ni\n行目に出力せよ。ただし、\np\nの区間\n[l_i, r_i]\nのコンプレックス度とは、\n(\\{ (i, j) | p_i > p_j\n{\\rm for}\nl \\≤ i<j \\≤ r \\}の要素数)\nと定義される。\n入力例1\n4\n4 1 3 2\n2\n1 3\n2 4\n出力例1\n2\n1\n入力例2\n1\n1\n1\n1 1\n出力例2\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2779_4926964","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\n#define SIZE 200000\n#define SQ 300\n#define LLINF 100000000000000\n\nstruct BIT {\n vector<int> data;\n\n BIT(int n): data(n + 2, 0) {};\n\n void add(int k, int x) {\n k++;\n while (k <= data.size() - 2) {\n data[k] += x;\n k += k & -k;\n }\n }\n\n int query(int k) {\n int rec = 0;\n while (k > 0) {\n rec += data[k];\n k -= k & (-k);\n }\n return rec;\n }\n\n int query(int a, int b) {\n return query(b) - query(a);\n }\n};\n\nint N, P[SIZE];\nll ans[SIZE];\n\nint main() {\n scanf(\"%d\", &N);\n\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", P + i);\n P[i]--;\n }\n\n int Q;\n\n vector<pair<pair<int, int>, pair<int, int>>> queries;\n\n scanf(\"%d\", &Q);\n\n for (int i = 0; i < Q; i++) {\n int l, r;\n scanf(\"%d%d\", &l, &r);\n l--;\n int t = l / SQ;\n\n queries.push_back({{t, r}, {l, i}});\n }\n\n sort(queries.begin(), queries.end());\n\n BIT bit(N);\n int L = 0, R = 0;\n ll cur = 0;\n\n for (int i = 0; i < Q; i++) {\n int idx = queries[i].second.second;\n int l = queries[i].second.first;\n int r = queries[i].first.second;\n\n while (R < r) {\n int p = P[R];\n cur += bit.query(p, N);\n bit.add(p, 1);\n R++;\n }\n while (L < l) {\n int p = P[L];\n cur -= bit.query(p);\n bit.add(p, -1);\n L++;\n }\n while (l < L) {\n int p = P[L - 1];\n cur += bit.query(p);\n L--;\n bit.add(p, 1);\n }\n while (r < R) {\n int p = P[R - 1];\n bit.add(p, -1);\n cur -= bit.query(p, N);\n R--;\n }\n\n ans[idx] = cur;\n }\n\n for (int i = 0; i < Q; i++) {\n printf(\"%lld\\n\", ans[i]);\n }\n\n return 0;\n}","accuracy":1,"time_ms":1460,"memory_kb":8512,"score_of_the_acc":-0.5426,"final_rank":3},{"submission_id":"aoj_2779_4926951","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define all(a) begin(a),end(a)\n\n\nconst ll MAX = 1000001;\nll bit[MAX];\nll sum_all = 0;\nvoid add(ll k, ll x){\n sum_all += x;\n for(; k < MAX; k += k & -k) bit[k] += x;\n}\nll low(ll k){ // (0, k]\n ll ans = 0;\n for(; k; k -= k & -k) ans += bit[k];\n return ans;\n}\nll high(ll k){ // (k, MAX]\n return sum_all - low(k);\n}\nint main(){\n cin.tie(nullptr)->sync_with_stdio(false);\n ll n;\n cin >> n;\n vector<ll> p(n);\n for(ll& x : p) cin >> x;\n ll q;\n cin >> q;\n vector<pll> query(q);\n for(auto& [l, r] : query){\n cin >> l >> r;\n l--;\n }\n const ll sq = sqrt(n);\n vector<ll> idx(q);\n iota(all(idx), 0);\n sort(all(idx), [&](ll x, ll y){\n const auto [l1, r1] = query[x];\n const auto [l2, r2] = query[y];\n if(l1 / sq == l2 / sq){\n return r1 < r2;\n }\n return l1 < l2;\n });\n vector<ll> ans(q);\n ll L = 0, R = 0, cnt = 0;\n for(ll i : idx){\n const auto [l, r] = query[i];\n while(R < r){\n cnt += high(p[R]);\n add(p[R], 1);\n R++;\n }\n while(L > l){\n L--;\n cnt += low(p[L]);\n add(p[L], 1);\n }\n while(R > r){\n R--;\n add(p[R], -1);\n cnt -= high(p[R]);\n }\n while(L < l){\n add(p[L], -1);\n cnt -= low(p[L]);\n L++;\n }\n ans[i] = cnt;\n }\n for(ll i : ans) cout << i << '\\n';\n}","accuracy":1,"time_ms":1580,"memory_kb":15128,"score_of_the_acc":-0.5999,"final_rank":5},{"submission_id":"aoj_2779_4926941","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define all(a) begin(a),end(a)\n\n\nconst ll MAX = 1000001;\nll bit[MAX];\nll sum_all = 0;\nvoid add(ll k, ll x){\n sum_all += x;\n for(; k < MAX; k += k & -k) bit[k] += x;\n}\nll low(ll k){ // (0, k]\n ll ans = 0;\n for(; k; k -= k & -k) ans += bit[k];\n return ans;\n}\nll high(ll k){ // (k, MAX]\n return sum_all - low(k);\n}\nint main(){\n cin.tie(nullptr)->sync_with_stdio(false);\n ll n;\n cin >> n;\n vector<ll> p(n);\n for(ll& x : p) cin >> x;\n ll q;\n cin >> q;\n vector<pll> query(q);\n for(auto& [l, r] : query){\n cin >> l >> r;\n l--;\n }\n const ll sq = sqrt(n);\n vector<ll> idx(q);\n iota(all(idx), 0);\n sort(all(idx), [&](ll x, ll y){\n const auto [l1, r1] = query[x];\n const auto [l2, r2] = query[y];\n if(l1 / sq == l2 / sq){\n if(l1 / sq & 1) return r1 > r2;\n else return r1 < r2;\n }\n return l1 < l2;\n });\n vector<ll> ans(q);\n ll L = 0, R = 0, cnt = 0;\n for(ll i : idx){\n const auto [l, r] = query[i];\n while(R < r){\n cnt += high(p[R]);\n add(p[R], 1);\n R++;\n }\n while(L > l){\n L--;\n cnt += low(p[L]);\n add(p[L], 1);\n }\n while(R > r){\n R--;\n add(p[R], -1);\n cnt -= high(p[R]);\n }\n while(L < l){\n add(p[L], -1);\n cnt -= low(p[L]);\n L++;\n }\n ans[i] = cnt;\n }\n for(ll i : ans) cout << i << '\\n';\n}","accuracy":1,"time_ms":1090,"memory_kb":15156,"score_of_the_acc":-0.4178,"final_rank":1},{"submission_id":"aoj_2779_4571199","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\nusing namespace std;\nusing namespace __gnu_pbds;\nusing ll = long long;\nusing u64 = uint_fast64_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';\nconstexpr long long MOD = 1000000007;\n//constexpr long long MOD = 998244353;\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 popcount(int x) {return __builtin_popcount(x);}\ninline int popcount(long long x) {return __builtin_popcountll(x);}\nvoid print() { cout << \"\\n\"; }\ntemplate<class T, class... Args>\nvoid print(const T &x, const Args &... args) {\n cout << x << \" \";\n print(args...);\n}\n///////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\ntemplate<typename T>\nstruct BinaryIndexedTree {\n int N;\n vector<T> data;\n\n BinaryIndexedTree(){}\n BinaryIndexedTree(int N) : N(N), data(N+1,0) {}\n\n // [0,k) (0-indexed) a[0] + … + a[k-1]\n T sum(int k) {\n T ret = 0;\n for(; k > 0; k -= k & -k) ret += data[k];\n return ret;\n }\n\n // [l,r) (0-indexed) a[l] + … + a[r-1]\n T sum(int l, int r) {\n if (l >= r) return 0;\n T vl = sum(l);\n T vr = sum(r);\n return vr - vl;\n }\n // (0-indexed) a[k] += x;\n void add(int k, T x) {\n for(++k; k <= N; k += k & -k) data[k] += x;\n }\n\n // (0-indexed)\n int lowerbound(T x) {\n int k = 1;\n int ret = 0;\n while ((k<<1) <= N) k <<= 1;\n while (k) {\n if (ret + k <= N && data[ret+k] < x) {\n x -= data[ret+k];\n ret += k;\n }\n k >>= 1;\n }\n return ret;\n }\n\n // (0-indexed)\n int upperbound(T x) {return lowerbound(x+1);}\n};\n\nint main() {\n ios::sync_with_stdio(false); cin.tie(nullptr);\n int N; cin >> N;\n vector<int> p(N);\n rep(i,N) {\n cin >> p[i];\n --p[i];\n }\n\n int Q; cin >> Q;\n vector<int> L(Q),R(Q);\n rep(i,Q) {\n cin >> L[i] >> R[i];\n --L[i];\n }\n const int B = 500;\n vector<int> idx(Q);\n iota(all(idx),0);\n sort(all(idx),[&](int i, int j){\n if (L[i]/B==L[j]/B) return R[i] < R[j];\n return L[i] < L[j]; \n });\n BinaryIndexedTree<int> BIT(N);\n vector<ll> ans(Q);\n int nl = 0, nr = 0;\n ll val = 0;\n rep(i,Q) {\n int u = idx[i];\n while (nl > L[u]) {\n nl--;\n val += BIT.sum(p[nl]);\n BIT.add(p[nl],1);\n }\n while (nr < R[u]) {\n val += BIT.sum(p[nr]+1,N);\n BIT.add(p[nr],1);\n nr++;\n }\n while (nl < L[u]) {\n BIT.add(p[nl],-1);\n val -= BIT.sum(p[nl]);\n nl++;\n }\n while (nr > R[u]) {\n nr--;\n BIT.add(p[nr],-1);\n val -= BIT.sum(p[nr]+1,N);\n }\n ans[u] = val;\n }\n\n for (auto i : ans) cout << i << ln;\n}","accuracy":1,"time_ms":1390,"memory_kb":7644,"score_of_the_acc":-0.5149,"final_rank":2},{"submission_id":"aoj_2779_4571195","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\nusing namespace std;\nusing namespace __gnu_pbds;\nusing ll = long long;\nusing u64 = uint_fast64_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';\nconstexpr long long MOD = 1000000007;\n//constexpr long long MOD = 998244353;\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 popcount(int x) {return __builtin_popcount(x);}\ninline int popcount(long long x) {return __builtin_popcountll(x);}\nvoid print() { cout << \"\\n\"; }\ntemplate<class T, class... Args>\nvoid print(const T &x, const Args &... args) {\n cout << x << \" \";\n print(args...);\n}\n///////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\ntemplate<typename T>\nstruct BinaryIndexedTree {\n int N;\n vector<T> data;\n\n BinaryIndexedTree(){}\n BinaryIndexedTree(int N) : N(N), data(N+1,0) {}\n\n // [0,k) (0-indexed) a[0] + … + a[k-1]\n T sum(int k) {\n T ret = 0;\n for(; k > 0; k -= k & -k) ret += data[k];\n return ret;\n }\n\n // [l,r) (0-indexed) a[l] + … + a[r-1]\n T sum(int l, int r) {\n if (l >= r) return 0;\n T vl = sum(l);\n T vr = sum(r);\n return vr - vl;\n }\n // (0-indexed) a[k] += x;\n void add(int k, T x) {\n for(++k; k <= N; k += k & -k) data[k] += x;\n }\n\n // (0-indexed)\n int lowerbound(T x) {\n int k = 1;\n int ret = 0;\n while ((k<<1) <= N) k <<= 1;\n while (k) {\n if (ret + k <= N && data[ret+k] < x) {\n x -= data[ret+k];\n ret += k;\n }\n k >>= 1;\n }\n return ret;\n }\n\n // (0-indexed)\n int upperbound(T x) {return lowerbound(x+1);}\n};\n\nint main() {\n ios::sync_with_stdio(false); cin.tie(nullptr);\n int N; cin >> N;\n vector<int> p(N);\n rep(i,N) {\n cin >> p[i];\n --p[i];\n }\n\n int Q; cin >> Q;\n vector<int> L(Q),R(Q);\n rep(i,Q) {\n cin >> L[i] >> R[i];\n --L[i];\n }\n const int B = 500;\n vector<int> idx(Q);\n iota(all(idx),0);\n sort(all(idx),[&](int i, int j){\n if (L[i]/B==L[j]/B) return R[i] < R[j];\n return L[i] < L[j]; \n });\n BinaryIndexedTree<int> BIT(N);\n vector<int> ans(Q);\n int nl = 0, nr = 0;\n ll val = 0;\n rep(i,Q) {\n int u = idx[i];\n while (nl > L[u]) {\n nl--;\n val += BIT.sum(p[nl]);\n BIT.add(p[nl],1);\n }\n while (nr < R[u]) {\n val += BIT.sum(p[nr]+1,N);\n BIT.add(p[nr],1);\n nr++;\n }\n while (nl < L[u]) {\n BIT.add(p[nl],-1);\n val -= BIT.sum(p[nl]);\n nl++;\n }\n while (nr > R[u]) {\n nr--;\n BIT.add(p[nr],-1);\n val -= BIT.sum(p[nr]+1,N);\n }\n ans[u] = val;\n }\n\n for (auto i : ans) cout << i << ln;\n}","accuracy":0.6176470588235294,"time_ms":1260,"memory_kb":6592,"score_of_the_acc":-0.4646,"final_rank":17},{"submission_id":"aoj_2779_4472159","code_snippet":"#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <tuple>\n#include <utility>\nusing namespace std;\nusing ll = long long int;\n\nconst int B = 500;\n\n// @category セグメント木 (Segment Tree)\n// @title セグメント木 (Segment Tree)\n// 抽象 SegmentTree (0-indexed・一点更新・区間取得)\ntemplate <typename MonoidType>\nstruct SegmentTree {\n using Function = function< MonoidType(MonoidType, MonoidType) >;\n\n // node, identity element\n int n;\n vector<MonoidType> node;\n MonoidType E0;\n\n // update / combine function\n Function upd_f, cmb_f;\n\n void build(int m, vector<MonoidType> v = vector<MonoidType>()) {\n if(v != vector<MonoidType>()) m = v.size();\n n = 1; while(n < m) n *= 2;\n\n node = vector<MonoidType>(2*n-1, E0);\n if(v != vector<MonoidType>()) {\n for(int i=0; i<m; i++) {\n node[n-1+i] = v[i];\n }\n for(int i=n-2; i>=0; i--) {\n node[i] = cmb_f(node[2*i+1], node[2*i+2]);\n }\n }\n }\n\n // initialize\n SegmentTree() {}\n SegmentTree(int n_, MonoidType E0_,\n Function upd_f_, Function cmb_f_,\n vector<MonoidType> v = vector<MonoidType>()) :\n E0(E0_), upd_f(upd_f_), cmb_f(cmb_f_) {\n build(n_, v);\n }\n\n // update k-th element (applied value: x)\n void update(int k, MonoidType x) {\n k += n - 1;\n node[k] = upd_f(node[k], x);\n while(k > 0) {\n k = (k - 1) / 2;\n node[k] = cmb_f(node[2*k+1], node[2*k+2]);\n }\n }\n\n // range query for [a, b)\n // 非再帰のアイデア: http://d.hatena.ne.jp/komiyam/20131202/1385992406\n MonoidType query(int a, int b) {\n MonoidType vl = E0, vr = E0;\n for(int l=a+n, r=b+n; l<r; l>>=1, r>>=1) {\n if(l & 1) vl = cmb_f(vl, node[(l++)-1]);\n if(r & 1) vr = cmb_f(node[(--r)-1], vr);\n }\n return cmb_f(vl, vr);\n }\n};\n\nint main() {\n int N; scanf(\"%d\", &N);\n vector<int> P(N);\n for(int i=0; i<N; i++) scanf(\"%d\", &P[i]), P[i]--;\n\n vector< vector< tuple<int, int, int> > > segs(B);\n int Q; scanf(\"%d\", &Q);\n for(int i=0; i<Q; i++) {\n int l, r; scanf(\"%d%d\", &l, &r); l--;\n int b = l / B;\n segs[b].emplace_back(l, r, i);\n }\n\n for(int i=0; i<B; i++) {\n sort(segs[i].begin(), segs[i].end(), [](auto x, auto y) {\n return get<1>(x) < get<1>(y);\n });\n }\n\n SegmentTree<int> seg(N, 0,\n [](int a, int b) { return a + b; },\n [](int a, int b) { return a + b; });\n ll sum = 0, pl = 0, pr = 0;\n auto add_l = [&]() {\n sum += seg.query(0, P[--pl]);\n seg.update(P[pl], +1);\n };\n auto add_r = [&]() {\n sum += seg.query(P[pr] + 1, N);\n seg.update(P[pr++], +1);\n };\n auto del_l = [&]() {\n sum -= seg.query(0, P[pl]);\n seg.update(P[pl++], -1);\n };\n auto del_r = [&]() {\n sum += seg.query(P[--pr] + 1, N);\n seg.update(P[pr], -1);\n };\n\n vector<ll> ans(Q);\n for(int i=0; i<B; i++) {\n for(auto e : segs[i]) {\n int l, r, k; tie(l, r, k) = e;\n while(pl < l) del_l();\n while(pl > l) add_l();\n while(pr < r) add_r();\n while(pr > r) del_r();\n ans[k] = sum;\n }\n }\n for(int i=0; i<Q; i++) printf(\"%lld\\n\", ans[i]);\n return 0;\n}","accuracy":0.3235294117647059,"time_ms":50,"memory_kb":2780,"score_of_the_acc":-0.0074,"final_rank":20},{"submission_id":"aoj_2779_2270773","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\ntypedef long long Int;\n\nconst int MAX_N = 100000;\nconst int SQRT_N = 400;\n\nint N;\nint A[MAX_N];\nint P[MAX_N+1];\nint E[MAX_N+1][SQRT_N+1], F[SQRT_N+1][MAX_N+1];\nint G[MAX_N+1], H[MAX_N+1];\nInt X[SQRT_N+1][SQRT_N+1];\nint pre[SQRT_N], suf[SQRT_N];\nint B_size, B_num;\n\n//Fenwick Tree\nint bit_size;\nint bit[MAX_N+1];\n\n//note that we maintain bit[1..n]\ninline void init(int n){\n bit_size = n;\n memset(bit,0,sizeof(bit));\n}\n\n//add x to the i-th element\ninline void inc(int i){\n while(i <= bit_size){\n bit[i]++;\n i += i & -i;\n }\n}\n\n//sum of [1..i]\ninline int sum(int i){\n int res = 0;\n while(i > 0){\n res += bit[i];\n i -= i & -i;\n }\n return res;\n}\n\n//sum of [l..r]\ninline int partial_sum(int l, int r){ return sum(r) - sum(l-1); }\n\ninline void preprocess(void) {\n //Set B_size and B_num\n B_size = sqrt(N);\n //B_size = 400;\n B_num = (N + B_size-1) / B_size;\n\n //Step 1: make E and F\n for(int k=0;k<B_num;k++) {\n int l = k*B_size, r = min( (k+1)*B_size, N);\n\n memset(P,0,sizeof(P));\n for(int i=l;i<r;i++) {\n P[A[i]]++;\n }\n\n for(int i=0;i<N-1;i++) {\n P[i+1] += P[i];\n }\n\n //fill E\n int backward = 0;\n for(int i=l-1;i>=0;i--){\n backward += P[A[i]];\n E[i][k] = backward;\n }\n\n memset(P,0,sizeof(P));\n for(int i=l;i<r;i++) {\n P[A[i]]++;\n }\n\n for(int i=0;i<N-1;i++) {\n P[N-i-2] += P[N-i-1];\n }\n\n //fill F\n int forward = 0;\n for(int i=r;i<N;i++){\n forward += P[A[i]];\n F[k][i] = forward;\n }\n }\n\n //Step2-1: make G\n init(N);\n int suf_inv = 0;\n for(int i=N-1;i>=0;i--){\n suf_inv += partial_sum(1,A[i]+1);\n inc(A[i]+1);\n G[i] = suf_inv;\n\n if(i%B_size == 0){\n init(N);\n suf_inv = 0;\n }\n }\n\n //Step2-2: make H\n int pre_inv = 0;\n for(int i=0;i<N;i++){\n if(i%B_size == 0){\n init(N);\n pre_inv = 0;\n }\n pre_inv += partial_sum(A[i]+1, N);\n inc(A[i]+1);\n H[i] = pre_inv;\n }\n\n //Step3: make X\n for(int L=0;L<B_num;L++){\n Int inv = 0;\n for(int R=L;R<B_num;R++){\n inv += G[R*B_size];\n inv += E[L*B_size][R];\n X[L][R+1] = inv;\n }\n }\n\n //Step4: update E and F\n for(int k=0;k<B_num;k++){\n for(int i=0;i<k*B_size;i++){\n E[i][k] -= E[(i+B_size-1)/B_size*B_size][k];\n }\n for(int i=N-1;i>=k*B_size;i--){\n F[k][i] -= F[k][(i+1)/B_size*B_size-1];\n }\n }\n\n for(int i=0;i<N;i++){\n for(int k=0;k<B_num-1;k++){\n E[i][k+1] += E[i][k];\n F[k+1][i] += F[k][i];\n }\n }\n}\n\ninline void answer_query(int l, int r){\n l--;\n int L = (l+B_size-1)/B_size, R = r/B_size;\n int Ll = l, Lr = L*B_size, Rl = R*B_size, Rr = r;\n\n //l and r are in the same block\n if(L>=R){\n Int inv = 0;\n\n init(N);\n for(int i=l;i<r;i++){\n inv += partial_sum(A[i]+1, N);\n inc(A[i]+1);\n }\n\n printf(\"%lld\\n\", inv);\n return;\n }\n\n //l and r are in different blocks\n Int inv = 0;\n\n //inversion in consecutive blcoks\n inv += X[L][R];\n\n //inversion between prefix/suffix and consecutive blocks\n inv += E[l][R-1] - (L==0?0:E[l][L-1]);\n inv += F[R-1][r-1] - (L==0?0:F[L-1][r-1]);\n\n //inversion in prefix/suffix\n if(Ll<Lr) inv += G[l];\n if(Rl<Rr) inv += H[r-1];\n\n //inversion between prefix and suffix (using radix sort)\n\n int pn = Lr-Ll;\n for(int i=Ll;i<Lr;i++) {\n pre[i-Ll] = A[i];\n }\n sort(pre,pre+pn);\n \n int sn = Rr-Rl;\n for(int i=Rl;i<Rr;i++) {\n suf[i-Rl] = A[i];\n }\n sort(suf,suf+sn);\n \n int id_p = 0, id_s = 0;\n while(id_p<pn) {\n if(id_s == sn) {\n id_p++;\n inv += id_s;\n } else {\n if(pre[id_p] < suf[id_s]) {\n\tid_p++;\n\tinv += id_s;\n } else {\n\tid_s++;\n }\n }\n }\n\n printf(\"%lld\\n\", inv);\n}\n\nint main(){\n scanf(\"%d\",&N);\n\n for(int i=0;i<N;i++) {\n scanf(\"%d\", A+i); A[i]--;\n }\n\n preprocess();\n\n int Q;\n scanf(\"%d\",&Q);\n\n while(Q--){\n int l,r;\n scanf(\"%d%d\",&l,&r);\n\n answer_query(l,r);\n }\n}","accuracy":1,"time_ms":2240,"memory_kb":286704,"score_of_the_acc":-1.3672,"final_rank":11},{"submission_id":"aoj_2779_1847273","code_snippet":"#include<bits/stdc++.h>\n\n#define rep(i,n) for(int i=0;i<(int)n;i++)\n#define all(c) (c).begin(),(c).end()\n#define mp make_pair\n#define pb push_back\n#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)\n#define dbg(x) cerr<<__LINE__<<\": \"<<#x<<\" = \"<<(x)<<endl\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pi;\nconst int inf = (int)1e9;\nconst double INF = 1e12, EPS = 1e-9;\n\nll bit[131072];\nll sum(int i){\n\tll res = 0;\n\tfor(; i; i -= i & -i) res += bit[i];\n\treturn res;\n}\nvoid add(int i, int x){\n\tfor(; i < 131072; i += i & -i) bit[i] += x;\n}\n\nconst int B = 500;\nint n, p[100000];\nll ans[200000];\n\nint main(){\n\tcin.tie(0); cin.sync_with_stdio(0);\n\tcin >> n;\n\trep(i, n) cin >> p[i];\n\tint q; cin >> q;\n\t\n\tvector<pair<pi, pi>> v; //l/B, r, l\n\trep(i, q){\n\t\tint l, r; cin >> l >> r; l--;\n\t\tv.pb(mp(mp(l / B, r), mp(l, i)));\n\t}\n\tint cnt = 0;\n\tsort(all(v));\n\tint L = 0, R = 0; ll res = 0;\n\tfor(auto &i: v){\n\t\tint r = i.first.second, l = i.second.first;\n\t\twhile(R < r) { assert(L <= R); res += R - L - sum(p[R]); add(p[R++], 1); }\n\t\twhile(L > l) { assert(L <= R); res += sum(p[--L]); add(p[L], 1); }\n\t\twhile(L < l) { assert(L < R); res -= sum(p[L]) - 1; add(p[L++], -1); }\n\t\twhile(R > r) { assert(L < R); res -= R - L; res += sum(p[--R]); add(p[R], -1); }\n\t\tans[i.second.second] = res;\n\t}\n\trep(i, q) printf(\"%lld\\n\", ans[i]);\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":1460,"memory_kb":8972,"score_of_the_acc":-0.5435,"final_rank":4},{"submission_id":"aoj_2779_1701393","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <map>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n \n#define B 317\n \ntypedef long long int LLI;\n#define int long long int\n \ntypedef pair<string, int> Pair;\ntypedef pair<int, int> Seg;\ntypedef pair<Seg, pair<int,int> > Data;\n \nint size;\nint T;\nint n;\nint m;\nLLI cur;\nLLI ans[200005];\nLLI BIT2[100005];\nvector<int> list_str;\nvector<int> sorted_str;\nint myrank[100010];\nvector<Data> queries;\n \nbool cmp_query(const Data &d1, const Data &d2) {\n int l1 = d1.first.first;\n int r1 = d1.first.second;\n int l2 = d2.first.first;\n int r2 = d2.first.second;\n \n if (l1/B != l2/B) return l1/B < l2/B;\n return r1 < r2;\n}\n \nvoid update(LLI *BIT, int k, LLI x) {\n k++;\n while (k <= n) {\n BIT[k] += x;\n k += k&-k;\n }\n}\n \nLLI getsum(LLI *BIT, int k) {\n k++;\n LLI ret = 0;\n while (k > 0) {\n ret += BIT[k];\n k -= k&-k;\n }\n return ret;\n}\n \nvoid append_end(int x) {\n int &ss = list_str[x];\n int idx = myrank[ss];\n cur += getsum(BIT2, n-1) - getsum(BIT2, idx); // (idx,n-1]\n update(BIT2, idx, 1);\n}\nvoid append_front(int x) {\n int &ss = list_str[x];\n int idx = myrank[ss];\n cur += getsum(BIT2, idx-1);\n update(BIT2, idx, 1);\n}\nvoid remove_end(int x) {\n int &ss = list_str[x];\n int idx = myrank[ss];\n cur -= getsum(BIT2, n-1) - getsum(BIT2, idx); // (idx,n-1]\n update(BIT2, idx, -1);\n}\nvoid remove_front(int x) {\n int &ss = list_str[x];\n int idx = myrank[ss];\n cur -= getsum(BIT2,idx-1);\n update(BIT2, idx, -1);\n}\n \nsigned main() {\n ios_base::sync_with_stdio(false);\n \n //cin >> T;\n while (1) {\n cin >> n;\n size = 1;\n fill(BIT2, BIT2+n+1, 0ll);\n \n list_str.clear();\n sorted_str.clear();\n for (int i=0; i<n; i++) {\n int s;\n cin >> s;\n list_str.push_back(s);\n sorted_str.push_back(s);\n }\n sort(sorted_str.begin(), sorted_str.end());\n for (int i=0; i<n; i++) {\n myrank[sorted_str[i]] = i;\n }\n \n queries.clear();\n cin >> m;\n for(int j = 0 ; j < m ; j++){\n int l, r,k;\n cin >> l >> r;\n --l;\n --r;\n queries.push_back(Data(Seg(l, r), {j,j}));\n }\n \n sort(queries.begin(), queries.end(), cmp_query);\n cur = 0;\n int a = 0;\n int b = -1;\n for (int i=0; i<queries.size(); i++) {\n int l = queries[i].first.first;\n int r = queries[i].first.second;\n int idx = queries[i].second.second;\n int k = queries[i].second.first;\n while (b < r) append_end(++b);\n while (l < a) append_front(--a);\n while (a < l) remove_front(a++);\n while (r < b) remove_end(b--);\n ans[idx] = cur;\n }\n \n for (int i=0; i<m; i++) {\n cout << ans[i] << endl;\n }\n break;\n }\n}","accuracy":1,"time_ms":1850,"memory_kb":14412,"score_of_the_acc":-0.6989,"final_rank":6},{"submission_id":"aoj_2779_1701391","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <map>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n \n#define B 317\n \ntypedef long long int LLI;\n#define int long long int\n \ntypedef pair<string, int> Pair;\ntypedef pair<int, int> Seg;\ntypedef pair<Seg, pair<int,int> > Data;\n \nint size;\nint T;\nint n;\nint m;\nLLI cur;\nLLI ans[100005];\nLLI BIT2[100005];\nvector<int> list_str;\nvector<int> sorted_str;\nint myrank[100010];\nvector<Data> queries;\n \nbool cmp_query(const Data &d1, const Data &d2) {\n int l1 = d1.first.first;\n int r1 = d1.first.second;\n int l2 = d2.first.first;\n int r2 = d2.first.second;\n \n if (l1/B != l2/B) return l1/B < l2/B;\n return r1 < r2;\n}\n \nvoid update(LLI *BIT, int k, LLI x) {\n k++;\n while (k <= n) {\n BIT[k] += x;\n k += k&-k;\n }\n}\n \nLLI getsum(LLI *BIT, int k) {\n k++;\n LLI ret = 0;\n while (k > 0) {\n ret += BIT[k];\n k -= k&-k;\n }\n return ret;\n}\n \nvoid append_end(int x) {\n int &ss = list_str[x];\n int idx = myrank[ss];\n cur += getsum(BIT2, n-1) - getsum(BIT2, idx); // (idx,n-1]\n update(BIT2, idx, 1);\n}\nvoid append_front(int x) {\n int &ss = list_str[x];\n int idx = myrank[ss];\n cur += getsum(BIT2, idx-1);\n update(BIT2, idx, 1);\n}\nvoid remove_end(int x) {\n int &ss = list_str[x];\n int idx = myrank[ss];\n cur -= getsum(BIT2, n-1) - getsum(BIT2, idx); // (idx,n-1]\n update(BIT2, idx, -1);\n}\nvoid remove_front(int x) {\n int &ss = list_str[x];\n int idx = myrank[ss];\n cur -= getsum(BIT2,idx-1);\n update(BIT2, idx, -1);\n}\n \nsigned main() {\n ios_base::sync_with_stdio(false);\n \n //cin >> T;\n while (1) {\n cin >> n;\n size = 1;\n fill(BIT2, BIT2+n+1, 0ll);\n \n list_str.clear();\n sorted_str.clear();\n for (int i=0; i<n; i++) {\n int s;\n cin >> s;\n list_str.push_back(s);\n sorted_str.push_back(s);\n }\n sort(sorted_str.begin(), sorted_str.end());\n for (int i=0; i<n; i++) {\n myrank[sorted_str[i]] = i;\n }\n \n queries.clear();\n cin >> m;\n for(int j = 0 ; j < m ; j++){\n int l, r,k;\n cin >> l >> r;\n --l;\n --r;\n queries.push_back(Data(Seg(l, r), {j,j}));\n }\n \n sort(queries.begin(), queries.end(), cmp_query);\n cur = 0;\n int a = 0;\n int b = -1;\n for (int i=0; i<queries.size(); i++) {\n int l = queries[i].first.first;\n int r = queries[i].first.second;\n int idx = queries[i].second.second;\n int k = queries[i].second.first;\n while (b < r) append_end(++b);\n while (l < a) append_front(--a);\n while (a < l) remove_front(a++);\n while (r < b) remove_end(b--);\n ans[idx] = cur;\n }\n \n for (int i=0; i<m; i++) {\n cout << ans[i] << endl;\n }\n break;\n }\n}","accuracy":0.6176470588235294,"time_ms":60,"memory_kb":14396,"score_of_the_acc":-0.0335,"final_rank":16},{"submission_id":"aoj_2779_1697156","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef complex<double> P;\ntypedef pair<int,int> pii;\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define REPR(i,n) for(ll i=1;i<n;++i)\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define MOD (ll)(1e9+7)\n#define ADD(a,b) a=((a)+(b))%MOD\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\n// http://hos.ac/slides/20140319_bit.pdf\nstruct BIT{\n int n;\n vl dat;\n BIT(){}\n BIT(int n):n(n){dat.assign(n,0);}\n BIT(int n, ll arr[]){\n dat.assign(n,0);\n REP(i,n-1){\n dat[i]+=arr[i];\n dat[i|(i+1)]+=dat[i];\n }\n }\n BIT(BIT &past):n(past.n),dat(past.dat){}\n // 0-indexed\n void add(int pos, ll val){for(int x=pos;x<n;x|=x+1)dat[x]+=val;}\n // [0...pos]\n ll sum(int pos){\n ll ret = 0;\n for(int x=pos;x>=0;x=(x&(x+1))-1)ret+=dat[x];\n return ret;\n }\n ll all(){\n return sum(n-1);\n }\n // [pos...n-1]\n ll revsum(int pos){\n return all()-sum(pos-1);\n }\n};\n\n// http://japl.pl/contest/ijpc/1/reviews/training.html\n\nint n;\nll p[100001];\nint sqrtn;\nll s[317][317];\nBIT f[317];\n\nint main(){\n scanf(\"%d\",&n);\n REP(i,n)scanf(\"%d\",p+i);\n // ???????????´\n sqrtn = 1;\n while(sqrtn*sqrtn<n)++sqrtn;\n FOR(i,n,sqrtn*sqrtn)p[i]=n;\n n = sqrtn*sqrtn;\n // ?????±??????????????±?????? sum\n REP(i,sqrtn){\n BIT bit(n+1);\n ll ans = 0;\n FOR(j,i,sqrtn){\n // update bit\n REP(k,sqrtn){\n ll val = p[j*sqrtn + k];\n ans += bit.revsum(val+1);\n bit.add(val,1);\n }\n s[i][j] = ans;\n }\n }\n // ????????????\n {\n BIT bit(n+1);\n REP(i,sqrtn){\n REP(j,sqrtn)bit.add(p[i*sqrtn+j],1);\n f[i] = BIT(bit);\n }\n }\n // answer\n int q;\n scanf(\"%d\",&q);\n BIT bit(n+1); // ??????n????´?????????£?¨????????????¨O(NQ)????????§????????????\n while(q--){\n ll ans = 0;\n int l,r;\n scanf(\"%d%d\",&l,&r);\n --l; --r;\n int u = l/sqrtn, v = r/sqrtn;\n ++u; --v;\n int leftright = u*sqrtn-1;\n int rightleft = (v+1)*sqrtn;\n if(u<=v){\n // [u,v]????????±??????????????£??¨????????§??????\n ans += s[u][v];\n // ?????´??¨[u,v]?????±???\n FOR(i,l,leftright+1){\n ll val = p[i];\n ans += f[v].sum(val-1);\n ans -= f[u-1].sum(val-1);\n }\n // ?????´??¨[u,v]?????±???\n FOR(i,rightleft,r+1){\n ll val = p[i];\n ans += f[v].revsum(val+1);\n ans -= f[u-1].revsum(val+1);\n }\n }\n // ??£???\n if(leftright<rightleft){\n // ?????¢\n FOR(i,l,leftright+1){\n ll val = p[i];\n ans += bit.revsum(val+1);\n bit.add(val,1);\n }\n FOR(i,rightleft,r+1){\n ll val = p[i];\n ans += bit.revsum(val+1);\n bit.add(val,1);\n }\n // ???????????????\n FOR(i,l,leftright+1){\n bit.add(p[i],-1);\n }\n FOR(i,rightleft,r+1){\n bit.add(p[i],-1);\n }\n }else{\n // ????????????\n int size = r-l+1;\n assert(size <= 2*sqrtn);\n FOR(i,l,r+1){\n ll val = p[i];\n ans += bit.revsum(val+1);\n bit.add(val,1);\n }\n // ???????????????\n FOR(i,l,r+1){\n bit.add(p[i],-1);\n }\n }\n printf(\"%d\\n\",ans);\n }\n return 0;\n}","accuracy":0.6176470588235294,"time_ms":30,"memory_kb":4296,"score_of_the_acc":-0.0029,"final_rank":15},{"submission_id":"aoj_2779_1695804","code_snippet":"#include <vector>\n#include <utility>\n#include <algorithm>\n#include <iostream>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\n\ninline int calcIndex(int i, int j) {\n\treturn j * (j + 1) / 2 + (j - i);\n}\n\nint main() {\n\tconst int BlockSize = 400;\n\tconst int MaxN = 100000, MaxNumBlocks = (MaxN + BlockSize - 1) / BlockSize;\n\tstatic int counts[MaxNumBlocks + 1][MaxN + 1];\n\tstatic short counts2[BlockSize + 1][BlockSize + 1];\n\n\tint N;\n\twhile(~scanf(\"%d\", &N)) {\n\t\tint X = N;\n\t\tvector<int> p(N);\n\t\tfor(int i = 0; i < N; ++ i) {\n\t\t\tscanf(\"%d\", &p[i]), -- p[i];\n\t\t}\n\t\tint NumBlocks = (N + BlockSize - 1) / BlockSize;\n\t\tmemset(counts, 0, sizeof counts);\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\n\t\t\tfor(int i = L; i < R; ++ i)\n\t\t\t\t++ counts[bi + 1][p[i] + 1];\n\t\t\tfor(int x = 1; x <= X; ++ x)\n\t\t\t\tcounts[bi + 1][x] += counts[bi][x] + counts[bi + 1][x - 1] - counts[bi][x - 1];\n\t\t}\n\t\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\n\t\tvector<vector<int> > inner(NumBlocks);\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\n\t\t\tint M = R - L, Y = M;\n\n\t\t\tvector<pair<int, int> > &sorted = sortedBlocks[bi];\n\t\t\tsorted.resize(M);\n\t\t\tfor(int i = L; i < R; ++ i)\n\t\t\t\tsorted[i - L] = make_pair(p[i], i);\n\t\t\tsort(sorted.begin(), sorted.end());\n\t\t\t\n\t\t\tvector<int> rank(M);\n\t\t\tfor(int i = 0; i < M; ++ i)\n\t\t\t\trank[sorted[i].second - L] = i;\n\n\t\t\tmemset(counts2, 0, sizeof counts2);\n\n\t\t\tfor(int i = 0; i < M; ++ i)\n\t\t\t\t++ counts2[i + 1][rank[i] + 1];\n\t\t\tfor(int i = 0; i < M; ++ i) for(int y = 1; y <= Y; ++ y)\n\t\t\t\tcounts2[i + 1][y] += counts2[i][y] + counts2[i + 1][y - 1] - counts2[i][y - 1];\n\n\t\t\tvector<int> &v = inner[bi];\n\t\t\tv.resize((R - L) * (R - L + 1) / 2);\n\t\t\tint k = 0;\n\t\t\tfor(int j = 0; j < M; ++ j) {\n\t\t\t\tint sum = 0;\n\t\t\t\tfor(int i = j; i >= 0; -- i) {\n\t\t\t\t\tsum += counts2[j + 1][rank[i]] - counts2[i + 1][rank[i]];\n\t\t\t\t\tv[k ++] = sum;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<vector<long long> > outer(NumBlocks + 1, vector<long long>(N));\n\t\tfor(int bi = 0; bi <= NumBlocks; ++ bi) {\n\t\t\tvector<long long> &v = outer[bi];\n\t\t\tlong long sum;\n\t\t\tsum = 0;\n\t\t\tfor(int bj = bi; bj < NumBlocks; ++ bj) {\n\t\t\t\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\n\t\t\t\tint num = (bj - bi) * BlockSize;\n\t\t\t\tfor(int j = L; j < R; ++ j) {\n\t\t\t\t\tsum += num - (counts[bj][p[j] + 1] - counts[bi][p[j] + 1]);\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t}\n\t\t\t\tsum += inner[bj][calcIndex(0, R - L - 1)];\n\t\t\t}\n\t\t\tsum = 0;\n\t\t\tfor(int bj = bi - 1; bj >= 0; -- bj) {\n\t\t\t\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\n\t\t\t\tfor(int j = R - 1; j >= L; -- j) {\n\t\t\t\t\tsum += counts[bi][p[j]] - counts[bj + 1][p[j]];\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t}\n\t\t\t\tsum += inner[bj][calcIndex(0, R - L - 1)];\n\t\t\t}\n\t\t}\n\t\tint Q;\n\t\tscanf(\"%d\", &Q);\n\t\tfor(int ii = 0; ii < Q; ++ ii) {\n\t\t\tint l; int r;\n\t\t\tscanf(\"%d%d\", &l, &r), -- l;\n\t\t\tint bl = (l + BlockSize - 1) / BlockSize, br = r / BlockSize;\n\t\t\tlong long ans = 0;\n\t\t\tif(l / BlockSize == (r - 1) / BlockSize) {\n\t\t\t\tans = inner[l / BlockSize][calcIndex(l % BlockSize, (r - 1) % BlockSize)];\n\t\t\t} else {\n\t\t\t\tint L = bl * BlockSize, R = br * BlockSize;\n\t\t\t\tans += outer[bl][r - 1];\n\t\t\t\tans += inner[(r - 1) / BlockSize][calcIndex(0, (r - 1) % BlockSize)];\n\t\t\t\tif(l < R) {\n\t\t\t\t\tans += outer[br][l];\n\t\t\t\t\tans += inner[l / BlockSize][calcIndex(l % BlockSize, min(BlockSize, N - l / BlockSize * BlockSize) - 1)];\n\t\t\t\t}\n\t\t\t\tif(bl < br) {\n\t\t\t\t\tans -= outer[bl][R - 1];\n\t\t\t\t\tans -= inner[(R - 1) / BlockSize][calcIndex(0, BlockSize - 1)];\n\t\t\t\t}\n\t\t\t\tif(l < L && R < r) {\n\t\t\t\t\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\n\t\t\t\t\tint nv = (int)v.size(), nw = (int)w.size();\n\t\t\t\t\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\n\t\t\t\t\t\tfor(; j < nw && w[j].first < v[i].first; ++ j)\n\t\t\t\t\t\t\tcnt += w[j].second < r;\n\t\t\t\t\t\tif(l <= v[i].second)\n\t\t\t\t\t\t\tans += cnt;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%lld\\n\", ans);\n\t\t\t//fflush(stdout);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1350,"memory_kb":377236,"score_of_the_acc":-1.2104,"final_rank":9},{"submission_id":"aoj_2779_1695803","code_snippet":"#include <vector>\n#include <utility>\n#include <algorithm>\n#include <iostream>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\n\ninline int calcIndex(int i, int j) {\n\treturn j * (j + 1) / 2 + (j - i);\n}\n\nint main() {\n\tconst int BlockSize = 250;\n\tconst int MaxN = 100000, MaxNumBlocks = (MaxN + BlockSize - 1) / BlockSize;\n\tstatic int counts[MaxNumBlocks + 1][MaxN + 1];\n\tstatic short counts2[BlockSize + 1][BlockSize + 1];\n\n\tint N;\n\twhile(~scanf(\"%d\", &N)) {\n\t\tint X = N;\n\t\tvector<int> p(N);\n\t\tfor(int i = 0; i < N; ++ i) {\n\t\t\tscanf(\"%d\", &p[i]), -- p[i];\n\t\t}\n\t\tint NumBlocks = (N + BlockSize - 1) / BlockSize;\n\t\tmemset(counts, 0, sizeof counts);\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\n\t\t\tfor(int i = L; i < R; ++ i)\n\t\t\t\t++ counts[bi + 1][p[i] + 1];\n\t\t\tfor(int x = 1; x <= X; ++ x)\n\t\t\t\tcounts[bi + 1][x] += counts[bi][x] + counts[bi + 1][x - 1] - counts[bi][x - 1];\n\t\t}\n\t\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\n\t\tvector<vector<int> > inner(NumBlocks);\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\n\t\t\tint M = R - L, Y = M;\n\n\t\t\tvector<pair<int, int> > &sorted = sortedBlocks[bi];\n\t\t\tsorted.resize(M);\n\t\t\tfor(int i = L; i < R; ++ i)\n\t\t\t\tsorted[i - L] = make_pair(p[i], i);\n\t\t\tsort(sorted.begin(), sorted.end());\n\t\t\t\n\t\t\tvector<int> rank(M);\n\t\t\tfor(int i = 0; i < M; ++ i)\n\t\t\t\trank[sorted[i].second - L] = i;\n\n\t\t\tmemset(counts2, 0, sizeof counts2);\n\n\t\t\tfor(int i = 0; i < M; ++ i)\n\t\t\t\t++ counts2[i + 1][rank[i] + 1];\n\t\t\tfor(int i = 0; i < M; ++ i) for(int y = 1; y <= Y; ++ y)\n\t\t\t\tcounts2[i + 1][y] += counts2[i][y] + counts2[i + 1][y - 1] - counts2[i][y - 1];\n\n\t\t\tvector<int> &v = inner[bi];\n\t\t\tv.resize((R - L) * (R - L + 1) / 2);\n\t\t\tint k = 0;\n\t\t\tfor(int j = 0; j < M; ++ j) {\n\t\t\t\tint sum = 0;\n\t\t\t\tfor(int i = j; i >= 0; -- i) {\n\t\t\t\t\tsum += counts2[j + 1][rank[i]] - counts2[i + 1][rank[i]];\n\t\t\t\t\tv[k ++] = sum;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<vector<long long> > outer(NumBlocks + 1, vector<long long>(N));\n\t\tfor(int bi = 0; bi <= NumBlocks; ++ bi) {\n\t\t\tvector<long long> &v = outer[bi];\n\t\t\tlong long sum;\n\t\t\tsum = 0;\n\t\t\tfor(int bj = bi; bj < NumBlocks; ++ bj) {\n\t\t\t\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\n\t\t\t\tint num = (bj - bi) * BlockSize;\n\t\t\t\tfor(int j = L; j < R; ++ j) {\n\t\t\t\t\tsum += num - (counts[bj][p[j] + 1] - counts[bi][p[j] + 1]);\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t}\n\t\t\t\tsum += inner[bj][calcIndex(0, R - L - 1)];\n\t\t\t}\n\t\t\tsum = 0;\n\t\t\tfor(int bj = bi - 1; bj >= 0; -- bj) {\n\t\t\t\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\n\t\t\t\tfor(int j = R - 1; j >= L; -- j) {\n\t\t\t\t\tsum += counts[bi][p[j]] - counts[bj + 1][p[j]];\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t}\n\t\t\t\tsum += inner[bj][calcIndex(0, R - L - 1)];\n\t\t\t}\n\t\t}\n\t\tint Q;\n\t\tscanf(\"%d\", &Q);\n\t\tfor(int ii = 0; ii < Q; ++ ii) {\n\t\t\tint l; int r;\n\t\t\tscanf(\"%d%d\", &l, &r), -- l;\n\t\t\tint bl = (l + BlockSize - 1) / BlockSize, br = r / BlockSize;\n\t\t\tlong long ans = 0;\n\t\t\tif(l / BlockSize == (r - 1) / BlockSize) {\n\t\t\t\tans = inner[l / BlockSize][calcIndex(l % BlockSize, (r - 1) % BlockSize)];\n\t\t\t} else {\n\t\t\t\tint L = bl * BlockSize, R = br * BlockSize;\n\t\t\t\tans += outer[bl][r - 1];\n\t\t\t\tans += inner[(r - 1) / BlockSize][calcIndex(0, (r - 1) % BlockSize)];\n\t\t\t\tif(l < R) {\n\t\t\t\t\tans += outer[br][l];\n\t\t\t\t\tans += inner[l / BlockSize][calcIndex(l % BlockSize, min(BlockSize, N - l / BlockSize * BlockSize) - 1)];\n\t\t\t\t}\n\t\t\t\tif(bl < br) {\n\t\t\t\t\tans -= outer[bl][R - 1];\n\t\t\t\t\tans -= inner[(R - 1) / BlockSize][calcIndex(0, BlockSize - 1)];\n\t\t\t\t}\n\t\t\t\tif(l < L && R < r) {\n\t\t\t\t\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\n\t\t\t\t\tint nv = (int)v.size(), nw = (int)w.size();\n\t\t\t\t\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\n\t\t\t\t\t\tfor(; j < nw && w[j].first < v[i].first; ++ j)\n\t\t\t\t\t\t\tcnt += w[j].second < r;\n\t\t\t\t\t\tif(l <= v[i].second)\n\t\t\t\t\t\t\tans += cnt;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%lld\\n\", ans);\n\t\t\t//fflush(stdout);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1270,"memory_kb":523108,"score_of_the_acc":-1.461,"final_rank":12},{"submission_id":"aoj_2779_1695799","code_snippet":"#include <vector>\n#include <utility>\n#include <algorithm>\n#include <iostream>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\n\ninline int calcIndex(int i, int j) {\n\treturn j * (j + 1) / 2 + (j - i);\n}\n\nint main() {\n\tconst int BlockSize = 300;\n\tconst int MaxN = 100000, MaxNumBlocks = (MaxN + BlockSize - 1) / BlockSize;\n\tstatic int counts[MaxNumBlocks + 1][MaxN + 1];\n\tstatic short counts2[BlockSize + 1][BlockSize + 1];\n\n\tint N;\n\twhile(~scanf(\"%d\", &N)) {\n\t\tint X = N;\n\t\tvector<int> p(N);\n\t\tfor(int i = 0; i < N; ++ i) {\n\t\t\tscanf(\"%d\", &p[i]), -- p[i];\n\t\t}\n\t\tint NumBlocks = (N + BlockSize - 1) / BlockSize;\n\t\tmemset(counts, 0, sizeof counts);\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\n\t\t\tfor(int i = L; i < R; ++ i)\n\t\t\t\t++ counts[bi + 1][p[i] + 1];\n\t\t\tfor(int x = 1; x <= X; ++ x)\n\t\t\t\tcounts[bi + 1][x] += counts[bi][x] + counts[bi + 1][x - 1] - counts[bi][x - 1];\n\t\t}\n\t\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\n\t\tvector<vector<int> > inner(NumBlocks);\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\n\t\t\tint M = R - L, Y = M;\n\n\t\t\tvector<pair<int, int> > &sorted = sortedBlocks[bi];\n\t\t\tsorted.resize(M);\n\t\t\tfor(int i = L; i < R; ++ i)\n\t\t\t\tsorted[i - L] = make_pair(p[i], i);\n\t\t\tsort(sorted.begin(), sorted.end());\n\t\t\t\n\t\t\tvector<int> rank(M);\n\t\t\tfor(int i = 0; i < M; ++ i)\n\t\t\t\trank[sorted[i].second - L] = i;\n\n\t\t\tmemset(counts2, 0, sizeof counts2);\n\n\t\t\tfor(int i = 0; i < M; ++ i)\n\t\t\t\t++ counts2[i + 1][rank[i] + 1];\n\t\t\tfor(int i = 0; i < M; ++ i) for(int y = 1; y <= Y; ++ y)\n\t\t\t\tcounts2[i + 1][y] += counts2[i][y] + counts2[i + 1][y - 1] - counts2[i][y - 1];\n\n\t\t\tvector<int> &v = inner[bi];\n\t\t\tv.resize((R - L) * (R - L + 1) / 2);\n\t\t\tint k = 0;\n\t\t\tfor(int j = 0; j < M; ++ j) {\n\t\t\t\tint sum = 0;\n\t\t\t\tfor(int i = j; i >= 0; -- i) {\n\t\t\t\t\tsum += counts2[j + 1][rank[i]] - counts2[i + 1][rank[i]];\n\t\t\t\t\tv[k ++] = sum;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<vector<long long> > outer(NumBlocks + 1, vector<long long>(N));\n\t\tfor(int bi = 0; bi <= NumBlocks; ++ bi) {\n\t\t\tvector<long long> &v = outer[bi];\n\t\t\tlong long sum;\n\t\t\tsum = 0;\n\t\t\tfor(int bj = bi; bj < NumBlocks; ++ bj) {\n\t\t\t\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\n\t\t\t\tint num = (bj - bi) * BlockSize;\n\t\t\t\tfor(int j = L; j < R; ++ j) {\n\t\t\t\t\tsum += num - (counts[bj][p[j] + 1] - counts[bi][p[j] + 1]);\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t}\n\t\t\t\tsum += inner[bj][calcIndex(0, R - L - 1)];\n\t\t\t}\n\t\t\tsum = 0;\n\t\t\tfor(int bj = bi - 1; bj >= 0; -- bj) {\n\t\t\t\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\n\t\t\t\tfor(int j = R - 1; j >= L; -- j) {\n\t\t\t\t\tsum += counts[bi][p[j]] - counts[bj + 1][p[j]];\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t}\n\t\t\t\tsum += inner[bj][calcIndex(0, R - L - 1)];\n\t\t\t}\n\t\t}\n\t\tint Q;\n\t\tscanf(\"%d\", &Q);\n\t\tfor(int ii = 0; ii < Q; ++ ii) {\n\t\t\tint l; int r;\n\t\t\tscanf(\"%d%d\", &l, &r), -- l;\n\t\t\tint bl = (l + BlockSize - 1) / BlockSize, br = r / BlockSize;\n\t\t\tlong long ans = 0;\n\t\t\tif(l / BlockSize == (r - 1) / BlockSize) {\n\t\t\t\tans = inner[l / BlockSize][calcIndex(l % BlockSize, (r - 1) % BlockSize)];\n\t\t\t} else {\n\t\t\t\tint L = bl * BlockSize, R = br * BlockSize;\n\t\t\t\tans += outer[bl][r - 1];\n\t\t\t\tans += inner[(r - 1) / BlockSize][calcIndex(0, (r - 1) % BlockSize)];\n\t\t\t\tif(l < R) {\n\t\t\t\t\tans += outer[br][l];\n\t\t\t\t\tans += inner[l / BlockSize][calcIndex(l % BlockSize, min(BlockSize, N - l / BlockSize * BlockSize) - 1)];\n\t\t\t\t}\n\t\t\t\tif(bl < br) {\n\t\t\t\t\tans -= outer[bl][R - 1];\n\t\t\t\t\tans -= inner[(R - 1) / BlockSize][calcIndex(0, BlockSize - 1)];\n\t\t\t\t}\n\t\t\t\tif(l < L && R < r) {\n\t\t\t\t\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\n\t\t\t\t\tint nv = (int)v.size(), nw = (int)w.size();\n\t\t\t\t\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\n\t\t\t\t\t\tfor(; j < nw && w[j].first < v[i].first; ++ j)\n\t\t\t\t\t\t\tcnt += w[j].second < r;\n\t\t\t\t\t\tif(l <= v[i].second)\n\t\t\t\t\t\t\tans += cnt;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%lld\\n\", ans);\n\t\t\t//fflush(stdout);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1260,"memory_kb":456736,"score_of_the_acc":-1.3297,"final_rank":10},{"submission_id":"aoj_2779_1695542","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <vector>\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define pb push_back\n#define sz(x) (int)(x).size()\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> vi;\n\nconst int D = 300, E = 351, MX = 100005;\n// Binary Indexed Tree\nstruct bit {\n vector<int> d; int n, hi;\n vi hist;\n bit() {}\n bit(int mx): n(mx), d(mx), hist(MX), hi(0) {}\n void add(int i, int x=1) {\n for (++i;i<n;i+=i&-i) {\n d[i] += x;\n }\n }\n void add2(int i, int x=1) {\n for (++i;i<n;i+=i&-i) {\n hist[hi++] = i;\n d[i] += x;\n }\n }\n int sum(int i) {\n int x = 0;\n for (++i;i;i-=i&-i) x += d[i];\n return x;\n }\n void rev() {\n d = vi(n);\n }\n void rev2() {\n while (hi--) d[hist[hi]] = 0;\n hi = 0;\n }\n};\n//\nint n, a[MX];\nvector<ll> dl[E], dr[E];\nint main() {\n // preprocess\n scanf(\"%d\",&n);\n rep(i,n) scanf(\"%d\",&a[i]), a[i] = n-a[i];\n bit t(n+2);\n for (int i = 0; i <= n; i += D) {\n int di = i/D;\n ll sum = 0;\n for (int j = i; j < n; ++j) {\n sum += t.sum(a[j]);\n dl[di].pb(sum);\n t.add(a[j]);\n }\n t.rev();\n sum = 0;\n for (int j = i-1; j >= 0; --j) {\n sum += t.sum(n-a[j]);\n dr[di].pb(sum);\n t.add(n-a[j]);\n }\n t.rev();\n }\n // online query\n int q;\n scanf(\"%d\",&q);\n rep(qi,q) {\n int l, r;\n scanf(\"%d%d\",&l,&r);\n --l;\n ll ans = 0;\n if (r-l <= D) {\n for (int i = l; i < r; ++i) {\n ans += t.sum(a[i]);\n t.add2(a[i]);\n }\n t.rev2();\n } else {\n int li = l/D+1, ri = r/D;\n ans += dl[li][r-1-li*D];\n ans += dr[ri][ri*D-1-l];\n ans -= dl[li][ri*D-1-li*D];\n vi p;\n for (int i = li*D-1; i >= l; --i) p.pb(a[i]<<1);\n for (int i = ri*D; i < r; ++i) p.pb(a[i]<<1|1);\n sort(p.begin(), p.end());\n int s = 0;\n rep(i,sz(p)) {\n if (p[i]&1) ans += s;\n else s++;\n }\n }\n printf(\"%lld\\n\",ans);\n }\n return 0;\n}","accuracy":0.3235294117647059,"time_ms":40,"memory_kb":3412,"score_of_the_acc":-0.0049,"final_rank":18},{"submission_id":"aoj_2779_1695539","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <vector>\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define pb push_back\n#define sz(x) (int)(x).size()\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> vi;\n\nconst int D = 300, E = 351, MX = 100005;\n// Binary Indexed Tree\nstruct bit {\n vector<int> d; int n, hi;\n vi hist;\n bit() {}\n bit(int mx): n(mx), d(mx), hist(MX), hi(0) {}\n void add(int i, int x=1) {\n for (++i;i<n;i+=i&-i) {\n d[i] += x;\n }\n }\n void add2(int i, int x=1) {\n for (++i;i<n;i+=i&-i) {\n hist[hi++] = i;\n d[i] += x;\n }\n }\n int sum(int i) {\n int x = 0;\n for (++i;i;i-=i&-i) x += d[i];\n return x;\n }\n void rev() {\n d = vi(n);\n }\n void rev2() {\n while (hi--) d[hist[hi]] = 0;\n hi = 0;\n }\n};\n//\nint n, a[MX];\nvector<ll> dl[E], dr[E];\nint main() {\n // preprocess\n scanf(\"%d\",&n);\n rep(i,n) scanf(\"%d\",&a[i]), a[i] = n-a[i];\n bit t(n+2);\n for (int i = 0; i <= n; i += D) {\n int di = i/D;\n ll sum = 0;\n for (int j = i; j < n; ++j) {\n sum += t.sum(a[j]);\n dl[di].pb(sum);\n t.add(a[j]);\n }\n t.rev();\n sum = 0;\n for (int j = i-1; j >= 0; --j) {\n sum += t.sum(n-a[j]);\n dr[di].pb(sum);\n t.add(n-a[j]);\n }\n t.rev();\n }\n // online query\n int q;\n scanf(\"%d\",&q);\n rep(qi,q) {\n int l, r;\n scanf(\"%d%d\",&l,&r);\n --l;\n ll ans = 0;\n if (r-l <= D) {\n for (int i = l; i < r; ++i) {\n ans += t.sum(a[i]);\n t.add2(a[i]);\n }\n t.rev2();\n } else {\n int li = l/D+1, ri = r/D;\n ans += dl[li][r-1-li*D];\n ans += dr[ri][ri*D-l];\n ans -= dl[li][ri*D-1-li*D];\n vi p;\n for (int i = li*D-1; i >= l; --i) p.pb(a[i]<<1);\n for (int i = ri*D; i < r; ++i) p.pb(a[i]<<1|1);\n sort(p.begin(), p.end());\n int s = 0;\n rep(i,sz(p)) {\n if (p[i]&1) ans += s;\n else s++;\n }\n }\n printf(\"%lld\\n\",ans);\n }\n return 0;\n}","accuracy":0.3235294117647059,"time_ms":40,"memory_kb":3412,"score_of_the_acc":-0.0049,"final_rank":18},{"submission_id":"aoj_2779_1695533","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <vector>\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define pb push_back\n#define sz(x) (int)(x).size()\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> vi;\n\nconst int D = 300, E = 351, MX = 100005;\n// Binary Indexed Tree\nstruct bit {\n vector<int> d; int n, hi;\n vi hist;\n bit() {}\n bit(int mx): n(mx), d(mx), hist(MX), hi(0) {}\n void add(int i, int x=1) {\n for (++i;i<n;i+=i&-i) {\n d[i] += x;\n }\n }\n void add2(int i, int x=1) {\n for (++i;i<n;i+=i&-i) {\n hist[hi++] = i;\n d[i] += x;\n }\n }\n int sum(int i) {\n int x = 0;\n for (++i;i;i-=i&-i) x += d[i];\n return x;\n }\n void rev() {\n d = vi(n);\n }\n void rev2() {\n while (hi--) d[hist[hi]] = 0;\n hi = 0;\n }\n};\n//\nint n, a[MX];\nll dl[E][MX], dr[E][MX];\nint main() {\n // preprocess\n scanf(\"%d\",&n);\n rep(i,n) scanf(\"%d\",&a[i]), a[i] = n-a[i];\n bit t(n+2);\n for (int i = 0; i <= n; i += D) {\n int di = i/D;\n ll sum = 0;\n for (int j = i; j < n; ++j) {\n sum += t.sum(a[j]);\n dl[di][j] = sum;\n t.add(a[j]);\n }\n t.rev();\n sum = 0;\n for (int j = i-1; j >= 0; --j) {\n sum += t.sum(n-a[j]);\n dr[di][j] = sum;\n t.add(n-a[j]);\n }\n t.rev();\n }\n // online query\n int q;\n scanf(\"%d\",&q);\n rep(qi,q) {\n int l, r;\n scanf(\"%d%d\",&l,&r);\n --l;\n ll ans = 0;\n if (r-l <= D) {\n for (int i = l; i < r; ++i) {\n ans += t.sum(a[i]);\n t.add2(a[i]);\n }\n t.rev2();\n } else {\n int li = l/D+1, ri = r/D;\n ans += dl[li][r-1];\n ans += dr[ri][l];\n ans -= dl[li][ri*D-1];\n vi p;\n for (int i = li*D-1; i >= l; --i) p.pb(a[i]<<1);\n for (int i = ri*D; i < r; ++i) p.pb(a[i]<<1|1);\n sort(p.begin(), p.end());\n int s = 0;\n rep(i,sz(p)) {\n if (p[i]&1) ans += s;\n else s++;\n }\n }\n printf(\"%lld\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":2720,"memory_kb":267636,"score_of_the_acc":-1.509,"final_rank":13},{"submission_id":"aoj_2779_1695527","code_snippet":"#include <vector>\n#include <utility>\n#include <algorithm>\n#include <cstdio>\nusing namespace std;\n\nstruct FenwickTree {\n\ttypedef int T;\n\tvector<T> v;\n\tvoid init(int n) { v.assign(n, 0); }\n\tvoid add(int i, T x) {\n\t\tfor(; i < (int)v.size(); i |= i + 1) v[i] += x;\n\t}\n\tT sum(int i) const {\t//[0, i)\n\t\tT r = 0;\n\t\tfor(-- i; i >= 0; i = (i & (i + 1)) - 1) r += v[i];\n\t\treturn r;\n\t}\n\tT sum(int left, int right) const {\t//[left, right)\n\t\treturn sum(right) - sum(left);\n\t}\n};\n\nint main() {\n\tint N;\n\twhile(~scanf(\"%d\", &N)) {\n\t\tvector<int> p(N);\n\t\tfor(int i = 0; i < N; ++ i) {\n\t\t\tscanf(\"%d\", &p[i]), -- p[i];\n\t\t}\n\t\tint BlockSize = 500;\n\t\tint NumBlocks = N / BlockSize + 1;\n\t\tvector<vector<long long> > memo(NumBlocks, vector<long long>(N));\n\t\tFenwickTree ft;\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tvector<long long> &v = memo[bi];\n\t\t\tint i = bi * BlockSize;\n\t\t\t{\n\t\t\t\tft.init(N);\n\t\t\t\tlong long sum = 0;\n\t\t\t\tfor(int j = i; j < N; ++ j) {\n\t\t\t\t\tsum += (j - i) - ft.sum(p[j]);\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t\tft.add(p[j], 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\t{\n\t\t\t\tft.init(N);\n\t\t\t\tlong long sum = 0;\n\t\t\t\tfor(int j = i - 1; j >= 0; -- j) {\n\t\t\t\t\tsum += ft.sum(p[j]);\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t\tft.add(p[j], 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\n\t\tvector<int> rankInBlock(N, -1);\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\n\t\t\tvector<pair<int, int> > &v = sortedBlocks[bi];\n\t\t\tv.resize(R - L);\n\t\t\tfor(int i = L; i < R; ++ i)\n\t\t\t\tv[i - L] = make_pair(p[i], i);\n\t\t\tsort(v.begin(), v.end());\n\t\t\tfor(int i = 0; i < R - L; ++ i)\n\t\t\t\trankInBlock[v[i].second] = i;\n\t\t}\n\t\tint Q;\n\t\tscanf(\"%d\", &Q);\n\t\tfor(int ii = 0; ii < Q; ++ ii) {\n\t\t\tint l; int r;\n\t\t\tscanf(\"%d%d\", &l, &r), -- l, -- r;\n\t\t\tint bl = (l + BlockSize - 1) / BlockSize, br = (r + 1) / BlockSize;\n\t\t\tlong long ans = 0;\n\t\t\tif(bl > br) {\n\t\t\t\tft.init(BlockSize);\n\t\t\t\tfor(int i = r; i >= l; -- i) {\n\t\t\t\t\tans += ft.sum(rankInBlock[i]);\n\t\t\t\t\tft.add(rankInBlock[i], 1);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tint L = bl * BlockSize, R = br * BlockSize;\n\t\t\t\tans += memo[bl][r];\n\t\t\t\tans += memo[br][l];\n\t\t\t\tif(bl < br)\n\t\t\t\t\tans -= memo[bl][R - 1];\n\t\t\t\tif(l < L && R <= r) {\n\t\t\t\t\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\n\t\t\t\t\tint nv = (int)v.size(), nw = (int)w.size();\n\t\t\t\t\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\n\t\t\t\t\t\tfor(; j < nw && w[j].first < v[i].first; ++ j)\n\t\t\t\t\t\t\tcnt += w[j].second <= r;\n\t\t\t\t\t\tif(l <= v[i].second)\n\t\t\t\t\t\t\tans += cnt;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%lld\\n\", ans);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1670,"memory_kb":160564,"score_of_the_acc":-0.9129,"final_rank":7},{"submission_id":"aoj_2779_1695525","code_snippet":"#include <vector>\n#include <utility>\n#include <algorithm>\n#include <cstdio>\nusing namespace std;\n\nstruct FenwickTree {\n\ttypedef int T;\n\tvector<T> v;\n\tvoid init(int n) { v.assign(n, 0); }\n\tvoid add(int i, T x) {\n\t\tfor(; i < (int)v.size(); i |= i + 1) v[i] += x;\n\t}\n\tT sum(int i) const {\t//[0, i)\n\t\tT r = 0;\n\t\tfor(-- i; i >= 0; i = (i & (i + 1)) - 1) r += v[i];\n\t\treturn r;\n\t}\n\tT sum(int left, int right) const {\t//[left, right)\n\t\treturn sum(right) - sum(left);\n\t}\n};\n\nint main() {\n\tint N;\n\twhile(~scanf(\"%d\", &N)) {\n\t\tvector<int> p(N);\n\t\tfor(int i = 0; i < N; ++ i) {\n\t\t\tscanf(\"%d\", &p[i]), -- p[i];\n\t\t}\n\t\tint BlockSize = 500;\n\t\tint NumBlocks = N / BlockSize + 1;\n\t\tvector<vector<long long> > memo(NumBlocks, vector<long long>(N));\n\t\tFenwickTree ft;\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tvector<long long> &v = memo[bi];\n\t\t\tint i = bi * BlockSize;\n\t\t\t{\n\t\t\t\tft.init(N);\n\t\t\t\tlong long sum = 0;\n\t\t\t\tfor(int j = i; j < N; ++ j) {\n\t\t\t\t\tsum += (j - i) - ft.sum(p[j]);\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t\tft.add(p[j], 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\t{\n\t\t\t\tft.init(N);\n\t\t\t\tlong long sum = 0;\n\t\t\t\tfor(int j = i - 1; j >= 0; -- j) {\n\t\t\t\t\tsum += ft.sum(p[j]);\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t\tft.add(p[j], 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\n\t\tvector<int> rankInBlock(N, -1);\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\n\t\t\tvector<pair<int, int> > &v = sortedBlocks[bi];\n\t\t\tv.resize(R - L);\n\t\t\tfor(int i = L; i < R; ++ i)\n\t\t\t\tv[i - L] = make_pair(p[i], i);\n\t\t\tsort(v.begin(), v.end());\n\t\t\tfor(int i = 0; i < R - L; ++ i)\n\t\t\t\trankInBlock[v[i].second] = i;\n\t\t}\n\t\tint Q;\n\t\tscanf(\"%d\", &Q);\n\t\tfor(int ii = 0; ii < Q; ++ ii) {\n\t\t\tint l; int r;\n\t\t\tscanf(\"%d%d\", &l, &r), -- l, -- r;\n\t\t\tint bl = (l + BlockSize - 1) / BlockSize, br = (r + 1) / BlockSize;\n\t\t\tlong long ans = 0;\n\t\t\tif(bl > br) {\n\t\t\t\tft.init(BlockSize);\n\t\t\t\tfor(int i = r; i >= l; -- i) {\n\t\t\t\t\tans += ft.sum(rankInBlock[i]);\n\t\t\t\t\tft.add(rankInBlock[i], 1);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tint L = bl * BlockSize, R = br * BlockSize;\n\t\t\t\tans += memo[bl][r];\n\t\t\t\tans += memo[br][l];\n\t\t\t\tif(bl < br)\n\t\t\t\t\tans -= memo[bl][R - 1];\n\t\t\t\tif(l < L && R <= r) {\n\t\t\t\t\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\n\t\t\t\t\tint nv = (int)v.size(), nw = (int)w.size();\n\t\t\t\t\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\n\t\t\t\t\t\tfor(; j < nw && w[j].first < v[i].first; ++ j)\n\t\t\t\t\t\t\tcnt += w[j].second <= r;\n\t\t\t\t\t\tif(l <= v[i].second)\n\t\t\t\t\t\t\tans += cnt;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%lld\\n\", ans); fflush(stdout);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":2060,"memory_kb":160564,"score_of_the_acc":-1.0579,"final_rank":8},{"submission_id":"aoj_2779_1695471","code_snippet":"#include <vector>\n#include <cstdio>\nusing namespace std;\n\nstruct FenwickTree {\n\ttypedef int T;\n\tvector<T> v;\n\tvoid init(int n) { v.assign(n, 0); }\n\tvoid add(int i, T x) {\n\t\tfor(; i < (int)v.size(); i |= i + 1) v[i] += x;\n\t}\n\tT sum(int i) const { //[0, i)\n\t\tT r = 0;\n\t\tfor(-- i; i >= 0; i = (i & (i + 1)) - 1) r += v[i];\n\t\treturn r;\n\t}\n\tT sum(int left, int right) const { //[left, right)\n\t\treturn sum(right) - sum(left);\n\t}\n};\n\nint main() {\n\tint N;\n\twhile(~scanf(\"%d\", &N)) {\n\t\tvector<int> p(N);\n\t\tfor(int i = 0; i < N; ++ i)\n\t\t\tscanf(\"%d\", &p[i]), -- p[i];\n\t\tint BlockSize = 250, NumBlocks = N / BlockSize + 1;\n\t\tvector<vector<long long> > memo(NumBlocks, vector<long long>(N));\n\t\tFenwickTree ft;\n\t\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\n\t\t\tvector<long long> &v = memo[bi];\n\t\t\tint i = bi * BlockSize;\n\t\t\t{\n\t\t\t\tft.init(N);\n\t\t\t\tlong long sum = 0;\n\t\t\t\tfor(int j = i; j < N; ++ j) {\n\t\t\t\t\tsum += (j - i) - ft.sum(p[j]);\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t\tft.add(p[j], 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\t{\n\t\t\t\tft.init(N);\n\t\t\t\tlong long sum = 0;\n\t\t\t\tfor(int j = i - 1; j >= 0; -- j) {\n\t\t\t\t\tsum += ft.sum(p[j]);\n\t\t\t\t\tv[j] = sum;\n\t\t\t\t\tft.add(p[j], 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tft.init(N);\n\t\tint Q;\n\t\tscanf(\"%d\", &Q);\n\t\tfor(int ii = 0; ii < Q; ++ ii) {\n\t\t\tint l; int r;\n\t\t\tscanf(\"%d%d\", &l, &r), -- l, -- r;\n\t\t\tint bl = (l + BlockSize - 1) / BlockSize, br = (r - 1) / BlockSize;\n\t\t\tlong long ans = 0;\n\t\t\tif(bl > br) {\n\t\t\t\tfor(int i = r; i >= l; -- i) {\n\t\t\t\t\tans += ft.sum(p[i]);\n\t\t\t\t\tft.add(p[i], 1);\n\t\t\t\t}\n\t\t\t\tfor(int i = l; i <= r; ++ i)\n\t\t\t\t\tft.add(p[i], -1);\n\t\t\t} else {\n\t\t\t\tint L = bl * BlockSize, R = br * BlockSize;\n\t\t\t\tans += memo[bl][r];\n\t\t\t\tans += memo[br][l];\n\t\t\t\tif(bl < br)\n\t\t\t\t\tans -= memo[bl][R - 1];\n\t\t\t\tfor(int i = R; i <= r; ++ i)\n\t\t\t\t\tft.add(p[i], 1);\n\t\t\t\tfor(int i = l; i < L; ++ i)\n\t\t\t\t\tans += ft.sum(p[i]);\n\t\t\t\tfor(int i = R; i <= r; ++ i)\n\t\t\t\t\tft.add(p[i], -1);\n\t\t\t}\n\t\t\tprintf(\"%lld\\n\", ans);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":2600,"memory_kb":316488,"score_of_the_acc":-1.5583,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_2779_4926964\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\n#define SIZE 200000\\n#define SQ 300\\n#define LLINF 100000000000000\\n\\nstruct BIT {\\n vector<int> data;\\n\\n BIT(int n): data(n + 2, 0) {};\\n\\n void add(int k, int x) {\\n k++;\\n while (k <= data.size() - 2) {\\n data[k] += x;\\n k += k & -k;\\n }\\n }\\n\\n int query(int k) {\\n int rec = 0;\\n while (k > 0) {\\n rec += data[k];\\n k -= k & (-k);\\n }\\n return rec;\\n }\\n\\n int query(int a, int b) {\\n return query(b) - query(a);\\n }\\n};\\n\\nint N, P[SIZE];\\nll ans[SIZE];\\n\\nint main() {\\n scanf(\\\"%d\\\", &N);\\n\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", P + i);\\n P[i]--;\\n }\\n\\n int Q;\\n\\n vector<pair<pair<int, int>, pair<int, int>>> queries;\\n\\n scanf(\\\"%d\\\", &Q);\\n\\n for (int i = 0; i < Q; i++) {\\n int l, r;\\n scanf(\\\"%d%d\\\", &l, &r);\\n l--;\\n int t = l / SQ;\\n\\n queries.push_back({{t, r}, {l, i}});\\n }\\n\\n sort(queries.begin(), queries.end());\\n\\n BIT bit(N);\\n int L = 0, R = 0;\\n ll cur = 0;\\n\\n for (int i = 0; i < Q; i++) {\\n int idx = queries[i].second.second;\\n int l = queries[i].second.first;\\n int r = queries[i].first.second;\\n\\n while (R < r) {\\n int p = P[R];\\n cur += bit.query(p, N);\\n bit.add(p, 1);\\n R++;\\n }\\n while (L < l) {\\n int p = P[L];\\n cur -= bit.query(p);\\n bit.add(p, -1);\\n L++;\\n }\\n while (l < L) {\\n int p = P[L - 1];\\n cur += bit.query(p);\\n L--;\\n bit.add(p, 1);\\n }\\n while (r < R) {\\n int p = P[R - 1];\\n bit.add(p, -1);\\n cur -= bit.query(p, N);\\n R--;\\n }\\n\\n ans[idx] = cur;\\n }\\n\\n for (int i = 0; i < Q; i++) {\\n printf(\\\"%lld\\\\n\\\", ans[i]);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1460,\n \"memory_kb\": 8512,\n \"score_of_the_acc\": -0.5426,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2779_4926951\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing pll = pair<ll, ll>;\\n#define all(a) begin(a),end(a)\\n\\n\\nconst ll MAX = 1000001;\\nll bit[MAX];\\nll sum_all = 0;\\nvoid add(ll k, ll x){\\n sum_all += x;\\n for(; k < MAX; k += k & -k) bit[k] += x;\\n}\\nll low(ll k){ // (0, k]\\n ll ans = 0;\\n for(; k; k -= k & -k) ans += bit[k];\\n return ans;\\n}\\nll high(ll k){ // (k, MAX]\\n return sum_all - low(k);\\n}\\nint main(){\\n cin.tie(nullptr)->sync_with_stdio(false);\\n ll n;\\n cin >> n;\\n vector<ll> p(n);\\n for(ll& x : p) cin >> x;\\n ll q;\\n cin >> q;\\n vector<pll> query(q);\\n for(auto& [l, r] : query){\\n cin >> l >> r;\\n l--;\\n }\\n const ll sq = sqrt(n);\\n vector<ll> idx(q);\\n iota(all(idx), 0);\\n sort(all(idx), [&](ll x, ll y){\\n const auto [l1, r1] = query[x];\\n const auto [l2, r2] = query[y];\\n if(l1 / sq == l2 / sq){\\n return r1 < r2;\\n }\\n return l1 < l2;\\n });\\n vector<ll> ans(q);\\n ll L = 0, R = 0, cnt = 0;\\n for(ll i : idx){\\n const auto [l, r] = query[i];\\n while(R < r){\\n cnt += high(p[R]);\\n add(p[R], 1);\\n R++;\\n }\\n while(L > l){\\n L--;\\n cnt += low(p[L]);\\n add(p[L], 1);\\n }\\n while(R > r){\\n R--;\\n add(p[R], -1);\\n cnt -= high(p[R]);\\n }\\n while(L < l){\\n add(p[L], -1);\\n cnt -= low(p[L]);\\n L++;\\n }\\n ans[i] = cnt;\\n }\\n for(ll i : ans) cout << i << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1580,\n \"memory_kb\": 15128,\n \"score_of_the_acc\": -0.5999,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2779_4926941\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing pll = pair<ll, ll>;\\n#define all(a) begin(a),end(a)\\n\\n\\nconst ll MAX = 1000001;\\nll bit[MAX];\\nll sum_all = 0;\\nvoid add(ll k, ll x){\\n sum_all += x;\\n for(; k < MAX; k += k & -k) bit[k] += x;\\n}\\nll low(ll k){ // (0, k]\\n ll ans = 0;\\n for(; k; k -= k & -k) ans += bit[k];\\n return ans;\\n}\\nll high(ll k){ // (k, MAX]\\n return sum_all - low(k);\\n}\\nint main(){\\n cin.tie(nullptr)->sync_with_stdio(false);\\n ll n;\\n cin >> n;\\n vector<ll> p(n);\\n for(ll& x : p) cin >> x;\\n ll q;\\n cin >> q;\\n vector<pll> query(q);\\n for(auto& [l, r] : query){\\n cin >> l >> r;\\n l--;\\n }\\n const ll sq = sqrt(n);\\n vector<ll> idx(q);\\n iota(all(idx), 0);\\n sort(all(idx), [&](ll x, ll y){\\n const auto [l1, r1] = query[x];\\n const auto [l2, r2] = query[y];\\n if(l1 / sq == l2 / sq){\\n if(l1 / sq & 1) return r1 > r2;\\n else return r1 < r2;\\n }\\n return l1 < l2;\\n });\\n vector<ll> ans(q);\\n ll L = 0, R = 0, cnt = 0;\\n for(ll i : idx){\\n const auto [l, r] = query[i];\\n while(R < r){\\n cnt += high(p[R]);\\n add(p[R], 1);\\n R++;\\n }\\n while(L > l){\\n L--;\\n cnt += low(p[L]);\\n add(p[L], 1);\\n }\\n while(R > r){\\n R--;\\n add(p[R], -1);\\n cnt -= high(p[R]);\\n }\\n while(L < l){\\n add(p[L], -1);\\n cnt -= low(p[L]);\\n L++;\\n }\\n ans[i] = cnt;\\n }\\n for(ll i : ans) cout << i << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1090,\n \"memory_kb\": 15156,\n \"score_of_the_acc\": -0.4178,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2779_4571199\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#include <ext/pb_ds/assoc_container.hpp>\\n#include <ext/pb_ds/tree_policy.hpp>\\nusing namespace std;\\nusing namespace __gnu_pbds;\\nusing ll = long long;\\nusing u64 = uint_fast64_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';\\nconstexpr long long MOD = 1000000007;\\n//constexpr long long MOD = 998244353;\\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 popcount(int x) {return __builtin_popcount(x);}\\ninline int popcount(long long x) {return __builtin_popcountll(x);}\\nvoid print() { cout << \\\"\\\\n\\\"; }\\ntemplate<class T, class... Args>\\nvoid print(const T &x, const Args &... args) {\\n cout << x << \\\" \\\";\\n print(args...);\\n}\\n///////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\ntemplate<typename T>\\nstruct BinaryIndexedTree {\\n int N;\\n vector<T> data;\\n\\n BinaryIndexedTree(){}\\n BinaryIndexedTree(int N) : N(N), data(N+1,0) {}\\n\\n // [0,k) (0-indexed) a[0] + … + a[k-1]\\n T sum(int k) {\\n T ret = 0;\\n for(; k > 0; k -= k & -k) ret += data[k];\\n return ret;\\n }\\n\\n // [l,r) (0-indexed) a[l] + … + a[r-1]\\n T sum(int l, int r) {\\n if (l >= r) return 0;\\n T vl = sum(l);\\n T vr = sum(r);\\n return vr - vl;\\n }\\n // (0-indexed) a[k] += x;\\n void add(int k, T x) {\\n for(++k; k <= N; k += k & -k) data[k] += x;\\n }\\n\\n // (0-indexed)\\n int lowerbound(T x) {\\n int k = 1;\\n int ret = 0;\\n while ((k<<1) <= N) k <<= 1;\\n while (k) {\\n if (ret + k <= N && data[ret+k] < x) {\\n x -= data[ret+k];\\n ret += k;\\n }\\n k >>= 1;\\n }\\n return ret;\\n }\\n\\n // (0-indexed)\\n int upperbound(T x) {return lowerbound(x+1);}\\n};\\n\\nint main() {\\n ios::sync_with_stdio(false); cin.tie(nullptr);\\n int N; cin >> N;\\n vector<int> p(N);\\n rep(i,N) {\\n cin >> p[i];\\n --p[i];\\n }\\n\\n int Q; cin >> Q;\\n vector<int> L(Q),R(Q);\\n rep(i,Q) {\\n cin >> L[i] >> R[i];\\n --L[i];\\n }\\n const int B = 500;\\n vector<int> idx(Q);\\n iota(all(idx),0);\\n sort(all(idx),[&](int i, int j){\\n if (L[i]/B==L[j]/B) return R[i] < R[j];\\n return L[i] < L[j]; \\n });\\n BinaryIndexedTree<int> BIT(N);\\n vector<ll> ans(Q);\\n int nl = 0, nr = 0;\\n ll val = 0;\\n rep(i,Q) {\\n int u = idx[i];\\n while (nl > L[u]) {\\n nl--;\\n val += BIT.sum(p[nl]);\\n BIT.add(p[nl],1);\\n }\\n while (nr < R[u]) {\\n val += BIT.sum(p[nr]+1,N);\\n BIT.add(p[nr],1);\\n nr++;\\n }\\n while (nl < L[u]) {\\n BIT.add(p[nl],-1);\\n val -= BIT.sum(p[nl]);\\n nl++;\\n }\\n while (nr > R[u]) {\\n nr--;\\n BIT.add(p[nr],-1);\\n val -= BIT.sum(p[nr]+1,N);\\n }\\n ans[u] = val;\\n }\\n\\n for (auto i : ans) cout << i << ln;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1390,\n \"memory_kb\": 7644,\n \"score_of_the_acc\": -0.5149,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2779_4571195\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#include <ext/pb_ds/assoc_container.hpp>\\n#include <ext/pb_ds/tree_policy.hpp>\\nusing namespace std;\\nusing namespace __gnu_pbds;\\nusing ll = long long;\\nusing u64 = uint_fast64_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';\\nconstexpr long long MOD = 1000000007;\\n//constexpr long long MOD = 998244353;\\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 popcount(int x) {return __builtin_popcount(x);}\\ninline int popcount(long long x) {return __builtin_popcountll(x);}\\nvoid print() { cout << \\\"\\\\n\\\"; }\\ntemplate<class T, class... Args>\\nvoid print(const T &x, const Args &... args) {\\n cout << x << \\\" \\\";\\n print(args...);\\n}\\n///////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\ntemplate<typename T>\\nstruct BinaryIndexedTree {\\n int N;\\n vector<T> data;\\n\\n BinaryIndexedTree(){}\\n BinaryIndexedTree(int N) : N(N), data(N+1,0) {}\\n\\n // [0,k) (0-indexed) a[0] + … + a[k-1]\\n T sum(int k) {\\n T ret = 0;\\n for(; k > 0; k -= k & -k) ret += data[k];\\n return ret;\\n }\\n\\n // [l,r) (0-indexed) a[l] + … + a[r-1]\\n T sum(int l, int r) {\\n if (l >= r) return 0;\\n T vl = sum(l);\\n T vr = sum(r);\\n return vr - vl;\\n }\\n // (0-indexed) a[k] += x;\\n void add(int k, T x) {\\n for(++k; k <= N; k += k & -k) data[k] += x;\\n }\\n\\n // (0-indexed)\\n int lowerbound(T x) {\\n int k = 1;\\n int ret = 0;\\n while ((k<<1) <= N) k <<= 1;\\n while (k) {\\n if (ret + k <= N && data[ret+k] < x) {\\n x -= data[ret+k];\\n ret += k;\\n }\\n k >>= 1;\\n }\\n return ret;\\n }\\n\\n // (0-indexed)\\n int upperbound(T x) {return lowerbound(x+1);}\\n};\\n\\nint main() {\\n ios::sync_with_stdio(false); cin.tie(nullptr);\\n int N; cin >> N;\\n vector<int> p(N);\\n rep(i,N) {\\n cin >> p[i];\\n --p[i];\\n }\\n\\n int Q; cin >> Q;\\n vector<int> L(Q),R(Q);\\n rep(i,Q) {\\n cin >> L[i] >> R[i];\\n --L[i];\\n }\\n const int B = 500;\\n vector<int> idx(Q);\\n iota(all(idx),0);\\n sort(all(idx),[&](int i, int j){\\n if (L[i]/B==L[j]/B) return R[i] < R[j];\\n return L[i] < L[j]; \\n });\\n BinaryIndexedTree<int> BIT(N);\\n vector<int> ans(Q);\\n int nl = 0, nr = 0;\\n ll val = 0;\\n rep(i,Q) {\\n int u = idx[i];\\n while (nl > L[u]) {\\n nl--;\\n val += BIT.sum(p[nl]);\\n BIT.add(p[nl],1);\\n }\\n while (nr < R[u]) {\\n val += BIT.sum(p[nr]+1,N);\\n BIT.add(p[nr],1);\\n nr++;\\n }\\n while (nl < L[u]) {\\n BIT.add(p[nl],-1);\\n val -= BIT.sum(p[nl]);\\n nl++;\\n }\\n while (nr > R[u]) {\\n nr--;\\n BIT.add(p[nr],-1);\\n val -= BIT.sum(p[nr]+1,N);\\n }\\n ans[u] = val;\\n }\\n\\n for (auto i : ans) cout << i << ln;\\n}\",\n \"accuracy\": 0.6176470588235294,\n \"time_ms\": 1260,\n \"memory_kb\": 6592,\n \"score_of_the_acc\": -0.4646,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2779_4472159\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\n#include <tuple>\\n#include <utility>\\nusing namespace std;\\nusing ll = long long int;\\n\\nconst int B = 500;\\n\\n// @category セグメント木 (Segment Tree)\\n// @title セグメント木 (Segment Tree)\\n// 抽象 SegmentTree (0-indexed・一点更新・区間取得)\\ntemplate <typename MonoidType>\\nstruct SegmentTree {\\n using Function = function< MonoidType(MonoidType, MonoidType) >;\\n\\n // node, identity element\\n int n;\\n vector<MonoidType> node;\\n MonoidType E0;\\n\\n // update / combine function\\n Function upd_f, cmb_f;\\n\\n void build(int m, vector<MonoidType> v = vector<MonoidType>()) {\\n if(v != vector<MonoidType>()) m = v.size();\\n n = 1; while(n < m) n *= 2;\\n\\n node = vector<MonoidType>(2*n-1, E0);\\n if(v != vector<MonoidType>()) {\\n for(int i=0; i<m; i++) {\\n node[n-1+i] = v[i];\\n }\\n for(int i=n-2; i>=0; i--) {\\n node[i] = cmb_f(node[2*i+1], node[2*i+2]);\\n }\\n }\\n }\\n\\n // initialize\\n SegmentTree() {}\\n SegmentTree(int n_, MonoidType E0_,\\n Function upd_f_, Function cmb_f_,\\n vector<MonoidType> v = vector<MonoidType>()) :\\n E0(E0_), upd_f(upd_f_), cmb_f(cmb_f_) {\\n build(n_, v);\\n }\\n\\n // update k-th element (applied value: x)\\n void update(int k, MonoidType x) {\\n k += n - 1;\\n node[k] = upd_f(node[k], x);\\n while(k > 0) {\\n k = (k - 1) / 2;\\n node[k] = cmb_f(node[2*k+1], node[2*k+2]);\\n }\\n }\\n\\n // range query for [a, b)\\n // 非再帰のアイデア: http://d.hatena.ne.jp/komiyam/20131202/1385992406\\n MonoidType query(int a, int b) {\\n MonoidType vl = E0, vr = E0;\\n for(int l=a+n, r=b+n; l<r; l>>=1, r>>=1) {\\n if(l & 1) vl = cmb_f(vl, node[(l++)-1]);\\n if(r & 1) vr = cmb_f(node[(--r)-1], vr);\\n }\\n return cmb_f(vl, vr);\\n }\\n};\\n\\nint main() {\\n int N; scanf(\\\"%d\\\", &N);\\n vector<int> P(N);\\n for(int i=0; i<N; i++) scanf(\\\"%d\\\", &P[i]), P[i]--;\\n\\n vector< vector< tuple<int, int, int> > > segs(B);\\n int Q; scanf(\\\"%d\\\", &Q);\\n for(int i=0; i<Q; i++) {\\n int l, r; scanf(\\\"%d%d\\\", &l, &r); l--;\\n int b = l / B;\\n segs[b].emplace_back(l, r, i);\\n }\\n\\n for(int i=0; i<B; i++) {\\n sort(segs[i].begin(), segs[i].end(), [](auto x, auto y) {\\n return get<1>(x) < get<1>(y);\\n });\\n }\\n\\n SegmentTree<int> seg(N, 0,\\n [](int a, int b) { return a + b; },\\n [](int a, int b) { return a + b; });\\n ll sum = 0, pl = 0, pr = 0;\\n auto add_l = [&]() {\\n sum += seg.query(0, P[--pl]);\\n seg.update(P[pl], +1);\\n };\\n auto add_r = [&]() {\\n sum += seg.query(P[pr] + 1, N);\\n seg.update(P[pr++], +1);\\n };\\n auto del_l = [&]() {\\n sum -= seg.query(0, P[pl]);\\n seg.update(P[pl++], -1);\\n };\\n auto del_r = [&]() {\\n sum += seg.query(P[--pr] + 1, N);\\n seg.update(P[pr], -1);\\n };\\n\\n vector<ll> ans(Q);\\n for(int i=0; i<B; i++) {\\n for(auto e : segs[i]) {\\n int l, r, k; tie(l, r, k) = e;\\n while(pl < l) del_l();\\n while(pl > l) add_l();\\n while(pr < r) add_r();\\n while(pr > r) del_r();\\n ans[k] = sum;\\n }\\n }\\n for(int i=0; i<Q; i++) printf(\\\"%lld\\\\n\\\", ans[i]);\\n return 0;\\n}\",\n \"accuracy\": 0.3235294117647059,\n \"time_ms\": 50,\n \"memory_kb\": 2780,\n \"score_of_the_acc\": -0.0074,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2779_2270773\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\nusing namespace std;\\ntypedef long long Int;\\n\\nconst int MAX_N = 100000;\\nconst int SQRT_N = 400;\\n\\nint N;\\nint A[MAX_N];\\nint P[MAX_N+1];\\nint E[MAX_N+1][SQRT_N+1], F[SQRT_N+1][MAX_N+1];\\nint G[MAX_N+1], H[MAX_N+1];\\nInt X[SQRT_N+1][SQRT_N+1];\\nint pre[SQRT_N], suf[SQRT_N];\\nint B_size, B_num;\\n\\n//Fenwick Tree\\nint bit_size;\\nint bit[MAX_N+1];\\n\\n//note that we maintain bit[1..n]\\ninline void init(int n){\\n bit_size = n;\\n memset(bit,0,sizeof(bit));\\n}\\n\\n//add x to the i-th element\\ninline void inc(int i){\\n while(i <= bit_size){\\n bit[i]++;\\n i += i & -i;\\n }\\n}\\n\\n//sum of [1..i]\\ninline int sum(int i){\\n int res = 0;\\n while(i > 0){\\n res += bit[i];\\n i -= i & -i;\\n }\\n return res;\\n}\\n\\n//sum of [l..r]\\ninline int partial_sum(int l, int r){ return sum(r) - sum(l-1); }\\n\\ninline void preprocess(void) {\\n //Set B_size and B_num\\n B_size = sqrt(N);\\n //B_size = 400;\\n B_num = (N + B_size-1) / B_size;\\n\\n //Step 1: make E and F\\n for(int k=0;k<B_num;k++) {\\n int l = k*B_size, r = min( (k+1)*B_size, N);\\n\\n memset(P,0,sizeof(P));\\n for(int i=l;i<r;i++) {\\n P[A[i]]++;\\n }\\n\\n for(int i=0;i<N-1;i++) {\\n P[i+1] += P[i];\\n }\\n\\n //fill E\\n int backward = 0;\\n for(int i=l-1;i>=0;i--){\\n backward += P[A[i]];\\n E[i][k] = backward;\\n }\\n\\n memset(P,0,sizeof(P));\\n for(int i=l;i<r;i++) {\\n P[A[i]]++;\\n }\\n\\n for(int i=0;i<N-1;i++) {\\n P[N-i-2] += P[N-i-1];\\n }\\n\\n //fill F\\n int forward = 0;\\n for(int i=r;i<N;i++){\\n forward += P[A[i]];\\n F[k][i] = forward;\\n }\\n }\\n\\n //Step2-1: make G\\n init(N);\\n int suf_inv = 0;\\n for(int i=N-1;i>=0;i--){\\n suf_inv += partial_sum(1,A[i]+1);\\n inc(A[i]+1);\\n G[i] = suf_inv;\\n\\n if(i%B_size == 0){\\n init(N);\\n suf_inv = 0;\\n }\\n }\\n\\n //Step2-2: make H\\n int pre_inv = 0;\\n for(int i=0;i<N;i++){\\n if(i%B_size == 0){\\n init(N);\\n pre_inv = 0;\\n }\\n pre_inv += partial_sum(A[i]+1, N);\\n inc(A[i]+1);\\n H[i] = pre_inv;\\n }\\n\\n //Step3: make X\\n for(int L=0;L<B_num;L++){\\n Int inv = 0;\\n for(int R=L;R<B_num;R++){\\n inv += G[R*B_size];\\n inv += E[L*B_size][R];\\n X[L][R+1] = inv;\\n }\\n }\\n\\n //Step4: update E and F\\n for(int k=0;k<B_num;k++){\\n for(int i=0;i<k*B_size;i++){\\n E[i][k] -= E[(i+B_size-1)/B_size*B_size][k];\\n }\\n for(int i=N-1;i>=k*B_size;i--){\\n F[k][i] -= F[k][(i+1)/B_size*B_size-1];\\n }\\n }\\n\\n for(int i=0;i<N;i++){\\n for(int k=0;k<B_num-1;k++){\\n E[i][k+1] += E[i][k];\\n F[k+1][i] += F[k][i];\\n }\\n }\\n}\\n\\ninline void answer_query(int l, int r){\\n l--;\\n int L = (l+B_size-1)/B_size, R = r/B_size;\\n int Ll = l, Lr = L*B_size, Rl = R*B_size, Rr = r;\\n\\n //l and r are in the same block\\n if(L>=R){\\n Int inv = 0;\\n\\n init(N);\\n for(int i=l;i<r;i++){\\n inv += partial_sum(A[i]+1, N);\\n inc(A[i]+1);\\n }\\n\\n printf(\\\"%lld\\\\n\\\", inv);\\n return;\\n }\\n\\n //l and r are in different blocks\\n Int inv = 0;\\n\\n //inversion in consecutive blcoks\\n inv += X[L][R];\\n\\n //inversion between prefix/suffix and consecutive blocks\\n inv += E[l][R-1] - (L==0?0:E[l][L-1]);\\n inv += F[R-1][r-1] - (L==0?0:F[L-1][r-1]);\\n\\n //inversion in prefix/suffix\\n if(Ll<Lr) inv += G[l];\\n if(Rl<Rr) inv += H[r-1];\\n\\n //inversion between prefix and suffix (using radix sort)\\n\\n int pn = Lr-Ll;\\n for(int i=Ll;i<Lr;i++) {\\n pre[i-Ll] = A[i];\\n }\\n sort(pre,pre+pn);\\n \\n int sn = Rr-Rl;\\n for(int i=Rl;i<Rr;i++) {\\n suf[i-Rl] = A[i];\\n }\\n sort(suf,suf+sn);\\n \\n int id_p = 0, id_s = 0;\\n while(id_p<pn) {\\n if(id_s == sn) {\\n id_p++;\\n inv += id_s;\\n } else {\\n if(pre[id_p] < suf[id_s]) {\\n\\tid_p++;\\n\\tinv += id_s;\\n } else {\\n\\tid_s++;\\n }\\n }\\n }\\n\\n printf(\\\"%lld\\\\n\\\", inv);\\n}\\n\\nint main(){\\n scanf(\\\"%d\\\",&N);\\n\\n for(int i=0;i<N;i++) {\\n scanf(\\\"%d\\\", A+i); A[i]--;\\n }\\n\\n preprocess();\\n\\n int Q;\\n scanf(\\\"%d\\\",&Q);\\n\\n while(Q--){\\n int l,r;\\n scanf(\\\"%d%d\\\",&l,&r);\\n\\n answer_query(l,r);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2240,\n \"memory_kb\": 286704,\n \"score_of_the_acc\": -1.3672,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2779_1847273\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define rep(i,n) for(int i=0;i<(int)n;i++)\\n#define all(c) (c).begin(),(c).end()\\n#define mp make_pair\\n#define pb push_back\\n#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)\\n#define dbg(x) cerr<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<(x)<<endl\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pi;\\nconst int inf = (int)1e9;\\nconst double INF = 1e12, EPS = 1e-9;\\n\\nll bit[131072];\\nll sum(int i){\\n\\tll res = 0;\\n\\tfor(; i; i -= i & -i) res += bit[i];\\n\\treturn res;\\n}\\nvoid add(int i, int x){\\n\\tfor(; i < 131072; i += i & -i) bit[i] += x;\\n}\\n\\nconst int B = 500;\\nint n, p[100000];\\nll ans[200000];\\n\\nint main(){\\n\\tcin.tie(0); cin.sync_with_stdio(0);\\n\\tcin >> n;\\n\\trep(i, n) cin >> p[i];\\n\\tint q; cin >> q;\\n\\t\\n\\tvector<pair<pi, pi>> v; //l/B, r, l\\n\\trep(i, q){\\n\\t\\tint l, r; cin >> l >> r; l--;\\n\\t\\tv.pb(mp(mp(l / B, r), mp(l, i)));\\n\\t}\\n\\tint cnt = 0;\\n\\tsort(all(v));\\n\\tint L = 0, R = 0; ll res = 0;\\n\\tfor(auto &i: v){\\n\\t\\tint r = i.first.second, l = i.second.first;\\n\\t\\twhile(R < r) { assert(L <= R); res += R - L - sum(p[R]); add(p[R++], 1); }\\n\\t\\twhile(L > l) { assert(L <= R); res += sum(p[--L]); add(p[L], 1); }\\n\\t\\twhile(L < l) { assert(L < R); res -= sum(p[L]) - 1; add(p[L++], -1); }\\n\\t\\twhile(R > r) { assert(L < R); res -= R - L; res += sum(p[--R]); add(p[R], -1); }\\n\\t\\tans[i.second.second] = res;\\n\\t}\\n\\trep(i, q) printf(\\\"%lld\\\\n\\\", ans[i]);\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1460,\n \"memory_kb\": 8972,\n \"score_of_the_acc\": -0.5435,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2779_1701393\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <map>\\n#include <utility>\\n#include <algorithm>\\nusing namespace std;\\n \\n#define B 317\\n \\ntypedef long long int LLI;\\n#define int long long int\\n \\ntypedef pair<string, int> Pair;\\ntypedef pair<int, int> Seg;\\ntypedef pair<Seg, pair<int,int> > Data;\\n \\nint size;\\nint T;\\nint n;\\nint m;\\nLLI cur;\\nLLI ans[200005];\\nLLI BIT2[100005];\\nvector<int> list_str;\\nvector<int> sorted_str;\\nint myrank[100010];\\nvector<Data> queries;\\n \\nbool cmp_query(const Data &d1, const Data &d2) {\\n int l1 = d1.first.first;\\n int r1 = d1.first.second;\\n int l2 = d2.first.first;\\n int r2 = d2.first.second;\\n \\n if (l1/B != l2/B) return l1/B < l2/B;\\n return r1 < r2;\\n}\\n \\nvoid update(LLI *BIT, int k, LLI x) {\\n k++;\\n while (k <= n) {\\n BIT[k] += x;\\n k += k&-k;\\n }\\n}\\n \\nLLI getsum(LLI *BIT, int k) {\\n k++;\\n LLI ret = 0;\\n while (k > 0) {\\n ret += BIT[k];\\n k -= k&-k;\\n }\\n return ret;\\n}\\n \\nvoid append_end(int x) {\\n int &ss = list_str[x];\\n int idx = myrank[ss];\\n cur += getsum(BIT2, n-1) - getsum(BIT2, idx); // (idx,n-1]\\n update(BIT2, idx, 1);\\n}\\nvoid append_front(int x) {\\n int &ss = list_str[x];\\n int idx = myrank[ss];\\n cur += getsum(BIT2, idx-1);\\n update(BIT2, idx, 1);\\n}\\nvoid remove_end(int x) {\\n int &ss = list_str[x];\\n int idx = myrank[ss];\\n cur -= getsum(BIT2, n-1) - getsum(BIT2, idx); // (idx,n-1]\\n update(BIT2, idx, -1);\\n}\\nvoid remove_front(int x) {\\n int &ss = list_str[x];\\n int idx = myrank[ss];\\n cur -= getsum(BIT2,idx-1);\\n update(BIT2, idx, -1);\\n}\\n \\nsigned main() {\\n ios_base::sync_with_stdio(false);\\n \\n //cin >> T;\\n while (1) {\\n cin >> n;\\n size = 1;\\n fill(BIT2, BIT2+n+1, 0ll);\\n \\n list_str.clear();\\n sorted_str.clear();\\n for (int i=0; i<n; i++) {\\n int s;\\n cin >> s;\\n list_str.push_back(s);\\n sorted_str.push_back(s);\\n }\\n sort(sorted_str.begin(), sorted_str.end());\\n for (int i=0; i<n; i++) {\\n myrank[sorted_str[i]] = i;\\n }\\n \\n queries.clear();\\n cin >> m;\\n for(int j = 0 ; j < m ; j++){\\n int l, r,k;\\n cin >> l >> r;\\n --l;\\n --r;\\n queries.push_back(Data(Seg(l, r), {j,j}));\\n }\\n \\n sort(queries.begin(), queries.end(), cmp_query);\\n cur = 0;\\n int a = 0;\\n int b = -1;\\n for (int i=0; i<queries.size(); i++) {\\n int l = queries[i].first.first;\\n int r = queries[i].first.second;\\n int idx = queries[i].second.second;\\n int k = queries[i].second.first;\\n while (b < r) append_end(++b);\\n while (l < a) append_front(--a);\\n while (a < l) remove_front(a++);\\n while (r < b) remove_end(b--);\\n ans[idx] = cur;\\n }\\n \\n for (int i=0; i<m; i++) {\\n cout << ans[i] << endl;\\n }\\n break;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1850,\n \"memory_kb\": 14412,\n \"score_of_the_acc\": -0.6989,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2779_1701391\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <map>\\n#include <utility>\\n#include <algorithm>\\nusing namespace std;\\n \\n#define B 317\\n \\ntypedef long long int LLI;\\n#define int long long int\\n \\ntypedef pair<string, int> Pair;\\ntypedef pair<int, int> Seg;\\ntypedef pair<Seg, pair<int,int> > Data;\\n \\nint size;\\nint T;\\nint n;\\nint m;\\nLLI cur;\\nLLI ans[100005];\\nLLI BIT2[100005];\\nvector<int> list_str;\\nvector<int> sorted_str;\\nint myrank[100010];\\nvector<Data> queries;\\n \\nbool cmp_query(const Data &d1, const Data &d2) {\\n int l1 = d1.first.first;\\n int r1 = d1.first.second;\\n int l2 = d2.first.first;\\n int r2 = d2.first.second;\\n \\n if (l1/B != l2/B) return l1/B < l2/B;\\n return r1 < r2;\\n}\\n \\nvoid update(LLI *BIT, int k, LLI x) {\\n k++;\\n while (k <= n) {\\n BIT[k] += x;\\n k += k&-k;\\n }\\n}\\n \\nLLI getsum(LLI *BIT, int k) {\\n k++;\\n LLI ret = 0;\\n while (k > 0) {\\n ret += BIT[k];\\n k -= k&-k;\\n }\\n return ret;\\n}\\n \\nvoid append_end(int x) {\\n int &ss = list_str[x];\\n int idx = myrank[ss];\\n cur += getsum(BIT2, n-1) - getsum(BIT2, idx); // (idx,n-1]\\n update(BIT2, idx, 1);\\n}\\nvoid append_front(int x) {\\n int &ss = list_str[x];\\n int idx = myrank[ss];\\n cur += getsum(BIT2, idx-1);\\n update(BIT2, idx, 1);\\n}\\nvoid remove_end(int x) {\\n int &ss = list_str[x];\\n int idx = myrank[ss];\\n cur -= getsum(BIT2, n-1) - getsum(BIT2, idx); // (idx,n-1]\\n update(BIT2, idx, -1);\\n}\\nvoid remove_front(int x) {\\n int &ss = list_str[x];\\n int idx = myrank[ss];\\n cur -= getsum(BIT2,idx-1);\\n update(BIT2, idx, -1);\\n}\\n \\nsigned main() {\\n ios_base::sync_with_stdio(false);\\n \\n //cin >> T;\\n while (1) {\\n cin >> n;\\n size = 1;\\n fill(BIT2, BIT2+n+1, 0ll);\\n \\n list_str.clear();\\n sorted_str.clear();\\n for (int i=0; i<n; i++) {\\n int s;\\n cin >> s;\\n list_str.push_back(s);\\n sorted_str.push_back(s);\\n }\\n sort(sorted_str.begin(), sorted_str.end());\\n for (int i=0; i<n; i++) {\\n myrank[sorted_str[i]] = i;\\n }\\n \\n queries.clear();\\n cin >> m;\\n for(int j = 0 ; j < m ; j++){\\n int l, r,k;\\n cin >> l >> r;\\n --l;\\n --r;\\n queries.push_back(Data(Seg(l, r), {j,j}));\\n }\\n \\n sort(queries.begin(), queries.end(), cmp_query);\\n cur = 0;\\n int a = 0;\\n int b = -1;\\n for (int i=0; i<queries.size(); i++) {\\n int l = queries[i].first.first;\\n int r = queries[i].first.second;\\n int idx = queries[i].second.second;\\n int k = queries[i].second.first;\\n while (b < r) append_end(++b);\\n while (l < a) append_front(--a);\\n while (a < l) remove_front(a++);\\n while (r < b) remove_end(b--);\\n ans[idx] = cur;\\n }\\n \\n for (int i=0; i<m; i++) {\\n cout << ans[i] << endl;\\n }\\n break;\\n }\\n}\",\n \"accuracy\": 0.6176470588235294,\n \"time_ms\": 60,\n \"memory_kb\": 14396,\n \"score_of_the_acc\": -0.0335,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2779_1697156\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef complex<double> P;\\ntypedef pair<int,int> pii;\\n#define REP(i,n) for(ll i=0;i<n;++i)\\n#define REPR(i,n) for(ll i=1;i<n;++i)\\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\\n\\n#define DEBUG(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define DEBUG_VEC(v) cout<<#v<<\\\":\\\";REP(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl\\n#define ALL(a) (a).begin(),(a).end()\\n\\n#define MOD (ll)(1e9+7)\\n#define ADD(a,b) a=((a)+(b))%MOD\\n#define FIX(a) ((a)%MOD+MOD)%MOD\\n\\n// http://hos.ac/slides/20140319_bit.pdf\\nstruct BIT{\\n int n;\\n vl dat;\\n BIT(){}\\n BIT(int n):n(n){dat.assign(n,0);}\\n BIT(int n, ll arr[]){\\n dat.assign(n,0);\\n REP(i,n-1){\\n dat[i]+=arr[i];\\n dat[i|(i+1)]+=dat[i];\\n }\\n }\\n BIT(BIT &past):n(past.n),dat(past.dat){}\\n // 0-indexed\\n void add(int pos, ll val){for(int x=pos;x<n;x|=x+1)dat[x]+=val;}\\n // [0...pos]\\n ll sum(int pos){\\n ll ret = 0;\\n for(int x=pos;x>=0;x=(x&(x+1))-1)ret+=dat[x];\\n return ret;\\n }\\n ll all(){\\n return sum(n-1);\\n }\\n // [pos...n-1]\\n ll revsum(int pos){\\n return all()-sum(pos-1);\\n }\\n};\\n\\n// http://japl.pl/contest/ijpc/1/reviews/training.html\\n\\nint n;\\nll p[100001];\\nint sqrtn;\\nll s[317][317];\\nBIT f[317];\\n\\nint main(){\\n scanf(\\\"%d\\\",&n);\\n REP(i,n)scanf(\\\"%d\\\",p+i);\\n // ???????????´\\n sqrtn = 1;\\n while(sqrtn*sqrtn<n)++sqrtn;\\n FOR(i,n,sqrtn*sqrtn)p[i]=n;\\n n = sqrtn*sqrtn;\\n // ?????±??????????????±?????? sum\\n REP(i,sqrtn){\\n BIT bit(n+1);\\n ll ans = 0;\\n FOR(j,i,sqrtn){\\n // update bit\\n REP(k,sqrtn){\\n ll val = p[j*sqrtn + k];\\n ans += bit.revsum(val+1);\\n bit.add(val,1);\\n }\\n s[i][j] = ans;\\n }\\n }\\n // ????????????\\n {\\n BIT bit(n+1);\\n REP(i,sqrtn){\\n REP(j,sqrtn)bit.add(p[i*sqrtn+j],1);\\n f[i] = BIT(bit);\\n }\\n }\\n // answer\\n int q;\\n scanf(\\\"%d\\\",&q);\\n BIT bit(n+1); // ??????n????´?????????£?¨????????????¨O(NQ)????????§????????????\\n while(q--){\\n ll ans = 0;\\n int l,r;\\n scanf(\\\"%d%d\\\",&l,&r);\\n --l; --r;\\n int u = l/sqrtn, v = r/sqrtn;\\n ++u; --v;\\n int leftright = u*sqrtn-1;\\n int rightleft = (v+1)*sqrtn;\\n if(u<=v){\\n // [u,v]????????±??????????????£??¨????????§??????\\n ans += s[u][v];\\n // ?????´??¨[u,v]?????±???\\n FOR(i,l,leftright+1){\\n ll val = p[i];\\n ans += f[v].sum(val-1);\\n ans -= f[u-1].sum(val-1);\\n }\\n // ?????´??¨[u,v]?????±???\\n FOR(i,rightleft,r+1){\\n ll val = p[i];\\n ans += f[v].revsum(val+1);\\n ans -= f[u-1].revsum(val+1);\\n }\\n }\\n // ??£???\\n if(leftright<rightleft){\\n // ?????¢\\n FOR(i,l,leftright+1){\\n ll val = p[i];\\n ans += bit.revsum(val+1);\\n bit.add(val,1);\\n }\\n FOR(i,rightleft,r+1){\\n ll val = p[i];\\n ans += bit.revsum(val+1);\\n bit.add(val,1);\\n }\\n // ???????????????\\n FOR(i,l,leftright+1){\\n bit.add(p[i],-1);\\n }\\n FOR(i,rightleft,r+1){\\n bit.add(p[i],-1);\\n }\\n }else{\\n // ????????????\\n int size = r-l+1;\\n assert(size <= 2*sqrtn);\\n FOR(i,l,r+1){\\n ll val = p[i];\\n ans += bit.revsum(val+1);\\n bit.add(val,1);\\n }\\n // ???????????????\\n FOR(i,l,r+1){\\n bit.add(p[i],-1);\\n }\\n }\\n printf(\\\"%d\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.6176470588235294,\n \"time_ms\": 30,\n \"memory_kb\": 4296,\n \"score_of_the_acc\": -0.0029,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2779_1695804\",\n \"code_snippet\": \"#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\nusing namespace std;\\n\\ninline int calcIndex(int i, int j) {\\n\\treturn j * (j + 1) / 2 + (j - i);\\n}\\n\\nint main() {\\n\\tconst int BlockSize = 400;\\n\\tconst int MaxN = 100000, MaxNumBlocks = (MaxN + BlockSize - 1) / BlockSize;\\n\\tstatic int counts[MaxNumBlocks + 1][MaxN + 1];\\n\\tstatic short counts2[BlockSize + 1][BlockSize + 1];\\n\\n\\tint N;\\n\\twhile(~scanf(\\\"%d\\\", &N)) {\\n\\t\\tint X = N;\\n\\t\\tvector<int> p(N);\\n\\t\\tfor(int i = 0; i < N; ++ i) {\\n\\t\\t\\tscanf(\\\"%d\\\", &p[i]), -- p[i];\\n\\t\\t}\\n\\t\\tint NumBlocks = (N + BlockSize - 1) / BlockSize;\\n\\t\\tmemset(counts, 0, sizeof counts);\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\\n\\t\\t\\tfor(int i = L; i < R; ++ i)\\n\\t\\t\\t\\t++ counts[bi + 1][p[i] + 1];\\n\\t\\t\\tfor(int x = 1; x <= X; ++ x)\\n\\t\\t\\t\\tcounts[bi + 1][x] += counts[bi][x] + counts[bi + 1][x - 1] - counts[bi][x - 1];\\n\\t\\t}\\n\\t\\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\\n\\t\\tvector<vector<int> > inner(NumBlocks);\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\\n\\t\\t\\tint M = R - L, Y = M;\\n\\n\\t\\t\\tvector<pair<int, int> > &sorted = sortedBlocks[bi];\\n\\t\\t\\tsorted.resize(M);\\n\\t\\t\\tfor(int i = L; i < R; ++ i)\\n\\t\\t\\t\\tsorted[i - L] = make_pair(p[i], i);\\n\\t\\t\\tsort(sorted.begin(), sorted.end());\\n\\t\\t\\t\\n\\t\\t\\tvector<int> rank(M);\\n\\t\\t\\tfor(int i = 0; i < M; ++ i)\\n\\t\\t\\t\\trank[sorted[i].second - L] = i;\\n\\n\\t\\t\\tmemset(counts2, 0, sizeof counts2);\\n\\n\\t\\t\\tfor(int i = 0; i < M; ++ i)\\n\\t\\t\\t\\t++ counts2[i + 1][rank[i] + 1];\\n\\t\\t\\tfor(int i = 0; i < M; ++ i) for(int y = 1; y <= Y; ++ y)\\n\\t\\t\\t\\tcounts2[i + 1][y] += counts2[i][y] + counts2[i + 1][y - 1] - counts2[i][y - 1];\\n\\n\\t\\t\\tvector<int> &v = inner[bi];\\n\\t\\t\\tv.resize((R - L) * (R - L + 1) / 2);\\n\\t\\t\\tint k = 0;\\n\\t\\t\\tfor(int j = 0; j < M; ++ j) {\\n\\t\\t\\t\\tint sum = 0;\\n\\t\\t\\t\\tfor(int i = j; i >= 0; -- i) {\\n\\t\\t\\t\\t\\tsum += counts2[j + 1][rank[i]] - counts2[i + 1][rank[i]];\\n\\t\\t\\t\\t\\tv[k ++] = sum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<long long> > outer(NumBlocks + 1, vector<long long>(N));\\n\\t\\tfor(int bi = 0; bi <= NumBlocks; ++ bi) {\\n\\t\\t\\tvector<long long> &v = outer[bi];\\n\\t\\t\\tlong long sum;\\n\\t\\t\\tsum = 0;\\n\\t\\t\\tfor(int bj = bi; bj < NumBlocks; ++ bj) {\\n\\t\\t\\t\\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\\n\\t\\t\\t\\tint num = (bj - bi) * BlockSize;\\n\\t\\t\\t\\tfor(int j = L; j < R; ++ j) {\\n\\t\\t\\t\\t\\tsum += num - (counts[bj][p[j] + 1] - counts[bi][p[j] + 1]);\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsum += inner[bj][calcIndex(0, R - L - 1)];\\n\\t\\t\\t}\\n\\t\\t\\tsum = 0;\\n\\t\\t\\tfor(int bj = bi - 1; bj >= 0; -- bj) {\\n\\t\\t\\t\\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\\n\\t\\t\\t\\tfor(int j = R - 1; j >= L; -- j) {\\n\\t\\t\\t\\t\\tsum += counts[bi][p[j]] - counts[bj + 1][p[j]];\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsum += inner[bj][calcIndex(0, R - L - 1)];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint Q;\\n\\t\\tscanf(\\\"%d\\\", &Q);\\n\\t\\tfor(int ii = 0; ii < Q; ++ ii) {\\n\\t\\t\\tint l; int r;\\n\\t\\t\\tscanf(\\\"%d%d\\\", &l, &r), -- l;\\n\\t\\t\\tint bl = (l + BlockSize - 1) / BlockSize, br = r / BlockSize;\\n\\t\\t\\tlong long ans = 0;\\n\\t\\t\\tif(l / BlockSize == (r - 1) / BlockSize) {\\n\\t\\t\\t\\tans = inner[l / BlockSize][calcIndex(l % BlockSize, (r - 1) % BlockSize)];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tint L = bl * BlockSize, R = br * BlockSize;\\n\\t\\t\\t\\tans += outer[bl][r - 1];\\n\\t\\t\\t\\tans += inner[(r - 1) / BlockSize][calcIndex(0, (r - 1) % BlockSize)];\\n\\t\\t\\t\\tif(l < R) {\\n\\t\\t\\t\\t\\tans += outer[br][l];\\n\\t\\t\\t\\t\\tans += inner[l / BlockSize][calcIndex(l % BlockSize, min(BlockSize, N - l / BlockSize * BlockSize) - 1)];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(bl < br) {\\n\\t\\t\\t\\t\\tans -= outer[bl][R - 1];\\n\\t\\t\\t\\t\\tans -= inner[(R - 1) / BlockSize][calcIndex(0, BlockSize - 1)];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(l < L && R < r) {\\n\\t\\t\\t\\t\\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\\n\\t\\t\\t\\t\\tint nv = (int)v.size(), nw = (int)w.size();\\n\\t\\t\\t\\t\\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\\n\\t\\t\\t\\t\\t\\tfor(; j < nw && w[j].first < v[i].first; ++ j)\\n\\t\\t\\t\\t\\t\\t\\tcnt += w[j].second < r;\\n\\t\\t\\t\\t\\t\\tif(l <= v[i].second)\\n\\t\\t\\t\\t\\t\\t\\tans += cnt;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\", ans);\\n\\t\\t\\t//fflush(stdout);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1350,\n \"memory_kb\": 377236,\n \"score_of_the_acc\": -1.2104,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2779_1695803\",\n \"code_snippet\": \"#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\nusing namespace std;\\n\\ninline int calcIndex(int i, int j) {\\n\\treturn j * (j + 1) / 2 + (j - i);\\n}\\n\\nint main() {\\n\\tconst int BlockSize = 250;\\n\\tconst int MaxN = 100000, MaxNumBlocks = (MaxN + BlockSize - 1) / BlockSize;\\n\\tstatic int counts[MaxNumBlocks + 1][MaxN + 1];\\n\\tstatic short counts2[BlockSize + 1][BlockSize + 1];\\n\\n\\tint N;\\n\\twhile(~scanf(\\\"%d\\\", &N)) {\\n\\t\\tint X = N;\\n\\t\\tvector<int> p(N);\\n\\t\\tfor(int i = 0; i < N; ++ i) {\\n\\t\\t\\tscanf(\\\"%d\\\", &p[i]), -- p[i];\\n\\t\\t}\\n\\t\\tint NumBlocks = (N + BlockSize - 1) / BlockSize;\\n\\t\\tmemset(counts, 0, sizeof counts);\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\\n\\t\\t\\tfor(int i = L; i < R; ++ i)\\n\\t\\t\\t\\t++ counts[bi + 1][p[i] + 1];\\n\\t\\t\\tfor(int x = 1; x <= X; ++ x)\\n\\t\\t\\t\\tcounts[bi + 1][x] += counts[bi][x] + counts[bi + 1][x - 1] - counts[bi][x - 1];\\n\\t\\t}\\n\\t\\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\\n\\t\\tvector<vector<int> > inner(NumBlocks);\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\\n\\t\\t\\tint M = R - L, Y = M;\\n\\n\\t\\t\\tvector<pair<int, int> > &sorted = sortedBlocks[bi];\\n\\t\\t\\tsorted.resize(M);\\n\\t\\t\\tfor(int i = L; i < R; ++ i)\\n\\t\\t\\t\\tsorted[i - L] = make_pair(p[i], i);\\n\\t\\t\\tsort(sorted.begin(), sorted.end());\\n\\t\\t\\t\\n\\t\\t\\tvector<int> rank(M);\\n\\t\\t\\tfor(int i = 0; i < M; ++ i)\\n\\t\\t\\t\\trank[sorted[i].second - L] = i;\\n\\n\\t\\t\\tmemset(counts2, 0, sizeof counts2);\\n\\n\\t\\t\\tfor(int i = 0; i < M; ++ i)\\n\\t\\t\\t\\t++ counts2[i + 1][rank[i] + 1];\\n\\t\\t\\tfor(int i = 0; i < M; ++ i) for(int y = 1; y <= Y; ++ y)\\n\\t\\t\\t\\tcounts2[i + 1][y] += counts2[i][y] + counts2[i + 1][y - 1] - counts2[i][y - 1];\\n\\n\\t\\t\\tvector<int> &v = inner[bi];\\n\\t\\t\\tv.resize((R - L) * (R - L + 1) / 2);\\n\\t\\t\\tint k = 0;\\n\\t\\t\\tfor(int j = 0; j < M; ++ j) {\\n\\t\\t\\t\\tint sum = 0;\\n\\t\\t\\t\\tfor(int i = j; i >= 0; -- i) {\\n\\t\\t\\t\\t\\tsum += counts2[j + 1][rank[i]] - counts2[i + 1][rank[i]];\\n\\t\\t\\t\\t\\tv[k ++] = sum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<long long> > outer(NumBlocks + 1, vector<long long>(N));\\n\\t\\tfor(int bi = 0; bi <= NumBlocks; ++ bi) {\\n\\t\\t\\tvector<long long> &v = outer[bi];\\n\\t\\t\\tlong long sum;\\n\\t\\t\\tsum = 0;\\n\\t\\t\\tfor(int bj = bi; bj < NumBlocks; ++ bj) {\\n\\t\\t\\t\\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\\n\\t\\t\\t\\tint num = (bj - bi) * BlockSize;\\n\\t\\t\\t\\tfor(int j = L; j < R; ++ j) {\\n\\t\\t\\t\\t\\tsum += num - (counts[bj][p[j] + 1] - counts[bi][p[j] + 1]);\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsum += inner[bj][calcIndex(0, R - L - 1)];\\n\\t\\t\\t}\\n\\t\\t\\tsum = 0;\\n\\t\\t\\tfor(int bj = bi - 1; bj >= 0; -- bj) {\\n\\t\\t\\t\\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\\n\\t\\t\\t\\tfor(int j = R - 1; j >= L; -- j) {\\n\\t\\t\\t\\t\\tsum += counts[bi][p[j]] - counts[bj + 1][p[j]];\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsum += inner[bj][calcIndex(0, R - L - 1)];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint Q;\\n\\t\\tscanf(\\\"%d\\\", &Q);\\n\\t\\tfor(int ii = 0; ii < Q; ++ ii) {\\n\\t\\t\\tint l; int r;\\n\\t\\t\\tscanf(\\\"%d%d\\\", &l, &r), -- l;\\n\\t\\t\\tint bl = (l + BlockSize - 1) / BlockSize, br = r / BlockSize;\\n\\t\\t\\tlong long ans = 0;\\n\\t\\t\\tif(l / BlockSize == (r - 1) / BlockSize) {\\n\\t\\t\\t\\tans = inner[l / BlockSize][calcIndex(l % BlockSize, (r - 1) % BlockSize)];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tint L = bl * BlockSize, R = br * BlockSize;\\n\\t\\t\\t\\tans += outer[bl][r - 1];\\n\\t\\t\\t\\tans += inner[(r - 1) / BlockSize][calcIndex(0, (r - 1) % BlockSize)];\\n\\t\\t\\t\\tif(l < R) {\\n\\t\\t\\t\\t\\tans += outer[br][l];\\n\\t\\t\\t\\t\\tans += inner[l / BlockSize][calcIndex(l % BlockSize, min(BlockSize, N - l / BlockSize * BlockSize) - 1)];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(bl < br) {\\n\\t\\t\\t\\t\\tans -= outer[bl][R - 1];\\n\\t\\t\\t\\t\\tans -= inner[(R - 1) / BlockSize][calcIndex(0, BlockSize - 1)];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(l < L && R < r) {\\n\\t\\t\\t\\t\\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\\n\\t\\t\\t\\t\\tint nv = (int)v.size(), nw = (int)w.size();\\n\\t\\t\\t\\t\\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\\n\\t\\t\\t\\t\\t\\tfor(; j < nw && w[j].first < v[i].first; ++ j)\\n\\t\\t\\t\\t\\t\\t\\tcnt += w[j].second < r;\\n\\t\\t\\t\\t\\t\\tif(l <= v[i].second)\\n\\t\\t\\t\\t\\t\\t\\tans += cnt;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\", ans);\\n\\t\\t\\t//fflush(stdout);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1270,\n \"memory_kb\": 523108,\n \"score_of_the_acc\": -1.461,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2779_1695799\",\n \"code_snippet\": \"#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\nusing namespace std;\\n\\ninline int calcIndex(int i, int j) {\\n\\treturn j * (j + 1) / 2 + (j - i);\\n}\\n\\nint main() {\\n\\tconst int BlockSize = 300;\\n\\tconst int MaxN = 100000, MaxNumBlocks = (MaxN + BlockSize - 1) / BlockSize;\\n\\tstatic int counts[MaxNumBlocks + 1][MaxN + 1];\\n\\tstatic short counts2[BlockSize + 1][BlockSize + 1];\\n\\n\\tint N;\\n\\twhile(~scanf(\\\"%d\\\", &N)) {\\n\\t\\tint X = N;\\n\\t\\tvector<int> p(N);\\n\\t\\tfor(int i = 0; i < N; ++ i) {\\n\\t\\t\\tscanf(\\\"%d\\\", &p[i]), -- p[i];\\n\\t\\t}\\n\\t\\tint NumBlocks = (N + BlockSize - 1) / BlockSize;\\n\\t\\tmemset(counts, 0, sizeof counts);\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\\n\\t\\t\\tfor(int i = L; i < R; ++ i)\\n\\t\\t\\t\\t++ counts[bi + 1][p[i] + 1];\\n\\t\\t\\tfor(int x = 1; x <= X; ++ x)\\n\\t\\t\\t\\tcounts[bi + 1][x] += counts[bi][x] + counts[bi + 1][x - 1] - counts[bi][x - 1];\\n\\t\\t}\\n\\t\\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\\n\\t\\tvector<vector<int> > inner(NumBlocks);\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\\n\\t\\t\\tint M = R - L, Y = M;\\n\\n\\t\\t\\tvector<pair<int, int> > &sorted = sortedBlocks[bi];\\n\\t\\t\\tsorted.resize(M);\\n\\t\\t\\tfor(int i = L; i < R; ++ i)\\n\\t\\t\\t\\tsorted[i - L] = make_pair(p[i], i);\\n\\t\\t\\tsort(sorted.begin(), sorted.end());\\n\\t\\t\\t\\n\\t\\t\\tvector<int> rank(M);\\n\\t\\t\\tfor(int i = 0; i < M; ++ i)\\n\\t\\t\\t\\trank[sorted[i].second - L] = i;\\n\\n\\t\\t\\tmemset(counts2, 0, sizeof counts2);\\n\\n\\t\\t\\tfor(int i = 0; i < M; ++ i)\\n\\t\\t\\t\\t++ counts2[i + 1][rank[i] + 1];\\n\\t\\t\\tfor(int i = 0; i < M; ++ i) for(int y = 1; y <= Y; ++ y)\\n\\t\\t\\t\\tcounts2[i + 1][y] += counts2[i][y] + counts2[i + 1][y - 1] - counts2[i][y - 1];\\n\\n\\t\\t\\tvector<int> &v = inner[bi];\\n\\t\\t\\tv.resize((R - L) * (R - L + 1) / 2);\\n\\t\\t\\tint k = 0;\\n\\t\\t\\tfor(int j = 0; j < M; ++ j) {\\n\\t\\t\\t\\tint sum = 0;\\n\\t\\t\\t\\tfor(int i = j; i >= 0; -- i) {\\n\\t\\t\\t\\t\\tsum += counts2[j + 1][rank[i]] - counts2[i + 1][rank[i]];\\n\\t\\t\\t\\t\\tv[k ++] = sum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<long long> > outer(NumBlocks + 1, vector<long long>(N));\\n\\t\\tfor(int bi = 0; bi <= NumBlocks; ++ bi) {\\n\\t\\t\\tvector<long long> &v = outer[bi];\\n\\t\\t\\tlong long sum;\\n\\t\\t\\tsum = 0;\\n\\t\\t\\tfor(int bj = bi; bj < NumBlocks; ++ bj) {\\n\\t\\t\\t\\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\\n\\t\\t\\t\\tint num = (bj - bi) * BlockSize;\\n\\t\\t\\t\\tfor(int j = L; j < R; ++ j) {\\n\\t\\t\\t\\t\\tsum += num - (counts[bj][p[j] + 1] - counts[bi][p[j] + 1]);\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsum += inner[bj][calcIndex(0, R - L - 1)];\\n\\t\\t\\t}\\n\\t\\t\\tsum = 0;\\n\\t\\t\\tfor(int bj = bi - 1; bj >= 0; -- bj) {\\n\\t\\t\\t\\tint L = bj * BlockSize, R = min((bj + 1) * BlockSize, N);\\n\\t\\t\\t\\tfor(int j = R - 1; j >= L; -- j) {\\n\\t\\t\\t\\t\\tsum += counts[bi][p[j]] - counts[bj + 1][p[j]];\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsum += inner[bj][calcIndex(0, R - L - 1)];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint Q;\\n\\t\\tscanf(\\\"%d\\\", &Q);\\n\\t\\tfor(int ii = 0; ii < Q; ++ ii) {\\n\\t\\t\\tint l; int r;\\n\\t\\t\\tscanf(\\\"%d%d\\\", &l, &r), -- l;\\n\\t\\t\\tint bl = (l + BlockSize - 1) / BlockSize, br = r / BlockSize;\\n\\t\\t\\tlong long ans = 0;\\n\\t\\t\\tif(l / BlockSize == (r - 1) / BlockSize) {\\n\\t\\t\\t\\tans = inner[l / BlockSize][calcIndex(l % BlockSize, (r - 1) % BlockSize)];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tint L = bl * BlockSize, R = br * BlockSize;\\n\\t\\t\\t\\tans += outer[bl][r - 1];\\n\\t\\t\\t\\tans += inner[(r - 1) / BlockSize][calcIndex(0, (r - 1) % BlockSize)];\\n\\t\\t\\t\\tif(l < R) {\\n\\t\\t\\t\\t\\tans += outer[br][l];\\n\\t\\t\\t\\t\\tans += inner[l / BlockSize][calcIndex(l % BlockSize, min(BlockSize, N - l / BlockSize * BlockSize) - 1)];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(bl < br) {\\n\\t\\t\\t\\t\\tans -= outer[bl][R - 1];\\n\\t\\t\\t\\t\\tans -= inner[(R - 1) / BlockSize][calcIndex(0, BlockSize - 1)];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(l < L && R < r) {\\n\\t\\t\\t\\t\\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\\n\\t\\t\\t\\t\\tint nv = (int)v.size(), nw = (int)w.size();\\n\\t\\t\\t\\t\\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\\n\\t\\t\\t\\t\\t\\tfor(; j < nw && w[j].first < v[i].first; ++ j)\\n\\t\\t\\t\\t\\t\\t\\tcnt += w[j].second < r;\\n\\t\\t\\t\\t\\t\\tif(l <= v[i].second)\\n\\t\\t\\t\\t\\t\\t\\tans += cnt;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\", ans);\\n\\t\\t\\t//fflush(stdout);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1260,\n \"memory_kb\": 456736,\n \"score_of_the_acc\": -1.3297,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2779_1695542\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <vector>\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define pb push_back\\n#define sz(x) (int)(x).size()\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef vector<int> vi;\\n\\nconst int D = 300, E = 351, MX = 100005;\\n// Binary Indexed Tree\\nstruct bit {\\n vector<int> d; int n, hi;\\n vi hist;\\n bit() {}\\n bit(int mx): n(mx), d(mx), hist(MX), hi(0) {}\\n void add(int i, int x=1) {\\n for (++i;i<n;i+=i&-i) {\\n d[i] += x;\\n }\\n }\\n void add2(int i, int x=1) {\\n for (++i;i<n;i+=i&-i) {\\n hist[hi++] = i;\\n d[i] += x;\\n }\\n }\\n int sum(int i) {\\n int x = 0;\\n for (++i;i;i-=i&-i) x += d[i];\\n return x;\\n }\\n void rev() {\\n d = vi(n);\\n }\\n void rev2() {\\n while (hi--) d[hist[hi]] = 0;\\n hi = 0;\\n }\\n};\\n//\\nint n, a[MX];\\nvector<ll> dl[E], dr[E];\\nint main() {\\n // preprocess\\n scanf(\\\"%d\\\",&n);\\n rep(i,n) scanf(\\\"%d\\\",&a[i]), a[i] = n-a[i];\\n bit t(n+2);\\n for (int i = 0; i <= n; i += D) {\\n int di = i/D;\\n ll sum = 0;\\n for (int j = i; j < n; ++j) {\\n sum += t.sum(a[j]);\\n dl[di].pb(sum);\\n t.add(a[j]);\\n }\\n t.rev();\\n sum = 0;\\n for (int j = i-1; j >= 0; --j) {\\n sum += t.sum(n-a[j]);\\n dr[di].pb(sum);\\n t.add(n-a[j]);\\n }\\n t.rev();\\n }\\n // online query\\n int q;\\n scanf(\\\"%d\\\",&q);\\n rep(qi,q) {\\n int l, r;\\n scanf(\\\"%d%d\\\",&l,&r);\\n --l;\\n ll ans = 0;\\n if (r-l <= D) {\\n for (int i = l; i < r; ++i) {\\n ans += t.sum(a[i]);\\n t.add2(a[i]);\\n }\\n t.rev2();\\n } else {\\n int li = l/D+1, ri = r/D;\\n ans += dl[li][r-1-li*D];\\n ans += dr[ri][ri*D-1-l];\\n ans -= dl[li][ri*D-1-li*D];\\n vi p;\\n for (int i = li*D-1; i >= l; --i) p.pb(a[i]<<1);\\n for (int i = ri*D; i < r; ++i) p.pb(a[i]<<1|1);\\n sort(p.begin(), p.end());\\n int s = 0;\\n rep(i,sz(p)) {\\n if (p[i]&1) ans += s;\\n else s++;\\n }\\n }\\n printf(\\\"%lld\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3235294117647059,\n \"time_ms\": 40,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.0049,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2779_1695539\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <vector>\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define pb push_back\\n#define sz(x) (int)(x).size()\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef vector<int> vi;\\n\\nconst int D = 300, E = 351, MX = 100005;\\n// Binary Indexed Tree\\nstruct bit {\\n vector<int> d; int n, hi;\\n vi hist;\\n bit() {}\\n bit(int mx): n(mx), d(mx), hist(MX), hi(0) {}\\n void add(int i, int x=1) {\\n for (++i;i<n;i+=i&-i) {\\n d[i] += x;\\n }\\n }\\n void add2(int i, int x=1) {\\n for (++i;i<n;i+=i&-i) {\\n hist[hi++] = i;\\n d[i] += x;\\n }\\n }\\n int sum(int i) {\\n int x = 0;\\n for (++i;i;i-=i&-i) x += d[i];\\n return x;\\n }\\n void rev() {\\n d = vi(n);\\n }\\n void rev2() {\\n while (hi--) d[hist[hi]] = 0;\\n hi = 0;\\n }\\n};\\n//\\nint n, a[MX];\\nvector<ll> dl[E], dr[E];\\nint main() {\\n // preprocess\\n scanf(\\\"%d\\\",&n);\\n rep(i,n) scanf(\\\"%d\\\",&a[i]), a[i] = n-a[i];\\n bit t(n+2);\\n for (int i = 0; i <= n; i += D) {\\n int di = i/D;\\n ll sum = 0;\\n for (int j = i; j < n; ++j) {\\n sum += t.sum(a[j]);\\n dl[di].pb(sum);\\n t.add(a[j]);\\n }\\n t.rev();\\n sum = 0;\\n for (int j = i-1; j >= 0; --j) {\\n sum += t.sum(n-a[j]);\\n dr[di].pb(sum);\\n t.add(n-a[j]);\\n }\\n t.rev();\\n }\\n // online query\\n int q;\\n scanf(\\\"%d\\\",&q);\\n rep(qi,q) {\\n int l, r;\\n scanf(\\\"%d%d\\\",&l,&r);\\n --l;\\n ll ans = 0;\\n if (r-l <= D) {\\n for (int i = l; i < r; ++i) {\\n ans += t.sum(a[i]);\\n t.add2(a[i]);\\n }\\n t.rev2();\\n } else {\\n int li = l/D+1, ri = r/D;\\n ans += dl[li][r-1-li*D];\\n ans += dr[ri][ri*D-l];\\n ans -= dl[li][ri*D-1-li*D];\\n vi p;\\n for (int i = li*D-1; i >= l; --i) p.pb(a[i]<<1);\\n for (int i = ri*D; i < r; ++i) p.pb(a[i]<<1|1);\\n sort(p.begin(), p.end());\\n int s = 0;\\n rep(i,sz(p)) {\\n if (p[i]&1) ans += s;\\n else s++;\\n }\\n }\\n printf(\\\"%lld\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3235294117647059,\n \"time_ms\": 40,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.0049,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2779_1695533\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <vector>\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define pb push_back\\n#define sz(x) (int)(x).size()\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef vector<int> vi;\\n\\nconst int D = 300, E = 351, MX = 100005;\\n// Binary Indexed Tree\\nstruct bit {\\n vector<int> d; int n, hi;\\n vi hist;\\n bit() {}\\n bit(int mx): n(mx), d(mx), hist(MX), hi(0) {}\\n void add(int i, int x=1) {\\n for (++i;i<n;i+=i&-i) {\\n d[i] += x;\\n }\\n }\\n void add2(int i, int x=1) {\\n for (++i;i<n;i+=i&-i) {\\n hist[hi++] = i;\\n d[i] += x;\\n }\\n }\\n int sum(int i) {\\n int x = 0;\\n for (++i;i;i-=i&-i) x += d[i];\\n return x;\\n }\\n void rev() {\\n d = vi(n);\\n }\\n void rev2() {\\n while (hi--) d[hist[hi]] = 0;\\n hi = 0;\\n }\\n};\\n//\\nint n, a[MX];\\nll dl[E][MX], dr[E][MX];\\nint main() {\\n // preprocess\\n scanf(\\\"%d\\\",&n);\\n rep(i,n) scanf(\\\"%d\\\",&a[i]), a[i] = n-a[i];\\n bit t(n+2);\\n for (int i = 0; i <= n; i += D) {\\n int di = i/D;\\n ll sum = 0;\\n for (int j = i; j < n; ++j) {\\n sum += t.sum(a[j]);\\n dl[di][j] = sum;\\n t.add(a[j]);\\n }\\n t.rev();\\n sum = 0;\\n for (int j = i-1; j >= 0; --j) {\\n sum += t.sum(n-a[j]);\\n dr[di][j] = sum;\\n t.add(n-a[j]);\\n }\\n t.rev();\\n }\\n // online query\\n int q;\\n scanf(\\\"%d\\\",&q);\\n rep(qi,q) {\\n int l, r;\\n scanf(\\\"%d%d\\\",&l,&r);\\n --l;\\n ll ans = 0;\\n if (r-l <= D) {\\n for (int i = l; i < r; ++i) {\\n ans += t.sum(a[i]);\\n t.add2(a[i]);\\n }\\n t.rev2();\\n } else {\\n int li = l/D+1, ri = r/D;\\n ans += dl[li][r-1];\\n ans += dr[ri][l];\\n ans -= dl[li][ri*D-1];\\n vi p;\\n for (int i = li*D-1; i >= l; --i) p.pb(a[i]<<1);\\n for (int i = ri*D; i < r; ++i) p.pb(a[i]<<1|1);\\n sort(p.begin(), p.end());\\n int s = 0;\\n rep(i,sz(p)) {\\n if (p[i]&1) ans += s;\\n else s++;\\n }\\n }\\n printf(\\\"%lld\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2720,\n \"memory_kb\": 267636,\n \"score_of_the_acc\": -1.509,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2779_1695527\",\n \"code_snippet\": \"#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <cstdio>\\nusing namespace std;\\n\\nstruct FenwickTree {\\n\\ttypedef int T;\\n\\tvector<T> v;\\n\\tvoid init(int n) { v.assign(n, 0); }\\n\\tvoid add(int i, T x) {\\n\\t\\tfor(; i < (int)v.size(); i |= i + 1) v[i] += x;\\n\\t}\\n\\tT sum(int i) const {\\t//[0, i)\\n\\t\\tT r = 0;\\n\\t\\tfor(-- i; i >= 0; i = (i & (i + 1)) - 1) r += v[i];\\n\\t\\treturn r;\\n\\t}\\n\\tT sum(int left, int right) const {\\t//[left, right)\\n\\t\\treturn sum(right) - sum(left);\\n\\t}\\n};\\n\\nint main() {\\n\\tint N;\\n\\twhile(~scanf(\\\"%d\\\", &N)) {\\n\\t\\tvector<int> p(N);\\n\\t\\tfor(int i = 0; i < N; ++ i) {\\n\\t\\t\\tscanf(\\\"%d\\\", &p[i]), -- p[i];\\n\\t\\t}\\n\\t\\tint BlockSize = 500;\\n\\t\\tint NumBlocks = N / BlockSize + 1;\\n\\t\\tvector<vector<long long> > memo(NumBlocks, vector<long long>(N));\\n\\t\\tFenwickTree ft;\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tvector<long long> &v = memo[bi];\\n\\t\\t\\tint i = bi * BlockSize;\\n\\t\\t\\t{\\n\\t\\t\\t\\tft.init(N);\\n\\t\\t\\t\\tlong long sum = 0;\\n\\t\\t\\t\\tfor(int j = i; j < N; ++ j) {\\n\\t\\t\\t\\t\\tsum += (j - i) - ft.sum(p[j]);\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t\\tft.add(p[j], 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tft.init(N);\\n\\t\\t\\t\\tlong long sum = 0;\\n\\t\\t\\t\\tfor(int j = i - 1; j >= 0; -- j) {\\n\\t\\t\\t\\t\\tsum += ft.sum(p[j]);\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t\\tft.add(p[j], 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\\n\\t\\tvector<int> rankInBlock(N, -1);\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\\n\\t\\t\\tvector<pair<int, int> > &v = sortedBlocks[bi];\\n\\t\\t\\tv.resize(R - L);\\n\\t\\t\\tfor(int i = L; i < R; ++ i)\\n\\t\\t\\t\\tv[i - L] = make_pair(p[i], i);\\n\\t\\t\\tsort(v.begin(), v.end());\\n\\t\\t\\tfor(int i = 0; i < R - L; ++ i)\\n\\t\\t\\t\\trankInBlock[v[i].second] = i;\\n\\t\\t}\\n\\t\\tint Q;\\n\\t\\tscanf(\\\"%d\\\", &Q);\\n\\t\\tfor(int ii = 0; ii < Q; ++ ii) {\\n\\t\\t\\tint l; int r;\\n\\t\\t\\tscanf(\\\"%d%d\\\", &l, &r), -- l, -- r;\\n\\t\\t\\tint bl = (l + BlockSize - 1) / BlockSize, br = (r + 1) / BlockSize;\\n\\t\\t\\tlong long ans = 0;\\n\\t\\t\\tif(bl > br) {\\n\\t\\t\\t\\tft.init(BlockSize);\\n\\t\\t\\t\\tfor(int i = r; i >= l; -- i) {\\n\\t\\t\\t\\t\\tans += ft.sum(rankInBlock[i]);\\n\\t\\t\\t\\t\\tft.add(rankInBlock[i], 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tint L = bl * BlockSize, R = br * BlockSize;\\n\\t\\t\\t\\tans += memo[bl][r];\\n\\t\\t\\t\\tans += memo[br][l];\\n\\t\\t\\t\\tif(bl < br)\\n\\t\\t\\t\\t\\tans -= memo[bl][R - 1];\\n\\t\\t\\t\\tif(l < L && R <= r) {\\n\\t\\t\\t\\t\\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\\n\\t\\t\\t\\t\\tint nv = (int)v.size(), nw = (int)w.size();\\n\\t\\t\\t\\t\\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\\n\\t\\t\\t\\t\\t\\tfor(; j < nw && w[j].first < v[i].first; ++ j)\\n\\t\\t\\t\\t\\t\\t\\tcnt += w[j].second <= r;\\n\\t\\t\\t\\t\\t\\tif(l <= v[i].second)\\n\\t\\t\\t\\t\\t\\t\\tans += cnt;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\", ans);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1670,\n \"memory_kb\": 160564,\n \"score_of_the_acc\": -0.9129,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2779_1695525\",\n \"code_snippet\": \"#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <cstdio>\\nusing namespace std;\\n\\nstruct FenwickTree {\\n\\ttypedef int T;\\n\\tvector<T> v;\\n\\tvoid init(int n) { v.assign(n, 0); }\\n\\tvoid add(int i, T x) {\\n\\t\\tfor(; i < (int)v.size(); i |= i + 1) v[i] += x;\\n\\t}\\n\\tT sum(int i) const {\\t//[0, i)\\n\\t\\tT r = 0;\\n\\t\\tfor(-- i; i >= 0; i = (i & (i + 1)) - 1) r += v[i];\\n\\t\\treturn r;\\n\\t}\\n\\tT sum(int left, int right) const {\\t//[left, right)\\n\\t\\treturn sum(right) - sum(left);\\n\\t}\\n};\\n\\nint main() {\\n\\tint N;\\n\\twhile(~scanf(\\\"%d\\\", &N)) {\\n\\t\\tvector<int> p(N);\\n\\t\\tfor(int i = 0; i < N; ++ i) {\\n\\t\\t\\tscanf(\\\"%d\\\", &p[i]), -- p[i];\\n\\t\\t}\\n\\t\\tint BlockSize = 500;\\n\\t\\tint NumBlocks = N / BlockSize + 1;\\n\\t\\tvector<vector<long long> > memo(NumBlocks, vector<long long>(N));\\n\\t\\tFenwickTree ft;\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tvector<long long> &v = memo[bi];\\n\\t\\t\\tint i = bi * BlockSize;\\n\\t\\t\\t{\\n\\t\\t\\t\\tft.init(N);\\n\\t\\t\\t\\tlong long sum = 0;\\n\\t\\t\\t\\tfor(int j = i; j < N; ++ j) {\\n\\t\\t\\t\\t\\tsum += (j - i) - ft.sum(p[j]);\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t\\tft.add(p[j], 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tft.init(N);\\n\\t\\t\\t\\tlong long sum = 0;\\n\\t\\t\\t\\tfor(int j = i - 1; j >= 0; -- j) {\\n\\t\\t\\t\\t\\tsum += ft.sum(p[j]);\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t\\tft.add(p[j], 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<pair<int, int> > > sortedBlocks(NumBlocks);\\n\\t\\tvector<int> rankInBlock(N, -1);\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tint L = bi * BlockSize, R = min((bi + 1) * BlockSize, N);\\n\\t\\t\\tvector<pair<int, int> > &v = sortedBlocks[bi];\\n\\t\\t\\tv.resize(R - L);\\n\\t\\t\\tfor(int i = L; i < R; ++ i)\\n\\t\\t\\t\\tv[i - L] = make_pair(p[i], i);\\n\\t\\t\\tsort(v.begin(), v.end());\\n\\t\\t\\tfor(int i = 0; i < R - L; ++ i)\\n\\t\\t\\t\\trankInBlock[v[i].second] = i;\\n\\t\\t}\\n\\t\\tint Q;\\n\\t\\tscanf(\\\"%d\\\", &Q);\\n\\t\\tfor(int ii = 0; ii < Q; ++ ii) {\\n\\t\\t\\tint l; int r;\\n\\t\\t\\tscanf(\\\"%d%d\\\", &l, &r), -- l, -- r;\\n\\t\\t\\tint bl = (l + BlockSize - 1) / BlockSize, br = (r + 1) / BlockSize;\\n\\t\\t\\tlong long ans = 0;\\n\\t\\t\\tif(bl > br) {\\n\\t\\t\\t\\tft.init(BlockSize);\\n\\t\\t\\t\\tfor(int i = r; i >= l; -- i) {\\n\\t\\t\\t\\t\\tans += ft.sum(rankInBlock[i]);\\n\\t\\t\\t\\t\\tft.add(rankInBlock[i], 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tint L = bl * BlockSize, R = br * BlockSize;\\n\\t\\t\\t\\tans += memo[bl][r];\\n\\t\\t\\t\\tans += memo[br][l];\\n\\t\\t\\t\\tif(bl < br)\\n\\t\\t\\t\\t\\tans -= memo[bl][R - 1];\\n\\t\\t\\t\\tif(l < L && R <= r) {\\n\\t\\t\\t\\t\\tconst vector<pair<int, int> > &v = sortedBlocks[bl - 1], &w = sortedBlocks[br];\\n\\t\\t\\t\\t\\tint nv = (int)v.size(), nw = (int)w.size();\\n\\t\\t\\t\\t\\tfor(int i = 0, j = 0, cnt = 0; i < nv; ++ i) {\\n\\t\\t\\t\\t\\t\\tfor(; j < nw && w[j].first < v[i].first; ++ j)\\n\\t\\t\\t\\t\\t\\t\\tcnt += w[j].second <= r;\\n\\t\\t\\t\\t\\t\\tif(l <= v[i].second)\\n\\t\\t\\t\\t\\t\\t\\tans += cnt;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\", ans); fflush(stdout);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2060,\n \"memory_kb\": 160564,\n \"score_of_the_acc\": -1.0579,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2779_1695471\",\n \"code_snippet\": \"#include <vector>\\n#include <cstdio>\\nusing namespace std;\\n\\nstruct FenwickTree {\\n\\ttypedef int T;\\n\\tvector<T> v;\\n\\tvoid init(int n) { v.assign(n, 0); }\\n\\tvoid add(int i, T x) {\\n\\t\\tfor(; i < (int)v.size(); i |= i + 1) v[i] += x;\\n\\t}\\n\\tT sum(int i) const { //[0, i)\\n\\t\\tT r = 0;\\n\\t\\tfor(-- i; i >= 0; i = (i & (i + 1)) - 1) r += v[i];\\n\\t\\treturn r;\\n\\t}\\n\\tT sum(int left, int right) const { //[left, right)\\n\\t\\treturn sum(right) - sum(left);\\n\\t}\\n};\\n\\nint main() {\\n\\tint N;\\n\\twhile(~scanf(\\\"%d\\\", &N)) {\\n\\t\\tvector<int> p(N);\\n\\t\\tfor(int i = 0; i < N; ++ i)\\n\\t\\t\\tscanf(\\\"%d\\\", &p[i]), -- p[i];\\n\\t\\tint BlockSize = 250, NumBlocks = N / BlockSize + 1;\\n\\t\\tvector<vector<long long> > memo(NumBlocks, vector<long long>(N));\\n\\t\\tFenwickTree ft;\\n\\t\\tfor(int bi = 0; bi < NumBlocks; ++ bi) {\\n\\t\\t\\tvector<long long> &v = memo[bi];\\n\\t\\t\\tint i = bi * BlockSize;\\n\\t\\t\\t{\\n\\t\\t\\t\\tft.init(N);\\n\\t\\t\\t\\tlong long sum = 0;\\n\\t\\t\\t\\tfor(int j = i; j < N; ++ j) {\\n\\t\\t\\t\\t\\tsum += (j - i) - ft.sum(p[j]);\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t\\tft.add(p[j], 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tft.init(N);\\n\\t\\t\\t\\tlong long sum = 0;\\n\\t\\t\\t\\tfor(int j = i - 1; j >= 0; -- j) {\\n\\t\\t\\t\\t\\tsum += ft.sum(p[j]);\\n\\t\\t\\t\\t\\tv[j] = sum;\\n\\t\\t\\t\\t\\tft.add(p[j], 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tft.init(N);\\n\\t\\tint Q;\\n\\t\\tscanf(\\\"%d\\\", &Q);\\n\\t\\tfor(int ii = 0; ii < Q; ++ ii) {\\n\\t\\t\\tint l; int r;\\n\\t\\t\\tscanf(\\\"%d%d\\\", &l, &r), -- l, -- r;\\n\\t\\t\\tint bl = (l + BlockSize - 1) / BlockSize, br = (r - 1) / BlockSize;\\n\\t\\t\\tlong long ans = 0;\\n\\t\\t\\tif(bl > br) {\\n\\t\\t\\t\\tfor(int i = r; i >= l; -- i) {\\n\\t\\t\\t\\t\\tans += ft.sum(p[i]);\\n\\t\\t\\t\\t\\tft.add(p[i], 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(int i = l; i <= r; ++ i)\\n\\t\\t\\t\\t\\tft.add(p[i], -1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tint L = bl * BlockSize, R = br * BlockSize;\\n\\t\\t\\t\\tans += memo[bl][r];\\n\\t\\t\\t\\tans += memo[br][l];\\n\\t\\t\\t\\tif(bl < br)\\n\\t\\t\\t\\t\\tans -= memo[bl][R - 1];\\n\\t\\t\\t\\tfor(int i = R; i <= r; ++ i)\\n\\t\\t\\t\\t\\tft.add(p[i], 1);\\n\\t\\t\\t\\tfor(int i = l; i < L; ++ i)\\n\\t\\t\\t\\t\\tans += ft.sum(p[i]);\\n\\t\\t\\t\\tfor(int i = R; i <= r; ++ i)\\n\\t\\t\\t\\t\\tft.add(p[i], -1);\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\", ans);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2600,\n \"memory_kb\": 316488,\n \"score_of_the_acc\": -1.5583,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1667,"cells":{"group_id":{"kind":"string","value":"aoj_2778_cpp"},"problem_description":{"kind":"string","value":"G: 運命力 - Destiny Draw -\n問題\nMr. D はカードゲームで勝負をすることになった。\nこのカードゲームでは、\nN\n枚のカードの山を用いる。\nまた、山のカードには、上から順に\n1, 2, 3,\n...\n, N\nの番号がついている。\nD で始まるものすべてを背負う彼に敗北は許されないが、不幸にも Mr. D はカードゲームが不得手である。\nそこで、自分が引くカードをコントロールすることで勝利を手にすることにした。\nMr. D は\nK\n種類のシャッフルが可能である。\nK\n種類のうち\ni\n番目のシャッフルでは上から\na_i\n枚目から\na_i+b_i − 1\n枚目までのちょうど\nb_i\n枚を引き抜き、上に重ねる。\ni\n番目のシャッフルを\n1\n回するとき、それぞれ\nt_i\n秒を要する。\nちょうど\nT\n秒のシャッフルの後、一番上のカードを\nC\nにする方法は何通りあるか。 数が多くなる可能性があるので、\n10^9+7\nで割った余りを出力せよ。\n入力形式\n入力は次の形式で与えられる。\nN\nK\nC\nT\na_1\nb_1\nt_1\na_2\nb_2\nt_2\n...\na_K\nb_K\nt_K\nN\nは整数で\n2 \\≤ N \\≤ 40\nを満たす。\nK\nは整数で\n1 \\≤ K \\≤ \\frac{N (N+1)}{2}\nを満たす\nC\nは整数で\n1 \\≤ C \\≤ N\nを満たす\nT\nは整数で\n1 \\≤ T \\≤ 1,000,000\nを満たす\na_i\n(\ni = 1, 2,\n...\n, K\n) は整数で\n1 \\≤ a_i \\≤ N\nを満たす\nb_i\n(\ni = 1, 2,\n...\n, K\n) は整数で\n1 \\≤ b_i \\≤ N − a_i + 1\nを満たす\na_i = a_j\nかつ\nb_i = b_j\nを満たすとき\ni = j\nに限定される\nt_i\nは整数で\n1 \\≤ t_i \\≤ 5\nを満たす\n出力形式\n答えを\n10^9+7\nで割った余りを一行で出力せよ。\n入力例1\n4 1 1 6\n3 2 3\n出力例1\n1\n入力例2\n4 1 1 5\n3 2 3\n出力例2\n0\n入力例3\n6 2 2 5\n1 2 1\n2 5 3\n出力例3\n3\nちょうど\n5\n秒で一番上のカードを\n2\nにする方法は以下の\n3\n通りである。\n1→1→2\n1→2→1\n2→1→1\n入力例4\n6 8 3 10\n1 4 5\n1 3 3\n1 6 5\n1 2 2\n1 1 4\n2 5 1\n4 3 1\n2 1 3\n出力例4\n3087"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2778_10259979","code_snippet":"// AOJ #2778 Destiny Draw\n// 2025.3.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD = 1000000007;\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int n, K, C, T;\n cin >> n >> K >> C >> T;\n vector<vector<vector<long long>>> A(6, vector<vector<long long>>(n, vector<long long>(n, 0)));\n for (int i = 0; i < K; i++){\n int a, b, t;\n cin >> a >> b >> t;\n int a0 = a - 1;\n for (int x = 0; x < n; x++){\n int y;\n if (x >= a0 && x < a0 + b) y = x - a0;\n else if (x < a0) y = x + b;\n else y = x;\n A[t][y][x] = (A[t][y][x] + 1) % MOD;\n }\n }\n int m = min(T, 5);\n vector<vector<long long>> dp(m + 1, vector<long long>(n, 0));\n dp[0][C - 1] = 1;\n for (int t = 1; t <= m; t++){\n for (int cost = 1; cost <= min(t, 5); cost++){\n for (int i = 0; i < n; i++){\n long long s = 0;\n for (int j = 0; j < n; j++) s = (s + A[cost][i][j] * dp[t - cost][j]) % MOD;\n dp[t][i] = (dp[t][i] + s) % MOD;\n }\n }\n }\n if (T <= 5){\n cout << dp[T][0] << endl;\n return 0;\n }\n int d = 5 * n;\n vector<vector<long long>> M(d, vector<long long>(d, 0));\n for (int j = 0; j < 5; j++){\n for (int i = 0; i < n; i++){\n for (int k = 0; k < n; k++) M[i][j * n + k] = A[j + 1][i][k] % MOD;\n }\n }\n for (int j = 1; j < 5; j++){\n for (int i = 0; i < n; i++) M[j * n + i][(j - 1) * n + i] = 1;\n }\n vector<long long> X(d, 0);\n for (int i = 0; i < n; i++){\n X[i] = dp[5][i];\n X[n + i] = dp[4][i];\n X[2 * n + i] = dp[3][i];\n X[3 * n + i] = dp[2][i];\n X[4 * n + i] = dp[1][i];\n }\n auto mulMat = [&](const vector<vector<long long>> &B, const vector<vector<long long>> &C) -> vector<vector<long long>> {\n vector<vector<long long>> R(d, vector<long long>(d, 0));\n for (int i = 0; i < d; i++){\n for (int k = 0; k < d; k++){\n if (B[i][k])\n for (int j = 0; j < d; j++) R[i][j] = (R[i][j] + B[i][k] * C[k][j]) % MOD;\n }\n }\n return R;\n };\n auto mulVec = [&](const vector<vector<long long>> &B, const vector<long long> &v) -> vector<long long> {\n vector<long long> r(d, 0);\n for (int i = 0; i < d; i++){\n for (int j = 0; j < d; j++) r[i] = (r[i] + B[i][j] * v[j]) % MOD;\n }\n return r;\n };\n auto mpow = [&](long long p) -> vector<vector<long long>> {\n vector<vector<long long>> R(d, vector<long long>(d, 0));\n for (int i = 0; i < d; i++) R[i][i] = 1;\n vector<vector<long long>> B = M;\n while (p){\n if (p & 1) R = mulMat(R, B);\n B = mulMat(B, B);\n p >>= 1;\n }\n return R;\n };\n vector<vector<long long>> Mexp = mpow(T - 5);\n vector<long long> Y = mulVec(Mexp, X);\n cout << Y[0] % MOD << endl;\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":4424,"score_of_the_acc":-0.1133,"final_rank":4},{"submission_id":"aoj_2778_6942004","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=2167167167167167167;\nconst int INF=2100000000;\nconst ll mod=1e9+7;\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\";}\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\n\n\n\ntemplate<class T>\nusing square_matrix=std::vector<std::vector<T>>;\ntemplate<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>\nsquare_matrix<T> mul_matrix(square_matrix<T> l,square_matrix<T> r){\n\tint n=l.size();\n\tassert((int)l[0].size()==n&&(int)r.size()==n&&(int)r[0].size()==n);\n\tsquare_matrix<T> val(n,std::vector<T>(n,add_e()));\n\tfor(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++){\n\t\tval[i][k]=add_op(val[i][k],mul_op(l[i][j],r[j][k]));\n\t}\n\treturn val;\n}\ntemplate<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>\nsquare_matrix<T> pow_matrix(square_matrix<T> l,long long times){\n\tint n=l.size();\n\tsquare_matrix<T> val(n,std::vector<T>(n,add_e()));\n\tfor(int i=0;i<n;i++) val[i][i]=mul_e();\n\twhile(times){\n\t\tif(times&1){\n\t\t\tval=mul_matrix<T,add_op,add_e,mul_op,mul_e>(val,l);\n\t\t}\n\t\tl=mul_matrix<T,add_op,add_e,mul_op,mul_e>(l,l);\n\t\ttimes>>=1;\n\t}\n\treturn val;\n}\n\nusing mat_F=ll;\nmat_F add_op(mat_F a,mat_F b){\n\treturn (a+b)%mod;\n}\nmat_F add_e(){\n\treturn 0;\n}\nmat_F mul_op(mat_F a,mat_F b){\n\treturn (a*b)%mod;\n}\nmat_F mul_e(){\n\treturn 1;\n}\n#define calc mat_F,add_op,add_e,mul_op,mul_e\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,C,T;\n\tcin>>N>>K>>C>>T;\n\tvector<vector<ll>> p(N*5,vector<ll>(N*5));\n\trep(i,N*4) p[i][i+N]=1;\n\trep(i,K){\n\t\tll a,b,t;\n\t\tcin>>a>>b>>t;\n\t\ta--;t--;\n\t\trep(j,N){\n\t\t\tif(j<a) p[N*t+j][j+b]++;\n\t\t\telse if(j<a+b) p[N*t+j][j-a]++;\n\t\t\telse p[N*t+j][j]++;\n\t\t}\n\t}\n\tauto base=pow_matrix<calc>(p,T);\n\t//rep(i,N*5) vec_out(base[i]);\n\tcout<<base[C-1][0]<<\"\\n\";\n}","accuracy":1,"time_ms":430,"memory_kb":4960,"score_of_the_acc":-0.2325,"final_rank":7},{"submission_id":"aoj_2778_5532971","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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\n Matrix trans() {\n size_t m = height(), n = width();\n Matrix res(n, m);\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < m; ++j) res[i][j] = (*this)[j][i];\n return res;\n }\n\n Matrix inv() {\n assert(height() == width());\n size_t n = height();\n Matrix B(n, 2 * n);\n for (int i = 0; i < n; ++i) {\n B[i][i + n] = 1;\n for (int j = 0; j < n; ++j) B[i][j] = (*this)[i][j];\n }\n for (int i = 0; i < n; ++i) {\n int piv = i;\n for (int j = i; j < n; ++j)\n if (abs(B[j][i]) > abs(B[piv][i])) piv = j;\n // not exist or unique\n assert(abs(B[piv][i]) >= 0);\n swap(B[i], B[piv]);\n for (int j = i + 1; j < 2 * n; ++j) B[i][j] /= B[i][i];\n for (int j = 0; j < n; ++j)\n if (i != j)\n for (int k = i + 1; k < 2 * n; ++k) B[j][k] -= B[j][i] * B[i][k];\n }\n Matrix res(n);\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < n; ++j) res[i][j] = B[i][j + n];\n return res;\n }\n\n T det() {\n int m = height(), n = width();\n assert(m == n);\n T res = 1;\n Matrix B(m);\n for (int i = 0; i < m; ++i)\n for (int j = 0; j < n; ++j) B[i][j] = (*this)[i][j];\n for (int i = 0; i < n; ++i) {\n int piv = i;\n for (int j = i + 1; j < m; ++j)\n if (B[j][i] != 0) {\n piv = j;\n break;\n }\n // if (abs(B[j][i]) > abs(B[piv][i])) piv = j;\n if (B[piv][i] == 0) return (T)0;\n // if (abs(B[piv][i]) < EPS) return (T)0; // B[piv][i] < EPS\n if (piv != i) swap(B[i], B[piv]), res = -res;\n res *= B[i][i];\n // for (int j = i + 1; j < m; ++j)\n // for (int k = n - 1; k >= i; --k) B[j][k] -= B[i][k] * B[j][i] /\n // B[i][i];\n {\n const T d = (T)1 / B[i][i];\n for (int j = i + 1; j < n; ++j) B[i][j] *= d;\n for (int j = i + 1; j < m; ++j)\n for (int k = i + 1; k < n; ++k) B[j][k] -= B[i][k] * B[j][i];\n }\n }\n return res;\n }\n\n T cofactor(int r = -1, int c = -1) {\n int m = height(), n = width();\n if (r < 0) r = c = m - 1;\n assert(m == n && m > 1 && r < m && c < n);\n Matrix mat(m - 1, n - 1);\n for (int i = 0, rcnt = 0; i < m; ++i)\n if (i != r) {\n int ccnt = 0;\n for (int j = 0; j < n; ++j)\n if (j != c) mat[rcnt][ccnt++] = (*this)[i][j];\n ++rcnt;\n }\n T res = mat.det();\n if ((r ^ c) & 1) res *= -1;\n return res;\n }\n\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\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};\nusing mint = ModInt<>;\n\nint n, k, c, t;\n\nint main() {\n cin >> n >> k >> c >> t;\n Matrix<mint> mat(5 * n, 5 * n), st(5 * n, 1);\n st[c - 1][0] = 1;\n for (int i = 0; i < 4 * n; ++i) mat[i + n][i] = 1;\n for (int i = 0; i < k; ++i) {\n int a, b, p;\n cin >> a >> b >> p, --a, --p;\n p *= n;\n for (int j = 0; j < a; ++j) mat[j + b][j + p] += 1;\n for (int j = a; j < a + b; ++j) mat[j - a][j + p] += 1;\n for (int j = a + b; j < n; ++j) mat[j][j + p] += 1;\n }\n mat ^= t;\n mat *= st;\n cout << mat[0][0] << endl;\n return 0;\n}","accuracy":1,"time_ms":310,"memory_kb":3924,"score_of_the_acc":-0.1111,"final_rank":3},{"submission_id":"aoj_2778_5532751","code_snippet":"#line 1 \"g.cpp\"\n#pragma region Macros\n#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#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__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()\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(i, n) FOR(i, 0, n)\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\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\n#pragma endregion Macros\n\n#line 1 \"/home/siro53/kyo-pro/compro_library/math/modint.hpp\"\ntemplate <int mod> struct 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)\n x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod)\n 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.inv();\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 inv() 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 ret(1), mul(x);\n while(n > 0) {\n if(n & 1)\n ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\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 static int get_mod() { return mod; }\n};\n#line 70 \"g.cpp\"\nusing mint = ModInt<MOD>;\n#line 1 \"/home/siro53/kyo-pro/compro_library/math/matrix.hpp\"\n// 行列ライブラリ\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 // 単位行列\n static Matrix I(size_t n) {\n Matrix mat(n);\n for(int i = 0; i < n; i++)\n 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++)\n (*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++)\n (*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\t\tT sum;\n for(int i = 0; i < n; i++){\n for(int j = 0; j < m; j++){\n\t\t\t\tsum = 0;\n for(int k = 0; k < p; k++){\n sum += (*this)[i][k] * B[k][j];\n\t\t\t\t}\n\t\t\t\tC[i][j] = sum;\n\t\t\t}\n\t\t}\n A.swap(C);\n return (*this);\n }\n\n // 累乗\n Matrix &operator^=(long long k) {\n Matrix B = Matrix::I(height());\n while(k > 0) {\n if(k & 1)\n 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++) {\n os << p[i][j] << (j + 1 == m ? \"]\\n\" : \",\");\n }\n }\n return (os);\n }\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)\n idx = j;\n }\n if(idx == -1)\n 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++) {\n B[i][j] /= vv;\n }\n for(int j = i + 1; j < width(); j++) {\n T a = B[j][i];\n for(int k = 0; k < width(); k++) {\n B[j][k] -= B[i][k] * a;\n }\n }\n }\n return (ret);\n }\n};\n#line 72 \"g.cpp\"\nusing matrix = Matrix<mint>;\n\nint main() {\n int N, K, C, T;\n cin >> N >> K >> C >> T;\n vector<int> a(K), b(K), t(K);\n REP(i, K) {\n cin >> a[i] >> b[i] >> t[i];\n a[i]--; t[i]--;\n }\n\n matrix A(N*5, N*5);\n REP(i, 4*N) A[i+N][i] = 1;\n REP(from, N) {\n REP(i, K) {\n int to;\n if(a[i] <= from and from <= a[i] + b[i] - 1) {\n to = from - a[i];\n }\n else if(from < a[i]) {\n to = from + b[i];\n }\n else {\n to = from;\n }\n assert(0 <= from and from < N);\n assert(0 <= to and to < N);\n A[to][from + t[i] * N] += 1;\n }\n }\n A ^= T;\n\n matrix B(5*N, 1);\n B[C-1][0] = 1;\n A *= B;\n\n mint ans = A[0][0]; \n\n cout << ans << endl;\n}","accuracy":1,"time_ms":310,"memory_kb":3884,"score_of_the_acc":-0.1084,"final_rank":2},{"submission_id":"aoj_2778_4926883","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing uint = unsigned;\nusing ll = long long;\n\nuint mod = 1000000007;\nstruct Modint{\n uint x = 0;\n Modint(const Modint& a): x(a.x){}\n Modint(ll a){\n a %= ll(mod);\n if(a < 0) a += mod;\n x = a;\n }\n Modint(){}\n Modint& operator+=(const Modint& a){\n x += a.x;\n if(x >= mod) x -= mod;\n return *this;\n }\n Modint& operator*=(const Modint& a){\n x = uint64_t(x) * a.x % mod;\n return *this;\n }\n Modint operator+(const Modint& a) const {\n return Modint(*this) += a;\n }\n Modint operator*(const Modint& a) const {\n return Modint(*this) *= a;\n }\n void operator++(int){\n *this += 1;\n }\n};\nstruct Matrix{\n vector<vector<Modint>> x;\n Matrix(ll n): x(n, vector<Modint>(n)){}\n Matrix operator*(const Matrix& a) const {\n const ll n = size();\n Matrix ans(n);\n for(ll i = 0; i < n; i++) for(ll j = 0; j < n; j++) for(ll k = 0; k < n; k++) ans[i][k] += x[i][j] * a[j][k];\n return ans;\n }\n Matrix pow(ll x) const {\n const ll n = size();\n Matrix ans(n), a = *this;\n for(ll i = 0; i < n; i++) ans[i][i] = 1;\n while(x){\n if(x & 1) ans = ans * a;\n a = a * a;\n x >>= 1;\n }\n return ans;\n }\n vector<Modint>& operator[](ll i){ return x[i]; }\n const vector<Modint>& operator[](ll i) const { return x[i]; }\n ll size() const { return x.size(); }\n};\nint main(){\n ll n, k, c, t;\n cin >> n >> k >> c >> t;\n Matrix d(5 * n);\n for(ll i = n; i < 5 * n; i++) d[i][i - n] = 1;\n for(ll i = 0; i < k; i++){\n ll a, b, t;\n cin >> a >> b >> t;\n a--; t--;\n for(ll j = 0; j < a; j++) d[j][t * n + j + b]++;\n for(ll j = a; j < a + b; j++) d[j][t * n + j - a]++;\n for(ll j = a + b; j < n; j++) d[j][t * n + j]++;\n }\n c--;\n Matrix a(5 * n);\n a[0][c] = 1;\n a = a * d.pow(t);\n cout << a[0][0].x << endl;\n}","accuracy":1,"time_ms":1310,"memory_kb":4020,"score_of_the_acc":-0.5579,"final_rank":15},{"submission_id":"aoj_2778_3968146","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// ModInt begin\n\nusing ll = long long;\ntemplate<ll mod>\nstruct ModInt {\n ll v;\n ll mod_pow(ll x, ll n) const {\n return (!n) ? 1 : (mod_pow((x*x)%mod,n/2) * ((n&1)?x:1)) % mod;\n }\n ModInt(ll a = 0) : v((a %= mod) < 0 ? a + mod : a) {}\n ModInt operator+ ( const ModInt& b ) const {\n return (v + b.v >= mod ? ModInt(v + b.v - mod) : ModInt(v + b.v));\n }\n ModInt operator- () const {\n return ModInt(-v);\n }\n ModInt operator- ( const ModInt& b ) const {\n return (v - b.v < 0 ? ModInt(v - b.v + mod) : ModInt(v - b.v));\n }\n ModInt operator* ( const ModInt& b ) const {return (v * b.v) % mod;}\n ModInt operator/ ( const ModInt& b ) const {return (v * mod_pow(b.v, mod-2)) % mod;}\n \n bool operator== ( const ModInt &b ) const {return v == b.v;}\n bool operator!= ( const ModInt &b ) const {return !(*this == b); }\n ModInt& operator+= ( const ModInt &b ) {\n v += b.v;\n if(v >= mod) v -= mod;\n return *this;\n }\n ModInt& operator-= ( const ModInt &b ) {\n v -= b.v;\n if(v < 0) v += mod;\n return *this;\n }\n ModInt& operator*= ( const ModInt &b ) {\n (v *= b.v) %= mod;\n return *this;\n }\n ModInt& operator/= ( const ModInt &b ) {\n (v *= mod_pow(b.v, mod-2)) %= mod;\n return *this;\n }\n ModInt pow(ll x) { return ModInt(mod_pow(v, x)); }\n // operator int() const { return int(v); }\n // operator long long int() const { return v; }\n};\n\ntemplate<ll mod>\nostream& operator<< (ostream& out, ModInt<mod> a) {return out << a.v;}\ntemplate<ll mod>\nistream& operator>> (istream& in, ModInt<mod>& a) {\n in >> a.v;\n return in;\n}\n\n// ModInt end\n\n// 行列ライブラリ\n\n// size(): 行数を返す (列数は mat[0].size() で)\n// 演算子: 複合代入 (+=, *=, -=), 単項 (-), 二項 (+, -, *, ==)\n// eigen(N): N*N 単位行列を返す\n// pow(mat, k): mat の k 乗を返す\n\ntemplate <typename T>\nstruct Matrix {\n vector< vector<T> > mat;\n Matrix() {}\n Matrix(int h, int w, T val = T(0)) : mat(h, vector<T>(w, val)) {}\n size_t size() const { return mat.size(); }\n const vector<T>& operator[](int i) const { return mat[i]; }\n vector<T>& operator[](int i) { return mat[i]; }\n\n Matrix<T> &operator+=(const Matrix<T>& rhs) {\n assert(mat.size() == rhs.size());\n assert(mat[0].size() == rhs[0].size());\n for(size_t i=0; i<mat.size(); i++) {\n for(size_t j=0; j<mat[0].size(); j++) {\n mat[i][j] += rhs[i][j];\n }\n }\n return *this;\n }\n\n Matrix<T> operator-() const {\n Matrix<T> res(*this);\n for(size_t i=0; i<res.size(); i++) {\n for(size_t j=0; j<res[0].size(); j++) {\n res[i][j] *= T(-1);\n }\n }\n return res;\n }\n\n Matrix<T>& operator-=(const Matrix<T>& rhs) {\n return (Matrix<T>(*this) += -rhs);\n }\n\n Matrix<T>& operator*=(const Matrix<T>& rhs) {\n assert(mat[0].size() == rhs.size());\n size_t H = mat.size(), W = rhs[0].size(), C = rhs.size();\n Matrix<T> res(H, W);\n for(size_t i=0; i<H; i++) {\n for(size_t j=0; j<W; j++) {\n for(size_t k=0; k<C; k++) {\n res[i][j] += mat[i][k] * rhs[k][j];\n }\n }\n }\n this->mat = res.mat;\n return *this;\n }\n\n Matrix<T> operator+(const Matrix<T>& rhs) {\n return (Matrix<T>(*this) += rhs);\n }\n\n Matrix<T> operator*(const Matrix<T>& rhs) {\n return (Matrix<T>(*this) *= rhs);\n }\n\n Matrix<T> operator-(const Matrix<T> &rhs) {\n return (Matrix<T>(*this) -= rhs);\n }\n\n bool operator==(const Matrix<T> &rhs) const {\n return this->mat == rhs.mat;\n }\n bool operator!=(const Matrix<T> &rhs) const {\n return !(*this == rhs);\n }\n};\n\ntemplate <typename T>\nMatrix<T> eigen(size_t N) {\n Matrix<T> res(N, N, 0);\n for(size_t i=0; i<N; i++) res[i][i] = T(1);\n return res;\n}\n\ntemplate <typename T>\nMatrix<T> pow(Matrix<T> mat, long long int k) {\n Matrix<T> res = eigen<T>(mat.size());\n for(; k>0; k>>=1) {\n if(k & 1) res *= mat;\n mat *= mat;\n }\n return res;\n}\n\ntemplate <typename T>\nostream& operator<< (ostream& out, Matrix<T> mat) {\n int H = mat.size(), W = mat[0].size();\n out << \"[\" << endl;\n for(int i=0; i<H; i++) {\n out << \" [ \";\n for(int j=0; j<W; j++) out << mat[i][j] << \" \";\n out << \"]\" << endl;\n }\n out << \"]\" << endl;\n return out;\n}\n\nusing mint = ModInt<MOD>;\nint main() {\n int N, K, C, T; cin >> N >> K >> C >> T; C--;\n\n int M = 5 * N;\n Matrix<mint> mat(M, M);\n\n auto get_idx = [&](int time, int pos) {\n return time * N + pos;\n };\n\n for(int i=0; i<K; i++) {\n int a, b, t; cin >> a >> b >> t; a--;\n int l = a, r = a + b;\n vector<int> x, y;\n for(int j=0; j<N; j++) {\n if(l <= j and j < r) x.emplace_back(j);\n else y.emplace_back(j);\n }\n\n for(auto e : y) x.emplace_back(e);\n for(int j=0; j<N; j++) {\n int k = x[j]; // もともと k 番目だったものが j 番目に\n for(int s=0; s<1; s++) {\n int u = get_idx(s, j); // now\n int v = get_idx(s+t-1, k); // prev\n mat[u][v] += mint(1);\n }\n }\n }\n\n for(int i=0; i<N; i++) {\n for(int t=1; t<=4; t++) {\n int u = get_idx(t, i); // now\n int v = get_idx(t-1, i); // prev\n mat[u][v] += mint(1);\n }\n }\n\n mat = pow(mat, T);\n Matrix<mint> vec(M, 1);\n vec[C][0] = mint(1);\n\n vec = mat * vec;\n cout << vec[0][0] << endl;\n return 0;\n}","accuracy":1,"time_ms":1270,"memory_kb":4212,"score_of_the_acc":-0.553,"final_rank":14},{"submission_id":"aoj_2778_2738213","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\ntypedef vector<ll> V;\ntypedef vector<V> MATRIX;\n\nint SIZE;\nint base[40],work[40],next_loc[40];\n\nMATRIX calc(MATRIX left,MATRIX right){\n\n\tMATRIX ret(SIZE,V(SIZE));\n\n\tfor(int i = 0; i < SIZE; i++){\n\t\tfor(int k = 0; k < SIZE; k++)ret[i][k] = 0;\n\t}\n\n\tfor(int row = 0; row < SIZE; row++){\n\t\tfor(int col = 0; col < SIZE; col++){\n\t\t\tfor(int a = 0; a < SIZE; a++){\n\t\t\t\tret[row][col] += left[row][a]*right[a][col]%MOD;\n\t\t\t\tret[row][col] %= MOD;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ret;\n}\n\n\nMATRIX pow(MATRIX MULT,int count){\n\n\tMATRIX ret(SIZE,V(SIZE));\n\n\tfor(int row = 0; row < SIZE; row++){\n\t\tfor(int col = 0; col < SIZE; col++){\n\t\t\tif(row == col)ret[row][col] = 1;\n\t\t\telse{\n\t\t\t\tret[row][col] = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\twhile(count > 0){\n\t\tif(count%2 == 1)ret = calc(ret,MULT);\n\t\tMULT = calc(MULT,MULT);\n\t\tcount /= 2;\n\t}\n\n\treturn ret;\n}\n\n\nint main(){\n\n\tint N,K,C,T;\n\tscanf(\"%d %d %d %d\",&N,&K,&C,&T);\n\tC--;\n\n\tfor(int i = 0; i < N; i++)base[i] = i;\n\n\tSIZE = 5*N;\n\n\tMATRIX MULT(SIZE,V(SIZE));\n\tfor(int row = 0; row < SIZE; row++){\n\t\tfor(int col = 0; col < SIZE; col++)MULT[row][col] = 0;\n\t}\n\n\tint from,num,add_time;\n\tint work_index,base_row = 0,base_col;\n\n\tfor(int loop = 0; loop < K; loop++){\n\t\tscanf(\"%d %d %d\",&from,&num,&add_time);\n\t\tfrom--;\n\n\t\twork_index = 0;\n\t\tfor(int i = 0;i < num; i++){\n\t\t\twork[work_index++] = base[from+i];\n\t\t}\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i >= from && i <= from+num-1)continue;\n\t\t\twork[work_index++] = base[i];\n\t\t}\n\n\t\tbase_col = N*(add_time-1);\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tMULT[base_row+work[i]][base_col+i]++;\n\t\t}\n\t}\n\n\tfor(base_row = N; base_row <= 4*N; base_row += N){\n\t\tfor(base_col = 0; base_col <= 4*N; base_col += N){\n\t\t\tif(base_row-N != base_col)continue;\n\t\t\tfor(int i = 0; i < N; i++)MULT[base_row+i][base_col+i] = 1;\n\t\t}\n\t}\n\n\tMULT = pow(MULT,T);\n\n\tprintf(\"%lld\\n\",MULT[C][0]%MOD);\n\n\treturn 0;\n}","accuracy":1,"time_ms":760,"memory_kb":4876,"score_of_the_acc":-0.3723,"final_rank":13},{"submission_id":"aoj_2778_2558451","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define MOD 1000000007\n\ntypedef vector<vector<long>> mat;\n\n// return A*B\nmat mat_mul(const mat &A, const mat &B){\n int n=A.size(), m=B[0].size(), l=B.size();\n mat ret(n, vector<long>(m, 0));\n rep(i,n) rep(k,l) if(A[i][k]!=0) rep(j,m){\n (ret[i][j] += A[i][k] * B[k][j]) %= MOD;\n }\n return ret;\n}\n\n// A^p\nmat mat_pow(const mat &A, long p){\n int n = A.size();\n mat tmp(A), ret(n, vector<long>(n,0));\n rep(i,n) ret[i][i] = 1;\n while(p>0){\n if(p&1) ret = mat_mul(tmp, ret);\n tmp = mat_mul(tmp, tmp);\n p /= 2;\n }\n return ret;\n}\n\nint main(){\n int n,k,c,T;\n cin>>n>>k>>c>>T;\n c--;\n\n vector<int> a(k), b(k), t(k);\n rep(i,k) cin>>a[i]>>b[i]>>t[i];\n rep(i,k) a[i]--;\n\n int sz = 5*n;\n\n mat A(sz, vector<long>(sz, 0));\n rep(i,n,sz){\n A[i-n][i] += 1;\n }\n\n rep(i,k){\n rep(j,n){\n int to = (t[i]-1)*n + j;\n if(j < a[i]) to += b[i];\n else if(j < a[i]+b[i]) to -= a[i];\n A[to][j] += 1;\n }\n }\n\n A = mat_pow(A, T);\n\n cout << A[0][c] << endl;\n\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":4196,"score_of_the_acc":-0.1247,"final_rank":5},{"submission_id":"aoj_2778_2558275","code_snippet":"#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\nusing vl = vector<ll>;\nusing mat = vector<vl>;\n\nconst ll mod = 1e9+7;\n\nmat mul(const mat &a, const mat &b)\n{\n int n = a.size();\n mat c(n,vl(n));\n rep(i,n)rep(j,n)rep(k,n) (c[i][j]+=a[i][k]*b[k][j])%=mod;\n return c;\n}\n\nvl mul(const mat &a, const vl &b)\n{\n int n = a.size();\n vl c(n);\n rep(i,n)rep(j,n) (c[i]+=a[i][j]*b[j])%=mod;\n return c;\n}\n\nmat mat_pow(const mat &a, int T)\n{\n int n = a.size();\n mat ret(n,vl(n));\n rep(i,n) ret[i][i] = 1;\n\n mat p(a);\n while(T)\n {\n if(T&1) ret = mul(ret,p);\n p = mul(p,p);\n T>>=1;\n }\n return ret;\n}\n\nint main()\n{\n int n,k,C,T;\n cin >>n >>k >>C >>T;\n --C;\n\n vector<int> a(k),b(k),t(k);\n rep(i,k)\n {\n cin >>a[i] >>b[i] >>t[i];\n --a[i];\n }\n\n int SZ = 5*n;\n\n mat A(SZ,vl(SZ));\n // make A\n for(int i=n; i<5*n; ++i) A[i-n][i] += 1;\n rep(i,k)\n {\n rep(j,n)\n {\n int idx = (t[i]-1)*n+j;\n if(j<a[i]) idx += b[i];\n else if(j<a[i]+b[i]) idx -= a[i];\n\n A[idx][j] += 1;\n }\n }\n\n vl B(SZ);\n B[C] = 1;\n\n vl res = mul(mat_pow(A,T),B);\n cout << res[0] << endl;\n return 0;\n}","accuracy":1,"time_ms":650,"memory_kb":4180,"score_of_the_acc":-0.2778,"final_rank":8},{"submission_id":"aoj_2778_2342162","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n\nconst int mod = 1000000007;\nstruct Mod {\npublic:\n\tint num;\n\tMod() : Mod(0) { ; }\n\tMod(long long int n) : num((n % mod + mod) % mod) {\n\t\tstatic_assert(mod<INT_MAX / 2, \"mod is too big, please make num 'long long int' from 'int'\");\n\t}\n\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\n\toperator int() { return num; }\n};\n\nMod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\nMod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\nMod operator+(const Mod a, const long long int b) { return b + a; }\nMod operator++(Mod &a) { return a + Mod(1); }\nMod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\nMod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\nMod operator--(Mod &a) { return a - Mod(1); }\nMod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\nMod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\nMod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\nMod operator*(const Mod a, const int b) { return Mod(b)*a; }\nMod operator+=(Mod &a, const Mod b) { return a = a + b; }\nMod operator+=(long long int &a, const Mod b) { return a = a + b; }\nMod operator-=(Mod &a, const Mod b) { return a = a - b; }\nMod operator-=(long long int &a, const Mod b) { return a = a - b; }\nMod operator*=(Mod &a, const Mod b) { return a = a * b; }\nMod operator*=(long long int &a, const Mod b) { return a = a * b; }\nMod operator*=(Mod& a, const long long int &b) { return a = a * b; }\nMod operator^(const Mod a, const int n) {\n\tif (n == 0) return Mod(1);\n\tMod res = (a * a) ^ (n / 2);\n\tif (n % 2) res = res * a;\n\treturn res;\n}\nMod mod_pow(const Mod a, const long long int n) {\n\tif (n == 0) return Mod(1);\n\tMod res = mod_pow((a * a), (n / 2));\n\tif (n % 2) res = res * a;\n\treturn res;\n}\nMod inv(const Mod a) { return a ^ (mod - 2); }\nMod operator/(const Mod a, const Mod b) {\n\tassert(b.num != 0);\n\treturn a * inv(b);\n}\nMod operator/(const long long int a, const Mod b) {\n\treturn Mod(a) / b;\n}\nMod operator/=(Mod &a, const Mod b) {\n\treturn a = a / b;\n}\n\n#define MAX_MOD_N 1024000\n\nMod fact[MAX_MOD_N], factinv[MAX_MOD_N];\nvoid init(const int amax = MAX_MOD_N) {\n\tfact[0] = Mod(1); factinv[0] = 1;\n\tfor (int i = 0; i < amax - 1; ++i) {\n\t\tfact[i + 1] = fact[i] * Mod(i + 1);\n\t\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\n\t}\n}\nMod comb(const int a, const int b) {\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\n\n\ntemplate<typename T>\nvector<vector<T>> keisann(const vector<vector<T>>l, const vector<vector<T>>r) {\n\tvector<vector<T>>ans(l.size(), vector<T>(r[0].size()));\n\tassert(l[0].size() == r.size());\n\tfor (unsigned int h = 0; h < l.size(); ++h) {\n\t\tfor (unsigned int i = 0; i < r.size(); ++i) {\n\t\t\tfor (unsigned int w = 0; w < r[0].size(); ++w) {\n\n\t\t\t\tans[h][w] += l[h][i] * r[i][w];\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\n\ntemplate<typename T>\nvector<vector<T>>powgyou(vector<vector<T>>a, const long long int n) {\n\tassert(a.size() == a[0].size());\n\tif (!n) {\n\t\tvector<vector<T>>e(a.size(), vector<T>(a[0].size()));\n\t\tfor (unsigned int i = 0; i < a.size(); ++i) {\n\t\t\te[i][i] = 1;\n\t\t}\n\t\treturn e;\n\t}\n\tif (n == 1)return a;\n\telse {\n\t\tvector<vector<T>>ans(a.size(), vector<T>(a[0].size(), 0));\n\t\tans = powgyou(a, n / 2);\n\t\tans = keisann(ans, ans);\n\t\tif (n % 2) {\n\t\t\tans = keisann(ans, a);\n\t\t}\n\t\treturn ans;\n\t}\n}\n\nint main(){\n\tint N, K, C, T; cin >> N >> K >> C >> T;\n\t\n\tC--;\n\tvector<vector<Mod>>from(5*N, vector<Mod>(1));\n\tfrom[5*C][0]+=1;\n\tvector<vector<Mod>>gyou(5*N, vector<Mod>(5*N));\n\tfor (int i = 0; i < N; ++i) {\n\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\tgyou[5 * i + j][5 *i + j + 1] = 1;\n\t\t}\n\t}\n\tfor (int i = 0; i < K; ++i) {\n\t\tint a, b, t; cin >> a >> b >> t;\n\t\ta--;\n\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\tconst int afrom = 5 * j;\n\t\t\tint to;\n\t\t\tif (j<a) {\n\t\t\t\tto = 5 * (j + b) + t - 1;\n\t\t\t}\n\t\t\telse if ((j>a + b - 1)) {\n\t\t\t\tto = afrom+t-1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tto = 5 * (j - a) + t-1;\n\n\t\t\t}\n\t\t\tgyou[to][afrom] += 1;\n\t\t}\n\t}\n\tauto kake = powgyou(gyou,T);\n\tauto ans = keisann(kake, from);\n\tcout << ans[0][0] << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":1170,"memory_kb":17820,"score_of_the_acc":-1.4097,"final_rank":20},{"submission_id":"aoj_2778_2270769","code_snippet":"#include<iostream>\n#include<vector>\n\n#define rep(i,n) for(int i=0;i<(int)n;i++)\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\nconst ll mod = 1000000007;\nconst int tMAX = 5;\n\ninline void init(mat &A, int n, int m){\n A = mat(n,vec(m,0));\n}\n\ninline mat add(mat A, mat B){\n mat res = A;\n rep(i,A.size())rep(j,A[i].size())(res[i][j] += B[i][j]) %= mod;\n return res;\n}\n\ninline mat mul(mat A, mat B){\n mat res; init(res,A.size(),B[0].size());\n rep(i,A.size())rep(j,B[0].size()){\n rep(k,B.size())res[i][j] += (A[i][k] * B[k][j]) % mod;\n res[i][j] %= mod;\n }\n return res;\n}\n\ninline mat pow_mat(mat &A, ll n){\n if(n==1LL)return A;\n mat B = pow_mat(A,n/2), res = mul(B,B);\n if(n&1)res = mul(A,res);\n return res;\n}\n\nll N,K,C,T,tr;\nll a, b, t;\nvec shuffle(50), perm(50);\nmat perm_mat[10], dp[500100], tmp;\nmat large_mat, thin_mat;\n\nint main(){\n cin >> N >> K >> C >> T;\n\n rep(i,tMAX+1)init(perm_mat[i],N,N);\n rep(i,N)perm[i] = i;\n\n rep(i,K){\n cin >> a >> b >> t;\n rep(j,b)shuffle[j] = perm[j+a-1];\n rep(j,a-1)shuffle[b+j] = perm[j];\n for(int j=a+b-1;j<N;j++)shuffle[j] = perm[j];\n rep(j,N)perm_mat[t][j][shuffle[j]]++;\n }\n\n rep(i,tMAX+1)init(dp[i],N,N);\n rep(i,N)dp[0][i][i] = 1;\n \n rep(i,tMAX)rep(j,tMAX){\n if(i+j+1<=tMAX){\n tmp = mul(perm_mat[j+1],dp[i]);\n dp[i+j+1] = add(dp[i+j+1],tmp);\n }\n }\n\n init(large_mat,N*tMAX,N*tMAX);\n rep(id,tMAX){\n rep(i,N)rep(j,N)large_mat[i][j+id*N] = perm_mat[id+1][i][j];\n }\n rep(i,N*(tMAX-1))large_mat[i+N][i] = 1;\n\n init(thin_mat,N*tMAX,N);\n rep(id,tMAX){\n rep(i,N)rep(j,N)thin_mat[i+id*N][j] = dp[tMAX-1-id][i][j];\n }\n\n tmp = pow_mat(large_mat,T);\n cout << mul(tmp,thin_mat)[(tMAX-1)*N][C-1] << endl;\n}","accuracy":1,"time_ms":470,"memory_kb":16880,"score_of_the_acc":-1.0391,"final_rank":19},{"submission_id":"aoj_2778_2161191","code_snippet":"#include <valarray>\n#include <vector>\n#include <cstdio>\nusing namespace std;\ntypedef valarray<__int128_t>V;\nint n,m=1000000007;\nV z;\nV &Me(const V &_x,const V &_y){\n\tint i=0,j;\n\tfor(;i<n;i++)for(j=0;j<n;j++)z[i*n+j]=(_x[slice(i*n,n,1)]*_y[slice(j,n,n)]).sum()%m;\n\treturn z;\n}\nV &Mx(const V &_x){\n\tint i=0,j;\n\tfor(;i<n;i++)for(j=0;j<n;j++)z[i*n+j]=(_x[slice(i*n,n,1)]*_x[slice(j,n,n)]).sum()%m;\n\treturn z;\n}\nint main(){\n\tint N,K,C,T;\n\tscanf(\"%d%d%d%d\",&N,&K,&C,&T);C--;\n\tvector<int>a(K),b(K),t(K);\n\tfor(int i=0;i<K;i++)scanf(\"%d%d%d\",&a[i],&b[i],&t[i]),a[i]--;\n\tn=N*5;\n\tV x(n*n);\n\tV e(n*n);\n\tz.resize(n*n);\n\tfor(int i=0;i<n;i++)e[i*n+i]=1;\n\tfor(int i=0;i<K;i++)for(int j=0;j<N;j++){\n\t\tint nj=j<a[i]?j+b[i]:j<a[i]+b[i]?j-a[i]:j;\n\t\tx[j*5*n+nj*5+t[i]-1]++;\n\t}\n\tfor(int i=0;i<N;i++)for(int j=1;j<5;j++)x[(i*5+j)*n+i*5+j-1]++;\n\tfor(;T;T>>=1){\n\t\tif(T&1)e=Me(e,x);\n\t\tx=Mx(x);\n\t}\n\tprintf(\"%lld\\n\",(long long)e[C*5*n]);\n}","accuracy":1,"time_ms":420,"memory_kb":4236,"score_of_the_acc":-0.1802,"final_rank":6},{"submission_id":"aoj_2778_2156949","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\n \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)\n#define rrep(i,n) for (int i=(n)-1;i>=0;--i)\n#define rrep2(i,a,b) for (int i=(a)-1;i>=b;--i)\n#define chmin(a,b) (a)=min((a),(b));\n#define chmax(a,b) (a)=max((a),(b));\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define printV(_v) cout<<(#_v)<<\":\";for(auto(_x):(_v)){cout<<\" \"<<(_x);}cout<<endl;\n#define printVS(vs) cout<<(#vs)<<\":\"<<endl;for(auto(s):(vs)){cout<<(s)<< endl;}\n#define printVV(vv) cout<<(#vv)<<\":\"<<endl;for(auto(v):(vv)){for(auto(x):(v)){cout<<\" \"<<(x);}cout<<endl;}\n#define printP(p) cout<<(#p)<<(p).first<<\" \"<<(p).second<<endl;\n#define printVP(vp) cout<<(#vp)<<\":\"<<endl;for(auto(p):(vp)){cout<<(p).first<<\" \"<<(p).second<<endl;}\n \ninline void output(){ cout << endl; }\ntemplate<typename First, typename... Rest>\ninline void output(const First& first, const Rest&... rest) {\n cout << first << \" \"; output(rest...);\n}\n \nusing ll = long long;\nusing Pii = pair<int, int>;\nusing TUPLE = tuple<int, int, int>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nconst int inf = 1ll << 60;\nconst int mod = 1e9 + 7;\nusing Graph = vector<vector<int>>;\n \nusing Vec = vector<int>;\nusing Mat = vector<Vec>;\n \nMat mulMatMat(const Mat& a, const Mat& b) {\n int n = a.size();\n int m = b[0].size();\n assert(a[0].size() == b.size());\n Mat c(n, Vec(m, 0));\n rep(i, n) {\n rep(j, m) {\n rep(k, a[0].size()) {\n (c[i][j] += a[i][k] * b[k][j]) %= mod;\n }\n }\n }\n return c;\n}\n \nvoid addMatMat(Mat& a, const Mat& b) {\n assert(a.size() == b.size());\n assert(a[0].size() == b[0].size());\n rep(i, a.size()) {\n rep(j, a[0].size()) {\n (a[i][j] += b[i][j]) %= mod;\n }\n }\n}\n \nVec mulMatVec(const Mat& a, const Vec& v) {\n int n = a.size();\n assert(a[0].size() == v.size());\n Vec c(n, 0);\n rep(i, n) {\n rep(j, a[0].size()) {\n (c[i] += a[i][j] * v[j]) %= mod;\n }\n }\n return c;\n}\n \nMat identityMatrix(int n) {\n Mat a(n, Vec(n));\n rep(i, n) a[i][i] = 1;\n return a;\n}\n \nMat powMat(Mat a, int t) {\n assert(a.size() == a[0].size());\n Mat b = identityMatrix(a.size());\n for (; t > 0; t >>= 1) {\n if (t & 1) {\n b = mulMatMat(a, b);\n }\n a = mulMatMat(a, a);\n }\n return b;\n}\n \nmain() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n \n int N, K, C, T;\n cin >> N >> K >> C >> T;\n C--;\n vector<Mat> A(5, Mat(N, Vec(N)));\n rep(k, K) {\n int a, b, t;\n cin >> a >> b >> t;\n a--; t--;\n rep(i, a) A[t][i][i + b]++;\n rep2(i, a, a + b) A[t][i][i - a]++;\n rep2(i, a + b, N) A[t][i][i]++;\n }\n \n // rep(t, 5) {\n // printVV(A[t]);\n // }\n \n Mat B(5*N, Vec(5*N));\n rep(t, 5) {\n rep(i, N) {\n rep(j, N) {\n B[i][j + t*N] = A[t][i][j];\n }\n }\n }\n rep(j, 4 * N) {\n B[j + N][j] = 1;\n }\n \n // printVV(B);\n \n vector<Mat> dp(5, Mat(N, Vec(N)));\n dp[0] = identityMatrix(N);\n rep2(i, 1, 5) {\n rep(j, i) {\n addMatMat(dp[i], mulMatMat(A[i - j - 1], dp[j]));\n }\n }\n \n // rep(t, 5) {\n // printVV(dp[t]);\n // }\n \n auto D = powMat(B, T);\n \n Mat E(N, Vec(N));\n rep(k, 5) {\n Mat F(N, Vec(N));\n rep(i, N) {\n rep(j, N) {\n F[i][j] = D[i + 4*N][j + k*N];\n }\n }\n addMatMat(E, mulMatMat(F, dp[4 - k]));\n }\n \n cout << E[C][0] << endl;\n}","accuracy":1,"time_ms":660,"memory_kb":4212,"score_of_the_acc":-0.2843,"final_rank":9},{"submission_id":"aoj_2778_2155036","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\n\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)\n#define rrep(i,n) for (int i=(n)-1;i>=0;--i)\n#define rrep2(i,a,b) for (int i=(a)-1;i>=b;--i)\n#define chmin(a,b) (a)=min((a),(b));\n#define chmax(a,b) (a)=max((a),(b));\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define printV(_v) cout<<(#_v)<<\":\";for(auto(_x):(_v)){cout<<\" \"<<(_x);}cout<<endl;\n#define printVS(vs) cout<<(#vs)<<\":\"<<endl;for(auto(s):(vs)){cout<<(s)<< endl;}\n#define printVV(vv) cout<<(#vv)<<\":\"<<endl;for(auto(v):(vv)){for(auto(x):(v)){cout<<\" \"<<(x);}cout<<endl;}\n#define printP(p) cout<<(#p)<<(p).first<<\" \"<<(p).second<<endl;\n#define printVP(vp) cout<<(#vp)<<\":\"<<endl;for(auto(p):(vp)){cout<<(p).first<<\" \"<<(p).second<<endl;}\n\ninline void output(){ cout << endl; }\ntemplate<typename First, typename... Rest>\ninline void output(const First& first, const Rest&... rest) {\n cout << first << \" \"; output(rest...);\n}\n\nusing ll = long long;\nusing Pii = pair<int, int>;\nusing TUPLE = tuple<int, int, int>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nconst int inf = 1ll << 60;\nconst int mod = 1e9 + 7;\nusing Graph = vector<vector<int>>;\n\nusing Vec = vector<int>;\nusing Mat = vector<Vec>;\n\nMat mulMatMat(const Mat& a, const Mat& b) {\n int n = a.size();\n int m = b[0].size();\n assert(a[0].size() == b.size());\n Mat c(n, Vec(m, 0));\n rep(i, n) {\n rep(j, m) {\n rep(k, a[0].size()) {\n (c[i][j] += a[i][k] * b[k][j]) %= mod;\n }\n }\n }\n return c;\n}\n\nvoid addMatMat(Mat& a, const Mat& b) {\n assert(a.size() == b.size());\n assert(a[0].size() == b[0].size());\n rep(i, a.size()) {\n rep(j, a[0].size()) {\n (a[i][j] += b[i][j]) %= mod;\n }\n }\n}\n\nVec mulMatVec(const Mat& a, const Vec& v) {\n int n = a.size();\n assert(a[0].size() == v.size());\n Vec c(n, 0);\n rep(i, n) {\n rep(j, a[0].size()) {\n (c[i] += a[i][j] * v[j]) %= mod;\n }\n }\n return c;\n}\n\nMat identityMatrix(int n) {\n Mat a(n, Vec(n));\n rep(i, n) a[i][i] = 1;\n return a;\n}\n\nMat powMat(Mat a, int t) {\n assert(a.size() == a[0].size());\n Mat b = identityMatrix(a.size());\n for (; t > 0; t >>= 1) {\n if (t & 1) {\n b = mulMatMat(a, b);\n }\n a = mulMatMat(a, a);\n }\n return b;\n}\n\nmain() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int N, K, C, T;\n cin >> N >> K >> C >> T;\n C--;\n vector<Mat> A(5, Mat(N, Vec(N)));\n rep(k, K) {\n int a, b, t;\n cin >> a >> b >> t;\n a--; t--;\n rep(i, a) A[t][i][i + b]++;\n rep2(i, a, a + b) A[t][i][i - a]++;\n rep2(i, a + b, N) A[t][i][i]++;\n }\n\n // rep(t, 5) {\n // printVV(A[t]);\n // }\n\n Mat B(5*N, Vec(5*N));\n rep(t, 5) {\n rep(i, N) {\n rep(j, N) {\n B[i][j + t*N] = A[t][i][j];\n }\n }\n }\n rep(j, 4 * N) {\n B[j + N][j] = 1;\n }\n\n // printVV(B);\n\n vector<Mat> dp(5, Mat(N, Vec(N)));\n dp[0] = identityMatrix(N);\n rep2(i, 1, 5) {\n rep(j, i) {\n addMatMat(dp[i], mulMatMat(A[i - j - 1], dp[j]));\n }\n }\n\n // rep(t, 5) {\n // printVV(dp[t]);\n // }\n\n auto D = powMat(B, T);\n\n Mat E(N, Vec(N));\n rep(k, 5) {\n Mat F(N, Vec(N));\n rep(i, N) {\n rep(j, N) {\n F[i][j] = D[i + 4*N][j + k*N];\n }\n }\n addMatMat(E, mulMatMat(F, dp[4 - k]));\n }\n\n cout << E[C][0] << endl;\n}","accuracy":1,"time_ms":690,"memory_kb":4264,"score_of_the_acc":-0.301,"final_rank":11},{"submission_id":"aoj_2778_2030187","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n \n#define int long long\ntypedef pair<int,int>pint;\ntypedef vector<int>vint;\ntypedef vector<pint>vpint;\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\n \ntypedef vector<vint>mat;\nconst int mod=1000000007;\n \nmat mul(mat A,mat B){\n mat C(A.size(),vint(B[0].size()));\n rep(i,C.size()){\n rep(j,C[0].size()){\n rep(k,A[0].size()){\n (C[i][j]+=A[i][k]*B[k][j])%=mod;\n }\n }\n }\n return C;\n}\n \nmat mpow(mat A,int m){\n mat B(A.size(),vint(A.size()));\n rep(i,A.size())B[i][i]=1;\n for(;m;m>>=1,A=mul(A,A))if(m&1)B=mul(A,B);\n return B;\n}\n \nint N,K,C,T;\nint a[114514],b[114514],t[114514];\nsigned main(){\n cin>>N>>K>>C>>T;C--;\n rep(i,K)cin>>a[i]>>b[i]>>t[i],a[i]--;\n \n mat X(N*5,vint(1)),A(N*5,vint(N*5));\n X[C][0]=1;\n rep(i,N*4)A[N+i][i]=1;\n rep(k,K){\n int bb=(t[k]-1)*N;\n rep(i,N){\n if(i<a[k])A[i+b[k]][bb+i]++;\n else if(i<a[k]+b[k])A[i-a[k]][bb+i]++;\n else A[i][bb+i]++;\n }\n }\n \n \n X=mul(mpow(A,T),X);\n cout<<X[0][0]<<endl;\n return 0;\n}","accuracy":1,"time_ms":650,"memory_kb":4780,"score_of_the_acc":-0.3175,"final_rank":12},{"submission_id":"aoj_2778_1847138","code_snippet":"#include<bits/stdc++.h>\n\n#define rep(i,n) for(int i=0;i<(int)n;i++)\n#define all(c) (c).begin(),(c).end()\n#define mp make_pair\n#define pb push_back\n#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)\n#define dbg(x) cerr<<__LINE__<<\": \"<<#x<<\" = \"<<(x)<<endl\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pi;\nconst int inf = (int)1e9;\nconst double INF = 1e12, EPS = 1e-9;\n\nconst int mod = 1e9 + 7;\ntypedef vector<vi> M;\ninline M operator*(const M & a, const M &b){\n\tM c(a.size(), vi(b[0].size()));\n\trep(i, c.size()) rep(j, c[0].size()){\n\t\tll s = 0;\n\t\trep(k, a[0].size()) s += (ll)a[i][k] * b[k][j] % mod;\n\t\tc[i][j] = s % mod;\n\t}\n\treturn c;\n}\ninline M pow(M a, ll m){\n\tM res(a.size(), vi(a.size()));\n\trep(i, a.size()) res[i][i] = 1;\n\tfor(; m; m /= 2){\n\t\tif(m & 1) res = res * a;\n\t\ta = a * a;\n\t}\n\treturn res;\n}\n\nint n, K, c, T, a[1000], b[1000], t[1000];\nint dp[10][40];\n\n\nint main(){\n\tcin >> n >> K >> c >> T;\n\trep(i, K) cin >> a[i] >> b[i] >> t[i], a[i]--;\n\t\n\tM A(5 * n, vi(5 * n));\n\t\n\trep(s, 5 * n){\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[s / n][s % n] = 1;\n\t\trep(i, 5) rep(j, n) if(dp[i][j]) rep(k, K){\n\t\t\tint nj = j >= a[k] + b[k] ? j : j >= a[k] ? j - a[k] : j + b[k];\n\t\t\t(dp[i + t[k]][nj] += dp[i][j]) %= mod;\n\t\t}\n\t\tfor(int i = 5; i < 10; i++) rep(j, n) (A[(i - 5) * n + j][s] += dp[i][j]) %= mod;\n\t}\n\tA = pow(A, T / 5);\n\tM x(5 * n, vi(1));\n\tx[c - 1][0] = 1;\n\tx = A * x;\n\t\n\tmemset(dp, 0, sizeof(dp));\n\trep(i, 5 * n) dp[i / n][i % n] = x[i][0];\n\trep(i, 5) rep(j, n) if(dp[i][j]) rep(k, K){\n\t\tint nj = j >= a[k] + b[k] ? j : j >= a[k] ? j - a[k] : j + b[k];\n\t\t(dp[i + t[k]][nj] += dp[i][j]) %= mod;\n\t}\n\tcout << dp[T % 5][0] << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":310,"memory_kb":3688,"score_of_the_acc":-0.0954,"final_rank":1},{"submission_id":"aoj_2778_1703738","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef long long LL;\ntypedef pair<LL, LL> PLL;\n\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\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#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst LL MOD = 1e9+7;\n\ntypedef vector<LL> Col;\ntypedef vector<Col> Matrix;\nMatrix mul(const Matrix& A, const Matrix& B){\n const int R = A.size(), C = B[0].size(), sz = B.size();\n Matrix AB(R, Col(C));\n\n for(int i=0;i<R;++i)\n for(int j=0;j<C;++j)\n for(int k=0;k<sz;++k)\n\t\t(AB[i][j] += A[i][k] * B[k][j]) %= MOD;\n\n return AB;\n}\n\n// O(N^3 lgN)\nMatrix powA(const Matrix& A, int n){\n const int N = A.size();\n Matrix p(N, Col(N, 0)), w = A;\n for(int i=0;i<N;++i) p[i][i] = 1;\n\n while(n>0){\n\tif(n&1)\n\t p = mul(p, w);\n\tw = mul(w, w);\n\tn >>= 1;\n }\n\n return p;\n}\n\nvoid dump(const Matrix& A){\n REP(i,SZ(A)){\n\tREP(j,SZ(A[i]))\n\t cout << A[i][j] << (j%5==4?\" | \":\" \");\n\tcout << endl;\n\tif(i%5==4)cout<<string(SZ(A)+20,'-')<<endl;\n }\n}\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n int N, K, C, T; cin >> N >> K >> C >> T;\n --C;\n VI as(K), bs(K), ts(K);\n Matrix A(5*N, Col(5*N));\n REP(i,N) REP(t,4)\n\tA[5*i+t][5*i+t+1]++;\n\n REP(i,K){\n\tcin >> as[i] >> bs[i] >> ts[i];\n\t--as[i];\n\t--ts[i];\n\tfor(int k=0;k<bs[i];++k)\n\t A[k*5+ts[i]][(as[i]+k)*5]++;\n\tfor(int k=0;k<as[i];++k)\n\t A[(bs[i]+k)*5+ts[i]][k*5]++;\n\tfor(int k=as[i]+bs[i];k<N;++k)\n\t A[5*k+ts[i]][5*k]++;\n }\n\n A = powA(A, T);\n cout << A[0][5*C] << endl;\n \n return 0;\n}","accuracy":1,"time_ms":670,"memory_kb":4168,"score_of_the_acc":-0.2858,"final_rank":10},{"submission_id":"aoj_2778_1696692","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef complex<double> P;\ntypedef pair<int,int> pii;\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define REPR(i,n) for(ll i=1;i<n;++i)\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define ADD(a,b) a=((a)+(b))%MOD\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\nconst int mod = 1000000007;\nconst int logR = 30;\nconst int R = 1<<logR;\nconst int Rmask = R-1;\nconst int R2 = (int)((ll)R*R%mod);\nint modash;\nint MR(ll x){\n int m = (x*modash)&Rmask;\n int t = (x+(ll)m*mod)>>logR;\n if(t>=mod)t-=mod;\n return t;\n}\nint get_mod(ll x){return (int)MR((ll)MR(x)*R2);}\nvoid init(){\n // R=1ll;logR=0;modash=0;\n // while(R<mod){R<<=1;logR++;}\n // R2=R*R%mod;\n int t=0,r=R,i=1;\n while(r>1){\n if((t&1)==0){t+=mod;modash+=i;}\n t>>=1;r>>=1;i<<=1;\n }\n}\n\nvector<vl> mul(vector<vl> a, vector<vl> b){\n int n = a.size();\n vector<vl> ret(n,vl(n,0));\n REP(k,n)REP(i,n)REP(j,n){\n ret[i][j] += get_mod(a[i][k]*b[k][j]);\n if(ret[i][j]>=mod) ret[i][j] -= mod;\n }\n return ret;\n}\n\nint main(){\n int n,k,c,t;\n scanf(\"%d%d%d%d\",&n,&k,&c,&t);\n // ????§???????\n // 0?§???????1?§????...4?§????????£??????§??\\?????????????????°t?????§?????¨?????????\n vector<vl> mat(5*n,vl(5*n,0));\n // ??????????§?\n REP(i,4){\n REP(j,n) mat[i*n+j][(i+1)*n+j] += 1;\n }\n // ?????????????§?\n REP(_,k){\n int a,b,tm;\n scanf(\"%d%d%d\",&a,&b,&tm);\n // --a; --b;\n --tm;\n REP(i,n){\n int from;\n if(i<b) from = i+a-1;\n else if(i<b+a-1) from = i-b;\n else from = i;\n int to = i;\n mat[tm*n+to][from] += 1;\n }\n }\n // REP(po,5*n){\n // DEBUG_VEC(mat[po]);\n // }\n // cout<<endl;\n init();\n // ?´????\n vector<vl> ans(5*n,vl(5*n,0));\n REP(i,5*n) ans[i][i]=1;\n while(t){\n if(t&1) ans = mul(ans,mat);\n mat = mul(mat,mat);\n t>>=1;\n }\n // DEBUG\n // REP(po,5*n){\n // DEBUG_VEC(ans[po]);\n // }\n cout<<ans[0][c-1]<<endl;\n return 0;\n}","accuracy":1,"time_ms":2080,"memory_kb":2712,"score_of_the_acc":-0.8106,"final_rank":16},{"submission_id":"aoj_2778_1696674","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef complex<double> P;\ntypedef pair<int,int> pii;\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define REPR(i,n) for(ll i=1;i<n;++i)\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define ADD(a,b) a=((a)+(b))%MOD\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\nconst int mod = 1000000007;\nll R,R2,modash;\nint logR;\nll MR(ll x){\n ll ret = (x + (((x&(R-1ll))*modash)&(R-1ll))*mod)>>(logR);\n return (ret>=mod ? ret-mod : ret);\n}\nint get_mod(ll x){return (int)MR(MR(x)*R2);}\nvoid init(){\n R=1ll;logR=0;modash=0;\n while(R<mod){R<<=1;logR++;}\n R2=R*R%mod;\n int t=0,r=R,i=1;\n while(r>1){\n if((t&1)==0){t+=mod;modash+=i;}\n t>>=1;r>>=1;i<<=1;\n }\n}\n\nvector<vl> mul(vector<vl> a, vector<vl> b){\n int n = a.size();\n vector<vl> ret(n,vl(n,0));\n REP(k,n)REP(i,n)REP(j,n){\n ret[i][j] += get_mod(a[i][k]*b[k][j]);\n if(ret[i][j]>=mod) ret[i][j] -= mod;\n }\n return ret;\n}\n\nint main(){\n int n,k,c,t;\n scanf(\"%d%d%d%d\",&n,&k,&c,&t);\n // ????§???????\n // 0?§???????1?§????...4?§????????£??????§??\\?????????????????°t?????§?????¨?????????\n vector<vl> mat(5*n,vl(5*n,0));\n // ??????????§?\n REP(i,4){\n REP(j,n) mat[i*n+j][(i+1)*n+j] += 1;\n }\n // ?????????????§?\n REP(_,k){\n int a,b,tm;\n scanf(\"%d%d%d\",&a,&b,&tm);\n // --a; --b;\n --tm;\n REP(i,n){\n int from;\n if(i<b) from = i+a-1;\n else if(i<b+a-1) from = i-b;\n else from = i;\n int to = i;\n mat[tm*n+to][from] += 1;\n }\n }\n // REP(po,5*n){\n // DEBUG_VEC(mat[po]);\n // }\n // cout<<endl;\n init();\n // ?´????\n vector<vl> ans(5*n,vl(5*n,0));\n REP(i,5*n) ans[i][i]=1;\n while(t){\n if(t&1) ans = mul(ans,mat);\n mat = mul(mat,mat);\n t>>=1;\n }\n // DEBUG\n // REP(po,5*n){\n // DEBUG_VEC(ans[po]);\n // }\n cout<<ans[0][c-1]<<endl;\n return 0;\n}","accuracy":1,"time_ms":2510,"memory_kb":2712,"score_of_the_acc":-1,"final_rank":18},{"submission_id":"aoj_2778_1696663","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef complex<double> P;\ntypedef pair<int,int> pii;\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define REPR(i,n) for(ll i=1;i<n;++i)\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define ADD(a,b) a=((a)+(b))%MOD\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\nconst int mod = 1000000007;\nll R,R2,modash;\nint logR;\nll MR(ll x){\n ll ret = (x + ((x*modash)&(R-1ll))*mod)>>(logR);\n return (ret>=mod ? ret-mod : ret);\n}\nll get_mod(ll x){return MR(MR(x)*R2);}\nvoid init(){\n R=1ll;logR=0;modash=0;\n while(R<mod){R<<=1;logR++;}\n R2=R*R%mod;\n int t=0,r=R,i=1;\n while(r>1){\n if((t&1)==0){t+=mod;modash+=i;}\n t>>=1;r>>=1;i<<=1;\n }\n}\n\nvector<vl> mul(vector<vl> a, vector<vl> b){\n int n = a.size();\n vector<vl> ret(n,vl(n,0));\n REP(k,n)REP(i,n)REP(j,n){\n ret[i][j] += get_mod(a[i][k]*b[k][j]);\n if(ret[i][j]>=mod) ret[i][j] -= mod;\n }\n return ret;\n}\n\nint main(){\n int n,k,c,t;\n scanf(\"%d%d%d%d\",&n,&k,&c,&t);\n // ????§???????\n // 0?§???????1?§????...4?§????????£??????§??\\?????????????????°t?????§?????¨?????????\n vector<vl> mat(5*n,vl(5*n,0));\n // ??????????§?\n REP(i,4){\n REP(j,n) mat[i*n+j][(i+1)*n+j] += 1;\n }\n // ?????????????§?\n REP(_,k){\n int a,b,tm;\n scanf(\"%d%d%d\",&a,&b,&tm);\n // --a; --b;\n --tm;\n REP(i,n){\n int from;\n if(i<b) from = i+a-1;\n else if(i<b+a-1) from = i-b;\n else from = i;\n int to = i;\n mat[tm*n+to][from] += 1;\n }\n }\n // REP(po,5*n){\n // DEBUG_VEC(mat[po]);\n // }\n // cout<<endl;\n init();\n // ?´????\n vector<vl> ans(5*n,vl(5*n,0));\n REP(i,5*n) ans[i][i]=1;\n while(t){\n if(t&1) ans = mul(ans,mat);\n mat = mul(mat,mat);\n t>>=1;\n }\n // DEBUG\n // REP(po,5*n){\n // DEBUG_VEC(ans[po]);\n // }\n cout<<ans[0][c-1]<<endl;\n return 0;\n}","accuracy":1,"time_ms":2120,"memory_kb":2712,"score_of_the_acc":-0.8282,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_2778_10259979\",\n \"code_snippet\": \"// AOJ #2778 Destiny Draw\\n// 2025.3.2\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nconst long long MOD = 1000000007;\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n int n, K, C, T;\\n cin >> n >> K >> C >> T;\\n vector<vector<vector<long long>>> A(6, vector<vector<long long>>(n, vector<long long>(n, 0)));\\n for (int i = 0; i < K; i++){\\n int a, b, t;\\n cin >> a >> b >> t;\\n int a0 = a - 1;\\n for (int x = 0; x < n; x++){\\n int y;\\n if (x >= a0 && x < a0 + b) y = x - a0;\\n else if (x < a0) y = x + b;\\n else y = x;\\n A[t][y][x] = (A[t][y][x] + 1) % MOD;\\n }\\n }\\n int m = min(T, 5);\\n vector<vector<long long>> dp(m + 1, vector<long long>(n, 0));\\n dp[0][C - 1] = 1;\\n for (int t = 1; t <= m; t++){\\n for (int cost = 1; cost <= min(t, 5); cost++){\\n for (int i = 0; i < n; i++){\\n long long s = 0;\\n for (int j = 0; j < n; j++) s = (s + A[cost][i][j] * dp[t - cost][j]) % MOD;\\n dp[t][i] = (dp[t][i] + s) % MOD;\\n }\\n }\\n }\\n if (T <= 5){\\n cout << dp[T][0] << endl;\\n return 0;\\n }\\n int d = 5 * n;\\n vector<vector<long long>> M(d, vector<long long>(d, 0));\\n for (int j = 0; j < 5; j++){\\n for (int i = 0; i < n; i++){\\n for (int k = 0; k < n; k++) M[i][j * n + k] = A[j + 1][i][k] % MOD;\\n }\\n }\\n for (int j = 1; j < 5; j++){\\n for (int i = 0; i < n; i++) M[j * n + i][(j - 1) * n + i] = 1;\\n }\\n vector<long long> X(d, 0);\\n for (int i = 0; i < n; i++){\\n X[i] = dp[5][i];\\n X[n + i] = dp[4][i];\\n X[2 * n + i] = dp[3][i];\\n X[3 * n + i] = dp[2][i];\\n X[4 * n + i] = dp[1][i];\\n }\\n auto mulMat = [&](const vector<vector<long long>> &B, const vector<vector<long long>> &C) -> vector<vector<long long>> {\\n vector<vector<long long>> R(d, vector<long long>(d, 0));\\n for (int i = 0; i < d; i++){\\n for (int k = 0; k < d; k++){\\n if (B[i][k])\\n for (int j = 0; j < d; j++) R[i][j] = (R[i][j] + B[i][k] * C[k][j]) % MOD;\\n }\\n }\\n return R;\\n };\\n auto mulVec = [&](const vector<vector<long long>> &B, const vector<long long> &v) -> vector<long long> {\\n vector<long long> r(d, 0);\\n for (int i = 0; i < d; i++){\\n for (int j = 0; j < d; j++) r[i] = (r[i] + B[i][j] * v[j]) % MOD;\\n }\\n return r;\\n };\\n auto mpow = [&](long long p) -> vector<vector<long long>> {\\n vector<vector<long long>> R(d, vector<long long>(d, 0));\\n for (int i = 0; i < d; i++) R[i][i] = 1;\\n vector<vector<long long>> B = M;\\n while (p){\\n if (p & 1) R = mulMat(R, B);\\n B = mulMat(B, B);\\n p >>= 1;\\n }\\n return R;\\n };\\n vector<vector<long long>> Mexp = mpow(T - 5);\\n vector<long long> Y = mulVec(Mexp, X);\\n cout << Y[0] % MOD << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 4424,\n \"score_of_the_acc\": -0.1133,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2778_6942004\",\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=2167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=1e9+7;\\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\\\";}\\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\n\\n\\n\\ntemplate<class T>\\nusing square_matrix=std::vector<std::vector<T>>;\\ntemplate<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>\\nsquare_matrix<T> mul_matrix(square_matrix<T> l,square_matrix<T> r){\\n\\tint n=l.size();\\n\\tassert((int)l[0].size()==n&&(int)r.size()==n&&(int)r[0].size()==n);\\n\\tsquare_matrix<T> val(n,std::vector<T>(n,add_e()));\\n\\tfor(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++){\\n\\t\\tval[i][k]=add_op(val[i][k],mul_op(l[i][j],r[j][k]));\\n\\t}\\n\\treturn val;\\n}\\ntemplate<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>\\nsquare_matrix<T> pow_matrix(square_matrix<T> l,long long times){\\n\\tint n=l.size();\\n\\tsquare_matrix<T> val(n,std::vector<T>(n,add_e()));\\n\\tfor(int i=0;i<n;i++) val[i][i]=mul_e();\\n\\twhile(times){\\n\\t\\tif(times&1){\\n\\t\\t\\tval=mul_matrix<T,add_op,add_e,mul_op,mul_e>(val,l);\\n\\t\\t}\\n\\t\\tl=mul_matrix<T,add_op,add_e,mul_op,mul_e>(l,l);\\n\\t\\ttimes>>=1;\\n\\t}\\n\\treturn val;\\n}\\n\\nusing mat_F=ll;\\nmat_F add_op(mat_F a,mat_F b){\\n\\treturn (a+b)%mod;\\n}\\nmat_F add_e(){\\n\\treturn 0;\\n}\\nmat_F mul_op(mat_F a,mat_F b){\\n\\treturn (a*b)%mod;\\n}\\nmat_F mul_e(){\\n\\treturn 1;\\n}\\n#define calc mat_F,add_op,add_e,mul_op,mul_e\\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,C,T;\\n\\tcin>>N>>K>>C>>T;\\n\\tvector<vector<ll>> p(N*5,vector<ll>(N*5));\\n\\trep(i,N*4) p[i][i+N]=1;\\n\\trep(i,K){\\n\\t\\tll a,b,t;\\n\\t\\tcin>>a>>b>>t;\\n\\t\\ta--;t--;\\n\\t\\trep(j,N){\\n\\t\\t\\tif(j<a) p[N*t+j][j+b]++;\\n\\t\\t\\telse if(j<a+b) p[N*t+j][j-a]++;\\n\\t\\t\\telse p[N*t+j][j]++;\\n\\t\\t}\\n\\t}\\n\\tauto base=pow_matrix<calc>(p,T);\\n\\t//rep(i,N*5) vec_out(base[i]);\\n\\tcout<<base[C-1][0]<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 4960,\n \"score_of_the_acc\": -0.2325,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2778_5532971\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\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\\n Matrix trans() {\\n size_t m = height(), n = width();\\n Matrix res(n, m);\\n for (int i = 0; i < n; ++i)\\n for (int j = 0; j < m; ++j) res[i][j] = (*this)[j][i];\\n return res;\\n }\\n\\n Matrix inv() {\\n assert(height() == width());\\n size_t n = height();\\n Matrix B(n, 2 * n);\\n for (int i = 0; i < n; ++i) {\\n B[i][i + n] = 1;\\n for (int j = 0; j < n; ++j) B[i][j] = (*this)[i][j];\\n }\\n for (int i = 0; i < n; ++i) {\\n int piv = i;\\n for (int j = i; j < n; ++j)\\n if (abs(B[j][i]) > abs(B[piv][i])) piv = j;\\n // not exist or unique\\n assert(abs(B[piv][i]) >= 0);\\n swap(B[i], B[piv]);\\n for (int j = i + 1; j < 2 * n; ++j) B[i][j] /= B[i][i];\\n for (int j = 0; j < n; ++j)\\n if (i != j)\\n for (int k = i + 1; k < 2 * n; ++k) B[j][k] -= B[j][i] * B[i][k];\\n }\\n Matrix res(n);\\n for (int i = 0; i < n; ++i)\\n for (int j = 0; j < n; ++j) res[i][j] = B[i][j + n];\\n return res;\\n }\\n\\n T det() {\\n int m = height(), n = width();\\n assert(m == n);\\n T res = 1;\\n Matrix B(m);\\n for (int i = 0; i < m; ++i)\\n for (int j = 0; j < n; ++j) B[i][j] = (*this)[i][j];\\n for (int i = 0; i < n; ++i) {\\n int piv = i;\\n for (int j = i + 1; j < m; ++j)\\n if (B[j][i] != 0) {\\n piv = j;\\n break;\\n }\\n // if (abs(B[j][i]) > abs(B[piv][i])) piv = j;\\n if (B[piv][i] == 0) return (T)0;\\n // if (abs(B[piv][i]) < EPS) return (T)0; // B[piv][i] < EPS\\n if (piv != i) swap(B[i], B[piv]), res = -res;\\n res *= B[i][i];\\n // for (int j = i + 1; j < m; ++j)\\n // for (int k = n - 1; k >= i; --k) B[j][k] -= B[i][k] * B[j][i] /\\n // B[i][i];\\n {\\n const T d = (T)1 / B[i][i];\\n for (int j = i + 1; j < n; ++j) B[i][j] *= d;\\n for (int j = i + 1; j < m; ++j)\\n for (int k = i + 1; k < n; ++k) B[j][k] -= B[i][k] * B[j][i];\\n }\\n }\\n return res;\\n }\\n\\n T cofactor(int r = -1, int c = -1) {\\n int m = height(), n = width();\\n if (r < 0) r = c = m - 1;\\n assert(m == n && m > 1 && r < m && c < n);\\n Matrix mat(m - 1, n - 1);\\n for (int i = 0, rcnt = 0; i < m; ++i)\\n if (i != r) {\\n int ccnt = 0;\\n for (int j = 0; j < n; ++j)\\n if (j != c) mat[rcnt][ccnt++] = (*this)[i][j];\\n ++rcnt;\\n }\\n T res = mat.det();\\n if ((r ^ c) & 1) res *= -1;\\n return res;\\n }\\n\\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\\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};\\nusing mint = ModInt<>;\\n\\nint n, k, c, t;\\n\\nint main() {\\n cin >> n >> k >> c >> t;\\n Matrix<mint> mat(5 * n, 5 * n), st(5 * n, 1);\\n st[c - 1][0] = 1;\\n for (int i = 0; i < 4 * n; ++i) mat[i + n][i] = 1;\\n for (int i = 0; i < k; ++i) {\\n int a, b, p;\\n cin >> a >> b >> p, --a, --p;\\n p *= n;\\n for (int j = 0; j < a; ++j) mat[j + b][j + p] += 1;\\n for (int j = a; j < a + b; ++j) mat[j - a][j + p] += 1;\\n for (int j = a + b; j < n; ++j) mat[j][j + p] += 1;\\n }\\n mat ^= t;\\n mat *= st;\\n cout << mat[0][0] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 3924,\n \"score_of_the_acc\": -0.1111,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2778_5532751\",\n \"code_snippet\": \"#line 1 \\\"g.cpp\\\"\\n#pragma region Macros\\n#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#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__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()\\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(i, n) FOR(i, 0, n)\\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\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\n#pragma endregion Macros\\n\\n#line 1 \\\"/home/siro53/kyo-pro/compro_library/math/modint.hpp\\\"\\ntemplate <int mod> struct 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)\\n x -= mod;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod)\\n 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.inv();\\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 inv() 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 ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1)\\n ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\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 static int get_mod() { return mod; }\\n};\\n#line 70 \\\"g.cpp\\\"\\nusing mint = ModInt<MOD>;\\n#line 1 \\\"/home/siro53/kyo-pro/compro_library/math/matrix.hpp\\\"\\n// 行列ライブラリ\\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 // 単位行列\\n static Matrix I(size_t n) {\\n Matrix mat(n);\\n for(int i = 0; i < n; i++)\\n 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++)\\n (*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++)\\n (*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\\t\\tT sum;\\n for(int i = 0; i < n; i++){\\n for(int j = 0; j < m; j++){\\n\\t\\t\\t\\tsum = 0;\\n for(int k = 0; k < p; k++){\\n sum += (*this)[i][k] * B[k][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tC[i][j] = sum;\\n\\t\\t\\t}\\n\\t\\t}\\n A.swap(C);\\n return (*this);\\n }\\n\\n // 累乗\\n Matrix &operator^=(long long k) {\\n Matrix B = Matrix::I(height());\\n while(k > 0) {\\n if(k & 1)\\n 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++) {\\n os << p[i][j] << (j + 1 == m ? \\\"]\\\\n\\\" : \\\",\\\");\\n }\\n }\\n return (os);\\n }\\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)\\n idx = j;\\n }\\n if(idx == -1)\\n 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++) {\\n B[i][j] /= vv;\\n }\\n for(int j = i + 1; j < width(); j++) {\\n T a = B[j][i];\\n for(int k = 0; k < width(); k++) {\\n B[j][k] -= B[i][k] * a;\\n }\\n }\\n }\\n return (ret);\\n }\\n};\\n#line 72 \\\"g.cpp\\\"\\nusing matrix = Matrix<mint>;\\n\\nint main() {\\n int N, K, C, T;\\n cin >> N >> K >> C >> T;\\n vector<int> a(K), b(K), t(K);\\n REP(i, K) {\\n cin >> a[i] >> b[i] >> t[i];\\n a[i]--; t[i]--;\\n }\\n\\n matrix A(N*5, N*5);\\n REP(i, 4*N) A[i+N][i] = 1;\\n REP(from, N) {\\n REP(i, K) {\\n int to;\\n if(a[i] <= from and from <= a[i] + b[i] - 1) {\\n to = from - a[i];\\n }\\n else if(from < a[i]) {\\n to = from + b[i];\\n }\\n else {\\n to = from;\\n }\\n assert(0 <= from and from < N);\\n assert(0 <= to and to < N);\\n A[to][from + t[i] * N] += 1;\\n }\\n }\\n A ^= T;\\n\\n matrix B(5*N, 1);\\n B[C-1][0] = 1;\\n A *= B;\\n\\n mint ans = A[0][0]; \\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 3884,\n \"score_of_the_acc\": -0.1084,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2778_4926883\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing uint = unsigned;\\nusing ll = long long;\\n\\nuint mod = 1000000007;\\nstruct Modint{\\n uint x = 0;\\n Modint(const Modint& a): x(a.x){}\\n Modint(ll a){\\n a %= ll(mod);\\n if(a < 0) a += mod;\\n x = a;\\n }\\n Modint(){}\\n Modint& operator+=(const Modint& a){\\n x += a.x;\\n if(x >= mod) x -= mod;\\n return *this;\\n }\\n Modint& operator*=(const Modint& a){\\n x = uint64_t(x) * a.x % mod;\\n return *this;\\n }\\n Modint operator+(const Modint& a) const {\\n return Modint(*this) += a;\\n }\\n Modint operator*(const Modint& a) const {\\n return Modint(*this) *= a;\\n }\\n void operator++(int){\\n *this += 1;\\n }\\n};\\nstruct Matrix{\\n vector<vector<Modint>> x;\\n Matrix(ll n): x(n, vector<Modint>(n)){}\\n Matrix operator*(const Matrix& a) const {\\n const ll n = size();\\n Matrix ans(n);\\n for(ll i = 0; i < n; i++) for(ll j = 0; j < n; j++) for(ll k = 0; k < n; k++) ans[i][k] += x[i][j] * a[j][k];\\n return ans;\\n }\\n Matrix pow(ll x) const {\\n const ll n = size();\\n Matrix ans(n), a = *this;\\n for(ll i = 0; i < n; i++) ans[i][i] = 1;\\n while(x){\\n if(x & 1) ans = ans * a;\\n a = a * a;\\n x >>= 1;\\n }\\n return ans;\\n }\\n vector<Modint>& operator[](ll i){ return x[i]; }\\n const vector<Modint>& operator[](ll i) const { return x[i]; }\\n ll size() const { return x.size(); }\\n};\\nint main(){\\n ll n, k, c, t;\\n cin >> n >> k >> c >> t;\\n Matrix d(5 * n);\\n for(ll i = n; i < 5 * n; i++) d[i][i - n] = 1;\\n for(ll i = 0; i < k; i++){\\n ll a, b, t;\\n cin >> a >> b >> t;\\n a--; t--;\\n for(ll j = 0; j < a; j++) d[j][t * n + j + b]++;\\n for(ll j = a; j < a + b; j++) d[j][t * n + j - a]++;\\n for(ll j = a + b; j < n; j++) d[j][t * n + j]++;\\n }\\n c--;\\n Matrix a(5 * n);\\n a[0][c] = 1;\\n a = a * d.pow(t);\\n cout << a[0][0].x << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1310,\n \"memory_kb\": 4020,\n \"score_of_the_acc\": -0.5579,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2778_3968146\",\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// ModInt begin\\n\\nusing ll = long long;\\ntemplate<ll mod>\\nstruct ModInt {\\n ll v;\\n ll mod_pow(ll x, ll n) const {\\n return (!n) ? 1 : (mod_pow((x*x)%mod,n/2) * ((n&1)?x:1)) % mod;\\n }\\n ModInt(ll a = 0) : v((a %= mod) < 0 ? a + mod : a) {}\\n ModInt operator+ ( const ModInt& b ) const {\\n return (v + b.v >= mod ? ModInt(v + b.v - mod) : ModInt(v + b.v));\\n }\\n ModInt operator- () const {\\n return ModInt(-v);\\n }\\n ModInt operator- ( const ModInt& b ) const {\\n return (v - b.v < 0 ? ModInt(v - b.v + mod) : ModInt(v - b.v));\\n }\\n ModInt operator* ( const ModInt& b ) const {return (v * b.v) % mod;}\\n ModInt operator/ ( const ModInt& b ) const {return (v * mod_pow(b.v, mod-2)) % mod;}\\n \\n bool operator== ( const ModInt &b ) const {return v == b.v;}\\n bool operator!= ( const ModInt &b ) const {return !(*this == b); }\\n ModInt& operator+= ( const ModInt &b ) {\\n v += b.v;\\n if(v >= mod) v -= mod;\\n return *this;\\n }\\n ModInt& operator-= ( const ModInt &b ) {\\n v -= b.v;\\n if(v < 0) v += mod;\\n return *this;\\n }\\n ModInt& operator*= ( const ModInt &b ) {\\n (v *= b.v) %= mod;\\n return *this;\\n }\\n ModInt& operator/= ( const ModInt &b ) {\\n (v *= mod_pow(b.v, mod-2)) %= mod;\\n return *this;\\n }\\n ModInt pow(ll x) { return ModInt(mod_pow(v, x)); }\\n // operator int() const { return int(v); }\\n // operator long long int() const { return v; }\\n};\\n\\ntemplate<ll mod>\\nostream& operator<< (ostream& out, ModInt<mod> a) {return out << a.v;}\\ntemplate<ll mod>\\nistream& operator>> (istream& in, ModInt<mod>& a) {\\n in >> a.v;\\n return in;\\n}\\n\\n// ModInt end\\n\\n// 行列ライブラリ\\n\\n// size(): 行数を返す (列数は mat[0].size() で)\\n// 演算子: 複合代入 (+=, *=, -=), 単項 (-), 二項 (+, -, *, ==)\\n// eigen(N): N*N 単位行列を返す\\n// pow(mat, k): mat の k 乗を返す\\n\\ntemplate <typename T>\\nstruct Matrix {\\n vector< vector<T> > mat;\\n Matrix() {}\\n Matrix(int h, int w, T val = T(0)) : mat(h, vector<T>(w, val)) {}\\n size_t size() const { return mat.size(); }\\n const vector<T>& operator[](int i) const { return mat[i]; }\\n vector<T>& operator[](int i) { return mat[i]; }\\n\\n Matrix<T> &operator+=(const Matrix<T>& rhs) {\\n assert(mat.size() == rhs.size());\\n assert(mat[0].size() == rhs[0].size());\\n for(size_t i=0; i<mat.size(); i++) {\\n for(size_t j=0; j<mat[0].size(); j++) {\\n mat[i][j] += rhs[i][j];\\n }\\n }\\n return *this;\\n }\\n\\n Matrix<T> operator-() const {\\n Matrix<T> res(*this);\\n for(size_t i=0; i<res.size(); i++) {\\n for(size_t j=0; j<res[0].size(); j++) {\\n res[i][j] *= T(-1);\\n }\\n }\\n return res;\\n }\\n\\n Matrix<T>& operator-=(const Matrix<T>& rhs) {\\n return (Matrix<T>(*this) += -rhs);\\n }\\n\\n Matrix<T>& operator*=(const Matrix<T>& rhs) {\\n assert(mat[0].size() == rhs.size());\\n size_t H = mat.size(), W = rhs[0].size(), C = rhs.size();\\n Matrix<T> res(H, W);\\n for(size_t i=0; i<H; i++) {\\n for(size_t j=0; j<W; j++) {\\n for(size_t k=0; k<C; k++) {\\n res[i][j] += mat[i][k] * rhs[k][j];\\n }\\n }\\n }\\n this->mat = res.mat;\\n return *this;\\n }\\n\\n Matrix<T> operator+(const Matrix<T>& rhs) {\\n return (Matrix<T>(*this) += rhs);\\n }\\n\\n Matrix<T> operator*(const Matrix<T>& rhs) {\\n return (Matrix<T>(*this) *= rhs);\\n }\\n\\n Matrix<T> operator-(const Matrix<T> &rhs) {\\n return (Matrix<T>(*this) -= rhs);\\n }\\n\\n bool operator==(const Matrix<T> &rhs) const {\\n return this->mat == rhs.mat;\\n }\\n bool operator!=(const Matrix<T> &rhs) const {\\n return !(*this == rhs);\\n }\\n};\\n\\ntemplate <typename T>\\nMatrix<T> eigen(size_t N) {\\n Matrix<T> res(N, N, 0);\\n for(size_t i=0; i<N; i++) res[i][i] = T(1);\\n return res;\\n}\\n\\ntemplate <typename T>\\nMatrix<T> pow(Matrix<T> mat, long long int k) {\\n Matrix<T> res = eigen<T>(mat.size());\\n for(; k>0; k>>=1) {\\n if(k & 1) res *= mat;\\n mat *= mat;\\n }\\n return res;\\n}\\n\\ntemplate <typename T>\\nostream& operator<< (ostream& out, Matrix<T> mat) {\\n int H = mat.size(), W = mat[0].size();\\n out << \\\"[\\\" << endl;\\n for(int i=0; i<H; i++) {\\n out << \\\" [ \\\";\\n for(int j=0; j<W; j++) out << mat[i][j] << \\\" \\\";\\n out << \\\"]\\\" << endl;\\n }\\n out << \\\"]\\\" << endl;\\n return out;\\n}\\n\\nusing mint = ModInt<MOD>;\\nint main() {\\n int N, K, C, T; cin >> N >> K >> C >> T; C--;\\n\\n int M = 5 * N;\\n Matrix<mint> mat(M, M);\\n\\n auto get_idx = [&](int time, int pos) {\\n return time * N + pos;\\n };\\n\\n for(int i=0; i<K; i++) {\\n int a, b, t; cin >> a >> b >> t; a--;\\n int l = a, r = a + b;\\n vector<int> x, y;\\n for(int j=0; j<N; j++) {\\n if(l <= j and j < r) x.emplace_back(j);\\n else y.emplace_back(j);\\n }\\n\\n for(auto e : y) x.emplace_back(e);\\n for(int j=0; j<N; j++) {\\n int k = x[j]; // もともと k 番目だったものが j 番目に\\n for(int s=0; s<1; s++) {\\n int u = get_idx(s, j); // now\\n int v = get_idx(s+t-1, k); // prev\\n mat[u][v] += mint(1);\\n }\\n }\\n }\\n\\n for(int i=0; i<N; i++) {\\n for(int t=1; t<=4; t++) {\\n int u = get_idx(t, i); // now\\n int v = get_idx(t-1, i); // prev\\n mat[u][v] += mint(1);\\n }\\n }\\n\\n mat = pow(mat, T);\\n Matrix<mint> vec(M, 1);\\n vec[C][0] = mint(1);\\n\\n vec = mat * vec;\\n cout << vec[0][0] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1270,\n \"memory_kb\": 4212,\n \"score_of_the_acc\": -0.553,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2778_2738213\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\ntypedef vector<ll> V;\\ntypedef vector<V> MATRIX;\\n\\nint SIZE;\\nint base[40],work[40],next_loc[40];\\n\\nMATRIX calc(MATRIX left,MATRIX right){\\n\\n\\tMATRIX ret(SIZE,V(SIZE));\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\t\\tfor(int k = 0; k < SIZE; k++)ret[i][k] = 0;\\n\\t}\\n\\n\\tfor(int row = 0; row < SIZE; row++){\\n\\t\\tfor(int col = 0; col < SIZE; col++){\\n\\t\\t\\tfor(int a = 0; a < SIZE; a++){\\n\\t\\t\\t\\tret[row][col] += left[row][a]*right[a][col]%MOD;\\n\\t\\t\\t\\tret[row][col] %= MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n\\nMATRIX pow(MATRIX MULT,int count){\\n\\n\\tMATRIX ret(SIZE,V(SIZE));\\n\\n\\tfor(int row = 0; row < SIZE; row++){\\n\\t\\tfor(int col = 0; col < SIZE; col++){\\n\\t\\t\\tif(row == col)ret[row][col] = 1;\\n\\t\\t\\telse{\\n\\t\\t\\t\\tret[row][col] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\twhile(count > 0){\\n\\t\\tif(count%2 == 1)ret = calc(ret,MULT);\\n\\t\\tMULT = calc(MULT,MULT);\\n\\t\\tcount /= 2;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n\\nint main(){\\n\\n\\tint N,K,C,T;\\n\\tscanf(\\\"%d %d %d %d\\\",&N,&K,&C,&T);\\n\\tC--;\\n\\n\\tfor(int i = 0; i < N; i++)base[i] = i;\\n\\n\\tSIZE = 5*N;\\n\\n\\tMATRIX MULT(SIZE,V(SIZE));\\n\\tfor(int row = 0; row < SIZE; row++){\\n\\t\\tfor(int col = 0; col < SIZE; col++)MULT[row][col] = 0;\\n\\t}\\n\\n\\tint from,num,add_time;\\n\\tint work_index,base_row = 0,base_col;\\n\\n\\tfor(int loop = 0; loop < K; loop++){\\n\\t\\tscanf(\\\"%d %d %d\\\",&from,&num,&add_time);\\n\\t\\tfrom--;\\n\\n\\t\\twork_index = 0;\\n\\t\\tfor(int i = 0;i < num; i++){\\n\\t\\t\\twork[work_index++] = base[from+i];\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tif(i >= from && i <= from+num-1)continue;\\n\\t\\t\\twork[work_index++] = base[i];\\n\\t\\t}\\n\\n\\t\\tbase_col = N*(add_time-1);\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tMULT[base_row+work[i]][base_col+i]++;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(base_row = N; base_row <= 4*N; base_row += N){\\n\\t\\tfor(base_col = 0; base_col <= 4*N; base_col += N){\\n\\t\\t\\tif(base_row-N != base_col)continue;\\n\\t\\t\\tfor(int i = 0; i < N; i++)MULT[base_row+i][base_col+i] = 1;\\n\\t\\t}\\n\\t}\\n\\n\\tMULT = pow(MULT,T);\\n\\n\\tprintf(\\\"%lld\\\\n\\\",MULT[C][0]%MOD);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 4876,\n \"score_of_the_acc\": -0.3723,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2778_2558451\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define MOD 1000000007\\n\\ntypedef vector<vector<long>> mat;\\n\\n// return A*B\\nmat mat_mul(const mat &A, const mat &B){\\n int n=A.size(), m=B[0].size(), l=B.size();\\n mat ret(n, vector<long>(m, 0));\\n rep(i,n) rep(k,l) if(A[i][k]!=0) rep(j,m){\\n (ret[i][j] += A[i][k] * B[k][j]) %= MOD;\\n }\\n return ret;\\n}\\n\\n// A^p\\nmat mat_pow(const mat &A, long p){\\n int n = A.size();\\n mat tmp(A), ret(n, vector<long>(n,0));\\n rep(i,n) ret[i][i] = 1;\\n while(p>0){\\n if(p&1) ret = mat_mul(tmp, ret);\\n tmp = mat_mul(tmp, tmp);\\n p /= 2;\\n }\\n return ret;\\n}\\n\\nint main(){\\n int n,k,c,T;\\n cin>>n>>k>>c>>T;\\n c--;\\n\\n vector<int> a(k), b(k), t(k);\\n rep(i,k) cin>>a[i]>>b[i]>>t[i];\\n rep(i,k) a[i]--;\\n\\n int sz = 5*n;\\n\\n mat A(sz, vector<long>(sz, 0));\\n rep(i,n,sz){\\n A[i-n][i] += 1;\\n }\\n\\n rep(i,k){\\n rep(j,n){\\n int to = (t[i]-1)*n + j;\\n if(j < a[i]) to += b[i];\\n else if(j < a[i]+b[i]) to -= a[i];\\n A[to][j] += 1;\\n }\\n }\\n\\n A = mat_pow(A, T);\\n\\n cout << A[0][c] << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 4196,\n \"score_of_the_acc\": -0.1247,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2778_2558275\",\n \"code_snippet\": \"#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\\nusing vl = vector<ll>;\\nusing mat = vector<vl>;\\n\\nconst ll mod = 1e9+7;\\n\\nmat mul(const mat &a, const mat &b)\\n{\\n int n = a.size();\\n mat c(n,vl(n));\\n rep(i,n)rep(j,n)rep(k,n) (c[i][j]+=a[i][k]*b[k][j])%=mod;\\n return c;\\n}\\n\\nvl mul(const mat &a, const vl &b)\\n{\\n int n = a.size();\\n vl c(n);\\n rep(i,n)rep(j,n) (c[i]+=a[i][j]*b[j])%=mod;\\n return c;\\n}\\n\\nmat mat_pow(const mat &a, int T)\\n{\\n int n = a.size();\\n mat ret(n,vl(n));\\n rep(i,n) ret[i][i] = 1;\\n\\n mat p(a);\\n while(T)\\n {\\n if(T&1) ret = mul(ret,p);\\n p = mul(p,p);\\n T>>=1;\\n }\\n return ret;\\n}\\n\\nint main()\\n{\\n int n,k,C,T;\\n cin >>n >>k >>C >>T;\\n --C;\\n\\n vector<int> a(k),b(k),t(k);\\n rep(i,k)\\n {\\n cin >>a[i] >>b[i] >>t[i];\\n --a[i];\\n }\\n\\n int SZ = 5*n;\\n\\n mat A(SZ,vl(SZ));\\n // make A\\n for(int i=n; i<5*n; ++i) A[i-n][i] += 1;\\n rep(i,k)\\n {\\n rep(j,n)\\n {\\n int idx = (t[i]-1)*n+j;\\n if(j<a[i]) idx += b[i];\\n else if(j<a[i]+b[i]) idx -= a[i];\\n\\n A[idx][j] += 1;\\n }\\n }\\n\\n vl B(SZ);\\n B[C] = 1;\\n\\n vl res = mul(mat_pow(A,T),B);\\n cout << res[0] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 4180,\n \"score_of_the_acc\": -0.2778,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2778_2342162\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n\\nconst int mod = 1000000007;\\nstruct Mod {\\npublic:\\n\\tint num;\\n\\tMod() : Mod(0) { ; }\\n\\tMod(long long int n) : num((n % mod + mod) % mod) {\\n\\t\\tstatic_assert(mod<INT_MAX / 2, \\\"mod is too big, please make num 'long long int' from 'int'\\\");\\n\\t}\\n\\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\\n\\toperator int() { return num; }\\n};\\n\\nMod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\\nMod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\\nMod operator+(const Mod a, const long long int b) { return b + a; }\\nMod operator++(Mod &a) { return a + Mod(1); }\\nMod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\\nMod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\\nMod operator--(Mod &a) { return a - Mod(1); }\\nMod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\\nMod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\\nMod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\\nMod operator*(const Mod a, const int b) { return Mod(b)*a; }\\nMod operator+=(Mod &a, const Mod b) { return a = a + b; }\\nMod operator+=(long long int &a, const Mod b) { return a = a + b; }\\nMod operator-=(Mod &a, const Mod b) { return a = a - b; }\\nMod operator-=(long long int &a, const Mod b) { return a = a - b; }\\nMod operator*=(Mod &a, const Mod b) { return a = a * b; }\\nMod operator*=(long long int &a, const Mod b) { return a = a * b; }\\nMod operator*=(Mod& a, const long long int &b) { return a = a * b; }\\nMod operator^(const Mod a, const int n) {\\n\\tif (n == 0) return Mod(1);\\n\\tMod res = (a * a) ^ (n / 2);\\n\\tif (n % 2) res = res * a;\\n\\treturn res;\\n}\\nMod mod_pow(const Mod a, const long long int n) {\\n\\tif (n == 0) return Mod(1);\\n\\tMod res = mod_pow((a * a), (n / 2));\\n\\tif (n % 2) res = res * a;\\n\\treturn res;\\n}\\nMod inv(const Mod a) { return a ^ (mod - 2); }\\nMod operator/(const Mod a, const Mod b) {\\n\\tassert(b.num != 0);\\n\\treturn a * inv(b);\\n}\\nMod operator/(const long long int a, const Mod b) {\\n\\treturn Mod(a) / b;\\n}\\nMod operator/=(Mod &a, const Mod b) {\\n\\treturn a = a / b;\\n}\\n\\n#define MAX_MOD_N 1024000\\n\\nMod fact[MAX_MOD_N], factinv[MAX_MOD_N];\\nvoid init(const int amax = MAX_MOD_N) {\\n\\tfact[0] = Mod(1); factinv[0] = 1;\\n\\tfor (int i = 0; i < amax - 1; ++i) {\\n\\t\\tfact[i + 1] = fact[i] * Mod(i + 1);\\n\\t\\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\\n\\t}\\n}\\nMod comb(const int a, const int b) {\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\n\\n\\ntemplate<typename T>\\nvector<vector<T>> keisann(const vector<vector<T>>l, const vector<vector<T>>r) {\\n\\tvector<vector<T>>ans(l.size(), vector<T>(r[0].size()));\\n\\tassert(l[0].size() == r.size());\\n\\tfor (unsigned int h = 0; h < l.size(); ++h) {\\n\\t\\tfor (unsigned int i = 0; i < r.size(); ++i) {\\n\\t\\t\\tfor (unsigned int w = 0; w < r[0].size(); ++w) {\\n\\n\\t\\t\\t\\tans[h][w] += l[h][i] * r[i][w];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\ntemplate<typename T>\\nvector<vector<T>>powgyou(vector<vector<T>>a, const long long int n) {\\n\\tassert(a.size() == a[0].size());\\n\\tif (!n) {\\n\\t\\tvector<vector<T>>e(a.size(), vector<T>(a[0].size()));\\n\\t\\tfor (unsigned int i = 0; i < a.size(); ++i) {\\n\\t\\t\\te[i][i] = 1;\\n\\t\\t}\\n\\t\\treturn e;\\n\\t}\\n\\tif (n == 1)return a;\\n\\telse {\\n\\t\\tvector<vector<T>>ans(a.size(), vector<T>(a[0].size(), 0));\\n\\t\\tans = powgyou(a, n / 2);\\n\\t\\tans = keisann(ans, ans);\\n\\t\\tif (n % 2) {\\n\\t\\t\\tans = keisann(ans, a);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n\\nint main(){\\n\\tint N, K, C, T; cin >> N >> K >> C >> T;\\n\\t\\n\\tC--;\\n\\tvector<vector<Mod>>from(5*N, vector<Mod>(1));\\n\\tfrom[5*C][0]+=1;\\n\\tvector<vector<Mod>>gyou(5*N, vector<Mod>(5*N));\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tfor (int j = 0; j < 4; ++j) {\\n\\t\\t\\tgyou[5 * i + j][5 *i + j + 1] = 1;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < K; ++i) {\\n\\t\\tint a, b, t; cin >> a >> b >> t;\\n\\t\\ta--;\\n\\n\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\tconst int afrom = 5 * j;\\n\\t\\t\\tint to;\\n\\t\\t\\tif (j<a) {\\n\\t\\t\\t\\tto = 5 * (j + b) + t - 1;\\n\\t\\t\\t}\\n\\t\\t\\telse if ((j>a + b - 1)) {\\n\\t\\t\\t\\tto = afrom+t-1;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tto = 5 * (j - a) + t-1;\\n\\n\\t\\t\\t}\\n\\t\\t\\tgyou[to][afrom] += 1;\\n\\t\\t}\\n\\t}\\n\\tauto kake = powgyou(gyou,T);\\n\\tauto ans = keisann(kake, from);\\n\\tcout << ans[0][0] << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1170,\n \"memory_kb\": 17820,\n \"score_of_the_acc\": -1.4097,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2778_2270769\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n\\n#define rep(i,n) for(int i=0;i<(int)n;i++)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\nconst ll mod = 1000000007;\\nconst int tMAX = 5;\\n\\ninline void init(mat &A, int n, int m){\\n A = mat(n,vec(m,0));\\n}\\n\\ninline mat add(mat A, mat B){\\n mat res = A;\\n rep(i,A.size())rep(j,A[i].size())(res[i][j] += B[i][j]) %= mod;\\n return res;\\n}\\n\\ninline mat mul(mat A, mat B){\\n mat res; init(res,A.size(),B[0].size());\\n rep(i,A.size())rep(j,B[0].size()){\\n rep(k,B.size())res[i][j] += (A[i][k] * B[k][j]) % mod;\\n res[i][j] %= mod;\\n }\\n return res;\\n}\\n\\ninline mat pow_mat(mat &A, ll n){\\n if(n==1LL)return A;\\n mat B = pow_mat(A,n/2), res = mul(B,B);\\n if(n&1)res = mul(A,res);\\n return res;\\n}\\n\\nll N,K,C,T,tr;\\nll a, b, t;\\nvec shuffle(50), perm(50);\\nmat perm_mat[10], dp[500100], tmp;\\nmat large_mat, thin_mat;\\n\\nint main(){\\n cin >> N >> K >> C >> T;\\n\\n rep(i,tMAX+1)init(perm_mat[i],N,N);\\n rep(i,N)perm[i] = i;\\n\\n rep(i,K){\\n cin >> a >> b >> t;\\n rep(j,b)shuffle[j] = perm[j+a-1];\\n rep(j,a-1)shuffle[b+j] = perm[j];\\n for(int j=a+b-1;j<N;j++)shuffle[j] = perm[j];\\n rep(j,N)perm_mat[t][j][shuffle[j]]++;\\n }\\n\\n rep(i,tMAX+1)init(dp[i],N,N);\\n rep(i,N)dp[0][i][i] = 1;\\n \\n rep(i,tMAX)rep(j,tMAX){\\n if(i+j+1<=tMAX){\\n tmp = mul(perm_mat[j+1],dp[i]);\\n dp[i+j+1] = add(dp[i+j+1],tmp);\\n }\\n }\\n\\n init(large_mat,N*tMAX,N*tMAX);\\n rep(id,tMAX){\\n rep(i,N)rep(j,N)large_mat[i][j+id*N] = perm_mat[id+1][i][j];\\n }\\n rep(i,N*(tMAX-1))large_mat[i+N][i] = 1;\\n\\n init(thin_mat,N*tMAX,N);\\n rep(id,tMAX){\\n rep(i,N)rep(j,N)thin_mat[i+id*N][j] = dp[tMAX-1-id][i][j];\\n }\\n\\n tmp = pow_mat(large_mat,T);\\n cout << mul(tmp,thin_mat)[(tMAX-1)*N][C-1] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 16880,\n \"score_of_the_acc\": -1.0391,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2778_2161191\",\n \"code_snippet\": \"#include <valarray>\\n#include <vector>\\n#include <cstdio>\\nusing namespace std;\\ntypedef valarray<__int128_t>V;\\nint n,m=1000000007;\\nV z;\\nV &Me(const V &_x,const V &_y){\\n\\tint i=0,j;\\n\\tfor(;i<n;i++)for(j=0;j<n;j++)z[i*n+j]=(_x[slice(i*n,n,1)]*_y[slice(j,n,n)]).sum()%m;\\n\\treturn z;\\n}\\nV &Mx(const V &_x){\\n\\tint i=0,j;\\n\\tfor(;i<n;i++)for(j=0;j<n;j++)z[i*n+j]=(_x[slice(i*n,n,1)]*_x[slice(j,n,n)]).sum()%m;\\n\\treturn z;\\n}\\nint main(){\\n\\tint N,K,C,T;\\n\\tscanf(\\\"%d%d%d%d\\\",&N,&K,&C,&T);C--;\\n\\tvector<int>a(K),b(K),t(K);\\n\\tfor(int i=0;i<K;i++)scanf(\\\"%d%d%d\\\",&a[i],&b[i],&t[i]),a[i]--;\\n\\tn=N*5;\\n\\tV x(n*n);\\n\\tV e(n*n);\\n\\tz.resize(n*n);\\n\\tfor(int i=0;i<n;i++)e[i*n+i]=1;\\n\\tfor(int i=0;i<K;i++)for(int j=0;j<N;j++){\\n\\t\\tint nj=j<a[i]?j+b[i]:j<a[i]+b[i]?j-a[i]:j;\\n\\t\\tx[j*5*n+nj*5+t[i]-1]++;\\n\\t}\\n\\tfor(int i=0;i<N;i++)for(int j=1;j<5;j++)x[(i*5+j)*n+i*5+j-1]++;\\n\\tfor(;T;T>>=1){\\n\\t\\tif(T&1)e=Me(e,x);\\n\\t\\tx=Mx(x);\\n\\t}\\n\\tprintf(\\\"%lld\\\\n\\\",(long long)e[C*5*n]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 4236,\n \"score_of_the_acc\": -0.1802,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2778_2156949\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\\n \\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)\\n#define rrep(i,n) for (int i=(n)-1;i>=0;--i)\\n#define rrep2(i,a,b) for (int i=(a)-1;i>=b;--i)\\n#define chmin(a,b) (a)=min((a),(b));\\n#define chmax(a,b) (a)=max((a),(b));\\n#define all(a) (a).begin(),(a).end()\\n#define rall(a) (a).rbegin(),(a).rend()\\n#define printV(_v) cout<<(#_v)<<\\\":\\\";for(auto(_x):(_v)){cout<<\\\" \\\"<<(_x);}cout<<endl;\\n#define printVS(vs) cout<<(#vs)<<\\\":\\\"<<endl;for(auto(s):(vs)){cout<<(s)<< endl;}\\n#define printVV(vv) cout<<(#vv)<<\\\":\\\"<<endl;for(auto(v):(vv)){for(auto(x):(v)){cout<<\\\" \\\"<<(x);}cout<<endl;}\\n#define printP(p) cout<<(#p)<<(p).first<<\\\" \\\"<<(p).second<<endl;\\n#define printVP(vp) cout<<(#vp)<<\\\":\\\"<<endl;for(auto(p):(vp)){cout<<(p).first<<\\\" \\\"<<(p).second<<endl;}\\n \\ninline void output(){ cout << endl; }\\ntemplate<typename First, typename... Rest>\\ninline void output(const First& first, const Rest&... rest) {\\n cout << first << \\\" \\\"; output(rest...);\\n}\\n \\nusing ll = long long;\\nusing Pii = pair<int, int>;\\nusing TUPLE = tuple<int, int, int>;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nconst int inf = 1ll << 60;\\nconst int mod = 1e9 + 7;\\nusing Graph = vector<vector<int>>;\\n \\nusing Vec = vector<int>;\\nusing Mat = vector<Vec>;\\n \\nMat mulMatMat(const Mat& a, const Mat& b) {\\n int n = a.size();\\n int m = b[0].size();\\n assert(a[0].size() == b.size());\\n Mat c(n, Vec(m, 0));\\n rep(i, n) {\\n rep(j, m) {\\n rep(k, a[0].size()) {\\n (c[i][j] += a[i][k] * b[k][j]) %= mod;\\n }\\n }\\n }\\n return c;\\n}\\n \\nvoid addMatMat(Mat& a, const Mat& b) {\\n assert(a.size() == b.size());\\n assert(a[0].size() == b[0].size());\\n rep(i, a.size()) {\\n rep(j, a[0].size()) {\\n (a[i][j] += b[i][j]) %= mod;\\n }\\n }\\n}\\n \\nVec mulMatVec(const Mat& a, const Vec& v) {\\n int n = a.size();\\n assert(a[0].size() == v.size());\\n Vec c(n, 0);\\n rep(i, n) {\\n rep(j, a[0].size()) {\\n (c[i] += a[i][j] * v[j]) %= mod;\\n }\\n }\\n return c;\\n}\\n \\nMat identityMatrix(int n) {\\n Mat a(n, Vec(n));\\n rep(i, n) a[i][i] = 1;\\n return a;\\n}\\n \\nMat powMat(Mat a, int t) {\\n assert(a.size() == a[0].size());\\n Mat b = identityMatrix(a.size());\\n for (; t > 0; t >>= 1) {\\n if (t & 1) {\\n b = mulMatMat(a, b);\\n }\\n a = mulMatMat(a, a);\\n }\\n return b;\\n}\\n \\nmain() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(0);\\n \\n int N, K, C, T;\\n cin >> N >> K >> C >> T;\\n C--;\\n vector<Mat> A(5, Mat(N, Vec(N)));\\n rep(k, K) {\\n int a, b, t;\\n cin >> a >> b >> t;\\n a--; t--;\\n rep(i, a) A[t][i][i + b]++;\\n rep2(i, a, a + b) A[t][i][i - a]++;\\n rep2(i, a + b, N) A[t][i][i]++;\\n }\\n \\n // rep(t, 5) {\\n // printVV(A[t]);\\n // }\\n \\n Mat B(5*N, Vec(5*N));\\n rep(t, 5) {\\n rep(i, N) {\\n rep(j, N) {\\n B[i][j + t*N] = A[t][i][j];\\n }\\n }\\n }\\n rep(j, 4 * N) {\\n B[j + N][j] = 1;\\n }\\n \\n // printVV(B);\\n \\n vector<Mat> dp(5, Mat(N, Vec(N)));\\n dp[0] = identityMatrix(N);\\n rep2(i, 1, 5) {\\n rep(j, i) {\\n addMatMat(dp[i], mulMatMat(A[i - j - 1], dp[j]));\\n }\\n }\\n \\n // rep(t, 5) {\\n // printVV(dp[t]);\\n // }\\n \\n auto D = powMat(B, T);\\n \\n Mat E(N, Vec(N));\\n rep(k, 5) {\\n Mat F(N, Vec(N));\\n rep(i, N) {\\n rep(j, N) {\\n F[i][j] = D[i + 4*N][j + k*N];\\n }\\n }\\n addMatMat(E, mulMatMat(F, dp[4 - k]));\\n }\\n \\n cout << E[C][0] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 4212,\n \"score_of_the_acc\": -0.2843,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2778_2155036\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\\n\\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)\\n#define rrep(i,n) for (int i=(n)-1;i>=0;--i)\\n#define rrep2(i,a,b) for (int i=(a)-1;i>=b;--i)\\n#define chmin(a,b) (a)=min((a),(b));\\n#define chmax(a,b) (a)=max((a),(b));\\n#define all(a) (a).begin(),(a).end()\\n#define rall(a) (a).rbegin(),(a).rend()\\n#define printV(_v) cout<<(#_v)<<\\\":\\\";for(auto(_x):(_v)){cout<<\\\" \\\"<<(_x);}cout<<endl;\\n#define printVS(vs) cout<<(#vs)<<\\\":\\\"<<endl;for(auto(s):(vs)){cout<<(s)<< endl;}\\n#define printVV(vv) cout<<(#vv)<<\\\":\\\"<<endl;for(auto(v):(vv)){for(auto(x):(v)){cout<<\\\" \\\"<<(x);}cout<<endl;}\\n#define printP(p) cout<<(#p)<<(p).first<<\\\" \\\"<<(p).second<<endl;\\n#define printVP(vp) cout<<(#vp)<<\\\":\\\"<<endl;for(auto(p):(vp)){cout<<(p).first<<\\\" \\\"<<(p).second<<endl;}\\n\\ninline void output(){ cout << endl; }\\ntemplate<typename First, typename... Rest>\\ninline void output(const First& first, const Rest&... rest) {\\n cout << first << \\\" \\\"; output(rest...);\\n}\\n\\nusing ll = long long;\\nusing Pii = pair<int, int>;\\nusing TUPLE = tuple<int, int, int>;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nconst int inf = 1ll << 60;\\nconst int mod = 1e9 + 7;\\nusing Graph = vector<vector<int>>;\\n\\nusing Vec = vector<int>;\\nusing Mat = vector<Vec>;\\n\\nMat mulMatMat(const Mat& a, const Mat& b) {\\n int n = a.size();\\n int m = b[0].size();\\n assert(a[0].size() == b.size());\\n Mat c(n, Vec(m, 0));\\n rep(i, n) {\\n rep(j, m) {\\n rep(k, a[0].size()) {\\n (c[i][j] += a[i][k] * b[k][j]) %= mod;\\n }\\n }\\n }\\n return c;\\n}\\n\\nvoid addMatMat(Mat& a, const Mat& b) {\\n assert(a.size() == b.size());\\n assert(a[0].size() == b[0].size());\\n rep(i, a.size()) {\\n rep(j, a[0].size()) {\\n (a[i][j] += b[i][j]) %= mod;\\n }\\n }\\n}\\n\\nVec mulMatVec(const Mat& a, const Vec& v) {\\n int n = a.size();\\n assert(a[0].size() == v.size());\\n Vec c(n, 0);\\n rep(i, n) {\\n rep(j, a[0].size()) {\\n (c[i] += a[i][j] * v[j]) %= mod;\\n }\\n }\\n return c;\\n}\\n\\nMat identityMatrix(int n) {\\n Mat a(n, Vec(n));\\n rep(i, n) a[i][i] = 1;\\n return a;\\n}\\n\\nMat powMat(Mat a, int t) {\\n assert(a.size() == a[0].size());\\n Mat b = identityMatrix(a.size());\\n for (; t > 0; t >>= 1) {\\n if (t & 1) {\\n b = mulMatMat(a, b);\\n }\\n a = mulMatMat(a, a);\\n }\\n return b;\\n}\\n\\nmain() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(0);\\n\\n int N, K, C, T;\\n cin >> N >> K >> C >> T;\\n C--;\\n vector<Mat> A(5, Mat(N, Vec(N)));\\n rep(k, K) {\\n int a, b, t;\\n cin >> a >> b >> t;\\n a--; t--;\\n rep(i, a) A[t][i][i + b]++;\\n rep2(i, a, a + b) A[t][i][i - a]++;\\n rep2(i, a + b, N) A[t][i][i]++;\\n }\\n\\n // rep(t, 5) {\\n // printVV(A[t]);\\n // }\\n\\n Mat B(5*N, Vec(5*N));\\n rep(t, 5) {\\n rep(i, N) {\\n rep(j, N) {\\n B[i][j + t*N] = A[t][i][j];\\n }\\n }\\n }\\n rep(j, 4 * N) {\\n B[j + N][j] = 1;\\n }\\n\\n // printVV(B);\\n\\n vector<Mat> dp(5, Mat(N, Vec(N)));\\n dp[0] = identityMatrix(N);\\n rep2(i, 1, 5) {\\n rep(j, i) {\\n addMatMat(dp[i], mulMatMat(A[i - j - 1], dp[j]));\\n }\\n }\\n\\n // rep(t, 5) {\\n // printVV(dp[t]);\\n // }\\n\\n auto D = powMat(B, T);\\n\\n Mat E(N, Vec(N));\\n rep(k, 5) {\\n Mat F(N, Vec(N));\\n rep(i, N) {\\n rep(j, N) {\\n F[i][j] = D[i + 4*N][j + k*N];\\n }\\n }\\n addMatMat(E, mulMatMat(F, dp[4 - k]));\\n }\\n\\n cout << E[C][0] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 4264,\n \"score_of_the_acc\": -0.301,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2778_2030187\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n \\n#define int long long\\ntypedef pair<int,int>pint;\\ntypedef vector<int>vint;\\ntypedef vector<pint>vpint;\\n#define pb push_back\\n#define mp make_pair\\n#define fi first\\n#define se second\\n#define all(v) (v).begin(),(v).end()\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\\n \\ntypedef vector<vint>mat;\\nconst int mod=1000000007;\\n \\nmat mul(mat A,mat B){\\n mat C(A.size(),vint(B[0].size()));\\n rep(i,C.size()){\\n rep(j,C[0].size()){\\n rep(k,A[0].size()){\\n (C[i][j]+=A[i][k]*B[k][j])%=mod;\\n }\\n }\\n }\\n return C;\\n}\\n \\nmat mpow(mat A,int m){\\n mat B(A.size(),vint(A.size()));\\n rep(i,A.size())B[i][i]=1;\\n for(;m;m>>=1,A=mul(A,A))if(m&1)B=mul(A,B);\\n return B;\\n}\\n \\nint N,K,C,T;\\nint a[114514],b[114514],t[114514];\\nsigned main(){\\n cin>>N>>K>>C>>T;C--;\\n rep(i,K)cin>>a[i]>>b[i]>>t[i],a[i]--;\\n \\n mat X(N*5,vint(1)),A(N*5,vint(N*5));\\n X[C][0]=1;\\n rep(i,N*4)A[N+i][i]=1;\\n rep(k,K){\\n int bb=(t[k]-1)*N;\\n rep(i,N){\\n if(i<a[k])A[i+b[k]][bb+i]++;\\n else if(i<a[k]+b[k])A[i-a[k]][bb+i]++;\\n else A[i][bb+i]++;\\n }\\n }\\n \\n \\n X=mul(mpow(A,T),X);\\n cout<<X[0][0]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 4780,\n \"score_of_the_acc\": -0.3175,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2778_1847138\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define rep(i,n) for(int i=0;i<(int)n;i++)\\n#define all(c) (c).begin(),(c).end()\\n#define mp make_pair\\n#define pb push_back\\n#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)\\n#define dbg(x) cerr<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<(x)<<endl\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pi;\\nconst int inf = (int)1e9;\\nconst double INF = 1e12, EPS = 1e-9;\\n\\nconst int mod = 1e9 + 7;\\ntypedef vector<vi> M;\\ninline M operator*(const M & a, const M &b){\\n\\tM c(a.size(), vi(b[0].size()));\\n\\trep(i, c.size()) rep(j, c[0].size()){\\n\\t\\tll s = 0;\\n\\t\\trep(k, a[0].size()) s += (ll)a[i][k] * b[k][j] % mod;\\n\\t\\tc[i][j] = s % mod;\\n\\t}\\n\\treturn c;\\n}\\ninline M pow(M a, ll m){\\n\\tM res(a.size(), vi(a.size()));\\n\\trep(i, a.size()) res[i][i] = 1;\\n\\tfor(; m; m /= 2){\\n\\t\\tif(m & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t}\\n\\treturn res;\\n}\\n\\nint n, K, c, T, a[1000], b[1000], t[1000];\\nint dp[10][40];\\n\\n\\nint main(){\\n\\tcin >> n >> K >> c >> T;\\n\\trep(i, K) cin >> a[i] >> b[i] >> t[i], a[i]--;\\n\\t\\n\\tM A(5 * n, vi(5 * n));\\n\\t\\n\\trep(s, 5 * n){\\n\\t\\tmemset(dp, 0, sizeof(dp));\\n\\t\\tdp[s / n][s % n] = 1;\\n\\t\\trep(i, 5) rep(j, n) if(dp[i][j]) rep(k, K){\\n\\t\\t\\tint nj = j >= a[k] + b[k] ? j : j >= a[k] ? j - a[k] : j + b[k];\\n\\t\\t\\t(dp[i + t[k]][nj] += dp[i][j]) %= mod;\\n\\t\\t}\\n\\t\\tfor(int i = 5; i < 10; i++) rep(j, n) (A[(i - 5) * n + j][s] += dp[i][j]) %= mod;\\n\\t}\\n\\tA = pow(A, T / 5);\\n\\tM x(5 * n, vi(1));\\n\\tx[c - 1][0] = 1;\\n\\tx = A * x;\\n\\t\\n\\tmemset(dp, 0, sizeof(dp));\\n\\trep(i, 5 * n) dp[i / n][i % n] = x[i][0];\\n\\trep(i, 5) rep(j, n) if(dp[i][j]) rep(k, K){\\n\\t\\tint nj = j >= a[k] + b[k] ? j : j >= a[k] ? j - a[k] : j + b[k];\\n\\t\\t(dp[i + t[k]][nj] += dp[i][j]) %= mod;\\n\\t}\\n\\tcout << dp[T % 5][0] << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 3688,\n \"score_of_the_acc\": -0.0954,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2778_1703738\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef long long LL;\\ntypedef pair<LL, LL> PLL;\\n\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\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#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\n\\ntypedef vector<LL> Col;\\ntypedef vector<Col> Matrix;\\nMatrix mul(const Matrix& A, const Matrix& B){\\n const int R = A.size(), C = B[0].size(), sz = B.size();\\n Matrix AB(R, Col(C));\\n\\n for(int i=0;i<R;++i)\\n for(int j=0;j<C;++j)\\n for(int k=0;k<sz;++k)\\n\\t\\t(AB[i][j] += A[i][k] * B[k][j]) %= MOD;\\n\\n return AB;\\n}\\n\\n// O(N^3 lgN)\\nMatrix powA(const Matrix& A, int n){\\n const int N = A.size();\\n Matrix p(N, Col(N, 0)), w = A;\\n for(int i=0;i<N;++i) p[i][i] = 1;\\n\\n while(n>0){\\n\\tif(n&1)\\n\\t p = mul(p, w);\\n\\tw = mul(w, w);\\n\\tn >>= 1;\\n }\\n\\n return p;\\n}\\n\\nvoid dump(const Matrix& A){\\n REP(i,SZ(A)){\\n\\tREP(j,SZ(A[i]))\\n\\t cout << A[i][j] << (j%5==4?\\\" | \\\":\\\" \\\");\\n\\tcout << endl;\\n\\tif(i%5==4)cout<<string(SZ(A)+20,'-')<<endl;\\n }\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n int N, K, C, T; cin >> N >> K >> C >> T;\\n --C;\\n VI as(K), bs(K), ts(K);\\n Matrix A(5*N, Col(5*N));\\n REP(i,N) REP(t,4)\\n\\tA[5*i+t][5*i+t+1]++;\\n\\n REP(i,K){\\n\\tcin >> as[i] >> bs[i] >> ts[i];\\n\\t--as[i];\\n\\t--ts[i];\\n\\tfor(int k=0;k<bs[i];++k)\\n\\t A[k*5+ts[i]][(as[i]+k)*5]++;\\n\\tfor(int k=0;k<as[i];++k)\\n\\t A[(bs[i]+k)*5+ts[i]][k*5]++;\\n\\tfor(int k=as[i]+bs[i];k<N;++k)\\n\\t A[5*k+ts[i]][5*k]++;\\n }\\n\\n A = powA(A, T);\\n cout << A[0][5*C] << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 670,\n \"memory_kb\": 4168,\n \"score_of_the_acc\": -0.2858,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2778_1696692\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef complex<double> P;\\ntypedef pair<int,int> pii;\\n#define REP(i,n) for(ll i=0;i<n;++i)\\n#define REPR(i,n) for(ll i=1;i<n;++i)\\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\\n\\n#define DEBUG(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define DEBUG_VEC(v) cout<<#v<<\\\":\\\";REP(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl\\n#define ALL(a) (a).begin(),(a).end()\\n\\n#define ADD(a,b) a=((a)+(b))%MOD\\n#define FIX(a) ((a)%MOD+MOD)%MOD\\n\\nconst int mod = 1000000007;\\nconst int logR = 30;\\nconst int R = 1<<logR;\\nconst int Rmask = R-1;\\nconst int R2 = (int)((ll)R*R%mod);\\nint modash;\\nint MR(ll x){\\n int m = (x*modash)&Rmask;\\n int t = (x+(ll)m*mod)>>logR;\\n if(t>=mod)t-=mod;\\n return t;\\n}\\nint get_mod(ll x){return (int)MR((ll)MR(x)*R2);}\\nvoid init(){\\n // R=1ll;logR=0;modash=0;\\n // while(R<mod){R<<=1;logR++;}\\n // R2=R*R%mod;\\n int t=0,r=R,i=1;\\n while(r>1){\\n if((t&1)==0){t+=mod;modash+=i;}\\n t>>=1;r>>=1;i<<=1;\\n }\\n}\\n\\nvector<vl> mul(vector<vl> a, vector<vl> b){\\n int n = a.size();\\n vector<vl> ret(n,vl(n,0));\\n REP(k,n)REP(i,n)REP(j,n){\\n ret[i][j] += get_mod(a[i][k]*b[k][j]);\\n if(ret[i][j]>=mod) ret[i][j] -= mod;\\n }\\n return ret;\\n}\\n\\nint main(){\\n int n,k,c,t;\\n scanf(\\\"%d%d%d%d\\\",&n,&k,&c,&t);\\n // ????§???????\\n // 0?§???????1?§????...4?§????????£??????§??\\\\?????????????????°t?????§?????¨?????????\\n vector<vl> mat(5*n,vl(5*n,0));\\n // ??????????§?\\n REP(i,4){\\n REP(j,n) mat[i*n+j][(i+1)*n+j] += 1;\\n }\\n // ?????????????§?\\n REP(_,k){\\n int a,b,tm;\\n scanf(\\\"%d%d%d\\\",&a,&b,&tm);\\n // --a; --b;\\n --tm;\\n REP(i,n){\\n int from;\\n if(i<b) from = i+a-1;\\n else if(i<b+a-1) from = i-b;\\n else from = i;\\n int to = i;\\n mat[tm*n+to][from] += 1;\\n }\\n }\\n // REP(po,5*n){\\n // DEBUG_VEC(mat[po]);\\n // }\\n // cout<<endl;\\n init();\\n // ?´????\\n vector<vl> ans(5*n,vl(5*n,0));\\n REP(i,5*n) ans[i][i]=1;\\n while(t){\\n if(t&1) ans = mul(ans,mat);\\n mat = mul(mat,mat);\\n t>>=1;\\n }\\n // DEBUG\\n // REP(po,5*n){\\n // DEBUG_VEC(ans[po]);\\n // }\\n cout<<ans[0][c-1]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2080,\n \"memory_kb\": 2712,\n \"score_of_the_acc\": -0.8106,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2778_1696674\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef complex<double> P;\\ntypedef pair<int,int> pii;\\n#define REP(i,n) for(ll i=0;i<n;++i)\\n#define REPR(i,n) for(ll i=1;i<n;++i)\\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\\n\\n#define DEBUG(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define DEBUG_VEC(v) cout<<#v<<\\\":\\\";REP(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl\\n#define ALL(a) (a).begin(),(a).end()\\n\\n#define ADD(a,b) a=((a)+(b))%MOD\\n#define FIX(a) ((a)%MOD+MOD)%MOD\\n\\nconst int mod = 1000000007;\\nll R,R2,modash;\\nint logR;\\nll MR(ll x){\\n ll ret = (x + (((x&(R-1ll))*modash)&(R-1ll))*mod)>>(logR);\\n return (ret>=mod ? ret-mod : ret);\\n}\\nint get_mod(ll x){return (int)MR(MR(x)*R2);}\\nvoid init(){\\n R=1ll;logR=0;modash=0;\\n while(R<mod){R<<=1;logR++;}\\n R2=R*R%mod;\\n int t=0,r=R,i=1;\\n while(r>1){\\n if((t&1)==0){t+=mod;modash+=i;}\\n t>>=1;r>>=1;i<<=1;\\n }\\n}\\n\\nvector<vl> mul(vector<vl> a, vector<vl> b){\\n int n = a.size();\\n vector<vl> ret(n,vl(n,0));\\n REP(k,n)REP(i,n)REP(j,n){\\n ret[i][j] += get_mod(a[i][k]*b[k][j]);\\n if(ret[i][j]>=mod) ret[i][j] -= mod;\\n }\\n return ret;\\n}\\n\\nint main(){\\n int n,k,c,t;\\n scanf(\\\"%d%d%d%d\\\",&n,&k,&c,&t);\\n // ????§???????\\n // 0?§???????1?§????...4?§????????£??????§??\\\\?????????????????°t?????§?????¨?????????\\n vector<vl> mat(5*n,vl(5*n,0));\\n // ??????????§?\\n REP(i,4){\\n REP(j,n) mat[i*n+j][(i+1)*n+j] += 1;\\n }\\n // ?????????????§?\\n REP(_,k){\\n int a,b,tm;\\n scanf(\\\"%d%d%d\\\",&a,&b,&tm);\\n // --a; --b;\\n --tm;\\n REP(i,n){\\n int from;\\n if(i<b) from = i+a-1;\\n else if(i<b+a-1) from = i-b;\\n else from = i;\\n int to = i;\\n mat[tm*n+to][from] += 1;\\n }\\n }\\n // REP(po,5*n){\\n // DEBUG_VEC(mat[po]);\\n // }\\n // cout<<endl;\\n init();\\n // ?´????\\n vector<vl> ans(5*n,vl(5*n,0));\\n REP(i,5*n) ans[i][i]=1;\\n while(t){\\n if(t&1) ans = mul(ans,mat);\\n mat = mul(mat,mat);\\n t>>=1;\\n }\\n // DEBUG\\n // REP(po,5*n){\\n // DEBUG_VEC(ans[po]);\\n // }\\n cout<<ans[0][c-1]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2510,\n \"memory_kb\": 2712,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2778_1696663\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef complex<double> P;\\ntypedef pair<int,int> pii;\\n#define REP(i,n) for(ll i=0;i<n;++i)\\n#define REPR(i,n) for(ll i=1;i<n;++i)\\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\\n\\n#define DEBUG(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define DEBUG_VEC(v) cout<<#v<<\\\":\\\";REP(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl\\n#define ALL(a) (a).begin(),(a).end()\\n\\n#define ADD(a,b) a=((a)+(b))%MOD\\n#define FIX(a) ((a)%MOD+MOD)%MOD\\n\\nconst int mod = 1000000007;\\nll R,R2,modash;\\nint logR;\\nll MR(ll x){\\n ll ret = (x + ((x*modash)&(R-1ll))*mod)>>(logR);\\n return (ret>=mod ? ret-mod : ret);\\n}\\nll get_mod(ll x){return MR(MR(x)*R2);}\\nvoid init(){\\n R=1ll;logR=0;modash=0;\\n while(R<mod){R<<=1;logR++;}\\n R2=R*R%mod;\\n int t=0,r=R,i=1;\\n while(r>1){\\n if((t&1)==0){t+=mod;modash+=i;}\\n t>>=1;r>>=1;i<<=1;\\n }\\n}\\n\\nvector<vl> mul(vector<vl> a, vector<vl> b){\\n int n = a.size();\\n vector<vl> ret(n,vl(n,0));\\n REP(k,n)REP(i,n)REP(j,n){\\n ret[i][j] += get_mod(a[i][k]*b[k][j]);\\n if(ret[i][j]>=mod) ret[i][j] -= mod;\\n }\\n return ret;\\n}\\n\\nint main(){\\n int n,k,c,t;\\n scanf(\\\"%d%d%d%d\\\",&n,&k,&c,&t);\\n // ????§???????\\n // 0?§???????1?§????...4?§????????£??????§??\\\\?????????????????°t?????§?????¨?????????\\n vector<vl> mat(5*n,vl(5*n,0));\\n // ??????????§?\\n REP(i,4){\\n REP(j,n) mat[i*n+j][(i+1)*n+j] += 1;\\n }\\n // ?????????????§?\\n REP(_,k){\\n int a,b,tm;\\n scanf(\\\"%d%d%d\\\",&a,&b,&tm);\\n // --a; --b;\\n --tm;\\n REP(i,n){\\n int from;\\n if(i<b) from = i+a-1;\\n else if(i<b+a-1) from = i-b;\\n else from = i;\\n int to = i;\\n mat[tm*n+to][from] += 1;\\n }\\n }\\n // REP(po,5*n){\\n // DEBUG_VEC(mat[po]);\\n // }\\n // cout<<endl;\\n init();\\n // ?´????\\n vector<vl> ans(5*n,vl(5*n,0));\\n REP(i,5*n) ans[i][i]=1;\\n while(t){\\n if(t&1) ans = mul(ans,mat);\\n mat = mul(mat,mat);\\n t>>=1;\\n }\\n // DEBUG\\n // REP(po,5*n){\\n // DEBUG_VEC(ans[po]);\\n // }\\n cout<<ans[0][c-1]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2120,\n \"memory_kb\": 2712,\n \"score_of_the_acc\": -0.8282,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1668,"cells":{"group_id":{"kind":"string","value":"aoj_2780_cpp"},"problem_description":{"kind":"string","value":"Best Matched Pair\nYou are working for a worldwide game company as an engineer in Tokyo. This company holds an annual event for all the staff members of the company every summer. This year's event will take place in Tokyo. You will participate in the event on the side of the organizing staff. And you have been assigned to plan a recreation game which all the participants will play at the same time.\nAfter you had thought out various ideas, you designed the rules of the game as below.\nEach player is given a positive integer before the start of the game.\nEach player attempts to make a pair with another player in this game, and formed pairs compete with each other by comparing the products of two integers.\nEach player can change the partner any number of times before the end of the game, but cannot have two or more partners at the same time.\nAt the end of the game, the pair with the largest product wins the game.\nIn addition, regarding the given integers, the next condition must be satisfied for making a pair.\nThe sequence of digits obtained by considering the product of the two integers of a pair as a string must be increasing and consecutive from left to right. For example, 2, 23, and 56789 meet this condition, but 21, 334, 135 or 89012 do not.\nSetting the rules as above, you noticed that multiple pairs may be the winners who have the same product depending on the situation. However, you can find out what is the largest product of two integers when a set of integers is given.\nYour task is, given a set of distinct integers which will be assigned to the players, to compute the largest possible product of two integers, satisfying the rules of the game mentioned above.\nInput\nThe input consists of a single test case formatted as follows.\n$N$\n$a_1$ $a_2$ ... $a_N$\nThe first line contains a positive integer $N$ which indicates the number of the players of the game. $N$ is an integer between 1 and 1,000. The second line has $N$ positive integers that indicate the numbers given to the players. For $i = 1, 2, ... , N - 1$, there is a space between $a_i$ and $a_{i+1}$. $a_i$ is between 1 and 10,000 for $i = 1, 2, ..., N$, and if $i \\ne j$, then $a_i \\ne a_j$.\nOutput\nPrint the largest possible product of the two integers satisfying the conditions for making a pair. If any two players cannot make a pair, print -1.\nSample Input 1\n2\n1 2\nOutput for the Sample Input 1\n2\nSample Input 2\n3\n3 22 115\nOutput for the Sample Input 2\n345\nSample Input 3\n2\n1 11\nOutput for the Sample Input 3\n-1\nSample Input 4\n2\n5 27\nOutput for the Sample Input 4\n-1\nSample Input 5\n2\n17 53\nOutput for the Sample Input 5\n-1\nSample Input 6\n10\n53 43 36 96 99 2 27 86 93 23\nOutput for the Sample Input 6\n3456"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2780_10295740","code_snippet":"// AOJ #2780 Best Matched Pair\n// 2025.3.14\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\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\tpc('\\n');\n}\n\nbool valid(ll p) {\n string s = to_string(p);\n if(s.size() == 1) return true;\n for (size_t i = 0; i + 1 < s.size(); i++) {\n if(s[i+1] - s[i] != 1) return false;\n }\n return true;\n}\n\nint main(){\n int n = Cin();\n vector<int> v(n);\n for (int i = 0; i < n; i++) v[i] = Cin();\n\n ll ans = -1;\n for (int i = 0; i < n; i++){\n for (int j = i+1; j < n; j++){\n ll p = (ll)v[i] * v[j];\n if(valid(p)) ans = max(ans, p);\n }\n }\n Cout(ans);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3508,"score_of_the_acc":-0.4571,"final_rank":4},{"submission_id":"aoj_2780_10295739","code_snippet":"// AOJ #2780 Best Matched Pair\n// 2025.3.14\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nbool valid(ll p) {\n string s = to_string(p);\n if(s.size() == 1) return true;\n for (size_t i = 0; i + 1 < s.size(); i++) {\n if(s[i+1] - s[i] != 1) return false;\n }\n return true;\n}\n\nint main(){\n int n;\n cin >> n;\n vector<int> v(n);\n for (int i = 0; i < n; i++) cin >> v[i];\n\n ll ans = -1;\n for (int i = 0; i < n; i++){\n for (int j = i+1; j < n; j++){\n ll p = (ll)v[i] * v[j];\n if(valid(p)) ans = max(ans, p);\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3508,"score_of_the_acc":-0.4571,"final_rank":4},{"submission_id":"aoj_2780_10013939","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(a) a.begin(),a.end()\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\n#define rep(i, n) reps(i, 0, n)\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\nconst long long mod = 1000000007;\nconst long long INF = 1e18;\nll myceil(ll a, ll b) {return (a+b-1)/b;}\n\n\nvoid solve() {\n int n;\n cin >> n;\n vector<ll> v(n);\n rep(i,n) {\n cin >> v[i];\n }\n\n sort(all(v));\n reverse(all(v));\n\n int ans = -1;\n\n rep(i,n) {\n reps(j,i+1,n) {\n int x = v[i]*v[j];\n if (x < ans) break;\n\n string s = to_string(v[i]*v[j]);\n rep(ind,s.length()-1) {\n if (s[ind] != s[ind+1]-1) break;\n\n if (ind == s.length()-2) ans = x;\n }\n if (s.length() == 1) ans = x;\n }\n }\n\n cout << ans << endl;\n return;\n}\n\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int t = 1;\n //cin >> t;\n rep(i,t) {\n solve();\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3536,"score_of_the_acc":-0.6571,"final_rank":14},{"submission_id":"aoj_2780_9668990","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\nint main(){\n int N;cin>>N;\n vector<ll>A(N);\n REP(i,N)cin>>A[i];\n ll ans=-1;\n REP(i,N)REP(j,i){\n string s=to_string(A[i]*A[j]);\n bool ok=1;\n REP(k,s.size()-1)if(s[k+1]-s[k]!=1)ok=0;\n if(ok)ans=max(ans,A[i]*A[j]);\n }\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3532,"score_of_the_acc":-0.6286,"final_rank":11},{"submission_id":"aoj_2780_9578940","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\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;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n 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 == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\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}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nint main() {\n int N;\n cin >> N;\n vector<int> A(N);\n rep(i,0,N) cin >> A[i];\n int ANS = -1;\n rep(i,0,N) {\n rep(j,i+1,N) {\n int X = A[i] * A[j];\n string S = to_string(X);\n bool check = true;\n rep(k,0,S.size()-1) {\n if (S[k] + 1 != S[k+1]) check = false;\n }\n if (check) chmax(ANS,X);\n }\n }\n cout << ANS << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3584,"score_of_the_acc":-1,"final_rank":18},{"submission_id":"aoj_2780_9069657","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i, a, b) for(int i = (a); i < (b); i++)\n#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)\n#define SZ(a) int(a.size())\n#define ALL(a) a.begin(), a.end()\n#define PB push_back\n#define MP make_pair\n#define F first\n#define S second\n\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef pair<int, int> PII;\ntypedef double db;\n\nint main()\n{\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tint n;\n\tcin >> n;\n\tVI a(n);\n\tint ans = -1;\n\tFOR (i, 0, n)\n\t{\n\t\tcin >> a[i];\n\t\tFOR (j, 0, i)\n\t\t{\n\t\t\tint x = a[i] * a[j];\n\t\t\tstring s = to_string(x);\n\t\t\tbool ok = true;\n\t\t\tFOR (k, 0, SZ(s) - 1)\n\t\t\t{\n\t\t\t\tok &= (s[k + 1] - s[k]) == 1;\n\t\t\t}\n\t\t\tif (ok)\n\t\t\t\tans = max(ans, x);\n\t\t}\n\t}\n\tcout << ans << '\\n';\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3528,"score_of_the_acc":-0.6,"final_rank":10},{"submission_id":"aoj_2780_8618535","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n; std::cin >> n;\n std::vector<int> a(n);\n for (auto& x : a) std::cin >> x;\n int ans{-1};\n for (int i{} ; i < n ; i++) for (int j{i + 1} ; j < n ; j++) {\n int v{a[i] * a[j]};\n std::string t{std::to_string(v)};\n bool ok{true};\n for (int i{1} ; i < (int)t.size() ; i++) {\n ok &= t[i] == t[i - 1] + 1;\n }\n if (ok) ans = std::max(ans, v);\n }\n std::cout << ans << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":3516,"score_of_the_acc":-0.5143,"final_rank":8},{"submission_id":"aoj_2780_8528357","code_snippet":"#include <bits/stdc++.h>\n\nint main() {\n int n;\n std::cin >> n;\n std::vector<int> a(n);\n for (int i = 0; i < n; i++) std::cin >> a[i];\n int ans = -1;\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n int mul = a[i] * a[j];\n std::string s = std::to_string(mul);\n bool flag = true;\n for (int k = 0; k + 1 < (int)s.size(); k++) {\n if (s[k] != s[k + 1] - 1) {\n flag = false;\n break;\n }\n }\n if (flag) {\n ans = std::max(ans, mul);\n }\n }\n }\n std::cout << ans << std::endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3500,"score_of_the_acc":-0.4,"final_rank":2},{"submission_id":"aoj_2780_7916593","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntemplate<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}\ntemplate<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}\n\nbool solve(){\n return true;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n // while(1){\n // if(!solve()){\n // return 0;\n // }\n // }\n int N;\n cin>>N;\n vector<int>A(N);\n for(int i=0;i<N;i++)cin>>A[i];\n int ans=-1;\n for(int i=0;i<N-1;i++)for(int j=i+1;j<N;j++){\n string s=to_string(A[i]*A[j]);\n int n=s.size();\n bool ok=true;\n for(int k=0;k<n-1;k++){\n if(s[k+1]-s[k]!=1){\n ok=false;\n break;\n }\n }\n if(ok)chmax(ans,A[i]*A[j]);\n }\n cout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":20,"memory_kb":3532,"score_of_the_acc":-0.6286,"final_rank":11},{"submission_id":"aoj_2780_7304906","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(){\n int n; cin >> n;\n vector<int> a(n);\n for(auto &it: a) cin >> it;\n\n int ans = -1;\n for(int i = 0; i < n; i++){\n for(int j = i+1; j < n; j++){\n int x = a[i]*a[j];\n int y = x;\n vector<int> v;\n while(y > 0){\n v.emplace_back(y%10);\n y /= 10;\n }\n bool isok = true;\n for(int k = 1; k < v.size(); k++){\n if(v[k-1] != v[k]+1) isok = false;\n }\n if(isok && ans < x) ans = x;\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3444,"score_of_the_acc":-0.3333,"final_rank":1},{"submission_id":"aoj_2780_7164029","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define repn(i,end) for(int i = 0; i <= (int)(end); i++)\n#define reps(i,start,end) for(int i = start; i < (int)(end); i++)\n#define repsn(i,start,end) for(int i = start; i <= (int)(end); i++)\n#define ll long long\n#define print(t) cout << t << endl \n#define all(a) (a).begin(),(a).end()\n// << std::fixed << std::setprecision(0)\nconst ll INF = 1LL << 60;\n \ntemplate<class T> void chmin(T& a, T b){\n if(a > b){\n a = b;\n }\n}\n \ntemplate<class T> void chmax(T& a, T b){\n if(a < b){\n a = b;\n }\n}\n \nll lpow(ll x,ll n){\n ll ans = 1;\n while(n >0){\n if(n & 1)ans *= x;\n x *= x;\n n >>= 1;\n }\n return ans;\n}\n \nint main(){\n ll n;cin >> n;\n vector<ll> a(n);\n rep(i,n)cin >> a[i];\n sort(all(a));\n\n for(ll i = n-1;i >= 1;i--){\n for(ll j = i-1;j>= 0;j--){\n ll b = a[i] * a[j];\n string s = to_string(b);\n bool ok = true;\n rep(k,(int)s.size()-1){\n if(s[k+1] !=s[k] + 1){\n ok = false;\n break;\n }\n }\n if(ok){\n cout << b << endl;\n return 0;\n }\n\n }\n }\n cout << -1 << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3516,"score_of_the_acc":-0.5143,"final_rank":8},{"submission_id":"aoj_2780_7102458","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define REP(i, a, b) for (ll i = a; i < (ll)(b); i++)\n#define all(v) v.begin(), v.end()\n#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf\n#define INF 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf\n\nint main(){\n ll N;\n cin>>N;\n vector<ll> a(N);\n rep(i,N){\n cin>>a[i];\n }\n ll ans=-1;\n string judge;\n bool flag;\n rep(i,N){\n REP(j,i+1,N){\n judge=to_string(a[i]*a[j]);\n flag=true;\n rep(k,judge.size()-1){\n if((judge[k+1]-'0')!=(judge[k]-'0'+1)){\n flag=false;\n break;\n }\n }\n if(flag&&stoll(judge)>ans)ans=stoll(judge);\n }\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3548,"score_of_the_acc":-1.0762,"final_rank":19},{"submission_id":"aoj_2780_6634187","code_snippet":"#line 2 \"library/KowerKoint/base.hpp\"\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#endif\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i, n) for(int i = 0; i < (int)(n); i++)\n#define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++)\n#define ALL(a) (a).begin(),(a).end()\n#define END(...) { print(__VA_ARGS__); return; }\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VVVI = vector<VVI>;\nusing ll = long long;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VVVL = vector<VVL>;\nusing VD = vector<double>;\nusing VVD = vector<VD>;\nusing VVVD = vector<VVD>;\nusing VS = vector<string>;\nusing VVS = vector<VS>;\nusing VVVS = vector<VVS>;\nusing VC = vector<char>;\nusing VVC = vector<VC>;\nusing VVVC = vector<VVC>;\nusing P = pair<int, int>;\nusing VP = vector<P>;\nusing VVP = vector<VP>;\nusing VVVP = vector<VVP>;\nusing LP = pair<ll, ll>;\nusing VLP = vector<LP>;\nusing VVLP = vector<VLP>;\nusing VVVLP = vector<VVLP>;\n\ntemplate <typename T>\nusing PQ = priority_queue<T>;\ntemplate <typename T>\nusing GPQ = priority_queue<T, vector<T>, greater<T>>;\n\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr int DX[] = {1, 0, -1, 0};\nconstexpr int DY[] = {0, 1, 0, -1};\n\nvoid print() { cout << '\\n'; }\ntemplate<typename T>\nvoid print(const T &t) { cout << t << '\\n'; }\ntemplate<typename Head, typename... Tail>\nvoid print(const Head &head, const Tail &... tail) {\n cout << head << ' ';\n print(tail...);\n}\n\n#ifdef DEBUG\nvoid dbg() { cerr << '\\n'; }\ntemplate<typename T>\nvoid dbg(const T &t) { cerr << t << '\\n'; }\ntemplate<typename Head, typename... Tail>\nvoid dbg(const Head &head, const Tail &... tail) {\n cerr << head << ' ';\n dbg(tail...);\n}\n#else\ntemplate<typename... Args>\nvoid dbg(const Args &... args) {}\n#endif\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 != (int) 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 T>\nvector<vector<T>> split(typename vector<T>::const_iterator begin, typename vector<T>::const_iterator end, T val) {\n vector<vector<T>> res;\n vector<T> cur;\n for(auto it = begin; it != end; it++) {\n if(*it == val) {\n res.push_back(cur);\n cur.clear();\n } else cur.push_back(val);\n }\n res.push_back(cur);\n return res;\n}\n\nvector<string> split(typename string::const_iterator begin, typename string::const_iterator end, char val) {\n vector<string> res;\n string cur = \"\";\n for(auto it = begin; it != end; it++) {\n if(*it == val) {\n res.push_back(cur);\n cur.clear();\n } else cur.push_back(val);\n }\n res.push_back(cur);\n return res;\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>\npair<VI, vector<T>> compress(const vector<T> &a) {\n int n = a.size();\n vector<T> x;\n REP(i, n) x.push_back(a[i]);\n sort(ALL(x)); x.erase(unique(ALL(x)), x.end());\n VI res(n);\n REP(i, n) res[i] = lower_bound(ALL(x), a[i]) - x.begin();\n return make_pair(res, x);\n}\n\ntemplate <typename It>\nauto rle(It begin, It end) {\n vector<pair<typename It::value_type, int>> res;\n if(begin == end) return res;\n auto pre = *begin;\n int num = 1;\n for(auto it = begin + 1; it != end; it++) {\n if(pre != *it) {\n res.emplace_back(pre, num);\n pre = *it;\n num = 1;\n } else num++;\n }\n res.emplace_back(pre, num);\n return res;\n}\n\nvector<pair<char, int>> rle(string s) {\n return rle(ALL(s));\n}\n\ntemplate <typename T>\npair<vector<T>, vector<T>> factorial(int n) {\n vector<T> res(n+1), rev(n+1);\n res[0] = 1;\n REP(i, n) res[i+1] = res[i] * (i+1);\n rev[n] = 1 / res[n];\n for(int i = n; i > 0; i--) {\n rev[i-1] = rev[i] * i;\n }\n return make_pair(res, rev);\n}\n#line 3 \"library/KowerKoint/internal_operator.hpp\"\n\nnamespace internal_operator {\n template <typename T>\n T default_add(T a, T b) { return a + b; }\n template <typename T>\n T default_sub(T a, T b) { return a - b; }\n template <typename T>\n T zero() { return T(0); }\n template <typename T>\n T default_div(T a, T b) { return a / b; }\n template <typename T>\n T default_mult(T a, T b) { return a * b; }\n template <typename T>\n T one() { return T(1); }\n template <typename T>\n T default_xor(T a, T b) { return a ^ b; }\n template <typename T>\n T default_and(T a, T b) { return a & b; }\n template <typename T>\n T default_or(T a, T b) { return a | b; }\n ll mod3() { return 998244353LL; }\n ll mod7() { return 1000000007LL; }\n ll mod9() { return 1000000009LL; }\n template <typename T>\n T default_max(T a, T b) { return max(a, b); }\n template <typename T>\n T default_min(T a, T b) { return min(a, b); }\n}\n\n#line 3 \"library/KowerKoint/integer.hpp\"\n\nll kth_root(ll x, ll k) {\n if(k == 1) return x;\n ll res = 0;\n for(int i = 31; i >= 0; i--) {\n bool over = false;\n ll tmp = 1;\n ll nxt = res | 1LL << i;\n REP(i, k) {\n if(tmp > x / nxt) {\n over = true;\n break;\n }\n tmp *= nxt;\n }\n if(!over) res = nxt;\n }\n return res;\n}\n\nll sqrt(ll x) {\n return kth_root(x, 2);\n}\n\nstruct Prime {\n VI sieved;\n VL primes;\n\n Prime() {}\n Prime(ll n) {\n expand(n);\n }\n\n void expand(ll n) {\n ll sz = (ll)sieved.size() - 1;\n if(n <= sz) return;\n sieved.resize(n+1);\n sieved[0] = sieved[1] = 1;\n primes.clear();\n primes.push_back(2);\n for(ll d = 4; d <= n; d += 2) sieved[d] = 1;\n FOR(d, 3, n+1) {\n if(!sieved[d]) {\n primes.push_back(d);\n for(ll i = d*d; i <= n; i += d*2) sieved[i] = 1;\n }\n }\n }\n\n bool is_prime(ll n) {\n assert(n > 0);\n if(n <= (ll)sieved.size() - 1) return !sieved[n];\n for(ll d = 2; d*d <= n; d++) {\n if(n % d == 0) return false;\n }\n return true;\n }\n\n VL least_prime_factors(ll n) {\n assert(n > 0);\n VL lpfs(n+1, -1), primes;\n FOR(d, 2, n+1) {\n if(lpfs[d] == -1) {\n lpfs[d] = d;\n primes.push_back(d);\n }\n for(ll p : primes) {\n if(p * d > n || p > lpfs[d]) break;\n lpfs[p*d] = p;\n }\n }\n return lpfs;\n }\n\n VL prime_list(ll n) {\n assert(n > 0);\n expand(n);\n return VL(primes.begin(), upper_bound(ALL(primes), n));\n }\n\n vector<pair<ll, int>> prime_factor(ll n) {\n assert(n > 0);\n vector<pair<ll, int>> factor;\n expand(sqrt(n));\n for(ll prime : primes) {\n if(prime * prime > n) break;\n int cnt = 0;\n while(n % prime == 0) {\n n /= prime;\n cnt++;\n }\n if(cnt) factor.emplace_back(prime, cnt);\n }\n if(n > 1) factor.emplace_back(n, 1);\n return factor;\n }\n\n\n VL divisor(ll n) {\n assert(n > 0);\n auto factor = prime_factor(n);\n VL res = {1};\n for(auto [prime, cnt] : factor) {\n int sz = res.size();\n res.resize(sz * (cnt+1));\n REP(i, sz*cnt) res[sz+i] = res[i] * prime;\n REP(i, cnt) inplace_merge(res.begin(), res.begin() + sz*(i+1), res.begin() + sz*(i+2));\n }\n return res;\n }\n};\n\nll extgcd(ll a, ll b, ll& x, ll& y) {\n x = 1, y = 0;\n ll nx = 0, ny = 1;\n while(b) {\n ll q = a / b;\n tie(a, b) = LP(b, a % b);\n tie(x, nx) = LP(nx, x - nx*q);\n tie(y, ny) = LP(ny, y - ny*q);\n }\n return a;\n}\n\nll inv_mod(ll n, ll m) {\n ll x, y;\n assert(extgcd(n, m, x, y) == 1);\n x %= m;\n if(x < 0) x += m;\n return x;\n}\n\nll pow_mod(ll a, ll n, ll m) {\n if(n == 0) return 1LL;\n if(n < 0) return inv_mod(pow_mod(a, -n, m), m);\n ll res = 1;\n while(n) {\n if(n & 1) {\n res *= a;\n res %= m;\n }\n n >>= 1;\n a *= a;\n a %= m;\n }\n return res;\n}\n\n#line 5 \"library/KowerKoint/modint.hpp\"\n\ntemplate <ll (*mod)()>\nstruct Modint {\n ll val;\n \n Modint(): val(0) {}\n\n Modint(ll x): val(x) {\n val %= mod();\n if(val < 0) val += mod();\n }\n\n Modint& operator+=(const Modint& r) {\n val += r.val;\n if(val >= mod()) val -= mod();\n return *this;\n }\n friend Modint operator+(const Modint& l, const Modint& r) {\n return Modint(l) += r;\n }\n\n Modint& operator-=(const Modint& r) {\n val -= r.val;\n if(val < 0) val += mod();\n return *this;\n }\n friend Modint operator-(const Modint& l, const Modint& r) {\n return Modint(l) -= r;\n }\n\n Modint& operator*=(const Modint& r) {\n val *= r.val;\n val %= mod();\n return *this;\n }\n Modint operator*(const Modint& r) {\n return (Modint(*this) *= r);\n }\n friend Modint operator*(const Modint& l, const Modint& r) {\n return Modint(l) *= r;\n }\n\n Modint pow(ll n) const {\n return Modint(pow_mod(val, n, mod()));\n }\n\n Modint inv() const {\n return Modint(inv_mod(val, mod()));\n }\n\n Modint& operator/=(const Modint& r) {\n return (*this *= r.inv());\n }\n friend Modint operator/(const Modint& l, const Modint& r) {\n return Modint(l) /= r;\n }\n\n Modint& operator^=(const ll n) {\n val = pow_mod(val, n, mod());\n return *this;\n }\n Modint operator^(const ll n) {\n return this->pow(n);\n }\n\n Modint operator+() const { return *this; }\n Modint operator-() const { return Modint() - *this; }\n\n Modint& operator++() {\n val++;\n if(val == mod()) val = 0LL;\n return *this;\n }\n Modint& operator++(int) {\n Modint res(*this);\n ++*this;\n return res;\n }\n\n Modint& operator--() {\n if(val == 0LL) val = mod();\n val--;\n return *this;\n }\n Modint& operator--(int) {\n Modint res(*this);\n --*this;\n return res;\n }\n\n friend bool operator==(const Modint& l, const Modint& r) {\n return l.val == r.val;\n }\n friend bool operator!=(const Modint& l, const Modint& r) {\n return l.val != r.val;\n }\n\n static pair<vector<Modint>, vector<Modint>> factorial(int n) {\n vector<Modint> fact(n+1), rfact(n+1);\n fact[0] = 1;\n REP(i, n) fact[i+1] = fact[i] * (i+1);\n rfact[n] = 1 / fact[n];\n for(int i = n-1; i >= 0; i--) rfact[i] = rfact[i+1] * (i+1);\n return {fact, rfact};\n }\n\n friend istream& operator>>(istream& is, Modint& mi) {\n is >> mi.val;\n return is;\n }\n\n friend ostream& operator<<(ostream& os, const Modint& mi) {\n os << mi.val;\n return os;\n }\n};\n\nusing MI3 = Modint<internal_operator::mod3>;\nusing V3 = vector<MI3>;\nusing VV3 = vector<V3>;\nusing VVV3 = vector<VV3>;\nusing MI7 = Modint<internal_operator::mod7>;\nusing V7 = vector<MI7>;\nusing VV7 = vector<V7>;\nusing VVV7 = vector<VV7>;\nusing MI9 = Modint<internal_operator::mod9>;\nusing V9 = vector<MI9>;\nusing VV9 = vector<V9>;\nusing VVV9 = vector<VV9>;\n#line 3 \"library/KowerKoint/counting.hpp\"\n\ntemplate <typename T>\nstruct Counting {\n vector<T> fact, ifact;\n\n Counting() {}\n Counting(ll n) {\n expand(n);\n }\n\n void expand(ll n) {\n ll sz = (ll)fact.size();\n if(sz > n) return;\n fact.resize(n+1);\n ifact.resize(n+1);\n fact[0] = 1;\n FOR(i, max(1LL, sz), n+1) fact[i] = fact[i-1] * i;\n ifact[n] = 1 / fact[n];\n for(ll i = n-1; i >= sz; i--) ifact[i] = ifact[i+1] * (i+1);\n }\n\n T permutation(ll n, ll r) {\n assert(n >= r);\n assert(r >= 0);\n expand(n);\n return fact[n] * ifact[n-r];\n }\n\n T combination(ll n, ll r) {\n assert(n >= r);\n assert(r >= 0);\n expand(n);\n return fact[n] * ifact[r] * ifact[n-r];\n }\n\n T stirling(ll n, ll k) {\n assert(n >= k);\n assert(k >= 0);\n if(n == 0) return 1;\n T res = 0;\n int sign = k%2? -1 : 1;\n expand(k);\n REP(i, k+1) {\n res += sign * ifact[i] * ifact[k-i] * T(i).pow(n);\n sign *= -1;\n }\n return res;\n }\n\n vector<vector<T>> stirling_table(ll n, ll k) {\n assert(n >= 0 && k >= 0);\n vector<vector<T>> res(n+1, vector<T>(k+1));\n res[0][0] = 1;\n FOR(i, 1, n+1) FOR(j, 1, k+1) {\n res[i][j] = res[i-1][j-1] + j * res[i-1][j];\n }\n return res;\n }\n\n T bell(ll n, ll k) {\n assert(n >= 0 && k >= 0);\n expand(k);\n vector<T> tmp(k+1);\n int sign = 1;\n tmp[0] = 1;\n FOR(i, 1, k+1) {\n sign *= -1;\n tmp[i] = tmp[i-1] + sign * ifact[i];\n }\n T res = 0;\n REP(i, k+1) {\n res += T(i).pow(n) * ifact[i] * tmp[k-i];\n }\n return res;\n }\n\n vector<vector<T>> partition_table(ll n) {\n assert(n >= 0);\n vector<vector<T>> res(n+1, vector<T>(n+1));\n REP(i, n+1) res[0][i] = 1;\n FOR(i, 1, n+1) FOR(j, 1, n+1) {\n res[i][j] = res[i][j-1] + (i<j? 0 : res[i-j][j]);\n }\n return res;\n }\n};\n#line 2 \"Contests/Dummy/main.cpp\"\n\n/* #include <atcoder/all> */\n/* using namespace atcoder; */\n/* #include \"KowerKoint/expansion/ac-library/all.hpp\" */\n\nvoid solve(){\n int n; cin >> n;\n VL a(n); cin >> a;\n ll ans = -1;\n REP(i, n) REP(j, i) {\n ll tmp = a[i] * a[j];\n string s = to_string(tmp);\n bool ok = true;\n REP(i, s.length()-1) ok &= s[i]+1 == s[i+1];\n if(ok) chmax(ans, tmp);\n }\n print(ans);\n}\n\n// generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)\nint main() {\n // Fasterize input/output script\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(100);\n // scanf/printf user should delete this fasterize input/output script\n\n int t = 1;\n //cin >> t; // comment out if solving multi testcase\n for(int testCase = 1;testCase <= t;++testCase){\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3528,"score_of_the_acc":-0.9333,"final_rank":17},{"submission_id":"aoj_2780_6392175","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; ++i)\ntypedef long long ll;\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n int N;\n cin >> N;\n vector<int> A(N);\n rep(i, N) cin >> A[i];\n\n int ans = -1;\n for (int i = 0; i < N; ++i) {\n for (int j = i + 1; j < N; ++j) {\n string s = to_string(A[i] * A[j]);\n\n bool flag = true;\n rep(k, s.size() - 1) {\n if (s[k] + 1 != s[k + 1]) {\n flag = false;\n break;\n }\n }\n if (flag)\n ans = max(ans, A[i] * A[j]);\n }\n }\n cout << ans << \"\\n\";\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3556,"score_of_the_acc":-0.8,"final_rank":16},{"submission_id":"aoj_2780_6024140","code_snippet":"//GIVE ME AC!!!!!!!!!!!!!!!!!\n//#pragma GCC target(\"avx\")\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ld=long double;\nusing vl=vector<ll>;\nusing vi=vector<int>;\nusing vs=vector<string>;\nusing vc=vector<char>;\nusing vvl=vector<vl>;\nusing P=pair<ll,ll>;\nusing vvc=vector<vc>;\nusing vd=vector<double>;\nusing vp=vector<P>;\nusing vb=vector<bool>;\n#define overload4(_1,_2,_3,_4,name,...) name\n#define overload3(_1,_2,_3,name,...) name\n#define rep1(a) for(__typeof(a) i=0;i<a;i++)\n#define rep2(i,a) for(__typeof(a) i=0;i<a;i++)\n#define rep3(i,a,b) for(__typeof(a) i=a;i<b;i++)\n#define rep4(i,a,b,c) for(__typeof(a) i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep1(a) for(__typeof(a) i=(a)-1;i>=0;i--)\n#define rrep2(i,a) for(__typeof(a) i=(a)-1;i>=0;i--)\n#define rrep3(i,a,b) for(__typeof(a) i=(b)-1;i>=(a);i--)\n#define rrep(...) overload3(__VA_ARGS__,rrep3,rrep2,rrep1)(__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 rall(n) (n).rbegin(),(n).rend()\n#define pb push_back\n#define eb emplace_back\n#define MtSaka ios::sync_with_stdio(0);cin.tie(0);cout<<fixed<<setprecision(12)\n#define max_(a) *max_element(all(a))\n#define min_(a) *min_element(all(a))\n#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)\nconst int dx[8]={1,0,-1,0,1,-1,-1,1};\nconst int dy[8]={0,1,0,-1,1,1,-1,-1};\nconst ll inf=2e18;\nconst ll MOD=1000000007;\nconst ll mod=998244353;\nconst double pi=acos(-1);\ntemplate<typename T1,typename T2 >\nostream &operator<<(ostream&os,const pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>\nistream &operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T>\nostream &operator<<(ostream&os,const vector<T>&v){for(int i=0;i<(int)v.size();i++){os<<v[i]<<(i+1!=v.size()?\" \":\"\");}return os;}\ntemplate<typename T>\nistream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}\nvoid scan(){}\ntemplate<class Head,class... Tail>\nvoid scan(Head&head,Tail&... tail){cin>>head;scan(tail...);}\ntemplate<class T>\nvoid print(const T &t){cout<<t<<'\\n';}\ntemplate<class Head, class... Tail>\nvoid print(const Head &head, const Tail &... tail){cout<<head<<' ';print(tail...);}\ntemplate<class... T>\nvoid fin(const T &... a){print(a...);exit(0);}\ntemplate<typename T>\nT sum_(vector<T>a){return accumulate(all(a),T(0));}\ntemplate<typename T1,typename T2>\ninline bool chmax(T1&a,T2 b){return a<b&&(a=b,true);}\ntemplate<typename T1,typename T2>\ninline bool chmin(T1&a,T2 b){return a>b&&(a=b,true);}\nint main(){\n LL(n);\n vl a(n);\n scan(a);\n ll ans=-1;\n rep(i,n)rep(j,i+1,n){\n ll now=a[i]*a[j];\n string s=to_string(now);\n rep(i,s.size()-1){\n if(s[i]+1!=s[i+1])now=-1;\n }\n chmax(ans,now);\n }\n print(ans);\n}","accuracy":1,"time_ms":20,"memory_kb":3512,"score_of_the_acc":-0.4857,"final_rank":7},{"submission_id":"aoj_2780_6008029","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, a, n) for(int i = a; i < (n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\nconst int INF = 1001001001;\nconst ll LINF = 1001002003004005006ll;\n//const int mod = 1000000007;\n//const int mod = 998244353;\n\nint main()\n{\n int n;\n cin >> n;\n vector<ll> a(n);\n rep(i, 0, n) cin >> a[i];\n sort(a.rbegin(), a.rend());\n ll ans = -1;\n rep(i, 0, n){\n rep(j, i+1, n){\n ll tmp = a[i]*a[j];\n string s = to_string(tmp);\n bool flag = true;\n rep(k, 0, s.size()-1){\n if(s[k] + 1 != s[k+1]) flag = false;\n }\n if(flag) ans = max(ans, tmp);\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3548,"score_of_the_acc":-0.7429,"final_rank":15},{"submission_id":"aoj_2780_6008016","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nconst int INF = 1e9;\nconst ll inf = 1LL<<60;\n\nint main() {\n int n; cin >> n;\n vector<int> a(n);\n for (int i=0; i<n; i++) cin >> a[i];\n auto f = [](int x) -> bool {\n string s = to_string(x);\n for (int i=1; i<s.size(); i++) {\n if (s[i] - '0' != s[i-1] - '0' + 1) return false;\n }\n return true;\n };\n int ans = -1;\n for (int i=0; i<n; i++) for (int j=i+1; j<n; j++) if (f(a[i]*a[j])) ans = max(ans, a[i]*a[j]);\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3508,"score_of_the_acc":-0.4571,"final_rank":4},{"submission_id":"aoj_2780_5997952","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nconst int INF = 1e9;\nconst ll inf = 1LL<<60;\n\nint main() {\n int n; cin >> n;\n vector<int> a(n);\n for (int i=0; i<n; i++) cin >> a[i];\n auto f = [](int x) -> bool {\n string s = to_string(x);\n for (int i=1; i<s.size(); i++) {\n if (s[i-1] - '0' + 1 != s[i] - '0') return false;\n }\n return true;\n };\n int ans = -1;\n for (int i=0; i<n; i++) for (int j=i+1; j<n; j++) if (f(a[i]*a[j])) ans = max(ans, a[i]*a[j]);\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3500,"score_of_the_acc":-0.4,"final_rank":2},{"submission_id":"aoj_2780_5988760","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MOD 1000000007\n//#define MOD 998244353\n#define INF 1000000010\n#define EPS 1e-9\n#define F first\n#define S second\n\n#define debug(x) cout<<x<<endl;\n#define repi(i,x,n) for(int i=x;i<n;i++)\n#define rep(i,n) repi(i,0,n)\n#define lp(i,n) repi(i,0,n)\n#define repn(i,n) for(int i=n;i>=0;i--)\n#define int long long\n#define endl \"\\n\"\n\ntypedef pair<int,int> PII;\ntypedef pair<int,string> PIS;\ntypedef pair<string,int> PSI;\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\nsigned main(){\n cin.tie(0);\t\n ios::sync_with_stdio(false);\n int n;\n cin>>n;\n vector<int> v(n);\n rep(i,n) cin>>v[i];\n sort(v.begin(),v.end(),greater<int>() );\n rep(i,n){\n repi(j,i+1,n){\n int num=v[i]*v[j];\n string s=to_string(num);\n char c=s[0];\n if(s.size()==1){cout<<num<<endl;return 0;}\n repi(j,1,s.size() ){\n\tif(s[j] != 1+s[j-1]) break;\n\telse if(j==s.size()-1){\n\t cout<<num<<endl;\n\t return 0;\n\t}\n }\n }\n }\n cout<<-1<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3532,"score_of_the_acc":-0.6286,"final_rank":11},{"submission_id":"aoj_2780_5940604","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;\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n \n int N; cin >> N;\n vector<int> a(N);\n rep(i,N) cin >> a[i];\n int ans = -1;\n rep(i,N)rep(j,N) if(i != j) {\n string s = to_string(a[i] * a[j]);\n bool ok = true;\n rep(k,s.size()-1) {\n if(s[k] + 1 != s[k + 1]) ok = false;\n }\n if(ok) ans = max(ans, stoi(s));\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":3508,"score_of_the_acc":-1.4571,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_2780_10295740\",\n \"code_snippet\": \"// AOJ #2780 Best Matched Pair\\n// 2025.3.14\\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\\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\\tpc('\\\\n');\\n}\\n\\nbool valid(ll p) {\\n string s = to_string(p);\\n if(s.size() == 1) return true;\\n for (size_t i = 0; i + 1 < s.size(); i++) {\\n if(s[i+1] - s[i] != 1) return false;\\n }\\n return true;\\n}\\n\\nint main(){\\n int n = Cin();\\n vector<int> v(n);\\n for (int i = 0; i < n; i++) v[i] = Cin();\\n\\n ll ans = -1;\\n for (int i = 0; i < n; i++){\\n for (int j = i+1; j < n; j++){\\n ll p = (ll)v[i] * v[j];\\n if(valid(p)) ans = max(ans, p);\\n }\\n }\\n Cout(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.4571,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2780_10295739\",\n \"code_snippet\": \"// AOJ #2780 Best Matched Pair\\n// 2025.3.14\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nbool valid(ll p) {\\n string s = to_string(p);\\n if(s.size() == 1) return true;\\n for (size_t i = 0; i + 1 < s.size(); i++) {\\n if(s[i+1] - s[i] != 1) return false;\\n }\\n return true;\\n}\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<int> v(n);\\n for (int i = 0; i < n; i++) cin >> v[i];\\n\\n ll ans = -1;\\n for (int i = 0; i < n; i++){\\n for (int j = i+1; j < n; j++){\\n ll p = (ll)v[i] * v[j];\\n if(valid(p)) ans = max(ans, p);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.4571,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2780_10013939\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(a) a.begin(),a.end()\\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\\n#define rep(i, n) reps(i, 0, n)\\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\\nconst long long mod = 1000000007;\\nconst long long INF = 1e18;\\nll myceil(ll a, ll b) {return (a+b-1)/b;}\\n\\n\\nvoid solve() {\\n int n;\\n cin >> n;\\n vector<ll> v(n);\\n rep(i,n) {\\n cin >> v[i];\\n }\\n\\n sort(all(v));\\n reverse(all(v));\\n\\n int ans = -1;\\n\\n rep(i,n) {\\n reps(j,i+1,n) {\\n int x = v[i]*v[j];\\n if (x < ans) break;\\n\\n string s = to_string(v[i]*v[j]);\\n rep(ind,s.length()-1) {\\n if (s[ind] != s[ind+1]-1) break;\\n\\n if (ind == s.length()-2) ans = x;\\n }\\n if (s.length() == 1) ans = x;\\n }\\n }\\n\\n cout << ans << endl;\\n return;\\n}\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n int t = 1;\\n //cin >> t;\\n rep(i,t) {\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.6571,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2780_9668990\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\nint main(){\\n int N;cin>>N;\\n vector<ll>A(N);\\n REP(i,N)cin>>A[i];\\n ll ans=-1;\\n REP(i,N)REP(j,i){\\n string s=to_string(A[i]*A[j]);\\n bool ok=1;\\n REP(k,s.size()-1)if(s[k+1]-s[k]!=1)ok=0;\\n if(ok)ans=max(ans,A[i]*A[j]);\\n }\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.6286,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2780_9578940\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\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;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n 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 == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\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}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<int> A(N);\\n rep(i,0,N) cin >> A[i];\\n int ANS = -1;\\n rep(i,0,N) {\\n rep(j,i+1,N) {\\n int X = A[i] * A[j];\\n string S = to_string(X);\\n bool check = true;\\n rep(k,0,S.size()-1) {\\n if (S[k] + 1 != S[k+1]) check = false;\\n }\\n if (check) chmax(ANS,X);\\n }\\n }\\n cout << ANS << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2780_9069657\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define FOR(i, a, b) for(int i = (a); i < (b); i++)\\n#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)\\n#define SZ(a) int(a.size())\\n#define ALL(a) a.begin(), a.end()\\n#define PB push_back\\n#define MP make_pair\\n#define F first\\n#define S second\\n\\ntypedef long long LL;\\ntypedef vector<int> VI;\\ntypedef pair<int, int> PII;\\ntypedef double db;\\n\\nint main()\\n{\\n\\tios::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\t\\n\\tint n;\\n\\tcin >> n;\\n\\tVI a(n);\\n\\tint ans = -1;\\n\\tFOR (i, 0, n)\\n\\t{\\n\\t\\tcin >> a[i];\\n\\t\\tFOR (j, 0, i)\\n\\t\\t{\\n\\t\\t\\tint x = a[i] * a[j];\\n\\t\\t\\tstring s = to_string(x);\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tFOR (k, 0, SZ(s) - 1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tok &= (s[k + 1] - s[k]) == 1;\\n\\t\\t\\t}\\n\\t\\t\\tif (ok)\\n\\t\\t\\t\\tans = max(ans, x);\\n\\t\\t}\\n\\t}\\n\\tcout << ans << '\\\\n';\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -0.6,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2780_8618535\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int n; std::cin >> n;\\n std::vector<int> a(n);\\n for (auto& x : a) std::cin >> x;\\n int ans{-1};\\n for (int i{} ; i < n ; i++) for (int j{i + 1} ; j < n ; j++) {\\n int v{a[i] * a[j]};\\n std::string t{std::to_string(v)};\\n bool ok{true};\\n for (int i{1} ; i < (int)t.size() ; i++) {\\n ok &= t[i] == t[i - 1] + 1;\\n }\\n if (ok) ans = std::max(ans, v);\\n }\\n std::cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.5143,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2780_8528357\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint main() {\\n int n;\\n std::cin >> n;\\n std::vector<int> a(n);\\n for (int i = 0; i < n; i++) std::cin >> a[i];\\n int ans = -1;\\n for (int i = 0; i < n; i++) {\\n for (int j = i + 1; j < n; j++) {\\n int mul = a[i] * a[j];\\n std::string s = std::to_string(mul);\\n bool flag = true;\\n for (int k = 0; k + 1 < (int)s.size(); k++) {\\n if (s[k] != s[k + 1] - 1) {\\n flag = false;\\n break;\\n }\\n }\\n if (flag) {\\n ans = std::max(ans, mul);\\n }\\n }\\n }\\n std::cout << ans << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.4,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2780_7916593\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}\\ntemplate<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}\\n\\nbool solve(){\\n return true;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n // while(1){\\n // if(!solve()){\\n // return 0;\\n // }\\n // }\\n int N;\\n cin>>N;\\n vector<int>A(N);\\n for(int i=0;i<N;i++)cin>>A[i];\\n int ans=-1;\\n for(int i=0;i<N-1;i++)for(int j=i+1;j<N;j++){\\n string s=to_string(A[i]*A[j]);\\n int n=s.size();\\n bool ok=true;\\n for(int k=0;k<n-1;k++){\\n if(s[k+1]-s[k]!=1){\\n ok=false;\\n break;\\n }\\n }\\n if(ok)chmax(ans,A[i]*A[j]);\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.6286,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2780_7304906\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main(){\\n int n; cin >> n;\\n vector<int> a(n);\\n for(auto &it: a) cin >> it;\\n\\n int ans = -1;\\n for(int i = 0; i < n; i++){\\n for(int j = i+1; j < n; j++){\\n int x = a[i]*a[j];\\n int y = x;\\n vector<int> v;\\n while(y > 0){\\n v.emplace_back(y%10);\\n y /= 10;\\n }\\n bool isok = true;\\n for(int k = 1; k < v.size(); k++){\\n if(v[k-1] != v[k]+1) isok = false;\\n }\\n if(isok && ans < x) ans = x;\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.3333,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2780_7164029\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define repn(i,end) for(int i = 0; i <= (int)(end); i++)\\n#define reps(i,start,end) for(int i = start; i < (int)(end); i++)\\n#define repsn(i,start,end) for(int i = start; i <= (int)(end); i++)\\n#define ll long long\\n#define print(t) cout << t << endl \\n#define all(a) (a).begin(),(a).end()\\n// << std::fixed << std::setprecision(0)\\nconst ll INF = 1LL << 60;\\n \\ntemplate<class T> void chmin(T& a, T b){\\n if(a > b){\\n a = b;\\n }\\n}\\n \\ntemplate<class T> void chmax(T& a, T b){\\n if(a < b){\\n a = b;\\n }\\n}\\n \\nll lpow(ll x,ll n){\\n ll ans = 1;\\n while(n >0){\\n if(n & 1)ans *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return ans;\\n}\\n \\nint main(){\\n ll n;cin >> n;\\n vector<ll> a(n);\\n rep(i,n)cin >> a[i];\\n sort(all(a));\\n\\n for(ll i = n-1;i >= 1;i--){\\n for(ll j = i-1;j>= 0;j--){\\n ll b = a[i] * a[j];\\n string s = to_string(b);\\n bool ok = true;\\n rep(k,(int)s.size()-1){\\n if(s[k+1] !=s[k] + 1){\\n ok = false;\\n break;\\n }\\n }\\n if(ok){\\n cout << b << endl;\\n return 0;\\n }\\n\\n }\\n }\\n cout << -1 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.5143,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2780_7102458\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\\n#define REP(i, a, b) for (ll i = a; i < (ll)(b); i++)\\n#define all(v) v.begin(), v.end()\\n#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf\\n#define INF 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf\\n\\nint main(){\\n ll N;\\n cin>>N;\\n vector<ll> a(N);\\n rep(i,N){\\n cin>>a[i];\\n }\\n ll ans=-1;\\n string judge;\\n bool flag;\\n rep(i,N){\\n REP(j,i+1,N){\\n judge=to_string(a[i]*a[j]);\\n flag=true;\\n rep(k,judge.size()-1){\\n if((judge[k+1]-'0')!=(judge[k]-'0'+1)){\\n flag=false;\\n break;\\n }\\n }\\n if(flag&&stoll(judge)>ans)ans=stoll(judge);\\n }\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -1.0762,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2780_6634187\",\n \"code_snippet\": \"#line 2 \\\"library/KowerKoint/base.hpp\\\"\\n\\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#endif\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i, n) for(int i = 0; i < (int)(n); i++)\\n#define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++)\\n#define ALL(a) (a).begin(),(a).end()\\n#define END(...) { print(__VA_ARGS__); return; }\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VVVI = vector<VVI>;\\nusing ll = long long;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VVVL = vector<VVL>;\\nusing VD = vector<double>;\\nusing VVD = vector<VD>;\\nusing VVVD = vector<VVD>;\\nusing VS = vector<string>;\\nusing VVS = vector<VS>;\\nusing VVVS = vector<VVS>;\\nusing VC = vector<char>;\\nusing VVC = vector<VC>;\\nusing VVVC = vector<VVC>;\\nusing P = pair<int, int>;\\nusing VP = vector<P>;\\nusing VVP = vector<VP>;\\nusing VVVP = vector<VVP>;\\nusing LP = pair<ll, ll>;\\nusing VLP = vector<LP>;\\nusing VVLP = vector<VLP>;\\nusing VVVLP = vector<VVLP>;\\n\\ntemplate <typename T>\\nusing PQ = priority_queue<T>;\\ntemplate <typename T>\\nusing GPQ = priority_queue<T, vector<T>, greater<T>>;\\n\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr int DX[] = {1, 0, -1, 0};\\nconstexpr int DY[] = {0, 1, 0, -1};\\n\\nvoid print() { cout << '\\\\n'; }\\ntemplate<typename T>\\nvoid print(const T &t) { cout << t << '\\\\n'; }\\ntemplate<typename Head, typename... Tail>\\nvoid print(const Head &head, const Tail &... tail) {\\n cout << head << ' ';\\n print(tail...);\\n}\\n\\n#ifdef DEBUG\\nvoid dbg() { cerr << '\\\\n'; }\\ntemplate<typename T>\\nvoid dbg(const T &t) { cerr << t << '\\\\n'; }\\ntemplate<typename Head, typename... Tail>\\nvoid dbg(const Head &head, const Tail &... tail) {\\n cerr << head << ' ';\\n dbg(tail...);\\n}\\n#else\\ntemplate<typename... Args>\\nvoid dbg(const Args &... args) {}\\n#endif\\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 != (int) 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 T>\\nvector<vector<T>> split(typename vector<T>::const_iterator begin, typename vector<T>::const_iterator end, T val) {\\n vector<vector<T>> res;\\n vector<T> cur;\\n for(auto it = begin; it != end; it++) {\\n if(*it == val) {\\n res.push_back(cur);\\n cur.clear();\\n } else cur.push_back(val);\\n }\\n res.push_back(cur);\\n return res;\\n}\\n\\nvector<string> split(typename string::const_iterator begin, typename string::const_iterator end, char val) {\\n vector<string> res;\\n string cur = \\\"\\\";\\n for(auto it = begin; it != end; it++) {\\n if(*it == val) {\\n res.push_back(cur);\\n cur.clear();\\n } else cur.push_back(val);\\n }\\n res.push_back(cur);\\n return res;\\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>\\npair<VI, vector<T>> compress(const vector<T> &a) {\\n int n = a.size();\\n vector<T> x;\\n REP(i, n) x.push_back(a[i]);\\n sort(ALL(x)); x.erase(unique(ALL(x)), x.end());\\n VI res(n);\\n REP(i, n) res[i] = lower_bound(ALL(x), a[i]) - x.begin();\\n return make_pair(res, x);\\n}\\n\\ntemplate <typename It>\\nauto rle(It begin, It end) {\\n vector<pair<typename It::value_type, int>> res;\\n if(begin == end) return res;\\n auto pre = *begin;\\n int num = 1;\\n for(auto it = begin + 1; it != end; it++) {\\n if(pre != *it) {\\n res.emplace_back(pre, num);\\n pre = *it;\\n num = 1;\\n } else num++;\\n }\\n res.emplace_back(pre, num);\\n return res;\\n}\\n\\nvector<pair<char, int>> rle(string s) {\\n return rle(ALL(s));\\n}\\n\\ntemplate <typename T>\\npair<vector<T>, vector<T>> factorial(int n) {\\n vector<T> res(n+1), rev(n+1);\\n res[0] = 1;\\n REP(i, n) res[i+1] = res[i] * (i+1);\\n rev[n] = 1 / res[n];\\n for(int i = n; i > 0; i--) {\\n rev[i-1] = rev[i] * i;\\n }\\n return make_pair(res, rev);\\n}\\n#line 3 \\\"library/KowerKoint/internal_operator.hpp\\\"\\n\\nnamespace internal_operator {\\n template <typename T>\\n T default_add(T a, T b) { return a + b; }\\n template <typename T>\\n T default_sub(T a, T b) { return a - b; }\\n template <typename T>\\n T zero() { return T(0); }\\n template <typename T>\\n T default_div(T a, T b) { return a / b; }\\n template <typename T>\\n T default_mult(T a, T b) { return a * b; }\\n template <typename T>\\n T one() { return T(1); }\\n template <typename T>\\n T default_xor(T a, T b) { return a ^ b; }\\n template <typename T>\\n T default_and(T a, T b) { return a & b; }\\n template <typename T>\\n T default_or(T a, T b) { return a | b; }\\n ll mod3() { return 998244353LL; }\\n ll mod7() { return 1000000007LL; }\\n ll mod9() { return 1000000009LL; }\\n template <typename T>\\n T default_max(T a, T b) { return max(a, b); }\\n template <typename T>\\n T default_min(T a, T b) { return min(a, b); }\\n}\\n\\n#line 3 \\\"library/KowerKoint/integer.hpp\\\"\\n\\nll kth_root(ll x, ll k) {\\n if(k == 1) return x;\\n ll res = 0;\\n for(int i = 31; i >= 0; i--) {\\n bool over = false;\\n ll tmp = 1;\\n ll nxt = res | 1LL << i;\\n REP(i, k) {\\n if(tmp > x / nxt) {\\n over = true;\\n break;\\n }\\n tmp *= nxt;\\n }\\n if(!over) res = nxt;\\n }\\n return res;\\n}\\n\\nll sqrt(ll x) {\\n return kth_root(x, 2);\\n}\\n\\nstruct Prime {\\n VI sieved;\\n VL primes;\\n\\n Prime() {}\\n Prime(ll n) {\\n expand(n);\\n }\\n\\n void expand(ll n) {\\n ll sz = (ll)sieved.size() - 1;\\n if(n <= sz) return;\\n sieved.resize(n+1);\\n sieved[0] = sieved[1] = 1;\\n primes.clear();\\n primes.push_back(2);\\n for(ll d = 4; d <= n; d += 2) sieved[d] = 1;\\n FOR(d, 3, n+1) {\\n if(!sieved[d]) {\\n primes.push_back(d);\\n for(ll i = d*d; i <= n; i += d*2) sieved[i] = 1;\\n }\\n }\\n }\\n\\n bool is_prime(ll n) {\\n assert(n > 0);\\n if(n <= (ll)sieved.size() - 1) return !sieved[n];\\n for(ll d = 2; d*d <= n; d++) {\\n if(n % d == 0) return false;\\n }\\n return true;\\n }\\n\\n VL least_prime_factors(ll n) {\\n assert(n > 0);\\n VL lpfs(n+1, -1), primes;\\n FOR(d, 2, n+1) {\\n if(lpfs[d] == -1) {\\n lpfs[d] = d;\\n primes.push_back(d);\\n }\\n for(ll p : primes) {\\n if(p * d > n || p > lpfs[d]) break;\\n lpfs[p*d] = p;\\n }\\n }\\n return lpfs;\\n }\\n\\n VL prime_list(ll n) {\\n assert(n > 0);\\n expand(n);\\n return VL(primes.begin(), upper_bound(ALL(primes), n));\\n }\\n\\n vector<pair<ll, int>> prime_factor(ll n) {\\n assert(n > 0);\\n vector<pair<ll, int>> factor;\\n expand(sqrt(n));\\n for(ll prime : primes) {\\n if(prime * prime > n) break;\\n int cnt = 0;\\n while(n % prime == 0) {\\n n /= prime;\\n cnt++;\\n }\\n if(cnt) factor.emplace_back(prime, cnt);\\n }\\n if(n > 1) factor.emplace_back(n, 1);\\n return factor;\\n }\\n\\n\\n VL divisor(ll n) {\\n assert(n > 0);\\n auto factor = prime_factor(n);\\n VL res = {1};\\n for(auto [prime, cnt] : factor) {\\n int sz = res.size();\\n res.resize(sz * (cnt+1));\\n REP(i, sz*cnt) res[sz+i] = res[i] * prime;\\n REP(i, cnt) inplace_merge(res.begin(), res.begin() + sz*(i+1), res.begin() + sz*(i+2));\\n }\\n return res;\\n }\\n};\\n\\nll extgcd(ll a, ll b, ll& x, ll& y) {\\n x = 1, y = 0;\\n ll nx = 0, ny = 1;\\n while(b) {\\n ll q = a / b;\\n tie(a, b) = LP(b, a % b);\\n tie(x, nx) = LP(nx, x - nx*q);\\n tie(y, ny) = LP(ny, y - ny*q);\\n }\\n return a;\\n}\\n\\nll inv_mod(ll n, ll m) {\\n ll x, y;\\n assert(extgcd(n, m, x, y) == 1);\\n x %= m;\\n if(x < 0) x += m;\\n return x;\\n}\\n\\nll pow_mod(ll a, ll n, ll m) {\\n if(n == 0) return 1LL;\\n if(n < 0) return inv_mod(pow_mod(a, -n, m), m);\\n ll res = 1;\\n while(n) {\\n if(n & 1) {\\n res *= a;\\n res %= m;\\n }\\n n >>= 1;\\n a *= a;\\n a %= m;\\n }\\n return res;\\n}\\n\\n#line 5 \\\"library/KowerKoint/modint.hpp\\\"\\n\\ntemplate <ll (*mod)()>\\nstruct Modint {\\n ll val;\\n \\n Modint(): val(0) {}\\n\\n Modint(ll x): val(x) {\\n val %= mod();\\n if(val < 0) val += mod();\\n }\\n\\n Modint& operator+=(const Modint& r) {\\n val += r.val;\\n if(val >= mod()) val -= mod();\\n return *this;\\n }\\n friend Modint operator+(const Modint& l, const Modint& r) {\\n return Modint(l) += r;\\n }\\n\\n Modint& operator-=(const Modint& r) {\\n val -= r.val;\\n if(val < 0) val += mod();\\n return *this;\\n }\\n friend Modint operator-(const Modint& l, const Modint& r) {\\n return Modint(l) -= r;\\n }\\n\\n Modint& operator*=(const Modint& r) {\\n val *= r.val;\\n val %= mod();\\n return *this;\\n }\\n Modint operator*(const Modint& r) {\\n return (Modint(*this) *= r);\\n }\\n friend Modint operator*(const Modint& l, const Modint& r) {\\n return Modint(l) *= r;\\n }\\n\\n Modint pow(ll n) const {\\n return Modint(pow_mod(val, n, mod()));\\n }\\n\\n Modint inv() const {\\n return Modint(inv_mod(val, mod()));\\n }\\n\\n Modint& operator/=(const Modint& r) {\\n return (*this *= r.inv());\\n }\\n friend Modint operator/(const Modint& l, const Modint& r) {\\n return Modint(l) /= r;\\n }\\n\\n Modint& operator^=(const ll n) {\\n val = pow_mod(val, n, mod());\\n return *this;\\n }\\n Modint operator^(const ll n) {\\n return this->pow(n);\\n }\\n\\n Modint operator+() const { return *this; }\\n Modint operator-() const { return Modint() - *this; }\\n\\n Modint& operator++() {\\n val++;\\n if(val == mod()) val = 0LL;\\n return *this;\\n }\\n Modint& operator++(int) {\\n Modint res(*this);\\n ++*this;\\n return res;\\n }\\n\\n Modint& operator--() {\\n if(val == 0LL) val = mod();\\n val--;\\n return *this;\\n }\\n Modint& operator--(int) {\\n Modint res(*this);\\n --*this;\\n return res;\\n }\\n\\n friend bool operator==(const Modint& l, const Modint& r) {\\n return l.val == r.val;\\n }\\n friend bool operator!=(const Modint& l, const Modint& r) {\\n return l.val != r.val;\\n }\\n\\n static pair<vector<Modint>, vector<Modint>> factorial(int n) {\\n vector<Modint> fact(n+1), rfact(n+1);\\n fact[0] = 1;\\n REP(i, n) fact[i+1] = fact[i] * (i+1);\\n rfact[n] = 1 / fact[n];\\n for(int i = n-1; i >= 0; i--) rfact[i] = rfact[i+1] * (i+1);\\n return {fact, rfact};\\n }\\n\\n friend istream& operator>>(istream& is, Modint& mi) {\\n is >> mi.val;\\n return is;\\n }\\n\\n friend ostream& operator<<(ostream& os, const Modint& mi) {\\n os << mi.val;\\n return os;\\n }\\n};\\n\\nusing MI3 = Modint<internal_operator::mod3>;\\nusing V3 = vector<MI3>;\\nusing VV3 = vector<V3>;\\nusing VVV3 = vector<VV3>;\\nusing MI7 = Modint<internal_operator::mod7>;\\nusing V7 = vector<MI7>;\\nusing VV7 = vector<V7>;\\nusing VVV7 = vector<VV7>;\\nusing MI9 = Modint<internal_operator::mod9>;\\nusing V9 = vector<MI9>;\\nusing VV9 = vector<V9>;\\nusing VVV9 = vector<VV9>;\\n#line 3 \\\"library/KowerKoint/counting.hpp\\\"\\n\\ntemplate <typename T>\\nstruct Counting {\\n vector<T> fact, ifact;\\n\\n Counting() {}\\n Counting(ll n) {\\n expand(n);\\n }\\n\\n void expand(ll n) {\\n ll sz = (ll)fact.size();\\n if(sz > n) return;\\n fact.resize(n+1);\\n ifact.resize(n+1);\\n fact[0] = 1;\\n FOR(i, max(1LL, sz), n+1) fact[i] = fact[i-1] * i;\\n ifact[n] = 1 / fact[n];\\n for(ll i = n-1; i >= sz; i--) ifact[i] = ifact[i+1] * (i+1);\\n }\\n\\n T permutation(ll n, ll r) {\\n assert(n >= r);\\n assert(r >= 0);\\n expand(n);\\n return fact[n] * ifact[n-r];\\n }\\n\\n T combination(ll n, ll r) {\\n assert(n >= r);\\n assert(r >= 0);\\n expand(n);\\n return fact[n] * ifact[r] * ifact[n-r];\\n }\\n\\n T stirling(ll n, ll k) {\\n assert(n >= k);\\n assert(k >= 0);\\n if(n == 0) return 1;\\n T res = 0;\\n int sign = k%2? -1 : 1;\\n expand(k);\\n REP(i, k+1) {\\n res += sign * ifact[i] * ifact[k-i] * T(i).pow(n);\\n sign *= -1;\\n }\\n return res;\\n }\\n\\n vector<vector<T>> stirling_table(ll n, ll k) {\\n assert(n >= 0 && k >= 0);\\n vector<vector<T>> res(n+1, vector<T>(k+1));\\n res[0][0] = 1;\\n FOR(i, 1, n+1) FOR(j, 1, k+1) {\\n res[i][j] = res[i-1][j-1] + j * res[i-1][j];\\n }\\n return res;\\n }\\n\\n T bell(ll n, ll k) {\\n assert(n >= 0 && k >= 0);\\n expand(k);\\n vector<T> tmp(k+1);\\n int sign = 1;\\n tmp[0] = 1;\\n FOR(i, 1, k+1) {\\n sign *= -1;\\n tmp[i] = tmp[i-1] + sign * ifact[i];\\n }\\n T res = 0;\\n REP(i, k+1) {\\n res += T(i).pow(n) * ifact[i] * tmp[k-i];\\n }\\n return res;\\n }\\n\\n vector<vector<T>> partition_table(ll n) {\\n assert(n >= 0);\\n vector<vector<T>> res(n+1, vector<T>(n+1));\\n REP(i, n+1) res[0][i] = 1;\\n FOR(i, 1, n+1) FOR(j, 1, n+1) {\\n res[i][j] = res[i][j-1] + (i<j? 0 : res[i-j][j]);\\n }\\n return res;\\n }\\n};\\n#line 2 \\\"Contests/Dummy/main.cpp\\\"\\n\\n/* #include <atcoder/all> */\\n/* using namespace atcoder; */\\n/* #include \\\"KowerKoint/expansion/ac-library/all.hpp\\\" */\\n\\nvoid solve(){\\n int n; cin >> n;\\n VL a(n); cin >> a;\\n ll ans = -1;\\n REP(i, n) REP(j, i) {\\n ll tmp = a[i] * a[j];\\n string s = to_string(tmp);\\n bool ok = true;\\n REP(i, s.length()-1) ok &= s[i]+1 == s[i+1];\\n if(ok) chmax(ans, tmp);\\n }\\n print(ans);\\n}\\n\\n// generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)\\nint main() {\\n // Fasterize input/output script\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(100);\\n // scanf/printf user should delete this fasterize input/output script\\n\\n int t = 1;\\n //cin >> t; // comment out if solving multi testcase\\n for(int testCase = 1;testCase <= t;++testCase){\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -0.9333,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2780_6392175\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for (int i = 0; i < n; ++i)\\ntypedef long long ll;\\nusing namespace std;\\n\\nint main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n int N;\\n cin >> N;\\n vector<int> A(N);\\n rep(i, N) cin >> A[i];\\n\\n int ans = -1;\\n for (int i = 0; i < N; ++i) {\\n for (int j = i + 1; j < N; ++j) {\\n string s = to_string(A[i] * A[j]);\\n\\n bool flag = true;\\n rep(k, s.size() - 1) {\\n if (s[k] + 1 != s[k + 1]) {\\n flag = false;\\n break;\\n }\\n }\\n if (flag)\\n ans = max(ans, A[i] * A[j]);\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3556,\n \"score_of_the_acc\": -0.8,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2780_6024140\",\n \"code_snippet\": \"//GIVE ME AC!!!!!!!!!!!!!!!!!\\n//#pragma GCC target(\\\"avx\\\")\\n//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nusing ld=long double;\\nusing vl=vector<ll>;\\nusing vi=vector<int>;\\nusing vs=vector<string>;\\nusing vc=vector<char>;\\nusing vvl=vector<vl>;\\nusing P=pair<ll,ll>;\\nusing vvc=vector<vc>;\\nusing vd=vector<double>;\\nusing vp=vector<P>;\\nusing vb=vector<bool>;\\n#define overload4(_1,_2,_3,_4,name,...) name\\n#define overload3(_1,_2,_3,name,...) name\\n#define rep1(a) for(__typeof(a) i=0;i<a;i++)\\n#define rep2(i,a) for(__typeof(a) i=0;i<a;i++)\\n#define rep3(i,a,b) for(__typeof(a) i=a;i<b;i++)\\n#define rep4(i,a,b,c) for(__typeof(a) i=a;i<b;i+=c)\\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define rrep1(a) for(__typeof(a) i=(a)-1;i>=0;i--)\\n#define rrep2(i,a) for(__typeof(a) i=(a)-1;i>=0;i--)\\n#define rrep3(i,a,b) for(__typeof(a) i=(b)-1;i>=(a);i--)\\n#define rrep(...) overload3(__VA_ARGS__,rrep3,rrep2,rrep1)(__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 rall(n) (n).rbegin(),(n).rend()\\n#define pb push_back\\n#define eb emplace_back\\n#define MtSaka ios::sync_with_stdio(0);cin.tie(0);cout<<fixed<<setprecision(12)\\n#define max_(a) *max_element(all(a))\\n#define min_(a) *min_element(all(a))\\n#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)\\nconst int dx[8]={1,0,-1,0,1,-1,-1,1};\\nconst int dy[8]={0,1,0,-1,1,1,-1,-1};\\nconst ll inf=2e18;\\nconst ll MOD=1000000007;\\nconst ll mod=998244353;\\nconst double pi=acos(-1);\\ntemplate<typename T1,typename T2 >\\nostream &operator<<(ostream&os,const pair<T1,T2>&p){os<<p.first<<\\\" \\\"<<p.second;return os;}\\ntemplate<typename T1,typename T2>\\nistream &operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T>\\nostream &operator<<(ostream&os,const vector<T>&v){for(int i=0;i<(int)v.size();i++){os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");}return os;}\\ntemplate<typename T>\\nistream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}\\nvoid scan(){}\\ntemplate<class Head,class... Tail>\\nvoid scan(Head&head,Tail&... tail){cin>>head;scan(tail...);}\\ntemplate<class T>\\nvoid print(const T &t){cout<<t<<'\\\\n';}\\ntemplate<class Head, class... Tail>\\nvoid print(const Head &head, const Tail &... tail){cout<<head<<' ';print(tail...);}\\ntemplate<class... T>\\nvoid fin(const T &... a){print(a...);exit(0);}\\ntemplate<typename T>\\nT sum_(vector<T>a){return accumulate(all(a),T(0));}\\ntemplate<typename T1,typename T2>\\ninline bool chmax(T1&a,T2 b){return a<b&&(a=b,true);}\\ntemplate<typename T1,typename T2>\\ninline bool chmin(T1&a,T2 b){return a>b&&(a=b,true);}\\nint main(){\\n LL(n);\\n vl a(n);\\n scan(a);\\n ll ans=-1;\\n rep(i,n)rep(j,i+1,n){\\n ll now=a[i]*a[j];\\n string s=to_string(now);\\n rep(i,s.size()-1){\\n if(s[i]+1!=s[i+1])now=-1;\\n }\\n chmax(ans,now);\\n }\\n print(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.4857,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2780_6008029\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, a, n) for(int i = a; i < (n); i++)\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int, int>;\\nconst int INF = 1001001001;\\nconst ll LINF = 1001002003004005006ll;\\n//const int mod = 1000000007;\\n//const int mod = 998244353;\\n\\nint main()\\n{\\n int n;\\n cin >> n;\\n vector<ll> a(n);\\n rep(i, 0, n) cin >> a[i];\\n sort(a.rbegin(), a.rend());\\n ll ans = -1;\\n rep(i, 0, n){\\n rep(j, i+1, n){\\n ll tmp = a[i]*a[j];\\n string s = to_string(tmp);\\n bool flag = true;\\n rep(k, 0, s.size()-1){\\n if(s[k] + 1 != s[k+1]) flag = false;\\n }\\n if(flag) ans = max(ans, tmp);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.7429,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2780_6008016\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nconst int INF = 1e9;\\nconst ll inf = 1LL<<60;\\n\\nint main() {\\n int n; cin >> n;\\n vector<int> a(n);\\n for (int i=0; i<n; i++) cin >> a[i];\\n auto f = [](int x) -> bool {\\n string s = to_string(x);\\n for (int i=1; i<s.size(); i++) {\\n if (s[i] - '0' != s[i-1] - '0' + 1) return false;\\n }\\n return true;\\n };\\n int ans = -1;\\n for (int i=0; i<n; i++) for (int j=i+1; j<n; j++) if (f(a[i]*a[j])) ans = max(ans, a[i]*a[j]);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.4571,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2780_5997952\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nconst int INF = 1e9;\\nconst ll inf = 1LL<<60;\\n\\nint main() {\\n int n; cin >> n;\\n vector<int> a(n);\\n for (int i=0; i<n; i++) cin >> a[i];\\n auto f = [](int x) -> bool {\\n string s = to_string(x);\\n for (int i=1; i<s.size(); i++) {\\n if (s[i-1] - '0' + 1 != s[i] - '0') return false;\\n }\\n return true;\\n };\\n int ans = -1;\\n for (int i=0; i<n; i++) for (int j=i+1; j<n; j++) if (f(a[i]*a[j])) ans = max(ans, a[i]*a[j]);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.4,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2780_5988760\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MOD 1000000007\\n//#define MOD 998244353\\n#define INF 1000000010\\n#define EPS 1e-9\\n#define F first\\n#define S second\\n\\n#define debug(x) cout<<x<<endl;\\n#define repi(i,x,n) for(int i=x;i<n;i++)\\n#define rep(i,n) repi(i,0,n)\\n#define lp(i,n) repi(i,0,n)\\n#define repn(i,n) for(int i=n;i>=0;i--)\\n#define int long long\\n#define endl \\\"\\\\n\\\"\\n\\ntypedef pair<int,int> PII;\\ntypedef pair<int,string> PIS;\\ntypedef pair<string,int> PSI;\\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\\nsigned main(){\\n cin.tie(0);\\t\\n ios::sync_with_stdio(false);\\n int n;\\n cin>>n;\\n vector<int> v(n);\\n rep(i,n) cin>>v[i];\\n sort(v.begin(),v.end(),greater<int>() );\\n rep(i,n){\\n repi(j,i+1,n){\\n int num=v[i]*v[j];\\n string s=to_string(num);\\n char c=s[0];\\n if(s.size()==1){cout<<num<<endl;return 0;}\\n repi(j,1,s.size() ){\\n\\tif(s[j] != 1+s[j-1]) break;\\n\\telse if(j==s.size()-1){\\n\\t cout<<num<<endl;\\n\\t return 0;\\n\\t}\\n }\\n }\\n }\\n cout<<-1<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.6286,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2780_5940604\",\n \"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;\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n \\n int N; cin >> N;\\n vector<int> a(N);\\n rep(i,N) cin >> a[i];\\n int ans = -1;\\n rep(i,N)rep(j,N) if(i != j) {\\n string s = to_string(a[i] * a[j]);\\n bool ok = true;\\n rep(k,s.size()-1) {\\n if(s[k] + 1 != s[k + 1]) ok = false;\\n }\\n if(ok) ans = max(ans, stoi(s));\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -1.4571,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1669,"cells":{"group_id":{"kind":"string","value":"aoj_2782_cpp"},"problem_description":{"kind":"string","value":"We don't wanna work!\nACM is an organization of programming contests. The purpose of ACM does not matter to you. The only important thing is that workstyles of ACM members are polarized: each member is either a workhorse or an idle fellow.\nEach member of ACM has a motivation level. The members are ranked by their motivation levels: a member who has a higher motivation level is ranked higher. When several members have the same value of motivation levels, the member who joined ACM later have a higher rank. The top 20% highest ranked members work hard, and the other (80%) members never (!) work. Note that if 20% of the number of ACM members is not an integer, its fraction part is rounded down.\nYou, a manager of ACM, tried to know whether each member is a workhorse or an idle fellow to manage ACM. Finally, you completed to evaluate motivation levels of all the current members. However, your task is not accomplished yet because the members of ACM are dynamically changed from day to day due to incoming and outgoing of members. So, you want to record transitions of members from workhorses to idle fellows, and vice versa.\nYou are given a list of the current members of ACM and their motivation levels in chronological order of their incoming date to ACM. You are also given a list of incoming/outgoing of members in chronological order.\nYour task is to write a program that computes changes of workstyles of ACM members.\nInput\nThe first line of the input contains a single integer $N$ ($1 \\leq N \\leq 50,000$) that means the number of initial members of ACM. The ($i$ + 1)-th line of the input contains a string $s_i$ and an integer $a_i$ ($0 \\leq a_i \\leq 10^5$), separated by a single space. $s_i$ means the name of the $i$-th initial member and $a_i$ means the motivation level of the $i$-th initial member. Each character of $s_i$ is an English letter, and $1 \\leq |s_i| \\leq 20$. Note that those $N$ lines are ordered in chronological order of incoming dates to ACM of each member.\nThe ($N$ + 2)-th line of the input contains a single integer $M$ ($1 \\leq M \\leq 20,000$) that means the number of changes of ACM members. The ($N$ + 2 + $j$)-th line of the input contains information of the $j$-th incoming/outgoing member. When the $j$-th information represents an incoming of a member, the information is formatted as \"$+ t_j b_j$\", where $t_j$ is the name of the incoming member and $b_j$ ($0 \\leq b_j \\leq 10^5$) is his motivation level. On the other hand, when the $j$-th information represents an outgoing of a member, the information is formatted as \"$- t_j$\", where $t_j$ means the name of the outgoing member. Each character of $t_j$ is an English letter, and $1 \\leq |t_j| \\leq 20$. Note that uppercase letters and lowercase letters are distinguished. Note that those $M$ lines are ordered in chronological order of dates when each event happens.\nNo two incoming/outgoing events never happen at the same time. No two members have the same name, but members who left ACM once ma\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2782_10851164","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define D(x) cout << #x \" = \" << (x) << endl\n#define un(x) x.erase(unique(x.begin(), x.end()), x.end())\n#define sf(n) scanf(\"%d\", &n)\n#define sff(a,b) scanf(\"%d %d\", &a, &b)\n#define sfff(a,b,c) scanf(\"%d %d %d\", &a, &b, &c)\n#define pb push_back\n#define mp make_pair\n#define xx first\n#define yy second\n#define hp (LL) 999983\n#define MAX 100000\n#define eps 1e-9\n#define pi acos(-1.00)\ntypedef long long int LL;\ntypedef pair<int,int> pii;\n\nint global_id;\nmap<string, int> M;\n\nstruct node{\n char name[24];\n int ID, motiv;\n\n node(){}\n node(char *str, int mtv, int _id){\n strcpy(name, str);\n motiv = mtv;\n ID = _id;\n }\n};\n\nbool operator < (const node &u, const node &v){\n if(u.motiv == v.motiv) return u.ID > v.ID;\n return u.motiv > v.motiv;\n}\n\nbool operator == (const node &u, const node &v){\n return u.ID == v.ID;\n}\n\nbool operator <= (const node &u, const node &v){\n return (u < v || u == v);\n}\n\nstruct Treap{\n node val;\n int prior, cnt;\n Treap *l, *r;\n\n Treap(node v){\n l = 0;\n r = 0;\n val = v;\n prior = (rand() << 15) + rand();\n cnt = 1;\n }\n};\n\nint sz(Treap *t) {return (t == NULL) ? 0:t->cnt;}\nvoid upd_sz(Treap *t){\n if(t) t->cnt = 1 + sz(t->l) + sz(t->r);\n}\n\nvoid split(Treap *t, Treap *&l, Treap *&r, node key)\n{\n if(!t) l = r = NULL;\n else if(t->val <= key) {split(t->r, t->r, r, key); l = t;}\n else {split(t->l, l, t->l, key); r = t;}\n upd_sz(t);\n}\n\nvoid merge(Treap *&t, Treap *l, Treap *r){\n if(!l || !r) t = l ? l : r;\n else if(l->prior > r->prior) {merge(l->r, l->r, r); t = l;}\n else {merge(r->l, l, r->l), t = r;}\n upd_sz(t);\n}\n\nvoid insert(Treap *&t, Treap *it){\n if(!t) t = it;\n else if(it->prior > t->prior) {split(t, it->l, it->r, it->val); t = it;}\n else if( (it->val <= t->val) == false) insert(t->r, it);\n else insert(t->l, it);\n upd_sz(t);\n}\n\nvoid erase(Treap *&t, node key){\n if(!t) return;\n else if(t->val == key) {Treap *temp = t; merge(t, t->l, t->r); delete(temp);}\n else if( (key <= t->val) == false) erase(t->r, key);\n else erase(t->l, key);\n upd_sz(t);\n}\n\nnode find_kth(Treap *cur, int k)\n{\n if(sz(cur->l) < k)\n {\n k -= sz(cur->l);\n if(k == 1) return cur->val;\n return find_kth(cur->r, k - 1);\n }\n return find_kth(cur->l, k);\n}\n\nint canWork(int n) {return n / 5;}\n\n\nint n;\nTreap *working, *idle;\nchar str[33], sgn[3];\nstring S;\nset<int> working_id, idle_id;\nint motivation[5000000];\nchar pending_print[1111];\n\nvoid welcomeNewMember(bool printFlag)\n{\n n++;\n\n int mtv;\n Treap *current;\n node lastOne;\n\n\n global_id++;\n scanf(\"%s %d\", str, &mtv);\n motivation[global_id] = mtv;\n\n S = string(str);\n M[S] = global_id;\n\n current = new Treap(node(str, mtv, global_id));\n pending_print[0] = 0;\n\n if(canWork(n) != canWork(n - 1))\n {\n node idleFront = find_kth(idle, 1);\n if(idleFront.motiv > mtv){\n erase(idle, idleFront);\n idle_id.erase(idleFront.ID);\n\n insert(working, new Treap(idleFront));\n working_id.insert(idleFront.ID);\n\n strcat(pending_print, idleFront.name);\n strcat(pending_print, \" is working hard now.\");\n }\n }\n\n if(sz(working) < canWork(n))\n {\n insert(working, current);\n if(printFlag) printf(\"%s is working hard now.\\n\", str);\n working_id.insert(global_id);\n }\n else{\n if(sz(working)){\n lastOne = find_kth(working, sz(working));\n if(lastOne.motiv <= mtv){\n erase(working, lastOne);\n insert(working, current);\n insert(idle, new Treap(lastOne));\n\n working_id.insert(global_id);\n working_id.erase(M[lastOne.name]);\n idle_id.insert(M[lastOne.name]);\n\n if(printFlag) printf(\"%s is working hard now.\\n\", str);\n if(printFlag) printf(\"%s is not working now.\\n\", lastOne.name);\n }\n else\n {\n idle_id.insert(global_id);\n insert(idle, current);\n if(printFlag) printf(\"%s is not working now.\\n\", str);\n }\n }\n else\n {\n idle_id.insert(global_id);\n insert(idle, current);\n if(printFlag) printf(\"%s is not working now.\\n\", str);\n }\n }\n\n if(pending_print[0] && printFlag) puts(pending_print);\n}\n\nvoid removeSomeone(){\n n--;\n\n Treap *current;\n node lastOne, firstOne;\n\n scanf(\"%s\", str);\n int getID = M[str];\n\n\n if(idle_id.find(getID) != idle_id.end()){\n idle_id.erase(getID);\n erase(idle, node(str, motivation[getID], getID));\n }\n else{\n working_id.erase(getID);\n erase(working, node(str, motivation[getID], getID));\n }\n\n while(sz(working) > canWork(n)){\n lastOne = find_kth(working, sz(working));\n\n working_id.erase(lastOne.ID);\n erase(working, lastOne);\n\n\n idle_id.insert(lastOne.ID);\n insert(idle, new Treap(lastOne));\n printf(\"%s is not working now.\\n\", lastOne.name);\n }\n\n while(sz(working) < canWork(n)){\n firstOne = find_kth(idle, 1);\n\n idle_id.erase(firstOne.ID);\n erase(idle, firstOne);\n\n\n working_id.insert(firstOne.ID);\n insert(working, new Treap(firstOne));\n printf(\"%s is working hard now.\\n\", firstOne.name);\n }\n}\n\nint main()\n{\n //freopen(\"in.txt\", \"r\", stdin);\n srand(time(0));\n int i, j, k, mtv, q, N;\n Treap *current;\n node lastOne;\n\n sf(N);\n for(i = 1; i <= N; i++)\n welcomeNewMember(false);\n\n sf(q);\n while(q--){\n scanf(\"%s\", sgn);\n\n if(sgn[0] == '+') welcomeNewMember(true);\n else removeSomeone();\n }\n\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":13628,"score_of_the_acc":-0.9993,"final_rank":9},{"submission_id":"aoj_2782_10691086","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define inf 0x3f3f3f3f\nstruct node\n{\n\tstring name;\n\tint id,val;\n\tnode(){}\n\tnode(string _s,int _id,int _val)\n\t{\n\t\tname=_s,id=_id,val=_val;\n\t}\n\tbool operator<(const node &A)const\n\t{\n\t\tif(val!=A.val)return val>A.val;\n\t\treturn id>A.id;\n\t}\n};\nset<node>se;\nset<node>::iterator it;\nnode la=node(\"\",inf,inf);\nmap<string,node>mp;\nvoid init()\n{\n\tint t=se.size()/5;\n\tit=se.begin();\n\tfor(int i=0;i<t;i++)\n\t{\n\t\tla=*(it);\n\t\tit++;\n\t}\n}\nvoid add(node no)\n{\n\tse.insert(no);\n\tmp[no.name]=no;\n\tint x=se.size()/5,y=se.size()%5;\n\tif(x==0)\n\t{\n\t\tcout<<no.name<<\" is not working now.\\n\";\n\t}\n\telse if(x==1&&y==0)\n\t{\n\t\tit=se.begin();\n\t\tla=*(se.begin());\n\t\tif(la<no)\n\t\t{\n\t\t\tcout<<no.name<<\" is not working now.\\n\";\n\t\t\tcout<<la.name<<\" is working hard now.\\n\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout<<no.name<<\" is working hard now.\\n\";\n\t\t}\n\t}\n\telse if(y==0)\n\t{\n\t\tif(la<no)\n\t\t{\n\t\t\tit=se.find(la);\n\t\t\tit++;\n\t\t\tla=*(it);\n\t\t\tif(la.name==no.name)\n\t\t\t{\n\t\t\t\tcout<<no.name<<\" is working hard now.\\n\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcout<<no.name<<\" is not working now.\\n\";\n\t\t\t\tcout<<la.name<<\" is working hard now.\\n\";\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout<<no.name<<\" is working hard now.\\n\";\n\t\t}\n\t}\n\telse\n\t{\n\t\tif(la<no)\n\t\t{\n\t\t\tcout<<no.name<<\" is not working now.\\n\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout<<no.name<<\" is working hard now.\\n\";\n\t\t\tcout<<la.name<<\" is not working now.\\n\";\n\t\t\tit=se.find(la);\n\t\t\tit--;\n\t\t\tla=*(it);\n\t\t}\n\t}\n}\nvoid sub(node no)\n{\n\tint x=(se.size()-1)/5,y=(se.size()-1)%5;\n\tif(y==4)\n\t{\n\t\tif(la<no)\n\t\t{\n\t\t\tcout<<la.name<<\" is not working now.\\n\";\n\t\t\tit=se.find(la);\n\t\t\tif(it!=se.begin())\n\t\t\t{\n\t\t\t\tit--;la=*(it);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tla=node(\"\",inf,inf);\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tif(!(la<no))\n\t\t{\n\t\t\tit=se.find(la);\n\t\t\tit++;\n\t\t\tla=*(it);\n\t\t\tcout<<la.name<<\" is working hard now.\\n\";\n\t\t}\n\t}\n\tse.erase(no);\n}\nint main()\n{\n\tint n;\n\tscanf(\"%d\",&n);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tchar s[25];int k;\n\t\tscanf(\"%s %d\",s,&k);\n\t\tse.insert(node(s,i,k));\n\t\tmp[s]=node(s,i,k);\n\t}\n\tinit();\n\tint m;\n\tscanf(\"%d\",&m);\n\tfor(int i=n;i<n+m;i++)\n\t{\n\t\tchar s[25];\n\t\tscanf(\"%s\",s);\n\t\tif(s[0]=='+')\n\t\t{\n\t\t\tint k;\n\t\t\tscanf(\"%s %d\",s,&k);\n\t\t\tadd(node(s,i,k));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tscanf(\"%s\",s);\n\t\t\tsub(mp[s]);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":0.2878787878787879,"time_ms":50,"memory_kb":13716,"score_of_the_acc":-0.7641,"final_rank":17},{"submission_id":"aoj_2782_10691077","code_snippet":"#include <map>\n#include <queue>\n#include <string>\n#include <cstdio>\n#include <vector>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\nconst int N = 70007;\n\nstruct A{ int val, id; char nm[25]; A(){} };;\nstruct B{\n int val, id; char nm[25];\n bool operator<(const B& b)const{\n if (val==b.val) return id<b.id;\n return val<b.val;\n }\n};\n\nstruct cmp{\n bool operator()(A a, A b){\n if (a.val==b.val) return a.id<b.id;\n return a.val<b.val;\n }\n};\n\nstruct ccmp{\n bool operator()(A a, A b){\n if (a.val==b.val) return a.id>b.id;\n return a.val>b.val;\n }\n};\n\nint n, m, id, a, num, lft, rht, sl, sr, fl;\nchar ss[25], ch[5];\nB ini[50005];\nmap<string, int> mbig, msma;\n\nint main(){\n int i, j, k;\n while (~scanf(\"%d\", &n)){\n num = n; id = n-1;\n lft = num/5; rht = num-lft;\n for (i=0; i<n; ++i){\n scanf(\"%s%d\", ini[i].nm, &ini[i].val);\n ini[i].id = i;\n }\n sort(ini, ini+n);\n priority_queue<A, vector<A>, cmp> big;\n priority_queue<A, vector<A>, ccmp> sma;\n\n A tmp, nw;\n mbig.clear(); msma.clear();\n for (i=0; i<rht; ++i){\n tmp.id = ini[i].id;\n tmp.val = ini[i].val;\n strcpy(tmp.nm, ini[i].nm);\n mbig[ini[i].nm] = tmp.id;\n big.push(tmp);\n }\n for (i=rht; i<n; ++i){\n tmp.id = ini[i].id;\n tmp.val = ini[i].val;\n strcpy(tmp.nm, ini[i].nm);\n msma[ini[i].nm] = tmp.id;\n sma.push(tmp);\n }\n\n scanf(\"%d\", &m);\n for (k=0; k<m; k++){\n scanf(\"%s\", ch);\n if (ch[0]=='-'){\n scanf(\"%s\", ss); num--;\n sl = num/5; sr = num-sl;\n if (mbig.find(ss)!=mbig.end()){\n mbig.erase(ss); rht--;\n if(rht<sr){\n while (!sma.empty()){\n tmp = sma.top(); sma.pop();\n if (msma.find(tmp.nm)!=msma.end()){\n msma.erase(tmp.nm);\n mbig[tmp.nm] = tmp.id;\n big.push(tmp); rht++; lft--;\n printf(\"%s is not working now.\\n\", tmp.nm);\n break;\n }\n }\n }\n }else{\n msma.erase(ss); lft--;\n if (lft<sl){\n while (!big.empty()){\n tmp = big.top(); big.pop();\n if (mbig.find(tmp.nm)!=mbig.end()){\n mbig.erase(tmp.nm);\n msma[tmp.nm] = tmp.id;\n printf(\"%s is working hard now.\\n\", tmp.nm);\n sma.push(tmp); lft++; rht--;\n break;\n }\n }\n }\n }\n }else{\n scanf(\"%s%d\", ss, &a); num++; id++;\n sl = num/5; sr = num-sl;\n strcpy(nw.nm, ss);\n nw.val = a; nw.id = id;\n if (lft<sl){\n while (!big.empty()){\n tmp = big.top(); big.pop();\n if (mbig.find(tmp.nm)!=mbig.end()){\n mbig.erase(tmp.nm);\n break;\n }\n }\n if (nw.val>=tmp.val){\n msma[nw.nm] = nw.id;\n mbig[tmp.nm] = tmp.id;\n big.push(tmp);\n sma.push(nw);\n printf(\"%s is working hard now.\\n\", nw.nm);\n }else{\n mbig[nw.nm] = nw.id;\n msma[tmp.nm] = tmp.id;\n big.push(nw);\n sma.push(tmp);\n printf(\"%s is not working now.\\n\", nw.nm);\n printf(\"%s is working hard now.\\n\", tmp.nm);\n }\n lft++;\n }else if (rht<sr){\n if (sma.empty()){\n mbig[nw.nm] = nw.id;\n big.push(nw);\n printf(\"%s is not working now.\\n\", nw.nm);\n }else{\n while (!sma.empty()){\n tmp = sma.top(); sma.pop();\n if (msma.find(tmp.nm)!=msma.end()){\n msma.erase(tmp.nm);\n break;\n }\n }\n if (tmp.val<=nw.val){\n mbig[tmp.nm] = tmp.id;\n msma[nw.nm] = nw.id;\n sma.push(nw);\n big.push(tmp);\n printf(\"%s is working hard now.\\n\", nw.nm);\n printf(\"%s is not working now.\\n\", tmp.nm);\n }else{\n mbig[nw.nm] = nw.id;\n msma[tmp.nm] = tmp.id;\n sma.push(tmp);\n big.push(nw);\n printf(\"%s is not working now.\\n\", nw.nm);\n }\n }\n rht++;\n }\n }\n }\n }\n return 0;\n}","accuracy":0.19696969696969696,"time_ms":40,"memory_kb":10656,"score_of_the_acc":-0.125,"final_rank":18},{"submission_id":"aoj_2782_10358541","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n#include <map>\n#include <set>\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #include \"Src/Sequence/RunLengthEncoding.hpp\"\n// using namespace zawa;\n// #include \"atcoder/modint\"\n// using mint = atcoder::modint998244353;\nstd::map<std::string, int> map;\nint get_id(std::string S) {\n auto it = map.find(S);\n if (it != map.end()) {\n return it->second;\n }\n else {\n int res = map.size();\n return map[S] = res;\n }\n}\nint SIZE = 0;\nstd::pair<int, int> id[50010+20010]; // power, time\nusing item = std::tuple<int, int, std::string>; // power, time, name\nstd::multiset<item> small, big;\n\nvoid working(const std::string& S) {\n std::cout << S << \" is working hard now.\\n\";\n}\nvoid idle(const std::string& S) {\n std::cout << S << \" is not working now.\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int N;\n std::cin >> N;\n for (int i = 0 ; i < N ; i++) {\n std::string S;\n int a;\n std::cin >> S >> a;\n int j = get_id(S);\n id[j] = {a, i};\n SIZE++;\n big.insert(item{a, i, S});\n }\n while ((int)big.size() > SIZE / 5) {\n auto it = big.begin();\n small.insert(*it);\n big.erase(it);\n }\n int M;\n std::cin >> M;\n for (int i = 0 ; i < M ; i++) {\n char c;\n std::string S;\n std::cin >> c >> S;\n if (c == '+') {\n int p;\n std::cin >> p;\n int j = get_id(S);\n id[j] = {p, N+i};\n SIZE++;\n item cur{p, N+i, S};\n if ((int)big.size() < SIZE/5 and (small.empty() or *small.rbegin() < cur)) {\n working(S);\n big.insert(cur);\n }\n else if ((int)big.size() == SIZE/5 and big.size() and *big.begin() < cur) {\n working(S);\n big.insert(cur);\n }\n else {\n idle(S);\n small.insert(cur);\n }\n }\n else if (c == '-') {\n auto [p, t] = id[get_id(S)];\n item cur{p, t, S};\n {\n auto it = small.find(cur);\n if (it != small.end()) small.erase(it);\n else {\n it = big.find(cur);\n assert(it != big.end());\n big.erase(it);\n }\n }\n SIZE--;\n }\n else assert(false);\n if ((int)big.size() < SIZE / 5 and small.size()) {\n auto it = std::prev(small.end());\n working(std::get<2>(*it));\n big.insert(*it);\n small.erase(it);\n }\n else if ((int)big.size() > SIZE / 5) {\n auto it = big.begin();\n idle(std::get<2>(*it));\n small.insert(*it);\n big.erase(it);\n }\n }\n}","accuracy":1,"time_ms":50,"memory_kb":12288,"score_of_the_acc":-0.5242,"final_rank":6},{"submission_id":"aoj_2782_10358335","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n#include <map>\n#include <set>\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #include \"Src/Sequence/RunLengthEncoding.hpp\"\n// using namespace zawa;\n// #include \"atcoder/modint\"\n// using mint = atcoder::modint998244353;\nstd::map<std::string, int> map;\nint get_id(std::string S) {\n auto it = map.find(S);\n if (it != map.end()) {\n return it->second;\n }\n else {\n int res = map.size();\n return map[S] = res;\n }\n}\nint SIZE = 0;\nstd::pair<int, int> id[50010+20010]; // power, time\nusing item = std::tuple<int, int, std::string>; // power, time, name\nstd::multiset<item> small, big;\n\nvoid working(const std::string& S) {\n std::cout << S << \" is working hard now.\\n\";\n}\nvoid idle(const std::string& S) {\n std::cout << S << \" is not working now.\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int N;\n std::cin >> N;\n for (int i = 0 ; i < N ; i++) {\n std::string S;\n int a;\n std::cin >> S >> a;\n int j = get_id(S);\n id[j] = {a, i};\n SIZE++;\n big.insert(item{a, i, S});\n }\n while ((int)big.size() > SIZE / 5) {\n auto it = big.begin();\n small.insert(*it);\n big.erase(it);\n }\n int M;\n std::cin >> M;\n for (int i = 0 ; i < M ; i++) {\n char c;\n std::string S;\n std::cin >> c >> S;\n if (c == '+') {\n int p;\n std::cin >> p;\n int j = get_id(S);\n id[j] = {p, N+i};\n SIZE++;\n item cur{p, N+i, S};\n if ((int)big.size() < SIZE/5 and (small.empty() or *small.rbegin() < cur)) {\n working(S);\n big.insert(cur);\n }\n else if ((int)big.size() == SIZE/5 and big.size() and *big.begin() < cur) {\n working(S);\n big.insert(cur);\n }\n else {\n idle(S);\n small.insert(cur);\n }\n }\n else if (c == '-') {\n auto [p, t] = id[get_id(S)];\n item cur{p, t, S};\n {\n auto it = small.find(cur);\n if (it != small.end()) small.erase(it);\n else {\n it = big.find(cur);\n assert(it != big.end());\n big.erase(it);\n }\n }\n SIZE--;\n }\n else assert(false);\n if ((int)big.size() < SIZE / 5 and small.size()) {\n auto it = std::prev(small.end());\n working(std::get<2>(*it));\n big.insert(*it);\n small.erase(it);\n }\n else if ((int)big.size() > SIZE / 5) {\n auto it = big.begin();\n idle(std::get<2>(*it));\n small.insert(*it);\n big.erase(it);\n }\n }\n}","accuracy":1,"time_ms":50,"memory_kb":12288,"score_of_the_acc":-0.5242,"final_rank":6},{"submission_id":"aoj_2782_10260027","code_snippet":"// AOJ #2782 We don't wanna work!\n// 2025.3.2\n\n#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\nusing namespace std;\nusing namespace __gnu_pbds;\n\nstruct M {\n int m, j;\n string n;\n};\n\nstruct cmp {\n bool operator()(const M &a, const M &b) const {\n if(a.m != b.m) return a.m > b.m;\n return a.j > b.j;\n }\n};\n\ntypedef tree<M, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update> ost;\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N; cin >> N;\n ost T;\n unordered_map<string, M> R;\n unordered_map<string, bool> S;\n int cnt = 0;\n for(int i = 0; i < N; i++){\n string s; int a; cin >> s >> a;\n cnt++;\n M x{a, cnt, s};\n T.insert(x);\n R[s] = x;\n }\n int t = (int)T.size() * 20 / 100;\n for(auto it = T.begin(); it != T.end(); it++){\n int pos = T.order_of_key(*it);\n S[it->n] = (pos < t);\n }\n int Mcnt; cin >> Mcnt;\n for(int i = 0; i < Mcnt; i++){\n char op; cin >> op;\n int oldSize = T.size();\n int oldt = (oldSize * 20) / 100;\n if(op == '+'){\n string s; int a; cin >> s >> a;\n cnt++;\n M x{a, cnt, s};\n T.insert(x);\n R[s] = x;\n int newSize = T.size();\n int nt = (newSize * 20) / 100;\n int pos = T.order_of_key(x);\n bool w = (pos < nt);\n S[s] = w;\n cout << s << (w ? \" is working hard now.\" : \" is not working now.\") << endl;\n if(nt > 0){\n M cand = *T.find_by_order(nt - 1);\n if(!S[cand.n]){\n S[cand.n] = true;\n cout << cand.n << \" is working hard now.\" << endl;\n }\n }\n if(nt < newSize){\n M cand = *T.find_by_order(nt);\n if(S[cand.n]){\n S[cand.n] = false;\n cout << cand.n << \" is not working now.\" << endl;\n }\n }\n } else {\n string s; cin >> s;\n M x = R[s];\n T.erase(x);\n R.erase(s);\n S.erase(s);\n int newSize = T.size();\n int nt = (newSize * 20) / 100;\n if(newSize > 0){\n if(nt > 0){\n M cand = *T.find_by_order(nt - 1);\n if(!S[cand.n]){\n S[cand.n] = true;\n cout << cand.n << \" is working hard now.\" << endl;\n }\n }\n if(nt < newSize){\n M cand = *T.find_by_order(nt);\n if(S[cand.n]){\n S[cand.n] = false;\n cout << cand.n << \" is not working now.\" << endl;\n }\n }\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":16504,"score_of_the_acc":-1.3575,"final_rank":12},{"submission_id":"aoj_2782_10238690","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Human {\n string name;\n int power;\n int joined;\n};\n\nbool operator<(const Human &a1, const Human &a2) {\n if (a1.power > a2.power) return true;\n if (a1.power < a2.power) return false;\n if (a1.joined > a2.joined) return true;\n return false;\n}\n\nint main() {\n // Input (Former)\n int N; cin >> N;\n vector<Human> P(N);\n for (int i = 0; i < N; i++) cin >> P[i].name >> P[i].power;\n for (int i = 0; i < N; i++) P[i].joined = i;\n int Q; cin >> Q;\n\n // Input (Latter)\n vector<pair<char, Human>> Change(Q);\n map<string, pair<int, int>> PowerList;\n for (int i = 0; i < N; i++) PowerList[P[i].name] = make_pair(P[i].power, P[i].joined);\n for (int i = 0; i < Q; i++) {\n cin >> Change[i].first;\n if (Change[i].first == '+') {\n cin >> Change[i].second.name >> Change[i].second.power;\n Change[i].second.joined = N + i;\n PowerList[Change[i].second.name] = make_pair(Change[i].second.power, Change[i].second.joined);\n }\n if (Change[i].first == '-') {\n cin >> Change[i].second.name;\n Change[i].second.power = PowerList[Change[i].second.name].first;\n Change[i].second.joined = PowerList[Change[i].second.name].second;\n PowerList[Change[i].second.name] = make_pair(0, 0);\n }\n }\n\n // Step 2. Query Init\n set<Human> Strong;\n set<Human> Weak;\n for (int i = 0; i < N; i++) Strong.insert(P[i]);\n while (Strong.size() * 4 > Weak.size()) {\n auto itr = Strong.end(); itr--;\n Weak.insert(*itr);\n Strong.erase(*itr);\n }\n\n // Step 3. Update\n for (int i = 0; i < Q; i++) {\n // Addition\n if (Change[i].first == '+') {\n int sz = Strong.size() + Weak.size();\n string verdict = \"lazy\";\n if (sz % 5 == 4) {\n auto itr = Weak.begin();\n if (Change[i].second < (*itr)) verdict = \"hard\";\n }\n else if (sz >= 5) {\n auto itr = Strong.end(); itr--;\n if (Change[i].second < (*itr)) verdict = \"hard\";\n }\n if (verdict == \"lazy\") {\n cout << Change[i].second.name << \" is not working now.\" << endl;\n Weak.insert(Change[i].second);\n }\n else {\n cout << Change[i].second.name << \" is working hard now.\" << endl;\n Strong.insert(Change[i].second);\n }\n }\n\n // Deletion\n if (Change[i].first == '-') {\n Strong.erase(Change[i].second);\n Weak.erase(Change[i].second);\n }\n\n // Update\n while (Strong.size() * 4 > Weak.size()) {\n auto itr = Strong.end(); itr--;\n cout << (*itr).name << \" is not working now.\" << endl;\n Weak.insert(*itr);\n Strong.erase(*itr);\n }\n while (Strong.size() * 4 + 4 < Weak.size()) {\n auto itr = Weak.begin();\n cout << (*itr).name << \" is working hard now.\" << endl;\n Strong.insert(*itr);\n Weak.erase(*itr);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":14464,"score_of_the_acc":-1.1398,"final_rank":10},{"submission_id":"aoj_2782_9742912","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nmap<string,int> mps;\nvector<string> SV;\nvector<int> X;\nint scur = 0;\nint getstring() {\n string s;\n cin >> s;\n if (mps.count(s)) return mps[s];\n SV.push_back(s);\n X.push_back(0);\n mps[s] = scur;\n scur++;\n return scur-1;\n}\n\nint main() {\n int N;\n cin >> N;\n set<pair<int,int>> Left, Right;\n int LC = N, RC = 0;\n rep(i,0,N) {\n int A = getstring();\n int B;\n cin >> B;\n Left.insert({B,A});\n X[A] = B;\n }\n while(RC < N/5) {\n pair<int,int> P = *Left.rbegin();\n Left.erase(P);\n Right.insert(P);\n LC--, RC++;\n }\n auto Balancing = [&]() -> void {\n int RS = (LC+RC)/5;\n while(RC < RS) {\n pair<int,int> P = *Left.rbegin();\n Left.erase(P);\n Right.insert(P);\n LC--, RC++;\n cout << SV[P.second] << \" is working hard now.\" << endl;\n }\n while(RC > RS) {\n pair<int,int> P = *Right.begin();\n Right.erase(P);\n Left.insert(P);\n LC++, RC--;\n cout << SV[P.second] << \" is not working now.\" << endl;\n }\n };\n int Q;\n cin >> Q;\n while(Q--) {\n char C;\n cin >> C;\n int A = getstring();\n if (C == '+') {\n int B;\n cin >> B;\n X[A] = B;\n pair<int,int> P = {B,A};\n X.push_back(B);\n int RS = (LC+RC+1)/5;\n pair<int,int> L1, R1;\n if (Left.empty()) L1 = {-inf,-inf};\n else L1 = *Left.rbegin();\n if (Right.empty()) R1 = {inf,inf};\n else R1 = *Right.begin();\n if (P < L1) {\n Left.insert(P);\n LC++;\n cout << SV[P.second] << \" is not working now.\" << endl;\n }\n else if (R1 < P) {\n Right.insert(P);\n RC++;\n cout << SV[P.second] << \" is working hard now.\" << endl;\n }\n else {\n if (RS == RC) {\n Left.insert(P);\n LC++;\n cout << SV[P.second] << \" is not working now.\" << endl;\n }\n else {\n Right.insert(P);\n RC++;\n cout << SV[P.second] << \" is working hard now.\" << endl;\n }\n }\n Balancing();\n }\n else {\n pair<int,int> P = {X[A],A};\n if (Left.count(P)) Left.erase(P), LC--;\n if (Right.count(P)) Right.erase(P), RC--;\n Balancing();\n mps.erase(SV[A]);\n }\n }\n}","accuracy":1,"time_ms":80,"memory_kb":11656,"score_of_the_acc":-0.793,"final_rank":8},{"submission_id":"aoj_2782_9742903","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nmap<string,int> mps;\nvector<string> SV;\nvector<int> X;\nint scur = 0;\nint getstring() {\n string s;\n cin >> s;\n if (mps.count(s)) return mps[s];\n SV.push_back(s);\n X.push_back(0);\n mps[s] = scur;\n scur++;\n return scur-1;\n}\n\nint main() {\n int N;\n cin >> N;\n set<pair<int,int>> Left, Right;\n int LC = N, RC = 0;\n rep(i,0,N) {\n int A = getstring();\n int B;\n cin >> B;\n Left.insert({B,A});\n X[A] = B;\n }\n while(RC < N/5) {\n pair<int,int> P = *Left.rbegin();\n Left.erase(P);\n Right.insert(P);\n LC--, RC++;\n }\n auto Balancing = [&]() -> void {\n int RS = (LC+RC)/5;\n while(RC < RS) {\n pair<int,int> P = *Left.rbegin();\n Left.erase(P);\n Right.insert(P);\n LC--, RC++;\n cout << SV[P.second] << \" is working hard now.\" << endl;\n }\n while(RC > RS) {\n pair<int,int> P = *Right.begin();\n Right.erase(P);\n Left.insert(P);\n LC++, RC--;\n cout << SV[P.second] << \" is not working now.\" << endl;\n }\n };\n int Q;\n cin >> Q;\n while(Q--) {\n char C;\n cin >> C;\n int A = getstring();\n if (C == '+') {\n int B;\n cin >> B;\n X[A] = B;\n pair<int,int> P = {B,A};\n X.push_back(B);\n int RS = (LC+RC+1)/5;\n pair<int,int> L1, R1;\n if (Left.empty()) L1 = {-inf,-inf};\n else L1 = *Left.rbegin();\n if (Right.empty()) R1 = {inf,inf};\n else R1 = *Right.begin();\n if (P < L1) {\n Left.insert(P);\n LC++;\n cout << SV[P.second] << \" is not working now.\" << endl;\n }\n else if (R1 < P) {\n Right.insert(P);\n RC++;\n cout << SV[P.second] << \" is working hard now.\" << endl;\n }\n else {\n if (RS == RC) {\n Left.insert(P);\n LC++;\n cout << SV[P.second] << \" is not working now.\" << endl;\n }\n else {\n Right.insert(P);\n RC++;\n cout << SV[P.second] << \" is working hard now.\" << endl;\n }\n }\n Balancing();\n }\n else {\n pair<int,int> P = {X[A],A};\n if (Left.count(P)) Left.erase(P), LC--;\n if (Right.count(P)) Right.erase(P), RC--;\n Balancing();\n }\n }\n}","accuracy":0.15151515151515152,"time_ms":70,"memory_kb":12172,"score_of_the_acc":-0.7547,"final_rank":20},{"submission_id":"aoj_2782_9669019","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nint main(){\n ll N;cin>>N;\n set<pi>workhorse,idle;\n map<ll,string>name;\n map<string,pi>st;\n REP(i,N){\n string t;cin>>t;\n name[i]=t;\n ll m;cin>>m;\n st[t]=pi(m,i);\n idle.insert(pi(m,i));\n }\n while(workhorse.size()<N/5){\n workhorse.insert(*prev(idle.end()));\n idle.erase(prev(idle.end()));\n }\n ll Q,now=N;cin>>Q;\n REP(i,Q){\n char c;string t;cin>>c>>t;\n if(c=='+'){\n ll m;cin>>m;\n name[now]=t;\n N++;\n pi p=pi(m,now++);\n st[t]=p;\n if(workhorse.size()&&*workhorse.begin()<p){\n workhorse.insert(p);\n cout<<t<<\" is working hard now.\"<<endl;\n }\n else if(idle.size()&&*prev(idle.end())>p){\n idle.insert(p);\n cout<<t<<\" is not working now.\"<<endl;\n }\n else if(N%5==0){\n workhorse.insert(p);\n cout<<t<<\" is working hard now.\"<<endl;\n }\n else{\n idle.insert(p);\n cout<<t<<\" is not working now.\"<<endl;\n }\n }\n else{\n N--;\n auto p=st[t];\n workhorse.erase(p);\n idle.erase(p);\n }\n while(workhorse.size()!=N/5){\n if(workhorse.size()>N/5){\n auto p=*workhorse.begin();\n cout<<name[p.second]<<\" is not working now.\"<<endl;\n idle.insert(p);\n workhorse.erase(p);\n }\n else{\n auto p=*prev(idle.end());\n cout<<name[p.second]<<\" is working hard now.\"<<endl;\n workhorse.insert(p);\n idle.erase(p);\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":16608,"score_of_the_acc":-1.625,"final_rank":14},{"submission_id":"aoj_2782_9437106","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<vvb> vvvb;\ntypedef vector<vvvb> vvvvb;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) RFOR(i,0,n)\n#define sz(A) (ll)(A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())\n#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())\n#define COU(A,x) (UB(A,x)-LB(A,x))\n#define F first\n#define S second\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<\" \"<<p.S;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}\ntemplate<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}\nconst ll mod=998244353;\nint main(){\n while(1){\n ll N;cin>>N;\n vector<string>S(N);\n vi A(N);\n REP(i,N)cin>>S[i]>>A[i];\n set<pair<pi,string>>Q1;\n set<pair<pi,string>>Q2;\n map<string,pi>memo;\n REP(i,N)memo[S[i]]=pi(A[i],i-N);\n REP(i,N)Q1.insert(make_pair(pi(A[i],i-N),S[i]));\n while(sz(Q1)>N/5){\n Q2.insert(*Q1.begin());Q1.erase(Q1.begin());\n }\n //for(auto i:Q1)cout<<i<<\" \";cout<<endl;\n //for(auto i:Q2)cout<<i<<\" \";cout<<endl;\n ll M;cin>>M;\n REP(_,M){\n char c;cin>>c;\n if(c=='+'){\n string s;cin>>s;\n ll a;cin>>a;\n memo[s]=pi(a,_);\n N++;\n if(N/5==0){\n cout<<s<<\" is not working now.\"<<endl;\n Q2.insert(make_pair(memo[s],s));\n }\n else if(!sz(Q1)){\n auto p=*prev(Q2.end());\n if(p.F<memo[s]){\n cout<<s<<\" is working hard now.\"<<endl;\n Q1.insert(make_pair(memo[s],s));\n }\n else{\n cout<<s<<\" is not working now.\"<<endl;\n Q2.insert(make_pair(memo[s],s));\n cout<<p.S<<\" is working hard now.\"<<endl;\n Q2.erase(p);\n Q1.insert(p);\n }\n }\n else if(memo[s]>(*Q1.begin()).F){\n cout<<s<<\" is working hard now.\"<<endl;\n Q1.insert(make_pair(memo[s],s));\n if(sz(Q1)>N/5){\n auto p=*Q1.begin();\n cout<<p.S<<\" is not working now.\"<<endl;\n Q1.erase(p);\n Q2.insert(p);\n }\n }\n else if(memo[s]<(*prev(Q2.end())).F){\n cout<<s<<\" is not working now.\"<<endl;\n Q2.insert(make_pair(memo[s],s));\n if(sz(Q1)<N/5){\n auto p=*prev(Q2.end());\n cout<<p.S<<\" is working hard now.\"<<endl;\n Q2.erase(p);\n Q1.insert(p);\n }\n }\n else if(sz(Q1)==N/5){\n cout<<s<<\" is not working now.\"<<endl;\n Q2.insert(make_pair(memo[s],s));\n }\n else{\n cout<<s<<\" is working hard now.\"<<endl;\n Q1.insert(make_pair(memo[s],s));\n }\n }\n else{\n string s;cin>>s;\n if(Q1.count(make_pair(memo[s],s)))Q1.erase(make_pair(memo[s],s));\n else Q2.erase(make_pair(memo[s],s));\n N--;\n if(sz(Q1)>N/5){\n cout<<(*Q1.begin()).S<<\" is not working now.\"<<endl;\n Q2.insert(*Q1.begin());\n Q1.erase(Q1.begin());\n }\n if(sz(Q1)<N/5&&N){\n cout<<(*prev(Q2.end())).S<<\" is working hard now.\"<<endl;\n Q1.insert(*prev(Q2.end()));\n Q2.erase(prev(Q2.end()));\n }\n }\n }\n break;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":14976,"score_of_the_acc":-1.2258,"final_rank":11},{"submission_id":"aoj_2782_8491765","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2782.cc: We don't wanna work!\n */\n\n#include<cstdio>\n#include<string>\n#include<map>\n#include<set>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 50000 + 20000;\n\n/* typedef */\n\ntypedef pair<int,int> pii;\ntypedef map<string,int> msi;\ntypedef set<pii> spii;\n\n/* global variables */\n\nstring ss[MAX_N];\nint as[MAX_N];\npii ps[MAX_N];\n\n/* subroutines */\n\nint normalize(spii &q0, spii &q1) {\n int l0 = q0.size(), l1 = q1.size(), l = l0 + l1;\n int r = -1;\n\n if (l1 > l / 5) { // q1->q0\n auto sit = q1.begin();\n r = sit->second;\n q0.insert(*sit);\n q1.erase(sit);\n }\n else if (l0 > l - l / 5) { // q0->q1\n auto sit = q0.end(); sit--;\n r = sit->second;\n q1.insert(*sit);\n q0.erase(sit);\n }\n\n return r;\n}\n\ninline bool working(spii &q1, int i) {\n return q1.find(pii(as[i], i)) != q1.end();\n}\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n\n msi smap;\n for (int i = 0; i < n; i++) {\n char s[32];\n scanf(\"%s%d\", s, as + i);\n ss[i] = string(s);\n smap[ss[i]] = i;\n ps[i] = pii(as[i], i);\n }\n sort(ps, ps + n);\n\n int l1 = n / 5, l0 = n - l1;\n spii q0(ps, ps + l0), q1(ps + l0, ps + n);\n \n int m;\n scanf(\"%d\", &m);\n\n while (m--) {\n char op[4], s[32];\n scanf(\"%s%s\", op, s);\n\n if (op[0] == '+') {\n scanf(\"%d\", as + n);\n ss[n] = string(s);\n smap[ss[n]] = n;\n pii pi(as[n], n);\n\n if (! q1.empty() && *(q1.begin()) < pi) q1.insert(pi);\n else q0.insert(pi);\n int r = normalize(q0, q1);\n\n if (working(q1, n))\n\tprintf(\"%s is working hard now.\\n\", ss[n].c_str());\n else\n\tprintf(\"%s is not working now.\\n\", ss[n].c_str());\n\n if (r >= 0 && r != n) {\n\tif (working(q1, r))\n\t printf(\"%s is working hard now.\\n\", ss[r].c_str());\n\telse\n\t printf(\"%s is not working now.\\n\", ss[r].c_str());\n }\n\n n++;\n }\n else { // op[0] == '-'\n int k = smap[string(s)];\n\n if (working(q1, k)) {\n\tq1.erase(pii(as[k], k));\n\t//printf(\"%s is not working now.\\n\", ss[k].c_str());\n }\n else {\n\tq0.erase(pii(as[k], k));\n }\n\n int r = normalize(q0, q1);\n if (r >= 0) {\n\tif (working(q1, r))\n\t printf(\"%s is working hard now.\\n\", ss[r].c_str());\n\telse\n\t printf(\"%s is not working now.\\n\", ss[r].c_str());\n }\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":12628,"score_of_the_acc":-0.3313,"final_rank":2},{"submission_id":"aoj_2782_7939205","code_snippet":"#include <bits/stdc++.h>\n#define N 100010\nusing namespace std;\ntypedef pair<pair<int, int>, int> Type;\nmap<string, int> A;\nset<Type> Q1, Q2;\nset<Type>::iterator it;\nint n, cnt, m, val[N], Time[N];\nchar name[N][30], s[30], opt[30];\nint main() {\n scanf(\"%d\", &n);\n for (int i = 1; i <= n; i++) {\n int v, id;\n scanf(\"%s%d\", s, &v);\n if (!A.count((string)s)) {\n A[(string)s] = ++cnt;\n int l = strlen(s);\n for (int j = 0; j < l; j++)\n name[cnt][j] = s[j];\n name[cnt][l] = 0;\n }\n id = A[(string)s];\n val[id] = v;\n Time[id] = i;\n Q2.insert(make_pair(make_pair(v, i), id));\n }\n int size = cnt;\n int K = size / 5;\n while (Q1.size() < K) {\n it = Q2.end();\n it--;\n Q1.insert(*it);\n Q2.erase(it);\n }\n scanf(\"%d\", &m);\n for (int i = 1; i <= m; i++) {\n int v, id;\n scanf(\"%s\", opt);\n if (opt[0] == '+') {\n scanf(\"%s%d\", s, &v);\n if (!A.count((string)s)) {\n A[(string)s] = ++cnt;\n int l = strlen(s);\n for (int j = 0; j < l; j++)\n name[cnt][j] = s[j];\n name[cnt][l] = 0;\n }\n id = A[(string)s];\n val[id] = v;\n Time[id] = i + n;\n size++;\n K = size / 5;\n Type now = make_pair(make_pair(v, i + n), id);\n it = Q2.end();\n it--;\n if ((*it).first.first > v) {\n printf(\"%s is not working now.\\n\", name[id]);\n Q2.insert(now);\n while (Q1.size() < K) {\n Q1.insert(*it);\n printf(\"%s is working hard now.\\n\", name[(*it).second]);\n Q2.erase(it);\n }\n } else {\n Q1.insert(now);\n it = Q1.begin();\n if ((*it).second == id && Q1.size() > K) {\n printf(\"%s is not working now.\\n\", name[id]);\n Q2.insert(*it);\n Q1.erase(it);\n } else {\n printf(\"%s is working hard now.\\n\", name[id]);\n while (Q1.size() > K) {\n printf(\"%s is not working now.\\n\", name[(*it).second]);\n Q2.insert(*it);\n Q1.erase(it);\n }\n }\n }\n } else {\n scanf(\"%s\", s);\n size--;\n K = size / 5;\n int id = A[(string)s];\n Type now = make_pair(make_pair(val[id], Time[id]), id);\n it = Q1.find(now);\n if (it == Q1.end())\n it = Q2.find(now), Q2.erase(it);\n else\n Q1.erase(it);\n while (Q1.size() > K) {\n it = Q1.begin();\n printf(\"%s is not working now.\\n\", name[(*it).second]);\n Q2.insert(*it);\n Q1.erase(it);\n }\n while (Q1.size() < K) {\n it = Q2.end();\n it--;\n printf(\"%s is working hard now.\\n\", name[(*it).second]);\n Q1.insert(*it);\n Q2.erase(it);\n }\n }\n }\n}","accuracy":1,"time_ms":110,"memory_kb":14768,"score_of_the_acc":-1.6909,"final_rank":16},{"submission_id":"aoj_2782_7939186","code_snippet":"#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#define maxn 100100\nusing namespace std;\nstruct node {\n int val, time;\n node(int val, int time) : val(val), time(time) {}\n bool operator<(const node &A) const {\n if (val == A.val)\n return time > A.time;\n return val > A.val;\n }\n};\nint n, m, val;\nint tval[maxn];\nstring op, name, mp[maxn];\nmap<string, int> tid;\nset<node> st1, st2;\nint main(void) {\n while (cin >> n) {\n st1.clear();\n st2.clear();\n tid.clear();\n for (int i = 1; i <= n; i++) {\n cin >> name >> val;\n mp[i] = name;\n tid[name] = i;\n tval[i] = val;\n st2.insert(node(val, i));\n }\n for (int i = 1; i <= n / 5; i++) {\n st1.insert(*st2.begin());\n st2.erase(st2.begin());\n }\n cin >> m;\n for (int i = 1; i <= m; i++) {\n cin >> op >> name;\n if (op == \"+\") {\n scanf(\"%d\", &val);\n tval[n + i] = val;\n mp[n + i] = name;\n tid[name] = n + i;\n if ((st1.size() + st2.size() + 1) % 5 == 0) {\n st2.insert(node(val, n + i));\n node tmp = *st2.begin();\n st2.erase(st2.begin());\n st1.insert(tmp);\n if (mp[tmp.time] != name)\n cout << name << \" is not working now.\" << endl;\n cout << mp[tmp.time] << \" is working hard now.\" << endl;\n continue;\n }\n if (!st1.empty() && val >= (*--st1.end()).val) {\n cout << name << \" is working hard now.\" << endl;\n node tmp = *--st1.end();\n st1.erase(--st1.end());\n st2.insert(tmp);\n cout << mp[tmp.time] << \" is not working now.\" << endl;\n st1.insert(node(val, n + i));\n continue;\n }\n st2.insert(node(val, n + i));\n cout << name << \" is not working now.\" << endl;\n } else {\n int ti = tid[name];\n if ((st1.size() + st2.size()) % 5 == 0) {\n if (st2.find(node(tval[ti], ti)) != st2.end()) {\n set<node>::iterator it1 = st2.find(node(tval[ti], ti));\n st2.erase(it1);\n node temp = *--st1.end();\n st1.erase(--st1.end());\n st2.insert(temp);\n cout << mp[temp.time] << \" is not working now.\" << endl;\n } else {\n set<node>::iterator it2 = st1.find(node(tval[ti], ti));\n st1.erase(it2);\n }\n } else if (st1.find(node(tval[ti], ti)) != st1.end()) {\n set<node>::iterator it3 = st1.find(node(tval[ti], ti));\n st1.erase(it3);\n node temp = *st2.begin();\n st1.insert(temp);\n st2.erase(st2.begin());\n cout << mp[temp.time] << \" is working hard now.\" << endl;\n } else {\n set<node>::iterator it4 = st2.find(node(tval[ti], ti));\n st2.erase(it4);\n }\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":13140,"score_of_the_acc":-1.4173,"final_rank":13},{"submission_id":"aoj_2782_7939167","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define maxn 100100\nstruct P1 {\n string name;\n int v, tim;\n bool operator<(const P1 &pp) const {\n if (v != pp.v)\n return v < pp.v;\n else\n return tim < pp.tim;\n }\n};\nstruct P2 {\n string name;\n int v, tim;\n bool operator<(const P2 &pp) const {\n if (v != pp.v)\n return v > pp.v;\n else\n return tim > pp.tim;\n }\n} a[maxn];\nset<P1> s1;\nset<P2> s2;\nint n, m;\nstring man;\nint v;\n#define P pair<int, int>\nmap<string, P> mp;\nP1 p2top1(P2 tmp) {\n P1 ans;\n ans.name = tmp.name;\n ans.v = tmp.v;\n ans.tim = tmp.tim;\n return ans;\n}\nP2 p1top2(P1 tmp) {\n P2 ans;\n ans.name = tmp.name;\n ans.v = tmp.v;\n ans.tim = tmp.tim;\n return ans;\n}\nint main() {\n scanf(\"%d\", &n);\n for (int i = 1; i <= n; ++i) {\n a[i].tim = i;\n cin >> a[i].name;\n scanf(\"%d\", &a[i].v);\n mp[a[i].name] = P(a[i].v, i);\n }\n sort(a + 1, a + n + 1);\n int lx = n / 5;\n for (int i = 1; i <= lx; ++i)\n s1.insert(p2top1(a[i]));\n for (int i = lx + 1; i <= n; ++i)\n s2.insert(a[i]);\n scanf(\"%d\", &m);\n int tot = n;\n for (int i = 1; i <= m; ++i) {\n int now = n + i;\n char op[5];\n scanf(\"%s\", op);\n if (*op == '+') {\n cin >> man;\n scanf(\"%d\", &v);\n mp[man] = P(v, now);\n tot++;\n set<P1>::iterator it;\n it = s1.begin();\n P1 tmp, this_man;\n if (it != s1.end()) {\n tmp = (*it);\n this_man.name = man;\n this_man.v = v;\n this_man.tim = now;\n }\n if (it != s1.end() && tmp < this_man) {\n s1.insert(this_man);\n cout << man;\n puts(\" is working hard now.\");\n if (tot % 5 != 0) {\n P1 tmp = (*it);\n P2 ttmp = p1top2(tmp);\n s1.erase(it);\n s2.insert(ttmp);\n cout << tmp.name;\n puts(\" is not working now.\");\n }\n } else {\n if (tot % 5 == 0) {\n set<P2>::iterator it;\n it = s2.begin();\n P2 this_, tmp;\n if (it != s2.end()) {\n tmp = (*it);\n this_.name = man;\n this_.v = v;\n this_.tim = now;\n } else\n tmp.v = -100000;\n if (this_ < tmp) {\n P1 cpy = p2top1(this_);\n s1.insert(cpy);\n cout << man;\n puts(\" is working hard now.\");\n } else {\n s2.erase(*it);\n P1 cpy = p2top1(tmp);\n s1.insert(cpy);\n s2.insert(this_);\n cout << man;\n puts(\" is not working now.\");\n cout << tmp.name;\n puts(\" is working hard now.\");\n }\n } else {\n P2 this_;\n this_.name = man;\n this_.v = v;\n this_.tim = now;\n s2.insert(this_);\n cout << man;\n puts(\" is not working now.\");\n }\n }\n } else {\n tot--;\n cin >> man;\n P sx = mp[man];\n set<P1>::iterator it;\n P1 tmp1;\n tmp1.name = man;\n tmp1.v = sx.first;\n tmp1.tim = sx.second;\n it = s1.find(tmp1);\n if (it == s1.end()) {\n P2 tmp2;\n tmp2 = p1top2(tmp1);\n s2.erase(tmp2);\n if (tot % 5 == 4) {\n it = s1.begin();\n tmp1 = (*it);\n s1.erase(it);\n tmp2 = p1top2(tmp1);\n s2.insert(tmp2);\n cout << tmp1.name;\n puts(\" is not working now.\");\n }\n } else {\n s1.erase(it);\n if (tot % 5 != 4) {\n set<P2>::iterator it2;\n it2 = s2.begin();\n P2 ss = (*it2);\n s2.erase(it2);\n P1 tt = p2top1(ss);\n s1.insert(tt);\n cout << ss.name;\n puts(\" is working hard now.\");\n }\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":14392,"score_of_the_acc":-1.6277,"final_rank":15},{"submission_id":"aoj_2782_7117437","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)\n\n#define all(c) std::begin(c), std::end(c)\n\n#ifdef LOCAL\n#define debug(...) debug_impl(#__VA_ARGS__, __VA_ARGS__)\ntemplate <class T, class ...Args> void debug_impl(string s, T&& f, Args &&...args) {\n cerr << \"(\" << s << \"): \" << \"(\" << forward<T>(f);\n ((cerr << \", \" << forward<Args>(args)), ..., (cerr << \")\\n\"));\n}\n#else\n#define debug(...) void(0)\n#endif\n\ntemplate <class T> bool chmax(T& a, const T& b) { return b > a ? (a = b, true) : false; }\ntemplate <class T> bool chmin(T& a, const T& b) { return b < a ? (a = b, true) : false; }\n\n\ntemplate <class T> istream& operator>>(istream& in, vector<T>& v) {\n for (auto& e : v) in >> e;\n return in;\n}\ntemplate <class ...Args> void read(Args&... args) {\n (cin >> ... >> args);\n}\n\ntemplate <class T> ostream& operator<<(ostream& out, const vector<T>& v) {\n int n = v.size();\n rep(i, n) {\n out << v[i];\n if (i + 1 != n) out << ' ';\n }\n return out;\n}\n\ntemplate <class T, class ...Tails> void print(T&& h, Tails &&... tails) {\n cout << h, ((cout << ' ' << forward<Tails>(tails)), ..., (cout << '\\n'));\n}\n\ntemplate <typename T, T(*op)(T, T), T(*e)()>\nstruct segtree {\n int n, siz;\n vector<T> dat;\n segtree(int n) : segtree(vector<T>(n, e())) {}\n segtree(vector<T> a) : n(a.size()) {\n siz = 1;\n while (siz < n) siz <<= 1;\n dat.assign(2 * siz, e());\n rep(i, n) {\n dat[siz + i] = a[i];\n }\n for (int i = n - 1; i > 0; --i) {\n dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n }\n\n T get(int p) const {\n return dat[siz + p];\n }\n\n T prod(int l, int r) const {\n T sml = e(), smr = e();\n l += siz, r += siz;\n for (; l < r; l >>= 1, r >>= 1) {\n if (l & 1) sml = op(sml, dat[l++]);\n if (r & 1) smr = op(dat[--r], smr);\n }\n return op(sml, smr);\n }\n\n T all_prod() const {\n return dat[1];\n }\n\n void set(int p, T v) {\n p += siz;\n dat[p] = v;\n while (p >>= 1) {\n dat[p] = op(dat[2 * p], dat[2 * p + 1]);\n }\n }\n};\n\nint op(int x, int y) {\n return x + y;\n}\nint e() {\n return 0;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n;\n cin >> n;\n\n vector<string> names;\n\n vector<pair<int, int>> a(n);\n\n map<string, pair<int, int>> mp;\n\n rep(i, n) {\n string s;\n int x;\n read(s, x);\n a[i] = { x, i };\n\n names.push_back(s);\n\n mp[s] = { x, i };\n }\n\n int m;\n cin >> m;\n\n vector<tuple<bool, int, int>> b(m);\n\n int nxt_id = n;\n rep(i, m) {\n char c;\n string name;\n read(c, name);\n\n if (c == '+') {\n int x;\n read(x);\n b[i] = { true, x, nxt_id };\n mp[name] = { x, nxt_id };\n names.push_back(name);\n ++nxt_id;\n } else {\n auto [x2, i2] = mp[name];\n b[i] = { false, x2, i2 };\n }\n }\n\n vector<pair<int, int>> sorted;\n for (auto [x, id] : a) {\n sorted.emplace_back(x, id);\n }\n for (auto [is_join, x, id] : b) {\n if (is_join) {\n sorted.emplace_back(x, id);\n }\n }\n sort(all(sorted), greater<>());\n\n auto get_index = [&](int x, int id) {\n return lower_bound(all(sorted), make_pair(x, id), greater<>()) - sorted.begin();\n };\n auto get_original_index = [&](int id) {\n return sorted[id].second;\n };\n\n const int k = sorted.size();\n\n vector<int8_t> hard(k, false);\n\n segtree<int, op, e> seg(k);\n\n // debug(k);\n\n {\n int top20 = n / 5;\n\n vector<pair<int, int>> xs(n);\n rep(i, n) {\n auto [x, id] = a[i];\n\n int idx = get_index(x, id);\n xs[i] = { x, id };\n assert(seg.get(idx) == 0);\n seg.set(idx, 1);\n }\n sort(all(xs), greater<>());\n\n rep(i, top20) {\n hard[xs[i].second] = true;\n }\n }\n\n // debug(seg.all_prod());\n\n auto max_index_active = [&](int num) {\n int l = -1, r = k + 1;\n while (r - l > 1) {\n int p = (l + r) >> 1;\n if (seg.prod(0, p) < num) {\n l = p;\n } else {\n r = p;\n }\n }\n // seg[0, l) < num\n // seg[0, l] >= num\n // l is last active person.\n return l;\n };\n\n auto min_index_lazy = [&](int max_active) {\n if (max_active == k) return k;\n int l = max_active + 1, r = k + 1;\n while (r - l > 1) {\n int p = (l + r) >> 1;\n if (seg.prod(max_active + 1, p) == 0) {\n l = p;\n } else {\n r = p;\n }\n }\n // seg[max_active + 1, l) = 0\n // seg[max_active + 1, l] = 1\n return l;\n };\n\n auto print_active = [&](int id) {\n print(names[id], \"is working hard now.\");\n };\n auto print_inactive = [&](int id) {\n print(names[id], \"is not working now.\");\n };\n\n for (auto [is_join, x, id] : b) {\n // debug(x, id);\n if (is_join) {\n int pos = get_index(x, id);\n assert(seg.get(pos) == 0);\n seg.set(pos, 1);\n\n int num = seg.all_prod() / 5;\n\n if (seg.prod(0, pos + 1) <= num) {\n print_active(id);\n hard[get_original_index(pos)] = true;\n } else {\n print_inactive(id);\n hard[get_original_index(pos)] = false;\n }\n } else {\n int pos = get_index(x, id);\n assert(seg.get(pos) == 1);\n seg.set(pos, 0);\n }\n\n // debug(seg.all_prod());\n\n int cand1 = max_index_active(seg.all_prod() / 5);\n int cand2 = min_index_lazy(cand1);\n\n // debug(cand1, cand2);\n\n if (0 <= cand1 and cand1 < k) {\n int i = get_original_index(cand1);\n if (not hard[i]) {\n print_active(i);\n hard[i] = true;\n }\n }\n if (0 <= cand2 and cand2 < k) {\n int i = get_original_index(cand2);\n if (hard[i]) {\n print_inactive(i);\n hard[i] = false;\n }\n }\n }\n}","accuracy":1,"time_ms":40,"memory_kb":11712,"score_of_the_acc":-0.3024,"final_rank":1},{"submission_id":"aoj_2782_7097284","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=2167167167167167167;\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\";}\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}\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\tmap<string,pair<int,int>> m;\n\tset<pair<pair<int,int>,string>> s1,s2;\n\tauto work_hard=[&](string S)->void{\n\t\tcout<<S<<\" is working hard now.\\n\";\n\t};\n\tauto not_work=[&](string S)->void{\n\t\tcout<<S<<\" is not working now.\\n\";\n\t};\n\tauto outcoming=[&](string S,bool output)->void{\n\t\tauto val=m[S];\n\t\tpair<pair<int,int>,string> dat={val,S};\n\t\tif((int)(s1.size()+s2.size())%5==0){\n\t\t\tif(s1.count(dat)){\n\t\t\t\ts1.erase(dat);\n\t\t\t}else{\n\t\t\t\ts2.erase(dat);\n\t\t\t\tauto tmp=(*s1.begin());\n\t\t\t\ts1.erase(tmp);\n\t\t\t\ts2.insert(tmp);\n\t\t\t\tif(output) not_work(tmp.second);\n\t\t\t}\n\t\t}else{\n\t\t\tif(s2.count(dat)){\n\t\t\t\ts2.erase(dat);\n\t\t\t}else{\n\t\t\t\ts1.erase(dat);\n\t\t\t\tauto tmp=(*s2.rbegin());\n\t\t\t\ts2.erase(tmp);\n\t\t\t\ts1.insert(tmp);\n\t\t\t\tif(output) work_hard(tmp.second);\n\t\t\t}\n\t\t}\n\t\tm.erase(S);\n\t};\n\tauto incoming=[&](string S,int level,int ind,bool output)->void{\n\t\tpair<int,int> val={level,ind};\n\t\tpair<pair<int,int>,string> dat={val,S};\n\t\tm[S]=val;\n\t\tif((int)(s1.size()+s2.size())%5==4){\n\t\t\tauto tmp=(*s2.rbegin());\n\t\t\tif(tmp.first<val){\n\t\t\t\ts1.insert(dat);\n\t\t\t\tif(output) work_hard(S);\n\t\t\t}else{\n\t\t\t\ts2.insert(dat);\n\t\t\t\ts2.erase(tmp);\n\t\t\t\ts1.insert(tmp);\n\t\t\t\tif(output) not_work(S),work_hard(tmp.second);\n\t\t\t}\n\t\t}else{\n\t\t\tif(s1.empty()){\n\t\t\t\ts2.insert(dat);\n\t\t\t\tif(output) not_work(S);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tauto tmp=(*s1.begin());\n\t\t\tif(tmp.first>val){\n\t\t\t\ts2.insert(dat);\n\t\t\t\tif(output) not_work(S);\n\t\t\t}else{\n\t\t\t\ts1.insert(dat);\n\t\t\t\ts1.erase(tmp);\n\t\t\t\ts2.insert(tmp);\n\t\t\t\tif(output) work_hard(S),not_work(tmp.second);\n\t\t\t}\n\t\t}\n\t};\n\tint N;\n\tcin>>N;\n\trep(i,N){\n\t\tstring S;\n\t\tint A;\n\t\tcin>>S>>A;\n\t\tincoming(S,A,i,0);\n\t}\n\tint M;\n\tcin>>M;\n\trep(i,M){\n\t\tchar c;\n\t\tstring S;\n\t\tint A;\n\t\tcin>>c>>S;\n\t\t//cout<<i<<endl;\n\t\tif(c=='+') cin>>A,incoming(S,A,i+N,1);\n\t\telse outcoming(S,1);\n\t}\n}","accuracy":1,"time_ms":50,"memory_kb":11284,"score_of_the_acc":-0.3555,"final_rank":3},{"submission_id":"aoj_2782_6024119","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 double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n; cin >> n;\n vector<pair<pair<int,int>,string>> v(n);\n for(int i=0;i<n;i++){\n cin >> v[i].second >> v[i].first.first;\n v[i].first.second = i;\n }\n sort(v.rbegin(), v.rend());\n map<string, pair<int,int>> mp;\n for(int i=0;i<n;i++){\n mp[v[i].second] = v[i].first;\n }\n\n map<pair<int,int>,string> hw,nw;\n for(int i=0;i<n;i++){\n if(i<n/5){\n hw[v[i].first] = v[i].second;\n }\n else{\n nw[v[i].first] = v[i].second;\n }\n }\n int num = n;\n int q; cin >> q;\n while(q--){\n char c; cin >> c;\n vector<string> change;\n if(c == '+'){\n string s; int a; cin >> s >> a;\n pair<int,int> p = pair<int,int>(a,num);\n mp[s] = p;\n num++;\n\n if(nw.size() == 0){\n nw[p] = s;\n }\n else{\n auto itr = nw.end(); itr--;\n auto uo = *itr;\n if(uo.first < p){\n hw[p] = s;\n }\n else{\n nw[p] = s;\n }\n }\n\n while(hw.size() < mp.size()/5){\n auto itr = nw.end(); itr--;\n auto uo = *itr;\n hw[uo.first] = uo.second;\n nw.erase(itr);\n change.push_back(uo.second);\n }\n while(hw.size() > mp.size()/5){\n auto itr = hw.begin();\n auto uo = *itr;\n nw[uo.first] = uo.second;\n hw.erase(itr);\n change.push_back(uo.second);\n }\n\n {\n if(hw.find(p) != hw.end()){\n cout << s << \" is working hard now.\" << \"\\n\";\n }\n else{\n cout << s << \" is not working now.\" << \"\\n\";\n }\n }\n sort(change.begin(), change.end());\n for(auto t:change){\n if(s == t)continue;\n if(hw.find(mp[t]) != hw.end()){\n cout << t << \" is working hard now.\" << \"\\n\";\n }\n else{\n cout << t << \" is not working now.\" << \"\\n\";\n }\n }\n }\n else{\n string s; cin >> s;\n auto p = mp[s];\n if(hw.find(p) != hw.end()){\n hw.erase(p);\n }\n else{\n nw.erase(p);\n }\n mp.erase(s);\n\n while(hw.size() < mp.size()/5){\n auto itr = nw.end(); itr--;\n auto uo = *itr;\n hw[uo.first] = uo.second;\n nw.erase(itr);\n change.push_back(uo.second);\n }\n while(hw.size() > mp.size()/5){\n auto itr = hw.begin();\n auto uo = *itr;\n nw[uo.first] = uo.second;\n hw.erase(itr);\n change.push_back(uo.second);\n }\n\n sort(change.begin(), change.end());\n for(auto t:change){\n if(hw.find(mp[t]) != hw.end()){\n cout << t << \" is working hard now.\" << \"\\n\";\n }\n else{\n cout << t << \" is not working now.\" << \"\\n\";\n }\n }\n }\n }\n}","accuracy":1,"time_ms":40,"memory_kb":12904,"score_of_the_acc":-0.5027,"final_rank":5},{"submission_id":"aoj_2782_5992008","code_snippet":"#pragma GCC ta g(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define DEBUG\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__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\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()\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 int sz = a.size();\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr;\n sz--;\n if(sz) cout << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//#include <atcoder/maxflow>\n//using namespace atcoder;\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 510000;\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-9;\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nstruct dat{\n int a,t;\n string name;\n dat(int a, int t, string name) : a(a), t(t), name(name) {}\n bool operator< (const dat &d) const {\n if(a != d.a) return a > d.a;\n if(t != d.t) return t > d.t;\n return name < d.name;\n }\n};\n\nint main(){\n int n; cin >> n;\n map<string,pii> mp;\n int sz = n;\n set<dat> se;\n se.emplace(inf,inf,\"\");\n rep(i,n){\n string s; cin >> s;\n int a; cin >> a;\n se.emplace(a,i,s);\n mp[s] = {a,i};\n }\n int q; cin >> q;\n auto itr = se.begin();\n int hard = n/5;\n int h = hard;\n while(h > 0){\n h--;\n itr++;\n }\n rep(i,q){\n char c; cin >> c;\n if(c == '+'){\n string s; cin >> s;\n int a; cin >> a;\n dat d(a,i+n,s);\n mp[s] = {a,i+n};\n sz++;\n int nh = sz/5;\n se.emplace(d);\n if(d < *itr){\n cout << d.name << \" is working hard now.\\n\";\n if(hard < nh) hard = nh;\n else{\n cout << (*itr).name << \" is not working now.\\n\";\n itr--;\n }\n }else{\n if(hard < nh){\n itr++;\n if((*itr).t == d.t){\n cout << d.name << \" is working hard now.\\n\";\n }else{\n cout << d.name << \" is not working now.\\n\";\n cout << (*itr).name << \" is working hard now.\\n\";\n }\n hard = nh;\n }else{\n cout << d.name << \" is not working now.\\n\";\n }\n }\n }else{\n string s; cin >> s;\n dat d(mp[s].first,mp[s].second,s);\n sz--;\n int nh = sz/5;\n if(d < *itr){\n se.erase(d);\n if(hard > nh) hard = nh;\n else{\n itr++;\n cout << (*itr).name << \" is working hard now.\\n\"; \n }\n }else if((*itr).name == d.name){\n itr = se.erase(itr);\n if(hard > nh){\n hard = nh;\n itr--;\n }else{\n cout << (*itr).name << \" is working hard now.\\n\";\n }\n }else{\n se.erase(d);\n if(hard > nh){\n hard = nh;\n cout << (*itr).name << \" is not working now.\\n\";\n itr--;\n }\n }\n mp.erase(s);\n }\n }\n}","accuracy":1,"time_ms":60,"memory_kb":11184,"score_of_the_acc":-0.4637,"final_rank":4},{"submission_id":"aoj_2782_5991994","code_snippet":"#pragma GCC ta g(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define DEBUG\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__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\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()\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 int sz = a.size();\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr;\n sz--;\n if(sz) cout << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//#include <atcoder/maxflow>\n//using namespace atcoder;\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 510000;\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-9;\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nstruct dat{\n int a,t;\n string name;\n dat(int a, int t, string name) : a(a), t(t), name(name) {}\n bool operator< (const dat &d) const {\n if(a != d.a) return a > d.a;\n if(t != d.t) return t > d.t;\n return name < d.name;\n }\n};\n\nint main(){\n int n; cin >> n;\n map<string,pii> mp;\n int sz = n;\n set<dat> se;\n se.emplace(inf,inf,\"\");\n rep(i,n){\n string s; cin >> s;\n int a; cin >> a;\n se.emplace(a,i,s);\n mp[s] = {a,i};\n }\n int q; cin >> q;\n auto itr = se.begin();\n int hard = n/5;\n int h = hard;\n while(h > 0){\n h--;\n itr++;\n }\n rep(i,q){\n char c; cin >> c;\n if(c == '+'){\n string s; cin >> s;\n int a; cin >> a;\n dat d(a,i+n,s);\n mp[s] = {a,i+n};\n sz++;\n int nh = sz/5;\n se.emplace(d);\n if(d < *itr){\n cout << d.name << \" is working hard now.\\n\";\n if(hard < nh) hard = nh;\n else{\n cout << (*itr).name << \" is not working now.\\n\";\n itr--;\n }\n }else{\n if(hard < nh){\n itr++;\n if((*itr).t == d.t){\n cout << d.name << \" is working hard now.\\n\";\n }else{\n cout << d.name << \" is not working now.\\n\";\n cout << (*itr).name << \" is working hard now.\\n\";\n }\n hard = nh;\n }else{\n cout << d.name << \" is not working now.\\n\";\n }\n }\n }else{\n string s; cin >> s;\n dat d(mp[s].first,mp[s].second,s);\n sz--;\n int nh = sz/5;\n if(d < *itr){\n cout << d.name << \" is not working now.\\n\";\n se.erase(d);\n if(hard > nh) hard = nh;\n else{\n itr++;\n cout << (*itr).name << \" is working hard now.\\n\"; \n }\n }else if((*itr).name == d.name){\n itr = se.erase(itr);\n if(hard > nh){\n hard = nh;\n itr--;\n }else{\n cout << (*itr).name << \" is working hard now.\\n\";\n }\n }else{\n se.erase(d);\n if(hard > nh){\n hard = nh;\n cout << (*itr).name << \" is not working now.\\n\";\n itr--;\n }\n }\n mp.erase(s);\n }\n }\n}","accuracy":0.15151515151515152,"time_ms":60,"memory_kb":11264,"score_of_the_acc":-0.4772,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_2782_10851164\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define D(x) cout << #x \\\" = \\\" << (x) << endl\\n#define un(x) x.erase(unique(x.begin(), x.end()), x.end())\\n#define sf(n) scanf(\\\"%d\\\", &n)\\n#define sff(a,b) scanf(\\\"%d %d\\\", &a, &b)\\n#define sfff(a,b,c) scanf(\\\"%d %d %d\\\", &a, &b, &c)\\n#define pb push_back\\n#define mp make_pair\\n#define xx first\\n#define yy second\\n#define hp (LL) 999983\\n#define MAX 100000\\n#define eps 1e-9\\n#define pi acos(-1.00)\\ntypedef long long int LL;\\ntypedef pair<int,int> pii;\\n\\nint global_id;\\nmap<string, int> M;\\n\\nstruct node{\\n char name[24];\\n int ID, motiv;\\n\\n node(){}\\n node(char *str, int mtv, int _id){\\n strcpy(name, str);\\n motiv = mtv;\\n ID = _id;\\n }\\n};\\n\\nbool operator < (const node &u, const node &v){\\n if(u.motiv == v.motiv) return u.ID > v.ID;\\n return u.motiv > v.motiv;\\n}\\n\\nbool operator == (const node &u, const node &v){\\n return u.ID == v.ID;\\n}\\n\\nbool operator <= (const node &u, const node &v){\\n return (u < v || u == v);\\n}\\n\\nstruct Treap{\\n node val;\\n int prior, cnt;\\n Treap *l, *r;\\n\\n Treap(node v){\\n l = 0;\\n r = 0;\\n val = v;\\n prior = (rand() << 15) + rand();\\n cnt = 1;\\n }\\n};\\n\\nint sz(Treap *t) {return (t == NULL) ? 0:t->cnt;}\\nvoid upd_sz(Treap *t){\\n if(t) t->cnt = 1 + sz(t->l) + sz(t->r);\\n}\\n\\nvoid split(Treap *t, Treap *&l, Treap *&r, node key)\\n{\\n if(!t) l = r = NULL;\\n else if(t->val <= key) {split(t->r, t->r, r, key); l = t;}\\n else {split(t->l, l, t->l, key); r = t;}\\n upd_sz(t);\\n}\\n\\nvoid merge(Treap *&t, Treap *l, Treap *r){\\n if(!l || !r) t = l ? l : r;\\n else if(l->prior > r->prior) {merge(l->r, l->r, r); t = l;}\\n else {merge(r->l, l, r->l), t = r;}\\n upd_sz(t);\\n}\\n\\nvoid insert(Treap *&t, Treap *it){\\n if(!t) t = it;\\n else if(it->prior > t->prior) {split(t, it->l, it->r, it->val); t = it;}\\n else if( (it->val <= t->val) == false) insert(t->r, it);\\n else insert(t->l, it);\\n upd_sz(t);\\n}\\n\\nvoid erase(Treap *&t, node key){\\n if(!t) return;\\n else if(t->val == key) {Treap *temp = t; merge(t, t->l, t->r); delete(temp);}\\n else if( (key <= t->val) == false) erase(t->r, key);\\n else erase(t->l, key);\\n upd_sz(t);\\n}\\n\\nnode find_kth(Treap *cur, int k)\\n{\\n if(sz(cur->l) < k)\\n {\\n k -= sz(cur->l);\\n if(k == 1) return cur->val;\\n return find_kth(cur->r, k - 1);\\n }\\n return find_kth(cur->l, k);\\n}\\n\\nint canWork(int n) {return n / 5;}\\n\\n\\nint n;\\nTreap *working, *idle;\\nchar str[33], sgn[3];\\nstring S;\\nset<int> working_id, idle_id;\\nint motivation[5000000];\\nchar pending_print[1111];\\n\\nvoid welcomeNewMember(bool printFlag)\\n{\\n n++;\\n\\n int mtv;\\n Treap *current;\\n node lastOne;\\n\\n\\n global_id++;\\n scanf(\\\"%s %d\\\", str, &mtv);\\n motivation[global_id] = mtv;\\n\\n S = string(str);\\n M[S] = global_id;\\n\\n current = new Treap(node(str, mtv, global_id));\\n pending_print[0] = 0;\\n\\n if(canWork(n) != canWork(n - 1))\\n {\\n node idleFront = find_kth(idle, 1);\\n if(idleFront.motiv > mtv){\\n erase(idle, idleFront);\\n idle_id.erase(idleFront.ID);\\n\\n insert(working, new Treap(idleFront));\\n working_id.insert(idleFront.ID);\\n\\n strcat(pending_print, idleFront.name);\\n strcat(pending_print, \\\" is working hard now.\\\");\\n }\\n }\\n\\n if(sz(working) < canWork(n))\\n {\\n insert(working, current);\\n if(printFlag) printf(\\\"%s is working hard now.\\\\n\\\", str);\\n working_id.insert(global_id);\\n }\\n else{\\n if(sz(working)){\\n lastOne = find_kth(working, sz(working));\\n if(lastOne.motiv <= mtv){\\n erase(working, lastOne);\\n insert(working, current);\\n insert(idle, new Treap(lastOne));\\n\\n working_id.insert(global_id);\\n working_id.erase(M[lastOne.name]);\\n idle_id.insert(M[lastOne.name]);\\n\\n if(printFlag) printf(\\\"%s is working hard now.\\\\n\\\", str);\\n if(printFlag) printf(\\\"%s is not working now.\\\\n\\\", lastOne.name);\\n }\\n else\\n {\\n idle_id.insert(global_id);\\n insert(idle, current);\\n if(printFlag) printf(\\\"%s is not working now.\\\\n\\\", str);\\n }\\n }\\n else\\n {\\n idle_id.insert(global_id);\\n insert(idle, current);\\n if(printFlag) printf(\\\"%s is not working now.\\\\n\\\", str);\\n }\\n }\\n\\n if(pending_print[0] && printFlag) puts(pending_print);\\n}\\n\\nvoid removeSomeone(){\\n n--;\\n\\n Treap *current;\\n node lastOne, firstOne;\\n\\n scanf(\\\"%s\\\", str);\\n int getID = M[str];\\n\\n\\n if(idle_id.find(getID) != idle_id.end()){\\n idle_id.erase(getID);\\n erase(idle, node(str, motivation[getID], getID));\\n }\\n else{\\n working_id.erase(getID);\\n erase(working, node(str, motivation[getID], getID));\\n }\\n\\n while(sz(working) > canWork(n)){\\n lastOne = find_kth(working, sz(working));\\n\\n working_id.erase(lastOne.ID);\\n erase(working, lastOne);\\n\\n\\n idle_id.insert(lastOne.ID);\\n insert(idle, new Treap(lastOne));\\n printf(\\\"%s is not working now.\\\\n\\\", lastOne.name);\\n }\\n\\n while(sz(working) < canWork(n)){\\n firstOne = find_kth(idle, 1);\\n\\n idle_id.erase(firstOne.ID);\\n erase(idle, firstOne);\\n\\n\\n working_id.insert(firstOne.ID);\\n insert(working, new Treap(firstOne));\\n printf(\\\"%s is working hard now.\\\\n\\\", firstOne.name);\\n }\\n}\\n\\nint main()\\n{\\n //freopen(\\\"in.txt\\\", \\\"r\\\", stdin);\\n srand(time(0));\\n int i, j, k, mtv, q, N;\\n Treap *current;\\n node lastOne;\\n\\n sf(N);\\n for(i = 1; i <= N; i++)\\n welcomeNewMember(false);\\n\\n sf(q);\\n while(q--){\\n scanf(\\\"%s\\\", sgn);\\n\\n if(sgn[0] == '+') welcomeNewMember(true);\\n else removeSomeone();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 13628,\n \"score_of_the_acc\": -0.9993,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2782_10691086\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define inf 0x3f3f3f3f\\nstruct node\\n{\\n\\tstring name;\\n\\tint id,val;\\n\\tnode(){}\\n\\tnode(string _s,int _id,int _val)\\n\\t{\\n\\t\\tname=_s,id=_id,val=_val;\\n\\t}\\n\\tbool operator<(const node &A)const\\n\\t{\\n\\t\\tif(val!=A.val)return val>A.val;\\n\\t\\treturn id>A.id;\\n\\t}\\n};\\nset<node>se;\\nset<node>::iterator it;\\nnode la=node(\\\"\\\",inf,inf);\\nmap<string,node>mp;\\nvoid init()\\n{\\n\\tint t=se.size()/5;\\n\\tit=se.begin();\\n\\tfor(int i=0;i<t;i++)\\n\\t{\\n\\t\\tla=*(it);\\n\\t\\tit++;\\n\\t}\\n}\\nvoid add(node no)\\n{\\n\\tse.insert(no);\\n\\tmp[no.name]=no;\\n\\tint x=se.size()/5,y=se.size()%5;\\n\\tif(x==0)\\n\\t{\\n\\t\\tcout<<no.name<<\\\" is not working now.\\\\n\\\";\\n\\t}\\n\\telse if(x==1&&y==0)\\n\\t{\\n\\t\\tit=se.begin();\\n\\t\\tla=*(se.begin());\\n\\t\\tif(la<no)\\n\\t\\t{\\n\\t\\t\\tcout<<no.name<<\\\" is not working now.\\\\n\\\";\\n\\t\\t\\tcout<<la.name<<\\\" is working hard now.\\\\n\\\";\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tcout<<no.name<<\\\" is working hard now.\\\\n\\\";\\n\\t\\t}\\n\\t}\\n\\telse if(y==0)\\n\\t{\\n\\t\\tif(la<no)\\n\\t\\t{\\n\\t\\t\\tit=se.find(la);\\n\\t\\t\\tit++;\\n\\t\\t\\tla=*(it);\\n\\t\\t\\tif(la.name==no.name)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout<<no.name<<\\\" is working hard now.\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout<<no.name<<\\\" is not working now.\\\\n\\\";\\n\\t\\t\\t\\tcout<<la.name<<\\\" is working hard now.\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tcout<<no.name<<\\\" is working hard now.\\\\n\\\";\\n\\t\\t}\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tif(la<no)\\n\\t\\t{\\n\\t\\t\\tcout<<no.name<<\\\" is not working now.\\\\n\\\";\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tcout<<no.name<<\\\" is working hard now.\\\\n\\\";\\n\\t\\t\\tcout<<la.name<<\\\" is not working now.\\\\n\\\";\\n\\t\\t\\tit=se.find(la);\\n\\t\\t\\tit--;\\n\\t\\t\\tla=*(it);\\n\\t\\t}\\n\\t}\\n}\\nvoid sub(node no)\\n{\\n\\tint x=(se.size()-1)/5,y=(se.size()-1)%5;\\n\\tif(y==4)\\n\\t{\\n\\t\\tif(la<no)\\n\\t\\t{\\n\\t\\t\\tcout<<la.name<<\\\" is not working now.\\\\n\\\";\\n\\t\\t\\tit=se.find(la);\\n\\t\\t\\tif(it!=se.begin())\\n\\t\\t\\t{\\n\\t\\t\\t\\tit--;la=*(it);\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tla=node(\\\"\\\",inf,inf);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tif(!(la<no))\\n\\t\\t{\\n\\t\\t\\tit=se.find(la);\\n\\t\\t\\tit++;\\n\\t\\t\\tla=*(it);\\n\\t\\t\\tcout<<la.name<<\\\" is working hard now.\\\\n\\\";\\n\\t\\t}\\n\\t}\\n\\tse.erase(no);\\n}\\nint main()\\n{\\n\\tint n;\\n\\tscanf(\\\"%d\\\",&n);\\n\\tfor(int i=0;i<n;i++)\\n\\t{\\n\\t\\tchar s[25];int k;\\n\\t\\tscanf(\\\"%s %d\\\",s,&k);\\n\\t\\tse.insert(node(s,i,k));\\n\\t\\tmp[s]=node(s,i,k);\\n\\t}\\n\\tinit();\\n\\tint m;\\n\\tscanf(\\\"%d\\\",&m);\\n\\tfor(int i=n;i<n+m;i++)\\n\\t{\\n\\t\\tchar s[25];\\n\\t\\tscanf(\\\"%s\\\",s);\\n\\t\\tif(s[0]=='+')\\n\\t\\t{\\n\\t\\t\\tint k;\\n\\t\\t\\tscanf(\\\"%s %d\\\",s,&k);\\n\\t\\t\\tadd(node(s,i,k));\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tscanf(\\\"%s\\\",s);\\n\\t\\t\\tsub(mp[s]);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.2878787878787879,\n \"time_ms\": 50,\n \"memory_kb\": 13716,\n \"score_of_the_acc\": -0.7641,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2782_10691077\",\n \"code_snippet\": \"#include <map>\\n#include <queue>\\n#include <string>\\n#include <cstdio>\\n#include <vector>\\n#include <cstring>\\n#include <algorithm>\\nusing namespace std;\\nconst int N = 70007;\\n\\nstruct A{ int val, id; char nm[25]; A(){} };;\\nstruct B{\\n int val, id; char nm[25];\\n bool operator<(const B& b)const{\\n if (val==b.val) return id<b.id;\\n return val<b.val;\\n }\\n};\\n\\nstruct cmp{\\n bool operator()(A a, A b){\\n if (a.val==b.val) return a.id<b.id;\\n return a.val<b.val;\\n }\\n};\\n\\nstruct ccmp{\\n bool operator()(A a, A b){\\n if (a.val==b.val) return a.id>b.id;\\n return a.val>b.val;\\n }\\n};\\n\\nint n, m, id, a, num, lft, rht, sl, sr, fl;\\nchar ss[25], ch[5];\\nB ini[50005];\\nmap<string, int> mbig, msma;\\n\\nint main(){\\n int i, j, k;\\n while (~scanf(\\\"%d\\\", &n)){\\n num = n; id = n-1;\\n lft = num/5; rht = num-lft;\\n for (i=0; i<n; ++i){\\n scanf(\\\"%s%d\\\", ini[i].nm, &ini[i].val);\\n ini[i].id = i;\\n }\\n sort(ini, ini+n);\\n priority_queue<A, vector<A>, cmp> big;\\n priority_queue<A, vector<A>, ccmp> sma;\\n\\n A tmp, nw;\\n mbig.clear(); msma.clear();\\n for (i=0; i<rht; ++i){\\n tmp.id = ini[i].id;\\n tmp.val = ini[i].val;\\n strcpy(tmp.nm, ini[i].nm);\\n mbig[ini[i].nm] = tmp.id;\\n big.push(tmp);\\n }\\n for (i=rht; i<n; ++i){\\n tmp.id = ini[i].id;\\n tmp.val = ini[i].val;\\n strcpy(tmp.nm, ini[i].nm);\\n msma[ini[i].nm] = tmp.id;\\n sma.push(tmp);\\n }\\n\\n scanf(\\\"%d\\\", &m);\\n for (k=0; k<m; k++){\\n scanf(\\\"%s\\\", ch);\\n if (ch[0]=='-'){\\n scanf(\\\"%s\\\", ss); num--;\\n sl = num/5; sr = num-sl;\\n if (mbig.find(ss)!=mbig.end()){\\n mbig.erase(ss); rht--;\\n if(rht<sr){\\n while (!sma.empty()){\\n tmp = sma.top(); sma.pop();\\n if (msma.find(tmp.nm)!=msma.end()){\\n msma.erase(tmp.nm);\\n mbig[tmp.nm] = tmp.id;\\n big.push(tmp); rht++; lft--;\\n printf(\\\"%s is not working now.\\\\n\\\", tmp.nm);\\n break;\\n }\\n }\\n }\\n }else{\\n msma.erase(ss); lft--;\\n if (lft<sl){\\n while (!big.empty()){\\n tmp = big.top(); big.pop();\\n if (mbig.find(tmp.nm)!=mbig.end()){\\n mbig.erase(tmp.nm);\\n msma[tmp.nm] = tmp.id;\\n printf(\\\"%s is working hard now.\\\\n\\\", tmp.nm);\\n sma.push(tmp); lft++; rht--;\\n break;\\n }\\n }\\n }\\n }\\n }else{\\n scanf(\\\"%s%d\\\", ss, &a); num++; id++;\\n sl = num/5; sr = num-sl;\\n strcpy(nw.nm, ss);\\n nw.val = a; nw.id = id;\\n if (lft<sl){\\n while (!big.empty()){\\n tmp = big.top(); big.pop();\\n if (mbig.find(tmp.nm)!=mbig.end()){\\n mbig.erase(tmp.nm);\\n break;\\n }\\n }\\n if (nw.val>=tmp.val){\\n msma[nw.nm] = nw.id;\\n mbig[tmp.nm] = tmp.id;\\n big.push(tmp);\\n sma.push(nw);\\n printf(\\\"%s is working hard now.\\\\n\\\", nw.nm);\\n }else{\\n mbig[nw.nm] = nw.id;\\n msma[tmp.nm] = tmp.id;\\n big.push(nw);\\n sma.push(tmp);\\n printf(\\\"%s is not working now.\\\\n\\\", nw.nm);\\n printf(\\\"%s is working hard now.\\\\n\\\", tmp.nm);\\n }\\n lft++;\\n }else if (rht<sr){\\n if (sma.empty()){\\n mbig[nw.nm] = nw.id;\\n big.push(nw);\\n printf(\\\"%s is not working now.\\\\n\\\", nw.nm);\\n }else{\\n while (!sma.empty()){\\n tmp = sma.top(); sma.pop();\\n if (msma.find(tmp.nm)!=msma.end()){\\n msma.erase(tmp.nm);\\n break;\\n }\\n }\\n if (tmp.val<=nw.val){\\n mbig[tmp.nm] = tmp.id;\\n msma[nw.nm] = nw.id;\\n sma.push(nw);\\n big.push(tmp);\\n printf(\\\"%s is working hard now.\\\\n\\\", nw.nm);\\n printf(\\\"%s is not working now.\\\\n\\\", tmp.nm);\\n }else{\\n mbig[nw.nm] = nw.id;\\n msma[tmp.nm] = tmp.id;\\n sma.push(tmp);\\n big.push(nw);\\n printf(\\\"%s is not working now.\\\\n\\\", nw.nm);\\n }\\n }\\n rht++;\\n }\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.19696969696969696,\n \"time_ms\": 40,\n \"memory_kb\": 10656,\n \"score_of_the_acc\": -0.125,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2782_10358541\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cassert>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <numeric>\\n#include <map>\\n#include <set>\\n// #include \\\"Src/Utility/BinarySearch.hpp\\\"\\n// #include \\\"Src/Sequence/CompressedSequence.hpp\\\"\\n// #include \\\"Src/Sequence/RunLengthEncoding.hpp\\\"\\n// using namespace zawa;\\n// #include \\\"atcoder/modint\\\"\\n// using mint = atcoder::modint998244353;\\nstd::map<std::string, int> map;\\nint get_id(std::string S) {\\n auto it = map.find(S);\\n if (it != map.end()) {\\n return it->second;\\n }\\n else {\\n int res = map.size();\\n return map[S] = res;\\n }\\n}\\nint SIZE = 0;\\nstd::pair<int, int> id[50010+20010]; // power, time\\nusing item = std::tuple<int, int, std::string>; // power, time, name\\nstd::multiset<item> small, big;\\n\\nvoid working(const std::string& S) {\\n std::cout << S << \\\" is working hard now.\\\\n\\\";\\n}\\nvoid idle(const std::string& S) {\\n std::cout << S << \\\" is not working now.\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::cout.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int N;\\n std::cin >> N;\\n for (int i = 0 ; i < N ; i++) {\\n std::string S;\\n int a;\\n std::cin >> S >> a;\\n int j = get_id(S);\\n id[j] = {a, i};\\n SIZE++;\\n big.insert(item{a, i, S});\\n }\\n while ((int)big.size() > SIZE / 5) {\\n auto it = big.begin();\\n small.insert(*it);\\n big.erase(it);\\n }\\n int M;\\n std::cin >> M;\\n for (int i = 0 ; i < M ; i++) {\\n char c;\\n std::string S;\\n std::cin >> c >> S;\\n if (c == '+') {\\n int p;\\n std::cin >> p;\\n int j = get_id(S);\\n id[j] = {p, N+i};\\n SIZE++;\\n item cur{p, N+i, S};\\n if ((int)big.size() < SIZE/5 and (small.empty() or *small.rbegin() < cur)) {\\n working(S);\\n big.insert(cur);\\n }\\n else if ((int)big.size() == SIZE/5 and big.size() and *big.begin() < cur) {\\n working(S);\\n big.insert(cur);\\n }\\n else {\\n idle(S);\\n small.insert(cur);\\n }\\n }\\n else if (c == '-') {\\n auto [p, t] = id[get_id(S)];\\n item cur{p, t, S};\\n {\\n auto it = small.find(cur);\\n if (it != small.end()) small.erase(it);\\n else {\\n it = big.find(cur);\\n assert(it != big.end());\\n big.erase(it);\\n }\\n }\\n SIZE--;\\n }\\n else assert(false);\\n if ((int)big.size() < SIZE / 5 and small.size()) {\\n auto it = std::prev(small.end());\\n working(std::get<2>(*it));\\n big.insert(*it);\\n small.erase(it);\\n }\\n else if ((int)big.size() > SIZE / 5) {\\n auto it = big.begin();\\n idle(std::get<2>(*it));\\n small.insert(*it);\\n big.erase(it);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 12288,\n \"score_of_the_acc\": -0.5242,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2782_10358335\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cassert>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <numeric>\\n#include <map>\\n#include <set>\\n// #include \\\"Src/Utility/BinarySearch.hpp\\\"\\n// #include \\\"Src/Sequence/CompressedSequence.hpp\\\"\\n// #include \\\"Src/Sequence/RunLengthEncoding.hpp\\\"\\n// using namespace zawa;\\n// #include \\\"atcoder/modint\\\"\\n// using mint = atcoder::modint998244353;\\nstd::map<std::string, int> map;\\nint get_id(std::string S) {\\n auto it = map.find(S);\\n if (it != map.end()) {\\n return it->second;\\n }\\n else {\\n int res = map.size();\\n return map[S] = res;\\n }\\n}\\nint SIZE = 0;\\nstd::pair<int, int> id[50010+20010]; // power, time\\nusing item = std::tuple<int, int, std::string>; // power, time, name\\nstd::multiset<item> small, big;\\n\\nvoid working(const std::string& S) {\\n std::cout << S << \\\" is working hard now.\\\\n\\\";\\n}\\nvoid idle(const std::string& S) {\\n std::cout << S << \\\" is not working now.\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::cout.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int N;\\n std::cin >> N;\\n for (int i = 0 ; i < N ; i++) {\\n std::string S;\\n int a;\\n std::cin >> S >> a;\\n int j = get_id(S);\\n id[j] = {a, i};\\n SIZE++;\\n big.insert(item{a, i, S});\\n }\\n while ((int)big.size() > SIZE / 5) {\\n auto it = big.begin();\\n small.insert(*it);\\n big.erase(it);\\n }\\n int M;\\n std::cin >> M;\\n for (int i = 0 ; i < M ; i++) {\\n char c;\\n std::string S;\\n std::cin >> c >> S;\\n if (c == '+') {\\n int p;\\n std::cin >> p;\\n int j = get_id(S);\\n id[j] = {p, N+i};\\n SIZE++;\\n item cur{p, N+i, S};\\n if ((int)big.size() < SIZE/5 and (small.empty() or *small.rbegin() < cur)) {\\n working(S);\\n big.insert(cur);\\n }\\n else if ((int)big.size() == SIZE/5 and big.size() and *big.begin() < cur) {\\n working(S);\\n big.insert(cur);\\n }\\n else {\\n idle(S);\\n small.insert(cur);\\n }\\n }\\n else if (c == '-') {\\n auto [p, t] = id[get_id(S)];\\n item cur{p, t, S};\\n {\\n auto it = small.find(cur);\\n if (it != small.end()) small.erase(it);\\n else {\\n it = big.find(cur);\\n assert(it != big.end());\\n big.erase(it);\\n }\\n }\\n SIZE--;\\n }\\n else assert(false);\\n if ((int)big.size() < SIZE / 5 and small.size()) {\\n auto it = std::prev(small.end());\\n working(std::get<2>(*it));\\n big.insert(*it);\\n small.erase(it);\\n }\\n else if ((int)big.size() > SIZE / 5) {\\n auto it = big.begin();\\n idle(std::get<2>(*it));\\n small.insert(*it);\\n big.erase(it);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 12288,\n \"score_of_the_acc\": -0.5242,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2782_10260027\",\n \"code_snippet\": \"// AOJ #2782 We don't wanna work!\\n// 2025.3.2\\n\\n#include <bits/stdc++.h>\\n#include <ext/pb_ds/assoc_container.hpp>\\n#include <ext/pb_ds/tree_policy.hpp>\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n\\nstruct M {\\n int m, j;\\n string n;\\n};\\n\\nstruct cmp {\\n bool operator()(const M &a, const M &b) const {\\n if(a.m != b.m) return a.m > b.m;\\n return a.j > b.j;\\n }\\n};\\n\\ntypedef tree<M, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update> ost;\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n int N; cin >> N;\\n ost T;\\n unordered_map<string, M> R;\\n unordered_map<string, bool> S;\\n int cnt = 0;\\n for(int i = 0; i < N; i++){\\n string s; int a; cin >> s >> a;\\n cnt++;\\n M x{a, cnt, s};\\n T.insert(x);\\n R[s] = x;\\n }\\n int t = (int)T.size() * 20 / 100;\\n for(auto it = T.begin(); it != T.end(); it++){\\n int pos = T.order_of_key(*it);\\n S[it->n] = (pos < t);\\n }\\n int Mcnt; cin >> Mcnt;\\n for(int i = 0; i < Mcnt; i++){\\n char op; cin >> op;\\n int oldSize = T.size();\\n int oldt = (oldSize * 20) / 100;\\n if(op == '+'){\\n string s; int a; cin >> s >> a;\\n cnt++;\\n M x{a, cnt, s};\\n T.insert(x);\\n R[s] = x;\\n int newSize = T.size();\\n int nt = (newSize * 20) / 100;\\n int pos = T.order_of_key(x);\\n bool w = (pos < nt);\\n S[s] = w;\\n cout << s << (w ? \\\" is working hard now.\\\" : \\\" is not working now.\\\") << endl;\\n if(nt > 0){\\n M cand = *T.find_by_order(nt - 1);\\n if(!S[cand.n]){\\n S[cand.n] = true;\\n cout << cand.n << \\\" is working hard now.\\\" << endl;\\n }\\n }\\n if(nt < newSize){\\n M cand = *T.find_by_order(nt);\\n if(S[cand.n]){\\n S[cand.n] = false;\\n cout << cand.n << \\\" is not working now.\\\" << endl;\\n }\\n }\\n } else {\\n string s; cin >> s;\\n M x = R[s];\\n T.erase(x);\\n R.erase(s);\\n S.erase(s);\\n int newSize = T.size();\\n int nt = (newSize * 20) / 100;\\n if(newSize > 0){\\n if(nt > 0){\\n M cand = *T.find_by_order(nt - 1);\\n if(!S[cand.n]){\\n S[cand.n] = true;\\n cout << cand.n << \\\" is working hard now.\\\" << endl;\\n }\\n }\\n if(nt < newSize){\\n M cand = *T.find_by_order(nt);\\n if(S[cand.n]){\\n S[cand.n] = false;\\n cout << cand.n << \\\" is not working now.\\\" << endl;\\n }\\n }\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 16504,\n \"score_of_the_acc\": -1.3575,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2782_10238690\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct Human {\\n string name;\\n int power;\\n int joined;\\n};\\n\\nbool operator<(const Human &a1, const Human &a2) {\\n if (a1.power > a2.power) return true;\\n if (a1.power < a2.power) return false;\\n if (a1.joined > a2.joined) return true;\\n return false;\\n}\\n\\nint main() {\\n // Input (Former)\\n int N; cin >> N;\\n vector<Human> P(N);\\n for (int i = 0; i < N; i++) cin >> P[i].name >> P[i].power;\\n for (int i = 0; i < N; i++) P[i].joined = i;\\n int Q; cin >> Q;\\n\\n // Input (Latter)\\n vector<pair<char, Human>> Change(Q);\\n map<string, pair<int, int>> PowerList;\\n for (int i = 0; i < N; i++) PowerList[P[i].name] = make_pair(P[i].power, P[i].joined);\\n for (int i = 0; i < Q; i++) {\\n cin >> Change[i].first;\\n if (Change[i].first == '+') {\\n cin >> Change[i].second.name >> Change[i].second.power;\\n Change[i].second.joined = N + i;\\n PowerList[Change[i].second.name] = make_pair(Change[i].second.power, Change[i].second.joined);\\n }\\n if (Change[i].first == '-') {\\n cin >> Change[i].second.name;\\n Change[i].second.power = PowerList[Change[i].second.name].first;\\n Change[i].second.joined = PowerList[Change[i].second.name].second;\\n PowerList[Change[i].second.name] = make_pair(0, 0);\\n }\\n }\\n\\n // Step 2. Query Init\\n set<Human> Strong;\\n set<Human> Weak;\\n for (int i = 0; i < N; i++) Strong.insert(P[i]);\\n while (Strong.size() * 4 > Weak.size()) {\\n auto itr = Strong.end(); itr--;\\n Weak.insert(*itr);\\n Strong.erase(*itr);\\n }\\n\\n // Step 3. Update\\n for (int i = 0; i < Q; i++) {\\n // Addition\\n if (Change[i].first == '+') {\\n int sz = Strong.size() + Weak.size();\\n string verdict = \\\"lazy\\\";\\n if (sz % 5 == 4) {\\n auto itr = Weak.begin();\\n if (Change[i].second < (*itr)) verdict = \\\"hard\\\";\\n }\\n else if (sz >= 5) {\\n auto itr = Strong.end(); itr--;\\n if (Change[i].second < (*itr)) verdict = \\\"hard\\\";\\n }\\n if (verdict == \\\"lazy\\\") {\\n cout << Change[i].second.name << \\\" is not working now.\\\" << endl;\\n Weak.insert(Change[i].second);\\n }\\n else {\\n cout << Change[i].second.name << \\\" is working hard now.\\\" << endl;\\n Strong.insert(Change[i].second);\\n }\\n }\\n\\n // Deletion\\n if (Change[i].first == '-') {\\n Strong.erase(Change[i].second);\\n Weak.erase(Change[i].second);\\n }\\n\\n // Update\\n while (Strong.size() * 4 > Weak.size()) {\\n auto itr = Strong.end(); itr--;\\n cout << (*itr).name << \\\" is not working now.\\\" << endl;\\n Weak.insert(*itr);\\n Strong.erase(*itr);\\n }\\n while (Strong.size() * 4 + 4 < Weak.size()) {\\n auto itr = Weak.begin();\\n cout << (*itr).name << \\\" is working hard now.\\\" << endl;\\n Strong.insert(*itr);\\n Weak.erase(*itr);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 14464,\n \"score_of_the_acc\": -1.1398,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2782_9742912\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nmap<string,int> mps;\\nvector<string> SV;\\nvector<int> X;\\nint scur = 0;\\nint getstring() {\\n string s;\\n cin >> s;\\n if (mps.count(s)) return mps[s];\\n SV.push_back(s);\\n X.push_back(0);\\n mps[s] = scur;\\n scur++;\\n return scur-1;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n set<pair<int,int>> Left, Right;\\n int LC = N, RC = 0;\\n rep(i,0,N) {\\n int A = getstring();\\n int B;\\n cin >> B;\\n Left.insert({B,A});\\n X[A] = B;\\n }\\n while(RC < N/5) {\\n pair<int,int> P = *Left.rbegin();\\n Left.erase(P);\\n Right.insert(P);\\n LC--, RC++;\\n }\\n auto Balancing = [&]() -> void {\\n int RS = (LC+RC)/5;\\n while(RC < RS) {\\n pair<int,int> P = *Left.rbegin();\\n Left.erase(P);\\n Right.insert(P);\\n LC--, RC++;\\n cout << SV[P.second] << \\\" is working hard now.\\\" << endl;\\n }\\n while(RC > RS) {\\n pair<int,int> P = *Right.begin();\\n Right.erase(P);\\n Left.insert(P);\\n LC++, RC--;\\n cout << SV[P.second] << \\\" is not working now.\\\" << endl;\\n }\\n };\\n int Q;\\n cin >> Q;\\n while(Q--) {\\n char C;\\n cin >> C;\\n int A = getstring();\\n if (C == '+') {\\n int B;\\n cin >> B;\\n X[A] = B;\\n pair<int,int> P = {B,A};\\n X.push_back(B);\\n int RS = (LC+RC+1)/5;\\n pair<int,int> L1, R1;\\n if (Left.empty()) L1 = {-inf,-inf};\\n else L1 = *Left.rbegin();\\n if (Right.empty()) R1 = {inf,inf};\\n else R1 = *Right.begin();\\n if (P < L1) {\\n Left.insert(P);\\n LC++;\\n cout << SV[P.second] << \\\" is not working now.\\\" << endl;\\n }\\n else if (R1 < P) {\\n Right.insert(P);\\n RC++;\\n cout << SV[P.second] << \\\" is working hard now.\\\" << endl;\\n }\\n else {\\n if (RS == RC) {\\n Left.insert(P);\\n LC++;\\n cout << SV[P.second] << \\\" is not working now.\\\" << endl;\\n }\\n else {\\n Right.insert(P);\\n RC++;\\n cout << SV[P.second] << \\\" is working hard now.\\\" << endl;\\n }\\n }\\n Balancing();\\n }\\n else {\\n pair<int,int> P = {X[A],A};\\n if (Left.count(P)) Left.erase(P), LC--;\\n if (Right.count(P)) Right.erase(P), RC--;\\n Balancing();\\n mps.erase(SV[A]);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 11656,\n \"score_of_the_acc\": -0.793,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2782_9742903\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nmap<string,int> mps;\\nvector<string> SV;\\nvector<int> X;\\nint scur = 0;\\nint getstring() {\\n string s;\\n cin >> s;\\n if (mps.count(s)) return mps[s];\\n SV.push_back(s);\\n X.push_back(0);\\n mps[s] = scur;\\n scur++;\\n return scur-1;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n set<pair<int,int>> Left, Right;\\n int LC = N, RC = 0;\\n rep(i,0,N) {\\n int A = getstring();\\n int B;\\n cin >> B;\\n Left.insert({B,A});\\n X[A] = B;\\n }\\n while(RC < N/5) {\\n pair<int,int> P = *Left.rbegin();\\n Left.erase(P);\\n Right.insert(P);\\n LC--, RC++;\\n }\\n auto Balancing = [&]() -> void {\\n int RS = (LC+RC)/5;\\n while(RC < RS) {\\n pair<int,int> P = *Left.rbegin();\\n Left.erase(P);\\n Right.insert(P);\\n LC--, RC++;\\n cout << SV[P.second] << \\\" is working hard now.\\\" << endl;\\n }\\n while(RC > RS) {\\n pair<int,int> P = *Right.begin();\\n Right.erase(P);\\n Left.insert(P);\\n LC++, RC--;\\n cout << SV[P.second] << \\\" is not working now.\\\" << endl;\\n }\\n };\\n int Q;\\n cin >> Q;\\n while(Q--) {\\n char C;\\n cin >> C;\\n int A = getstring();\\n if (C == '+') {\\n int B;\\n cin >> B;\\n X[A] = B;\\n pair<int,int> P = {B,A};\\n X.push_back(B);\\n int RS = (LC+RC+1)/5;\\n pair<int,int> L1, R1;\\n if (Left.empty()) L1 = {-inf,-inf};\\n else L1 = *Left.rbegin();\\n if (Right.empty()) R1 = {inf,inf};\\n else R1 = *Right.begin();\\n if (P < L1) {\\n Left.insert(P);\\n LC++;\\n cout << SV[P.second] << \\\" is not working now.\\\" << endl;\\n }\\n else if (R1 < P) {\\n Right.insert(P);\\n RC++;\\n cout << SV[P.second] << \\\" is working hard now.\\\" << endl;\\n }\\n else {\\n if (RS == RC) {\\n Left.insert(P);\\n LC++;\\n cout << SV[P.second] << \\\" is not working now.\\\" << endl;\\n }\\n else {\\n Right.insert(P);\\n RC++;\\n cout << SV[P.second] << \\\" is working hard now.\\\" << endl;\\n }\\n }\\n Balancing();\\n }\\n else {\\n pair<int,int> P = {X[A],A};\\n if (Left.count(P)) Left.erase(P), LC--;\\n if (Right.count(P)) Right.erase(P), RC--;\\n Balancing();\\n }\\n }\\n}\",\n \"accuracy\": 0.15151515151515152,\n \"time_ms\": 70,\n \"memory_kb\": 12172,\n \"score_of_the_acc\": -0.7547,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2782_9669019\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nint main(){\\n ll N;cin>>N;\\n set<pi>workhorse,idle;\\n map<ll,string>name;\\n map<string,pi>st;\\n REP(i,N){\\n string t;cin>>t;\\n name[i]=t;\\n ll m;cin>>m;\\n st[t]=pi(m,i);\\n idle.insert(pi(m,i));\\n }\\n while(workhorse.size()<N/5){\\n workhorse.insert(*prev(idle.end()));\\n idle.erase(prev(idle.end()));\\n }\\n ll Q,now=N;cin>>Q;\\n REP(i,Q){\\n char c;string t;cin>>c>>t;\\n if(c=='+'){\\n ll m;cin>>m;\\n name[now]=t;\\n N++;\\n pi p=pi(m,now++);\\n st[t]=p;\\n if(workhorse.size()&&*workhorse.begin()<p){\\n workhorse.insert(p);\\n cout<<t<<\\\" is working hard now.\\\"<<endl;\\n }\\n else if(idle.size()&&*prev(idle.end())>p){\\n idle.insert(p);\\n cout<<t<<\\\" is not working now.\\\"<<endl;\\n }\\n else if(N%5==0){\\n workhorse.insert(p);\\n cout<<t<<\\\" is working hard now.\\\"<<endl;\\n }\\n else{\\n idle.insert(p);\\n cout<<t<<\\\" is not working now.\\\"<<endl;\\n }\\n }\\n else{\\n N--;\\n auto p=st[t];\\n workhorse.erase(p);\\n idle.erase(p);\\n }\\n while(workhorse.size()!=N/5){\\n if(workhorse.size()>N/5){\\n auto p=*workhorse.begin();\\n cout<<name[p.second]<<\\\" is not working now.\\\"<<endl;\\n idle.insert(p);\\n workhorse.erase(p);\\n }\\n else{\\n auto p=*prev(idle.end());\\n cout<<name[p.second]<<\\\" is working hard now.\\\"<<endl;\\n workhorse.insert(p);\\n idle.erase(p);\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 16608,\n \"score_of_the_acc\": -1.625,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2782_9437106\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<vvi> vvvi;\\ntypedef vector<bool> vb;\\ntypedef vector<vb> vvb;\\ntypedef vector<vvb> vvvb;\\ntypedef vector<vvvb> vvvvb;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\\n#define RREP(i,n) RFOR(i,0,n)\\n#define sz(A) (ll)(A.size())\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())\\n#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())\\n#define COU(A,x) (UB(A,x)-LB(A,x))\\n#define F first\\n#define S second\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<\\\" \\\"<<p.S;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}\\ntemplate<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}\\nconst ll mod=998244353;\\nint main(){\\n while(1){\\n ll N;cin>>N;\\n vector<string>S(N);\\n vi A(N);\\n REP(i,N)cin>>S[i]>>A[i];\\n set<pair<pi,string>>Q1;\\n set<pair<pi,string>>Q2;\\n map<string,pi>memo;\\n REP(i,N)memo[S[i]]=pi(A[i],i-N);\\n REP(i,N)Q1.insert(make_pair(pi(A[i],i-N),S[i]));\\n while(sz(Q1)>N/5){\\n Q2.insert(*Q1.begin());Q1.erase(Q1.begin());\\n }\\n //for(auto i:Q1)cout<<i<<\\\" \\\";cout<<endl;\\n //for(auto i:Q2)cout<<i<<\\\" \\\";cout<<endl;\\n ll M;cin>>M;\\n REP(_,M){\\n char c;cin>>c;\\n if(c=='+'){\\n string s;cin>>s;\\n ll a;cin>>a;\\n memo[s]=pi(a,_);\\n N++;\\n if(N/5==0){\\n cout<<s<<\\\" is not working now.\\\"<<endl;\\n Q2.insert(make_pair(memo[s],s));\\n }\\n else if(!sz(Q1)){\\n auto p=*prev(Q2.end());\\n if(p.F<memo[s]){\\n cout<<s<<\\\" is working hard now.\\\"<<endl;\\n Q1.insert(make_pair(memo[s],s));\\n }\\n else{\\n cout<<s<<\\\" is not working now.\\\"<<endl;\\n Q2.insert(make_pair(memo[s],s));\\n cout<<p.S<<\\\" is working hard now.\\\"<<endl;\\n Q2.erase(p);\\n Q1.insert(p);\\n }\\n }\\n else if(memo[s]>(*Q1.begin()).F){\\n cout<<s<<\\\" is working hard now.\\\"<<endl;\\n Q1.insert(make_pair(memo[s],s));\\n if(sz(Q1)>N/5){\\n auto p=*Q1.begin();\\n cout<<p.S<<\\\" is not working now.\\\"<<endl;\\n Q1.erase(p);\\n Q2.insert(p);\\n }\\n }\\n else if(memo[s]<(*prev(Q2.end())).F){\\n cout<<s<<\\\" is not working now.\\\"<<endl;\\n Q2.insert(make_pair(memo[s],s));\\n if(sz(Q1)<N/5){\\n auto p=*prev(Q2.end());\\n cout<<p.S<<\\\" is working hard now.\\\"<<endl;\\n Q2.erase(p);\\n Q1.insert(p);\\n }\\n }\\n else if(sz(Q1)==N/5){\\n cout<<s<<\\\" is not working now.\\\"<<endl;\\n Q2.insert(make_pair(memo[s],s));\\n }\\n else{\\n cout<<s<<\\\" is working hard now.\\\"<<endl;\\n Q1.insert(make_pair(memo[s],s));\\n }\\n }\\n else{\\n string s;cin>>s;\\n if(Q1.count(make_pair(memo[s],s)))Q1.erase(make_pair(memo[s],s));\\n else Q2.erase(make_pair(memo[s],s));\\n N--;\\n if(sz(Q1)>N/5){\\n cout<<(*Q1.begin()).S<<\\\" is not working now.\\\"<<endl;\\n Q2.insert(*Q1.begin());\\n Q1.erase(Q1.begin());\\n }\\n if(sz(Q1)<N/5&&N){\\n cout<<(*prev(Q2.end())).S<<\\\" is working hard now.\\\"<<endl;\\n Q1.insert(*prev(Q2.end()));\\n Q2.erase(prev(Q2.end()));\\n }\\n }\\n }\\n break;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 14976,\n \"score_of_the_acc\": -1.2258,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2782_8491765\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2782.cc: We don't wanna work!\\n */\\n\\n#include<cstdio>\\n#include<string>\\n#include<map>\\n#include<set>\\n#include<algorithm>\\n#include<utility>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 50000 + 20000;\\n\\n/* typedef */\\n\\ntypedef pair<int,int> pii;\\ntypedef map<string,int> msi;\\ntypedef set<pii> spii;\\n\\n/* global variables */\\n\\nstring ss[MAX_N];\\nint as[MAX_N];\\npii ps[MAX_N];\\n\\n/* subroutines */\\n\\nint normalize(spii &q0, spii &q1) {\\n int l0 = q0.size(), l1 = q1.size(), l = l0 + l1;\\n int r = -1;\\n\\n if (l1 > l / 5) { // q1->q0\\n auto sit = q1.begin();\\n r = sit->second;\\n q0.insert(*sit);\\n q1.erase(sit);\\n }\\n else if (l0 > l - l / 5) { // q0->q1\\n auto sit = q0.end(); sit--;\\n r = sit->second;\\n q1.insert(*sit);\\n q0.erase(sit);\\n }\\n\\n return r;\\n}\\n\\ninline bool working(spii &q1, int i) {\\n return q1.find(pii(as[i], i)) != q1.end();\\n}\\n\\n/* main */\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n\\n msi smap;\\n for (int i = 0; i < n; i++) {\\n char s[32];\\n scanf(\\\"%s%d\\\", s, as + i);\\n ss[i] = string(s);\\n smap[ss[i]] = i;\\n ps[i] = pii(as[i], i);\\n }\\n sort(ps, ps + n);\\n\\n int l1 = n / 5, l0 = n - l1;\\n spii q0(ps, ps + l0), q1(ps + l0, ps + n);\\n \\n int m;\\n scanf(\\\"%d\\\", &m);\\n\\n while (m--) {\\n char op[4], s[32];\\n scanf(\\\"%s%s\\\", op, s);\\n\\n if (op[0] == '+') {\\n scanf(\\\"%d\\\", as + n);\\n ss[n] = string(s);\\n smap[ss[n]] = n;\\n pii pi(as[n], n);\\n\\n if (! q1.empty() && *(q1.begin()) < pi) q1.insert(pi);\\n else q0.insert(pi);\\n int r = normalize(q0, q1);\\n\\n if (working(q1, n))\\n\\tprintf(\\\"%s is working hard now.\\\\n\\\", ss[n].c_str());\\n else\\n\\tprintf(\\\"%s is not working now.\\\\n\\\", ss[n].c_str());\\n\\n if (r >= 0 && r != n) {\\n\\tif (working(q1, r))\\n\\t printf(\\\"%s is working hard now.\\\\n\\\", ss[r].c_str());\\n\\telse\\n\\t printf(\\\"%s is not working now.\\\\n\\\", ss[r].c_str());\\n }\\n\\n n++;\\n }\\n else { // op[0] == '-'\\n int k = smap[string(s)];\\n\\n if (working(q1, k)) {\\n\\tq1.erase(pii(as[k], k));\\n\\t//printf(\\\"%s is not working now.\\\\n\\\", ss[k].c_str());\\n }\\n else {\\n\\tq0.erase(pii(as[k], k));\\n }\\n\\n int r = normalize(q0, q1);\\n if (r >= 0) {\\n\\tif (working(q1, r))\\n\\t printf(\\\"%s is working hard now.\\\\n\\\", ss[r].c_str());\\n\\telse\\n\\t printf(\\\"%s is not working now.\\\\n\\\", ss[r].c_str());\\n }\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 12628,\n \"score_of_the_acc\": -0.3313,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2782_7939205\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 100010\\nusing namespace std;\\ntypedef pair<pair<int, int>, int> Type;\\nmap<string, int> A;\\nset<Type> Q1, Q2;\\nset<Type>::iterator it;\\nint n, cnt, m, val[N], Time[N];\\nchar name[N][30], s[30], opt[30];\\nint main() {\\n scanf(\\\"%d\\\", &n);\\n for (int i = 1; i <= n; i++) {\\n int v, id;\\n scanf(\\\"%s%d\\\", s, &v);\\n if (!A.count((string)s)) {\\n A[(string)s] = ++cnt;\\n int l = strlen(s);\\n for (int j = 0; j < l; j++)\\n name[cnt][j] = s[j];\\n name[cnt][l] = 0;\\n }\\n id = A[(string)s];\\n val[id] = v;\\n Time[id] = i;\\n Q2.insert(make_pair(make_pair(v, i), id));\\n }\\n int size = cnt;\\n int K = size / 5;\\n while (Q1.size() < K) {\\n it = Q2.end();\\n it--;\\n Q1.insert(*it);\\n Q2.erase(it);\\n }\\n scanf(\\\"%d\\\", &m);\\n for (int i = 1; i <= m; i++) {\\n int v, id;\\n scanf(\\\"%s\\\", opt);\\n if (opt[0] == '+') {\\n scanf(\\\"%s%d\\\", s, &v);\\n if (!A.count((string)s)) {\\n A[(string)s] = ++cnt;\\n int l = strlen(s);\\n for (int j = 0; j < l; j++)\\n name[cnt][j] = s[j];\\n name[cnt][l] = 0;\\n }\\n id = A[(string)s];\\n val[id] = v;\\n Time[id] = i + n;\\n size++;\\n K = size / 5;\\n Type now = make_pair(make_pair(v, i + n), id);\\n it = Q2.end();\\n it--;\\n if ((*it).first.first > v) {\\n printf(\\\"%s is not working now.\\\\n\\\", name[id]);\\n Q2.insert(now);\\n while (Q1.size() < K) {\\n Q1.insert(*it);\\n printf(\\\"%s is working hard now.\\\\n\\\", name[(*it).second]);\\n Q2.erase(it);\\n }\\n } else {\\n Q1.insert(now);\\n it = Q1.begin();\\n if ((*it).second == id && Q1.size() > K) {\\n printf(\\\"%s is not working now.\\\\n\\\", name[id]);\\n Q2.insert(*it);\\n Q1.erase(it);\\n } else {\\n printf(\\\"%s is working hard now.\\\\n\\\", name[id]);\\n while (Q1.size() > K) {\\n printf(\\\"%s is not working now.\\\\n\\\", name[(*it).second]);\\n Q2.insert(*it);\\n Q1.erase(it);\\n }\\n }\\n }\\n } else {\\n scanf(\\\"%s\\\", s);\\n size--;\\n K = size / 5;\\n int id = A[(string)s];\\n Type now = make_pair(make_pair(val[id], Time[id]), id);\\n it = Q1.find(now);\\n if (it == Q1.end())\\n it = Q2.find(now), Q2.erase(it);\\n else\\n Q1.erase(it);\\n while (Q1.size() > K) {\\n it = Q1.begin();\\n printf(\\\"%s is not working now.\\\\n\\\", name[(*it).second]);\\n Q2.insert(*it);\\n Q1.erase(it);\\n }\\n while (Q1.size() < K) {\\n it = Q2.end();\\n it--;\\n printf(\\\"%s is working hard now.\\\\n\\\", name[(*it).second]);\\n Q1.insert(*it);\\n Q2.erase(it);\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 14768,\n \"score_of_the_acc\": -1.6909,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2782_7939186\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <map>\\n#include <set>\\n#include <string>\\n#define maxn 100100\\nusing namespace std;\\nstruct node {\\n int val, time;\\n node(int val, int time) : val(val), time(time) {}\\n bool operator<(const node &A) const {\\n if (val == A.val)\\n return time > A.time;\\n return val > A.val;\\n }\\n};\\nint n, m, val;\\nint tval[maxn];\\nstring op, name, mp[maxn];\\nmap<string, int> tid;\\nset<node> st1, st2;\\nint main(void) {\\n while (cin >> n) {\\n st1.clear();\\n st2.clear();\\n tid.clear();\\n for (int i = 1; i <= n; i++) {\\n cin >> name >> val;\\n mp[i] = name;\\n tid[name] = i;\\n tval[i] = val;\\n st2.insert(node(val, i));\\n }\\n for (int i = 1; i <= n / 5; i++) {\\n st1.insert(*st2.begin());\\n st2.erase(st2.begin());\\n }\\n cin >> m;\\n for (int i = 1; i <= m; i++) {\\n cin >> op >> name;\\n if (op == \\\"+\\\") {\\n scanf(\\\"%d\\\", &val);\\n tval[n + i] = val;\\n mp[n + i] = name;\\n tid[name] = n + i;\\n if ((st1.size() + st2.size() + 1) % 5 == 0) {\\n st2.insert(node(val, n + i));\\n node tmp = *st2.begin();\\n st2.erase(st2.begin());\\n st1.insert(tmp);\\n if (mp[tmp.time] != name)\\n cout << name << \\\" is not working now.\\\" << endl;\\n cout << mp[tmp.time] << \\\" is working hard now.\\\" << endl;\\n continue;\\n }\\n if (!st1.empty() && val >= (*--st1.end()).val) {\\n cout << name << \\\" is working hard now.\\\" << endl;\\n node tmp = *--st1.end();\\n st1.erase(--st1.end());\\n st2.insert(tmp);\\n cout << mp[tmp.time] << \\\" is not working now.\\\" << endl;\\n st1.insert(node(val, n + i));\\n continue;\\n }\\n st2.insert(node(val, n + i));\\n cout << name << \\\" is not working now.\\\" << endl;\\n } else {\\n int ti = tid[name];\\n if ((st1.size() + st2.size()) % 5 == 0) {\\n if (st2.find(node(tval[ti], ti)) != st2.end()) {\\n set<node>::iterator it1 = st2.find(node(tval[ti], ti));\\n st2.erase(it1);\\n node temp = *--st1.end();\\n st1.erase(--st1.end());\\n st2.insert(temp);\\n cout << mp[temp.time] << \\\" is not working now.\\\" << endl;\\n } else {\\n set<node>::iterator it2 = st1.find(node(tval[ti], ti));\\n st1.erase(it2);\\n }\\n } else if (st1.find(node(tval[ti], ti)) != st1.end()) {\\n set<node>::iterator it3 = st1.find(node(tval[ti], ti));\\n st1.erase(it3);\\n node temp = *st2.begin();\\n st1.insert(temp);\\n st2.erase(st2.begin());\\n cout << mp[temp.time] << \\\" is working hard now.\\\" << endl;\\n } else {\\n set<node>::iterator it4 = st2.find(node(tval[ti], ti));\\n st2.erase(it4);\\n }\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 13140,\n \"score_of_the_acc\": -1.4173,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2782_7939167\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define maxn 100100\\nstruct P1 {\\n string name;\\n int v, tim;\\n bool operator<(const P1 &pp) const {\\n if (v != pp.v)\\n return v < pp.v;\\n else\\n return tim < pp.tim;\\n }\\n};\\nstruct P2 {\\n string name;\\n int v, tim;\\n bool operator<(const P2 &pp) const {\\n if (v != pp.v)\\n return v > pp.v;\\n else\\n return tim > pp.tim;\\n }\\n} a[maxn];\\nset<P1> s1;\\nset<P2> s2;\\nint n, m;\\nstring man;\\nint v;\\n#define P pair<int, int>\\nmap<string, P> mp;\\nP1 p2top1(P2 tmp) {\\n P1 ans;\\n ans.name = tmp.name;\\n ans.v = tmp.v;\\n ans.tim = tmp.tim;\\n return ans;\\n}\\nP2 p1top2(P1 tmp) {\\n P2 ans;\\n ans.name = tmp.name;\\n ans.v = tmp.v;\\n ans.tim = tmp.tim;\\n return ans;\\n}\\nint main() {\\n scanf(\\\"%d\\\", &n);\\n for (int i = 1; i <= n; ++i) {\\n a[i].tim = i;\\n cin >> a[i].name;\\n scanf(\\\"%d\\\", &a[i].v);\\n mp[a[i].name] = P(a[i].v, i);\\n }\\n sort(a + 1, a + n + 1);\\n int lx = n / 5;\\n for (int i = 1; i <= lx; ++i)\\n s1.insert(p2top1(a[i]));\\n for (int i = lx + 1; i <= n; ++i)\\n s2.insert(a[i]);\\n scanf(\\\"%d\\\", &m);\\n int tot = n;\\n for (int i = 1; i <= m; ++i) {\\n int now = n + i;\\n char op[5];\\n scanf(\\\"%s\\\", op);\\n if (*op == '+') {\\n cin >> man;\\n scanf(\\\"%d\\\", &v);\\n mp[man] = P(v, now);\\n tot++;\\n set<P1>::iterator it;\\n it = s1.begin();\\n P1 tmp, this_man;\\n if (it != s1.end()) {\\n tmp = (*it);\\n this_man.name = man;\\n this_man.v = v;\\n this_man.tim = now;\\n }\\n if (it != s1.end() && tmp < this_man) {\\n s1.insert(this_man);\\n cout << man;\\n puts(\\\" is working hard now.\\\");\\n if (tot % 5 != 0) {\\n P1 tmp = (*it);\\n P2 ttmp = p1top2(tmp);\\n s1.erase(it);\\n s2.insert(ttmp);\\n cout << tmp.name;\\n puts(\\\" is not working now.\\\");\\n }\\n } else {\\n if (tot % 5 == 0) {\\n set<P2>::iterator it;\\n it = s2.begin();\\n P2 this_, tmp;\\n if (it != s2.end()) {\\n tmp = (*it);\\n this_.name = man;\\n this_.v = v;\\n this_.tim = now;\\n } else\\n tmp.v = -100000;\\n if (this_ < tmp) {\\n P1 cpy = p2top1(this_);\\n s1.insert(cpy);\\n cout << man;\\n puts(\\\" is working hard now.\\\");\\n } else {\\n s2.erase(*it);\\n P1 cpy = p2top1(tmp);\\n s1.insert(cpy);\\n s2.insert(this_);\\n cout << man;\\n puts(\\\" is not working now.\\\");\\n cout << tmp.name;\\n puts(\\\" is working hard now.\\\");\\n }\\n } else {\\n P2 this_;\\n this_.name = man;\\n this_.v = v;\\n this_.tim = now;\\n s2.insert(this_);\\n cout << man;\\n puts(\\\" is not working now.\\\");\\n }\\n }\\n } else {\\n tot--;\\n cin >> man;\\n P sx = mp[man];\\n set<P1>::iterator it;\\n P1 tmp1;\\n tmp1.name = man;\\n tmp1.v = sx.first;\\n tmp1.tim = sx.second;\\n it = s1.find(tmp1);\\n if (it == s1.end()) {\\n P2 tmp2;\\n tmp2 = p1top2(tmp1);\\n s2.erase(tmp2);\\n if (tot % 5 == 4) {\\n it = s1.begin();\\n tmp1 = (*it);\\n s1.erase(it);\\n tmp2 = p1top2(tmp1);\\n s2.insert(tmp2);\\n cout << tmp1.name;\\n puts(\\\" is not working now.\\\");\\n }\\n } else {\\n s1.erase(it);\\n if (tot % 5 != 4) {\\n set<P2>::iterator it2;\\n it2 = s2.begin();\\n P2 ss = (*it2);\\n s2.erase(it2);\\n P1 tt = p2top1(ss);\\n s1.insert(tt);\\n cout << ss.name;\\n puts(\\\" is working hard now.\\\");\\n }\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 14392,\n \"score_of_the_acc\": -1.6277,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2782_7117437\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)\\n\\n#define all(c) std::begin(c), std::end(c)\\n\\n#ifdef LOCAL\\n#define debug(...) debug_impl(#__VA_ARGS__, __VA_ARGS__)\\ntemplate <class T, class ...Args> void debug_impl(string s, T&& f, Args &&...args) {\\n cerr << \\\"(\\\" << s << \\\"): \\\" << \\\"(\\\" << forward<T>(f);\\n ((cerr << \\\", \\\" << forward<Args>(args)), ..., (cerr << \\\")\\\\n\\\"));\\n}\\n#else\\n#define debug(...) void(0)\\n#endif\\n\\ntemplate <class T> bool chmax(T& a, const T& b) { return b > a ? (a = b, true) : false; }\\ntemplate <class T> bool chmin(T& a, const T& b) { return b < a ? (a = b, true) : false; }\\n\\n\\ntemplate <class T> istream& operator>>(istream& in, vector<T>& v) {\\n for (auto& e : v) in >> e;\\n return in;\\n}\\ntemplate <class ...Args> void read(Args&... args) {\\n (cin >> ... >> args);\\n}\\n\\ntemplate <class T> ostream& operator<<(ostream& out, const vector<T>& v) {\\n int n = v.size();\\n rep(i, n) {\\n out << v[i];\\n if (i + 1 != n) out << ' ';\\n }\\n return out;\\n}\\n\\ntemplate <class T, class ...Tails> void print(T&& h, Tails &&... tails) {\\n cout << h, ((cout << ' ' << forward<Tails>(tails)), ..., (cout << '\\\\n'));\\n}\\n\\ntemplate <typename T, T(*op)(T, T), T(*e)()>\\nstruct segtree {\\n int n, siz;\\n vector<T> dat;\\n segtree(int n) : segtree(vector<T>(n, e())) {}\\n segtree(vector<T> a) : n(a.size()) {\\n siz = 1;\\n while (siz < n) siz <<= 1;\\n dat.assign(2 * siz, e());\\n rep(i, n) {\\n dat[siz + i] = a[i];\\n }\\n for (int i = n - 1; i > 0; --i) {\\n dat[i] = op(dat[2 * i], dat[2 * i + 1]);\\n }\\n }\\n\\n T get(int p) const {\\n return dat[siz + p];\\n }\\n\\n T prod(int l, int r) const {\\n T sml = e(), smr = e();\\n l += siz, r += siz;\\n for (; l < r; l >>= 1, r >>= 1) {\\n if (l & 1) sml = op(sml, dat[l++]);\\n if (r & 1) smr = op(dat[--r], smr);\\n }\\n return op(sml, smr);\\n }\\n\\n T all_prod() const {\\n return dat[1];\\n }\\n\\n void set(int p, T v) {\\n p += siz;\\n dat[p] = v;\\n while (p >>= 1) {\\n dat[p] = op(dat[2 * p], dat[2 * p + 1]);\\n }\\n }\\n};\\n\\nint op(int x, int y) {\\n return x + y;\\n}\\nint e() {\\n return 0;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int n;\\n cin >> n;\\n\\n vector<string> names;\\n\\n vector<pair<int, int>> a(n);\\n\\n map<string, pair<int, int>> mp;\\n\\n rep(i, n) {\\n string s;\\n int x;\\n read(s, x);\\n a[i] = { x, i };\\n\\n names.push_back(s);\\n\\n mp[s] = { x, i };\\n }\\n\\n int m;\\n cin >> m;\\n\\n vector<tuple<bool, int, int>> b(m);\\n\\n int nxt_id = n;\\n rep(i, m) {\\n char c;\\n string name;\\n read(c, name);\\n\\n if (c == '+') {\\n int x;\\n read(x);\\n b[i] = { true, x, nxt_id };\\n mp[name] = { x, nxt_id };\\n names.push_back(name);\\n ++nxt_id;\\n } else {\\n auto [x2, i2] = mp[name];\\n b[i] = { false, x2, i2 };\\n }\\n }\\n\\n vector<pair<int, int>> sorted;\\n for (auto [x, id] : a) {\\n sorted.emplace_back(x, id);\\n }\\n for (auto [is_join, x, id] : b) {\\n if (is_join) {\\n sorted.emplace_back(x, id);\\n }\\n }\\n sort(all(sorted), greater<>());\\n\\n auto get_index = [&](int x, int id) {\\n return lower_bound(all(sorted), make_pair(x, id), greater<>()) - sorted.begin();\\n };\\n auto get_original_index = [&](int id) {\\n return sorted[id].second;\\n };\\n\\n const int k = sorted.size();\\n\\n vector<int8_t> hard(k, false);\\n\\n segtree<int, op, e> seg(k);\\n\\n // debug(k);\\n\\n {\\n int top20 = n / 5;\\n\\n vector<pair<int, int>> xs(n);\\n rep(i, n) {\\n auto [x, id] = a[i];\\n\\n int idx = get_index(x, id);\\n xs[i] = { x, id };\\n assert(seg.get(idx) == 0);\\n seg.set(idx, 1);\\n }\\n sort(all(xs), greater<>());\\n\\n rep(i, top20) {\\n hard[xs[i].second] = true;\\n }\\n }\\n\\n // debug(seg.all_prod());\\n\\n auto max_index_active = [&](int num) {\\n int l = -1, r = k + 1;\\n while (r - l > 1) {\\n int p = (l + r) >> 1;\\n if (seg.prod(0, p) < num) {\\n l = p;\\n } else {\\n r = p;\\n }\\n }\\n // seg[0, l) < num\\n // seg[0, l] >= num\\n // l is last active person.\\n return l;\\n };\\n\\n auto min_index_lazy = [&](int max_active) {\\n if (max_active == k) return k;\\n int l = max_active + 1, r = k + 1;\\n while (r - l > 1) {\\n int p = (l + r) >> 1;\\n if (seg.prod(max_active + 1, p) == 0) {\\n l = p;\\n } else {\\n r = p;\\n }\\n }\\n // seg[max_active + 1, l) = 0\\n // seg[max_active + 1, l] = 1\\n return l;\\n };\\n\\n auto print_active = [&](int id) {\\n print(names[id], \\\"is working hard now.\\\");\\n };\\n auto print_inactive = [&](int id) {\\n print(names[id], \\\"is not working now.\\\");\\n };\\n\\n for (auto [is_join, x, id] : b) {\\n // debug(x, id);\\n if (is_join) {\\n int pos = get_index(x, id);\\n assert(seg.get(pos) == 0);\\n seg.set(pos, 1);\\n\\n int num = seg.all_prod() / 5;\\n\\n if (seg.prod(0, pos + 1) <= num) {\\n print_active(id);\\n hard[get_original_index(pos)] = true;\\n } else {\\n print_inactive(id);\\n hard[get_original_index(pos)] = false;\\n }\\n } else {\\n int pos = get_index(x, id);\\n assert(seg.get(pos) == 1);\\n seg.set(pos, 0);\\n }\\n\\n // debug(seg.all_prod());\\n\\n int cand1 = max_index_active(seg.all_prod() / 5);\\n int cand2 = min_index_lazy(cand1);\\n\\n // debug(cand1, cand2);\\n\\n if (0 <= cand1 and cand1 < k) {\\n int i = get_original_index(cand1);\\n if (not hard[i]) {\\n print_active(i);\\n hard[i] = true;\\n }\\n }\\n if (0 <= cand2 and cand2 < k) {\\n int i = get_original_index(cand2);\\n if (hard[i]) {\\n print_inactive(i);\\n hard[i] = false;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 11712,\n \"score_of_the_acc\": -0.3024,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2782_7097284\",\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=2167167167167167167;\\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\\\";}\\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}\\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\\tmap<string,pair<int,int>> m;\\n\\tset<pair<pair<int,int>,string>> s1,s2;\\n\\tauto work_hard=[&](string S)->void{\\n\\t\\tcout<<S<<\\\" is working hard now.\\\\n\\\";\\n\\t};\\n\\tauto not_work=[&](string S)->void{\\n\\t\\tcout<<S<<\\\" is not working now.\\\\n\\\";\\n\\t};\\n\\tauto outcoming=[&](string S,bool output)->void{\\n\\t\\tauto val=m[S];\\n\\t\\tpair<pair<int,int>,string> dat={val,S};\\n\\t\\tif((int)(s1.size()+s2.size())%5==0){\\n\\t\\t\\tif(s1.count(dat)){\\n\\t\\t\\t\\ts1.erase(dat);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ts2.erase(dat);\\n\\t\\t\\t\\tauto tmp=(*s1.begin());\\n\\t\\t\\t\\ts1.erase(tmp);\\n\\t\\t\\t\\ts2.insert(tmp);\\n\\t\\t\\t\\tif(output) not_work(tmp.second);\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tif(s2.count(dat)){\\n\\t\\t\\t\\ts2.erase(dat);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ts1.erase(dat);\\n\\t\\t\\t\\tauto tmp=(*s2.rbegin());\\n\\t\\t\\t\\ts2.erase(tmp);\\n\\t\\t\\t\\ts1.insert(tmp);\\n\\t\\t\\t\\tif(output) work_hard(tmp.second);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tm.erase(S);\\n\\t};\\n\\tauto incoming=[&](string S,int level,int ind,bool output)->void{\\n\\t\\tpair<int,int> val={level,ind};\\n\\t\\tpair<pair<int,int>,string> dat={val,S};\\n\\t\\tm[S]=val;\\n\\t\\tif((int)(s1.size()+s2.size())%5==4){\\n\\t\\t\\tauto tmp=(*s2.rbegin());\\n\\t\\t\\tif(tmp.first<val){\\n\\t\\t\\t\\ts1.insert(dat);\\n\\t\\t\\t\\tif(output) work_hard(S);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ts2.insert(dat);\\n\\t\\t\\t\\ts2.erase(tmp);\\n\\t\\t\\t\\ts1.insert(tmp);\\n\\t\\t\\t\\tif(output) not_work(S),work_hard(tmp.second);\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tif(s1.empty()){\\n\\t\\t\\t\\ts2.insert(dat);\\n\\t\\t\\t\\tif(output) not_work(S);\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tauto tmp=(*s1.begin());\\n\\t\\t\\tif(tmp.first>val){\\n\\t\\t\\t\\ts2.insert(dat);\\n\\t\\t\\t\\tif(output) not_work(S);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ts1.insert(dat);\\n\\t\\t\\t\\ts1.erase(tmp);\\n\\t\\t\\t\\ts2.insert(tmp);\\n\\t\\t\\t\\tif(output) work_hard(S),not_work(tmp.second);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t};\\n\\tint N;\\n\\tcin>>N;\\n\\trep(i,N){\\n\\t\\tstring S;\\n\\t\\tint A;\\n\\t\\tcin>>S>>A;\\n\\t\\tincoming(S,A,i,0);\\n\\t}\\n\\tint M;\\n\\tcin>>M;\\n\\trep(i,M){\\n\\t\\tchar c;\\n\\t\\tstring S;\\n\\t\\tint A;\\n\\t\\tcin>>c>>S;\\n\\t\\t//cout<<i<<endl;\\n\\t\\tif(c=='+') cin>>A,incoming(S,A,i+N,1);\\n\\t\\telse outcoming(S,1);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 11284,\n \"score_of_the_acc\": -0.3555,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2782_6024119\",\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 double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n; cin >> n;\\n vector<pair<pair<int,int>,string>> v(n);\\n for(int i=0;i<n;i++){\\n cin >> v[i].second >> v[i].first.first;\\n v[i].first.second = i;\\n }\\n sort(v.rbegin(), v.rend());\\n map<string, pair<int,int>> mp;\\n for(int i=0;i<n;i++){\\n mp[v[i].second] = v[i].first;\\n }\\n\\n map<pair<int,int>,string> hw,nw;\\n for(int i=0;i<n;i++){\\n if(i<n/5){\\n hw[v[i].first] = v[i].second;\\n }\\n else{\\n nw[v[i].first] = v[i].second;\\n }\\n }\\n int num = n;\\n int q; cin >> q;\\n while(q--){\\n char c; cin >> c;\\n vector<string> change;\\n if(c == '+'){\\n string s; int a; cin >> s >> a;\\n pair<int,int> p = pair<int,int>(a,num);\\n mp[s] = p;\\n num++;\\n\\n if(nw.size() == 0){\\n nw[p] = s;\\n }\\n else{\\n auto itr = nw.end(); itr--;\\n auto uo = *itr;\\n if(uo.first < p){\\n hw[p] = s;\\n }\\n else{\\n nw[p] = s;\\n }\\n }\\n\\n while(hw.size() < mp.size()/5){\\n auto itr = nw.end(); itr--;\\n auto uo = *itr;\\n hw[uo.first] = uo.second;\\n nw.erase(itr);\\n change.push_back(uo.second);\\n }\\n while(hw.size() > mp.size()/5){\\n auto itr = hw.begin();\\n auto uo = *itr;\\n nw[uo.first] = uo.second;\\n hw.erase(itr);\\n change.push_back(uo.second);\\n }\\n\\n {\\n if(hw.find(p) != hw.end()){\\n cout << s << \\\" is working hard now.\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << s << \\\" is not working now.\\\" << \\\"\\\\n\\\";\\n }\\n }\\n sort(change.begin(), change.end());\\n for(auto t:change){\\n if(s == t)continue;\\n if(hw.find(mp[t]) != hw.end()){\\n cout << t << \\\" is working hard now.\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << t << \\\" is not working now.\\\" << \\\"\\\\n\\\";\\n }\\n }\\n }\\n else{\\n string s; cin >> s;\\n auto p = mp[s];\\n if(hw.find(p) != hw.end()){\\n hw.erase(p);\\n }\\n else{\\n nw.erase(p);\\n }\\n mp.erase(s);\\n\\n while(hw.size() < mp.size()/5){\\n auto itr = nw.end(); itr--;\\n auto uo = *itr;\\n hw[uo.first] = uo.second;\\n nw.erase(itr);\\n change.push_back(uo.second);\\n }\\n while(hw.size() > mp.size()/5){\\n auto itr = hw.begin();\\n auto uo = *itr;\\n nw[uo.first] = uo.second;\\n hw.erase(itr);\\n change.push_back(uo.second);\\n }\\n\\n sort(change.begin(), change.end());\\n for(auto t:change){\\n if(hw.find(mp[t]) != hw.end()){\\n cout << t << \\\" is working hard now.\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << t << \\\" is not working now.\\\" << \\\"\\\\n\\\";\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 12904,\n \"score_of_the_acc\": -0.5027,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2782_5992008\",\n \"code_snippet\": \"#pragma GCC ta g(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define DEBUG\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__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\\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()\\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 int sz = a.size();\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr;\\n sz--;\\n if(sz) cout << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//#include <atcoder/maxflow>\\n//using namespace atcoder;\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 510000;\\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-9;\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nstruct dat{\\n int a,t;\\n string name;\\n dat(int a, int t, string name) : a(a), t(t), name(name) {}\\n bool operator< (const dat &d) const {\\n if(a != d.a) return a > d.a;\\n if(t != d.t) return t > d.t;\\n return name < d.name;\\n }\\n};\\n\\nint main(){\\n int n; cin >> n;\\n map<string,pii> mp;\\n int sz = n;\\n set<dat> se;\\n se.emplace(inf,inf,\\\"\\\");\\n rep(i,n){\\n string s; cin >> s;\\n int a; cin >> a;\\n se.emplace(a,i,s);\\n mp[s] = {a,i};\\n }\\n int q; cin >> q;\\n auto itr = se.begin();\\n int hard = n/5;\\n int h = hard;\\n while(h > 0){\\n h--;\\n itr++;\\n }\\n rep(i,q){\\n char c; cin >> c;\\n if(c == '+'){\\n string s; cin >> s;\\n int a; cin >> a;\\n dat d(a,i+n,s);\\n mp[s] = {a,i+n};\\n sz++;\\n int nh = sz/5;\\n se.emplace(d);\\n if(d < *itr){\\n cout << d.name << \\\" is working hard now.\\\\n\\\";\\n if(hard < nh) hard = nh;\\n else{\\n cout << (*itr).name << \\\" is not working now.\\\\n\\\";\\n itr--;\\n }\\n }else{\\n if(hard < nh){\\n itr++;\\n if((*itr).t == d.t){\\n cout << d.name << \\\" is working hard now.\\\\n\\\";\\n }else{\\n cout << d.name << \\\" is not working now.\\\\n\\\";\\n cout << (*itr).name << \\\" is working hard now.\\\\n\\\";\\n }\\n hard = nh;\\n }else{\\n cout << d.name << \\\" is not working now.\\\\n\\\";\\n }\\n }\\n }else{\\n string s; cin >> s;\\n dat d(mp[s].first,mp[s].second,s);\\n sz--;\\n int nh = sz/5;\\n if(d < *itr){\\n se.erase(d);\\n if(hard > nh) hard = nh;\\n else{\\n itr++;\\n cout << (*itr).name << \\\" is working hard now.\\\\n\\\"; \\n }\\n }else if((*itr).name == d.name){\\n itr = se.erase(itr);\\n if(hard > nh){\\n hard = nh;\\n itr--;\\n }else{\\n cout << (*itr).name << \\\" is working hard now.\\\\n\\\";\\n }\\n }else{\\n se.erase(d);\\n if(hard > nh){\\n hard = nh;\\n cout << (*itr).name << \\\" is not working now.\\\\n\\\";\\n itr--;\\n }\\n }\\n mp.erase(s);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 11184,\n \"score_of_the_acc\": -0.4637,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2782_5991994\",\n \"code_snippet\": \"#pragma GCC ta g(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define DEBUG\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__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\\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()\\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 int sz = a.size();\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr;\\n sz--;\\n if(sz) cout << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//#include <atcoder/maxflow>\\n//using namespace atcoder;\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 510000;\\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-9;\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nstruct dat{\\n int a,t;\\n string name;\\n dat(int a, int t, string name) : a(a), t(t), name(name) {}\\n bool operator< (const dat &d) const {\\n if(a != d.a) return a > d.a;\\n if(t != d.t) return t > d.t;\\n return name < d.name;\\n }\\n};\\n\\nint main(){\\n int n; cin >> n;\\n map<string,pii> mp;\\n int sz = n;\\n set<dat> se;\\n se.emplace(inf,inf,\\\"\\\");\\n rep(i,n){\\n string s; cin >> s;\\n int a; cin >> a;\\n se.emplace(a,i,s);\\n mp[s] = {a,i};\\n }\\n int q; cin >> q;\\n auto itr = se.begin();\\n int hard = n/5;\\n int h = hard;\\n while(h > 0){\\n h--;\\n itr++;\\n }\\n rep(i,q){\\n char c; cin >> c;\\n if(c == '+'){\\n string s; cin >> s;\\n int a; cin >> a;\\n dat d(a,i+n,s);\\n mp[s] = {a,i+n};\\n sz++;\\n int nh = sz/5;\\n se.emplace(d);\\n if(d < *itr){\\n cout << d.name << \\\" is working hard now.\\\\n\\\";\\n if(hard < nh) hard = nh;\\n else{\\n cout << (*itr).name << \\\" is not working now.\\\\n\\\";\\n itr--;\\n }\\n }else{\\n if(hard < nh){\\n itr++;\\n if((*itr).t == d.t){\\n cout << d.name << \\\" is working hard now.\\\\n\\\";\\n }else{\\n cout << d.name << \\\" is not working now.\\\\n\\\";\\n cout << (*itr).name << \\\" is working hard now.\\\\n\\\";\\n }\\n hard = nh;\\n }else{\\n cout << d.name << \\\" is not working now.\\\\n\\\";\\n }\\n }\\n }else{\\n string s; cin >> s;\\n dat d(mp[s].first,mp[s].second,s);\\n sz--;\\n int nh = sz/5;\\n if(d < *itr){\\n cout << d.name << \\\" is not working now.\\\\n\\\";\\n se.erase(d);\\n if(hard > nh) hard = nh;\\n else{\\n itr++;\\n cout << (*itr).name << \\\" is working hard now.\\\\n\\\"; \\n }\\n }else if((*itr).name == d.name){\\n itr = se.erase(itr);\\n if(hard > nh){\\n hard = nh;\\n itr--;\\n }else{\\n cout << (*itr).name << \\\" is working hard now.\\\\n\\\";\\n }\\n }else{\\n se.erase(d);\\n if(hard > nh){\\n hard = nh;\\n cout << (*itr).name << \\\" is not working now.\\\\n\\\";\\n itr--;\\n }\\n }\\n mp.erase(s);\\n }\\n }\\n}\",\n \"accuracy\": 0.15151515151515152,\n \"time_ms\": 60,\n \"memory_kb\": 11264,\n \"score_of_the_acc\": -0.4772,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":1670,"cells":{"group_id":{"kind":"string","value":"aoj_2781_cpp"},"problem_description":{"kind":"string","value":"Help the Princess!\nThe people of a certain kingdom make a revolution against the bad government of the princess. The revolutionary army invaded the royal palace in which the princess lives. The soldiers of the army are exploring the palace to catch the princess. Your job is writing a program to decide that the princess can escape from the royal palace or not.\nFor simplicity, the ground of the palace is a rectangle divided into a grid. There are two kinds of cells in the grid: one is a cell that soldiers and the princess can enter, the other is a cell that soldiers or the princess cannot enter. We call the former an empty cell, the latter a wall. The princess and soldiers are in different empty cells at the beginning. There is only one escape hatch in the grid. If the princess arrives the hatch, then the princess can escape from the palace. There are more than or equal to zero soldiers in the palace.\nThe princess and all soldiers take an action at the same time in each unit time. In other words, the princess and soldiers must decide their action without knowing a next action of the other people. In each unit time, the princess and soldiers can move to a horizontally or vertically adjacent cell, or stay at the current cell. Furthermore the princess and soldiers cannot move out of the ground of the palace. If the princess and one or more soldiers exist in the same cell after their move, then the princess will be caught. It is guaranteed that the princess can reach the escape hatch via only empty cells if all soldiers are removed from the palace.\nIf there is a route for the princess such that soldiers cannot catch the princess even if soldiers make any moves, then the princess can escape the soldiers. Note that if the princess and a soldier arrive the escape hatch at the same time, the princess will be caught. Can the princess escape from the palace?\nInput\nEach dataset is formatted as follows.\n$H$ $W$\n$map_1$\n$map_2$\n...\n$map_H$\nThe first line of a dataset contains two positive integers $H$ and $W$ delimited by a space, where $H$ is the height of the grid and $W$ is the width of the grid ($2 \\leq H, W \\leq 200$).\nThe $i$-th line of the subsequent $H$ lines gives a string $map_i$, which represents situation in the ground of palace.\n$map_i$ is a string of length $W$, and the $j$-th character of $map_i$ represents the state of the cell of the $i$-th row and the $j$-th column.\n'@', '\\$', '%', '.', and '#' represent the princess, a soldier, the escape hatch, an empty cell, and a wall, respectively. It is guaranteed that there exists only one '@', only one '%', and more than or equal to zero '\\$' in the grid.\nOutput\nOutput a line containing a word \"Yes\", if the princess can escape from the palace. Otherwise, output \"No\".\nSample Input 1\n2 4\n%.@\\$\n..\\$\\$\nOutput for the Sample Input 1\nYes\nSample Input 2\n3 4\n.%..\n.##.\n.@\\$.\nOutput for the Sample Input 2\nYes\nSample Input 3\n2 3\n%\\$@\n###\nOutput for the Sample Input 3\nNo\nSample Input 4\n2 3\n@#\\$\n.%.\nOutput for the \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2781_10730387","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint n, m;\nint x, y;\nchar str[210][210];\nchar tmp[210][210];\nint dirx[] = {1, -1, 0, 0};\nint diry[] = {0, 0, 1, -1};\nint val (int a, int b) {\n if (a<0 || b<0 || a>=n || b>=m) return 0;\n return 1;\n}\nint bfs () {\n //printf(\"%d %d\\n\", x, y);\n int flag = 0;\n for (int i=0; i<n; i++) {\n for (int j=0; j<m; j++) {\n tmp[i][j] = str[i][j];\n }\n }\n for (int i=0; i<n; i++) {\n for (int j=0; j<m; j++) {\n if (str[i][j] == '@') {\n // printf(\"%d %d\\n\",i , j);\n flag = 1;\n if (i==x && j==y) {\n // printf(\"%d %d\\n\", i, j);\n return 1;\n }\n else {\n for (int k=0; k<4; k++) {\n if (val(i+dirx[k], j+diry[k]) && (str[i+dirx[k]][j+diry[k]] == '.' || str[i+dirx[k]][j+diry[k]] == '%')) {\n tmp[i+dirx[k]][j+diry[k]] = '@';\n }\n }\n }\n }\n else if (str[i][j] == '$') {\n for (int k=0; k<4; k++) {\n if (val(i+dirx[k], j+diry[k]) && str[i+dirx[k]][j+diry[k]] != '#') {\n tmp[i+dirx[k]][j+diry[k]] = '$';\n }\n }\n }\n }\n }\n for (int i=0; i<n; i++) {\n for (int j=0; j<m; j++) {\n str[i][j] = tmp[i][j];\n }\n }\n if (!flag) return 0;\n else return bfs();\n}\nint main () {\n //freopen(\"in.txt\", \"r\", stdin);\n scanf(\"%d %d\", &n, &m);\n for (int i=0; i<n; i++)\n scanf(\"%s\", str[i]);\n for (int i=0; i<n; i++) {\n for (int j=0; j<n; j++) {\n if (str[i][j] == '%') {\n x = i;\n y = j;\n break;\n }\n }\n }\n if (bfs()) printf(\"Yes\\n\");\n else printf(\"No\\n\");\n return 0;\n}","accuracy":0.34615384615384615,"time_ms":10,"memory_kb":3552,"score_of_the_acc":-0.0012,"final_rank":15},{"submission_id":"aoj_2781_10730386","code_snippet":"#include <bits/stdc++.h>\n//file stream\n#define output freopen(\"output.txt\",\"w\",stdout)\n#define input freopen(\"input.txt\",\"r\",stdin)\n//functions\n#define pb(x) push_back(x)\n// if needed pair\n#define f first\n#define s second\n#define mp(x,y) make_pair(x,y)\n\n\n//inputs 1 var\n#define s1i(n) scanf(\"%d\",&n)\n#define s1u(n) scanf(\"%u\",&n)\n#define s1l(n) scanf(\"%lld\",&n)\n#define s1lu(n) scanf(\"%llu\",&n)\n#define s1d(n) scanf(\"%lf\",&n)\n#define s1s(n) scanf(\"%s\",n)\n//inputs 2 var\n#define s2i(n,m) scanf(\"%d %d\",&n,&m)\n#define s2u(n,m) scanf(\"%u %u\",&n,&m)\n#define s2l(n,m) scanf(\"%lld %lld\",&n,&m)\n#define s2lu(n,m) scanf(\"%llu %llu\",&n,&m)\n#define s2d(n,m) scanf(\"%lf %lf\",&n,&m)\n//inputs 3 var\n#define s3i(n,m,l) scanf(\"%d %d %d\",&n,&m,&l)\n#define s3u(n,m,l) scanf(\"%u %u %u\",&n,&m,&l)\n#define s3l(n,m,l) scanf(\"%lld %lld %lld\",&n,&m,&l)\n#define s3lu(n,m,l) scanf(\"%llu %llu %llu\",&n,&m,&l)\n#define s3d(n,m,l) scanf(\"%lf %lf %lf\",&n,&m,&l)\n\n//output 1 var\n#define p1i(n) printf(\"%d\",n)\n#define p1u(n) printf(\"%u\",n)\n#define p1l(n) printf(\"%lld\",n)\n#define p1lu(n) printf(\"%llu\",n)\n#define p1d(n,pre) printf(\"%.*f\",pre,n)\n#define p1s(n) printf(\"%s\",n)\n//output 2 var\n#define p2i(n,m) printf(\"%d %d\",n,m)\n#define p2u(n,m) printf(\"%u %u\",n,m)\n#define p2l(n,m) printf(\"%lld %lld\",n,m)\n#define p2lu(n,m) printf(\"%llu %llu\",n,m)\n#define p2d(n,m,pre) printf(\"%.*f %.*f\",pre,n,pre,m)\n//inputs 3 var less important\n#define p3i(n,m,l) printf(\"%d %d %d\",n,m,l)\n#define p3u(n,m,l) printf(\"%u %u %u\",n,m,l)\n#define p3l(n,m,l) printf(\"%lld %lld %lld\",n,m,l)\n#define p3lu(n,m,l) printf(\"%llu %llu %llu\",n,m,l)\n//output misc\n#define nline() putchar(10)\n#define space() putchar(' ')\n#define pch(c) putchar(c)\n#define tcase(i) printf(\"Case %d:\",i)\n//loop\n#define fr0(i,n) for(i=0;i<n;i++)\n#define fr1(i,n) for(i=1;i<=n;i++)\n//memory reset\n#define set0(x) memset(x,0,sizeof x)\n#define setn1(x) memset(x,-1,sizeof x)\n#define setinf(x) memset(x,125,sizeof x)\n//bit operation single variable\n#define On(x,i) (x|=(1<<(i)))\n#define Off(x,i) (x&= ~(1<<(i)))\n#define isOn(x,i) (x&(1<<(i)))\n#define Toggle(x,i) (x^=(1<<(i)))\n#define tmod(x,i) (x&(~(-1<<i)))\n\n//data type\ntypedef long long ll;\ntypedef unsigned long long ull;\n//bit operation array\n//constant\nconst double EPS = 1e-9;\nusing namespace std;\nint tc,o,prc,sld,i,j,r,c,x,y;\n\nchar B[250][250];\nqueue<pair<int,int> > q;\nmap<pair<int,int> ,int> level,visited;\npair<int,int>u;\nmain()\n{\n {\n s2i(r,c);\n fr0(i,r)\n {\n scanf(\"%s\",B[i]);\n fr0(j,c)\n {\n if(B[i][j]=='%')\n {\n x=i,y=j;continue;\n }\n }\n }\n q.push(mp(x,y));\n level[mp(x,y)]=0;\n visited[mp(x,y)]=1;\n sld=5000;prc=50000;\n while(!q.empty())\n {\n u=q.front();q.pop();\n if(B[u.f][u.s]=='@')prc=level[u];\n if(B[u.f][u.s]=='$')sld=min(sld,level[u]);\n\n if(u.f+1<r && B[u.f+1][u.s]!='#' && !visited[mp(u.f+1,u.s)])\n {\n level[mp(u.f+1,u.s)]=level[u]+1;\n visited[mp(u.f+1,u.s)]=1;\n q.push(mp(u.f+1,u.s));\n }\n\n if(u.s+1<c && B[u.f][u.s+1]!='#' && !visited[mp(u.f,u.s+1)])\n {\n level[mp(u.f,u.s+1)]=level[u]+1;\n visited[mp(u.f,u.s+1)]=1;\n q.push(mp(u.f,u.s+1));\n }\n\n\n if(u.f-1>=0 && B[u.f-1][u.s]!='#' && !visited[mp(u.f-1,u.s)])\n {\n level[mp(u.f-1,u.s)]=level[u]+1;\n visited[mp(u.f-1,u.s)]=1;\n q.push(mp(u.f-1,u.s));\n }\n\n if(u.s+1>=0 && B[u.f][u.s-1]!='#' && !visited[mp(u.f,u.s-1)])\n {\n level[mp(u.f,u.s-1)]=level[u]+1;\n visited[mp(u.f,u.s-1)]=1;\n q.push(mp(u.f,u.s-1));\n }\n }\n if(prc<sld)printf(\"Yes\\n\");\n else printf(\"No\\n\");\n\n }\n}","accuracy":1,"time_ms":20,"memory_kb":8104,"score_of_the_acc":-0.0299,"final_rank":7},{"submission_id":"aoj_2781_10730381","code_snippet":"/*\n * Biborno\n * fb.com/mfmejbah\n * fmejbah@gmail.com\n *\n * B\n * Date: 15 Nov 2016\n */\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint dx[] = {-1, 0, 0, 1};\nint dy[] = {0, -1, 1, 0};\nint h, w, d;\nchar g[201][201];\n\nbool bfs( int px, int py, int ex, int ey ) {\n bool vis[h][w];\n int dis[h][w];\n memset(vis, 0, sizeof(vis));\n queue<pair<int, int> > Q;\n vis[px][py] = 1;\n dis[px][py] = 0;\n Q.push(make_pair(px, py));\n while(!Q.empty()) {\n pair<int, int> p = Q.front();\n Q.pop();\n for( int i = 0; i < 4; i++ ) {\n int x = p.first + dx[i];\n int y = p.second + dy[i];\n if( x >= 0 && x < h && y >= 0 && y < w && !vis[x][y] && (g[x][y] == '.' || g[x][y] == '%') ) {\n vis[x][y] = 1;\n dis[x][y] = dis[p.first][p.second] + 1;\n Q.push(make_pair(x, y));\n }\n if( x == ex && y == ey ) {\n d = dis[x][y];\n return true;\n }\n }\n }\n return false;\n}\n\nint bfss( int px, int py, int ex, int ey ) {\n bool vis[h][w];\n int dis[h][w];\n memset(vis, 0, sizeof(vis));\n memset(dis, 0, sizeof(dis));\n queue<pair<int, int> > Q;\n vis[px][py] = 1;\n Q.push(make_pair(px, py));\n while(!Q.empty()) {\n pair<int, int> p = Q.front();\n Q.pop();\n for( int i = 0; i < 4; i++ ) {\n int x = p.first + dx[i];\n int y = p.second + dy[i];\n if( x >= 0 && x < h && y >= 0 && y < w && !vis[x][y] && (g[x][y] == '.' || g[x][y] == '%') ) {\n vis[x][y] = 1;\n dis[x][y] = dis[p.first][p.second] + 1;\n Q.push(make_pair(x, y));\n }\n if( x == ex && y == ey ) {\n return dis[x][y];\n }\n }\n }\n return 0;\n}\nint main()\n{\n //freopen(\"B.in\", \"r\", stdin);\n //freopen(\"B.out\", \"w\", stdout);\n cin >> h >> w;\n int px, py, ex, ey;\n for( int i = 0; i < h; i++ )\n for( int j = 0; j < w; j++ ) {\n cin >> g[i][j];\n if( g[i][j] == '@' ) px = i, py = j;\n if( g[i][j] == '%' ) ex = i, ey = j;\n }\n if(bfs(px, py, ex, ey)) {\n bool f = 1;\n for( int i = 0; i < h; i++ )\n for( int j = 0; j < w; j++ )\n if( g[i][j] == '$' )\n if( bfss(i, j, ex, ey) == d ) {\n f = 0;\n break;\n }\n if(f)puts(\"Yes\");\n else puts(\"No\");\n } else puts(\"No\");\n}","accuracy":0.17307692307692307,"time_ms":20,"memory_kb":3448,"score_of_the_acc":-0.006,"final_rank":17},{"submission_id":"aoj_2781_10691088","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<queue>\n\nusing namespace std;\n\nconst int f[4][2]={{1,0},{-1,0},{0,1},{0,-1}};\nstruct Q{\n int x;\n int y;\n int num;\n bool cmp(Q a){\n return a.x==x&&a.y==y;\n }\n Q(int _x=0,int _y=0,int _num=0):x(_x),y(_y),num(_num){}\n};\nint n,m;\nchar map[210][210];\nQ shi[400000];\nint sl;\nQ z;\nQ g;\nint ansG;\nint ansS=0x7fffffff;\nbool h[210][210];\n\nint BFS(Q b){\n memset(h,0,sizeof(h));\n queue<Q> q;\n h[b.x][b.y]=1;\n q.push(b);\n while(!q.empty()){\n Q a=q.front();\n q.pop();\n if(a.cmp(z)){\n return a.num;\n }\n for(int i=0;i<4;i++){\n int xx=a.x+f[i][0];\n int yy=a.y+f[i][1];\n int num=a.num+1;\n if(xx>=0&&yy>=0&&xx<n&&yy<m&&!h[xx][yy]&&(map[xx][yy]=='.'||map[xx][yy]=='%')){\n\t\t\t\th[xx][yy]=1;\n q.push(Q(xx,yy,num));\n }\n }\n }\n return -1;\n}\n\nint main()\n{\n cin>>n>>m;\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n cin>>map[i][j];\n if(map[i][j]=='%'){\n z=Q(i,j);\n }else if(map[i][j]=='@'){\n g=Q(i,j);\n }else if(map[i][j]=='$'){\n shi[sl++]=Q(i,j);\n }\n }\n }\n ansG=BFS(g);\n if(ansG<0){\n\t\tcout<<\"No\"<<endl;\n\t\treturn 0;\n\t}\n for(int i=0;i<sl;i++){\n int w=BFS(shi[i]);\n if(w>0){\n\t\t\tansS=min(ansS,w);\n\t\t}\n }\n if(ansG<ansS){\n cout<<\"Yes\"<<endl;\n }else{\n cout<<\"No\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":8220,"score_of_the_acc":-0.0788,"final_rank":9},{"submission_id":"aoj_2781_6030555","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;\n\n// g <- pair < v , cost > \ntemplate < class T >\nvector<T> Dijkstra(vector<vector<pair<int,T>>> &g, vector<int> starts) {\n const auto INF = numeric_limits<T>::max();\n vector<T> dist(g.size(), INF);\n priority_queue<pair<T,int>> Q;\n for(int s : starts) Q.emplace(0, s);\n while(!Q.empty()){\n T cost = Q.top().first;\n int v = Q.top().second;\n Q.pop();\n cost = - cost;\n if(dist[v] == INF){\n dist[v] = cost;\n for(auto e : g[v]){\n if(dist[e.first] == INF){\n Q.emplace(-(cost + e.second), e.first);\n }\n }\n }\n }\n return dist;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n \n int H,W; cin >> H >> W;\n vector<string> grid(H);\n rep(i,H) cin >> grid[i];\n auto f = [&](int i, int j){ return i * W + j; };\n\n vector<vector<pair<int,int>>> G(H * W);\n int di[] = {0, 1};\n int dj[] = {1, 0};\n rep(i,H)rep(j,W)rep(d,2) {\n int ni = i + di[d], nj = j + dj[d];\n if(0 <= ni && ni < H && 0 <= nj && nj < W) {\n if(grid[i][j] != '#' && grid[ni][nj] != '#') {\n G[f(i, j)].push_back({f(ni, nj), 1});\n G[f(ni, nj)].push_back({f(i, j), 1});\n }\n }\n }\n\n int GOAL;\n rep(i,H)rep(j,W)if(grid[i][j] == '%') GOAL = f(i, j);\n int PRINCESS;\n vector<int> SOLDIERS;\n rep(i,H)rep(j,W){\n if(grid[i][j] == '@') PRINCESS = Dijkstra(G, vector<int>{f(i, j)})[GOAL];\n if(grid[i][j] == '$') SOLDIERS.push_back(f(i, j));\n }\n cout << (PRINCESS < Dijkstra(G, SOLDIERS)[GOAL] ? \"Yes\" : \"No\") << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":6672,"score_of_the_acc":-0.0172,"final_rank":4},{"submission_id":"aoj_2781_6030554","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;\n\n// g <- pair < v , cost > \ntemplate < class T >\nvector<T> Dijkstra(vector<vector<pair<int,T>>> &g, vector<int> starts) {\n vector<T> dist(g.size(), -1);\n priority_queue<pair<T,int>> Q;\n for(int s : starts) Q.emplace(0, s);\n while(!Q.empty()){\n T cost = Q.top().first;\n int v = Q.top().second;\n Q.pop();\n cost = - cost;\n if(dist[v] == -1){\n dist[v] = cost;\n for(auto e : g[v]){\n if(dist[e.first] == -1){\n Q.emplace(-(cost + e.second), e.first);\n }\n }\n }\n }\n for(auto &d : dist) if(d == -1) d = numeric_limits<T>::max();\n return dist;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n \n int H,W; cin >> H >> W;\n vector<string> grid(H);\n rep(i,H) cin >> grid[i];\n auto f = [&](int i, int j){ return i * W + j; };\n\n vector<vector<pair<int,int>>> G(H * W);\n int di[] = {0, 1};\n int dj[] = {1, 0};\n rep(i,H)rep(j,W)rep(d,2) {\n int ni = i + di[d], nj = j + dj[d];\n if(0 <= ni && ni < H && 0 <= nj && nj < W) {\n if(grid[i][j] != '#' && grid[ni][nj] != '#') {\n G[f(i, j)].push_back({f(ni, nj), 1});\n G[f(ni, nj)].push_back({f(i, j), 1});\n }\n }\n }\n\n int GOAL;\n rep(i,H)rep(j,W)if(grid[i][j] == '%') GOAL = f(i, j);\n int PRINCESS;\n vector<int> SOLDIERS;\n rep(i,H)rep(j,W){\n if(grid[i][j] == '@') PRINCESS = Dijkstra(G, vector<int>{f(i, j)})[GOAL];\n if(grid[i][j] == '$') SOLDIERS.push_back(f(i, j));\n }\n cout << (PRINCESS < Dijkstra(G, SOLDIERS)[GOAL] ? \"Yes\" : \"No\") << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":6748,"score_of_the_acc":-0.0175,"final_rank":5},{"submission_id":"aoj_2781_5176848","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef pair<int, int>PII;\nconst int N = 220;\nint n, m;\n\nchar s[N][N];\nint bx, by;\nint ax, ay;\n\nset<PII>q1, q2;\n\nint st[N][N];\n\nint dx[4] = {1, -1, 0, 0};\nint dy[4] = {0, 0, 1, -1};\n\nint main()\n{\n for (int i = 1; i <= 1e8; i ++);\n scanf(\"%d%d\", &n, &m);\n vector<vector<char> >a(n);\n for (int i = 1; i <= n; i++)\n {\n scanf(\"%s\", s[i] + 1);\n int len = strlen(s[i] + 1);\n for (int j = 1; j <= len; j ++)\n {\n if(s[i][j] == '\\\\') continue;\n a[i - 1].push_back(s[i][j]);\n }\n }\n for (int i = 0; i < n; i ++)\n {\n for (int j = 0; j < m; j ++)\n {\n \n if(a[i][j] == '@')\n {\n ax = i, ay = j;\n q1.insert({i, j});\n }\n else if(a[i][j] == '%')\n {\n bx = i, by = j;\n }\n else if(a[i][j] == '$')\n {\n q2.insert({i, j});\n // cout << i << \" \" << j<<'\\n';\n }\n }\n }\n while(!q1.empty())\n {\n set<PII>tmp;\n int t = q2.size();\n for (int i = 0; i < t; i ++)\n {\n PII x = *q2.begin();\n q2.erase(q2.begin());\n for (int k = 0; k < 4; k ++)\n {\n int nx = x.first + dx[k];\n int ny = x.second + dy[k];\n if(nx < 0 || nx >= n || ny < 0 || ny >= m || a[nx][ny] == '#'||st[nx][ny] == 2) continue;\n st[nx][ny] = 2;\n // cout << nx << \" \" << ny <<'\\n';\n tmp.insert({nx, ny});\n }\n }\n q2 = tmp;\n tmp.clear();\n t = q1.size();\n for (int i = 0; i < t; i ++)\n {\n PII x = *q1.begin();\n q1.erase(q1.begin());\n for (int k = 0; k < 4; k ++)\n {\n int nx = x.first + dx[k];\n int ny = x.second + dy[k];\n if(nx < 0 || nx >= n || ny < 0 || ny >= m || a[nx][ny] == '#'||st[nx][ny] == 2) continue;\n //cout << nx << \" \" << ny << '\\n';\n if(nx == bx && ny == by)\n {\n puts(\"Yes\");\n return 0;\n }\n tmp.insert({nx, ny});\n }\n }\n \n q1= tmp;\n }\n puts(\"No\");\n}","accuracy":1,"time_ms":10,"memory_kb":6812,"score_of_the_acc":-0.0179,"final_rank":6},{"submission_id":"aoj_2781_5176668","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\ntypedef pair<int, int> pii;\n\nconst int maxn = 2e2+10;\nint n, m, dx, dy, px, py, sx[maxn], sy[maxn], cnt, a[maxn][maxn];\nint b[maxn][maxn];\nchar s[maxn];\n\nint work(int x, int y)\n{\n\tmemset(b, 63, sizeof(b));\n\tqueue<pii > q; q.push({x, y});\n\tqueue<int> st; st.push(0);\n\twhile(!q.empty())\n\t{\n\t\tint nx = q.front().first, ny = q.front().second; q.pop();\n\t\tint nt = st.front(); st.pop();\n\t\tif(nx >= 1 && nx <= n && ny >= 1 && ny <= m && !a[nx][ny] && nt < b[nx][ny])\n\t\t{\n\t\t\tb[nx][ny] = nt;\n\t\t\tq.push({nx+1, ny}); st.push(nt+1);\n\t\t\tq.push({nx-1, ny}); st.push(nt+1);\n\t\t\tq.push({nx, ny+1}); st.push(nt+1);\n\t\t\tq.push({nx, ny-1}); st.push(nt+1);\n\t\t}\n\t}\n\treturn b[dx][dy];\n}\n\nint main()\n{\n\tscanf(\"%d%d\", &n, &m);\n\tfor(int i = 1; i <= n; i++, getchar())\n\t{\n\t\tscanf(\"%s\", s+1);\n\t\tfor(int j = 1; j <= m; j++)\n\t\t{\n\t\t\tchar c = s[j];\n\t\t\tif(c == '%') dx = i, dy = j;\n\t\t\telse if(c == '@') px = i, py = j;\n\t\t\telse if(c == '$') \n\t\t\t{\n\t\t\t\tcnt++;\n\t\t\t\tsx[cnt] = i, sy[cnt] = j;\n\t\t\t}\n\t\t\telse if(c == '#') a[i][j] = 1;\n\t\t}\n\t}\n\tint ans1 = 1e9;\n\tfor(int i = 1; i <= cnt; i++)\n\t{\n\t\tans1 = min(ans1, work(sx[i], sy[i]));\n\t} \n\tint ans2 = work(px, py);\n//\tprintf(\"%d %d\\n\", ans1, ans2);\n\tprintf(\"%s\\n\", ans1 > ans2 ? \"Yes\":\"No\");\n\treturn 0;\n}\n\n/*\n2 4\n%.@$\n..$$\n\n3 4\n.%..\n.##.\n.@$.\n\n2 3\n%$@\n###\n\n2 3\n@#$\n.%.\n\n*/","accuracy":0.11538461538461539,"time_ms":20,"memory_kb":3444,"score_of_the_acc":-0.006,"final_rank":20},{"submission_id":"aoj_2781_5175832","code_snippet":"#include<iostream>\n#include<sstream>\n#include<fstream>\n#include<iomanip>\n#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\n#include<queue>\n#include<stack>\n#include<vector>\n#include<string>\n#include<map>\n#include<set>\n#include<ctime>\n#include<bitset>\n#include<iterator>\n#define bug cout<<\"-----------\"<<endl;\n#define ll long long\n#define ull unsigned long long\n#define pb push_back\n#define mp make_pair\n#define pi pair<int, int>\n#define fi first\n#define se second\nusing namespace std;\nconst int N=1e6+5,M=1e9+7;\nconst ull base=13331;\nconst double Pi=acos(-1.0);\nconst ll inf=0x3f3f3f3f3f3f3f3f;\ninline int read() {\n int x=0,f=1;char ch=getchar();\n while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}\n while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}\n return x*f;\n}\nint d[205][205],n,m;\nint v[205][205];\nchar a[205][205];\nint dirx[5]={0,0,0,1,-1};\nint diry[5]={0,1,-1,0,0};\nvoid dfs1(int x,int y,int t){\n\tif(d[x][y]<=t)return;\n\tif(a[x][y]=='#')return;\n\tif(a[x][y]=='$'&&!v[x][y]){\n\t\tv[x][y]=1;\n\t\tdfs1(x,y,0);\n\t\treturn;\n\t}\n\td[x][y]=min(t,d[x][y]);\n\tfor(int i=1;i<=4;i++){\n\t\tint x1=x+dirx[i];\n\t\tint y1=y+diry[i];\n\t\tif(x1<1||x1>n)continue;\n\t\tif(y1<1||y1>m)continue;\n\t\tdfs1(x1,y1,t+1);\n\t}\n}\nint v1[205][205];\nbool dfs2(int x,int y,int t){\n\tif(v1[x][y])return false;\n\tv1[x][y]=1;\n\tif(a[x][y]=='#')return false;\n\tif(t>=d[x][y])return false;\n\tif(a[x][y]=='%')return true;\n\tfor(int i=1;i<=4;i++){\n\t\tint x1=x+dirx[i];\n\t\tint y1=y+diry[i];\n\t\tif(x1<1||x1>n)continue;\n\t\tif(y1<1||y1>m)continue;\n\t\tif(dfs2(x1,y1,t+1))return true;\n\t}\n\treturn false;\n}\nint main(){\n\tios::sync_with_stdio(false);\n\tcin>>n>>m;\n\tstd::vector<pair<int,int> > vec;\n\tint px,py;\n\tfor(int i=1;i<=n;i++){\n\t\tfor(int j=1;j<=m;j++){\n\t\t\tcin>>a[i][j];\n\t\t\tif(a[i][j]=='$'){\n\t\t\t\tvec.pb(mp(i,j));\n\t\t\t}\n\t\t\tif(a[i][j]=='@'){\n\t\t\t\tpx=i,py=j;\n\t\t\t}\n\t\t}\n\t}\n\tmemset(d,0x3f,sizeof(d));\n\tint cnt=vec.size();\n\tfor(int i=0;i<cnt;i++){\n\t\tif(v[vec[i].fi][vec[i].se])continue;\n\t\tv[vec[i].fi][vec[i].se]=1;\n\t\tdfs1(vec[i].fi,vec[i].se,0);\n\t}\n\tif(dfs2(px,py,0)){\n\t\tcout<<\"Yes\"<<endl;\n\t}\n\telse cout<<\"No\"<<endl;\n}\n/*\n2 4\n%.@$\n..$$\n3 4\n.%..\n.##.\n.@$.\n2 3\n%$@\n###\n2 3\n@#$\n.%.\n*/","accuracy":0.36538461538461536,"time_ms":10,"memory_kb":4872,"score_of_the_acc":-0.0079,"final_rank":14},{"submission_id":"aoj_2781_5175552","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n//#define ll long long\n#define int long long\n//#define ull unsigned long long\n#define PI pair<int,int>\n//#define PII pair<int,PI>\n//#define PI pair<ll,int>\nconst int maxm=555;\n/*\n@ 公主\n$ 士兵\n% 出口\n. 空格\n# 墙\n*/\nint dx[]={0,0,1,-1};\nint dy[]={1,-1,0,0};\nmap<PI,int>mark,mark2;\nchar a[maxm][maxm];\nint n,m;\nvector<PI>p;\nvector<PI>out;\nPI st;\nvoid bfs1(){\n queue<PI>q;\n for(auto i:p){\n q.push(i);\n mark[i]=1;\n }\n while(q.size()){\n PI x=q.front();q.pop();\n for(int k=0;k<4;k++){\n int xx=x.first+dx[k];\n int yy=x.second+dy[k];\n if(xx<=0||xx>n||yy<=0||yy>m)continue;\n if(a[xx][yy]=='#')continue;\n PI t={xx,yy};\n if(mark[t])continue;\n mark[t]=mark[x]+1;\n q.push(t);\n }\n }\n}\nvoid bfs2(){\n queue<PI>q;\n q.push(st);\n mark2[st]=1;\n while(q.size()){\n PI x=q.front();q.pop();\n for(int k=0;k<4;k++){\n int xx=x.first+dx[k];\n int yy=x.second+dy[k];\n if(xx<=0||xx>n||yy<=0||yy>m)continue;\n if(a[xx][yy]=='#')continue;\n PI t={xx,yy};\n if(!mark[t]||mark[t]>mark2[x]+1){\n if(mark2[t])continue;\n mark2[t]=mark2[x]+1;\n q.push(t);\n }\n }\n }\n}\nsigned main(){\n ios::sync_with_stdio(0);\n cin>>n>>m;\n for(int i=1;i<=n;i++){\n for(int j=1;j<=m;j++){\n cin>>a[i][j];\n if(a[i][j]=='@'){\n st={i,j};\n }else if(a[i][j]=='$'){\n p.push_back({i,j});\n }else if(a[i][j]=='%'){\n out.push_back({i,j});\n }\n }\n }\n bfs1();\n bfs2();\n int ok=0;\n for(auto i:out){\n if(mark2[i]){\n// cout<<i.first<<' '<<i.second<<' '<<mark2[i]<<endl;\n ok=1;\n }\n }\n if(ok)cout<<\"Yes\"<<endl;\n else cout<<\"No\"<<endl;\n return 0;\n}\n/*\n2 3\n@#$\n.%.\n\nNo\n*/\n/*\n\n\n*/","accuracy":1,"time_ms":10,"memory_kb":6224,"score_of_the_acc":-0.0149,"final_rank":2},{"submission_id":"aoj_2781_3926439","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<int,P> T;\nint h,w;\nint dx[5]={1,0,-1,0,0};\nint dy[5]={0,-1,0,1,0};\nbool fail[5001][200][200]; //iターン目で兵士のいる可能性のある場所\nint mincost[200][200];\ndeque<T> q;\n\nint main()\n{\n\tvector<string> mp;\n\tcin>>h>>w;\n\tfor(int i=0;i<h;i++)\n\t{\n\t\tstring s;\n\t\tcin>>s;\n\t\tmp.push_back(s);\n\t}\n\tbool ans=false;\n\tfill(fail[0][0],fail[5001][0],false);\n\tfill(mincost[0],mincost[200],1e8-1);\n\t//初期配置を定める\n\tfor(int i=0;i<h;i++)\n\t{\n\t\tfor(int j=0;j<w;j++)\n\t\t{\n\t\t\tif(mp[i][j]=='$')\n\t\t\t\tfail[0][i][j]=true;\n\t\t\tif(mp[i][j]=='@')\n\t\t\t{\n\t\t\t\tq.push_back(T(0,P(i,j)));\n\t\t\t\tmincost[i][j]=0;\n\t\t\t}\n\t\t}\n\t}\n\t//兵士の移動パターンをすべて調べる\n\tfor(int k=1;k<1001;k++)\n\t{\n\t\tfor(int i=0;i<h;i++)\n\t\t{\n\t\t\tfor(int j=0;j<w;j++)\n\t\t\t{\n\t\t\t\tif(fail[k-1][i][j])\n\t\t\t\t{\n\t\t\t\t\tfor(int l=0;l<5;l++)\n\t\t\t\t\t{\n\t\t\t\t\t\tint nx=i+dx[l];\n\t\t\t\t\t\tint ny=j+dy[l];\n\t\t\t\t\t\tif(nx>=0 && nx<h && ny>=0 && ny<w && mp[nx][ny]!='#')\n\t\t\t\t\t\t\tfail[k][nx][ny]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t// for(int i=0;i<h;i++)\n\t// {\n\t// \tfor(int j=0;j<w;j++)\n\t// \t{\n\t// \t\tif(fail[1000][i][j])\n\t// \t\t\tcout<<'$';\n\t// \t\telse\n\t// \t\t\tcout<<mp[i][j];\n\t// \t}\n\t// \tcout<<endl;\n\t// }\n\t//BFS\n\twhile(!q.empty())\n\t{\n\t\tT t=q.front();q.pop_front();\n\t\tP p=t.second;\n\t\tif(t.first==1000)\n\t\t\tcontinue;\n\t\tif(mp[p.first][p.second]=='%')\n\t\t{\n\t\t\tans=true;\n\t\t\tbreak;\n\t\t}\n\t\tfor(int i=0;i<4;i++)\n\t\t{\n\t\t\tint nx=p.first+dx[i];\n\t\t\tint ny=p.second+dy[i];\n\t\t\tif(nx>=0 && nx<h && ny>=0 && ny<w && mp[nx][ny]!='#')\n\t\t\t{\n\t\t\t\tif(!fail[t.first+1][nx][ny] && mincost[nx][ny]==1e8-1)\n\t\t\t\t{\n\t\t\t\t\tq.push_back(T(t.first+1,P(nx,ny)));\n\t\t\t\t\tmincost[nx][ny]=t.first+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(ans)\n\t\tcout<<\"Yes\"<<endl;\n\telse\n\t\tcout<<\"No\"<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":580,"memory_kb":198716,"score_of_the_acc":-1.3065,"final_rank":13},{"submission_id":"aoj_2781_3467298","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nconst double eps = 1e-10;\nconst int MOD = 1000000007;\nconst int INF = 1000000000;\nconst ll LINF = 1ll<<50;\n\ntemplate<typename T>\nvoid printv(const vector<T>& s) {\n for(int i=0;i<(int)(s.size());++i) {\n cout << s[i];\n if(i == (int)(s.size())-1) cout << endl;\n else cout << \" \";\n }\n}\n\nint main () {\n cin.tie(0);\n cout << fixed << setprecision(10);\n\n int h, w; cin>>h>>w;\n vector<int> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};\n vector<vector<char>> a(h, vector<char>(w));\n pair<int, int> s, e;\n map<pair<int, int>, bool> enemy;\n map<pair<int, int>, bool> wall;\n for(int i=0;i<h;++i) {\n for(int j=0;j<w;++j) {\n cin >> a[i][j];\n pair<int, int> p = make_pair(i, j);\n if(a[i][j] == '@') s = p;\n else if(a[i][j] == '%') e = p;\n else if(a[i][j] == '$') enemy[p] = true;\n else if(a[i][j] == '#') wall[p] = true;\n }\n }\n\n vector<vector<int>> d(h, vector<int>(w, INF));\n queue<pair<int, int>> q;\n map<pair<int, int>, bool> sel;\n q.push(s);\n sel[s] = true;\n d[s.first][s.second] = 0;\n while(!q.empty()) {\n pair<int, int> now = q.front(); q.pop();\n // cout << now.first << \":\" << now.second << endl;\n for(int i=0;i<4;++i) {\n pair<int, int> next = make_pair(now.first + dy[i], now.second + dx[i]);\n if(0 <= next.first && next.first < h && 0 <= next.second && next.second < w && !wall[next] && !sel[next]) {\n q.push(next);\n sel[next] = true;\n d[next.first][next.second] = d[now.first][now.second] + 1;\n }\n }\n }\n\n int d_prin = d[e.first][e.second];\n int d_enemy = INF;\n\n vector<vector<int>> de(h, vector<int>(w, INF));\n map<pair<int, int>, bool> sele;\n q.push(e);\n sele[e] = true;\n de[e.first][e.second] = 0;\n while(!q.empty()) {\n pair<int, int> now = q.front(); q.pop();\n if(enemy[now]) {\n d_enemy = de[now.first][now.second];\n break;\n }\n for(int i=0;i<4;++i) {\n pair<int, int> next = make_pair(now.first + dy[i], now.second + dx[i]);\n if(0 <= next.first && next.first < h && 0 <= next.second && next.second < w && !wall[next] && !sele[next]) {\n q.push(next);\n sele[next] = true;\n de[next.first][next.second] = de[now.first][now.second] + 1;\n }\n }\n }\n\n // cout << d_prin << \":\" << d_enemy << endl;\n if(d_prin < d_enemy) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n \n}","accuracy":1,"time_ms":30,"memory_kb":10384,"score_of_the_acc":-0.0469,"final_rank":8},{"submission_id":"aoj_2781_2997656","code_snippet":"#include<iostream>\nusing namespace std;\nint h,w;\nstring s[200];\nbool used[200][200];\nbool nxt[200][200];\nbool ns[200][200];\nint d[]={0,1,0,-1,0};\nmain()\n{\n\tcin>>h>>w;\n\tfor(int i=0;i<h;i++)cin>>s[i];\n\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)used[i][j]=s[i][j]=='$';\n\twhile(1)\n\t{\n\t\tbool flag=false;\n\t\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)ns[i][j]=nxt[i][j]=0;\n\t\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)\n\t\t{\n\t\t\tif(!used[i][j])continue;\n\t\t\tnxt[i][j]=1;\n\t\t\tfor(int r=0;r<4;r++)\n\t\t\t{\n\t\t\t\tint x=i+d[r],y=j+d[r+1];\n\t\t\t\tif(x<0||x>=h||y<0||y>=w||s[x][y]=='#')continue;\n\t\t\t\tnxt[x][y]=1;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)used[i][j]=nxt[i][j];\n\t\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)\n\t\t{\n\t\t\tif(s[i][j]!='@')continue;\n\t\t\tfor(int r=0;r<4;r++)\n\t\t\t{\n\t\t\t\tint x=i+d[r],y=j+d[r+1];\n\t\t\t\tif(x<0||x>=h||y<0||y>=w||s[x][y]=='#'||used[x][y])continue;\n\t\t\t\tif(s[x][y]=='%')\n\t\t\t\t{\n\t\t\t\t\tcout<<\"Yes\"<<endl;\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t\tns[x][y]=1;\n\t\t\t\tflag=true;\n\t\t\t}\n\t\t\tif(!used[i][j])ns[i][j]=1,flag=true;\n\t\t\ts[i][j]='.';\n\t\t}\n\t\tif(!flag)\n\t\t{\n\t\t\tcout<<\"No\"<<endl;\n\t\t\treturn 0;\n\t\t}\n\t\tfor(int i=0;i<h;i++)\n\t\t{\n\t\t\tfor(int j=0;j<w;j++)if(ns[i][j])s[i][j]='@';\n\t\t}\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":3360,"score_of_the_acc":-0.0163,"final_rank":3},{"submission_id":"aoj_2781_2935537","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<string>\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<complex>\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\nconst double EPS = 1e-9;\ntypedef pair<int, int> P;\ntypedef unsigned int ui;\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++)\ntypedef long double ld;\nconst ld eps=1e-8;\nint d1[4] = { -1,0,1,0 };\nint d2[4] = { 0,1,0,-1 };\nint main() {\n\tint h, w; cin >> h >> w;\n\tchar pal[202][202];\n\trep(i, 202) {\n\t\trep(j, 202) {\n\t\t\tpal[i][j] = '#';\n\t\t}\n\t}\n\tstring s; P chk;\n\trep1(i, h) {\n\t\tcin >> s;\n\t\trep1(j, w) {\n\t\t\tpal[i][j] = s[j - 1];\n\t\t\tif (s[j - 1] == '%') {\n\t\t\t\tchk = { i,j };\n\t\t\t}\n\t\t}\n\t}\n\tint d[202][202];\n\trep(i, 202) {\n\t\trep(j, 202) {\n\t\t\td[i][j] = (int)MOD;\n\t\t}\n\t}\n\td[chk.first][chk.second] = 0;\n\tvector<P> v; int used[202][202] = {};\n\tv.push_back(chk);\n\twhile (!v.empty()) {\n\t\tint nx = v[0].first; int ny = v[0].second;\n\t\tv.erase(v.begin());\n\t\trep(i, 4) {\n\t\t\tif (used[nx + d1[i]][ny + d2[i]] == 0 && pal[nx + d1[i]][ny + d2[i]] != '#') {\n\t\t\t\tused[nx + d1[i]][ny + d2[i]] = 1;\n\t\t\t\tv.push_back({ nx + d1[i],ny + d2[i] });\n\t\t\t\td[nx + d1[i]][ny + d2[i]] = min(d[nx + d1[i]][ny + d2[i]], d[nx][ny] + 1);\n\t\t\t}\n\t\t}\n\t}\n\tint cnt1; int cnt2 = (int)MOD;\n\trep1(i, h) {\n\t\trep1(j, w) {\n\t\t\tif (pal[i][j] == '@') {\n\t\t\t\tcnt1 = d[i][j];\n\t\t\t}\n\t\t\telse if (pal[i][j] == '$') {\n\t\t\t\tcnt2 = min(cnt2, d[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\tif(cnt1>=cnt2){\n\t\tcout << \"No\" << endl;\n\t}\n\telse {\n\t\tcout << \"Yes\" << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3576,"score_of_the_acc":-0.0013,"final_rank":1},{"submission_id":"aoj_2781_2663281","code_snippet":"///\n// File: 2781.cpp\n// Author: ymiyamoto\n//\n// Created on Fri Dec 29 19:30:51 2017\n//\n\n#include <cstdint>\n#include <iostream>\n#include <queue>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nuint32_t wfs(vector<string> map, int32_t y, int32_t x)\n{\n vector<vector<int32_t>> visited(map.size(), vector<int32_t>(map[0].size(), -1));\n visited[y][x] = 0;\n queue<pair<int32_t, int32_t>> q;\n q.push({y, x});\n\n while (!q.empty()) {\n pair<int32_t, int32_t> p = q.front();\n q.pop();\n\n vector<pair<int32_t, int32_t>> ds = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n for (auto d : ds) {\n int32_t y2 = p.first + d.first;\n int32_t x2 = p.second + d.second;\n if (0 <= y2 && y2 < (int32_t)map.size() && 0 <= x2 && x2 < (int32_t)map[0].size() && (visited[y2][x2] == -1)) {\n if (map[y2][x2] == '#' || map[y2][x2] == '$') continue;\n visited[y2][x2] = visited[p.first][p.second] + 1;\n q.push({y2, x2});\n }\n }\n }\n\n for (uint32_t i = 0; i < map.size(); i++) {\n for (uint32_t j = 0; j < map[0].size(); j++) {\n if (map[i][j] == '%') {\n return visited[i][j];\n }\n }\n }\n}\n\nint32_t main()\n{\n uint32_t H, W;\n cin >> H >> W;\n vector<string> map;\n for (uint32_t i = 0; i < H; i++) {\n string line;\n cin >> line;\n map.push_back(line);\n }\n\n uint32_t princess;\n uint32_t soldier = UINT32_MAX;\n for (uint32_t y = 0; y < H; y++) {\n for (uint32_t x = 0; x < W; x++) {\n if (map[y][x] == '@') {\n princess = wfs(map, y, x);\n } else if (map[y][x] == '$') {\n soldier = min(soldier, wfs(map, y, x));\n }\n }\n }\n\n if (princess < soldier) {\n cout << \"Yes\" << endl;\n } else {\n cout << \"No\" << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":1870,"memory_kb":3332,"score_of_the_acc":-1.0001,"final_rank":12},{"submission_id":"aoj_2781_2523842","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n#include <queue>\n\nusing namespace std;\n\nqueue<pair<int,int> > q;\nint n,m;\nint w[205][205];\nint d[205][205];\nint f[205][205];\nchar op;\nconst int dx[4] = {0,0,1,-1};\nconst int dy[4] = {1,-1,0,0};\nint sx,sy;\n\nvoid bfs(int x,int y)\n{\n\tpair<int,int> now,temp;\n\tnow = make_pair(x,y);\n\td[x][y] = 0;\n\tq.push(now);\n\tint nx,ny;\n\twhile (!q.empty())\n\t{\n\t\tnow = q.front();\n\t\tq.pop();\n\t\tx = now.first;\n\t\ty = now.second;\n\t\tfor (int i=0;i<4;i++)\n\t\t{\n\t\t\tnx = x+dx[i];\n\t\t\tny = y+dy[i];\n\t\t\tif (d[nx][ny] > d[x][y]+1 && w[nx][ny])\n\t\t\t{\n\t\t\t\td[nx][ny] = d[x][y]+1;\n\t\t\t\ttemp = make_pair(nx,ny);\n\t\t\t\tq.push(temp);\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool solve(int x,int y)\n{\n\tpair<int,int> now,temp;\n\tf[x][y] = 0;\n\tnow = make_pair(x,y);\n\tq.push(now);\n\tint nx,ny;\n\twhile (!q.empty())\n\t{\n\t\tnow = q.front();\n\t\tq.pop();\n\t\tx = now.first;\n\t\ty = now.second;\n\t\tif (w[x][y] == 5) return 1;\n\t\tfor (int i=0;i<4;i++)\n\t\t{\n\t\t\tnx = x+dx[i];\n\t\t\tny = y+dy[i];\n\t\t\tif (w[nx][ny] == 0 || f[nx][ny] != f[0][0]) continue;\n\t\t\tf[nx][ny] = f[x][y]+1;\n\t\t\tif (f[nx][ny] < d[nx][ny])\n\t\t\t{\n\t\t\t\ttemp = make_pair(nx,ny);\n\t\t\t\tq.push(temp);\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nint main()\n{\n\tscanf(\"%d%d\",&n,&m);\n\tmemset(w,0,sizeof(w));\n\tmemset(d,0x3f,sizeof(d));\n\tmemset(f,0x3f,sizeof(f));\n\tfor (int i=1;i<=n;i++)\n\t{\n\t\tfor (int j=1;j<=m;j++)\n\t\t{\n\t\t\tscanf(\" %c\",&op);\n\t\t\tif (op == '@')\n\t\t\t{\n\t\t\t\tw[i][j] = 4;\n\t\t\t\tsx = i;\n\t\t\t\tsy = j;\n\t\t\t}\n\t\t\tif (op == '%')\n\t\t\t{\n\t\t\t\tw[i][j] = 5;\n\t\t\t}\n\t\t\tif (op == '$')\n\t\t\t{\n\t\t\t\tw[i][j] = 2;\n\t\t\t}\n\t\t\tif (op == '.')\n\t\t\t{\n\t\t\t\tw[i][j] = 1;\n\t\t\t}\n\t\t}\n\t}\n/*\tprintf(\"n=%d m=%d\\n\",n,m);\n\tfor (int i=0;i<=n+1;i++)\n\t{\n\t\tfor (int j=0;j<=m+1;j++)\n\t\t\tprintf(\"%d\",w[i][j]);\n\t\tprintf(\"\\n\");\n\t}*/\n\n\tfor (int i=1;i<=n;i++)\n\t{\n\t\tfor (int j=1;j<=m;j++)\n\t\t{\n\t\t\tif (w[i][j] == 2)\n\t\t\t{\n\t\t\t\tbfs(i,j);\n\t\t\t}\n\t\t}\n\t}\n\n\tif (solve(sx,sy))\n\t{\n\t\tprintf(\"Yes\\n\");\n\t}\n\telse\n\t{\n\t\tprintf(\"No\\n\");\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":1250,"memory_kb":3728,"score_of_the_acc":-0.6688,"final_rank":10},{"submission_id":"aoj_2781_2502069","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<bitset>\n#include<cstdlib>\n#include<cmath>\n#include<set>\n#include<list>\n#include<deque>\n#include<queue>\nusing namespace std;\nint n,H,W;\nconst int maxn = 1e3;\nconst int INF = 1e9;\nint labyrinth[maxn][maxn],scnt;\nint shortest;\nint pshort,sshort,eshort,goal;\nbool tf;\n\nstruct pt\n{\n\tint x,y;\n} soldier[100000],princess,escape;\nchar ch;\nbool vis[maxn][maxn];\n\nint dfs(int x,int y,int cur_length)\n{\n\tint temp;\n\t//printf(\"%d %d, H:%d W:%d\\n\",x,y,H,W);\n\t//labyrinth[y][x] = 3;\n\tvis[y][x] = true;\n\tif(x>0&&labyrinth[y][x-1]&&!vis[y][x-1])\n\t{\n\t\tif(labyrinth[y][x-1] == goal)\n\t\t{\n\t\t\treturn cur_length+1;\n\t\t}\n\t\tif((temp = dfs(x-1,y,cur_length+1))<shortest)\n\t\t{\n\t\t\tshortest = temp;\n\t\t}\n\t}\n\tif(x<W-1&&labyrinth[y][x+1]&&!vis[y][x+1])\n\t{\n\t\tif(labyrinth[y][x+1] == 2)\n\t\t{\n\t\t\treturn cur_length+1;\n\t\t}\n\t\tif((temp = dfs(x+1,y,cur_length+1))<shortest)\n\t\t{\n\t\t\tshortest = temp;\n\t\t}\n\t}\n\tif(y>0&&labyrinth[y-1][x]&&!vis[y-1][x])\n\t{\n\t\tif(labyrinth[y-1][x] == 2)\n\t\t{\n\t\t\treturn cur_length+1;\n\t\t}\n\t\tif((temp = dfs(x,y-1,cur_length+1))<shortest)\n\t\t{\n\t\t\tshortest = temp;\n\t\t}\n\t}\n\tif(y<H-1&&labyrinth[y+1][x]&&!vis[y+1][x])\n\t{\n\t\tif(labyrinth[y+1][x] == 2)\n\t\t{\n\t\t\treturn cur_length+1;\n\t\t}\n\t\tif((temp = dfs(x,y+1,cur_length+1))<shortest)\n\t\t{\n\t\t\tshortest = temp;\n\t\t}\n\t}\n\treturn shortest;\n}\n\nint main()\n{\n\tios::sync_with_stdio(false);\n\t//freopen(\"1002.txt\",\"r\",stdin);\n\t//freopen(\"ans.txt\",\"w+\",stdout);\n\twhile(~scanf(\"%d%d\",&H,&W))\n\t{\n\t\ttf = true;\n\t\tscnt = 0;\n\t\tshortest = INF;\n\t\tmemset(labyrinth,-1,sizeof(labyrinth));\n\t\tgetchar();\n\t\tfor(int i = 0; i<H; ++i)\n\t\t{\n\t\t\tfor(int j = 0; j < W; ++ j)\n\t\t\t{\n\t\t\t\twhile((ch = getchar())=='\\n');\n\t\t\t\tswitch(ch)\n\t\t\t\t{\n\t\t\t\tcase '@':\n\t\t\t\t\tprincess.x = j;\n\t\t\t\t\tprincess.y = i,labyrinth[i][j] = 5;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '.':\n\t\t\t\t\tlabyrinth[i][j] = 1;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '$':\n\t\t\t\t\tsoldier[scnt].x = j;\n\t\t\t\t\tsoldier[scnt++].y = i;\n\t\t\t\t\tlabyrinth[i][j] = 0;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '%':\n\t\t\t\t\tlabyrinth[i][j] = 2;\n\t\t\t\t\tescape.x = j;\n\t\t\t\t\tescape.y = i;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '#':\n\t\t\t\t\tlabyrinth[i][j] = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmemset(vis,false,sizeof(vis));\n\t\tgoal = 2;\n\t\tpshort = dfs(princess.x,princess.y,0);\n\t\t//printf(\"pshort:%d\\n\",pshort);\n\n\t\tgoal = 5;\n\t\tshortest = INF;\n\t\tmemset(vis,false,sizeof(vis));\n\t\teshort = dfs(escape.x,escape.y,0);\n\t\t//printf(\"eshort:%d\\n\",eshort);\n\t\tif(eshort<pshort)\n\t\t\tpshort = eshort;\n\t\t/*for(int i = 0; i<H; ++i)\n\t\t{\n\t\t\tfor(int j = 0; j < W; ++ j)\n\t\t\t{\n\t\t\t\tif(i == princess.y&&j == princess.x)\n\t\t\t\t\tprintf(\"X\");\n\t\t\t\telse\n\t\t\t\tprintf(\"%d\",labyrinth[i][j]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}*/\n\t\tif(!scnt&&pshort!=INF)\n\t\t{\n\t\t\ttf = true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(pshort != INF)\n\t\t\t{\n\t\t\t\tgoal = 2;\n\t\t\t\tfor(int i = 0; i < scnt; ++i)\n\t\t\t\t{\n\t\t\t\t\tmemset(vis,false,sizeof(vis));\n\t\t\t\t\tshortest = INF;\n\t\t\t\t\tsshort = dfs(soldier[i].x,soldier[i].y,0);\n\t\t\t\t\t//printf(\"sshort:%d\\n\",sshort);\n\t\t\t\t\tif(sshort <= pshort)\n\t\t\t\t\t{\n\t\t\t\t\t\ttf = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t\telse\n\t\t\t\ttf = false;\n\n\t\t}\n\t\tif(tf)\n\t\t{\n\t\t\tprintf(\"Yes\\n\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"No\\n\");\n\t\t}\n\n\n\t}\n}","accuracy":0.3076923076923077,"time_ms":120,"memory_kb":8516,"score_of_the_acc":-0.0857,"final_rank":16},{"submission_id":"aoj_2781_2502024","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<bitset>\n#include<cstdlib>\n#include<cmath>\n#include<set>\n#include<list>\n#include<deque>\n#include<queue>\nusing namespace std;\nint n,H,W;\nconst int maxn = 2e2+2;\nconst int INF = 1e9;\nint labyrinth[maxn][maxn],scnt;\nint shortest;\nint pshort,sshort,eshort,goal;\nbool tf;\n\nstruct pt\n{\n int x,y;\n} soldier[maxn],princess,escape;\nchar ch;\nbool vis[maxn][maxn];\n\nint dfs(int x,int y,int cur_length)\n{\n int temp;\n //printf(\"%d %d, H:%d W:%d\\n\",x,y,H,W);\n //labyrinth[y][x] = 3;\n vis[y][x] = true;\n if(x>0&&labyrinth[y][x-1]&&!vis[y][x-1])\n {\n if(labyrinth[y][x-1] == goal)\n {\n return cur_length+1;\n }\n if((temp = dfs(x-1,y,cur_length+1))<shortest)\n {\n shortest = temp;\n }\n }\n if(x<W-1&&labyrinth[y][x+1]&&!vis[y][x+1])\n {\n if(labyrinth[y][x+1] == 2)\n {\n return cur_length+1;\n }\n if((temp = dfs(x+1,y,cur_length+1))<shortest)\n {\n shortest = temp;\n }\n }\n if(y>0&&labyrinth[y-1][x]&&!vis[y-1][x])\n {\n if(labyrinth[y-1][x] == 2)\n {\n return cur_length+1;\n }\n if((temp = dfs(x,y-1,cur_length+1))<shortest)\n {\n shortest = temp;\n }\n }\n if(y<H-1&&labyrinth[y+1][x]&&!vis[y+1][x])\n {\n if(labyrinth[y+1][x] == 2)\n {\n return cur_length+1;\n }\n if((temp = dfs(x,y+1,cur_length+1))<shortest)\n {\n shortest = temp;\n }\n }\n return shortest;\n}\n\nint main()\n{\n //freopen(\"1002.txt\",\"r\",stdin);\n //freopen(\"ans.txt\",\"w+\",stdout);\n while(~scanf(\"%d%d\",&H,&W))\n {\n tf = true;\n scnt = 0;\n shortest = INF;\n memset(labyrinth,-1,sizeof(labyrinth));\n getchar();\n for(int i = 0; i<H; ++i)\n {\n for(int j = 0; j < W; ++ j)\n {\n while((ch = getchar())=='\\n');\n switch(ch)\n {\n case '@':\n princess.x = j;\n princess.y = i,labyrinth[i][j] = 5;\n break;\n case '.':\n labyrinth[i][j] = 1;\n break;\n case '$':\n soldier[scnt].x = j;\n soldier[scnt++].y = i;\n labyrinth[i][j] = 1;\n break;\n case '%':\n labyrinth[i][j] = 2;\n escape.x = j;\n escape.y = i;\n break;\n case '#':\n labyrinth[i][j] = 0;\n break;\n }\n }\n }\n memset(vis,false,sizeof(vis));\n goal = 2;\n pshort = dfs(princess.x,princess.y,0);\n //printf(\"pshort:%d\\n\",pshort);\n\n goal = 5;\n shortest = INF;\n memset(vis,false,sizeof(vis));\n eshort = dfs(escape.x,escape.y,0);\n //printf(\"eshort:%d\\n\",eshort);\n if(eshort<pshort)\n pshort = eshort;\n /*for(int i = 0; i<H; ++i)\n {\n for(int j = 0; j < W; ++ j)\n {\n if(i == princess.y&&j == princess.x)\n printf(\"X\");\n else\n printf(\"%d\",labyrinth[i][j]);\n }\n printf(\"\\n\");\n }*/\n if(!scnt&&pshort!=INF)\n {\n tf = true;\n }\n else\n {\n if(pshort != INF)\n {\n goal = 2;\n for(int i = 0; i < scnt; ++i)\n {\n memset(vis,false,sizeof(vis));\n shortest = INF;\n sshort = dfs(soldier[i].x,soldier[i].y,0);\n //printf(\"sshort:%d\\n\",sshort);\n if(sshort <= pshort)\n {\n tf = false;\n break;\n }\n }\n\n }\n else\n tf = false;\n\n }\n if(tf)\n {\n printf(\"Yes\\n\");\n }\n else\n {\n printf(\"No\\n\");\n }\n\n\n }\n}","accuracy":0.11538461538461539,"time_ms":10,"memory_kb":3448,"score_of_the_acc":-0.0007,"final_rank":19},{"submission_id":"aoj_2781_2501708","code_snippet":"// @Team : nupt2017team12\n// @Author : Zst\n#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <algorithm>\n#include <map>\nusing namespace std;\n#define LL long long\n#define MOD 1000000007\n#define CLR(a,x) memset(a,x,sizeof(a))\n#define INF 0x3f3f3f3f\n#define pb push_back\n#define FOR(i,a,b) for( int i = ( a ); i <= ( b ); ++i )\n\nconst int N = 200+7;\nchar maps[N][N];\nint vis[N][N];\n\nint r, c;\nint posX, posY;\n\nint princess;\nint soldier;\n\nvoid solve( int x, int y, int times )\n{\n\tvis[x][y] = times;\n\tif( maps[x][y] == '@' ) {\n\t\tprincess = min( princess, times );\n\t} else if( maps[x][y] == '$' ) {\n\t\tsoldier = min( soldier, times );\n\t}\n\tif( x-1 >= 0 ) {\n\t\tif( vis[x-1][y] == -1 ) {\n\t\t\tsolve( x-1, y, times+1 );\n\t\t} else if( times+1 < vis[x-1][y] ) {\n\t\t\tsolve( x-1, y, times+1 );\n\t\t}\n\t}\n\tif( y-1 >= 0 ) {\n\t\tif( vis[x][y-1] == -1 ) {\n\t\t\tsolve( x, y-1, times+1 );\n\t\t} else if( times+1 < vis[x][y-1] ) {\n\t\t\tsolve( x, y-1, times+1 );\n\t\t}\n\t}\n\tif( x+1 < r ) {\n\t\tif( vis[x+1][y] == -1 ) {\n\t\t\tsolve( x+1, y, times+1 );\n\t\t} else if( times+1 < vis[x+1][y] ) {\n\t\t\tsolve( x+1, y, times+1 );\n\t\t}\n\t}\n\tif( y+1 < c ) {\n\t\tif( vis[x][y+1] == -1 ) {\n\t\t\tsolve( x, y+1, times+1 );\n\t\t} else if( times+1 < vis[x][y+1] ) {\n\t\t\tsolve( x, y+1, times+1 );\n\t\t}\n\t}\n\treturn;\n\n}\n\n\nint main()\n{\n // freopen( \"B.txt\", \"r\", stdin );\n while( scanf( \"%d%d\", &r, &c ) != EOF ) {\n \tprincess = soldier = INF;\n\t\tCLR( vis, -1 );\n\t FOR( i, 0, r-1 ) {\n\t \tscanf( \"%s\", maps[i] );\n\t\t\tFOR( j, 0, c-1 ) {\n\t\t\t\tif( maps[i][j] == '%' ) {\n\t\t\t\t\tposX = i;\n\t\t\t\t\tposY = j;\n\t\t\t\t} else if( maps[i][j] == '#' ) {\n\t\t\t\t\tvis[i][j] = true;\n\t\t\t\t}\n\t\t\t}\n\t }\n\t solve( posX, posY, 0 );\n\t if( princess < soldier ) {\n\t \tprintf( \"Yes\\n\");\n\t } else {\n\t \tprintf( \"No\\n\");\n\t }\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1430,"memory_kb":5324,"score_of_the_acc":-0.7737,"final_rank":11},{"submission_id":"aoj_2781_2501704","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include <queue>\n\nusing namespace std;\n\nconst int maxx=205;\nint n,m,k;\nchar a[maxx][maxx];\nint ans = 0,cnt = 0,pos = 0;\nint l = 0,r = 0;\n\n\nconst int INF = 100000000;\nint dx[4] = {0,0,1,-1};\nint dy[4] = {1,-1,0,0};\ntypedef pair <int,int> P;\nqueue<P> que;\nint d[maxx][maxx];\nint sx,sy;\nint ex,ey;\n\nbool judge(int x,int y){\n if(a[x][y] == '.' || a[x][y] == '%'){\n if(x >= 0 && x < n)\n {\n if(y >= 0 && y < m)\n {\n if(d[x][y] == INF){\n return true;\n }\n }\n }\n }\n return false;\n}\n\nint bfs()\n{\n for(int i = 0; i < n; i++){\n for(int j = 0; j < m; j++){\n d[i][j] = INF;//初始化\n }\n }\n que.push(P(sx,sy));\n d[sx][sy] = 0;//并把距???0；\n while(que.size()){//直到?列?空\n P p = que.front();que.pop();\n if(p.first == ex && p.second == ey){\n break;//如果已?是?点，??束搜索。\n }\n for(int i = 0; i < 4; i++)\n {\n int nx = p.first + dx[i],ny = p.second + dy[i];\n if(judge(nx,ny))\n {\n que.push(P(nx,ny));\n d[nx][ny] = d[p.first][p.second] + 1;\n }\n }\n }\n return d[ex][ey];\n}\n\n\nint main()\n{\n#ifdef LOCAL\n// freopen(\"/Users/ecooodt/Desktop/c++ and acm/_集?/tp1/2.txt\",\"r\",stdin);\n#endif\n scanf(\"%d%d\",&n,&m);\n for(int i = 0; i < n; i++)\n {\n getchar();\n for(int j = 0; j < m; j++)\n {\n scanf(\"%c\",&a[i][j]);\n if(a[i][j] == '%')\n {\n ex = i,ey = j;\n }\n if(a[i][j] == '@') sx = i,sy = j;\n }\n }\n pos = bfs();\n// printf(\"%d \",pos);\n for(int i = 0; i < n; i ++)\n {\n for(int j = 0; j < m; j++)\n {\n if(a[i][j] == '$')\n {\n sx = i,sy = j;\n int t = bfs();\n if(t <= pos) {\n// printf(\"%d\\n\",t);\n printf(\"No\\n\");\n return 0;\n }\n }\n }\n }\n printf(\"Yes\\n\");\n return 0;\n}","accuracy":0.15384615384615385,"time_ms":10,"memory_kb":3320,"score_of_the_acc":0,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_2781_10730387\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint n, m;\\nint x, y;\\nchar str[210][210];\\nchar tmp[210][210];\\nint dirx[] = {1, -1, 0, 0};\\nint diry[] = {0, 0, 1, -1};\\nint val (int a, int b) {\\n if (a<0 || b<0 || a>=n || b>=m) return 0;\\n return 1;\\n}\\nint bfs () {\\n //printf(\\\"%d %d\\\\n\\\", x, y);\\n int flag = 0;\\n for (int i=0; i<n; i++) {\\n for (int j=0; j<m; j++) {\\n tmp[i][j] = str[i][j];\\n }\\n }\\n for (int i=0; i<n; i++) {\\n for (int j=0; j<m; j++) {\\n if (str[i][j] == '@') {\\n // printf(\\\"%d %d\\\\n\\\",i , j);\\n flag = 1;\\n if (i==x && j==y) {\\n // printf(\\\"%d %d\\\\n\\\", i, j);\\n return 1;\\n }\\n else {\\n for (int k=0; k<4; k++) {\\n if (val(i+dirx[k], j+diry[k]) && (str[i+dirx[k]][j+diry[k]] == '.' || str[i+dirx[k]][j+diry[k]] == '%')) {\\n tmp[i+dirx[k]][j+diry[k]] = '@';\\n }\\n }\\n }\\n }\\n else if (str[i][j] == '$') {\\n for (int k=0; k<4; k++) {\\n if (val(i+dirx[k], j+diry[k]) && str[i+dirx[k]][j+diry[k]] != '#') {\\n tmp[i+dirx[k]][j+diry[k]] = '$';\\n }\\n }\\n }\\n }\\n }\\n for (int i=0; i<n; i++) {\\n for (int j=0; j<m; j++) {\\n str[i][j] = tmp[i][j];\\n }\\n }\\n if (!flag) return 0;\\n else return bfs();\\n}\\nint main () {\\n //freopen(\\\"in.txt\\\", \\\"r\\\", stdin);\\n scanf(\\\"%d %d\\\", &n, &m);\\n for (int i=0; i<n; i++)\\n scanf(\\\"%s\\\", str[i]);\\n for (int i=0; i<n; i++) {\\n for (int j=0; j<n; j++) {\\n if (str[i][j] == '%') {\\n x = i;\\n y = j;\\n break;\\n }\\n }\\n }\\n if (bfs()) printf(\\\"Yes\\\\n\\\");\\n else printf(\\\"No\\\\n\\\");\\n return 0;\\n}\",\n \"accuracy\": 0.34615384615384615,\n \"time_ms\": 10,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.0012,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2781_10730386\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//file stream\\n#define output freopen(\\\"output.txt\\\",\\\"w\\\",stdout)\\n#define input freopen(\\\"input.txt\\\",\\\"r\\\",stdin)\\n//functions\\n#define pb(x) push_back(x)\\n// if needed pair\\n#define f first\\n#define s second\\n#define mp(x,y) make_pair(x,y)\\n\\n\\n//inputs 1 var\\n#define s1i(n) scanf(\\\"%d\\\",&n)\\n#define s1u(n) scanf(\\\"%u\\\",&n)\\n#define s1l(n) scanf(\\\"%lld\\\",&n)\\n#define s1lu(n) scanf(\\\"%llu\\\",&n)\\n#define s1d(n) scanf(\\\"%lf\\\",&n)\\n#define s1s(n) scanf(\\\"%s\\\",n)\\n//inputs 2 var\\n#define s2i(n,m) scanf(\\\"%d %d\\\",&n,&m)\\n#define s2u(n,m) scanf(\\\"%u %u\\\",&n,&m)\\n#define s2l(n,m) scanf(\\\"%lld %lld\\\",&n,&m)\\n#define s2lu(n,m) scanf(\\\"%llu %llu\\\",&n,&m)\\n#define s2d(n,m) scanf(\\\"%lf %lf\\\",&n,&m)\\n//inputs 3 var\\n#define s3i(n,m,l) scanf(\\\"%d %d %d\\\",&n,&m,&l)\\n#define s3u(n,m,l) scanf(\\\"%u %u %u\\\",&n,&m,&l)\\n#define s3l(n,m,l) scanf(\\\"%lld %lld %lld\\\",&n,&m,&l)\\n#define s3lu(n,m,l) scanf(\\\"%llu %llu %llu\\\",&n,&m,&l)\\n#define s3d(n,m,l) scanf(\\\"%lf %lf %lf\\\",&n,&m,&l)\\n\\n//output 1 var\\n#define p1i(n) printf(\\\"%d\\\",n)\\n#define p1u(n) printf(\\\"%u\\\",n)\\n#define p1l(n) printf(\\\"%lld\\\",n)\\n#define p1lu(n) printf(\\\"%llu\\\",n)\\n#define p1d(n,pre) printf(\\\"%.*f\\\",pre,n)\\n#define p1s(n) printf(\\\"%s\\\",n)\\n//output 2 var\\n#define p2i(n,m) printf(\\\"%d %d\\\",n,m)\\n#define p2u(n,m) printf(\\\"%u %u\\\",n,m)\\n#define p2l(n,m) printf(\\\"%lld %lld\\\",n,m)\\n#define p2lu(n,m) printf(\\\"%llu %llu\\\",n,m)\\n#define p2d(n,m,pre) printf(\\\"%.*f %.*f\\\",pre,n,pre,m)\\n//inputs 3 var less important\\n#define p3i(n,m,l) printf(\\\"%d %d %d\\\",n,m,l)\\n#define p3u(n,m,l) printf(\\\"%u %u %u\\\",n,m,l)\\n#define p3l(n,m,l) printf(\\\"%lld %lld %lld\\\",n,m,l)\\n#define p3lu(n,m,l) printf(\\\"%llu %llu %llu\\\",n,m,l)\\n//output misc\\n#define nline() putchar(10)\\n#define space() putchar(' ')\\n#define pch(c) putchar(c)\\n#define tcase(i) printf(\\\"Case %d:\\\",i)\\n//loop\\n#define fr0(i,n) for(i=0;i<n;i++)\\n#define fr1(i,n) for(i=1;i<=n;i++)\\n//memory reset\\n#define set0(x) memset(x,0,sizeof x)\\n#define setn1(x) memset(x,-1,sizeof x)\\n#define setinf(x) memset(x,125,sizeof x)\\n//bit operation single variable\\n#define On(x,i) (x|=(1<<(i)))\\n#define Off(x,i) (x&= ~(1<<(i)))\\n#define isOn(x,i) (x&(1<<(i)))\\n#define Toggle(x,i) (x^=(1<<(i)))\\n#define tmod(x,i) (x&(~(-1<<i)))\\n\\n//data type\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\n//bit operation array\\n//constant\\nconst double EPS = 1e-9;\\nusing namespace std;\\nint tc,o,prc,sld,i,j,r,c,x,y;\\n\\nchar B[250][250];\\nqueue<pair<int,int> > q;\\nmap<pair<int,int> ,int> level,visited;\\npair<int,int>u;\\nmain()\\n{\\n {\\n s2i(r,c);\\n fr0(i,r)\\n {\\n scanf(\\\"%s\\\",B[i]);\\n fr0(j,c)\\n {\\n if(B[i][j]=='%')\\n {\\n x=i,y=j;continue;\\n }\\n }\\n }\\n q.push(mp(x,y));\\n level[mp(x,y)]=0;\\n visited[mp(x,y)]=1;\\n sld=5000;prc=50000;\\n while(!q.empty())\\n {\\n u=q.front();q.pop();\\n if(B[u.f][u.s]=='@')prc=level[u];\\n if(B[u.f][u.s]=='$')sld=min(sld,level[u]);\\n\\n if(u.f+1<r && B[u.f+1][u.s]!='#' && !visited[mp(u.f+1,u.s)])\\n {\\n level[mp(u.f+1,u.s)]=level[u]+1;\\n visited[mp(u.f+1,u.s)]=1;\\n q.push(mp(u.f+1,u.s));\\n }\\n\\n if(u.s+1<c && B[u.f][u.s+1]!='#' && !visited[mp(u.f,u.s+1)])\\n {\\n level[mp(u.f,u.s+1)]=level[u]+1;\\n visited[mp(u.f,u.s+1)]=1;\\n q.push(mp(u.f,u.s+1));\\n }\\n\\n\\n if(u.f-1>=0 && B[u.f-1][u.s]!='#' && !visited[mp(u.f-1,u.s)])\\n {\\n level[mp(u.f-1,u.s)]=level[u]+1;\\n visited[mp(u.f-1,u.s)]=1;\\n q.push(mp(u.f-1,u.s));\\n }\\n\\n if(u.s+1>=0 && B[u.f][u.s-1]!='#' && !visited[mp(u.f,u.s-1)])\\n {\\n level[mp(u.f,u.s-1)]=level[u]+1;\\n visited[mp(u.f,u.s-1)]=1;\\n q.push(mp(u.f,u.s-1));\\n }\\n }\\n if(prc<sld)printf(\\\"Yes\\\\n\\\");\\n else printf(\\\"No\\\\n\\\");\\n\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 8104,\n \"score_of_the_acc\": -0.0299,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2781_10730381\",\n \"code_snippet\": \"/*\\n * Biborno\\n * fb.com/mfmejbah\\n * fmejbah@gmail.com\\n *\\n * B\\n * Date: 15 Nov 2016\\n */\\n\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint dx[] = {-1, 0, 0, 1};\\nint dy[] = {0, -1, 1, 0};\\nint h, w, d;\\nchar g[201][201];\\n\\nbool bfs( int px, int py, int ex, int ey ) {\\n bool vis[h][w];\\n int dis[h][w];\\n memset(vis, 0, sizeof(vis));\\n queue<pair<int, int> > Q;\\n vis[px][py] = 1;\\n dis[px][py] = 0;\\n Q.push(make_pair(px, py));\\n while(!Q.empty()) {\\n pair<int, int> p = Q.front();\\n Q.pop();\\n for( int i = 0; i < 4; i++ ) {\\n int x = p.first + dx[i];\\n int y = p.second + dy[i];\\n if( x >= 0 && x < h && y >= 0 && y < w && !vis[x][y] && (g[x][y] == '.' || g[x][y] == '%') ) {\\n vis[x][y] = 1;\\n dis[x][y] = dis[p.first][p.second] + 1;\\n Q.push(make_pair(x, y));\\n }\\n if( x == ex && y == ey ) {\\n d = dis[x][y];\\n return true;\\n }\\n }\\n }\\n return false;\\n}\\n\\nint bfss( int px, int py, int ex, int ey ) {\\n bool vis[h][w];\\n int dis[h][w];\\n memset(vis, 0, sizeof(vis));\\n memset(dis, 0, sizeof(dis));\\n queue<pair<int, int> > Q;\\n vis[px][py] = 1;\\n Q.push(make_pair(px, py));\\n while(!Q.empty()) {\\n pair<int, int> p = Q.front();\\n Q.pop();\\n for( int i = 0; i < 4; i++ ) {\\n int x = p.first + dx[i];\\n int y = p.second + dy[i];\\n if( x >= 0 && x < h && y >= 0 && y < w && !vis[x][y] && (g[x][y] == '.' || g[x][y] == '%') ) {\\n vis[x][y] = 1;\\n dis[x][y] = dis[p.first][p.second] + 1;\\n Q.push(make_pair(x, y));\\n }\\n if( x == ex && y == ey ) {\\n return dis[x][y];\\n }\\n }\\n }\\n return 0;\\n}\\nint main()\\n{\\n //freopen(\\\"B.in\\\", \\\"r\\\", stdin);\\n //freopen(\\\"B.out\\\", \\\"w\\\", stdout);\\n cin >> h >> w;\\n int px, py, ex, ey;\\n for( int i = 0; i < h; i++ )\\n for( int j = 0; j < w; j++ ) {\\n cin >> g[i][j];\\n if( g[i][j] == '@' ) px = i, py = j;\\n if( g[i][j] == '%' ) ex = i, ey = j;\\n }\\n if(bfs(px, py, ex, ey)) {\\n bool f = 1;\\n for( int i = 0; i < h; i++ )\\n for( int j = 0; j < w; j++ )\\n if( g[i][j] == '$' )\\n if( bfss(i, j, ex, ey) == d ) {\\n f = 0;\\n break;\\n }\\n if(f)puts(\\\"Yes\\\");\\n else puts(\\\"No\\\");\\n } else puts(\\\"No\\\");\\n}\",\n \"accuracy\": 0.17307692307692307,\n \"time_ms\": 20,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.006,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2781_10691088\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<algorithm>\\n#include<queue>\\n\\nusing namespace std;\\n\\nconst int f[4][2]={{1,0},{-1,0},{0,1},{0,-1}};\\nstruct Q{\\n int x;\\n int y;\\n int num;\\n bool cmp(Q a){\\n return a.x==x&&a.y==y;\\n }\\n Q(int _x=0,int _y=0,int _num=0):x(_x),y(_y),num(_num){}\\n};\\nint n,m;\\nchar map[210][210];\\nQ shi[400000];\\nint sl;\\nQ z;\\nQ g;\\nint ansG;\\nint ansS=0x7fffffff;\\nbool h[210][210];\\n\\nint BFS(Q b){\\n memset(h,0,sizeof(h));\\n queue<Q> q;\\n h[b.x][b.y]=1;\\n q.push(b);\\n while(!q.empty()){\\n Q a=q.front();\\n q.pop();\\n if(a.cmp(z)){\\n return a.num;\\n }\\n for(int i=0;i<4;i++){\\n int xx=a.x+f[i][0];\\n int yy=a.y+f[i][1];\\n int num=a.num+1;\\n if(xx>=0&&yy>=0&&xx<n&&yy<m&&!h[xx][yy]&&(map[xx][yy]=='.'||map[xx][yy]=='%')){\\n\\t\\t\\t\\th[xx][yy]=1;\\n q.push(Q(xx,yy,num));\\n }\\n }\\n }\\n return -1;\\n}\\n\\nint main()\\n{\\n cin>>n>>m;\\n for(int i=0;i<n;i++){\\n for(int j=0;j<m;j++){\\n cin>>map[i][j];\\n if(map[i][j]=='%'){\\n z=Q(i,j);\\n }else if(map[i][j]=='@'){\\n g=Q(i,j);\\n }else if(map[i][j]=='$'){\\n shi[sl++]=Q(i,j);\\n }\\n }\\n }\\n ansG=BFS(g);\\n if(ansG<0){\\n\\t\\tcout<<\\\"No\\\"<<endl;\\n\\t\\treturn 0;\\n\\t}\\n for(int i=0;i<sl;i++){\\n int w=BFS(shi[i]);\\n if(w>0){\\n\\t\\t\\tansS=min(ansS,w);\\n\\t\\t}\\n }\\n if(ansG<ansS){\\n cout<<\\\"Yes\\\"<<endl;\\n }else{\\n cout<<\\\"No\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 8220,\n \"score_of_the_acc\": -0.0788,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2781_6030555\",\n \"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;\\n\\n// g <- pair < v , cost > \\ntemplate < class T >\\nvector<T> Dijkstra(vector<vector<pair<int,T>>> &g, vector<int> starts) {\\n const auto INF = numeric_limits<T>::max();\\n vector<T> dist(g.size(), INF);\\n priority_queue<pair<T,int>> Q;\\n for(int s : starts) Q.emplace(0, s);\\n while(!Q.empty()){\\n T cost = Q.top().first;\\n int v = Q.top().second;\\n Q.pop();\\n cost = - cost;\\n if(dist[v] == INF){\\n dist[v] = cost;\\n for(auto e : g[v]){\\n if(dist[e.first] == INF){\\n Q.emplace(-(cost + e.second), e.first);\\n }\\n }\\n }\\n }\\n return dist;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n \\n int H,W; cin >> H >> W;\\n vector<string> grid(H);\\n rep(i,H) cin >> grid[i];\\n auto f = [&](int i, int j){ return i * W + j; };\\n\\n vector<vector<pair<int,int>>> G(H * W);\\n int di[] = {0, 1};\\n int dj[] = {1, 0};\\n rep(i,H)rep(j,W)rep(d,2) {\\n int ni = i + di[d], nj = j + dj[d];\\n if(0 <= ni && ni < H && 0 <= nj && nj < W) {\\n if(grid[i][j] != '#' && grid[ni][nj] != '#') {\\n G[f(i, j)].push_back({f(ni, nj), 1});\\n G[f(ni, nj)].push_back({f(i, j), 1});\\n }\\n }\\n }\\n\\n int GOAL;\\n rep(i,H)rep(j,W)if(grid[i][j] == '%') GOAL = f(i, j);\\n int PRINCESS;\\n vector<int> SOLDIERS;\\n rep(i,H)rep(j,W){\\n if(grid[i][j] == '@') PRINCESS = Dijkstra(G, vector<int>{f(i, j)})[GOAL];\\n if(grid[i][j] == '$') SOLDIERS.push_back(f(i, j));\\n }\\n cout << (PRINCESS < Dijkstra(G, SOLDIERS)[GOAL] ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6672,\n \"score_of_the_acc\": -0.0172,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2781_6030554\",\n \"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;\\n\\n// g <- pair < v , cost > \\ntemplate < class T >\\nvector<T> Dijkstra(vector<vector<pair<int,T>>> &g, vector<int> starts) {\\n vector<T> dist(g.size(), -1);\\n priority_queue<pair<T,int>> Q;\\n for(int s : starts) Q.emplace(0, s);\\n while(!Q.empty()){\\n T cost = Q.top().first;\\n int v = Q.top().second;\\n Q.pop();\\n cost = - cost;\\n if(dist[v] == -1){\\n dist[v] = cost;\\n for(auto e : g[v]){\\n if(dist[e.first] == -1){\\n Q.emplace(-(cost + e.second), e.first);\\n }\\n }\\n }\\n }\\n for(auto &d : dist) if(d == -1) d = numeric_limits<T>::max();\\n return dist;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n \\n int H,W; cin >> H >> W;\\n vector<string> grid(H);\\n rep(i,H) cin >> grid[i];\\n auto f = [&](int i, int j){ return i * W + j; };\\n\\n vector<vector<pair<int,int>>> G(H * W);\\n int di[] = {0, 1};\\n int dj[] = {1, 0};\\n rep(i,H)rep(j,W)rep(d,2) {\\n int ni = i + di[d], nj = j + dj[d];\\n if(0 <= ni && ni < H && 0 <= nj && nj < W) {\\n if(grid[i][j] != '#' && grid[ni][nj] != '#') {\\n G[f(i, j)].push_back({f(ni, nj), 1});\\n G[f(ni, nj)].push_back({f(i, j), 1});\\n }\\n }\\n }\\n\\n int GOAL;\\n rep(i,H)rep(j,W)if(grid[i][j] == '%') GOAL = f(i, j);\\n int PRINCESS;\\n vector<int> SOLDIERS;\\n rep(i,H)rep(j,W){\\n if(grid[i][j] == '@') PRINCESS = Dijkstra(G, vector<int>{f(i, j)})[GOAL];\\n if(grid[i][j] == '$') SOLDIERS.push_back(f(i, j));\\n }\\n cout << (PRINCESS < Dijkstra(G, SOLDIERS)[GOAL] ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6748,\n \"score_of_the_acc\": -0.0175,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2781_5176848\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\ntypedef pair<int, int>PII;\\nconst int N = 220;\\nint n, m;\\n\\nchar s[N][N];\\nint bx, by;\\nint ax, ay;\\n\\nset<PII>q1, q2;\\n\\nint st[N][N];\\n\\nint dx[4] = {1, -1, 0, 0};\\nint dy[4] = {0, 0, 1, -1};\\n\\nint main()\\n{\\n for (int i = 1; i <= 1e8; i ++);\\n scanf(\\\"%d%d\\\", &n, &m);\\n vector<vector<char> >a(n);\\n for (int i = 1; i <= n; i++)\\n {\\n scanf(\\\"%s\\\", s[i] + 1);\\n int len = strlen(s[i] + 1);\\n for (int j = 1; j <= len; j ++)\\n {\\n if(s[i][j] == '\\\\\\\\') continue;\\n a[i - 1].push_back(s[i][j]);\\n }\\n }\\n for (int i = 0; i < n; i ++)\\n {\\n for (int j = 0; j < m; j ++)\\n {\\n \\n if(a[i][j] == '@')\\n {\\n ax = i, ay = j;\\n q1.insert({i, j});\\n }\\n else if(a[i][j] == '%')\\n {\\n bx = i, by = j;\\n }\\n else if(a[i][j] == '$')\\n {\\n q2.insert({i, j});\\n // cout << i << \\\" \\\" << j<<'\\\\n';\\n }\\n }\\n }\\n while(!q1.empty())\\n {\\n set<PII>tmp;\\n int t = q2.size();\\n for (int i = 0; i < t; i ++)\\n {\\n PII x = *q2.begin();\\n q2.erase(q2.begin());\\n for (int k = 0; k < 4; k ++)\\n {\\n int nx = x.first + dx[k];\\n int ny = x.second + dy[k];\\n if(nx < 0 || nx >= n || ny < 0 || ny >= m || a[nx][ny] == '#'||st[nx][ny] == 2) continue;\\n st[nx][ny] = 2;\\n // cout << nx << \\\" \\\" << ny <<'\\\\n';\\n tmp.insert({nx, ny});\\n }\\n }\\n q2 = tmp;\\n tmp.clear();\\n t = q1.size();\\n for (int i = 0; i < t; i ++)\\n {\\n PII x = *q1.begin();\\n q1.erase(q1.begin());\\n for (int k = 0; k < 4; k ++)\\n {\\n int nx = x.first + dx[k];\\n int ny = x.second + dy[k];\\n if(nx < 0 || nx >= n || ny < 0 || ny >= m || a[nx][ny] == '#'||st[nx][ny] == 2) continue;\\n //cout << nx << \\\" \\\" << ny << '\\\\n';\\n if(nx == bx && ny == by)\\n {\\n puts(\\\"Yes\\\");\\n return 0;\\n }\\n tmp.insert({nx, ny});\\n }\\n }\\n \\n q1= tmp;\\n }\\n puts(\\\"No\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6812,\n \"score_of_the_acc\": -0.0179,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2781_5176668\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long LL;\\ntypedef pair<int, int> pii;\\n\\nconst int maxn = 2e2+10;\\nint n, m, dx, dy, px, py, sx[maxn], sy[maxn], cnt, a[maxn][maxn];\\nint b[maxn][maxn];\\nchar s[maxn];\\n\\nint work(int x, int y)\\n{\\n\\tmemset(b, 63, sizeof(b));\\n\\tqueue<pii > q; q.push({x, y});\\n\\tqueue<int> st; st.push(0);\\n\\twhile(!q.empty())\\n\\t{\\n\\t\\tint nx = q.front().first, ny = q.front().second; q.pop();\\n\\t\\tint nt = st.front(); st.pop();\\n\\t\\tif(nx >= 1 && nx <= n && ny >= 1 && ny <= m && !a[nx][ny] && nt < b[nx][ny])\\n\\t\\t{\\n\\t\\t\\tb[nx][ny] = nt;\\n\\t\\t\\tq.push({nx+1, ny}); st.push(nt+1);\\n\\t\\t\\tq.push({nx-1, ny}); st.push(nt+1);\\n\\t\\t\\tq.push({nx, ny+1}); st.push(nt+1);\\n\\t\\t\\tq.push({nx, ny-1}); st.push(nt+1);\\n\\t\\t}\\n\\t}\\n\\treturn b[dx][dy];\\n}\\n\\nint main()\\n{\\n\\tscanf(\\\"%d%d\\\", &n, &m);\\n\\tfor(int i = 1; i <= n; i++, getchar())\\n\\t{\\n\\t\\tscanf(\\\"%s\\\", s+1);\\n\\t\\tfor(int j = 1; j <= m; j++)\\n\\t\\t{\\n\\t\\t\\tchar c = s[j];\\n\\t\\t\\tif(c == '%') dx = i, dy = j;\\n\\t\\t\\telse if(c == '@') px = i, py = j;\\n\\t\\t\\telse if(c == '$') \\n\\t\\t\\t{\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\tsx[cnt] = i, sy[cnt] = j;\\n\\t\\t\\t}\\n\\t\\t\\telse if(c == '#') a[i][j] = 1;\\n\\t\\t}\\n\\t}\\n\\tint ans1 = 1e9;\\n\\tfor(int i = 1; i <= cnt; i++)\\n\\t{\\n\\t\\tans1 = min(ans1, work(sx[i], sy[i]));\\n\\t} \\n\\tint ans2 = work(px, py);\\n//\\tprintf(\\\"%d %d\\\\n\\\", ans1, ans2);\\n\\tprintf(\\\"%s\\\\n\\\", ans1 > ans2 ? \\\"Yes\\\":\\\"No\\\");\\n\\treturn 0;\\n}\\n\\n/*\\n2 4\\n%.@$\\n..$$\\n\\n3 4\\n.%..\\n.##.\\n.@$.\\n\\n2 3\\n%$@\\n###\\n\\n2 3\\n@#$\\n.%.\\n\\n*/\",\n \"accuracy\": 0.11538461538461539,\n \"time_ms\": 20,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.006,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2781_5175832\",\n \"code_snippet\": \"#include<iostream>\\n#include<sstream>\\n#include<fstream>\\n#include<iomanip>\\n#include<cstdio>\\n#include<algorithm>\\n#include<cstring>\\n#include<cmath>\\n#include<queue>\\n#include<stack>\\n#include<vector>\\n#include<string>\\n#include<map>\\n#include<set>\\n#include<ctime>\\n#include<bitset>\\n#include<iterator>\\n#define bug cout<<\\\"-----------\\\"<<endl;\\n#define ll long long\\n#define ull unsigned long long\\n#define pb push_back\\n#define mp make_pair\\n#define pi pair<int, int>\\n#define fi first\\n#define se second\\nusing namespace std;\\nconst int N=1e6+5,M=1e9+7;\\nconst ull base=13331;\\nconst double Pi=acos(-1.0);\\nconst ll inf=0x3f3f3f3f3f3f3f3f;\\ninline int read() {\\n int x=0,f=1;char ch=getchar();\\n while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}\\n while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}\\n return x*f;\\n}\\nint d[205][205],n,m;\\nint v[205][205];\\nchar a[205][205];\\nint dirx[5]={0,0,0,1,-1};\\nint diry[5]={0,1,-1,0,0};\\nvoid dfs1(int x,int y,int t){\\n\\tif(d[x][y]<=t)return;\\n\\tif(a[x][y]=='#')return;\\n\\tif(a[x][y]=='$'&&!v[x][y]){\\n\\t\\tv[x][y]=1;\\n\\t\\tdfs1(x,y,0);\\n\\t\\treturn;\\n\\t}\\n\\td[x][y]=min(t,d[x][y]);\\n\\tfor(int i=1;i<=4;i++){\\n\\t\\tint x1=x+dirx[i];\\n\\t\\tint y1=y+diry[i];\\n\\t\\tif(x1<1||x1>n)continue;\\n\\t\\tif(y1<1||y1>m)continue;\\n\\t\\tdfs1(x1,y1,t+1);\\n\\t}\\n}\\nint v1[205][205];\\nbool dfs2(int x,int y,int t){\\n\\tif(v1[x][y])return false;\\n\\tv1[x][y]=1;\\n\\tif(a[x][y]=='#')return false;\\n\\tif(t>=d[x][y])return false;\\n\\tif(a[x][y]=='%')return true;\\n\\tfor(int i=1;i<=4;i++){\\n\\t\\tint x1=x+dirx[i];\\n\\t\\tint y1=y+diry[i];\\n\\t\\tif(x1<1||x1>n)continue;\\n\\t\\tif(y1<1||y1>m)continue;\\n\\t\\tif(dfs2(x1,y1,t+1))return true;\\n\\t}\\n\\treturn false;\\n}\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tcin>>n>>m;\\n\\tstd::vector<pair<int,int> > vec;\\n\\tint px,py;\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\tfor(int j=1;j<=m;j++){\\n\\t\\t\\tcin>>a[i][j];\\n\\t\\t\\tif(a[i][j]=='$'){\\n\\t\\t\\t\\tvec.pb(mp(i,j));\\n\\t\\t\\t}\\n\\t\\t\\tif(a[i][j]=='@'){\\n\\t\\t\\t\\tpx=i,py=j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tmemset(d,0x3f,sizeof(d));\\n\\tint cnt=vec.size();\\n\\tfor(int i=0;i<cnt;i++){\\n\\t\\tif(v[vec[i].fi][vec[i].se])continue;\\n\\t\\tv[vec[i].fi][vec[i].se]=1;\\n\\t\\tdfs1(vec[i].fi,vec[i].se,0);\\n\\t}\\n\\tif(dfs2(px,py,0)){\\n\\t\\tcout<<\\\"Yes\\\"<<endl;\\n\\t}\\n\\telse cout<<\\\"No\\\"<<endl;\\n}\\n/*\\n2 4\\n%.@$\\n..$$\\n3 4\\n.%..\\n.##.\\n.@$.\\n2 3\\n%$@\\n###\\n2 3\\n@#$\\n.%.\\n*/\",\n \"accuracy\": 0.36538461538461536,\n \"time_ms\": 10,\n \"memory_kb\": 4872,\n \"score_of_the_acc\": -0.0079,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2781_5175552\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n//#define ll long long\\n#define int long long\\n//#define ull unsigned long long\\n#define PI pair<int,int>\\n//#define PII pair<int,PI>\\n//#define PI pair<ll,int>\\nconst int maxm=555;\\n/*\\n@ 公主\\n$ 士兵\\n% 出口\\n. 空格\\n# 墙\\n*/\\nint dx[]={0,0,1,-1};\\nint dy[]={1,-1,0,0};\\nmap<PI,int>mark,mark2;\\nchar a[maxm][maxm];\\nint n,m;\\nvector<PI>p;\\nvector<PI>out;\\nPI st;\\nvoid bfs1(){\\n queue<PI>q;\\n for(auto i:p){\\n q.push(i);\\n mark[i]=1;\\n }\\n while(q.size()){\\n PI x=q.front();q.pop();\\n for(int k=0;k<4;k++){\\n int xx=x.first+dx[k];\\n int yy=x.second+dy[k];\\n if(xx<=0||xx>n||yy<=0||yy>m)continue;\\n if(a[xx][yy]=='#')continue;\\n PI t={xx,yy};\\n if(mark[t])continue;\\n mark[t]=mark[x]+1;\\n q.push(t);\\n }\\n }\\n}\\nvoid bfs2(){\\n queue<PI>q;\\n q.push(st);\\n mark2[st]=1;\\n while(q.size()){\\n PI x=q.front();q.pop();\\n for(int k=0;k<4;k++){\\n int xx=x.first+dx[k];\\n int yy=x.second+dy[k];\\n if(xx<=0||xx>n||yy<=0||yy>m)continue;\\n if(a[xx][yy]=='#')continue;\\n PI t={xx,yy};\\n if(!mark[t]||mark[t]>mark2[x]+1){\\n if(mark2[t])continue;\\n mark2[t]=mark2[x]+1;\\n q.push(t);\\n }\\n }\\n }\\n}\\nsigned main(){\\n ios::sync_with_stdio(0);\\n cin>>n>>m;\\n for(int i=1;i<=n;i++){\\n for(int j=1;j<=m;j++){\\n cin>>a[i][j];\\n if(a[i][j]=='@'){\\n st={i,j};\\n }else if(a[i][j]=='$'){\\n p.push_back({i,j});\\n }else if(a[i][j]=='%'){\\n out.push_back({i,j});\\n }\\n }\\n }\\n bfs1();\\n bfs2();\\n int ok=0;\\n for(auto i:out){\\n if(mark2[i]){\\n// cout<<i.first<<' '<<i.second<<' '<<mark2[i]<<endl;\\n ok=1;\\n }\\n }\\n if(ok)cout<<\\\"Yes\\\"<<endl;\\n else cout<<\\\"No\\\"<<endl;\\n return 0;\\n}\\n/*\\n2 3\\n@#$\\n.%.\\n\\nNo\\n*/\\n/*\\n\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6224,\n \"score_of_the_acc\": -0.0149,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2781_3926439\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef pair<int,int> P;\\ntypedef pair<int,P> T;\\nint h,w;\\nint dx[5]={1,0,-1,0,0};\\nint dy[5]={0,-1,0,1,0};\\nbool fail[5001][200][200]; //iターン目で兵士のいる可能性のある場所\\nint mincost[200][200];\\ndeque<T> q;\\n\\nint main()\\n{\\n\\tvector<string> mp;\\n\\tcin>>h>>w;\\n\\tfor(int i=0;i<h;i++)\\n\\t{\\n\\t\\tstring s;\\n\\t\\tcin>>s;\\n\\t\\tmp.push_back(s);\\n\\t}\\n\\tbool ans=false;\\n\\tfill(fail[0][0],fail[5001][0],false);\\n\\tfill(mincost[0],mincost[200],1e8-1);\\n\\t//初期配置を定める\\n\\tfor(int i=0;i<h;i++)\\n\\t{\\n\\t\\tfor(int j=0;j<w;j++)\\n\\t\\t{\\n\\t\\t\\tif(mp[i][j]=='$')\\n\\t\\t\\t\\tfail[0][i][j]=true;\\n\\t\\t\\tif(mp[i][j]=='@')\\n\\t\\t\\t{\\n\\t\\t\\t\\tq.push_back(T(0,P(i,j)));\\n\\t\\t\\t\\tmincost[i][j]=0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//兵士の移動パターンをすべて調べる\\n\\tfor(int k=1;k<1001;k++)\\n\\t{\\n\\t\\tfor(int i=0;i<h;i++)\\n\\t\\t{\\n\\t\\t\\tfor(int j=0;j<w;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(fail[k-1][i][j])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int l=0;l<5;l++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tint nx=i+dx[l];\\n\\t\\t\\t\\t\\t\\tint ny=j+dy[l];\\n\\t\\t\\t\\t\\t\\tif(nx>=0 && nx<h && ny>=0 && ny<w && mp[nx][ny]!='#')\\n\\t\\t\\t\\t\\t\\t\\tfail[k][nx][ny]=true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t// for(int i=0;i<h;i++)\\n\\t// {\\n\\t// \\tfor(int j=0;j<w;j++)\\n\\t// \\t{\\n\\t// \\t\\tif(fail[1000][i][j])\\n\\t// \\t\\t\\tcout<<'$';\\n\\t// \\t\\telse\\n\\t// \\t\\t\\tcout<<mp[i][j];\\n\\t// \\t}\\n\\t// \\tcout<<endl;\\n\\t// }\\n\\t//BFS\\n\\twhile(!q.empty())\\n\\t{\\n\\t\\tT t=q.front();q.pop_front();\\n\\t\\tP p=t.second;\\n\\t\\tif(t.first==1000)\\n\\t\\t\\tcontinue;\\n\\t\\tif(mp[p.first][p.second]=='%')\\n\\t\\t{\\n\\t\\t\\tans=true;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<4;i++)\\n\\t\\t{\\n\\t\\t\\tint nx=p.first+dx[i];\\n\\t\\t\\tint ny=p.second+dy[i];\\n\\t\\t\\tif(nx>=0 && nx<h && ny>=0 && ny<w && mp[nx][ny]!='#')\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(!fail[t.first+1][nx][ny] && mincost[nx][ny]==1e8-1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tq.push_back(T(t.first+1,P(nx,ny)));\\n\\t\\t\\t\\t\\tmincost[nx][ny]=t.first+1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(ans)\\n\\t\\tcout<<\\\"Yes\\\"<<endl;\\n\\telse\\n\\t\\tcout<<\\\"No\\\"<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 198716,\n \"score_of_the_acc\": -1.3065,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2781_3467298\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing ll = long long;\\n\\nconst double eps = 1e-10;\\nconst int MOD = 1000000007;\\nconst int INF = 1000000000;\\nconst ll LINF = 1ll<<50;\\n\\ntemplate<typename T>\\nvoid printv(const vector<T>& s) {\\n for(int i=0;i<(int)(s.size());++i) {\\n cout << s[i];\\n if(i == (int)(s.size())-1) cout << endl;\\n else cout << \\\" \\\";\\n }\\n}\\n\\nint main () {\\n cin.tie(0);\\n cout << fixed << setprecision(10);\\n\\n int h, w; cin>>h>>w;\\n vector<int> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};\\n vector<vector<char>> a(h, vector<char>(w));\\n pair<int, int> s, e;\\n map<pair<int, int>, bool> enemy;\\n map<pair<int, int>, bool> wall;\\n for(int i=0;i<h;++i) {\\n for(int j=0;j<w;++j) {\\n cin >> a[i][j];\\n pair<int, int> p = make_pair(i, j);\\n if(a[i][j] == '@') s = p;\\n else if(a[i][j] == '%') e = p;\\n else if(a[i][j] == '$') enemy[p] = true;\\n else if(a[i][j] == '#') wall[p] = true;\\n }\\n }\\n\\n vector<vector<int>> d(h, vector<int>(w, INF));\\n queue<pair<int, int>> q;\\n map<pair<int, int>, bool> sel;\\n q.push(s);\\n sel[s] = true;\\n d[s.first][s.second] = 0;\\n while(!q.empty()) {\\n pair<int, int> now = q.front(); q.pop();\\n // cout << now.first << \\\":\\\" << now.second << endl;\\n for(int i=0;i<4;++i) {\\n pair<int, int> next = make_pair(now.first + dy[i], now.second + dx[i]);\\n if(0 <= next.first && next.first < h && 0 <= next.second && next.second < w && !wall[next] && !sel[next]) {\\n q.push(next);\\n sel[next] = true;\\n d[next.first][next.second] = d[now.first][now.second] + 1;\\n }\\n }\\n }\\n\\n int d_prin = d[e.first][e.second];\\n int d_enemy = INF;\\n\\n vector<vector<int>> de(h, vector<int>(w, INF));\\n map<pair<int, int>, bool> sele;\\n q.push(e);\\n sele[e] = true;\\n de[e.first][e.second] = 0;\\n while(!q.empty()) {\\n pair<int, int> now = q.front(); q.pop();\\n if(enemy[now]) {\\n d_enemy = de[now.first][now.second];\\n break;\\n }\\n for(int i=0;i<4;++i) {\\n pair<int, int> next = make_pair(now.first + dy[i], now.second + dx[i]);\\n if(0 <= next.first && next.first < h && 0 <= next.second && next.second < w && !wall[next] && !sele[next]) {\\n q.push(next);\\n sele[next] = true;\\n de[next.first][next.second] = de[now.first][now.second] + 1;\\n }\\n }\\n }\\n\\n // cout << d_prin << \\\":\\\" << d_enemy << endl;\\n if(d_prin < d_enemy) cout << \\\"Yes\\\" << endl;\\n else cout << \\\"No\\\" << endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 10384,\n \"score_of_the_acc\": -0.0469,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2781_2997656\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\nint h,w;\\nstring s[200];\\nbool used[200][200];\\nbool nxt[200][200];\\nbool ns[200][200];\\nint d[]={0,1,0,-1,0};\\nmain()\\n{\\n\\tcin>>h>>w;\\n\\tfor(int i=0;i<h;i++)cin>>s[i];\\n\\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)used[i][j]=s[i][j]=='$';\\n\\twhile(1)\\n\\t{\\n\\t\\tbool flag=false;\\n\\t\\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)ns[i][j]=nxt[i][j]=0;\\n\\t\\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)\\n\\t\\t{\\n\\t\\t\\tif(!used[i][j])continue;\\n\\t\\t\\tnxt[i][j]=1;\\n\\t\\t\\tfor(int r=0;r<4;r++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint x=i+d[r],y=j+d[r+1];\\n\\t\\t\\t\\tif(x<0||x>=h||y<0||y>=w||s[x][y]=='#')continue;\\n\\t\\t\\t\\tnxt[x][y]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)used[i][j]=nxt[i][j];\\n\\t\\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)\\n\\t\\t{\\n\\t\\t\\tif(s[i][j]!='@')continue;\\n\\t\\t\\tfor(int r=0;r<4;r++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint x=i+d[r],y=j+d[r+1];\\n\\t\\t\\t\\tif(x<0||x>=h||y<0||y>=w||s[x][y]=='#'||used[x][y])continue;\\n\\t\\t\\t\\tif(s[x][y]=='%')\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcout<<\\\"Yes\\\"<<endl;\\n\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tns[x][y]=1;\\n\\t\\t\\t\\tflag=true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!used[i][j])ns[i][j]=1,flag=true;\\n\\t\\t\\ts[i][j]='.';\\n\\t\\t}\\n\\t\\tif(!flag)\\n\\t\\t{\\n\\t\\t\\tcout<<\\\"No\\\"<<endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<h;i++)\\n\\t\\t{\\n\\t\\t\\tfor(int j=0;j<w;j++)if(ns[i][j])s[i][j]='@';\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.0163,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2781_2935537\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<string>\\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<complex>\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\nconst double EPS = 1e-9;\\ntypedef pair<int, int> P;\\ntypedef unsigned int ui;\\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++)\\ntypedef long double ld;\\nconst ld eps=1e-8;\\nint d1[4] = { -1,0,1,0 };\\nint d2[4] = { 0,1,0,-1 };\\nint main() {\\n\\tint h, w; cin >> h >> w;\\n\\tchar pal[202][202];\\n\\trep(i, 202) {\\n\\t\\trep(j, 202) {\\n\\t\\t\\tpal[i][j] = '#';\\n\\t\\t}\\n\\t}\\n\\tstring s; P chk;\\n\\trep1(i, h) {\\n\\t\\tcin >> s;\\n\\t\\trep1(j, w) {\\n\\t\\t\\tpal[i][j] = s[j - 1];\\n\\t\\t\\tif (s[j - 1] == '%') {\\n\\t\\t\\t\\tchk = { i,j };\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint d[202][202];\\n\\trep(i, 202) {\\n\\t\\trep(j, 202) {\\n\\t\\t\\td[i][j] = (int)MOD;\\n\\t\\t}\\n\\t}\\n\\td[chk.first][chk.second] = 0;\\n\\tvector<P> v; int used[202][202] = {};\\n\\tv.push_back(chk);\\n\\twhile (!v.empty()) {\\n\\t\\tint nx = v[0].first; int ny = v[0].second;\\n\\t\\tv.erase(v.begin());\\n\\t\\trep(i, 4) {\\n\\t\\t\\tif (used[nx + d1[i]][ny + d2[i]] == 0 && pal[nx + d1[i]][ny + d2[i]] != '#') {\\n\\t\\t\\t\\tused[nx + d1[i]][ny + d2[i]] = 1;\\n\\t\\t\\t\\tv.push_back({ nx + d1[i],ny + d2[i] });\\n\\t\\t\\t\\td[nx + d1[i]][ny + d2[i]] = min(d[nx + d1[i]][ny + d2[i]], d[nx][ny] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint cnt1; int cnt2 = (int)MOD;\\n\\trep1(i, h) {\\n\\t\\trep1(j, w) {\\n\\t\\t\\tif (pal[i][j] == '@') {\\n\\t\\t\\t\\tcnt1 = d[i][j];\\n\\t\\t\\t}\\n\\t\\t\\telse if (pal[i][j] == '$') {\\n\\t\\t\\t\\tcnt2 = min(cnt2, d[i][j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(cnt1>=cnt2){\\n\\t\\tcout << \\\"No\\\" << endl;\\n\\t}\\n\\telse {\\n\\t\\tcout << \\\"Yes\\\" << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.0013,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2781_2663281\",\n \"code_snippet\": \"///\\n// File: 2781.cpp\\n// Author: ymiyamoto\\n//\\n// Created on Fri Dec 29 19:30:51 2017\\n//\\n\\n#include <cstdint>\\n#include <iostream>\\n#include <queue>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nuint32_t wfs(vector<string> map, int32_t y, int32_t x)\\n{\\n vector<vector<int32_t>> visited(map.size(), vector<int32_t>(map[0].size(), -1));\\n visited[y][x] = 0;\\n queue<pair<int32_t, int32_t>> q;\\n q.push({y, x});\\n\\n while (!q.empty()) {\\n pair<int32_t, int32_t> p = q.front();\\n q.pop();\\n\\n vector<pair<int32_t, int32_t>> ds = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\\n for (auto d : ds) {\\n int32_t y2 = p.first + d.first;\\n int32_t x2 = p.second + d.second;\\n if (0 <= y2 && y2 < (int32_t)map.size() && 0 <= x2 && x2 < (int32_t)map[0].size() && (visited[y2][x2] == -1)) {\\n if (map[y2][x2] == '#' || map[y2][x2] == '$') continue;\\n visited[y2][x2] = visited[p.first][p.second] + 1;\\n q.push({y2, x2});\\n }\\n }\\n }\\n\\n for (uint32_t i = 0; i < map.size(); i++) {\\n for (uint32_t j = 0; j < map[0].size(); j++) {\\n if (map[i][j] == '%') {\\n return visited[i][j];\\n }\\n }\\n }\\n}\\n\\nint32_t main()\\n{\\n uint32_t H, W;\\n cin >> H >> W;\\n vector<string> map;\\n for (uint32_t i = 0; i < H; i++) {\\n string line;\\n cin >> line;\\n map.push_back(line);\\n }\\n\\n uint32_t princess;\\n uint32_t soldier = UINT32_MAX;\\n for (uint32_t y = 0; y < H; y++) {\\n for (uint32_t x = 0; x < W; x++) {\\n if (map[y][x] == '@') {\\n princess = wfs(map, y, x);\\n } else if (map[y][x] == '$') {\\n soldier = min(soldier, wfs(map, y, x));\\n }\\n }\\n }\\n\\n if (princess < soldier) {\\n cout << \\\"Yes\\\" << endl;\\n } else {\\n cout << \\\"No\\\" << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1870,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -1.0001,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2781_2523842\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n\\nusing namespace std;\\n\\nqueue<pair<int,int> > q;\\nint n,m;\\nint w[205][205];\\nint d[205][205];\\nint f[205][205];\\nchar op;\\nconst int dx[4] = {0,0,1,-1};\\nconst int dy[4] = {1,-1,0,0};\\nint sx,sy;\\n\\nvoid bfs(int x,int y)\\n{\\n\\tpair<int,int> now,temp;\\n\\tnow = make_pair(x,y);\\n\\td[x][y] = 0;\\n\\tq.push(now);\\n\\tint nx,ny;\\n\\twhile (!q.empty())\\n\\t{\\n\\t\\tnow = q.front();\\n\\t\\tq.pop();\\n\\t\\tx = now.first;\\n\\t\\ty = now.second;\\n\\t\\tfor (int i=0;i<4;i++)\\n\\t\\t{\\n\\t\\t\\tnx = x+dx[i];\\n\\t\\t\\tny = y+dy[i];\\n\\t\\t\\tif (d[nx][ny] > d[x][y]+1 && w[nx][ny])\\n\\t\\t\\t{\\n\\t\\t\\t\\td[nx][ny] = d[x][y]+1;\\n\\t\\t\\t\\ttemp = make_pair(nx,ny);\\n\\t\\t\\t\\tq.push(temp);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nbool solve(int x,int y)\\n{\\n\\tpair<int,int> now,temp;\\n\\tf[x][y] = 0;\\n\\tnow = make_pair(x,y);\\n\\tq.push(now);\\n\\tint nx,ny;\\n\\twhile (!q.empty())\\n\\t{\\n\\t\\tnow = q.front();\\n\\t\\tq.pop();\\n\\t\\tx = now.first;\\n\\t\\ty = now.second;\\n\\t\\tif (w[x][y] == 5) return 1;\\n\\t\\tfor (int i=0;i<4;i++)\\n\\t\\t{\\n\\t\\t\\tnx = x+dx[i];\\n\\t\\t\\tny = y+dy[i];\\n\\t\\t\\tif (w[nx][ny] == 0 || f[nx][ny] != f[0][0]) continue;\\n\\t\\t\\tf[nx][ny] = f[x][y]+1;\\n\\t\\t\\tif (f[nx][ny] < d[nx][ny])\\n\\t\\t\\t{\\n\\t\\t\\t\\ttemp = make_pair(nx,ny);\\n\\t\\t\\t\\tq.push(temp);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\n\\nint main()\\n{\\n\\tscanf(\\\"%d%d\\\",&n,&m);\\n\\tmemset(w,0,sizeof(w));\\n\\tmemset(d,0x3f,sizeof(d));\\n\\tmemset(f,0x3f,sizeof(f));\\n\\tfor (int i=1;i<=n;i++)\\n\\t{\\n\\t\\tfor (int j=1;j<=m;j++)\\n\\t\\t{\\n\\t\\t\\tscanf(\\\" %c\\\",&op);\\n\\t\\t\\tif (op == '@')\\n\\t\\t\\t{\\n\\t\\t\\t\\tw[i][j] = 4;\\n\\t\\t\\t\\tsx = i;\\n\\t\\t\\t\\tsy = j;\\n\\t\\t\\t}\\n\\t\\t\\tif (op == '%')\\n\\t\\t\\t{\\n\\t\\t\\t\\tw[i][j] = 5;\\n\\t\\t\\t}\\n\\t\\t\\tif (op == '$')\\n\\t\\t\\t{\\n\\t\\t\\t\\tw[i][j] = 2;\\n\\t\\t\\t}\\n\\t\\t\\tif (op == '.')\\n\\t\\t\\t{\\n\\t\\t\\t\\tw[i][j] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n/*\\tprintf(\\\"n=%d m=%d\\\\n\\\",n,m);\\n\\tfor (int i=0;i<=n+1;i++)\\n\\t{\\n\\t\\tfor (int j=0;j<=m+1;j++)\\n\\t\\t\\tprintf(\\\"%d\\\",w[i][j]);\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}*/\\n\\n\\tfor (int i=1;i<=n;i++)\\n\\t{\\n\\t\\tfor (int j=1;j<=m;j++)\\n\\t\\t{\\n\\t\\t\\tif (w[i][j] == 2)\\n\\t\\t\\t{\\n\\t\\t\\t\\tbfs(i,j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tif (solve(sx,sy))\\n\\t{\\n\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tprintf(\\\"No\\\\n\\\");\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1250,\n \"memory_kb\": 3728,\n \"score_of_the_acc\": -0.6688,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2781_2502069\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<algorithm>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<stack>\\n#include<bitset>\\n#include<cstdlib>\\n#include<cmath>\\n#include<set>\\n#include<list>\\n#include<deque>\\n#include<queue>\\nusing namespace std;\\nint n,H,W;\\nconst int maxn = 1e3;\\nconst int INF = 1e9;\\nint labyrinth[maxn][maxn],scnt;\\nint shortest;\\nint pshort,sshort,eshort,goal;\\nbool tf;\\n\\nstruct pt\\n{\\n\\tint x,y;\\n} soldier[100000],princess,escape;\\nchar ch;\\nbool vis[maxn][maxn];\\n\\nint dfs(int x,int y,int cur_length)\\n{\\n\\tint temp;\\n\\t//printf(\\\"%d %d, H:%d W:%d\\\\n\\\",x,y,H,W);\\n\\t//labyrinth[y][x] = 3;\\n\\tvis[y][x] = true;\\n\\tif(x>0&&labyrinth[y][x-1]&&!vis[y][x-1])\\n\\t{\\n\\t\\tif(labyrinth[y][x-1] == goal)\\n\\t\\t{\\n\\t\\t\\treturn cur_length+1;\\n\\t\\t}\\n\\t\\tif((temp = dfs(x-1,y,cur_length+1))<shortest)\\n\\t\\t{\\n\\t\\t\\tshortest = temp;\\n\\t\\t}\\n\\t}\\n\\tif(x<W-1&&labyrinth[y][x+1]&&!vis[y][x+1])\\n\\t{\\n\\t\\tif(labyrinth[y][x+1] == 2)\\n\\t\\t{\\n\\t\\t\\treturn cur_length+1;\\n\\t\\t}\\n\\t\\tif((temp = dfs(x+1,y,cur_length+1))<shortest)\\n\\t\\t{\\n\\t\\t\\tshortest = temp;\\n\\t\\t}\\n\\t}\\n\\tif(y>0&&labyrinth[y-1][x]&&!vis[y-1][x])\\n\\t{\\n\\t\\tif(labyrinth[y-1][x] == 2)\\n\\t\\t{\\n\\t\\t\\treturn cur_length+1;\\n\\t\\t}\\n\\t\\tif((temp = dfs(x,y-1,cur_length+1))<shortest)\\n\\t\\t{\\n\\t\\t\\tshortest = temp;\\n\\t\\t}\\n\\t}\\n\\tif(y<H-1&&labyrinth[y+1][x]&&!vis[y+1][x])\\n\\t{\\n\\t\\tif(labyrinth[y+1][x] == 2)\\n\\t\\t{\\n\\t\\t\\treturn cur_length+1;\\n\\t\\t}\\n\\t\\tif((temp = dfs(x,y+1,cur_length+1))<shortest)\\n\\t\\t{\\n\\t\\t\\tshortest = temp;\\n\\t\\t}\\n\\t}\\n\\treturn shortest;\\n}\\n\\nint main()\\n{\\n\\tios::sync_with_stdio(false);\\n\\t//freopen(\\\"1002.txt\\\",\\\"r\\\",stdin);\\n\\t//freopen(\\\"ans.txt\\\",\\\"w+\\\",stdout);\\n\\twhile(~scanf(\\\"%d%d\\\",&H,&W))\\n\\t{\\n\\t\\ttf = true;\\n\\t\\tscnt = 0;\\n\\t\\tshortest = INF;\\n\\t\\tmemset(labyrinth,-1,sizeof(labyrinth));\\n\\t\\tgetchar();\\n\\t\\tfor(int i = 0; i<H; ++i)\\n\\t\\t{\\n\\t\\t\\tfor(int j = 0; j < W; ++ j)\\n\\t\\t\\t{\\n\\t\\t\\t\\twhile((ch = getchar())=='\\\\n');\\n\\t\\t\\t\\tswitch(ch)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\tcase '@':\\n\\t\\t\\t\\t\\tprincess.x = j;\\n\\t\\t\\t\\t\\tprincess.y = i,labyrinth[i][j] = 5;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase '.':\\n\\t\\t\\t\\t\\tlabyrinth[i][j] = 1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase '$':\\n\\t\\t\\t\\t\\tsoldier[scnt].x = j;\\n\\t\\t\\t\\t\\tsoldier[scnt++].y = i;\\n\\t\\t\\t\\t\\tlabyrinth[i][j] = 0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase '%':\\n\\t\\t\\t\\t\\tlabyrinth[i][j] = 2;\\n\\t\\t\\t\\t\\tescape.x = j;\\n\\t\\t\\t\\t\\tescape.y = i;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase '#':\\n\\t\\t\\t\\t\\tlabyrinth[i][j] = 0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmemset(vis,false,sizeof(vis));\\n\\t\\tgoal = 2;\\n\\t\\tpshort = dfs(princess.x,princess.y,0);\\n\\t\\t//printf(\\\"pshort:%d\\\\n\\\",pshort);\\n\\n\\t\\tgoal = 5;\\n\\t\\tshortest = INF;\\n\\t\\tmemset(vis,false,sizeof(vis));\\n\\t\\teshort = dfs(escape.x,escape.y,0);\\n\\t\\t//printf(\\\"eshort:%d\\\\n\\\",eshort);\\n\\t\\tif(eshort<pshort)\\n\\t\\t\\tpshort = eshort;\\n\\t\\t/*for(int i = 0; i<H; ++i)\\n\\t\\t{\\n\\t\\t\\tfor(int j = 0; j < W; ++ j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(i == princess.y&&j == princess.x)\\n\\t\\t\\t\\t\\tprintf(\\\"X\\\");\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\tprintf(\\\"%d\\\",labyrinth[i][j]);\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t}*/\\n\\t\\tif(!scnt&&pshort!=INF)\\n\\t\\t{\\n\\t\\t\\ttf = true;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tif(pshort != INF)\\n\\t\\t\\t{\\n\\t\\t\\t\\tgoal = 2;\\n\\t\\t\\t\\tfor(int i = 0; i < scnt; ++i)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tmemset(vis,false,sizeof(vis));\\n\\t\\t\\t\\t\\tshortest = INF;\\n\\t\\t\\t\\t\\tsshort = dfs(soldier[i].x,soldier[i].y,0);\\n\\t\\t\\t\\t\\t//printf(\\\"sshort:%d\\\\n\\\",sshort);\\n\\t\\t\\t\\t\\tif(sshort <= pshort)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\ttf = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t\\ttf = false;\\n\\n\\t\\t}\\n\\t\\tif(tf)\\n\\t\\t{\\n\\t\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tprintf(\\\"No\\\\n\\\");\\n\\t\\t}\\n\\n\\n\\t}\\n}\",\n \"accuracy\": 0.3076923076923077,\n \"time_ms\": 120,\n \"memory_kb\": 8516,\n \"score_of_the_acc\": -0.0857,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2781_2502024\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<algorithm>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<stack>\\n#include<bitset>\\n#include<cstdlib>\\n#include<cmath>\\n#include<set>\\n#include<list>\\n#include<deque>\\n#include<queue>\\nusing namespace std;\\nint n,H,W;\\nconst int maxn = 2e2+2;\\nconst int INF = 1e9;\\nint labyrinth[maxn][maxn],scnt;\\nint shortest;\\nint pshort,sshort,eshort,goal;\\nbool tf;\\n\\nstruct pt\\n{\\n int x,y;\\n} soldier[maxn],princess,escape;\\nchar ch;\\nbool vis[maxn][maxn];\\n\\nint dfs(int x,int y,int cur_length)\\n{\\n int temp;\\n //printf(\\\"%d %d, H:%d W:%d\\\\n\\\",x,y,H,W);\\n //labyrinth[y][x] = 3;\\n vis[y][x] = true;\\n if(x>0&&labyrinth[y][x-1]&&!vis[y][x-1])\\n {\\n if(labyrinth[y][x-1] == goal)\\n {\\n return cur_length+1;\\n }\\n if((temp = dfs(x-1,y,cur_length+1))<shortest)\\n {\\n shortest = temp;\\n }\\n }\\n if(x<W-1&&labyrinth[y][x+1]&&!vis[y][x+1])\\n {\\n if(labyrinth[y][x+1] == 2)\\n {\\n return cur_length+1;\\n }\\n if((temp = dfs(x+1,y,cur_length+1))<shortest)\\n {\\n shortest = temp;\\n }\\n }\\n if(y>0&&labyrinth[y-1][x]&&!vis[y-1][x])\\n {\\n if(labyrinth[y-1][x] == 2)\\n {\\n return cur_length+1;\\n }\\n if((temp = dfs(x,y-1,cur_length+1))<shortest)\\n {\\n shortest = temp;\\n }\\n }\\n if(y<H-1&&labyrinth[y+1][x]&&!vis[y+1][x])\\n {\\n if(labyrinth[y+1][x] == 2)\\n {\\n return cur_length+1;\\n }\\n if((temp = dfs(x,y+1,cur_length+1))<shortest)\\n {\\n shortest = temp;\\n }\\n }\\n return shortest;\\n}\\n\\nint main()\\n{\\n //freopen(\\\"1002.txt\\\",\\\"r\\\",stdin);\\n //freopen(\\\"ans.txt\\\",\\\"w+\\\",stdout);\\n while(~scanf(\\\"%d%d\\\",&H,&W))\\n {\\n tf = true;\\n scnt = 0;\\n shortest = INF;\\n memset(labyrinth,-1,sizeof(labyrinth));\\n getchar();\\n for(int i = 0; i<H; ++i)\\n {\\n for(int j = 0; j < W; ++ j)\\n {\\n while((ch = getchar())=='\\\\n');\\n switch(ch)\\n {\\n case '@':\\n princess.x = j;\\n princess.y = i,labyrinth[i][j] = 5;\\n break;\\n case '.':\\n labyrinth[i][j] = 1;\\n break;\\n case '$':\\n soldier[scnt].x = j;\\n soldier[scnt++].y = i;\\n labyrinth[i][j] = 1;\\n break;\\n case '%':\\n labyrinth[i][j] = 2;\\n escape.x = j;\\n escape.y = i;\\n break;\\n case '#':\\n labyrinth[i][j] = 0;\\n break;\\n }\\n }\\n }\\n memset(vis,false,sizeof(vis));\\n goal = 2;\\n pshort = dfs(princess.x,princess.y,0);\\n //printf(\\\"pshort:%d\\\\n\\\",pshort);\\n\\n goal = 5;\\n shortest = INF;\\n memset(vis,false,sizeof(vis));\\n eshort = dfs(escape.x,escape.y,0);\\n //printf(\\\"eshort:%d\\\\n\\\",eshort);\\n if(eshort<pshort)\\n pshort = eshort;\\n /*for(int i = 0; i<H; ++i)\\n {\\n for(int j = 0; j < W; ++ j)\\n {\\n if(i == princess.y&&j == princess.x)\\n printf(\\\"X\\\");\\n else\\n printf(\\\"%d\\\",labyrinth[i][j]);\\n }\\n printf(\\\"\\\\n\\\");\\n }*/\\n if(!scnt&&pshort!=INF)\\n {\\n tf = true;\\n }\\n else\\n {\\n if(pshort != INF)\\n {\\n goal = 2;\\n for(int i = 0; i < scnt; ++i)\\n {\\n memset(vis,false,sizeof(vis));\\n shortest = INF;\\n sshort = dfs(soldier[i].x,soldier[i].y,0);\\n //printf(\\\"sshort:%d\\\\n\\\",sshort);\\n if(sshort <= pshort)\\n {\\n tf = false;\\n break;\\n }\\n }\\n\\n }\\n else\\n tf = false;\\n\\n }\\n if(tf)\\n {\\n printf(\\\"Yes\\\\n\\\");\\n }\\n else\\n {\\n printf(\\\"No\\\\n\\\");\\n }\\n\\n\\n }\\n}\",\n \"accuracy\": 0.11538461538461539,\n \"time_ms\": 10,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.0007,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2781_2501708\",\n \"code_snippet\": \"// @Team : nupt2017team12\\n// @Author : Zst\\n#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <algorithm>\\n#include <map>\\nusing namespace std;\\n#define LL long long\\n#define MOD 1000000007\\n#define CLR(a,x) memset(a,x,sizeof(a))\\n#define INF 0x3f3f3f3f\\n#define pb push_back\\n#define FOR(i,a,b) for( int i = ( a ); i <= ( b ); ++i )\\n\\nconst int N = 200+7;\\nchar maps[N][N];\\nint vis[N][N];\\n\\nint r, c;\\nint posX, posY;\\n\\nint princess;\\nint soldier;\\n\\nvoid solve( int x, int y, int times )\\n{\\n\\tvis[x][y] = times;\\n\\tif( maps[x][y] == '@' ) {\\n\\t\\tprincess = min( princess, times );\\n\\t} else if( maps[x][y] == '$' ) {\\n\\t\\tsoldier = min( soldier, times );\\n\\t}\\n\\tif( x-1 >= 0 ) {\\n\\t\\tif( vis[x-1][y] == -1 ) {\\n\\t\\t\\tsolve( x-1, y, times+1 );\\n\\t\\t} else if( times+1 < vis[x-1][y] ) {\\n\\t\\t\\tsolve( x-1, y, times+1 );\\n\\t\\t}\\n\\t}\\n\\tif( y-1 >= 0 ) {\\n\\t\\tif( vis[x][y-1] == -1 ) {\\n\\t\\t\\tsolve( x, y-1, times+1 );\\n\\t\\t} else if( times+1 < vis[x][y-1] ) {\\n\\t\\t\\tsolve( x, y-1, times+1 );\\n\\t\\t}\\n\\t}\\n\\tif( x+1 < r ) {\\n\\t\\tif( vis[x+1][y] == -1 ) {\\n\\t\\t\\tsolve( x+1, y, times+1 );\\n\\t\\t} else if( times+1 < vis[x+1][y] ) {\\n\\t\\t\\tsolve( x+1, y, times+1 );\\n\\t\\t}\\n\\t}\\n\\tif( y+1 < c ) {\\n\\t\\tif( vis[x][y+1] == -1 ) {\\n\\t\\t\\tsolve( x, y+1, times+1 );\\n\\t\\t} else if( times+1 < vis[x][y+1] ) {\\n\\t\\t\\tsolve( x, y+1, times+1 );\\n\\t\\t}\\n\\t}\\n\\treturn;\\n\\n}\\n\\n\\nint main()\\n{\\n // freopen( \\\"B.txt\\\", \\\"r\\\", stdin );\\n while( scanf( \\\"%d%d\\\", &r, &c ) != EOF ) {\\n \\tprincess = soldier = INF;\\n\\t\\tCLR( vis, -1 );\\n\\t FOR( i, 0, r-1 ) {\\n\\t \\tscanf( \\\"%s\\\", maps[i] );\\n\\t\\t\\tFOR( j, 0, c-1 ) {\\n\\t\\t\\t\\tif( maps[i][j] == '%' ) {\\n\\t\\t\\t\\t\\tposX = i;\\n\\t\\t\\t\\t\\tposY = j;\\n\\t\\t\\t\\t} else if( maps[i][j] == '#' ) {\\n\\t\\t\\t\\t\\tvis[i][j] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t }\\n\\t solve( posX, posY, 0 );\\n\\t if( princess < soldier ) {\\n\\t \\tprintf( \\\"Yes\\\\n\\\");\\n\\t } else {\\n\\t \\tprintf( \\\"No\\\\n\\\");\\n\\t }\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1430,\n \"memory_kb\": 5324,\n \"score_of_the_acc\": -0.7737,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2781_2501704\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cstdio>\\n#include<cmath>\\n#include <queue>\\n\\nusing namespace std;\\n\\nconst int maxx=205;\\nint n,m,k;\\nchar a[maxx][maxx];\\nint ans = 0,cnt = 0,pos = 0;\\nint l = 0,r = 0;\\n\\n\\nconst int INF = 100000000;\\nint dx[4] = {0,0,1,-1};\\nint dy[4] = {1,-1,0,0};\\ntypedef pair <int,int> P;\\nqueue<P> que;\\nint d[maxx][maxx];\\nint sx,sy;\\nint ex,ey;\\n\\nbool judge(int x,int y){\\n if(a[x][y] == '.' || a[x][y] == '%'){\\n if(x >= 0 && x < n)\\n {\\n if(y >= 0 && y < m)\\n {\\n if(d[x][y] == INF){\\n return true;\\n }\\n }\\n }\\n }\\n return false;\\n}\\n\\nint bfs()\\n{\\n for(int i = 0; i < n; i++){\\n for(int j = 0; j < m; j++){\\n d[i][j] = INF;//初始化\\n }\\n }\\n que.push(P(sx,sy));\\n d[sx][sy] = 0;//并把距???0；\\n while(que.size()){//直到?列?空\\n P p = que.front();que.pop();\\n if(p.first == ex && p.second == ey){\\n break;//如果已?是?点，??束搜索。\\n }\\n for(int i = 0; i < 4; i++)\\n {\\n int nx = p.first + dx[i],ny = p.second + dy[i];\\n if(judge(nx,ny))\\n {\\n que.push(P(nx,ny));\\n d[nx][ny] = d[p.first][p.second] + 1;\\n }\\n }\\n }\\n return d[ex][ey];\\n}\\n\\n\\nint main()\\n{\\n#ifdef LOCAL\\n// freopen(\\\"/Users/ecooodt/Desktop/c++ and acm/_集?/tp1/2.txt\\\",\\\"r\\\",stdin);\\n#endif\\n scanf(\\\"%d%d\\\",&n,&m);\\n for(int i = 0; i < n; i++)\\n {\\n getchar();\\n for(int j = 0; j < m; j++)\\n {\\n scanf(\\\"%c\\\",&a[i][j]);\\n if(a[i][j] == '%')\\n {\\n ex = i,ey = j;\\n }\\n if(a[i][j] == '@') sx = i,sy = j;\\n }\\n }\\n pos = bfs();\\n// printf(\\\"%d \\\",pos);\\n for(int i = 0; i < n; i ++)\\n {\\n for(int j = 0; j < m; j++)\\n {\\n if(a[i][j] == '$')\\n {\\n sx = i,sy = j;\\n int t = bfs();\\n if(t <= pos) {\\n// printf(\\\"%d\\\\n\\\",t);\\n printf(\\\"No\\\\n\\\");\\n return 0;\\n }\\n }\\n }\\n }\\n printf(\\\"Yes\\\\n\\\");\\n return 0;\\n}\",\n \"accuracy\": 0.15384615384615385,\n \"time_ms\": 10,\n \"memory_kb\": 3320,\n \"score_of_the_acc\": 0,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1671,"cells":{"group_id":{"kind":"string","value":"aoj_2783_cpp"},"problem_description":{"kind":"string","value":"Parentheses\nDave loves strings consisting only of '(' and ')'. Especially, he is interested in balanced strings. Any balanced strings can be constructed using the following rules:\nA string \"()\" is balanced.\nConcatenation of two balanced strings are balanced.\nIf $T$ is a balanced string, concatenation of '(', $T$, and ')' in this order is balanced. For example, \"()()\" and \"(()())\" are balanced strings. \")(\" and \")()(()\" are not balanced strings.\nDave has a string consisting only of '(' and ')'. It satis\fes the followings:\nYou can make it balanced by swapping adjacent characters exactly $A$ times.\nFor any non-negative integer $B$ ($B < A$), you cannot make it balanced by $B$ swaps of adjacent characters.\nIt is the shortest of all strings satisfying the above conditions.\nYour task is to compute Dave's string. If there are multiple candidates, output the minimum in lexicographic order. As is the case with ASCII, '(' is less than ')'.\nInput\nThe input consists of a single test case, which contains an integer $A$ ($1 \\leq A \\leq 10^9$).\nOutput\nOutput Dave's string in one line. If there are multiple candidates, output the minimum in lexicographic order.\nSample Input 1\n1\nOutput for the Sample Input 1\n)(\nThere are infinitely many strings which can be balanced by only one swap. Dave's string is the shortest of them.\nSample Input 2\n4\nOutput for the Sample Input 2\n)())((\nString \"))(()(\" can be balanced by 4 swaps, but the output should be \")())((\" because it is the minimum in lexicographic order."},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2783_4919488","code_snippet":"#include <random>\n#include \"bits/stdc++.h\"\n//#include <atcoder/all>\n\nusing namespace std;\n// using namespace atcoder;\n\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\nconstexpr ld eps = 1e-12;\nconstexpr int inf = numeric_limits<int>::max() / 2;\nconstexpr ll mod = 1e9 + 7;\nmt19937_64 rnd{random_device()()};\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 ll a;\n cin >> a;\n auto generate = [](int n) {\n string s = \"\";\n for (int i = 0; i < n; i++) s += ')';\n for (int i = 0; i < n; i++) s += '(';\n return s;\n };\n string ans = \"\";\n for (ll i = 1; i <= a; i++) {\n ll sum = i * (i + 1) / 2;\n if (sum < a) continue;\n ans = generate(i);\n break;\n }\n ll x = ans.size() / 2;\n ll diff = x * (x + 1) / 2 - a;\n while (diff--) {\n int sz = ans.size();\n for (int i = 0; i < sz - 1; i++) {\n if (ans[i] == ')' && ans[i + 1] == '(') {\n swap(ans[i], ans[i + 1]);\n break;\n }\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":390,"memory_kb":3584,"score_of_the_acc":-0.3015,"final_rank":6},{"submission_id":"aoj_2783_3540943","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <cassert>\n\nusing namespace std;\n\nusing lint = long long;\nusing ldouble = long double;\n\nstring rec(int A, int L) {\n if (L <= 0) {\n assert(A == 0);\n return \"\";\n }\n\n int D;\n for (D = 0; D * (D + 1) / 2 < A; ++D) {}\n\n string ret;\n for (int i = 0; i < L - D; ++i) ret += \"()\";\n return ret + ')' + rec(A - D, D - 1) + '(';\n}\n\nint main() {\n int A;\n cin >> A;\n int D;\n for (D = 1; D * (D + 1) / 2 < A; ++D) {}\n cout << ')' + rec(A - D, D - 1) + '(' << endl;\n return 0;\n}","accuracy":1,"time_ms":530,"memory_kb":8868,"score_of_the_acc":-1.183,"final_rank":9},{"submission_id":"aoj_2783_3351167","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define LINF (ll)INF*INF\n#define MOD 1000000007\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define loop(i,a,n) for(int i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vp;\n\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\nint lcm(int a, int b){\n return a*b/gcd(a,b);\n}\n\nsigned main(void) {\n int in;\n cin >> in;\n int n = 1;\n while(!((n-1)*n < 2*in && 2*in <= n*(n+1)))n++;\n string s = \"\";\n rep(i,n)s = \")\" + s + \"(\";\n int t = n*(n+1)/2-in;\n swap(s[n], s[n-t]);\n cout << s << endl;\n}","accuracy":1,"time_ms":160,"memory_kb":3392,"score_of_the_acc":-0.1402,"final_rank":2},{"submission_id":"aoj_2783_2502338","code_snippet":"#include<iostream>\n\n#include<cstring>\n#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<map>\n#define set(x,y) memset(x,y,sizeof(x))\n#define scan(x) scanf(\"%d\",&x)\n#define For(x,y,z) for(int x=y;x<=z;x++)\nusing namespace std;\n\nconst int MAXN = 100010;\n\nint get(int n)\n{\n int i=1;\n for( i=1;i<=100000;i++)\n {\n if(n<=((i+1)*i/2))\n return i;\n }\n}\nlong long getmax(int n,int maxn)\n{\n long long ans=0;\n for(int i=maxn-n+1;i<=maxn;i++)\n ans+=i;\n\n return ans;\n}\nint main()\n{\n int n;\n cin>>n;\n int pairs=get(n);\n // cout<<pairs<<endl;\n long sumright=((pairs*2*(pairs*2+1))/2-pairs)/2+pairs;\n sumright-=n;//\n long sumleft=(pairs*2+1)*2*pairs/2-sumright;\n //cout<<sumleft<<endl;\n int cnt=0;\n bool a[MAXN];\n set(a,0);\n for(int i=1;i<=2*pairs;i++)\n {\n if(cnt==pairs)\n break;\n if((sumleft-i>i||(sumleft-i==0))&&((sumleft-i)<=getmax(pairs-cnt-1,2*pairs)))\n {\n // cout<<getmax(pairs-cnt-1,2*pairs)<<endl;\n cnt++;\n sumleft-=i;\n a[i]=1;\n }\n }\n for(int i=1;i<=2*pairs;i++)\n if(a[i])\n {\n cout<<'(';\n }\n else\n cout<<')';\n\n cout<<endl;\n //out(n);\n return 0;\n}","accuracy":0.024096385542168676,"time_ms":460,"memory_kb":3172,"score_of_the_acc":-0.2792,"final_rank":14},{"submission_id":"aoj_2783_2476200","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\nvoid work(int n)\n{\n\tn=(n+1)>>1;\n\tint tmp=n;\n\twhile(tmp>=10)\n\t{\n\t\ttmp-=10;\n\t\tprintf(\"))))))))))\");\n\t}\n\tfor(int i=1;i<=tmp;++i)\n\tprintf(\")\");\n\twhile(n>=10)\n\t{\n\t\tn-=10;\n\t\tprintf(\"((((((((((\");\n\t}\n\tfor(int i=1;i<=n;++i)\n\tprintf(\"(\");\n\tprintf(\"\\n\");\n}\nint main()\n{\n\tint n;\n\tscanf(\"%d\",&n);\n\tif(!(n&1))\n\t{\n\t\tprintf(\")(\");n--;\n\t}\n\t\n\twork(n);\n\treturn 0;\n}","accuracy":0.024096385542168676,"time_ms":1540,"memory_kb":3136,"score_of_the_acc":-0.8945,"final_rank":17},{"submission_id":"aoj_2783_2407518","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 each(itr,v) for(auto itr:v)\n#define pb push_back\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_popcount\n\n#define INF INT_MAX/3\n\nll n;\nstring res;\n\nint main(){\n\tcin.sync_with_stdio(false);\n cin>>n;\n ll sum=0;\n repl(i,1,n+1){\n ll nxt=i+1;\n if(nxt*(nxt+1)/2>n){\n n-=i*(i+1)/2;\n string tmp;\n rep(j,i)tmp='('+tmp;\n rep(j,i)tmp=')'+tmp;\n if(n>0){\n res=\")\"+tmp.substr(0,n-1)+\"(\"+tmp.substr(n-1,tmp.size()-n+1);\n }else res=tmp;\n break;\n }\n }\n cout<<res<<endl;\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3372,"score_of_the_acc":-0.1314,"final_rank":1},{"submission_id":"aoj_2783_2406706","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 each(itr,v) for(auto itr:v)\n#define pb push_back\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_popcount\n\n#define INF INT_MAX/3\n\nll n;\nstring res;\n\nint main(){\n\tcin.sync_with_stdio(false);\n cin>>n;\n while(n>0){\n repl(i,1,n+1){\n ll nxt=i+1;\n if(nxt*(nxt+1)/2>n){\n n-=i*(i+1)/2;\n rep(j,i)res='('+res;\n rep(j,i)res=')'+res;\n break;\n }\n }\n }\n cout<<res<<endl;\n\treturn 0;\n}","accuracy":0.024096385542168676,"time_ms":110,"memory_kb":3288,"score_of_the_acc":-0.0957,"final_rank":11},{"submission_id":"aoj_2783_2270842","code_snippet":"#include <bits/stdc++.h>\n\n#define N 100010\n\nusing namespace std;\n\nconst int inf = 0x3f3f3f3f;\nmap<int,int>Map;\nint a[N],k;\nchar s[N];\nint main()\n{\n int n,x = 0;\n for( k = 1; x <= 1000000000; k++)\n {\n x += k;\n Map[x] = k;\n a[k] = x;\n }\n scanf(\"%d\",&n);\n if(Map.find(n) != Map.end())\n {\n for(int i = 1; i <= Map[n]; i++)\n printf(\")\");\n for(int i = 1; i <= Map[n]; i++)\n printf(\"(\");\n printf(\"\\n\");\n }\n else\n {\n int x = n;\n while(Map.find(x) == Map.end())x++;\n int l = x;\n x = Map[x];\n n = l - n;\n for(int i = 1; i <= 2*x; i++)\n if(i <= x)s[i] = ')';\n else s[i] = '(';\n s[x*2+1] = '\\0';\n while(n --)\n {\n swap(s[x],s[x+1]);\n x--;\n }\n puts(s+1);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5508,"score_of_the_acc":-0.3748,"final_rank":7},{"submission_id":"aoj_2783_2146044","code_snippet":"#include <iostream>\n#include <string>\nusing namespace std;\n#define REP(i,n) for(int i=0; i<n; ++i)\nint a,i,p;\nint main() {\n cin >> a;\n while (p < a){\n i++;\n p += i;\n }\n string s;\n REP(j,i) s = s + ')';\n REP(j,i) s = s + '(';\n swap(s[i], s[i-p+a]);\n cout << s << endl;\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":3400,"score_of_the_acc":-0.1414,"final_rank":3},{"submission_id":"aoj_2783_2146042","code_snippet":"#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n \n#define REP(i,n) for(int i=0; i<n; ++i)\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\n \ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef vector<VI> VVI;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\n\nint main() {\n int a;\n cin >> a;\n int i = 0, p = 0;\n while (p < a){\n i++;\n p += i;\n }\n string ans;\n REP(j,i) ans = ans + ')';\n REP(j,i) ans = ans + '(';\n int j = i - (p - a);\n swap(ans[i], ans[j]);\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":3400,"score_of_the_acc":-0.1414,"final_rank":3},{"submission_id":"aoj_2783_2146029","code_snippet":"#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n \n#define REP(i,n) for(int i=0; i<n; ++i)\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\n \ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef vector<VI> VVI;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\n\nint main() {\n int a;\n cin >> a;\n VI x;\n int p = 0;\n for (int i = 1; p <= a; i++){\n p += i;\n x.push_back(p);\n }\n string ans;\n while (a){\n int i = 0;\n while (i < x.size()-1 && x[i+1] <= a) i++;\n a -= x[i];\n REP(j,i+1) ans = \"(\" + ans;\n REP(j,i+1) ans = \")\" + ans;\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.024096385542168676,"time_ms":120,"memory_kb":3276,"score_of_the_acc":-0.0996,"final_rank":12},{"submission_id":"aoj_2783_2132919","code_snippet":"#include <iostream>\n#include <string>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll A;\n cin >> A;\n ll i = 1;\n while((i + 1) * i / 2 < A) {\n ++i;\n }\n string res = \"()\";\n for(int j=0; j<i-1; ++j) {\n res += ')';\n }\n for(int j=0; j<i-1; ++j) {\n res += '(';\n }\n A -= i * (i-1) / 2;\n for(int j=0; j<A; ++j) {\n for(int k=0; k<res.size()-1; ++k) {\n if(res[k] == '(' && res[k+1] == ')') {\n swap(res[k], res[k+1]);\n break;\n }\n }\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":770,"memory_kb":3316,"score_of_the_acc":-0.4792,"final_rank":8},{"submission_id":"aoj_2783_2085260","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define mx 10000000\n#define m 44722\n\nint ar[m+5],num;\n\n\nint main()\n{\n int val = 0,in=0;\n for(int i=1;i<mx;i++){\n\n //if(in>44715) cout<<val<<\" \"<<in<<endl;\n val+=i;\n if(in==44721+1) break;\n ar[++in] = val;\n\n }\n //cout<<in<<\" \"<<ar[in];\n scanf(\"%d\",&num);\n\n if(num==1){\n cout<<\")(\"<<endl;\n return 0;\n }\n else if(num==2){\n cout<<\")()(\"<<endl;\n return 0;\n }\n else if(num==3){\n cout<<\"))((\"<<endl;\n return 0;\n }\n\n int idx;\n for(int i=1;i<=m;i++){\n if(num<=ar[i]){\n idx = i;\n break;\n }\n }\n //cout<<idx<<endl;\n int n = idx;\n\n char x[idx*2+5];\n\n for(int i=1;i<=idx*2;i++){\n if(i%2==0) x[i] = '(';\n else x[i] = ')';\n //printf(\"%c\",x[i]);\n }\n //cout<<endl;\n\n int hi = idx*2;\n int lo = 1;\n\n for(int i=1;i<=num;i++){\n\n lo++;\n hi--;\n int l=lo,h=hi;\n int loop = hi-lo+1;\n //cout<<loop<<endl;\n for(int j=1;j<=loop/2;j++){\n\n swap(x[h],x[h-1]);\n n++;\n if(n==num){\n for(int k=1;k<=idx*2;k++) printf(\"%c\",x[k]);\n cout<<endl;\n return 0;\n }\n h-=2;\n }\n /*if(hi-lo==1){\n for(int k=1;k<=idx*2;k++) printf(\"%c\",x[k]);\n cout<<endl;\n return 0;\n }*/\n }\n\n return 0;\n}","accuracy":0.024096385542168676,"time_ms":610,"memory_kb":3308,"score_of_the_acc":-0.3861,"final_rank":15},{"submission_id":"aoj_2783_2085258","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define mx 10000000\n#define m 44722\n\nint ar[m+5],num;\n\nint srch(int i,int j)\n{\n if(j-i==1){\n if(ar[i]==num) return i;\n else return j;\n }\n int mid = (i+j)/2;\n if(ar[mid]==num) return mid;\n\n if(num>ar[mid]) srch(mid,j);\n else if(num<ar[mid]) srch(i,mid);\n}\nint main()\n{\n int val = 0,in=0;\n for(int i=1;i<mx;i++){\n\n //if(in>44715) cout<<val<<endl;\n val+=i;\n if(in==44721+1) break;\n ar[++in] = val;\n\n }\n //cout<<in<<\" \"<<ar[in];\n scanf(\"%d\",&num);\n\n if(num==1){\n cout<<\")(\"<<endl;\n return 0;\n }\n else if(num==2){\n cout<<\")()(\"<<endl;\n return 0;\n }\n else if(num==3){\n cout<<\"))((\"<<endl;\n return 0;\n }\n\n int idx = srch(1,m);\n\n int n = idx;\n\n char x[idx*2+5];\n\n for(int i=1;i<=idx*2;i++){\n if(i%2==0) x[i] = '(';\n else x[i] = ')';\n }\n\n int hi = idx*2;\n int lo = 1;\n\n for(int i=1;i<=num;i++){\n\n lo++;\n hi--;\n int l=lo,h=hi;\n int loop = hi-lo+1;\n //cout<<loop<<endl;\n for(int j=1;j<=loop/2;j++){\n\n swap(x[h],x[h-1]);\n n++;\n if(n==num){\n for(int k=1;k<=idx*2;k++) printf(\"%c\",x[k]);\n cout<<endl;\n return 0;\n }\n h-=2;\n }\n if(hi-lo==1){\n for(int k=1;k<=idx*2;k++) printf(\"%c\",x[k]);\n cout<<endl;\n return 0;\n }\n }\n\n return 0;\n}","accuracy":0.024096385542168676,"time_ms":670,"memory_kb":3340,"score_of_the_acc":-0.4254,"final_rank":16},{"submission_id":"aoj_2783_2076159","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nstring s;\n\nint main()\n{\n\n long long i,j,k,l,m,n,o,p;\n\n char sf[10005],sb[10005];\n for(i=0;i<10000;i++)\n {\n sf[i]='(';\n sb[i]=')';\n }\n sf[10000]='\\0';\n sb[10000]='\\0';\n\n cin>>n;\n\n if(n==1)\n {\n printf(\")(\\n\");\n return 0;\n }\n\n int number=(n/3);\n\n if(n%3!=0)\n number++;\n\n long long lim=number*3;\n long long check=lim-n;\n\n number++;\n\n if(check==1)\n {\n for(i=0; i<number-1; i++)\n {\n if(i+10000<number-1)\n {printf(\"%s\",sb);i+=10000;}\n else\n printf(\")\");\n }\n printf(\"()\");\n for(i=0; i<number-1; i++)\n {\n if(i+10000<number-1)\n {printf(\"%s\",sf);i+=10000;}\n else\n printf(\"(\");\n\n }\n //printf(\"(\");\n\n printf(\"\\n\");\n }\n\n else if(check==0)\n {\n for(i=0; i<number; i++)\n if(i+10000<number-1)\n {printf(\"%s\",sb);i+=10000;}\n else\n printf(\")\");\n//printf(\"()\");\n for(i=0; i<number; i++)\n if(i+10000<number-1)\n {printf(\"%s\",sf);i+=10000;}\n else\n printf(\"(\");\n\n printf(\"\\n\");\n }\n else if(check==2)\n {\n for(i=0; i<number-2; i++)\n if(i+10000<number-1)\n {printf(\"%s\",sb);i+=10000;}\n else\n printf(\")\");\n printf(\"())\");\n for(i=0; i<number-1; i++)\n if(i+10000<number-1)\n {printf(\"%s\",sf);i+=10000;}\n else\n printf(\"(\");\n printf(\"\\n\");\n }\n\n return 0;\n}","accuracy":0.024096385542168676,"time_ms":420,"memory_kb":3308,"score_of_the_acc":-0.2769,"final_rank":13},{"submission_id":"aoj_2783_2076103","code_snippet":"//#include <bits/stdc++.h>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<stack>\n#include<vector>\n#include<deque>\n#include<functional>\n#include<string>\n#include<iostream>\n#include<cctype>\n#include<set>\n#include<climits>\n#include<iomanip>\n#include<cassert>\n#include<sstream>\n\n#define pb push_back\n#define nl puts (\"\")\n#define sp printf ( \" \" )\n#define phl printf ( \"hello\\n\" )\n#define ff first\n#define ss second\n#define POPCOUNT __builtin_popcountll\n#define RIGHTMOST __builtin_ctzll\n#define LEFTMOST(x) (63-__builtin_clzll((x)))\n#define MP make_pair\n#define FOR(i,x,y) for(vlong i = (x) ; i <= (y) ; ++i)\n#define ROF(i,x,y) for(vlong i = (y) ; i >= (x) ; --i)\n#define CLR(x,y) memset(x,y,sizeof(x))\n#define UNIQUE(V) (V).erase(unique((V).begin(),(V).end()),(V).end())\n#define MIN(a,b) ((a)<(b)?(a):(b))\n#define MAX(a,b) ((a)>(b)?(a):(b))\n#define NUMDIGIT(x,y) (((vlong)(log10((x))/log10((y))))+1)\n#define SQ(x) ((x)*(x))\n#define ABS(x) ((x)<0?-(x):(x))\n#define FABS(x) ((x)+eps<0?-(x):(x))\n#define ALL(x) (x).begin(),(x).end()\n#define LCM(x,y) (((x)/gcd((x),(y)))*(y))\n#define SZ(x) ((vlong)(x).size())\n#define NORM(x) if(x>=mod) x-=mod;if(x<0) x+=mod;\n#define MOD(x,y) (((x)*(y))%mod)\n#define ODD(x) (((x)&1)==0?(0):(1))\n#define Set(N,cur) N=(N|(1LL<<cur))\n#define Reset(N,cur) N=(N&(~(1LL<<cur)))\n#define Check(N,cur) (!((N&(1LL<<cur))==0))\n#define fast_cin ios_base::sync_with_stdio(false);cin.tie(NULL)\n\nusing namespace std;\n\n\n#define LL long long\n#define LLU long long unsigned int\ntypedef long long vlong;\ntypedef unsigned long long uvlong;\ntypedef pair < int, int > pii;\ntypedef pair < vlong, vlong > pll;\ntypedef vector<int> vi;\ntypedef vector<vlong> vl;\ntypedef vector<pll> vll;\n\n#ifdef forthright48\n #include <ctime>\n clock_t tStart = clock();\n #define debug(args...) {dbg,args; cerr<<endl;}\n #define timeStamp debug (\"Execution Time: \", (double)(clock() - tStart)/CLOCKS_PER_SEC)\n #define bug printf(\"%d\\n\",__LINE__);\n\n#else\n #define debug(args...) // Just strip off all debug tokens\n #define timeStamp\n#endif\n\nstruct debugger{\n template<typename T> debugger& operator , (const T& v){\n cerr<<v<<\" \";\n return *this;\n }\n}dbg;\n\ninline vlong gcd ( vlong a, vlong b ) {\n a = ABS ( a ); b = ABS ( b );\n while ( b ) { a = a % b; swap ( a, b ); } return a;\n}\n\nvlong ext_gcd ( vlong A, vlong B, vlong *X, vlong *Y ){\n vlong x2, y2, x1, y1, x, y, r2, r1, q, r;\n x2 = 1; y2 = 0;\n x1 = 0; y1 = 1;\n for (r2 = A, r1 = B; r1 != 0; r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y ) {\n q = r2 / r1;\n r = r2 % r1;\n x = x2 - (q * x1);\n y = y2 - (q * y1);\n }\n *X = x2; *Y = y2;\n return r2;\n}\n\ninline vlong modInv ( vlong a, vlong m ) {\n vlong x, y;\n ext_gcd( a, m, &x, &y );\n x %= m;\n if ( x < 0 ) x += m;\n return x;\n}\n\ninline vlong power ( vlong a, vlong p ) {\n vlong res = 1, x = a;\n while ( p ) {\n if ( p & 1 ) res = ( res * x );\n x = ( x * x ); p >>= 1;\n }\n return res;\n}\n\ninline vlong bigmod ( vlong a, vlong p, vlong m ) {\n vlong res = 1 % m, x = a % m;\n while ( p ) {\n if ( p & 1 ) res = ( res * x ) % m;\n x = ( x * x ) % m; p >>= 1;\n }\n return res;\n}\n\n\n//int knightDir[8][2] = { {-2,1},{-1,2},{1,2},{2,1},{2,-1},{-1,-2},{1,-2},{-2,-1} };\n//int dir4[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};\n//int dir8[8][2] = {{-1,0},{0,1},{1,0},{0,-1},{-1,-1},{1,1},{1,-1},{-1,1}};\nconst vlong inf = 2147383647;\nconst vlong mod = 1000000007;\nconst double pi = 2 * acos ( 0.0 );\nconst double eps = 1e-9;\n\n///====================== TEMPLATE ENDS HERE =====================///\n\n\n/** WARNING WARNING WARNING **/\n// 1. Simulate Sample Test Case Before Coding\n// 2. Read Input & Output Format Before Coding\n// 3. Check Corner Case Specially When N<3\n// 4. Check Array Size, Mod Value & Long Long\n// 5. Check DP1 Memoization Part & Call Parameters\n// 6. Check Problem No When Submitting\n\n\n\nint main () {\n #ifdef forthright48\n //freopen ( \"Ainput.txt\", \"r\", stdin );\n //freopen ( \"output.txt\", \"w\", stdout );\n #endif // forthright48\n\n //while(1){\n vlong n;\n scanf ( \"%lld\", &n );\n\n string s = \"\";\n\n vlong now = 1;\n while (n > 0) {\n\n //debug(n, s);\n\n if (now >= n) {\n vlong cur = now;\n while (cur > n) {\n s = ')' + s;\n cur--;\n }\n s = '(' + s;\n while (cur > 0) {\n s = ')' + s;\n cur--;\n }\n n = 0;\n }\n\n else {\n s = '(' + s;\n n -= now;\n }\n\n now++;\n\n }\n\n printf(\"%s\\n\", s.c_str());\n\n\n //}\n\n\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":3408,"score_of_the_acc":-0.1484,"final_rank":5},{"submission_id":"aoj_2783_2076012","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define pb push_back\n#define ll unsigned long long\n#define pii pair<int,int>\n#define uu first\n#define vv second\n#define INF 1000000000\n#define V 38\n\nbool used[100000001];\nvector<int>v;\n\nint pow10(int n)\n{\n int prod = 1;\n while(n--)prod*=10;\n return prod;\n}\n\nvoid rec(int koto,int konta,int hmm)\n{\n if(koto==0)\n {\n v.pb(hmm);\n return ;\n }\n if(konta==10)return;\n //for(int i=konta;i<=9;i++)\n rec(koto-1,konta+1,hmm+(konta)*pow10(koto-1));\n}\nbool is(int n)\n{\n int y = sqrt(n);\n for(int i=1;i<=y;i++)\n {\n if(n%i==0 and used[i])\n {\n int r = n/i;\n if(r!=i and used[r])return 1;\n }\n }\n return 0;\n}\n\nint main()\n{\n //cout<<num(122345678)<<endl;\n int n;\n cin>>n;\n if(n&1)\n {\n if(n==1)\n {\n cout<<\")(\\n\";\n return 0;\n }\n int m = (n-3)/2;\n cout<<\"))\";\n char ch[3]=\"()\";\n if(m<1000000)while(m--)cout<<ch;\n else\n {\n char ch[11] = \"()()()()()\";\n int r = m/5;\n while(r--)cout<<ch;\n r = m%5;\n while(r--)cout<<\"()\";\n }\n cout<<\"((\\n\";\n }\n else\n {\n cout<<\")(\";\n n--;\n if(n==1)\n {\n cout<<\")(\";\n return 0;\n }\n int m = (n-3)/2;\n cout<<\"))\";\n char ch[3]=\"()\";\n if(m<1000000)while(m--)cout<<ch;\n else\n {\n char ch[11] = \"()()()()()\";\n int r = m/5;\n while(r--)cout<<ch;\n r = m%5;\n while(r--)cout<<\"()\";\n }\n cout<<\"((\\n\";\n }\n}","accuracy":0.024096385542168676,"time_ms":1750,"memory_kb":3036,"score_of_the_acc":-1,"final_rank":18},{"submission_id":"aoj_2783_2059705","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n#define DEBUG(x) cerr << #x << \" \" << x << endl\nusing namespace std;\n \nint magic(int A) {\n for(int k = 0; ; ++k) {\n if(A <= k * (k + 1) / 2) return k;\n }\n return -1;\n}\n \nstring paren(int a, int n) {\n // DEBUG(a);\n // DEBUG(n);\n if(a == n * (n + 1) / 2) {\n string ret;\n REP(i,n) ret += \")\";\n REP(i,n) ret += \"(\";\n return ret;\n }\n else {\n int rem = a - n;\n int k = magic(rem);\n string ret = \")\";\n for(int i = 0; i < n - 1 - k; ++i) ret += \"()\";\n ret += paren(rem, k);\n ret += \"(\";\n return ret;\n }\n}\n \nsigned main() {\n int A; cin >> A;\n int k = magic(A);\n cout << paren(A, k) << endl;\n}","accuracy":1,"time_ms":520,"memory_kb":9632,"score_of_the_acc":-1.2931,"final_rank":10}],"string":"[\n {\n \"submission_id\": \"aoj_2783_4919488\",\n \"code_snippet\": \"#include <random>\\n#include \\\"bits/stdc++.h\\\"\\n//#include <atcoder/all>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nconstexpr ld eps = 1e-12;\\nconstexpr int inf = numeric_limits<int>::max() / 2;\\nconstexpr ll mod = 1e9 + 7;\\nmt19937_64 rnd{random_device()()};\\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 ll a;\\n cin >> a;\\n auto generate = [](int n) {\\n string s = \\\"\\\";\\n for (int i = 0; i < n; i++) s += ')';\\n for (int i = 0; i < n; i++) s += '(';\\n return s;\\n };\\n string ans = \\\"\\\";\\n for (ll i = 1; i <= a; i++) {\\n ll sum = i * (i + 1) / 2;\\n if (sum < a) continue;\\n ans = generate(i);\\n break;\\n }\\n ll x = ans.size() / 2;\\n ll diff = x * (x + 1) / 2 - a;\\n while (diff--) {\\n int sz = ans.size();\\n for (int i = 0; i < sz - 1; i++) {\\n if (ans[i] == ')' && ans[i + 1] == '(') {\\n swap(ans[i], ans[i + 1]);\\n break;\\n }\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.3015,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2783_3540943\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <cassert>\\n\\nusing namespace std;\\n\\nusing lint = long long;\\nusing ldouble = long double;\\n\\nstring rec(int A, int L) {\\n if (L <= 0) {\\n assert(A == 0);\\n return \\\"\\\";\\n }\\n\\n int D;\\n for (D = 0; D * (D + 1) / 2 < A; ++D) {}\\n\\n string ret;\\n for (int i = 0; i < L - D; ++i) ret += \\\"()\\\";\\n return ret + ')' + rec(A - D, D - 1) + '(';\\n}\\n\\nint main() {\\n int A;\\n cin >> A;\\n int D;\\n for (D = 1; D * (D + 1) / 2 < A; ++D) {}\\n cout << ')' + rec(A - D, D - 1) + '(' << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 530,\n \"memory_kb\": 8868,\n \"score_of_the_acc\": -1.183,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2783_3351167\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cstdio>\\n#include<cmath>\\n#include<cctype>\\n#include<math.h>\\n#include<string>\\n#include<string.h>\\n#include<stack>\\n#include<queue>\\n#include<vector>\\n#include<utility>\\n#include<set>\\n#include<map>\\n#include<stdlib.h>\\n#include<iomanip>\\n\\nusing namespace std;\\n\\n#define ll long long\\n#define ld long double\\n#define EPS 0.0000000001\\n#define INF 1e9\\n#define LINF (ll)INF*INF\\n#define MOD 1000000007\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define loop(i,a,n) for(int i=a;i<(n);i++)\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\n\\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\\n\\ntypedef vector<int> vi;\\ntypedef vector<string> vs;\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vp;\\n\\nint gcd(int a, int b){\\n if(b==0) return a;\\n return gcd(b,a%b);\\n}\\nint lcm(int a, int b){\\n return a*b/gcd(a,b);\\n}\\n\\nsigned main(void) {\\n int in;\\n cin >> in;\\n int n = 1;\\n while(!((n-1)*n < 2*in && 2*in <= n*(n+1)))n++;\\n string s = \\\"\\\";\\n rep(i,n)s = \\\")\\\" + s + \\\"(\\\";\\n int t = n*(n+1)/2-in;\\n swap(s[n], s[n-t]);\\n cout << s << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.1402,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2783_2502338\",\n \"code_snippet\": \"#include<iostream>\\n\\n#include<cstring>\\n#include<cstdio>\\n#include<algorithm>\\n#include<vector>\\n#include<map>\\n#define set(x,y) memset(x,y,sizeof(x))\\n#define scan(x) scanf(\\\"%d\\\",&x)\\n#define For(x,y,z) for(int x=y;x<=z;x++)\\nusing namespace std;\\n\\nconst int MAXN = 100010;\\n\\nint get(int n)\\n{\\n int i=1;\\n for( i=1;i<=100000;i++)\\n {\\n if(n<=((i+1)*i/2))\\n return i;\\n }\\n}\\nlong long getmax(int n,int maxn)\\n{\\n long long ans=0;\\n for(int i=maxn-n+1;i<=maxn;i++)\\n ans+=i;\\n\\n return ans;\\n}\\nint main()\\n{\\n int n;\\n cin>>n;\\n int pairs=get(n);\\n // cout<<pairs<<endl;\\n long sumright=((pairs*2*(pairs*2+1))/2-pairs)/2+pairs;\\n sumright-=n;//\\n long sumleft=(pairs*2+1)*2*pairs/2-sumright;\\n //cout<<sumleft<<endl;\\n int cnt=0;\\n bool a[MAXN];\\n set(a,0);\\n for(int i=1;i<=2*pairs;i++)\\n {\\n if(cnt==pairs)\\n break;\\n if((sumleft-i>i||(sumleft-i==0))&&((sumleft-i)<=getmax(pairs-cnt-1,2*pairs)))\\n {\\n // cout<<getmax(pairs-cnt-1,2*pairs)<<endl;\\n cnt++;\\n sumleft-=i;\\n a[i]=1;\\n }\\n }\\n for(int i=1;i<=2*pairs;i++)\\n if(a[i])\\n {\\n cout<<'(';\\n }\\n else\\n cout<<')';\\n\\n cout<<endl;\\n //out(n);\\n return 0;\\n}\",\n \"accuracy\": 0.024096385542168676,\n \"time_ms\": 460,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.2792,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2783_2476200\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<iostream>\\n#include<algorithm>\\n#include<cmath>\\nusing namespace std;\\nvoid work(int n)\\n{\\n\\tn=(n+1)>>1;\\n\\tint tmp=n;\\n\\twhile(tmp>=10)\\n\\t{\\n\\t\\ttmp-=10;\\n\\t\\tprintf(\\\"))))))))))\\\");\\n\\t}\\n\\tfor(int i=1;i<=tmp;++i)\\n\\tprintf(\\\")\\\");\\n\\twhile(n>=10)\\n\\t{\\n\\t\\tn-=10;\\n\\t\\tprintf(\\\"((((((((((\\\");\\n\\t}\\n\\tfor(int i=1;i<=n;++i)\\n\\tprintf(\\\"(\\\");\\n\\tprintf(\\\"\\\\n\\\");\\n}\\nint main()\\n{\\n\\tint n;\\n\\tscanf(\\\"%d\\\",&n);\\n\\tif(!(n&1))\\n\\t{\\n\\t\\tprintf(\\\")(\\\");n--;\\n\\t}\\n\\t\\n\\twork(n);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.024096385542168676,\n \"time_ms\": 1540,\n \"memory_kb\": 3136,\n \"score_of_the_acc\": -0.8945,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2783_2407518\",\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 each(itr,v) for(auto itr:v)\\n#define pb push_back\\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_popcount\\n\\n#define INF INT_MAX/3\\n\\nll n;\\nstring res;\\n\\nint main(){\\n\\tcin.sync_with_stdio(false);\\n cin>>n;\\n ll sum=0;\\n repl(i,1,n+1){\\n ll nxt=i+1;\\n if(nxt*(nxt+1)/2>n){\\n n-=i*(i+1)/2;\\n string tmp;\\n rep(j,i)tmp='('+tmp;\\n rep(j,i)tmp=')'+tmp;\\n if(n>0){\\n res=\\\")\\\"+tmp.substr(0,n-1)+\\\"(\\\"+tmp.substr(n-1,tmp.size()-n+1);\\n }else res=tmp;\\n break;\\n }\\n }\\n cout<<res<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.1314,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2783_2406706\",\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 each(itr,v) for(auto itr:v)\\n#define pb push_back\\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_popcount\\n\\n#define INF INT_MAX/3\\n\\nll n;\\nstring res;\\n\\nint main(){\\n\\tcin.sync_with_stdio(false);\\n cin>>n;\\n while(n>0){\\n repl(i,1,n+1){\\n ll nxt=i+1;\\n if(nxt*(nxt+1)/2>n){\\n n-=i*(i+1)/2;\\n rep(j,i)res='('+res;\\n rep(j,i)res=')'+res;\\n break;\\n }\\n }\\n }\\n cout<<res<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.024096385542168676,\n \"time_ms\": 110,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.0957,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2783_2270842\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define N 100010\\n\\nusing namespace std;\\n\\nconst int inf = 0x3f3f3f3f;\\nmap<int,int>Map;\\nint a[N],k;\\nchar s[N];\\nint main()\\n{\\n int n,x = 0;\\n for( k = 1; x <= 1000000000; k++)\\n {\\n x += k;\\n Map[x] = k;\\n a[k] = x;\\n }\\n scanf(\\\"%d\\\",&n);\\n if(Map.find(n) != Map.end())\\n {\\n for(int i = 1; i <= Map[n]; i++)\\n printf(\\\")\\\");\\n for(int i = 1; i <= Map[n]; i++)\\n printf(\\\"(\\\");\\n printf(\\\"\\\\n\\\");\\n }\\n else\\n {\\n int x = n;\\n while(Map.find(x) == Map.end())x++;\\n int l = x;\\n x = Map[x];\\n n = l - n;\\n for(int i = 1; i <= 2*x; i++)\\n if(i <= x)s[i] = ')';\\n else s[i] = '(';\\n s[x*2+1] = '\\\\0';\\n while(n --)\\n {\\n swap(s[x],s[x+1]);\\n x--;\\n }\\n puts(s+1);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5508,\n \"score_of_the_acc\": -0.3748,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2783_2146044\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\nusing namespace std;\\n#define REP(i,n) for(int i=0; i<n; ++i)\\nint a,i,p;\\nint main() {\\n cin >> a;\\n while (p < a){\\n i++;\\n p += i;\\n }\\n string s;\\n REP(j,i) s = s + ')';\\n REP(j,i) s = s + '(';\\n swap(s[i], s[i-p+a]);\\n cout << s << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.1414,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2783_2146042\",\n \"code_snippet\": \"#include <iostream>\\n#include <fstream>\\n#include <cstdio>\\n#include <cmath>\\n#include <vector>\\n#include <cstring>\\n#include <string>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <algorithm>\\nusing namespace std;\\n \\n#define REP(i,n) for(int i=0; i<n; ++i)\\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\\n \\ntypedef long long ll;\\ntypedef vector<int> VI;\\ntypedef vector<ll> VL;\\ntypedef vector<VI> VVI;\\ntypedef pair<int,int> P;\\ntypedef pair<ll,ll> PL;\\n\\nint main() {\\n int a;\\n cin >> a;\\n int i = 0, p = 0;\\n while (p < a){\\n i++;\\n p += i;\\n }\\n string ans;\\n REP(j,i) ans = ans + ')';\\n REP(j,i) ans = ans + '(';\\n int j = i - (p - a);\\n swap(ans[i], ans[j]);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.1414,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2783_2146029\",\n \"code_snippet\": \"#include <iostream>\\n#include <fstream>\\n#include <cstdio>\\n#include <cmath>\\n#include <vector>\\n#include <cstring>\\n#include <string>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <algorithm>\\nusing namespace std;\\n \\n#define REP(i,n) for(int i=0; i<n; ++i)\\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\\n \\ntypedef long long ll;\\ntypedef vector<int> VI;\\ntypedef vector<ll> VL;\\ntypedef vector<VI> VVI;\\ntypedef pair<int,int> P;\\ntypedef pair<ll,ll> PL;\\n\\nint main() {\\n int a;\\n cin >> a;\\n VI x;\\n int p = 0;\\n for (int i = 1; p <= a; i++){\\n p += i;\\n x.push_back(p);\\n }\\n string ans;\\n while (a){\\n int i = 0;\\n while (i < x.size()-1 && x[i+1] <= a) i++;\\n a -= x[i];\\n REP(j,i+1) ans = \\\"(\\\" + ans;\\n REP(j,i+1) ans = \\\")\\\" + ans;\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.024096385542168676,\n \"time_ms\": 120,\n \"memory_kb\": 3276,\n \"score_of_the_acc\": -0.0996,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2783_2132919\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n ll A;\\n cin >> A;\\n ll i = 1;\\n while((i + 1) * i / 2 < A) {\\n ++i;\\n }\\n string res = \\\"()\\\";\\n for(int j=0; j<i-1; ++j) {\\n res += ')';\\n }\\n for(int j=0; j<i-1; ++j) {\\n res += '(';\\n }\\n A -= i * (i-1) / 2;\\n for(int j=0; j<A; ++j) {\\n for(int k=0; k<res.size()-1; ++k) {\\n if(res[k] == '(' && res[k+1] == ')') {\\n swap(res[k], res[k+1]);\\n break;\\n }\\n }\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.4792,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2783_2085260\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define mx 10000000\\n#define m 44722\\n\\nint ar[m+5],num;\\n\\n\\nint main()\\n{\\n int val = 0,in=0;\\n for(int i=1;i<mx;i++){\\n\\n //if(in>44715) cout<<val<<\\\" \\\"<<in<<endl;\\n val+=i;\\n if(in==44721+1) break;\\n ar[++in] = val;\\n\\n }\\n //cout<<in<<\\\" \\\"<<ar[in];\\n scanf(\\\"%d\\\",&num);\\n\\n if(num==1){\\n cout<<\\\")(\\\"<<endl;\\n return 0;\\n }\\n else if(num==2){\\n cout<<\\\")()(\\\"<<endl;\\n return 0;\\n }\\n else if(num==3){\\n cout<<\\\"))((\\\"<<endl;\\n return 0;\\n }\\n\\n int idx;\\n for(int i=1;i<=m;i++){\\n if(num<=ar[i]){\\n idx = i;\\n break;\\n }\\n }\\n //cout<<idx<<endl;\\n int n = idx;\\n\\n char x[idx*2+5];\\n\\n for(int i=1;i<=idx*2;i++){\\n if(i%2==0) x[i] = '(';\\n else x[i] = ')';\\n //printf(\\\"%c\\\",x[i]);\\n }\\n //cout<<endl;\\n\\n int hi = idx*2;\\n int lo = 1;\\n\\n for(int i=1;i<=num;i++){\\n\\n lo++;\\n hi--;\\n int l=lo,h=hi;\\n int loop = hi-lo+1;\\n //cout<<loop<<endl;\\n for(int j=1;j<=loop/2;j++){\\n\\n swap(x[h],x[h-1]);\\n n++;\\n if(n==num){\\n for(int k=1;k<=idx*2;k++) printf(\\\"%c\\\",x[k]);\\n cout<<endl;\\n return 0;\\n }\\n h-=2;\\n }\\n /*if(hi-lo==1){\\n for(int k=1;k<=idx*2;k++) printf(\\\"%c\\\",x[k]);\\n cout<<endl;\\n return 0;\\n }*/\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.024096385542168676,\n \"time_ms\": 610,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.3861,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2783_2085258\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define mx 10000000\\n#define m 44722\\n\\nint ar[m+5],num;\\n\\nint srch(int i,int j)\\n{\\n if(j-i==1){\\n if(ar[i]==num) return i;\\n else return j;\\n }\\n int mid = (i+j)/2;\\n if(ar[mid]==num) return mid;\\n\\n if(num>ar[mid]) srch(mid,j);\\n else if(num<ar[mid]) srch(i,mid);\\n}\\nint main()\\n{\\n int val = 0,in=0;\\n for(int i=1;i<mx;i++){\\n\\n //if(in>44715) cout<<val<<endl;\\n val+=i;\\n if(in==44721+1) break;\\n ar[++in] = val;\\n\\n }\\n //cout<<in<<\\\" \\\"<<ar[in];\\n scanf(\\\"%d\\\",&num);\\n\\n if(num==1){\\n cout<<\\\")(\\\"<<endl;\\n return 0;\\n }\\n else if(num==2){\\n cout<<\\\")()(\\\"<<endl;\\n return 0;\\n }\\n else if(num==3){\\n cout<<\\\"))((\\\"<<endl;\\n return 0;\\n }\\n\\n int idx = srch(1,m);\\n\\n int n = idx;\\n\\n char x[idx*2+5];\\n\\n for(int i=1;i<=idx*2;i++){\\n if(i%2==0) x[i] = '(';\\n else x[i] = ')';\\n }\\n\\n int hi = idx*2;\\n int lo = 1;\\n\\n for(int i=1;i<=num;i++){\\n\\n lo++;\\n hi--;\\n int l=lo,h=hi;\\n int loop = hi-lo+1;\\n //cout<<loop<<endl;\\n for(int j=1;j<=loop/2;j++){\\n\\n swap(x[h],x[h-1]);\\n n++;\\n if(n==num){\\n for(int k=1;k<=idx*2;k++) printf(\\\"%c\\\",x[k]);\\n cout<<endl;\\n return 0;\\n }\\n h-=2;\\n }\\n if(hi-lo==1){\\n for(int k=1;k<=idx*2;k++) printf(\\\"%c\\\",x[k]);\\n cout<<endl;\\n return 0;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.024096385542168676,\n \"time_ms\": 670,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.4254,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2783_2076159\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nstring s;\\n\\nint main()\\n{\\n\\n long long i,j,k,l,m,n,o,p;\\n\\n char sf[10005],sb[10005];\\n for(i=0;i<10000;i++)\\n {\\n sf[i]='(';\\n sb[i]=')';\\n }\\n sf[10000]='\\\\0';\\n sb[10000]='\\\\0';\\n\\n cin>>n;\\n\\n if(n==1)\\n {\\n printf(\\\")(\\\\n\\\");\\n return 0;\\n }\\n\\n int number=(n/3);\\n\\n if(n%3!=0)\\n number++;\\n\\n long long lim=number*3;\\n long long check=lim-n;\\n\\n number++;\\n\\n if(check==1)\\n {\\n for(i=0; i<number-1; i++)\\n {\\n if(i+10000<number-1)\\n {printf(\\\"%s\\\",sb);i+=10000;}\\n else\\n printf(\\\")\\\");\\n }\\n printf(\\\"()\\\");\\n for(i=0; i<number-1; i++)\\n {\\n if(i+10000<number-1)\\n {printf(\\\"%s\\\",sf);i+=10000;}\\n else\\n printf(\\\"(\\\");\\n\\n }\\n //printf(\\\"(\\\");\\n\\n printf(\\\"\\\\n\\\");\\n }\\n\\n else if(check==0)\\n {\\n for(i=0; i<number; i++)\\n if(i+10000<number-1)\\n {printf(\\\"%s\\\",sb);i+=10000;}\\n else\\n printf(\\\")\\\");\\n//printf(\\\"()\\\");\\n for(i=0; i<number; i++)\\n if(i+10000<number-1)\\n {printf(\\\"%s\\\",sf);i+=10000;}\\n else\\n printf(\\\"(\\\");\\n\\n printf(\\\"\\\\n\\\");\\n }\\n else if(check==2)\\n {\\n for(i=0; i<number-2; i++)\\n if(i+10000<number-1)\\n {printf(\\\"%s\\\",sb);i+=10000;}\\n else\\n printf(\\\")\\\");\\n printf(\\\"())\\\");\\n for(i=0; i<number-1; i++)\\n if(i+10000<number-1)\\n {printf(\\\"%s\\\",sf);i+=10000;}\\n else\\n printf(\\\"(\\\");\\n printf(\\\"\\\\n\\\");\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.024096385542168676,\n \"time_ms\": 420,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.2769,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2783_2076103\",\n \"code_snippet\": \"//#include <bits/stdc++.h>\\n#include<cstdio>\\n#include<cstring>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<stack>\\n#include<vector>\\n#include<deque>\\n#include<functional>\\n#include<string>\\n#include<iostream>\\n#include<cctype>\\n#include<set>\\n#include<climits>\\n#include<iomanip>\\n#include<cassert>\\n#include<sstream>\\n\\n#define pb push_back\\n#define nl puts (\\\"\\\")\\n#define sp printf ( \\\" \\\" )\\n#define phl printf ( \\\"hello\\\\n\\\" )\\n#define ff first\\n#define ss second\\n#define POPCOUNT __builtin_popcountll\\n#define RIGHTMOST __builtin_ctzll\\n#define LEFTMOST(x) (63-__builtin_clzll((x)))\\n#define MP make_pair\\n#define FOR(i,x,y) for(vlong i = (x) ; i <= (y) ; ++i)\\n#define ROF(i,x,y) for(vlong i = (y) ; i >= (x) ; --i)\\n#define CLR(x,y) memset(x,y,sizeof(x))\\n#define UNIQUE(V) (V).erase(unique((V).begin(),(V).end()),(V).end())\\n#define MIN(a,b) ((a)<(b)?(a):(b))\\n#define MAX(a,b) ((a)>(b)?(a):(b))\\n#define NUMDIGIT(x,y) (((vlong)(log10((x))/log10((y))))+1)\\n#define SQ(x) ((x)*(x))\\n#define ABS(x) ((x)<0?-(x):(x))\\n#define FABS(x) ((x)+eps<0?-(x):(x))\\n#define ALL(x) (x).begin(),(x).end()\\n#define LCM(x,y) (((x)/gcd((x),(y)))*(y))\\n#define SZ(x) ((vlong)(x).size())\\n#define NORM(x) if(x>=mod) x-=mod;if(x<0) x+=mod;\\n#define MOD(x,y) (((x)*(y))%mod)\\n#define ODD(x) (((x)&1)==0?(0):(1))\\n#define Set(N,cur) N=(N|(1LL<<cur))\\n#define Reset(N,cur) N=(N&(~(1LL<<cur)))\\n#define Check(N,cur) (!((N&(1LL<<cur))==0))\\n#define fast_cin ios_base::sync_with_stdio(false);cin.tie(NULL)\\n\\nusing namespace std;\\n\\n\\n#define LL long long\\n#define LLU long long unsigned int\\ntypedef long long vlong;\\ntypedef unsigned long long uvlong;\\ntypedef pair < int, int > pii;\\ntypedef pair < vlong, vlong > pll;\\ntypedef vector<int> vi;\\ntypedef vector<vlong> vl;\\ntypedef vector<pll> vll;\\n\\n#ifdef forthright48\\n #include <ctime>\\n clock_t tStart = clock();\\n #define debug(args...) {dbg,args; cerr<<endl;}\\n #define timeStamp debug (\\\"Execution Time: \\\", (double)(clock() - tStart)/CLOCKS_PER_SEC)\\n #define bug printf(\\\"%d\\\\n\\\",__LINE__);\\n\\n#else\\n #define debug(args...) // Just strip off all debug tokens\\n #define timeStamp\\n#endif\\n\\nstruct debugger{\\n template<typename T> debugger& operator , (const T& v){\\n cerr<<v<<\\\" \\\";\\n return *this;\\n }\\n}dbg;\\n\\ninline vlong gcd ( vlong a, vlong b ) {\\n a = ABS ( a ); b = ABS ( b );\\n while ( b ) { a = a % b; swap ( a, b ); } return a;\\n}\\n\\nvlong ext_gcd ( vlong A, vlong B, vlong *X, vlong *Y ){\\n vlong x2, y2, x1, y1, x, y, r2, r1, q, r;\\n x2 = 1; y2 = 0;\\n x1 = 0; y1 = 1;\\n for (r2 = A, r1 = B; r1 != 0; r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y ) {\\n q = r2 / r1;\\n r = r2 % r1;\\n x = x2 - (q * x1);\\n y = y2 - (q * y1);\\n }\\n *X = x2; *Y = y2;\\n return r2;\\n}\\n\\ninline vlong modInv ( vlong a, vlong m ) {\\n vlong x, y;\\n ext_gcd( a, m, &x, &y );\\n x %= m;\\n if ( x < 0 ) x += m;\\n return x;\\n}\\n\\ninline vlong power ( vlong a, vlong p ) {\\n vlong res = 1, x = a;\\n while ( p ) {\\n if ( p & 1 ) res = ( res * x );\\n x = ( x * x ); p >>= 1;\\n }\\n return res;\\n}\\n\\ninline vlong bigmod ( vlong a, vlong p, vlong m ) {\\n vlong res = 1 % m, x = a % m;\\n while ( p ) {\\n if ( p & 1 ) res = ( res * x ) % m;\\n x = ( x * x ) % m; p >>= 1;\\n }\\n return res;\\n}\\n\\n\\n//int knightDir[8][2] = { {-2,1},{-1,2},{1,2},{2,1},{2,-1},{-1,-2},{1,-2},{-2,-1} };\\n//int dir4[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};\\n//int dir8[8][2] = {{-1,0},{0,1},{1,0},{0,-1},{-1,-1},{1,1},{1,-1},{-1,1}};\\nconst vlong inf = 2147383647;\\nconst vlong mod = 1000000007;\\nconst double pi = 2 * acos ( 0.0 );\\nconst double eps = 1e-9;\\n\\n///====================== TEMPLATE ENDS HERE =====================///\\n\\n\\n/** WARNING WARNING WARNING **/\\n// 1. Simulate Sample Test Case Before Coding\\n// 2. Read Input & Output Format Before Coding\\n// 3. Check Corner Case Specially When N<3\\n// 4. Check Array Size, Mod Value & Long Long\\n// 5. Check DP1 Memoization Part & Call Parameters\\n// 6. Check Problem No When Submitting\\n\\n\\n\\nint main () {\\n #ifdef forthright48\\n //freopen ( \\\"Ainput.txt\\\", \\\"r\\\", stdin );\\n //freopen ( \\\"output.txt\\\", \\\"w\\\", stdout );\\n #endif // forthright48\\n\\n //while(1){\\n vlong n;\\n scanf ( \\\"%lld\\\", &n );\\n\\n string s = \\\"\\\";\\n\\n vlong now = 1;\\n while (n > 0) {\\n\\n //debug(n, s);\\n\\n if (now >= n) {\\n vlong cur = now;\\n while (cur > n) {\\n s = ')' + s;\\n cur--;\\n }\\n s = '(' + s;\\n while (cur > 0) {\\n s = ')' + s;\\n cur--;\\n }\\n n = 0;\\n }\\n\\n else {\\n s = '(' + s;\\n n -= now;\\n }\\n\\n now++;\\n\\n }\\n\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n\\n\\n //}\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3408,\n \"score_of_the_acc\": -0.1484,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2783_2076012\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define pb push_back\\n#define ll unsigned long long\\n#define pii pair<int,int>\\n#define uu first\\n#define vv second\\n#define INF 1000000000\\n#define V 38\\n\\nbool used[100000001];\\nvector<int>v;\\n\\nint pow10(int n)\\n{\\n int prod = 1;\\n while(n--)prod*=10;\\n return prod;\\n}\\n\\nvoid rec(int koto,int konta,int hmm)\\n{\\n if(koto==0)\\n {\\n v.pb(hmm);\\n return ;\\n }\\n if(konta==10)return;\\n //for(int i=konta;i<=9;i++)\\n rec(koto-1,konta+1,hmm+(konta)*pow10(koto-1));\\n}\\nbool is(int n)\\n{\\n int y = sqrt(n);\\n for(int i=1;i<=y;i++)\\n {\\n if(n%i==0 and used[i])\\n {\\n int r = n/i;\\n if(r!=i and used[r])return 1;\\n }\\n }\\n return 0;\\n}\\n\\nint main()\\n{\\n //cout<<num(122345678)<<endl;\\n int n;\\n cin>>n;\\n if(n&1)\\n {\\n if(n==1)\\n {\\n cout<<\\\")(\\\\n\\\";\\n return 0;\\n }\\n int m = (n-3)/2;\\n cout<<\\\"))\\\";\\n char ch[3]=\\\"()\\\";\\n if(m<1000000)while(m--)cout<<ch;\\n else\\n {\\n char ch[11] = \\\"()()()()()\\\";\\n int r = m/5;\\n while(r--)cout<<ch;\\n r = m%5;\\n while(r--)cout<<\\\"()\\\";\\n }\\n cout<<\\\"((\\\\n\\\";\\n }\\n else\\n {\\n cout<<\\\")(\\\";\\n n--;\\n if(n==1)\\n {\\n cout<<\\\")(\\\";\\n return 0;\\n }\\n int m = (n-3)/2;\\n cout<<\\\"))\\\";\\n char ch[3]=\\\"()\\\";\\n if(m<1000000)while(m--)cout<<ch;\\n else\\n {\\n char ch[11] = \\\"()()()()()\\\";\\n int r = m/5;\\n while(r--)cout<<ch;\\n r = m%5;\\n while(r--)cout<<\\\"()\\\";\\n }\\n cout<<\\\"((\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 0.024096385542168676,\n \"time_ms\": 1750,\n \"memory_kb\": 3036,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2783_2059705\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\n#define DEBUG(x) cerr << #x << \\\" \\\" << x << endl\\nusing namespace std;\\n \\nint magic(int A) {\\n for(int k = 0; ; ++k) {\\n if(A <= k * (k + 1) / 2) return k;\\n }\\n return -1;\\n}\\n \\nstring paren(int a, int n) {\\n // DEBUG(a);\\n // DEBUG(n);\\n if(a == n * (n + 1) / 2) {\\n string ret;\\n REP(i,n) ret += \\\")\\\";\\n REP(i,n) ret += \\\"(\\\";\\n return ret;\\n }\\n else {\\n int rem = a - n;\\n int k = magic(rem);\\n string ret = \\\")\\\";\\n for(int i = 0; i < n - 1 - k; ++i) ret += \\\"()\\\";\\n ret += paren(rem, k);\\n ret += \\\"(\\\";\\n return ret;\\n }\\n}\\n \\nsigned main() {\\n int A; cin >> A;\\n int k = magic(A);\\n cout << paren(A, k) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 9632,\n \"score_of_the_acc\": -1.2931,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":1672,"cells":{"group_id":{"kind":"string","value":"aoj_2784_cpp"},"problem_description":{"kind":"string","value":"Similarity of Subtrees\nDefine the depth of a node in a rooted tree by applying the following rules recursively:\nThe depth of a root node is 0.\nThe depths of child nodes whose parents are with depth $d$ are $d + 1$.\nLet $S(T, d)$ be the number of nodes of $T$ with depth $d$. Two rooted trees $T$ and $T'$ are similar if and only if $S(T, d)$ equals $S(T', d)$ for all non-negative integer $d$.\nYou are given a rooted tree $T$ with $N$ nodes. The nodes of $T$ are numbered from 1 to $N$. Node 1 is the root node of $T$. Let $T_i$ be the rooted subtree of $T$ whose root is node $i$. Your task is to write a program which calculates the number of pairs $(i, j)$ such that $T_i$ and $T_j$ are similar and $i < j$.\nInput\nThe input consists of a single test case.\n$N$\n$a_1$ $b_1$\n$a_2$ $b_2$\n...\n$a_{N-1}$ $b_{N-1}$\nThe first line contains an integer $N$ ($1 \\leq N \\leq 100,000$), which is the number of nodes in a tree. The following $N -1$ lines give information of branches: the $i$-th line of them contains $a_i$ and $b_i$, which indicates that a node $a_i$ is a parent of a node $b_i$. ($1 \\leq a_i, b_i \\leq N, a_i \\ne b_i$) The root node is numbered by 1. It is guaranteed that a given graph is a rooted tree, i.e. there is exactly one parent for each node except the node 1, and the graph is connected.\nOutput\nPrint the number of the pairs $(x, y)$ of the nodes such that the subtree with the root $x$ and the subtree with the root $y$ are similar and $x < y$.\nSample Input 1\n5\n1 2\n1 3\n1 4\n1 5\nOutput for the Sample Input 1\n6\nSample Input 2\n6\n1 2\n2 3\n3 4\n1 5\n5 6\nOutput for the Sample Input 2\n2\nSample Input 3\n13\n1 2\n1 3\n2 4\n2 5\n3 6\n3 7\n4 8\n4 9\n6 10\n7 11\n8 12\n11 13\nOutput for the Sample Input 3\n14"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2784_10946041","code_snippet":"#include <bits/stdtr1c++.h>\n\n#define MAX 100100\n#define clr(ar) memset(ar, 0, sizeof(ar))\n#define read() freopen(\"lol.txt\", \"r\", stdin)\n#define dbg(x) cout << #x << \" = \" << x << endl\n\nusing namespace std;\n\nconst unsigned long long base = 666666667;\n\nint n, depth[MAX];\nvector <int> adj[MAX];\nunsigned long long dp[MAX], power[MAX];\ntr1::unordered_map <unsigned long long, int> mp;\n\nvoid dfs(int i, int p){\n depth[i] = 1;\n int j, k, d, x, len = adj[i].size();\n\n for (j = 0; j < len; j++){\n x = adj[i][j];\n if (x != p){\n dfs(x, i);\n depth[i] = max(depth[i], depth[x] + 1);\n }\n }\n\n d = depth[i] - 1;\n unsigned long long h = 0;\n for (j = 0; j < len; j++){\n x = adj[i][j];\n if (x != p){\n unsigned long long r = dp[x] * power[d - depth[x]];\n h += r;\n }\n }\n\n h += power[depth[i]];\n dp[i] = h;\n mp[h]++;\n}\n\nint main(){\n int i, j, k, l, a, b;\n\n power[0] = 1;\n for (i = 1; i < MAX; i++) power[i] = power[i - 1] * base;\n\n while (scanf(\"%d\", &n) != EOF){\n mp.clear();\n for (i = 0; i < MAX; i++) adj[i].clear();\n\n for (i = 1; i < n; i++){\n scanf(\"%d %d\", &a, &b);\n adj[a].push_back(b);\n adj[b].push_back(a);\n }\n\n dfs(1, 1);\n long long res = 0;\n for (auto it: mp){\n long long x = it.second;\n res += ((x * (x - 1)) >> 1);\n }\n\n printf(\"%lld\\n\", res);\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":24036,"score_of_the_acc":-0.3201,"final_rank":3},{"submission_id":"aoj_2784_9946345","code_snippet":"#include <iostream>\n#include <random>\n#include <vector>\n#include <algorithm>\nstruct Mint {\n using Value = unsigned long long;\n static constexpr Value MOD{(1uLL << 61) - 1};\n static constexpr Value MASK30{(1ull << 30) - 1};\n static constexpr Value MASK31{(1ull << 31) - 1};\n constexpr Mint() {}\n static constexpr Value Mod() noexcept {\n return MOD;\n }\n static constexpr Value Modulo(Value v) noexcept {\n Value res{(v >> 61) + (v & MOD)};\n res = (res >= MOD ? res - MOD : res);\n return res;\n }\n static constexpr Value UnsafeMul(Value a, Value b) noexcept {\n Value fa{a >> 31}, fb{b >> 31};\n Value ba{a & MASK31}, bb{b & MASK31};\n Value mid{fa * bb + fb * ba};\n return Value{2} * fa * fb + (mid >> 30) + ((mid & MASK30) << 31) + ba * bb;\n }\n static constexpr Value Mul(Value a, Value b) noexcept {\n return Modulo(UnsafeMul(a, b));\n }\n};\nconst unsigned long long B{std::mt19937{std::random_device{}()}() % Mint::Mod()};\nint N;\nstd::vector<int> G[100010];\nlong long solve() {\n std::vector<long long> hash(N);\n auto rec{[&](auto rec, int v, int p) -> long long {\n long long h{};\n for (auto x : G[v]) if (x != p) {\n h = Mint::Modulo(h + rec(rec, x, v));\n }\n h = Mint::Mul(h, B);\n h = Mint::Modulo(h + 1);\n return hash[v] = h;\n }};\n rec(rec, 0, -1);\n //for (auto h : hash) std::cout << h << ' ';\n //std::cout << std::endl;\n std::sort(hash.begin(), hash.end());\n long long ans{};\n for (int i{}, j{} ; i < N ; i = j) {\n while (j < N and hash[i] == hash[j]) j++;\n ans += (long long)(j - i) * (j - i - 1) / 2;\n }\n return ans;\n}\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n std::cin >> N;\n for (int i{} ; i < N - 1 ; i++) {\n int a, b;\n std::cin >> a >> b;\n a--; b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n std::cout << solve() << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":18660,"score_of_the_acc":-0.2494,"final_rank":1},{"submission_id":"aoj_2784_9727759","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nnamespace Random {\nmt19937_64 randgen(chrono::steady_clock::now().time_since_epoch().count());\nusing u64 = unsigned long long;\nu64 get() {\n return randgen();\n}\ntemplate <typename T> T get(T L) { // [0,L]\n\n return get() % (L + 1);\n}\ntemplate <typename T> T get(T L, T R) { // [L,R]\n\n return get(R - L) + L;\n}\ndouble uniform() {\n return double(get(1000000000)) / 1000000000;\n}\nstring str(int n) {\n string ret;\n rep(i, 0, n) ret += get('a', 'z');\n return ret;\n}\ntemplate <typename Iter> void shuffle(Iter first, Iter last) {\n if (first == last)\n return;\n int len = 1;\n for (auto it = first + 1; it != last; it++) {\n len++;\n int j = get(0, len - 1);\n if (j != len - 1)\n iter_swap(it, first + j);\n }\n}\ntemplate <typename T> vector<T> select(int n, T L, T R) { // [L,R]\n\n if (n * 2 >= R - L + 1) {\n vector<T> ret(R - L + 1);\n iota(ALL(ret), L);\n shuffle(ALL(ret));\n ret.resize(n);\n return ret;\n } else {\n unordered_set<T> used;\n vector<T> ret;\n while (SZ(used) < n) {\n T x = get(L, R);\n if (!used.count(x)) {\n used.insert(x);\n ret.push_back(x);\n }\n }\n return ret;\n }\n}\n\nvoid relabel(int n, vector<pair<int, int>> &es) {\n shuffle(ALL(es));\n vector<int> ord(n);\n iota(ALL(ord), 0);\n shuffle(ALL(ord));\n for (auto &[u, v] : es)\n u = ord[u], v = ord[v];\n}\ntemplate <bool directed, bool simple> vector<pair<int, int>> genGraph(int n) {\n vector<pair<int, int>> cand, es;\n rep(u, 0, n) rep(v, 0, n) {\n if (simple and u == v)\n continue;\n if (!directed and u > v)\n continue;\n cand.push_back({u, v});\n }\n int m = get(SZ(cand));\n vector<int> ord;\n if (simple)\n ord = select(m, 0, SZ(cand) - 1);\n else {\n rep(_, 0, m) ord.push_back(get(SZ(cand) - 1));\n }\n for (auto &i : ord)\n es.push_back(cand[i]);\n relabel(n, es);\n return es;\n}\nvector<pair<int, int>> genTree(int n) {\n vector<pair<int, int>> es;\n rep(i, 1, n) es.push_back({get(i - 1), i});\n relabel(n, es);\n return es;\n}\n}; // namespace Random\n\n\n/**\n * @brief Random\n */\n\nint main() {\n int N;\n cin >> N;\n vector<vector<int>> G(N);\n rep(i,0,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 vector<ll> Hash(N);\n ll base = Random::get((ull)1e8,(ull)1e9);\n ll MOD = 998244353;\n auto DFS = [&](auto self, int V, int P) -> ll {\n ll Ret = 0;\n for(int NV : G[V]) {\n if (NV == P) continue;\n Ret += self(self,NV,V);\n Ret %= MOD;\n }\n Ret *= base;\n Ret++;\n return Hash[V] = Ret % MOD;\n };\n DFS(DFS,0,-1);\n map<ll,int> mp;\n ll ANS = 0;\n rep(i,0,N) {\n ANS += mp[Hash[i]];\n mp[Hash[i]]++;\n }\n cout << ANS << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":26584,"score_of_the_acc":-0.6393,"final_rank":11},{"submission_id":"aoj_2784_9669065","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nint main(){\n ll N;cin>>N;\n vvi E(N);\n REP(i,N-1){\n int a,b;cin>>a>>b;a--;b--;\n E[a].emplace_back(b);\n E[b].emplace_back(a);\n }\n srand(time(NULL));\n ll base=rand()%rand();\n const vi mod={998244353,1000000007,1000000009};\n vvi pow(3,vi(2e6,1));\n FOR(i,1,2e6){\n REP(j,3)pow[j][i]=pow[j][i-1]*(base%mod[j])%mod[j];\n }\n vi S(N,1),D(N),max_depth(N),P(N);\n function<void(ll)>dfs=[&](ll v){\n for(auto u:E[v])if(u!=P[v]){\n P[u]=v;\n D[u]=D[v]+1;\n dfs(u);\n S[v]+=S[u];\n max_depth[v]=max(max_depth[u]+1,max_depth[v]);\n }\n };\n map<tuple<ll,ll,ll,ll,ll>,ll>memo;\n dfs(0);\n vvi hash(3,vi(N));\n function<void(ll)>dfs2=[&](ll v){\n REP(j,3)hash[j][v]=1;\n for(auto u:E[v])if(u!=P[v]){\n dfs2(u);\n REP(j,3)hash[j][v]+=hash[j][u]*(base%mod[j])%mod[j];\n REP(j,3)hash[j][v]%=mod[j];\n }\n memo[make_tuple(S[v],max_depth[v],hash[0][v],hash[1][v],hash[2][v])]++;\n };\n dfs2(0);\n ll ans=0;\n for(auto[k,v]:memo)ans+=v*(v-1)/2;\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":81172,"score_of_the_acc":-2,"final_rank":15},{"submission_id":"aoj_2784_9605639","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N;\n cin>>N;\n vector<vector<ll>> G(N);\n for(int i=0;i<N-1;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G[u].push_back(v);\n G[v].push_back(u);\n }\n ll VN=10;\n vector<ll> BS(VN),MD(VN);\n for(int i=0;i<VN;i++)BS[i]=rand()%1000+1000;\n for(int i=0;i<VN;i++)MD[i]=rand()%100000+1e9;\n vector<vector<ll>> C(N,vector<ll>(VN,1));\n map<vector<ll>,ll> MP;\n ll an=0;\n auto dfs = [&](auto dfs, int n,int p) -> void {\n for (int v : G[n]) {\n if(v!=p){\n dfs(dfs,v,n);\n for(int i=0;i<VN;i++){\n C[n][i]+=(C[v][i]*BS[i])%MD[i];\n C[n][i]%=MD[i];\n }\n }\n }\n an+=MP[C[n]];\n MP[C[n]]++;\n };\n dfs(dfs,0,-1);\n\n cout<<an<<endl; \n \n}","accuracy":1,"time_ms":90,"memory_kb":53024,"score_of_the_acc":-1.2013,"final_rank":14},{"submission_id":"aoj_2784_9027153","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\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, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint main() {\n int N = in();\n vector<vector<int>> tree(N);\n for(int i : rep(N - 1)) {\n int u = in(), v = in(); u--, v--;\n tree[u].push_back(v);\n tree[v].push_back(u);\n }\n\n const int M = 2;\n using hash = array<i64, M>;\n const hash mod = {int(1e9) + 7, int(1e9) + 9};\n const i64 b = 10007;\n map<hash, int> mp;\n auto dfs = [&](auto self, int v, int p) -> hash {\n hash sum = {};\n for(int to : tree[v]) if(to != p) {\n auto ch = self(self, to, v);\n for(int i : rep(M)) sum[i] = (sum[i] + ch[i]) % mod[i];\n }\n for(int i : rep(M)) sum[i] = (sum[i] * b + 1) % mod[i];\n mp[sum] += 1;\n return sum;\n };\n dfs(dfs, 0, -1);\n\n i64 ans = 0;\n for(auto [key, value] : mp) ans += i64(value) * (value - 1) / 2;\n print(ans);\n}","accuracy":1,"time_ms":40,"memory_kb":28964,"score_of_the_acc":-0.5277,"final_rank":8},{"submission_id":"aoj_2784_7238695","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define foa(s, v) for(auto &s : v)\n#define all(v) v.begin(), v.end()\n#define REPname(a,b,c,d,...) d\n#define rep(...) REPname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP2(i,l,r) for(int i = l; i < r; i++)\n#define REP1(i, x) REP2(i,0,x)\n#define REP0(x) REP1(SPJ, x)\n#define sz(x) int(x.size())\n\ntemplate <class T>\nusing V=vector<T>;\n\ntemplate <class T>\nusing VV=vector<V<T>>;\n\ntemplate<class T>\nusing pqmin = priority_queue<T, V<T>, greater<T>>;\nusing ll = long long ;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = V<vll>;\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\ntemplate<class T>\ninline bool chmax(T &a, T b){\n\treturn a < b ? a=b, 1 : 0;\n}\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\treturn a > b ? a = b, 1 : 0;\n}\n\ntemplate <class T>\nvoid view(T x) {\n\tcerr << x;\n}\n\ntemplate <class T>\nvoid view(V<T> v) {\n\tcerr << \"{ \";\n\tfoa(t, v) {view(t) ; cerr << \", \";}\n\tcerr << \"}\";\n\tcerr << endl;\n}\n\n\ntemplate <class T>\nvoid view(VV<T> v) {\n\tcerr << \"{ \";\n\tfoa(t, v) {view(t) ; cerr << \",\\n\";}\n\tcerr << \"}\";\n\tcerr << endl;\n}\n\n\n// template <c0lass T>\nvoid view(int x) {\n\tcerr << x;\n}\n\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <class T>\nvoid debug_out(T x) {\n\tview(x);\n}\ntemplate <class H, class... T>\nvoid debug_out(H h, T... 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 << \"]\\n\"; \\\n\t} while(0)\n#else\n#define debug(...) (void(0))\n#endif\nusing vvi = V<vi>;\n\nstruct uf{\n\tvector<int> dat;\n\tuf(int n) : dat(n, -1) {}\n\tint root(int x) \n\t{\n\t\tint& p = dat[x];\n\t\tif(p < 0) return x;\n\t\treturn p = root(p);\n\t}\n\tbool merge(int x, int y) {\n\t\tx = root(x);\n\t\ty = root(y);\n\t\tif(x == y) return false;\n\t\tif(-dat[x] < -dat[y]) swap(x, y);\n\t\tdat[x] += dat[y];\n\t\tdat[y] = x;\n\t\treturn true;\n\t}\n};\n\nll modpow(ll x, ll n, ll md){\n\tll ret = 1 % md;\n\twhile(n > 0){\n\t\tif(n & 1) {ret *= x; ret %= md;}\n\t\tn >>= 1;\n\t\tx *= x;\n\t\tx %= md;\n\t}\n\tif(ret < 0) ret += abs(md);\n\treturn ret;\n}\n\nusing bint = __int128_t;\n\nll solve(int n){\n\tvector<vi> g(n);\n\trep(n-1) {\n\t\tint a, b; cin >> a >> b;\n\t\ta--;\n\t\tb--;\n\t\tg[a].push_back(b);\n\t\tg[b].push_back(a);\n\t}\n\n\n\tvector<bint> hs(n, 0);\n\tconst bint base = 10231437;\n\tconst bint mod = (1LL << 61) - 1;\n\n\tauto dfs = [&](int now, int par, auto self) -> void {\n\t\tbint& tmp = hs[now];\n\t\tfoa(nxt, g[now]) {\n\t\t\tif(nxt == par) continue;\n\t\t\tself(nxt, now, self);\n\t\t\ttmp += hs[nxt];\n\t\t}\n\t\ttmp *= base;\n\t\ttmp += 1;\n\t\ttmp %= mod;\n\t\treturn;\n\t};\n\n\tdfs(0, -1, dfs);\n\n\tmap<bint, ll> m;\n\trep(i, n) m[hs[i]] ++ ;\n\tll ans = 0;\n\tfoa(t, m) {\n\t\tans += (t.second - 1) * t.second / 2;\n\t}\n\n\treturn ans;\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\tint n;\n\twhile(cin >> n && n) cout << solve(n) << '\\n';\n}","accuracy":1,"time_ms":40,"memory_kb":27224,"score_of_the_acc":-0.5049,"final_rank":7},{"submission_id":"aoj_2784_6974119","code_snippet":"#include <stdio.h>\n#include <vector>\n#include <map>\n#define M1 1030000001\n#define M2 1012345693\n#define X1 103001\n#define X2 123457\nusing namespace std;\n\nvector<int> ed[103000];\nmap<pair<int, int>, int> mp;\n\npair<long long, long long> makehash(int x, int p) {\n pair<long long, long long> pp, t;\n pp.first = 1;\n pp.second = 1;\n for (int i : ed[x]) {\n if (i == p) continue;\n t = makehash(i, x);\n pp.first = (pp.first + t.first * X1) % M1;\n pp.second = (pp.second + t.second * X2) % M2;\n }\n if (mp.find(pp) != mp.end()) mp[pp]++;\n else mp.insert({ pp, 1 });\n return pp;\n}\n\nint main(void) {\n int n, a, b;\n long long r = 0;\n scanf(\"%d\", &n);\n for (int i = 1; i < n; i++) {\n scanf(\"%d %d\", &a, &b);\n ed[a].push_back(b);\n ed[b].push_back(a);\n }\n makehash(1, -1);\n for (auto& i : mp) {\n r += i.second * (i.second - 1LL) / 2;\n }\n printf(\"%lld\\n\", r);\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":22564,"score_of_the_acc":-0.4436,"final_rank":5},{"submission_id":"aoj_2784_6899938","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int mod = 998244353,mod2 = 1000000007;\n\nmap<pair<int,int>,int>mp;\n\npair<int,int> dfs(int n,int p,vector<vector<int>>&ki) {\n int sum = 0,sum2 = 0;\n for(int i:ki[n]) {\n if(i == p) {\n continue;\n }\n pair<int,int> a = dfs(i,n,ki);\n sum += 1ll*a.first*1000003%mod;\n sum2 += 1ll*a.second*1000003%mod2;\n if(sum >= mod) sum -= mod;\n if(sum2 >= mod2) sum2 -= mod2;\n }\n sum += 1;\n if(sum >= mod) sum -= mod;\n sum2 += 1;\n if(sum2 >= mod) sum2 -= mod;\n mp[{sum,sum2}]++;\n return {sum,sum2};\n}\n\nint main() {\n int N;\n cin >> N;\n vector<vector<int>>ki(N);\n for(int i = 0; i < N-1; i++) {\n int a,b;\n cin >> a >> b;\n a--;\n b--;\n ki[a].push_back(b);\n ki[b].push_back(a);\n }\n dfs(0,-1,ki);\n long long ans = 0;\n for(auto i:mp) {\n ans += 1ll*i.second*(i.second-1)/2;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":22504,"score_of_the_acc":-0.5856,"final_rank":9},{"submission_id":"aoj_2784_6899936","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int mod = 998244353,mod2 = 1000000007;\n\nmap<pair<int,int>,int>mp;\n\npair<int,int> dfs(int n,int p,vector<vector<int>>&ki) {\n int sum = 0,sum2 = 0;\n for(int i:ki[n]) {\n if(i == p) {\n continue;\n }\n pair<int,int> a = dfs(i,n,ki);\n sum += 1ll*a.first*10%mod;\n sum2 += 1ll*a.second*10%mod2;\n if(sum >= mod) sum -= mod;\n if(sum2 >= mod2) sum2 -= mod2;\n }\n sum += 1;\n if(sum >= mod) sum -= mod;\n sum2 += 1;\n if(sum2 >= mod) sum2 -= mod;\n mp[{sum,sum2}]++;\n return {sum,sum2};\n}\n\nint main() {\n int N;\n cin >> N;\n vector<vector<int>>ki(N);\n for(int i = 0; i < N-1; i++) {\n int a,b;\n cin >> a >> b;\n a--;\n b--;\n ki[a].push_back(b);\n ki[b].push_back(a);\n }\n dfs(0,-1,ki);\n long long ans = 0;\n for(auto i:mp) {\n ans += 1ll*i.second*(i.second-1)/2;\n }\n cout << ans << endl;\n}","accuracy":0.12,"time_ms":10,"memory_kb":5128,"score_of_the_acc":0,"final_rank":17},{"submission_id":"aoj_2784_6899931","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int mod = 998244353;\n\nmap<int,int>mp;\n\nint dfs(int n,int p,vector<vector<int>>&ki) {\n int sum = 0;\n for(int i:ki[n]) {\n if(i == p) {\n continue;\n }\n sum += 1ll*dfs(i,n,ki)*10%mod;\n if(sum >= mod) sum -= mod;\n }\n sum += 1;\n if(sum >= mod) sum -= mod;\n mp[sum]++;\n return sum;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<vector<int>>ki(N);\n for(int i = 0; i < N-1; i++) {\n int a,b;\n cin >> a >> b;\n a--;\n b--;\n ki[a].push_back(b);\n ki[b].push_back(a);\n }\n dfs(0,-1,ki);\n long long ans = 0;\n for(auto i:mp) {\n ans += 1ll*i.second*(i.second-1)/2;\n }\n cout << ans << endl;\n}","accuracy":0.12,"time_ms":10,"memory_kb":5132,"score_of_the_acc":-0.0001,"final_rank":18},{"submission_id":"aoj_2784_6426656","code_snippet":"#include <cstdio>\n#include <vector>\n#include <functional>\n#include <algorithm>\nusing namespace std;\n\nconst int m0 = 1e9 + 7;\nconst int m1 = 1e9 + 9;\n\nstruct hv {\n int v0, v1;\n hv operator + (const hv& other) const {\n return hv{(v0 + other.v0)%m0, (v1 + other.v1)%m1};\n }\n hv operator * (const hv& other) const {\n return hv{(int)(v0 * 1ll * other.v0%m0), (int)(v1 * 1ll * other.v1%m1)};\n }\n bool operator == (const hv& other) const {\n return v0 == other.v0 && v1 == other.v1; \n }\n};\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n vector<vector<int>> g(n + 1);\n for (int i = 0; i < n - 1; i++) {\n int u, v;\n scanf(\"%d%d\", &u, &v);\n g[u].push_back(v);\n }\n vector<hv> pw(n + 1);\n pw[0] = hv{1, 1};\n hv c = {171, 171};\n for (int i = 1; i <= n; i++) pw[i] = pw[i - 1] * c;\n vector<hv> val(n + 1);\n \n function<void(int)> dfs = [&](int u) {\n int find = 0;\n val[u] = hv{1, 1} * pw[0];\n for (int v: g[u]) {\n dfs(v);\n auto add = val[v] * c;\n val[u] = val[u] + add;\n }\n //printf(\"val[%d] = %d, %d\\n\", u, val[u].v0, val[u].v1);\n };\n \n dfs(1);\n vector<hv> all;\n for (int i = 1; i <= n; i++) {\n all.push_back(val[i]); \n }\n sort(all.begin(), all.end(), [](auto u, auto v) {\n if (u.v0 != v.v0) return u.v0 < v.v0;\n return u.v1 < v.v1; \n });\n long long ans = 0;\n int p = 0;\n while (p < n) {\n int np = p;\n while (np + 1 < n && all[np + 1] == all[p]) np++;\n int cnt = np - p + 1;\n ans += cnt * 1ll * (cnt - 1) / 2;\n p = np + 1;\n } \n printf(\"%lld\\n\", ans);\n return 0; \n}","accuracy":1,"time_ms":20,"memory_kb":19968,"score_of_the_acc":-0.2666,"final_rank":2},{"submission_id":"aoj_2784_6399942","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\ntemplate<long long mod>\nclass modint{\n\tpublic:\n\t\tlong long x;\n\t\tmodint(long long a){x=a%mod;if(x<0)x+=mod;}\n\t\tmodint(){x=0;}\n\n\t\tmodint pow(long long a){\n\t\t\tmodint res(1), b(x);\n\t\t\twhile(a){\n\t\t\t\tif(a&1)res*=b;\n\t\t\t\tb*=b;\n\t\t\t\ta>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tmodint inv(){return pow(mod-2);}\n\n\t\tmodint& operator+=(modint a){x=(x+a.x)%mod;return *this;}\n\t\tmodint& operator-=(modint a){x=x-a.x;if(x<0)x+=mod;return *this;}\n\t\tmodint& operator*=(modint a){x=x*a.x%mod;return *this;}\n\t\tmodint& operator/=(modint a){x=x*a.inv().x%mod;return *this;}\n\n\t\tmodint operator+(modint a){return modint(x)+=a;}\n\t\tmodint operator-(modint a){return modint(x)-=a;}\n\t\tmodint operator*(modint a){return modint(x)*=a;}\n\t\tmodint operator/(modint a){return modint(x)/=a;}\n\n\t\tmodint operator-(){return modint(x);}\n\n\t\tbool operator==(const modint a){return x == a.x;}\n\t\tbool operator<(const modint a){return x < a.x;}\n\t\tbool operator>(const modint a){return x > a.x;}\n};\n\ntemplate<long long mod>\nostream& operator<<(ostream& os, const modint<mod>& a){\n\tos << a.x;\n\treturn os;\n}\n\nusing M1 = modint<1000000007>;\nusing M2 = modint<1000000009>;\n\nclass ModHash{\npublic:\n M1 v1;\n M2 v2;\n ModHash():ModHash(0){}\n ModHash(long long v):v1(v),v2(v){}\n ModHash(M1 v1,M2 v2):v1(v1),v2(v2){}\n ModHash(const ModHash &that):v1(that.v1),v2(that.v2){}\n ModHash operator+(ModHash that){\n return ModHash(v1+that.v1,v2+that.v2);\n }\n ModHash operator-(ModHash that){\n return ModHash(v1-that.v1,v2-that.v2);\n }\n ModHash operator*(ModHash that){\n return ModHash(v1*that.v1,v2*that.v2);\n }\n};\n\nbool operator<(ModHash x,ModHash y){\n return x.v1 < y.v1 or\n (x.v1 == y.v1 and\n x.v2 < y.v2);\n}\n\nll func(){\n int n = in();\n vvector<pii> edges(n);\n rep(_,n-1){\n int a = in()-1;\n int b = in()-1;\n edges[a].emplace_back(b,edges[b].size());\n edges[b].emplace_back(a,edges[a].size()-1);\n }\n vvector<ModHash> dp(n);\n vvector<int> used(n);\n ModHash B = ModHash(11,13);\n rep(i,n)dp[i].resize(edges[i].size()+1);\n rep(i,n)used[i].resize(edges[i].size()+1,false);\n method(rec,ModHash,int p,int last){\n int itr = last < 0 ? dp[p].size()-1 : last;\n if(used[p][itr])return dp[p][itr];\n used[p][itr] = true;\n ModHash &it = dp[p][itr];\n if(last < 0){\n ModHash sum = 1;\n foreach(e,edges[p]){\n sum = sum + rec(e.first,e.second) * 11;\n }\n rep(i,edges[p].size()){\n dp[p][i] = sum - rec(edges[p][i].first,edges[p][i].second) * B;\n }\n it = sum;\n }else{\n it = 1;\n rep(i,edges[p].size()){\n if(i==last)continue;\n it = it + rec(edges[p][i].first,edges[p][i].second) * B;\n }\n }\n return it;\n };\n map<ModHash,int> m;\n ll res = 0;\n method(solve,ll,int p,int last){\n ll res = 0;\n ModHash v = rec(p,last);\n res += m[v];\n ++m[v];\n rep(i,edges[p].size()){\n if(i==last)continue;\n res += solve(edges[p][i].first,edges[p][i].second);\n }\n return res;\n };\n return solve(0,-1);\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n println(func());\n\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":42876,"score_of_the_acc":-0.8535,"final_rank":13},{"submission_id":"aoj_2784_6399937","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\ntemplate<long long mod>\nclass modint{\n\tpublic:\n\t\tlong long x;\n\t\tmodint(long long a){x=a%mod;if(x<0)x+=mod;}\n\t\tmodint(){x=0;}\n\n\t\tmodint pow(long long a){\n\t\t\tmodint res(1), b(x);\n\t\t\twhile(a){\n\t\t\t\tif(a&1)res*=b;\n\t\t\t\tb*=b;\n\t\t\t\ta>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tmodint inv(){return pow(mod-2);}\n\n\t\tmodint& operator+=(modint a){x=(x+a.x)%mod;return *this;}\n\t\tmodint& operator-=(modint a){x=x-a.x;if(x<0)x+=mod;return *this;}\n\t\tmodint& operator*=(modint a){x=x*a.x%mod;return *this;}\n\t\tmodint& operator/=(modint a){x=x*a.inv().x%mod;return *this;}\n\n\t\tmodint operator+(modint a){return modint(x)+=a;}\n\t\tmodint operator-(modint a){return modint(x)-=a;}\n\t\tmodint operator*(modint a){return modint(x)*=a;}\n\t\tmodint operator/(modint a){return modint(x)/=a;}\n\n\t\tmodint operator-(){return modint(x);}\n\n\t\tbool operator==(const modint a){return x == a.x;}\n\t\tbool operator<(const modint a){return x < a.x;}\n\t\tbool operator>(const modint a){return x > a.x;}\n};\n\ntemplate<long long mod>\nostream& operator<<(ostream& os, const modint<mod>& a){\n\tos << a.x;\n\treturn os;\n}\n\nusing M1 = modint<1000000007>;\nusing M2 = modint<1000000009>;\n\nclass ModHash{\npublic:\n M1 v1;\n M2 v2;\n ModHash():ModHash(0){}\n ModHash(long long v):v1(v),v2(v){}\n ModHash(M1 v1,M2 v2):v1(v1),v2(v2){}\n ModHash(const ModHash &that):v1(that.v1),v2(that.v2){}\n ModHash operator+(ModHash that){\n return ModHash(v1+that.v1,v2+that.v2);\n }\n ModHash operator-(ModHash that){\n return ModHash(v1-that.v1,v2-that.v2);\n }\n ModHash operator*(ModHash that){\n return ModHash(v1*that.v1,v2*that.v2);\n }\n};\n\nbool operator<(ModHash x,ModHash y){\n return x.v1 < y.v1 or\n (x.v1 == y.v1 and\n x.v2 < y.v2);\n}\n\nll func(){\n int n = in();\n vvector<pii> edges(n);\n rep(_,n-1){\n int a = in()-1;\n int b = in()-1;\n edges[a].emplace_back(b,edges[b].size());\n edges[b].emplace_back(a,edges[a].size()-1);\n }\n vvector<ModHash> dp(n);\n vvector<int> used(n);\n rep(i,n)dp[i].resize(edges[i].size()+1);\n rep(i,n)used[i].resize(edges[i].size()+1,false);\n method(rec,ModHash,int p,int last){\n int itr = last < 0 ? dp[p].size()-1 : last;\n if(used[p][itr])return dp[p][itr];\n used[p][itr] = true;\n ModHash &it = dp[p][itr];\n if(last < 0){\n ModHash sum = 1;\n foreach(e,edges[p]){\n sum = sum + rec(e.first,e.second) * 11;\n }\n rep(i,edges[p].size()){\n dp[p][i] = sum - rec(edges[p][i].first,edges[p][i].second) * 11;\n }\n it = sum;\n }else{\n it = 1;\n rep(i,edges[p].size()){\n if(i==last)continue;\n it = it + rec(edges[p][i].first,edges[p][i].second) * 11;\n }\n }\n return it;\n };\n map<ModHash,int> m;\n ll res = 0;\n method(solve,ll,int p,int last){\n ll res = 0;\n ModHash v = rec(p,last);\n res += m[v];\n ++m[v];\n rep(i,edges[p].size()){\n if(i==last)continue;\n res += solve(edges[p][i].first,edges[p][i].second);\n }\n return res;\n };\n return solve(0,-1);\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n println(func());\n\n return 0;\n}","accuracy":0.14,"time_ms":30,"memory_kb":17604,"score_of_the_acc":-0.3069,"final_rank":16},{"submission_id":"aoj_2784_6090674","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=1167167167167167167;\nconst int INF=2100000000;\nconst ll mod=1e9+7;\n#define rep(i,a) for (int i=0;i<a;i++)\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\";}\n\n\nvoid solve();\n\n// rainy ~ 雨に打たれて ~\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\tsolve();\n}\n\nvoid solve(){\n\tint N;\n\tcin>>N;\n\tvector<vector<int>> G(N);\n\trep(i,N-1){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\ta--,b--;\n\t\tG[a].push_back(b);\n\t\tG[b].push_back(a);\n\t}\n\tvector<vector<ll>> dp(N,vector<ll>(3));\n\tvector<ll> M={(1ll<<61)-1,998244353,924924167};\n\tvector<ll> q={2,3,5};\n\tvector<int> order={0},seen(N,-2);\n\trep(i,N){\n\t\tint a=order[i];\n\t\tfor(auto x:G[a]){\n\t\t\tif(seen[a]==x) continue;\n\t\t\tseen[x]=a;\n\t\t\torder.push_back(x);\n\t\t}\n\t}\n\trep(m,3){\n\t\tfor(int i=N-1;i>=0;i--){\n\t\t\tint a=order[i];\n\t\t\tfor(auto x:G[a]){\n\t\t\t\tif(seen[a]==x) continue;\n\t\t\t\tdp[a][m]+=dp[x][m];\n\t\t\t\tdp[a][m]%=M[m];\n\t\t\t}\n\t\t\tdp[a][m]*=q[m];\n\t\t\tdp[a][m]++;\n\t\t\tdp[a][m]%=M[m];\n\t\t}\n\t}\n\tll ans=0;\n\tmap<vector<ll>,ll> table;\n\trep(i,N){\n\t\tans+=table[dp[i]];\n\t\ttable[dp[i]]++;\n\t}\n\tcout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":60,"memory_kb":25660,"score_of_the_acc":-0.6271,"final_rank":10},{"submission_id":"aoj_2784_6090671","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=1167167167167167167;\nconst int INF=2100000000;\nconst ll mod=1e9+7;\n#define rep(i,a) for (int i=0;i<a;i++)\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\";}\n\n\nvoid solve();\n\n// rainy ~ 雨に打たれて ~\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\tsolve();\n}\n\nvoid solve(){\n\tint N;\n\tcin>>N;\n\tvector<vector<int>> G(N);\n\trep(i,N-1){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\ta--,b--;\n\t\tG[a].push_back(b);\n\t\tG[b].push_back(a);\n\t}\n\tvector<vector<ll>> dp(N,vector<ll>(3));\n\tvector<ll> M={(1ll<<61)-1,998244353,924924167};\n\tvector<int> order={0},seen(N,-2);\n\trep(i,N){\n\t\tint a=order[i];\n\t\tfor(auto x:G[a]){\n\t\t\tif(seen[a]==x) continue;\n\t\t\tseen[x]=a;\n\t\t\torder.push_back(x);\n\t\t}\n\t}\n\trep(m,3){\n\t\tfor(int i=N-1;i>=0;i--){\n\t\t\tint a=order[i];\n\t\t\tfor(auto x:G[a]){\n\t\t\t\tif(seen[a]==x) continue;\n\t\t\t\tdp[a][m]+=dp[x][m];\n\t\t\t\tdp[a][m]%=M[m];\n\t\t\t}\n\t\t\tdp[a][m]*=2ll;\n\t\t\tdp[a][m]++;\n\t\t\tdp[a][m]%=M[m];\n\t\t}\n\t}\n\tll ans=0;\n\tmap<vector<ll>,ll> table;\n\trep(i,N){\n\t\tans+=table[dp[i]];\n\t\ttable[dp[i]]++;\n\t}\n\tcout<<ans<<\"\\n\";\n}","accuracy":0.12,"time_ms":10,"memory_kb":7236,"score_of_the_acc":-0.0277,"final_rank":20},{"submission_id":"aoj_2784_6090668","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=1167167167167167167;\nconst int INF=2100000000;\nconst ll mod=1e9+7;\n#define rep(i,a) for (int i=0;i<a;i++)\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\";}\n\n\nvoid solve();\n\n// rainy ~ 雨に打たれて ~\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\tsolve();\n}\n\nvoid solve(){\n\tint N;\n\tcin>>N;\n\tvector<vector<int>> G(N);\n\trep(i,N-1){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\ta--,b--;\n\t\tG[a].push_back(b);\n\t\tG[b].push_back(a);\n\t}\n\tvector<vector<int>> dp(N,vector<int>(3));\n\tvector<int> M={1000000007,998244353,924924167};\n\tvector<int> order={0},seen(N,-2);\n\trep(i,N){\n\t\tint a=order[i];\n\t\tfor(auto x:G[a]){\n\t\t\tif(seen[a]==x) continue;\n\t\t\tseen[x]=a;\n\t\t\torder.push_back(x);\n\t\t}\n\t}\n\trep(m,3){\n\t\tfor(int i=N-1;i>=0;i--){\n\t\t\tint a=order[i];\n\t\t\tfor(auto x:G[a]){\n\t\t\t\tif(seen[a]==x) continue;\n\t\t\t\tdp[a][m]+=dp[x][m];\n\t\t\t\tdp[a][m]%=M[m];\n\t\t\t}\n\t\t\tdp[a][m]*=2ll;\n\t\t\tdp[a][m]++;\n\t\t\tdp[a][m]%=M[m];\n\t\t}\n\t}\n\tll ans=0;\n\tmap<vector<int>,ll> table;\n\trep(i,N){\n\t\tans+=table[dp[i]];\n\t\ttable[dp[i]]++;\n\t}\n\tcout<<ans<<\"\\n\";\n}","accuracy":0.12,"time_ms":10,"memory_kb":7232,"score_of_the_acc":-0.0277,"final_rank":19},{"submission_id":"aoj_2784_6014088","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing ull = unsigned long long int;\nusing P = pair<ll, ll>;\nusing P3 = pair<int, P>;\nusing PP = pair<P, P>;\nconstexpr int INF32 = 1 << 30;\nconstexpr ll INF64 = 1LL << 60;\nconstexpr ll MOD = 1000000007;\n// constexpr ll MOD = 998244353;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr int di8[] = {0, 1, 1, 1, 0, -1, -1, -1};\nconstexpr int dj8[] = {1, 1, 0, -1, -1, -1, 0, 1};\nconstexpr double EPS = 1e-10;\nconst double PI = acos(-1);\n\n#define ALL(v) (v).begin(),(v).end()\n#define REP(i,n) for(int i=0,i_len=n; i<i_len; ++i)\n\ntemplate<typename T1,typename T2> bool chmax(T1 &a, T2 b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<typename T1,typename T2> bool chmin(T1 &a, T2 b) { if (b<a) { a=b; return 1; } return 0; }\n\nstruct Hash {\n static constexpr int M = 2;\n static constexpr ll MODS[M] = {999999937, 1000000007};\n static constexpr ll BASE = 100007;\n\n int n;\n ll hash[M];\n void init(){\n n = 0;\n REP(k,M){\n hash[k] = 0;\n }\n }\n void push(int d){\n n++;\n REP(k,M){\n hash[k] = (hash[k]*BASE + d) % MODS[k];\n }\n }\n ll get(int k) {\n return hash[k];\n }\n};\n\nbool match(Hash& a, Hash& b) {\n bool res = true;\n for (int k = 0; k < Hash::M; k++) {\n res &= a.get(k) == b.get(k);\n }\n return res;\n}\n\nHash add(Hash a, Hash b){\n Hash res;\n res.init();\n REP(i, Hash::M){\n res.hash[i] = (a.get(i) + b.get(i)) % Hash::MODS[i];\n }\n res.n = max(a.n, b.n);\n return res;\n}\n\nvector<vector<int> > g;\nvector<Hash> hs;\n\nHash dfs(int now){\n Hash res;\n res.init();\n for(auto nxt : g[now]){\n res = add(res, dfs(nxt));\n }\n res.push(1);\n return hs[now] = res;\n}\n\nint solve(){\n int n;\n cin >> n;\n g.resize(n);\n for(int i=0;i<n-1;i++){\n int a, b;\n cin >> a >> b;\n a--; b--;\n g[a].push_back(b);\n }\n hs.resize(n);\n dfs(0);\n ll ans = 0;\n map<P, ll> cnt;\n REP(i,n){\n cnt[P(hs[i].get(0), hs[i].get(1))]++;\n // cout << hs[i].get(0) << \" \" << hs[i].get(1) << endl;\n }\n for(auto& node : cnt){\n ll x = node.second;\n // cout << x << endl;\n ans += x*(x-1)/2;\n }\n cout <<ans << endl;\n return 0;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n solve();\n // int T; cin >> T; REP(t,T) solve();\n // while(!solve());\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":28124,"score_of_the_acc":-0.4453,"final_rank":6},{"submission_id":"aoj_2784_6011426","code_snippet":"#include<bits/stdc++.h> \nusing namespace std;\ntypedef long long ll;\n#define all(x) (x).begin(),(x).end()\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}\nint dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};\nlong double eps = 1e-9;\nlong double pi = acos(-1);\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 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\nvector<vector<int>> v(200200);\nconst ll mul[] = {1007,1009,1013,1001};\nconst ll mod[] = {1000000007,1000000023,1000000087,1000000093};\nconst int hash_size = 3;\n\nmap<vector<ll>, ll> mp;\nll ans = 0;\nvector<ll> dfs(int p, int pre=-1){\n vector<ll> ret(hash_size, 1);\n for(auto i:v[p]){\n if(i == pre) continue;\n auto g = dfs(i, p);\n for(int i=0;i<hash_size;i++){\n ret[i] += g[i] * mul[i] % mod[i];\n if(ret[i] >= mod[i]) ret[i] -= mod[i];\n }\n }\n ans += mp[ret];\n mp[ret]++;\n return ret;\n}\n\n\nsigned main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n\n int n;\n cin>>n;\n for(int i=1;i<n;i++){\n int a,b;\n cin>>a>>b;\n a--,b--;\n v[a].push_back(b);\n v[b].push_back(a);\n }\n dfs(0, -1);\n cout << ans << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":31256,"score_of_the_acc":-0.7007,"final_rank":12},{"submission_id":"aoj_2784_5977121","code_snippet":"#pragma region Macros\n#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#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__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 OVERLOAD3(_1, _2, _3, name, ...) name\n#define ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\n#define REP1(i, n) for(int i = 0; i < (n); i++)\n#define REP2(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\nconstexpr int MOD2 = 998244353;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\nint popcount(int x) { return __builtin_popcount(x); }\nll popcount(ll x) { return __builtin_popcountll(x); }\n#pragma endregion Macros\n\nusing ull = unsigned long long;\nusing ui128 = __uint128_t;\nconstexpr ull mod = (1ULL << 61) - 1;\n\ninline ull add(ull a, ull b) {\n if((a += b) >= mod) {\n a -= mod;\n }\n return a;\n}\ninline ull mul(ull a, ull b) {\n ui128 t = (ui128)a * b;\n ull na = t >> 61;\n ull nb = t & mod;\n if((na += nb) >= mod) {\n na -= mod;\n }\n return na;\n}\n\nint N;\nvector<int> G[100001];\null base, dp[100001];\n\null dfs(int u, int p, int d) {\n ull res = base;\n for(int v : G[u]) {\n if(v == p) continue;\n res = add(res, mul(dfs(v, u, d+1), base));\n }\n return (dp[u] = res);\n}\n\nint main() {\n random_device seed_gen;\n mt19937_64 engine(seed_gen());\n uniform_int_distribution<ull> rand(2, mod-1);\n base = rand(engine);\n \n cin >> 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 dfs(0, -1, 0);\n map<ull, int> cnt;\n REP(i, N) cnt[dp[i]] += 1;\n ll ans = 0;\n for(auto [h, sz] : cnt) {\n ans += (ll)sz * (sz-1) / 2;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":25260,"score_of_the_acc":-0.4076,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2784_10946041\",\n \"code_snippet\": \"#include <bits/stdtr1c++.h>\\n\\n#define MAX 100100\\n#define clr(ar) memset(ar, 0, sizeof(ar))\\n#define read() freopen(\\\"lol.txt\\\", \\\"r\\\", stdin)\\n#define dbg(x) cout << #x << \\\" = \\\" << x << endl\\n\\nusing namespace std;\\n\\nconst unsigned long long base = 666666667;\\n\\nint n, depth[MAX];\\nvector <int> adj[MAX];\\nunsigned long long dp[MAX], power[MAX];\\ntr1::unordered_map <unsigned long long, int> mp;\\n\\nvoid dfs(int i, int p){\\n depth[i] = 1;\\n int j, k, d, x, len = adj[i].size();\\n\\n for (j = 0; j < len; j++){\\n x = adj[i][j];\\n if (x != p){\\n dfs(x, i);\\n depth[i] = max(depth[i], depth[x] + 1);\\n }\\n }\\n\\n d = depth[i] - 1;\\n unsigned long long h = 0;\\n for (j = 0; j < len; j++){\\n x = adj[i][j];\\n if (x != p){\\n unsigned long long r = dp[x] * power[d - depth[x]];\\n h += r;\\n }\\n }\\n\\n h += power[depth[i]];\\n dp[i] = h;\\n mp[h]++;\\n}\\n\\nint main(){\\n int i, j, k, l, a, b;\\n\\n power[0] = 1;\\n for (i = 1; i < MAX; i++) power[i] = power[i - 1] * base;\\n\\n while (scanf(\\\"%d\\\", &n) != EOF){\\n mp.clear();\\n for (i = 0; i < MAX; i++) adj[i].clear();\\n\\n for (i = 1; i < n; i++){\\n scanf(\\\"%d %d\\\", &a, &b);\\n adj[a].push_back(b);\\n adj[b].push_back(a);\\n }\\n\\n dfs(1, 1);\\n long long res = 0;\\n for (auto it: mp){\\n long long x = it.second;\\n res += ((x * (x - 1)) >> 1);\\n }\\n\\n printf(\\\"%lld\\\\n\\\", res);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 24036,\n \"score_of_the_acc\": -0.3201,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2784_9946345\",\n \"code_snippet\": \"#include <iostream>\\n#include <random>\\n#include <vector>\\n#include <algorithm>\\nstruct Mint {\\n using Value = unsigned long long;\\n static constexpr Value MOD{(1uLL << 61) - 1};\\n static constexpr Value MASK30{(1ull << 30) - 1};\\n static constexpr Value MASK31{(1ull << 31) - 1};\\n constexpr Mint() {}\\n static constexpr Value Mod() noexcept {\\n return MOD;\\n }\\n static constexpr Value Modulo(Value v) noexcept {\\n Value res{(v >> 61) + (v & MOD)};\\n res = (res >= MOD ? res - MOD : res);\\n return res;\\n }\\n static constexpr Value UnsafeMul(Value a, Value b) noexcept {\\n Value fa{a >> 31}, fb{b >> 31};\\n Value ba{a & MASK31}, bb{b & MASK31};\\n Value mid{fa * bb + fb * ba};\\n return Value{2} * fa * fb + (mid >> 30) + ((mid & MASK30) << 31) + ba * bb;\\n }\\n static constexpr Value Mul(Value a, Value b) noexcept {\\n return Modulo(UnsafeMul(a, b));\\n }\\n};\\nconst unsigned long long B{std::mt19937{std::random_device{}()}() % Mint::Mod()};\\nint N;\\nstd::vector<int> G[100010];\\nlong long solve() {\\n std::vector<long long> hash(N);\\n auto rec{[&](auto rec, int v, int p) -> long long {\\n long long h{};\\n for (auto x : G[v]) if (x != p) {\\n h = Mint::Modulo(h + rec(rec, x, v));\\n }\\n h = Mint::Mul(h, B);\\n h = Mint::Modulo(h + 1);\\n return hash[v] = h;\\n }};\\n rec(rec, 0, -1);\\n //for (auto h : hash) std::cout << h << ' ';\\n //std::cout << std::endl;\\n std::sort(hash.begin(), hash.end());\\n long long ans{};\\n for (int i{}, j{} ; i < N ; i = j) {\\n while (j < N and hash[i] == hash[j]) j++;\\n ans += (long long)(j - i) * (j - i - 1) / 2;\\n }\\n return ans;\\n}\\nint main() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n std::cin >> N;\\n for (int i{} ; i < N - 1 ; i++) {\\n int a, b;\\n std::cin >> a >> b;\\n a--; b--;\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n std::cout << solve() << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 18660,\n \"score_of_the_acc\": -0.2494,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2784_9727759\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nnamespace Random {\\nmt19937_64 randgen(chrono::steady_clock::now().time_since_epoch().count());\\nusing u64 = unsigned long long;\\nu64 get() {\\n return randgen();\\n}\\ntemplate <typename T> T get(T L) { // [0,L]\\n\\n return get() % (L + 1);\\n}\\ntemplate <typename T> T get(T L, T R) { // [L,R]\\n\\n return get(R - L) + L;\\n}\\ndouble uniform() {\\n return double(get(1000000000)) / 1000000000;\\n}\\nstring str(int n) {\\n string ret;\\n rep(i, 0, n) ret += get('a', 'z');\\n return ret;\\n}\\ntemplate <typename Iter> void shuffle(Iter first, Iter last) {\\n if (first == last)\\n return;\\n int len = 1;\\n for (auto it = first + 1; it != last; it++) {\\n len++;\\n int j = get(0, len - 1);\\n if (j != len - 1)\\n iter_swap(it, first + j);\\n }\\n}\\ntemplate <typename T> vector<T> select(int n, T L, T R) { // [L,R]\\n\\n if (n * 2 >= R - L + 1) {\\n vector<T> ret(R - L + 1);\\n iota(ALL(ret), L);\\n shuffle(ALL(ret));\\n ret.resize(n);\\n return ret;\\n } else {\\n unordered_set<T> used;\\n vector<T> ret;\\n while (SZ(used) < n) {\\n T x = get(L, R);\\n if (!used.count(x)) {\\n used.insert(x);\\n ret.push_back(x);\\n }\\n }\\n return ret;\\n }\\n}\\n\\nvoid relabel(int n, vector<pair<int, int>> &es) {\\n shuffle(ALL(es));\\n vector<int> ord(n);\\n iota(ALL(ord), 0);\\n shuffle(ALL(ord));\\n for (auto &[u, v] : es)\\n u = ord[u], v = ord[v];\\n}\\ntemplate <bool directed, bool simple> vector<pair<int, int>> genGraph(int n) {\\n vector<pair<int, int>> cand, es;\\n rep(u, 0, n) rep(v, 0, n) {\\n if (simple and u == v)\\n continue;\\n if (!directed and u > v)\\n continue;\\n cand.push_back({u, v});\\n }\\n int m = get(SZ(cand));\\n vector<int> ord;\\n if (simple)\\n ord = select(m, 0, SZ(cand) - 1);\\n else {\\n rep(_, 0, m) ord.push_back(get(SZ(cand) - 1));\\n }\\n for (auto &i : ord)\\n es.push_back(cand[i]);\\n relabel(n, es);\\n return es;\\n}\\nvector<pair<int, int>> genTree(int n) {\\n vector<pair<int, int>> es;\\n rep(i, 1, n) es.push_back({get(i - 1), i});\\n relabel(n, es);\\n return es;\\n}\\n}; // namespace Random\\n\\n\\n/**\\n * @brief Random\\n */\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<vector<int>> G(N);\\n rep(i,0,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 vector<ll> Hash(N);\\n ll base = Random::get((ull)1e8,(ull)1e9);\\n ll MOD = 998244353;\\n auto DFS = [&](auto self, int V, int P) -> ll {\\n ll Ret = 0;\\n for(int NV : G[V]) {\\n if (NV == P) continue;\\n Ret += self(self,NV,V);\\n Ret %= MOD;\\n }\\n Ret *= base;\\n Ret++;\\n return Hash[V] = Ret % MOD;\\n };\\n DFS(DFS,0,-1);\\n map<ll,int> mp;\\n ll ANS = 0;\\n rep(i,0,N) {\\n ANS += mp[Hash[i]];\\n mp[Hash[i]]++;\\n }\\n cout << ANS << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 26584,\n \"score_of_the_acc\": -0.6393,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2784_9669065\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nint main(){\\n ll N;cin>>N;\\n vvi E(N);\\n REP(i,N-1){\\n int a,b;cin>>a>>b;a--;b--;\\n E[a].emplace_back(b);\\n E[b].emplace_back(a);\\n }\\n srand(time(NULL));\\n ll base=rand()%rand();\\n const vi mod={998244353,1000000007,1000000009};\\n vvi pow(3,vi(2e6,1));\\n FOR(i,1,2e6){\\n REP(j,3)pow[j][i]=pow[j][i-1]*(base%mod[j])%mod[j];\\n }\\n vi S(N,1),D(N),max_depth(N),P(N);\\n function<void(ll)>dfs=[&](ll v){\\n for(auto u:E[v])if(u!=P[v]){\\n P[u]=v;\\n D[u]=D[v]+1;\\n dfs(u);\\n S[v]+=S[u];\\n max_depth[v]=max(max_depth[u]+1,max_depth[v]);\\n }\\n };\\n map<tuple<ll,ll,ll,ll,ll>,ll>memo;\\n dfs(0);\\n vvi hash(3,vi(N));\\n function<void(ll)>dfs2=[&](ll v){\\n REP(j,3)hash[j][v]=1;\\n for(auto u:E[v])if(u!=P[v]){\\n dfs2(u);\\n REP(j,3)hash[j][v]+=hash[j][u]*(base%mod[j])%mod[j];\\n REP(j,3)hash[j][v]%=mod[j];\\n }\\n memo[make_tuple(S[v],max_depth[v],hash[0][v],hash[1][v],hash[2][v])]++;\\n };\\n dfs2(0);\\n ll ans=0;\\n for(auto[k,v]:memo)ans+=v*(v-1)/2;\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 81172,\n \"score_of_the_acc\": -2,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2784_9605639\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n\\nint main(){\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll N;\\n cin>>N;\\n vector<vector<ll>> G(N);\\n for(int i=0;i<N-1;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n ll VN=10;\\n vector<ll> BS(VN),MD(VN);\\n for(int i=0;i<VN;i++)BS[i]=rand()%1000+1000;\\n for(int i=0;i<VN;i++)MD[i]=rand()%100000+1e9;\\n vector<vector<ll>> C(N,vector<ll>(VN,1));\\n map<vector<ll>,ll> MP;\\n ll an=0;\\n auto dfs = [&](auto dfs, int n,int p) -> void {\\n for (int v : G[n]) {\\n if(v!=p){\\n dfs(dfs,v,n);\\n for(int i=0;i<VN;i++){\\n C[n][i]+=(C[v][i]*BS[i])%MD[i];\\n C[n][i]%=MD[i];\\n }\\n }\\n }\\n an+=MP[C[n]];\\n MP[C[n]]++;\\n };\\n dfs(dfs,0,-1);\\n\\n cout<<an<<endl; \\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 53024,\n \"score_of_the_acc\": -1.2013,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2784_9027153\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\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, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint main() {\\n int N = in();\\n vector<vector<int>> tree(N);\\n for(int i : rep(N - 1)) {\\n int u = in(), v = in(); u--, v--;\\n tree[u].push_back(v);\\n tree[v].push_back(u);\\n }\\n\\n const int M = 2;\\n using hash = array<i64, M>;\\n const hash mod = {int(1e9) + 7, int(1e9) + 9};\\n const i64 b = 10007;\\n map<hash, int> mp;\\n auto dfs = [&](auto self, int v, int p) -> hash {\\n hash sum = {};\\n for(int to : tree[v]) if(to != p) {\\n auto ch = self(self, to, v);\\n for(int i : rep(M)) sum[i] = (sum[i] + ch[i]) % mod[i];\\n }\\n for(int i : rep(M)) sum[i] = (sum[i] * b + 1) % mod[i];\\n mp[sum] += 1;\\n return sum;\\n };\\n dfs(dfs, 0, -1);\\n\\n i64 ans = 0;\\n for(auto [key, value] : mp) ans += i64(value) * (value - 1) / 2;\\n print(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 28964,\n \"score_of_the_acc\": -0.5277,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2784_7238695\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) v.begin(), v.end()\\n#define REPname(a,b,c,d,...) d\\n#define rep(...) REPname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP2(i,l,r) for(int i = l; i < r; i++)\\n#define REP1(i, x) REP2(i,0,x)\\n#define REP0(x) REP1(SPJ, x)\\n#define sz(x) int(x.size())\\n\\ntemplate <class T>\\nusing V=vector<T>;\\n\\ntemplate <class T>\\nusing VV=vector<V<T>>;\\n\\ntemplate<class T>\\nusing pqmin = priority_queue<T, V<T>, greater<T>>;\\nusing ll = long long ;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = V<vll>;\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\ntemplate<class T>\\ninline bool chmax(T &a, T b){\\n\\treturn a < b ? a=b, 1 : 0;\\n}\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\treturn a > b ? a = b, 1 : 0;\\n}\\n\\ntemplate <class T>\\nvoid view(T x) {\\n\\tcerr << x;\\n}\\n\\ntemplate <class T>\\nvoid view(V<T> v) {\\n\\tcerr << \\\"{ \\\";\\n\\tfoa(t, v) {view(t) ; cerr << \\\", \\\";}\\n\\tcerr << \\\"}\\\";\\n\\tcerr << endl;\\n}\\n\\n\\ntemplate <class T>\\nvoid view(VV<T> v) {\\n\\tcerr << \\\"{ \\\";\\n\\tfoa(t, v) {view(t) ; cerr << \\\",\\\\n\\\";}\\n\\tcerr << \\\"}\\\";\\n\\tcerr << endl;\\n}\\n\\n\\n// template <c0lass T>\\nvoid view(int x) {\\n\\tcerr << x;\\n}\\n\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <class T>\\nvoid debug_out(T x) {\\n\\tview(x);\\n}\\ntemplate <class H, class... T>\\nvoid debug_out(H h, T... 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 << \\\"]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#else\\n#define debug(...) (void(0))\\n#endif\\nusing vvi = V<vi>;\\n\\nstruct uf{\\n\\tvector<int> dat;\\n\\tuf(int n) : dat(n, -1) {}\\n\\tint root(int x) \\n\\t{\\n\\t\\tint& p = dat[x];\\n\\t\\tif(p < 0) return x;\\n\\t\\treturn p = root(p);\\n\\t}\\n\\tbool merge(int x, int y) {\\n\\t\\tx = root(x);\\n\\t\\ty = root(y);\\n\\t\\tif(x == y) return false;\\n\\t\\tif(-dat[x] < -dat[y]) swap(x, y);\\n\\t\\tdat[x] += dat[y];\\n\\t\\tdat[y] = x;\\n\\t\\treturn true;\\n\\t}\\n};\\n\\nll modpow(ll x, ll n, ll md){\\n\\tll ret = 1 % md;\\n\\twhile(n > 0){\\n\\t\\tif(n & 1) {ret *= x; ret %= md;}\\n\\t\\tn >>= 1;\\n\\t\\tx *= x;\\n\\t\\tx %= md;\\n\\t}\\n\\tif(ret < 0) ret += abs(md);\\n\\treturn ret;\\n}\\n\\nusing bint = __int128_t;\\n\\nll solve(int n){\\n\\tvector<vi> g(n);\\n\\trep(n-1) {\\n\\t\\tint a, b; cin >> a >> b;\\n\\t\\ta--;\\n\\t\\tb--;\\n\\t\\tg[a].push_back(b);\\n\\t\\tg[b].push_back(a);\\n\\t}\\n\\n\\n\\tvector<bint> hs(n, 0);\\n\\tconst bint base = 10231437;\\n\\tconst bint mod = (1LL << 61) - 1;\\n\\n\\tauto dfs = [&](int now, int par, auto self) -> void {\\n\\t\\tbint& tmp = hs[now];\\n\\t\\tfoa(nxt, g[now]) {\\n\\t\\t\\tif(nxt == par) continue;\\n\\t\\t\\tself(nxt, now, self);\\n\\t\\t\\ttmp += hs[nxt];\\n\\t\\t}\\n\\t\\ttmp *= base;\\n\\t\\ttmp += 1;\\n\\t\\ttmp %= mod;\\n\\t\\treturn;\\n\\t};\\n\\n\\tdfs(0, -1, dfs);\\n\\n\\tmap<bint, ll> m;\\n\\trep(i, n) m[hs[i]] ++ ;\\n\\tll ans = 0;\\n\\tfoa(t, m) {\\n\\t\\tans += (t.second - 1) * t.second / 2;\\n\\t}\\n\\n\\treturn ans;\\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\\tint n;\\n\\twhile(cin >> n && n) cout << solve(n) << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 27224,\n \"score_of_the_acc\": -0.5049,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2784_6974119\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <vector>\\n#include <map>\\n#define M1 1030000001\\n#define M2 1012345693\\n#define X1 103001\\n#define X2 123457\\nusing namespace std;\\n\\nvector<int> ed[103000];\\nmap<pair<int, int>, int> mp;\\n\\npair<long long, long long> makehash(int x, int p) {\\n pair<long long, long long> pp, t;\\n pp.first = 1;\\n pp.second = 1;\\n for (int i : ed[x]) {\\n if (i == p) continue;\\n t = makehash(i, x);\\n pp.first = (pp.first + t.first * X1) % M1;\\n pp.second = (pp.second + t.second * X2) % M2;\\n }\\n if (mp.find(pp) != mp.end()) mp[pp]++;\\n else mp.insert({ pp, 1 });\\n return pp;\\n}\\n\\nint main(void) {\\n int n, a, b;\\n long long r = 0;\\n scanf(\\\"%d\\\", &n);\\n for (int i = 1; i < n; i++) {\\n scanf(\\\"%d %d\\\", &a, &b);\\n ed[a].push_back(b);\\n ed[b].push_back(a);\\n }\\n makehash(1, -1);\\n for (auto& i : mp) {\\n r += i.second * (i.second - 1LL) / 2;\\n }\\n printf(\\\"%lld\\\\n\\\", r);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 22564,\n \"score_of_the_acc\": -0.4436,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2784_6899938\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconstexpr int mod = 998244353,mod2 = 1000000007;\\n\\nmap<pair<int,int>,int>mp;\\n\\npair<int,int> dfs(int n,int p,vector<vector<int>>&ki) {\\n int sum = 0,sum2 = 0;\\n for(int i:ki[n]) {\\n if(i == p) {\\n continue;\\n }\\n pair<int,int> a = dfs(i,n,ki);\\n sum += 1ll*a.first*1000003%mod;\\n sum2 += 1ll*a.second*1000003%mod2;\\n if(sum >= mod) sum -= mod;\\n if(sum2 >= mod2) sum2 -= mod2;\\n }\\n sum += 1;\\n if(sum >= mod) sum -= mod;\\n sum2 += 1;\\n if(sum2 >= mod) sum2 -= mod;\\n mp[{sum,sum2}]++;\\n return {sum,sum2};\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<vector<int>>ki(N);\\n for(int i = 0; i < N-1; i++) {\\n int a,b;\\n cin >> a >> b;\\n a--;\\n b--;\\n ki[a].push_back(b);\\n ki[b].push_back(a);\\n }\\n dfs(0,-1,ki);\\n long long ans = 0;\\n for(auto i:mp) {\\n ans += 1ll*i.second*(i.second-1)/2;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 22504,\n \"score_of_the_acc\": -0.5856,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2784_6899936\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconstexpr int mod = 998244353,mod2 = 1000000007;\\n\\nmap<pair<int,int>,int>mp;\\n\\npair<int,int> dfs(int n,int p,vector<vector<int>>&ki) {\\n int sum = 0,sum2 = 0;\\n for(int i:ki[n]) {\\n if(i == p) {\\n continue;\\n }\\n pair<int,int> a = dfs(i,n,ki);\\n sum += 1ll*a.first*10%mod;\\n sum2 += 1ll*a.second*10%mod2;\\n if(sum >= mod) sum -= mod;\\n if(sum2 >= mod2) sum2 -= mod2;\\n }\\n sum += 1;\\n if(sum >= mod) sum -= mod;\\n sum2 += 1;\\n if(sum2 >= mod) sum2 -= mod;\\n mp[{sum,sum2}]++;\\n return {sum,sum2};\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<vector<int>>ki(N);\\n for(int i = 0; i < N-1; i++) {\\n int a,b;\\n cin >> a >> b;\\n a--;\\n b--;\\n ki[a].push_back(b);\\n ki[b].push_back(a);\\n }\\n dfs(0,-1,ki);\\n long long ans = 0;\\n for(auto i:mp) {\\n ans += 1ll*i.second*(i.second-1)/2;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.12,\n \"time_ms\": 10,\n \"memory_kb\": 5128,\n \"score_of_the_acc\": 0,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2784_6899931\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconstexpr int mod = 998244353;\\n\\nmap<int,int>mp;\\n\\nint dfs(int n,int p,vector<vector<int>>&ki) {\\n int sum = 0;\\n for(int i:ki[n]) {\\n if(i == p) {\\n continue;\\n }\\n sum += 1ll*dfs(i,n,ki)*10%mod;\\n if(sum >= mod) sum -= mod;\\n }\\n sum += 1;\\n if(sum >= mod) sum -= mod;\\n mp[sum]++;\\n return sum;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<vector<int>>ki(N);\\n for(int i = 0; i < N-1; i++) {\\n int a,b;\\n cin >> a >> b;\\n a--;\\n b--;\\n ki[a].push_back(b);\\n ki[b].push_back(a);\\n }\\n dfs(0,-1,ki);\\n long long ans = 0;\\n for(auto i:mp) {\\n ans += 1ll*i.second*(i.second-1)/2;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.12,\n \"time_ms\": 10,\n \"memory_kb\": 5132,\n \"score_of_the_acc\": -0.0001,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2784_6426656\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <functional>\\n#include <algorithm>\\nusing namespace std;\\n\\nconst int m0 = 1e9 + 7;\\nconst int m1 = 1e9 + 9;\\n\\nstruct hv {\\n int v0, v1;\\n hv operator + (const hv& other) const {\\n return hv{(v0 + other.v0)%m0, (v1 + other.v1)%m1};\\n }\\n hv operator * (const hv& other) const {\\n return hv{(int)(v0 * 1ll * other.v0%m0), (int)(v1 * 1ll * other.v1%m1)};\\n }\\n bool operator == (const hv& other) const {\\n return v0 == other.v0 && v1 == other.v1; \\n }\\n};\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n vector<vector<int>> g(n + 1);\\n for (int i = 0; i < n - 1; i++) {\\n int u, v;\\n scanf(\\\"%d%d\\\", &u, &v);\\n g[u].push_back(v);\\n }\\n vector<hv> pw(n + 1);\\n pw[0] = hv{1, 1};\\n hv c = {171, 171};\\n for (int i = 1; i <= n; i++) pw[i] = pw[i - 1] * c;\\n vector<hv> val(n + 1);\\n \\n function<void(int)> dfs = [&](int u) {\\n int find = 0;\\n val[u] = hv{1, 1} * pw[0];\\n for (int v: g[u]) {\\n dfs(v);\\n auto add = val[v] * c;\\n val[u] = val[u] + add;\\n }\\n //printf(\\\"val[%d] = %d, %d\\\\n\\\", u, val[u].v0, val[u].v1);\\n };\\n \\n dfs(1);\\n vector<hv> all;\\n for (int i = 1; i <= n; i++) {\\n all.push_back(val[i]); \\n }\\n sort(all.begin(), all.end(), [](auto u, auto v) {\\n if (u.v0 != v.v0) return u.v0 < v.v0;\\n return u.v1 < v.v1; \\n });\\n long long ans = 0;\\n int p = 0;\\n while (p < n) {\\n int np = p;\\n while (np + 1 < n && all[np + 1] == all[p]) np++;\\n int cnt = np - p + 1;\\n ans += cnt * 1ll * (cnt - 1) / 2;\\n p = np + 1;\\n } \\n printf(\\\"%lld\\\\n\\\", ans);\\n return 0; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 19968,\n \"score_of_the_acc\": -0.2666,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2784_6399942\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\ntemplate<long long mod>\\nclass modint{\\n\\tpublic:\\n\\t\\tlong long x;\\n\\t\\tmodint(long long a){x=a%mod;if(x<0)x+=mod;}\\n\\t\\tmodint(){x=0;}\\n\\n\\t\\tmodint pow(long long a){\\n\\t\\t\\tmodint res(1), b(x);\\n\\t\\t\\twhile(a){\\n\\t\\t\\t\\tif(a&1)res*=b;\\n\\t\\t\\t\\tb*=b;\\n\\t\\t\\t\\ta>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tmodint inv(){return pow(mod-2);}\\n\\n\\t\\tmodint& operator+=(modint a){x=(x+a.x)%mod;return *this;}\\n\\t\\tmodint& operator-=(modint a){x=x-a.x;if(x<0)x+=mod;return *this;}\\n\\t\\tmodint& operator*=(modint a){x=x*a.x%mod;return *this;}\\n\\t\\tmodint& operator/=(modint a){x=x*a.inv().x%mod;return *this;}\\n\\n\\t\\tmodint operator+(modint a){return modint(x)+=a;}\\n\\t\\tmodint operator-(modint a){return modint(x)-=a;}\\n\\t\\tmodint operator*(modint a){return modint(x)*=a;}\\n\\t\\tmodint operator/(modint a){return modint(x)/=a;}\\n\\n\\t\\tmodint operator-(){return modint(x);}\\n\\n\\t\\tbool operator==(const modint a){return x == a.x;}\\n\\t\\tbool operator<(const modint a){return x < a.x;}\\n\\t\\tbool operator>(const modint a){return x > a.x;}\\n};\\n\\ntemplate<long long mod>\\nostream& operator<<(ostream& os, const modint<mod>& a){\\n\\tos << a.x;\\n\\treturn os;\\n}\\n\\nusing M1 = modint<1000000007>;\\nusing M2 = modint<1000000009>;\\n\\nclass ModHash{\\npublic:\\n M1 v1;\\n M2 v2;\\n ModHash():ModHash(0){}\\n ModHash(long long v):v1(v),v2(v){}\\n ModHash(M1 v1,M2 v2):v1(v1),v2(v2){}\\n ModHash(const ModHash &that):v1(that.v1),v2(that.v2){}\\n ModHash operator+(ModHash that){\\n return ModHash(v1+that.v1,v2+that.v2);\\n }\\n ModHash operator-(ModHash that){\\n return ModHash(v1-that.v1,v2-that.v2);\\n }\\n ModHash operator*(ModHash that){\\n return ModHash(v1*that.v1,v2*that.v2);\\n }\\n};\\n\\nbool operator<(ModHash x,ModHash y){\\n return x.v1 < y.v1 or\\n (x.v1 == y.v1 and\\n x.v2 < y.v2);\\n}\\n\\nll func(){\\n int n = in();\\n vvector<pii> edges(n);\\n rep(_,n-1){\\n int a = in()-1;\\n int b = in()-1;\\n edges[a].emplace_back(b,edges[b].size());\\n edges[b].emplace_back(a,edges[a].size()-1);\\n }\\n vvector<ModHash> dp(n);\\n vvector<int> used(n);\\n ModHash B = ModHash(11,13);\\n rep(i,n)dp[i].resize(edges[i].size()+1);\\n rep(i,n)used[i].resize(edges[i].size()+1,false);\\n method(rec,ModHash,int p,int last){\\n int itr = last < 0 ? dp[p].size()-1 : last;\\n if(used[p][itr])return dp[p][itr];\\n used[p][itr] = true;\\n ModHash &it = dp[p][itr];\\n if(last < 0){\\n ModHash sum = 1;\\n foreach(e,edges[p]){\\n sum = sum + rec(e.first,e.second) * 11;\\n }\\n rep(i,edges[p].size()){\\n dp[p][i] = sum - rec(edges[p][i].first,edges[p][i].second) * B;\\n }\\n it = sum;\\n }else{\\n it = 1;\\n rep(i,edges[p].size()){\\n if(i==last)continue;\\n it = it + rec(edges[p][i].first,edges[p][i].second) * B;\\n }\\n }\\n return it;\\n };\\n map<ModHash,int> m;\\n ll res = 0;\\n method(solve,ll,int p,int last){\\n ll res = 0;\\n ModHash v = rec(p,last);\\n res += m[v];\\n ++m[v];\\n rep(i,edges[p].size()){\\n if(i==last)continue;\\n res += solve(edges[p][i].first,edges[p][i].second);\\n }\\n return res;\\n };\\n return solve(0,-1);\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n println(func());\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 42876,\n \"score_of_the_acc\": -0.8535,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2784_6399937\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\ntemplate<long long mod>\\nclass modint{\\n\\tpublic:\\n\\t\\tlong long x;\\n\\t\\tmodint(long long a){x=a%mod;if(x<0)x+=mod;}\\n\\t\\tmodint(){x=0;}\\n\\n\\t\\tmodint pow(long long a){\\n\\t\\t\\tmodint res(1), b(x);\\n\\t\\t\\twhile(a){\\n\\t\\t\\t\\tif(a&1)res*=b;\\n\\t\\t\\t\\tb*=b;\\n\\t\\t\\t\\ta>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tmodint inv(){return pow(mod-2);}\\n\\n\\t\\tmodint& operator+=(modint a){x=(x+a.x)%mod;return *this;}\\n\\t\\tmodint& operator-=(modint a){x=x-a.x;if(x<0)x+=mod;return *this;}\\n\\t\\tmodint& operator*=(modint a){x=x*a.x%mod;return *this;}\\n\\t\\tmodint& operator/=(modint a){x=x*a.inv().x%mod;return *this;}\\n\\n\\t\\tmodint operator+(modint a){return modint(x)+=a;}\\n\\t\\tmodint operator-(modint a){return modint(x)-=a;}\\n\\t\\tmodint operator*(modint a){return modint(x)*=a;}\\n\\t\\tmodint operator/(modint a){return modint(x)/=a;}\\n\\n\\t\\tmodint operator-(){return modint(x);}\\n\\n\\t\\tbool operator==(const modint a){return x == a.x;}\\n\\t\\tbool operator<(const modint a){return x < a.x;}\\n\\t\\tbool operator>(const modint a){return x > a.x;}\\n};\\n\\ntemplate<long long mod>\\nostream& operator<<(ostream& os, const modint<mod>& a){\\n\\tos << a.x;\\n\\treturn os;\\n}\\n\\nusing M1 = modint<1000000007>;\\nusing M2 = modint<1000000009>;\\n\\nclass ModHash{\\npublic:\\n M1 v1;\\n M2 v2;\\n ModHash():ModHash(0){}\\n ModHash(long long v):v1(v),v2(v){}\\n ModHash(M1 v1,M2 v2):v1(v1),v2(v2){}\\n ModHash(const ModHash &that):v1(that.v1),v2(that.v2){}\\n ModHash operator+(ModHash that){\\n return ModHash(v1+that.v1,v2+that.v2);\\n }\\n ModHash operator-(ModHash that){\\n return ModHash(v1-that.v1,v2-that.v2);\\n }\\n ModHash operator*(ModHash that){\\n return ModHash(v1*that.v1,v2*that.v2);\\n }\\n};\\n\\nbool operator<(ModHash x,ModHash y){\\n return x.v1 < y.v1 or\\n (x.v1 == y.v1 and\\n x.v2 < y.v2);\\n}\\n\\nll func(){\\n int n = in();\\n vvector<pii> edges(n);\\n rep(_,n-1){\\n int a = in()-1;\\n int b = in()-1;\\n edges[a].emplace_back(b,edges[b].size());\\n edges[b].emplace_back(a,edges[a].size()-1);\\n }\\n vvector<ModHash> dp(n);\\n vvector<int> used(n);\\n rep(i,n)dp[i].resize(edges[i].size()+1);\\n rep(i,n)used[i].resize(edges[i].size()+1,false);\\n method(rec,ModHash,int p,int last){\\n int itr = last < 0 ? dp[p].size()-1 : last;\\n if(used[p][itr])return dp[p][itr];\\n used[p][itr] = true;\\n ModHash &it = dp[p][itr];\\n if(last < 0){\\n ModHash sum = 1;\\n foreach(e,edges[p]){\\n sum = sum + rec(e.first,e.second) * 11;\\n }\\n rep(i,edges[p].size()){\\n dp[p][i] = sum - rec(edges[p][i].first,edges[p][i].second) * 11;\\n }\\n it = sum;\\n }else{\\n it = 1;\\n rep(i,edges[p].size()){\\n if(i==last)continue;\\n it = it + rec(edges[p][i].first,edges[p][i].second) * 11;\\n }\\n }\\n return it;\\n };\\n map<ModHash,int> m;\\n ll res = 0;\\n method(solve,ll,int p,int last){\\n ll res = 0;\\n ModHash v = rec(p,last);\\n res += m[v];\\n ++m[v];\\n rep(i,edges[p].size()){\\n if(i==last)continue;\\n res += solve(edges[p][i].first,edges[p][i].second);\\n }\\n return res;\\n };\\n return solve(0,-1);\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n println(func());\\n\\n return 0;\\n}\",\n \"accuracy\": 0.14,\n \"time_ms\": 30,\n \"memory_kb\": 17604,\n \"score_of_the_acc\": -0.3069,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2784_6090674\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#define _GLIBCXX_DEBUG\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=1167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=1e9+7;\\n#define rep(i,a) for (int i=0;i<a;i++)\\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\\\";}\\n\\n\\nvoid solve();\\n\\n// rainy ~ 雨に打たれて ~\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\tsolve();\\n}\\n\\nvoid solve(){\\n\\tint N;\\n\\tcin>>N;\\n\\tvector<vector<int>> G(N);\\n\\trep(i,N-1){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\ta--,b--;\\n\\t\\tG[a].push_back(b);\\n\\t\\tG[b].push_back(a);\\n\\t}\\n\\tvector<vector<ll>> dp(N,vector<ll>(3));\\n\\tvector<ll> M={(1ll<<61)-1,998244353,924924167};\\n\\tvector<ll> q={2,3,5};\\n\\tvector<int> order={0},seen(N,-2);\\n\\trep(i,N){\\n\\t\\tint a=order[i];\\n\\t\\tfor(auto x:G[a]){\\n\\t\\t\\tif(seen[a]==x) continue;\\n\\t\\t\\tseen[x]=a;\\n\\t\\t\\torder.push_back(x);\\n\\t\\t}\\n\\t}\\n\\trep(m,3){\\n\\t\\tfor(int i=N-1;i>=0;i--){\\n\\t\\t\\tint a=order[i];\\n\\t\\t\\tfor(auto x:G[a]){\\n\\t\\t\\t\\tif(seen[a]==x) continue;\\n\\t\\t\\t\\tdp[a][m]+=dp[x][m];\\n\\t\\t\\t\\tdp[a][m]%=M[m];\\n\\t\\t\\t}\\n\\t\\t\\tdp[a][m]*=q[m];\\n\\t\\t\\tdp[a][m]++;\\n\\t\\t\\tdp[a][m]%=M[m];\\n\\t\\t}\\n\\t}\\n\\tll ans=0;\\n\\tmap<vector<ll>,ll> table;\\n\\trep(i,N){\\n\\t\\tans+=table[dp[i]];\\n\\t\\ttable[dp[i]]++;\\n\\t}\\n\\tcout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 25660,\n \"score_of_the_acc\": -0.6271,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2784_6090671\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#define _GLIBCXX_DEBUG\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=1167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=1e9+7;\\n#define rep(i,a) for (int i=0;i<a;i++)\\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\\\";}\\n\\n\\nvoid solve();\\n\\n// rainy ~ 雨に打たれて ~\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\tsolve();\\n}\\n\\nvoid solve(){\\n\\tint N;\\n\\tcin>>N;\\n\\tvector<vector<int>> G(N);\\n\\trep(i,N-1){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\ta--,b--;\\n\\t\\tG[a].push_back(b);\\n\\t\\tG[b].push_back(a);\\n\\t}\\n\\tvector<vector<ll>> dp(N,vector<ll>(3));\\n\\tvector<ll> M={(1ll<<61)-1,998244353,924924167};\\n\\tvector<int> order={0},seen(N,-2);\\n\\trep(i,N){\\n\\t\\tint a=order[i];\\n\\t\\tfor(auto x:G[a]){\\n\\t\\t\\tif(seen[a]==x) continue;\\n\\t\\t\\tseen[x]=a;\\n\\t\\t\\torder.push_back(x);\\n\\t\\t}\\n\\t}\\n\\trep(m,3){\\n\\t\\tfor(int i=N-1;i>=0;i--){\\n\\t\\t\\tint a=order[i];\\n\\t\\t\\tfor(auto x:G[a]){\\n\\t\\t\\t\\tif(seen[a]==x) continue;\\n\\t\\t\\t\\tdp[a][m]+=dp[x][m];\\n\\t\\t\\t\\tdp[a][m]%=M[m];\\n\\t\\t\\t}\\n\\t\\t\\tdp[a][m]*=2ll;\\n\\t\\t\\tdp[a][m]++;\\n\\t\\t\\tdp[a][m]%=M[m];\\n\\t\\t}\\n\\t}\\n\\tll ans=0;\\n\\tmap<vector<ll>,ll> table;\\n\\trep(i,N){\\n\\t\\tans+=table[dp[i]];\\n\\t\\ttable[dp[i]]++;\\n\\t}\\n\\tcout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.12,\n \"time_ms\": 10,\n \"memory_kb\": 7236,\n \"score_of_the_acc\": -0.0277,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2784_6090668\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#define _GLIBCXX_DEBUG\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=1167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=1e9+7;\\n#define rep(i,a) for (int i=0;i<a;i++)\\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\\\";}\\n\\n\\nvoid solve();\\n\\n// rainy ~ 雨に打たれて ~\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\tsolve();\\n}\\n\\nvoid solve(){\\n\\tint N;\\n\\tcin>>N;\\n\\tvector<vector<int>> G(N);\\n\\trep(i,N-1){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\ta--,b--;\\n\\t\\tG[a].push_back(b);\\n\\t\\tG[b].push_back(a);\\n\\t}\\n\\tvector<vector<int>> dp(N,vector<int>(3));\\n\\tvector<int> M={1000000007,998244353,924924167};\\n\\tvector<int> order={0},seen(N,-2);\\n\\trep(i,N){\\n\\t\\tint a=order[i];\\n\\t\\tfor(auto x:G[a]){\\n\\t\\t\\tif(seen[a]==x) continue;\\n\\t\\t\\tseen[x]=a;\\n\\t\\t\\torder.push_back(x);\\n\\t\\t}\\n\\t}\\n\\trep(m,3){\\n\\t\\tfor(int i=N-1;i>=0;i--){\\n\\t\\t\\tint a=order[i];\\n\\t\\t\\tfor(auto x:G[a]){\\n\\t\\t\\t\\tif(seen[a]==x) continue;\\n\\t\\t\\t\\tdp[a][m]+=dp[x][m];\\n\\t\\t\\t\\tdp[a][m]%=M[m];\\n\\t\\t\\t}\\n\\t\\t\\tdp[a][m]*=2ll;\\n\\t\\t\\tdp[a][m]++;\\n\\t\\t\\tdp[a][m]%=M[m];\\n\\t\\t}\\n\\t}\\n\\tll ans=0;\\n\\tmap<vector<int>,ll> table;\\n\\trep(i,N){\\n\\t\\tans+=table[dp[i]];\\n\\t\\ttable[dp[i]]++;\\n\\t}\\n\\tcout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.12,\n \"time_ms\": 10,\n \"memory_kb\": 7232,\n \"score_of_the_acc\": -0.0277,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2784_6014088\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing ull = unsigned long long int;\\nusing P = pair<ll, ll>;\\nusing P3 = pair<int, P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF32 = 1 << 30;\\nconstexpr ll INF64 = 1LL << 60;\\nconstexpr ll MOD = 1000000007;\\n// constexpr ll MOD = 998244353;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr int di8[] = {0, 1, 1, 1, 0, -1, -1, -1};\\nconstexpr int dj8[] = {1, 1, 0, -1, -1, -1, 0, 1};\\nconstexpr double EPS = 1e-10;\\nconst double PI = acos(-1);\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REP(i,n) for(int i=0,i_len=n; i<i_len; ++i)\\n\\ntemplate<typename T1,typename T2> bool chmax(T1 &a, T2 b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<typename T1,typename T2> bool chmin(T1 &a, T2 b) { if (b<a) { a=b; return 1; } return 0; }\\n\\nstruct Hash {\\n static constexpr int M = 2;\\n static constexpr ll MODS[M] = {999999937, 1000000007};\\n static constexpr ll BASE = 100007;\\n\\n int n;\\n ll hash[M];\\n void init(){\\n n = 0;\\n REP(k,M){\\n hash[k] = 0;\\n }\\n }\\n void push(int d){\\n n++;\\n REP(k,M){\\n hash[k] = (hash[k]*BASE + d) % MODS[k];\\n }\\n }\\n ll get(int k) {\\n return hash[k];\\n }\\n};\\n\\nbool match(Hash& a, Hash& b) {\\n bool res = true;\\n for (int k = 0; k < Hash::M; k++) {\\n res &= a.get(k) == b.get(k);\\n }\\n return res;\\n}\\n\\nHash add(Hash a, Hash b){\\n Hash res;\\n res.init();\\n REP(i, Hash::M){\\n res.hash[i] = (a.get(i) + b.get(i)) % Hash::MODS[i];\\n }\\n res.n = max(a.n, b.n);\\n return res;\\n}\\n\\nvector<vector<int> > g;\\nvector<Hash> hs;\\n\\nHash dfs(int now){\\n Hash res;\\n res.init();\\n for(auto nxt : g[now]){\\n res = add(res, dfs(nxt));\\n }\\n res.push(1);\\n return hs[now] = res;\\n}\\n\\nint solve(){\\n int n;\\n cin >> n;\\n g.resize(n);\\n for(int i=0;i<n-1;i++){\\n int a, b;\\n cin >> a >> b;\\n a--; b--;\\n g[a].push_back(b);\\n }\\n hs.resize(n);\\n dfs(0);\\n ll ans = 0;\\n map<P, ll> cnt;\\n REP(i,n){\\n cnt[P(hs[i].get(0), hs[i].get(1))]++;\\n // cout << hs[i].get(0) << \\\" \\\" << hs[i].get(1) << endl;\\n }\\n for(auto& node : cnt){\\n ll x = node.second;\\n // cout << x << endl;\\n ans += x*(x-1)/2;\\n }\\n cout <<ans << endl;\\n return 0;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n solve();\\n // int T; cin >> T; REP(t,T) solve();\\n // while(!solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 28124,\n \"score_of_the_acc\": -0.4453,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2784_6011426\",\n \"code_snippet\": \"#include<bits/stdc++.h> \\nusing namespace std;\\ntypedef long long ll;\\n#define all(x) (x).begin(),(x).end()\\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}\\nint dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};\\nlong double eps = 1e-9;\\nlong double pi = acos(-1);\\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 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\\nvector<vector<int>> v(200200);\\nconst ll mul[] = {1007,1009,1013,1001};\\nconst ll mod[] = {1000000007,1000000023,1000000087,1000000093};\\nconst int hash_size = 3;\\n\\nmap<vector<ll>, ll> mp;\\nll ans = 0;\\nvector<ll> dfs(int p, int pre=-1){\\n vector<ll> ret(hash_size, 1);\\n for(auto i:v[p]){\\n if(i == pre) continue;\\n auto g = dfs(i, p);\\n for(int i=0;i<hash_size;i++){\\n ret[i] += g[i] * mul[i] % mod[i];\\n if(ret[i] >= mod[i]) ret[i] -= mod[i];\\n }\\n }\\n ans += mp[ret];\\n mp[ret]++;\\n return ret;\\n}\\n\\n\\nsigned main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n\\n int n;\\n cin>>n;\\n for(int i=1;i<n;i++){\\n int a,b;\\n cin>>a>>b;\\n a--,b--;\\n v[a].push_back(b);\\n v[b].push_back(a);\\n }\\n dfs(0, -1);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 31256,\n \"score_of_the_acc\": -0.7007,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2784_5977121\",\n \"code_snippet\": \"#pragma region Macros\\n#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#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__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 OVERLOAD3(_1, _2, _3, name, ...) name\\n#define ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\n#define REP1(i, n) for(int i = 0; i < (n); i++)\\n#define REP2(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\nconstexpr int MOD2 = 998244353;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\n\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\nint popcount(int x) { return __builtin_popcount(x); }\\nll popcount(ll x) { return __builtin_popcountll(x); }\\n#pragma endregion Macros\\n\\nusing ull = unsigned long long;\\nusing ui128 = __uint128_t;\\nconstexpr ull mod = (1ULL << 61) - 1;\\n\\ninline ull add(ull a, ull b) {\\n if((a += b) >= mod) {\\n a -= mod;\\n }\\n return a;\\n}\\ninline ull mul(ull a, ull b) {\\n ui128 t = (ui128)a * b;\\n ull na = t >> 61;\\n ull nb = t & mod;\\n if((na += nb) >= mod) {\\n na -= mod;\\n }\\n return na;\\n}\\n\\nint N;\\nvector<int> G[100001];\\null base, dp[100001];\\n\\null dfs(int u, int p, int d) {\\n ull res = base;\\n for(int v : G[u]) {\\n if(v == p) continue;\\n res = add(res, mul(dfs(v, u, d+1), base));\\n }\\n return (dp[u] = res);\\n}\\n\\nint main() {\\n random_device seed_gen;\\n mt19937_64 engine(seed_gen());\\n uniform_int_distribution<ull> rand(2, mod-1);\\n base = rand(engine);\\n \\n cin >> 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 dfs(0, -1, 0);\\n map<ull, int> cnt;\\n REP(i, N) cnt[dp[i]] += 1;\\n ll ans = 0;\\n for(auto [h, sz] : cnt) {\\n ans += (ll)sz * (sz-1) / 2;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 25260,\n \"score_of_the_acc\": -0.4076,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1673,"cells":{"group_id":{"kind":"string","value":"aoj_2786_cpp"},"problem_description":{"kind":"string","value":"Share the Ruins Preservation\nTwo organizations International Community for Preservation of Constructions (ICPC) and Japanese Archaeologist Group (JAG) engage in ruins preservation. Recently, many ruins were found in a certain zone. The two organizations decided to share the preservation of the ruins by assigning some of the ruins to ICPC and the other ruins to JAG.\nNow, ICPC and JAG make a rule for assignment as follows:\nDraw a vertical straight line from the north to the south, avoiding to intersect ruins.\nRuins located to the west of the line are preserved by ICPC. On the other hand, ruins located to the east of the line are preserved by JAG. (It is possible that no ruins are located to the east/west of the line; in this case, ICPC/JAG will preserve no ruins.)\nA problem is where to draw a straight line. For each organization, the way to preserve its assigned ruins is to make exactly one fence such that all the assigned ruins are in the region surrounded by the fence. Furthermore, they should minimize the length of such a fence for their budget. If the surrounded areas are vast, expensive costs will be needed to maintain the inside of areas. Therefore, they want to minimize the total preservation cost, i.e. the sum of the areas surrounded by two fences. Your task is to write a program computing the minimum sum of the areas surrounded by two fences, yielded by drawing an appropriate straight line.\nInput\nThe input consists of a single test case.\n$N$\n$x_1$ $y_1$\n$x_2$ $y_2$\n...\n$x_N$ $y_N$\nThe first line contains an integer $N$ ($1 \\leq N \\leq 100,000$), which is the number of founded ruins. The following $N$ lines represent the location of the ruins. The $i$-th line of them consists of two integers $x_i$ and $y_i$, which indicate the location of the $i$-th ruin is $x_i$ east and $y_i$ north from a certain location in the zone. You can assume the following things for the ruins:\n$-10^9 \\leq x_i, y_i \\leq 10^9$\nYou can ignore the sizes of ruins. That is, you can assume ruins are points.\nNo pair of ruins has the same location.\nOutput\nPrint the minimum total preservation cost yielded by drawing an appropriate straight line. You should round off the cost to the nearest integer.\nSample Input 1\n8\n-10 0\n-10 5\n-5 5\n-5 0\n10 0\n10 -5\n5 -5\n5 0\nOutput for the Sample Input 1\n50\nSample Input 2\n5\n0 0\n0 1\n0 2\n1 0\n1 1\nOutput for the Sample Input 2\n0\nSample Input 3\n6\n1 5\n1 6\n0 5\n0 -5\n-1 -5\n-1 -6\nOutput for the Sample Input 3\n6\nSample Input 4\n10\n2 5\n4 6\n9 5\n8 8\n1 3\n6 4\n5 9\n7 3\n7 7\n3 9\nOutput for the Sample Input 4\n17"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2786_10850971","code_snippet":"#include<bits/stdc++.h>\n\n#define PB push_back\n#define MP make_pair\n#define F first\n#define S second\n\n#define FRI freopen(\"zin.txt\",\"r\",stdin)\n#define FRO freopen(\"out.txt\",\"w\",stdout)\n#define DB(x) #x\" =>\",x\n#define debug(args...) {dbg,args; cerr<<endl;}\n#define RAD(x) ((x*PI)/180)\n#define DEG(x) ((x*180)/PI)\n#define NEX(x,y) ((x)==(y)-1?0:(x)+1)\n#define PRE(x,y) ((x)==0?(y)-1:(x)-1)\n\n#define EPS 1e-12\n#define INF 10000000000007LL\n#define MAXN 100005\nusing namespace std;\n\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef long double LD;\n\nstruct debugger{\n template<typename T> debugger& operator , (const T& v){\n cerr<<v<<\" \";\n return *this;\n }\n}dbg;\n\nclass PT {\npublic:\n LL x, y;\n PT() {}\n PT(LL x, LL y) : x(x), y(y) {}\n PT(const PT &p) : x(p.x), y(p.y) {}\n PT operator + (const PT &p) const { return PT(x+p.x, y+p.y); }\n PT operator - (const PT &p) const { return PT(x-p.x, y-p.y); }\n};\n\nLL SignedArea(PT a,PT b,PT c) {\n PT temp1(b.x-a.x,b.y-a.y),temp2(c.x-a.x,c.y-a.y);\n return temp1.x*temp2.y-temp1.y*temp2.x;\n}\n\nbool XYasscending(PT a,PT b) {\n if(a.x==b.x) return a.y<b.y;\n return a.x<b.x;\n}\n\nvector<PT>rawPts,U,L;\nvector<LL>xCoords,hi,lo;\nLL area[2][MAXN];\n\nint main() {\n// FRI;\n int i,n;\n LL x,y,ans,r1,r2,leftLo,leftHi;\n PT pivot;\n scanf(\"%d\",&n);\n for(i=0;i<n;i++) {\n scanf(\"%lld %lld\",&x,&y);\n rawPts.PB(PT(x,y));\n }\n sort(rawPts.begin(),rawPts.end(),XYasscending);\n for(i=0;i<rawPts.size();i++) {\n if(i==0||rawPts[i].x!=rawPts[i-1].x) {\n xCoords.PB(rawPts[i].x);\n lo.PB(rawPts[i].y);\n hi.PB(rawPts[i].y);\n }\n hi[hi.size()-1]=rawPts[i].y;\n }\n area[0][0]=0;\n pivot=PT(xCoords[0],lo[0]);\n\n U.PB(PT(xCoords[0],lo[0]));\n U.PB(PT(xCoords[0],hi[0]));\n L.PB(PT(xCoords[0],hi[0]));\n L.PB(PT(xCoords[0],lo[0]));\n\n for(i=1;i<xCoords.size();i++) {\n area[0][i]=area[0][i-1];\n// cout<<\"Considering \"<<xCoords[i]<<\" \"<<hi[i]<<\" \"<<lo[i]<<endl;\n// cout<<\"Initial \"<<area[0][i]<<endl;\n while(true) {\n if(U.size()<2) break;\n if(SignedArea(U[U.size()-2],U[U.size()-1],PT(xCoords[i],hi[i]))>=0) {\n area[0][i]-=SignedArea(pivot,U[U.size()-2],U[U.size()-1]);\n// cout<<\"Reduced \"<<area[0][i]<<endl;\n U.pop_back();\n }\n else break;\n }\n U.PB(PT(xCoords[i],hi[i]));\n area[0][i]+=SignedArea(pivot,U[U.size()-2],U[U.size()-1]);\n// cout<<\"Increased \"<<area[0][i]<<endl;\n\n while(true) {\n if(L.size()<2) break;\n if(SignedArea(L[L.size()-2],L[L.size()-1],PT(xCoords[i],lo[i]))<=0) {\n area[0][i]+=SignedArea(pivot,L[L.size()-2],L[L.size()-1]);\n// cout<<\"Reduced \"<<area[0][i]<<endl;\n L.pop_back();\n }\n else break;\n }\n L.PB(PT(xCoords[i],lo[i]));\n area[0][i]-=SignedArea(pivot,L[L.size()-2],L[L.size()-1]);\n// cout<<\"Increased \"<<area[0][i]<<endl;\n\n area[0][i]-=SignedArea(pivot,PT(xCoords[i-1],hi[i-1]),PT(xCoords[i-1],lo[i-1]));\n// cout<<\"Here \"<<area[0][i]<<endl;\n area[0][i]+=SignedArea(pivot,PT(xCoords[i],hi[i]),PT(xCoords[i],lo[i]));\n// cout<<\"Final \"<<area[0][i]<<endl;\n }\n\n area[1][xCoords.size()-1]=0;\n pivot=PT(xCoords[xCoords.size()-1],lo[xCoords.size()-1]);\n\n U.clear();\n L.clear();\n\n U.PB(PT(xCoords[xCoords.size()-1],lo[xCoords.size()-1]));\n U.PB(PT(xCoords[xCoords.size()-1],hi[xCoords.size()-1]));\n L.PB(PT(xCoords[xCoords.size()-1],hi[xCoords.size()-1]));\n L.PB(PT(xCoords[xCoords.size()-1],lo[xCoords.size()-1]));\n\n for(i=xCoords.size()-2;i>=0;i--) {\n area[1][i]=area[1][i+1];\n while(true) {\n if(U.size()<2) break;\n if(SignedArea(U[U.size()-2],U[U.size()-1],PT(xCoords[i],hi[i]))<=0) {\n area[1][i]-=SignedArea(pivot,U[U.size()-2],U[U.size()-1]);\n U.pop_back();\n }\n else break;\n }\n U.PB(PT(xCoords[i],hi[i]));\n area[1][i]+=SignedArea(pivot,U[U.size()-2],U[U.size()-1]);\n\n while(true) {\n if(L.size()<2) break;\n if(SignedArea(L[L.size()-2],L[L.size()-1],PT(xCoords[i],lo[i]))>=0) {\n area[1][i]+=SignedArea(pivot,L[L.size()-2],L[L.size()-1]);\n L.pop_back();\n }\n else break;\n }\n L.PB(PT(xCoords[i],lo[i]));\n area[1][i]-=SignedArea(pivot,L[L.size()-2],L[L.size()-1]);\n\n area[1][i]-=SignedArea(pivot,PT(xCoords[i+1],hi[i+1]),PT(xCoords[i+1],lo[i+1]));\n area[1][i]+=SignedArea(pivot,PT(xCoords[i],hi[i]),PT(xCoords[i],lo[i]));\n }\n\n ans=abs(area[0][0])+abs(area[1][1]);\n for(i=1;i<xCoords.size()-1;i++) ans=min(ans,abs(area[0][i])+abs(area[1][i+1]));\n\n if(ans&1) cout<<(ans+1)/2<<endl;\n else cout<<ans/2<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":11432,"score_of_the_acc":-0.6165,"final_rank":3},{"submission_id":"aoj_2786_10690700","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long X[100009];\nlong long Y[100009];\nlong long KEEP[100009];\nlong long MX[100009];\nlong long MI[100009];\nlong long ANS[100009],ANSS[100009];\nvector<long long>vec,XX[100009];\nmap<long long,long long>mymap;\n\nvector<pair<long long,long long> >U,L;\n\nvoid prnt(pair<long long,long long> A)\n{\n cout<<A.first<<\" \"<<A.second<<endl;\n}\n\npair<long long,long long> minu(pair<long long,long long> A,pair<long long,long long> B)\n{\n pair<long long,long long> C;\n C.first=-A.first*B.second+B.first*A.second;\n C.second=A.first*B.first;\n long long temp=__gcd(abs(C.first),abs(C.second));\n C.first/=temp;\n C.second/=temp;\n\n if(C.second<0)\n {\n C.first*=-1;\n C.second*=-1;\n }\n return C;\n}\n\npair<long long,long long> get(pair<long long,long long> A,pair<long long,long long> B)\n{\n pair<long long,long long> C;\n C.first=B.first-A.first;\n C.second=B.second-A.second;\n\n long long temp=__gcd(abs(C.first),abs(C.second));\n C.first/=temp;\n C.second/=temp;\n\n if(C.second<0)\n {\n C.first*=-1;\n C.second*=-1;\n }\n\n return C;\n}\n\nlong long get_area(pair<long long,long long> A,pair<long long,long long> B , pair<long long,long long>C)\n{\n long long ans=0;\n ans+=(A.first*B.second-A.second*B.first);\n ans+=(B.first*C.second-B.second*C.first);\n ans+=(C.first*A.second-C.second*A.first);\n return abs(ans);\n}\n\nint main()\n{\n long long n,i,j,k,l,ans,ind,siz,mi,mx,sl,su,temp,now;\n pair<long long,long long> now_ans,prev;\n cin>>n;\n\n for(i=1;i<=n;i++)\n {\n scanf(\"%lld%lld\",&X[i],&Y[i]);\n vec.push_back(X[i]);\n }\n\n sort(vec.begin(),vec.end());\n\n ind=0;\n\n for(i=0;i<n;i++)\n {\n if(i) if(vec[i]==vec[i-1]) continue;\n\n mymap[vec[i]]=++ind;\n KEEP[ind]=vec[i];\n }\n\n for(i=1;i<=n;i++)\n {\n XX[mymap[X[i]]].push_back(Y[i]);\n }\n\n for(i=1;i<=ind;i++) sort(XX[i].begin(),XX[i].end());\n for(i=1;i<=ind;i++)\n {\n siz=XX[i].size();\n MI[i]=XX[i][0];\n MX[i]=XX[i][siz-1];\n }\n\n U.clear();\n L.clear();\n sl=0;\n su=0;\n\n for(i=1;i<=ind;i++)\n {\n\n temp=0;\n if(sl==0)\n {\n L.push_back(make_pair(KEEP[i],MI[i]));\n sl++;\n }\n else\n {\n prev=get(L[sl-1],make_pair(KEEP[i],MI[i]));\n now=sl-1;\n\n while(1)\n {\n if(now<0) break;\n now_ans=get(L[now],make_pair(KEEP[i],MI[i]));\n if(minu(now_ans,prev).first<0) break;\n prev=now_ans;\n now--;\n }\n\n for(j=sl-1;j>now+1;j--)\n {\n temp+=get_area(make_pair(KEEP[i],MI[i]),L[j],L[j-1]);\n }\n\n for(j=sl-1;j>now+1;j--) L.pop_back();\n L.push_back(make_pair(KEEP[i],MI[i]));\n sl=L.size();\n }\n\n\n if(su==0)\n {\n U.push_back(make_pair(KEEP[i],MX[i]));\n su++;\n }\n else\n {\n prev=get(U[su-1],make_pair(KEEP[i],MX[i]));\n now=su-1;\n while(1)\n {\n if(now<0) break;\n now_ans=get(U[now],make_pair(KEEP[i],MX[i]));\n if(minu(now_ans,prev).first>0) break;\n prev=now_ans;\n now--;\n }\n\n\n for(j=su-1;j>now+1;j--)\n {\n temp+=get_area(make_pair(KEEP[i],MX[i]),U[j],U[j-1]);\n }\n\n for(j=su-1;j>now+1;j--) U.pop_back();\n U.push_back(make_pair(KEEP[i],MX[i]));\n su=U.size();\n\n }\n\n if(i>1) temp+=(MX[i]-MI[i]+MX[i-1]-MI[i-1])*(KEEP[i]-KEEP[i-1]);\n\n ANS[i]=ANS[i-1]+temp;\n }\n\n U.clear();\n L.clear();\n sl=0;\n su=0;\n\n\n for(i=ind;i>=1;i--)\n {\n temp=0;\n if(sl==0)\n {\n L.push_back(make_pair(KEEP[i],MI[i]));\n sl++;\n }\n else\n {\n prev=get(L[sl-1],make_pair(KEEP[i],MI[i]));\n now=sl-1;\n while(1)\n {\n if(now<0) break;\n now_ans=get(L[now],make_pair(KEEP[i],MI[i]));\n if(minu(now_ans,prev).first>0) break;\n prev=now_ans;\n now--;\n }\n\n\n for(j=sl-1;j>now+1;j--)\n {\n temp+=get_area(make_pair(KEEP[i],MI[i]),L[j],L[j-1]);\n }\n\n for(j=sl-1;j>now+1;j--) L.pop_back();\n L.push_back(make_pair(KEEP[i],MI[i]));\n sl=L.size();\n }\n\n if(su==0)\n {\n U.push_back(make_pair(KEEP[i],MX[i]));\n su++;\n }\n else\n {\n prev=get(U[su-1],make_pair(KEEP[i],MX[i]));\n now=su-1;\n while(1)\n {\n if(now<0) break;\n now_ans=get(U[now],make_pair(KEEP[i],MX[i]));\n if(minu(now_ans,prev).first<0) break;\n prev=now_ans;\n now--;\n }\n\n\n for(j=su-1;j>now+1;j--)\n {\n temp+=get_area(make_pair(KEEP[i],MX[i]),U[j],U[j-1]);\n }\n\n for(j=su-1;j>now+1;j--) U.pop_back();\n U.push_back(make_pair(KEEP[i],MX[i]));\n su=U.size();\n\n }\n\n if(i<ind) temp+=(MX[i]-MI[i]+MX[i+1]-MI[i+1])*(-KEEP[i]+KEEP[i+1]);\n\n ANSS[i]=ANSS[i+1]+temp;\n }\n\n\n ans=1LL<<62;\n\n for(i=0;i<=ind;i++)\n {\n ans=min(ans,ANS[i]+ANSS[i+1]);\n }\n\n cout<<(1+ans)/2<<endl;\n\n\n\n}","accuracy":0.1,"time_ms":70,"memory_kb":11340,"score_of_the_acc":-1.325,"final_rank":20},{"submission_id":"aoj_2786_10296372","code_snippet":"// AOJ #2786 Share the Ruins Preservation\n// 2025.3.14\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\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 P { ll x, y; };\n\nll cross(const P &a, const P &b, const P &c) {\n return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);\n}\n\nll cross(const P &a, const P &b) {\n return a.x * b.y - a.y * b.x;\n}\n\nvector<ld> getPrefixArea(const vector<P>& pts) {\n int n = pts.size();\n vector<ld> pre(n, 0.0L);\n vector<P> L;\n vector<ld> LS;\n vector<P> U;\n vector<ld> US;\n for (int i = 0; i < n; i++){\n P p = pts[i];\n while(L.size() >= 2 && cross(L[L.size()-2], L[L.size()-1], p) <= 0) {\n L.pop_back();\n LS.pop_back();\n }\n if(L.empty()){\n L.push_back(p);\n LS.push_back(0);\n } else {\n L.push_back(p);\n ll c = cross(L[L.size()-2], p);\n ld sum = (LS.empty()? 0 : LS.back()) + c;\n LS.push_back(sum);\n }\n\n while(U.size() >= 2 && cross(U[U.size()-2], U[U.size()-1], p) >= 0) {\n U.pop_back();\n US.pop_back();\n }\n if(U.empty()){\n U.push_back(p);\n US.push_back(0);\n } else {\n U.push_back(p);\n ll c = cross(U[U.size()-2], p);\n ld sum = (US.empty()? 0 : US.back()) + c;\n US.push_back(sum);\n }\n\n if(i < 2) {\n pre[i] = 0.0L;\n } else {\n ld area2 = US.back() - LS.back();\n if(area2 < 0) area2 = -area2;\n pre[i] = area2 / 2.0L;\n }\n }\n return pre;\n}\n\nvector<ld> getSuffixArea(const vector<P>& pts) {\n int n = pts.size();\n vector<ld> suf(n, 0.0L);\n vector<P> L;\n vector<ld> LS;\n vector<P> U;\n vector<ld> US;\n for (int i = n-1; i >= 0; i--){\n P p = pts[i];\n while(L.size() >= 2 && cross(L[L.size()-2], L[L.size()-1], p) <= 0) {\n L.pop_back();\n LS.pop_back();\n }\n if(L.empty()){\n L.push_back(p);\n LS.push_back(0);\n } else {\n L.push_back(p);\n ll c = cross(L[L.size()-2], p);\n ld sum = (LS.empty()? 0 : LS.back()) + c;\n LS.push_back(sum);\n }\n\n while(U.size() >= 2 && cross(U[U.size()-2], U[U.size()-1], p) >= 0) {\n U.pop_back();\n US.pop_back();\n }\n if(U.empty()){\n U.push_back(p);\n US.push_back(0);\n } else {\n U.push_back(p);\n ll c = cross(U[U.size()-2], p);\n ld sum = (US.empty()? 0 : US.back()) + c;\n US.push_back(sum);\n }\n\n if(i > n-3) {\n suf[i] = 0.0L;\n } else {\n ld area2 = US.back() - LS.back();\n if(area2 < 0) area2 = -area2;\n suf[i] = area2 / 2.0L;\n }\n }\n return suf;\n}\n\nint main(){\n int n = Cin();\n vector<P> pts(n);\n for (int i = 0; i < n; i++){\n pts[i].x = Cin(), pts[i].y = Cin();\n }\n sort(pts.begin(), pts.end(), [](const P &a, const P &b){\n if(a.x == b.x) return a.y < b.y;\n return a.x < b.x;\n });\n\n vector<ld> pre = getPrefixArea(pts);\n vector<ld> suf = getSuffixArea(pts);\n\n ld ans = pre[n-1];\n for (int i = 0; i < n-1; i++){\n if(pts[i].x < pts[i+1].x){\n ld tot = pre[i] + suf[i+1];\n if(tot < ans) ans = tot;\n }\n }\n Cout((ll)floor(ans + 0.5L));\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":12136,"score_of_the_acc":-0.5172,"final_rank":1},{"submission_id":"aoj_2786_9822918","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nstruct Point {\n ll X, Y;\n Point() : X(0), Y(0) {}\n Point(ll x, ll y) : X(x), Y(y) {}\n};\n\nll cross(Point A, Point B) {\n return A.X * B.Y - A.Y * B.X;\n}\n\nll Area(Point A, Point B, Point C) {\n B.X -= A.X, B.Y -= A.Y;\n C.X -= A.X, C.Y -= A.Y;\n return abs(cross(B,C));\n}\n\nint ccw(Point A, Point B, Point C) {\n B.X -= A.X, B.Y -= A.Y;\n C.X -= A.X, C.Y -= A.Y;\n if (cross(B,C) > 0) return 1;\n if (cross(B,C) < 0) return -1;\n return 0;\n}\n\nvector<ll> Calc(vector<Point> P) {\n int N = P.size();\n vector<ll> Ret(N+1);\n Ret[0] = Ret[1] = 0;\n vector<Point> upper, lower;\n upper.push_back(P[0]), lower.push_back(P[0]);\n rep(i,1,N) {\n Ret[i+1] = Ret[i];\n while(upper.size() >= 2 && ccw(upper[upper.size()-2],upper.back(),P[i]) == 1) {\n Ret[i+1] -= Area(upper[upper.size()-2], upper.back(), lower.back());\n upper.pop_back();\n }\n while(lower.size() >= 2 && ccw(lower[lower.size()-2],lower.back(),P[i]) == -1) {\n Ret[i+1] -= Area(lower[lower.size()-2], lower.back(), upper.back());\n lower.pop_back();\n }\n Ret[i+1] += Area(lower.back(), upper.back(), P[i]);\n lower.push_back(P[i]), upper.push_back(P[i]);\n }\n return Ret;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<Point> P(N), RP(N);\n rep(i,0,N) {\n ll x, y;\n cin >> x >> y;\n P[i] = Point(x,y);\n RP[i] = Point(-x,y);\n }\n sort(ALL(P), [&](Point P1, Point P2){\n if (P1.X == P2.X) return P1.Y < P2.Y;\n return P1.X < P2.X;\n });\n sort(ALL(RP), [&](Point P1, Point P2){\n if (P1.X == P2.X) return P1.Y < P2.Y;\n return P1.X < P2.X;\n });\n auto A = Calc(P), RA = Calc(RP);\n reverse(ALL(RA));\n ll ANS = RA[0];\n rep(i,0,N-1) {\n if (P[i].X == P[i+1].X) continue;\n chmin(ANS, A[i+1]+RA[i+1]);\n }\n cout << (ANS+1)/2 << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":14204,"score_of_the_acc":-1.2168,"final_rank":6},{"submission_id":"aoj_2786_9822906","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nusing T = double;\nconst T eps = 1e-8;\nusing Point = complex<T>;\nusing Poly = vector<Point>;\n#define X real()\n#define Y imag()\ntemplate <typename T> inline bool eq(const T &a, const T &b) {\n return fabs(a - b) < eps;\n}\nbool cmp(const Point &a, const Point &b) {\n auto sub = [&](Point a) {\n return (a.Y < 0 ? -1 : (a.Y == 0 && a.X >= 0 ? 0 : 1));\n };\n if (sub(a) != sub(b))\n return sub(a) < sub(b);\n return a.Y * b.X < a.X * b.Y;\n}\nstruct Line {\n Point a, b, dir;\n Line() {}\n Line(Point _a, Point _b) : a(_a), b(_b), dir(b - a) {}\n Line(T A, T B, T C) {\n if (eq(A, .0)) {\n a = Point(0, C / B), b = Point(1 / C / B);\n } else if (eq(B, .0)) {\n a = Point(C / A, 0), b = Point(C / A, 1);\n } else {\n a = Point(0, C / B), b = Point(C / A, 0);\n }\n }\n};\nstruct Segment : Line {\n Segment() {}\n Segment(Point _a, Point _b) : Line(_a, _b) {}\n};\nstruct Circle {\n Point p;\n T r;\n Circle() {}\n Circle(Point _p, T _r) : p(_p), r(_r) {}\n};\n\nistream &operator>>(istream &is, Point &p) {\n T x, y;\n is >> x >> y;\n p = Point(x, y);\n return is;\n}\nostream &operator<<(ostream &os, Point &p) {\n os << fixed << setprecision(12) << p.X << ' ' << p.Y;\n return os;\n}\nPoint unit(const Point &a) {\n return a / abs(a);\n}\nT dot(const Point &a, const Point &b) {\n return a.X * b.X + a.Y * b.Y;\n}\nT cross(const Point &a, const Point &b) {\n return a.X * b.Y - a.Y * b.X;\n}\nPoint rot(const Point &a, const T &theta) {\n return Point(cos(theta) * a.X - sin(theta) * a.Y,\n sin(theta) * a.X + cos(theta) * a.Y);\n}\nPoint rot90(const Point &a) {\n return Point(-a.Y, a.X);\n}\nT arg(const Point &a, const Point &b, const Point &c) {\n double ret = acos(dot(a - b, c - b) / abs(a - b) / abs(c - b));\n if (cross(a - b, c - b) < 0)\n ret = -ret;\n return ret;\n}\n\nPoint Projection(const Line &l, const Point &p) {\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\nPoint Projection(const Segment &l, const Point &p) {\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\nPoint Reflection(const Line &l, const Point &p) {\n return p + (Projection(l, p) - p) * 2.;\n}\nint ccw(const Point &a, Point b, Point c) {\n b -= a;\n c -= a;\n if (cross(b, c) > eps)\n return 1; // ccw\n\n if (cross(b, c) < -eps)\n return -1; // cw\n\n if (dot(b, c) < 0)\n return 2; // c,a,b\n\n if (norm(b) < norm(c))\n return -2; // a,b,c\n\n return 0; // a,c,b\n\n}\nbool isOrthogonal(const Line &a, const Line &b) {\n return eq(dot(a.b - a.a, b.b - b.a), .0);\n}\nbool isParallel(const Line &a, const Line &b) {\n return eq(cross(a.b - a.a, b.b - b.a), .0);\n}\nbool isIntersect(const Segment &a, const Segment &b) {\n return ccw(a.a, a.b, b.a) * ccw(a.a, a.b, b.b) <= 0 and\n ccw(b.a, b.b, a.a) * ccw(b.a, b.b, a.b) <= 0;\n}\nint isIntersect(const Circle &a, const Circle &b) {\n T d = abs(a.p - b.p);\n if (d > a.r + b.r + eps)\n return 4;\n if (eq(d, a.r + b.r))\n return 3;\n if (eq(d, abs(a.r - b.r)))\n return 1;\n if (d < abs(a.r - b.r) - eps)\n return 0;\n return 2;\n}\nT Dist(const Line &a, const Point &b) {\n Point c = Projection(a, b);\n return abs(c - b);\n}\nT Dist(const Segment &a, const Point &b) {\n if (dot(a.b - a.a, b - a.a) < eps)\n return abs(b - a.a);\n if (dot(a.a - a.b, b - a.b) < eps)\n return abs(b - a.b);\n return abs(cross(a.b - a.a, b - a.a)) / abs(a.b - a.a);\n}\nT Dist(const Segment &a, const Segment &b) {\n if (isIntersect(a, b))\n return .0;\n T res = min({Dist(a, b.a), Dist(a, b.b), Dist(b, a.a), Dist(b, a.b)});\n return res;\n}\nPoint Intersection(const Line &a, const Line &b) {\n T d1 = cross(a.b - a.a, b.b - b.a);\n T d2 = cross(a.b - a.a, a.b - b.a);\n if (eq(d1, 0.) and eq(d2, 0.))\n return b.a;\n return b.a + (b.b - b.a) * (d2 / d1);\n}\nPoly Intersection(const Circle &a, const Line &b) {\n Poly res;\n T d = Dist(b, a.p);\n if (d > a.r + eps)\n return res;\n Point h = Projection(b, a.p);\n if (eq(d, a.r)) {\n res.push_back(h);\n return res;\n }\n Point e = unit(b.b - b.a);\n T ph = sqrt(a.r * a.r - d * d);\n res.push_back(h - e * ph);\n res.push_back(h + e * ph);\n return res;\n}\nPoly Intersection(const Circle &a, const Segment &b) {\n Line c(b.a, b.b);\n Poly sub = Intersection(a, c);\n double xmi = min(b.a.X, b.b.X), xma = max(b.a.X, b.b.X);\n double ymi = min(b.a.Y, b.b.Y), yma = max(b.a.Y, b.b.Y);\n Poly res;\n rep(i, 0, sub.size()) {\n if (xmi <= sub[i].X + eps and sub[i].X - eps <= xma and\n ymi <= sub[i].Y + eps and sub[i].Y - eps <= yma) {\n res.push_back(sub[i]);\n }\n }\n return res;\n}\nPoly Intersection(const Circle &a, const Circle &b) {\n Poly res;\n int mode = isIntersect(a, b);\n T d = abs(a.p - b.p);\n if (mode == 4 or mode == 0)\n return res;\n if (mode == 3) {\n T t = a.r / (a.r + b.r);\n res.push_back(a.p + (b.p - a.p) * t);\n return res;\n }\n if (mode == 1) {\n if (b.r < a.r - eps) {\n res.push_back(a.p + (b.p - a.p) * (a.r / d));\n } else {\n res.push_back(b.p + (a.p - b.p) * (b.r / d));\n }\n return res;\n }\n T rc = (a.r * a.r + d * d - b.r * b.r) / d / 2.;\n T rs = sqrt(a.r * a.r - rc * rc);\n if (a.r - abs(rc) < eps)\n rs = 0;\n Point e = unit(b.p - a.p);\n res.push_back(a.p + rc * e + rs * e * Point(0, 1));\n res.push_back(a.p + rc * e + rs * e * Point(0, -1));\n return res;\n}\nPoly HalfplaneIntersection(vector<Line> &H) {\n sort(ALL(H), [&](Line &l1, Line &l2) { return cmp(l1.dir, l2.dir); });\n auto outside = [&](Line &L, Point p) -> bool {\n return cross(L.dir, p - L.a) < -eps;\n };\n deque<Line> deq;\n int sz = 0;\n rep(i, 0, SZ(H)) {\n while (sz > 1 and\n outside(H[i], Intersection(deq[sz - 1], deq[sz - 2]))) {\n deq.pop_back();\n sz--;\n }\n while (sz > 1 and outside(H[i], Intersection(deq[0], deq[1]))) {\n deq.pop_front();\n sz--;\n }\n if (sz > 0 and fabs(cross(H[i].dir, deq[sz - 1].dir)) < eps) {\n if (dot(H[i].dir, deq[sz - 1].dir) < 0) {\n return {};\n }\n if (outside(H[i], deq[sz - 1].a)) {\n deq.pop_back();\n sz--;\n } else\n continue;\n }\n deq.push_back(H[i]);\n sz++;\n }\n\n while (sz > 2 and outside(deq[0], Intersection(deq[sz - 1], deq[sz - 2]))) {\n deq.pop_back();\n sz--;\n }\n while (sz > 2 and outside(deq[sz - 1], Intersection(deq[0], deq[1]))) {\n deq.pop_front();\n sz--;\n }\n if (sz < 3)\n return {};\n deq.push_back(deq.front());\n Poly ret;\n rep(i, 0, sz) ret.push_back(Intersection(deq[i], deq[i + 1]));\n return ret;\n}\n\nT Area(const Poly &a) {\n T res = 0;\n int n = a.size();\n rep(i, 0, n) res += cross(a[i], a[(i + 1) % n]);\n return fabs(res / 2.);\n}\nT Area(const Poly &a, const Circle &b) {\n int n = a.size();\n if (n < 3)\n return .0;\n auto rec = [&](auto self, const Circle &c, const Point &p1,\n const Point &p2) {\n Point va = c.p - p1, vb = c.p - p2;\n T f = cross(va, vb), res = .0;\n if (eq(f, .0))\n return res;\n if (max(abs(va), abs(vb)) < c.r + eps)\n return f;\n if (Dist(Segment(p1, p2), c.p) > c.r - eps)\n return c.r * c.r * arg(vb * conj(va));\n auto u = Intersection(c, Segment(p1, p2));\n Poly sub;\n sub.push_back(p1);\n for (auto &x : u)\n sub.push_back(x);\n sub.push_back(p2);\n rep(i, 0, sub.size() - 1) res += self(self, c, sub[i], sub[i + 1]);\n return res;\n };\n T res = .0;\n rep(i, 0, n) res += rec(rec, b, a[i], a[(i + 1) % n]);\n return fabs(res / 2.);\n}\nT Area(const Circle &a, const Circle &b) {\n T d = abs(a.p - b.p);\n if (d >= a.r + b.r - eps)\n return .0;\n if (d <= abs(a.r - b.r) + eps) {\n T r = min(a.r, b.r);\n return M_PI * r * r;\n }\n T ath = acos((a.r * a.r + d * d - b.r * b.r) / d / a.r / 2.);\n T res = a.r * a.r * (ath - sin(ath * 2) / 2.);\n T bth = acos((b.r * b.r + d * d - a.r * a.r) / d / b.r / 2.);\n res += b.r * b.r * (bth - sin(bth * 2) / 2.);\n return fabs(res);\n}\nbool isConvex(const Poly &a) {\n int n = a.size();\n int cur, pre, nxt;\n rep(i, 0, n) {\n pre = (i - 1 + n) % n;\n nxt = (i + 1) % n;\n cur = i;\n if (ccw(a[pre], a[cur], a[nxt]) == -1)\n return 0;\n }\n return 1;\n}\nint isContained(const Poly &a,\n const Point &b) { // 0:not contain,1:on edge,2:contain\n\n bool res = 0;\n int n = a.size();\n rep(i, 0, n) {\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\n if (p.Y > q.Y)\n swap(p, q);\n if (p.Y < eps and eps < q.Y and cross(p, q) > eps)\n res ^= 1;\n if (eq(cross(p, q), .0) and dot(p, q) < eps)\n return 1;\n }\n return (res ? 2 : 0);\n}\nPoly ConvexHull(Poly &a) {\n sort(ALL(a), [](const Point &p, const Point &q) {\n return (eq(p.Y, q.Y) ? p.X < q.X : p.Y < q.Y);\n });\n a.erase(unique(ALL(a)), a.end());\n int n = a.size(), k = 0;\n Poly res(n * 2);\n for (int i = 0; i < n; res[k++] = a[i++]) {\n while (k >= 2 and\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\n k--;\n }\n for (int i = n - 2, t = k + 1; i >= 0; res[k++] = a[i--]) {\n while (k >= t and\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\n k--;\n }\n res.resize(k - 1);\n return res;\n}\nT Diam(const Poly &a) {\n int n = a.size();\n int x = 0, y = 0;\n rep(i, 1, n) {\n if (a[i].Y > a[x].Y)\n x = i;\n if (a[i].Y < a[y].Y)\n y = i;\n }\n T res = abs(a[x] - a[y]);\n int i = x, j = y;\n do {\n if (cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j]) < 0)\n i = (i + 1) % n;\n else\n j = (j + 1) % n;\n chmax(res, abs(a[i] - a[j]));\n } while (i != x or j != y);\n return res;\n}\nPoly Cut(const Poly &a, const Line &l) {\n int n = a.size();\n Poly res;\n rep(i, 0, n) {\n Point p = a[i], q = a[(i + 1) % n];\n if (ccw(l.a, l.b, p) != -1)\n res.push_back(p);\n if (ccw(l.a, l.b, p) * ccw(l.a, l.b, q) < 0)\n res.push_back(Intersection(Line(p, q), l));\n }\n return res;\n}\n\nT Closest(Poly &a) {\n int n = a.size();\n if (n <= 1)\n return 0;\n sort(ALL(a), [&](Point a, Point b) {\n return (eq(a.X, b.X) ? a.Y < b.Y : a.X < b.X);\n });\n Poly buf(n);\n auto rec = [&](auto self, int lb, int rb) -> T {\n if (rb - lb <= 1)\n return (T)INF;\n int mid = (lb + rb) >> 1;\n auto x = a[mid].X;\n T res = min(self(self, lb, mid), self(self, mid, rb));\n inplace_merge(a.begin() + lb, a.begin() + mid, a.begin() + rb,\n [&](auto p, auto q) { return p.Y < q.Y; });\n int ptr = 0;\n rep(i, lb, rb) {\n if (abs(a[i].X - x) >= res)\n continue;\n rep(j, 0, ptr) {\n auto sub = a[i] - buf[ptr - 1 - j];\n if (sub.Y >= res)\n break;\n chmin(res, abs(sub));\n }\n buf[ptr++] = a[i];\n }\n return res;\n };\n return rec(rec, 0, n);\n}\n\nCircle Incircle(const Point &a, const Point &b, const Point &c) {\n T A = abs(b - c), B = abs(c - a), C = abs(a - b);\n Point p(A * a.X + B * b.X + C * c.X, A * a.Y + B * b.Y + C * c.Y);\n p /= (A + B + C);\n T r = Dist(Line(a, b), p);\n return Circle(p, r);\n}\nCircle Circumcircle(const Point &a, const Point &b, const Point &c) {\n Line l1((a + b) / 2., (a + b) / 2. + (b - a) * Point(0, 1));\n Line l2((b + c) / 2., (b + c) / 2. + (c - b) * Point(0, 1));\n Point p = Intersection(l1, l2);\n return Circle(p, abs(p - a));\n}\nPoly tangent(const Point &a, const Circle &b) {\n return Intersection(b, Circle(a, sqrt(norm(b.p - a) - b.r * b.r)));\n}\nvector<Line> tangent(const Circle &a, const Circle &b) {\n vector<Line> res;\n T d = abs(a.p - b.p);\n if (eq(d, 0.))\n return res;\n Point u = unit(b.p - a.p);\n Point v = u * Point(0, 1);\n for (int t : {-1, 1}) {\n T h = (a.r + b.r * t) / d;\n if (eq(h * h, 1.)) {\n res.push_back(Line(a.p + (h > 0 ? u : -u) * a.r,\n a.p + (h > 0 ? u : -u) * a.r + v));\n } else if (1 > h * h) {\n Point U = u * h, V = v * sqrt(1 - h * h);\n res.push_back(Line(a.p + (U + V) * a.r, b.p - (U + V) * (b.r * t)));\n res.push_back(Line(a.p + (U - V) * a.r, b.p - (U - V) * (b.r * t)));\n }\n }\n return res;\n}\n\n/**\n * @brief Geometry\n */\n\nvector<double> Calc(vector<Point> P) {\n int N = P.size();\n vector<double> Ret(N+1);\n Ret[0] = Ret[1] = 0.0;\n vector<Point> upper, lower;\n upper.push_back(P[0]), lower.push_back(P[0]);\n rep(i,1,N) {\n Ret[i+1] = Ret[i];\n while(upper.size() >= 2 && ccw(upper[upper.size()-2],upper.back(),P[i]) == 1) {\n Ret[i+1] -= Area({upper[upper.size()-2], upper.back(), lower.back()});\n upper.pop_back();\n }\n while(lower.size() >= 2 && ccw(lower[lower.size()-2],lower.back(),P[i]) == -1) {\n Ret[i+1] -= Area({lower[lower.size()-2], lower.back(), upper.back()});\n lower.pop_back();\n }\n Ret[i+1] += Area({lower.back(), upper.back(), P[i]});\n lower.push_back(P[i]), upper.push_back(P[i]);\n }\n return Ret;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<Point> P(N), RP(N);\n rep(i,0,N) {\n double x, y;\n cin >> x >> y;\n P[i] = Point(x,y);\n RP[i] = Point(-x,y);\n }\n sort(ALL(P), [&](Point P1, Point P2){\n if (eq(P1.real(),P2.real())) return P1.imag() < P2.imag();\n return P1.real() < P2.real();\n });\n sort(ALL(RP), [&](Point P1, Point P2){\n if (eq(P1.real(),P2.real())) return P1.imag() < P2.imag();\n return P1.real() < P2.real();\n });\n auto A = Calc(P), RA = Calc(RP);\n reverse(ALL(RA));\n double ANS = RA[0];\n rep(i,0,N-1) {\n if (eq(P[i].real(),P[i+1].real())) continue;\n chmin(ANS, A[i+1]+RA[i+1]);\n }\n cout << round(ANS) << endl;\n}","accuracy":0.1,"time_ms":10,"memory_kb":4288,"score_of_the_acc":-0.031,"final_rank":16},{"submission_id":"aoj_2786_9711336","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nconst long long INF = 15LL << 59;\n\nclass point {\npublic:\n\tlong long x, y;\n\tpoint() : x(0), y(0) {}\n\tpoint(long long x_, long long y_) : x(x_), y(y_) {}\n\tpoint& operator+=(const point& p) { x += p.x; y += p.y; return *this; }\n\tpoint& operator-=(const point& p) { x -= p.x; y -= p.y; return *this; }\n\tpoint operator+(const point& p) const { return point(*this) += p; }\n\tpoint operator-(const point& p) const { return point(*this) -= p; }\n\tlong long cross(const point& p) const { return x * p.y - y * p.x; }\n};\n\nvector<long long> subcalc(int N, const vector<point>& P) {\n\tvector<long long> ans = { 0 };\n\tlong long area = 0;\n\tvector<int> s1, s2;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (s1.empty() || P[s1[s1.size() - 1]].y >= P[i].y) {\n\t\t\twhile (s1.size() >= 2) {\n\t\t\t\tint v1 = s1[s1.size() - 1];\n\t\t\t\tint v2 = s1[s1.size() - 2];\n\t\t\t\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\n\t\t\t\t\tarea -= P[v2].cross(P[v1]);\n\t\t\t\t\ts1.pop_back();\n\t\t\t\t} else {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (s1.size() >= 1) {\n\t\t\t\tarea += P[s1[s1.size() - 1]].cross(P[i]);\n\t\t\t}\n\t\t\ts1.push_back(i);\n\t\t}\n\t\twhile (s2.size() >= 1 && P[s2[s2.size() - 1]].y >= P[i].y) {\n\t\t\tif (s2.size() >= 2) {\n\t\t\t\tarea -= P[s2[s2.size() - 2]].cross(P[s2[s2.size() - 1]]);\n\t\t\t}\n\t\t\ts2.pop_back();\n\t\t}\n\t\twhile (s2.size() >= 2) {\n\t\t\tint v1 = s2[s2.size() - 1];\n\t\t\tint v2 = s2[s2.size() - 2];\n\t\t\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\n\t\t\t\tarea -= P[v2].cross(P[v1]);\n\t\t\t\ts2.pop_back();\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (s2.size() >= 1) {\n\t\t\tarea += P[s2[s2.size() - 1]].cross(P[i]);\n\t\t}\n\t\ts2.push_back(i);\n\t\tif (i == N - 1 || P[i].x != P[i + 1].x) {\n\t\t\tans.push_back(area);\n\t\t}\n\t}\n\treturn ans;\n}\n\nvector<long long> calc(int N, vector<point> P) {\n\tvector<long long> res1 = subcalc(N, P);\n\tfor (int i = 0; i < N; i++) {\n\t\tP[i].y *= -1;\n\t}\n\tvector<long long> res2 = subcalc(N, P);\n\tvector<long long> res3(res1.size());\n\tfor (int i = 0; i < int(res1.size()); i++) {\n\t\tres3[i] = res1[i] + res2[i];\n\t}\n\treturn res3;\n}\n\nlong long solve(int N, vector<point> P) {\n\tsort(P.begin(), P.end(), [&](const point& p1, const point& p2) {\n\t\treturn p1.x != p2.x ? p1.x < p2.x : p1.y < p2.y;\n\t});\n\tvector<long long> res1 = calc(N, P);\n\treverse(P.begin(), P.end());\n\tfor (int i = 0; i < N; i++) {\n\t\tP[i].x *= -1;\n\t\tP[i].y *= -1;\n\t}\n\tvector<long long> res2 = calc(N, P);\n\treverse(res2.begin(), res2.end());\n\tlong long ans = INF;\n\tfor (int i = 0; i < int(res1.size()); i++) {\n\t\tans = min(ans, res1[i] + res2[i]);\n\t}\n\treturn ans;\n}\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<point> P(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> P[i].x >> P[i].y;\n\t}\n\tlong long ans = solve(N, P);\n\tcout << (ans + 1) / 2 << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":11160,"score_of_the_acc":-1.0282,"final_rank":4},{"submission_id":"aoj_2786_9711332","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nconst long long INF = 7LL << 59;\n\nclass point {\npublic:\n\tlong long x, y;\n\tpoint() : x(0), y(0) {}\n\tpoint(long long x_, long long y_) : x(x_), y(y_) {}\n\tpoint& operator+=(const point& p) { x += p.x; y += p.y; return *this; }\n\tpoint& operator-=(const point& p) { x -= p.x; y -= p.y; return *this; }\n\tpoint operator+(const point& p) const { return point(*this) += p; }\n\tpoint operator-(const point& p) const { return point(*this) -= p; }\n\tlong long cross(const point& p) const { return x * p.y - y * p.x; }\n};\n\nvector<long long> subcalc(int N, const vector<point>& P) {\n\tvector<long long> ans = { 0 };\n\tlong long area = 0;\n\tvector<int> s1, s2;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (s1.empty() || P[s1[s1.size() - 1]].y >= P[i].y) {\n\t\t\twhile (s1.size() >= 2) {\n\t\t\t\tint v1 = s1[s1.size() - 1];\n\t\t\t\tint v2 = s1[s1.size() - 2];\n\t\t\t\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\n\t\t\t\t\tarea -= P[v2].cross(P[v1]);\n\t\t\t\t\ts1.pop_back();\n\t\t\t\t} else {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (s1.size() >= 1) {\n\t\t\t\tarea += P[s1[s1.size() - 1]].cross(P[i]);\n\t\t\t}\n\t\t\ts1.push_back(i);\n\t\t}\n\t\twhile (s2.size() >= 1 && P[s2[s2.size() - 1]].y >= P[i].y) {\n\t\t\tif (s2.size() >= 2) {\n\t\t\t\tarea -= P[s2[s2.size() - 2]].cross(P[s2[s2.size() - 1]]);\n\t\t\t}\n\t\t\ts2.pop_back();\n\t\t}\n\t\twhile (s2.size() >= 2) {\n\t\t\tint v1 = s2[s2.size() - 1];\n\t\t\tint v2 = s2[s2.size() - 2];\n\t\t\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\n\t\t\t\tarea -= P[v2].cross(P[v1]);\n\t\t\t\ts2.pop_back();\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (s2.size() >= 1) {\n\t\t\tarea += P[s2[s2.size() - 1]].cross(P[i]);\n\t\t}\n\t\ts2.push_back(i);\n\t\tif (i == N - 1 || P[i].x != P[i + 1].x) {\n\t\t\tans.push_back(area);\n\t\t}\n\t}\n\treturn ans;\n}\n\nvector<long long> calc(int N, vector<point> P) {\n\tvector<long long> res1 = subcalc(N, P);\n\tfor (int i = 0; i < N; i++) {\n\t\tP[i].y *= -1;\n\t}\n\tvector<long long> res2 = subcalc(N, P);\n\tvector<long long> res3(res1.size());\n\tfor (int i = 0; i < int(res1.size()); i++) {\n\t\tres3[i] = res1[i] + res2[i];\n\t}\n\treturn res3;\n}\n\nlong long solve(int N, vector<point> P) {\n\tsort(P.begin(), P.end(), [&](const point& p1, const point& p2) {\n\t\treturn p1.x != p2.x ? p1.x < p2.x : p1.y < p2.y;\n\t});\n\tvector<long long> res1 = calc(N, P);\n\treverse(P.begin(), P.end());\n\tfor (int i = 0; i < N; i++) {\n\t\tP[i].x *= -1;\n\t\tP[i].y *= -1;\n\t}\n\tvector<long long> res2 = calc(N, P);\n\treverse(res2.begin(), res2.end());\n\tlong long ans = INF;\n\tfor (int i = 0; i < int(res1.size()); i++) {\n\t\tans = min(ans, res1[i] + res2[i]);\n\t}\n\treturn ans;\n}\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<point> P(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> P[i].x >> P[i].y;\n\t}\n\tlong long ans = solve(N, P);\n\tcout << (ans + 1) / 2 << endl;\n\treturn 0;\n}","accuracy":0.1,"time_ms":10,"memory_kb":4504,"score_of_the_acc":-0.0444,"final_rank":17},{"submission_id":"aoj_2786_9711303","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nconst long long INF = 3LL << 59;\n\nclass point {\npublic:\n\tlong long x, y;\n\tpoint() : x(0), y(0) {}\n\tpoint(long long x_, long long y_) : x(x_), y(y_) {}\n\tpoint& operator+=(const point& p) { x += p.x; y += p.y; return *this; }\n\tpoint& operator-=(const point& p) { x -= p.x; y -= p.y; return *this; }\n\tpoint operator+(const point& p) const { return point(*this) += p; }\n\tpoint operator-(const point& p) const { return point(*this) -= p; }\n\tlong long cross(const point& p) const { return x * p.y - y * p.x; }\n};\n\n#include <string>\n\nstring to_string(const vector<int>& arr) {\n\tstring res = \"[\";\n\tfor (int i = 0; i < arr.size(); i++) {\n\t\tif (i != 0) {\n\t\t\tres += \", \";\n\t\t}\n\t\tres += to_string(arr[i]);\n\t}\n\tres += \"]\";\n\treturn res;\n}\n\nvector<long long> subcalc(int N, const vector<point>& P) {\n\tvector<long long> ans = { 0 };\n\tlong long area = 0;\n\tvector<int> s1, s2;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (s1.empty() || P[s1[s1.size() - 1]].y >= P[i].y) {\n\t\t\twhile (s1.size() >= 2) {\n\t\t\t\tint v1 = s1[s1.size() - 1];\n\t\t\t\tint v2 = s1[s1.size() - 2];\n\t\t\t\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\n\t\t\t\t\tarea -= P[v2].cross(P[v1]);\n\t\t\t\t\ts1.pop_back();\n\t\t\t\t} else {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (s1.size() >= 1) {\n\t\t\t\tarea += P[s1[s1.size() - 1]].cross(P[i]);\n\t\t\t}\n\t\t\ts1.push_back(i);\n\t\t}\n\t\twhile (s2.size() >= 1 && P[s2[s2.size() - 1]].y >= P[i].y) {\n\t\t\tif (s2.size() >= 2) {\n\t\t\t\tarea -= P[s2[s2.size() - 2]].cross(P[s2[s2.size() - 1]]);\n\t\t\t}\n\t\t\ts2.pop_back();\n\t\t}\n\t\twhile (s2.size() >= 2) {\n\t\t\tint v1 = s2[s2.size() - 1];\n\t\t\tint v2 = s2[s2.size() - 2];\n\t\t\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\n\t\t\t\tarea -= P[v2].cross(P[v1]);\n\t\t\t\ts2.pop_back();\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (s2.size() >= 1) {\n\t\t\tarea += P[s2[s2.size() - 1]].cross(P[i]);\n\t\t}\n\t\ts2.push_back(i);\n\t\tif (i == N - 1 || P[i].x != P[i + 1].x) {\n\t\t\tans.push_back(area);\n\t\t}\n\t}\n\treturn ans;\n}\n\nvector<long long> calc(int N, vector<point> P) {\n\tvector<long long> res1 = subcalc(N, P);\n\tfor (int i = 0; i < N; i++) {\n\t\tP[i].y *= -1;\n\t}\n\tvector<long long> res2 = subcalc(N, P);\n\tvector<long long> res3(res1.size());\n\tfor (int i = 0; i < int(res1.size()); i++) {\n\t\tres3[i] = res1[i] + res2[i];\n\t}\n\treturn res3;\n}\n\nlong long solve(int N, vector<point> P) {\n\tsort(P.begin(), P.end(), [&](const point& p1, const point& p2) {\n\t\treturn p1.x != p2.x ? p1.x < p2.x : p1.y < p2.y;\n\t});\n\tvector<long long> res1 = calc(N, P);\n\treverse(P.begin(), P.end());\n\tfor (int i = 0; i < N; i++) {\n\t\tP[i].x *= -1;\n\t\tP[i].y *= -1;\n\t}\n\tvector<long long> res2 = calc(N, P);\n\treverse(res2.begin(), res2.end());\n\tlong long ans = INF;\n\tfor (int i = 0; i < int(res1.size()); i++) {\n\t\tans = min(ans, res1[i] + res2[i]);\n\t}\n\treturn ans;\n}\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<point> P(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> P[i].x >> P[i].y;\n\t}\n\tlong long ans = solve(N, P);\n\tcout << (ans + 1) / 2 << endl;\n\treturn 0;\n}","accuracy":0.1,"time_ms":10,"memory_kb":4504,"score_of_the_acc":-0.0444,"final_rank":17},{"submission_id":"aoj_2786_9669250","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nstruct segtree{\n vi tree;\n int n;\n ll op(ll a,ll b){return max(a,b);}\n ll e(){return -1e18;}\n segtree(int _N){\n n=1;\n while(n<_N)n<<=1;\n tree.assign(2*n,e());\n }\n void set(int i,ll x){\n i+=n;\n tree[i]=x;\n while(i>1){\n i>>=1;\n tree[i]=op(tree[2*i],tree[2*i+1]);\n }\n }\n ll prod(int l,int r){\n l+=n;r+=n;\n ll L=e(),R=e();\n while(l<r){\n if(l%2)L=op(L,tree[l++]);\n if(r%2)R=op(tree[--r],R);\n l>>=1;r>>=1;\n }\n return op(L,R);\n }\n};\nint main(){\n ll N;cin>>N;\n vector<pi>A(N);\n REP(i,N)cin>>A[i].first>>A[i].second;\n vi X;\n REP(i,N)X.emplace_back(A[i].first);\n sort(ALL(X));\n X.erase(unique(ALL(X)),X.end());\n vi D(sz(X),1e18),U(sz(X),-1e18);\n REP(i,N){\n int x=LB(X,A[i].first);\n D[x]=min(D[x],A[i].second);\n U[x]=max(U[x],A[i].second);\n }\n N=X.size();\n\n vi ans1(N+1),ans2(N+1);\n auto f=[](pi a,pi b){\n return a.first*b.second-a.second*b.first;\n };\n {\n stack<pi>upper,lower;\n __int128 area=0;\n upper.emplace(pi(X[0],U[0]));\n lower.emplace(pi(X[0],D[0]));\n FOR(i,1,N){\n area-=f(lower.top(),upper.top());\n while(sz(upper)>1){\n auto p=upper.top();upper.pop();\n auto q=upper.top();\n area-=f(p,q);\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\n upper.emplace(p);\n area+=f(p,q);\n break;\n }\n area+=f(pi(X[i],U[i]),upper.top());\n upper.emplace(pi(X[i],U[i]));\n while(sz(lower)>1){\n auto p=lower.top();lower.pop();\n auto q=lower.top();\n area-=f(q,p);\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\n area+=f(q,p);\n lower.emplace(p);\n break;\n }\n area+=f(lower.top(),pi(X[i],D[i]));\n lower.emplace(pi(X[i],D[i]));\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\n ans1[i+1]=area;\n assert(area>=0);\n }\n }\n {\n REP(i,N)X[i]=-X[i];\n reverse(ALL(X));\n reverse(ALL(D));\n reverse(ALL(U));\n stack<pi>upper,lower;\n __int128 area=0;\n upper.emplace(pi(X[0],U[0]));\n lower.emplace(pi(X[0],D[0]));\n FOR(i,1,N){\n area-=f(lower.top(),upper.top());\n while(sz(upper)>1){\n auto p=upper.top();upper.pop();\n auto q=upper.top();\n area-=f(p,q);\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\n upper.emplace(p);\n area+=f(p,q);\n break;\n }\n area+=f(pi(X[i],U[i]),upper.top());\n upper.emplace(pi(X[i],U[i]));\n while(sz(lower)>1){\n auto p=lower.top();lower.pop();\n auto q=lower.top();\n area-=f(q,p);\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\n lower.emplace(p);\n area+=f(q,p);\n break;\n }\n area+=f(lower.top(),pi(X[i],D[i]));\n lower.emplace(pi(X[i],D[i]));\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\n assert(area>=0);\n ans2[i+1]=area;\n }\n }\n ll ans=9e18;\n REP(i,N+1)ans=min(ans,ans1[i]+ans2[N-i]);\n cout<<(ans+1)/2<<endl;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":10056,"score_of_the_acc":-1.1026,"final_rank":5},{"submission_id":"aoj_2786_9669192","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nstruct segtree{\n vi tree;\n int n;\n ll op(ll a,ll b){return max(a,b);}\n ll e(){return -1e18;}\n segtree(int _N){\n n=1;\n while(n<_N)n<<=1;\n tree.assign(2*n,e());\n }\n void set(int i,ll x){\n i+=n;\n tree[i]=x;\n while(i>1){\n i>>=1;\n tree[i]=op(tree[2*i],tree[2*i+1]);\n }\n }\n ll prod(int l,int r){\n l+=n;r+=n;\n ll L=e(),R=e();\n while(l<r){\n if(l%2)L=op(L,tree[l++]);\n if(r%2)R=op(tree[--r],R);\n l>>=1;r>>=1;\n }\n return op(L,R);\n }\n};\nint main(){\n ll N;cin>>N;\n vector<pi>A(N);\n REP(i,N)cin>>A[i].first>>A[i].second;\n vi X;\n REP(i,N)X.emplace_back(A[i].first);\n sort(ALL(X));\n X.erase(unique(ALL(X)),X.end());\n vi D(sz(X),1e18),U(sz(X),-1e18);\n REP(i,N){\n int x=LB(X,A[i].first);\n D[x]=min(D[x],A[i].second);\n U[x]=max(U[x],A[i].second);\n }\n N=X.size();\n\n vi ans1(N+1),ans2(N+1);\n auto f=[](pi a,pi b){\n return a.first*b.second-a.second*b.first;\n };\n {\n stack<pi>upper,lower;\n __int128 area=0;\n upper.emplace(pi(X[0],U[0]));\n lower.emplace(pi(X[0],D[0]));\n FOR(i,1,N){\n area-=f(lower.top(),upper.top());\n while(sz(upper)>1){\n auto p=upper.top();upper.pop();\n auto q=upper.top();\n area-=f(p,q);\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\n upper.emplace(p);\n area+=f(p,q);\n break;\n }\n area+=f(pi(X[i],U[i]),upper.top());\n upper.emplace(pi(X[i],U[i]));\n while(sz(lower)>1){\n auto p=lower.top();lower.pop();\n auto q=lower.top();\n area-=f(q,p);\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\n area+=f(q,p);\n lower.emplace(p);\n break;\n }\n area+=f(lower.top(),pi(X[i],D[i]));\n lower.emplace(pi(X[i],D[i]));\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\n ans1[i+1]=area;\n }\n }\n {\n REP(i,N)X[i]=-X[i];\n reverse(ALL(X));\n reverse(ALL(D));\n reverse(ALL(U));\n stack<pi>upper,lower;\n __int128 area=0;\n upper.emplace(pi(X[0],U[0]));\n lower.emplace(pi(X[0],D[0]));\n FOR(i,1,N){\n area-=f(lower.top(),upper.top());\n while(sz(upper)>1){\n auto p=upper.top();upper.pop();\n auto q=upper.top();\n area-=f(p,q);\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\n upper.emplace(p);\n area+=f(p,q);\n break;\n }\n area+=f(pi(X[i],U[i]),upper.top());\n upper.emplace(pi(X[i],U[i]));\n while(sz(lower)>1){\n auto p=lower.top();lower.pop();\n auto q=lower.top();\n area-=f(q,p);\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\n lower.emplace(p);\n area+=f(q,p);\n break;\n }\n area+=f(lower.top(),pi(X[i],D[i]));\n lower.emplace(pi(X[i],D[i]));\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\n ans2[i+1]=area;\n }\n }\n ll ans=5e18;\n REP(i,N+1)ans=min(ans,ans1[i]+ans2[N-i]);\n cout<<(ans+1)/2<<endl;\n return 0;\n}","accuracy":0.1,"time_ms":10,"memory_kb":3788,"score_of_the_acc":0,"final_rank":13},{"submission_id":"aoj_2786_9669178","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nstruct segtree{\n vi tree;\n int n;\n ll op(ll a,ll b){return max(a,b);}\n ll e(){return -1e18;}\n segtree(int _N){\n n=1;\n while(n<_N)n<<=1;\n tree.assign(2*n,e());\n }\n void set(int i,ll x){\n i+=n;\n tree[i]=x;\n while(i>1){\n i>>=1;\n tree[i]=op(tree[2*i],tree[2*i+1]);\n }\n }\n ll prod(int l,int r){\n l+=n;r+=n;\n ll L=e(),R=e();\n while(l<r){\n if(l%2)L=op(L,tree[l++]);\n if(r%2)R=op(tree[--r],R);\n l>>=1;r>>=1;\n }\n return op(L,R);\n }\n};\nint main(){\n ll N;cin>>N;\n vector<pi>A(N);\n REP(i,N)cin>>A[i].first>>A[i].second;\n vi X;\n REP(i,N)X.emplace_back(A[i].first);\n sort(ALL(X));\n X.erase(unique(ALL(X)),X.end());\n vi D(sz(X),1e18),U(sz(X),-1e18);\n REP(i,N){\n int x=LB(X,A[i].first);\n D[x]=min(D[x],A[i].second);\n U[x]=max(U[x],A[i].second);\n }\n N=X.size();\n\n vi ans1(N+1),ans2(N+1);\n auto f=[](pi a,pi b){\n return a.first*b.second-a.second*b.first;\n };\n {\n stack<pi>upper,lower;\n ll area=0;\n upper.emplace(pi(X[0],U[0]));\n lower.emplace(pi(X[0],D[0]));\n FOR(i,1,N){\n area-=f(lower.top(),upper.top());\n while(sz(upper)>1){\n auto p=upper.top();upper.pop();\n auto q=upper.top();\n area-=f(p,q);\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\n upper.emplace(p);\n area+=f(p,q);\n break;\n }\n area+=f(pi(X[i],U[i]),upper.top());\n upper.emplace(pi(X[i],U[i]));\n while(sz(lower)>1){\n auto p=lower.top();lower.pop();\n auto q=lower.top();\n area-=f(q,p);\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\n area+=f(q,p);\n lower.emplace(p);\n break;\n }\n area+=f(lower.top(),pi(X[i],D[i]));\n lower.emplace(pi(X[i],D[i]));\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\n ans1[i+1]=area;\n }\n }\n {\n REP(i,N)X[i]=-X[i];\n reverse(ALL(X));\n reverse(ALL(D));\n reverse(ALL(U));\n stack<pi>upper,lower;\n ll area=0;\n upper.emplace(pi(X[0],U[0]));\n lower.emplace(pi(X[0],D[0]));\n FOR(i,1,N){\n area-=f(lower.top(),upper.top());\n while(sz(upper)>1){\n auto p=upper.top();upper.pop();\n auto q=upper.top();\n area-=f(p,q);\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\n upper.emplace(p);\n area+=f(p,q);\n break;\n }\n area+=f(pi(X[i],U[i]),upper.top());\n upper.emplace(pi(X[i],U[i]));\n while(sz(lower)>1){\n auto p=lower.top();lower.pop();\n auto q=lower.top();\n area-=f(q,p);\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\n lower.emplace(p);\n area+=f(q,p);\n break;\n }\n area+=f(lower.top(),pi(X[i],D[i]));\n lower.emplace(pi(X[i],D[i]));\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\n ans2[i+1]+=area;\n }\n }\n ll ans=5e18;\n REP(i,N+1)ans=min(ans,ans1[i]+ans2[N-i]);\n cout<<(ans+1)/2<<endl;\n return 0;\n}","accuracy":0.1,"time_ms":10,"memory_kb":3928,"score_of_the_acc":-0.0087,"final_rank":15},{"submission_id":"aoj_2786_9669174","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nstruct segtree{\n vi tree;\n int n;\n ll op(ll a,ll b){return max(a,b);}\n ll e(){return -1e18;}\n segtree(int _N){\n n=1;\n while(n<_N)n<<=1;\n tree.assign(2*n,e());\n }\n void set(int i,ll x){\n i+=n;\n tree[i]=x;\n while(i>1){\n i>>=1;\n tree[i]=op(tree[2*i],tree[2*i+1]);\n }\n }\n ll prod(int l,int r){\n l+=n;r+=n;\n ll L=e(),R=e();\n while(l<r){\n if(l%2)L=op(L,tree[l++]);\n if(r%2)R=op(tree[--r],R);\n l>>=1;r>>=1;\n }\n return op(L,R);\n }\n};\nint main(){\n ll N;cin>>N;\n vector<pi>A(N);\n REP(i,N)cin>>A[i].first>>A[i].second;\n vi X;\n REP(i,N)X.emplace_back(A[i].first);\n sort(ALL(X));\n X.erase(unique(ALL(X)),X.end());\n vi D(sz(X),1e18),U(sz(X),-1e18);\n REP(i,N){\n int x=LB(X,A[i].first);\n D[x]=min(D[x],A[i].second);\n U[x]=max(U[x],A[i].second);\n }\n N=X.size();\n\n vi ans1(N+1),ans2(N+1);\n auto f=[](pi a,pi b){\n return a.first*b.second-a.second*b.first;\n };\n {\n stack<pi>upper,lower;\n ll area=0;\n upper.emplace(pi(X[0],U[0]));\n lower.emplace(pi(X[0],D[0]));\n FOR(i,1,N){\n area-=f(lower.top(),upper.top());\n while(sz(upper)>1){\n auto p=upper.top();upper.pop();\n auto q=upper.top();\n area-=f(p,q);\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\n upper.emplace(p);\n area+=f(p,q);\n break;\n }\n area+=f(pi(X[i],U[i]),upper.top());\n upper.emplace(pi(X[i],U[i]));\n while(sz(lower)>1){\n auto p=lower.top();lower.pop();\n auto q=lower.top();\n area-=f(q,p);\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\n area+=f(q,p);\n lower.emplace(p);\n break;\n }\n area+=f(lower.top(),pi(X[i],D[i]));\n lower.emplace(pi(X[i],D[i]));\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\n ans1[i+1]=area;\n }\n }\n {\n REP(i,N)X[i]=-X[i];\n reverse(ALL(X));\n reverse(ALL(D));\n reverse(ALL(U));\n stack<pi>upper,lower;\n ll area=0;\n upper.emplace(pi(X[0],U[0]));\n lower.emplace(pi(X[0],D[0]));\n FOR(i,1,N){\n area-=f(lower.top(),upper.top());\n while(sz(upper)>1){\n auto p=upper.top();upper.pop();\n auto q=upper.top();\n area-=f(p,q);\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\n upper.emplace(p);\n area+=f(p,q);\n break;\n }\n area+=f(pi(X[i],U[i]),upper.top());\n upper.emplace(pi(X[i],U[i]));\n while(sz(lower)>1){\n auto p=lower.top();lower.pop();\n auto q=lower.top();\n area-=f(q,p);\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\n lower.emplace(p);\n area+=f(q,p);\n break;\n }\n area+=f(lower.top(),pi(X[i],D[i]));\n lower.emplace(pi(X[i],D[i]));\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\n ans2[i+1]+=area;\n }\n }\n //REP(i,N+1)cout<<ans1[i]<<\" \";cout<<endl;\n //REP(i,N+1)cout<<ans2[i]<<\" \";cout<<endl;\n ll ans=1e18;\n REP(i,N+1)ans=min(ans,ans1[i]+ans2[N-i]);\n cout<<(ans+1)/2<<endl;\n return 0;\n}","accuracy":0.1,"time_ms":10,"memory_kb":3912,"score_of_the_acc":-0.0077,"final_rank":14},{"submission_id":"aoj_2786_7181025","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\nusing ll = long long;\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;}\nconst int INF = (1<<30)-1;\n#define all(p) p.begin(),p.end()\nconst int mod=998244353;\n\nint main(){\n\tint N;\n\tcin>>N;\n\tset<ll> s;\n\tvector<pair<ll,ll>> p(N);\n\trep(i,0,N){\n\t\tcin>>p[i].first>>p[i].second;\n\t\ts.insert(p[i].first);\n\t}\n\tsort(all(p));\n\tmap<int,int> m;\n\tvector<ll> order={167};\n\tint len=1;\n\tfor(auto x:s) m[x]=len,len++,order.push_back(x);\n\torder.push_back(167);\n\tvector<ll> U(len+1,-INF),D(len+1,-INF);\n\trep(i,0,N){\n\t\tint a=m[p[i].first];\n\t\tchmax(U[a],p[i].second);\n\t\tchmax(D[a],-p[i].second);\n\t}\n\tauto f=[&]()->vector<ll>{\n\t\tvector<ll> ans(len+1);\n\t\tvector<int> p(len+1);\n\t\tint k=0;\n\t\trep(i,1,len){\n\t\t\tans[i]=ans[i-1];\n\t\t\tif(k==0){\n\t\t\t\tp[k]=i;\n\t\t\t\tk++;\n\t\t\t}else if(k==1){\n\t\t\t\tp[k]=i;\n\t\t\t\tk++;\n\t\t\t\tans[i]+=abs(order[i]-order[i-1])*(U[i]+U[i-1]);\n\t\t\t}else{\n\t\t\t\twhile(2<=k){\n\t\t\t\t\tint a=p[k-2],b=p[k-1],c=i;\n\t\t\t\t\t//U[b]<=(U[a]*dist(b,c)+U[c]*dist(a,b))/dist(a,c);\n\t\t\t\t\tif(U[b]*abs(order[a]-order[c])<=U[a]*abs(order[b]-order[c])+U[c]*abs(order[b]-order[a])){\n\t\t\t\t\t\tans[i]-=abs(order[b]-order[a])*(U[a]+U[b]);\n\t\t\t\t\t\tk--;\n\t\t\t\t\t}\n\t\t\t\t\telse break;\n\t\t\t\t}\n\t\t\t\tp[k]=i;\n\t\t\t\tans[i]+=abs(order[i]-order[p[k-1]])*(U[i]+U[p[k-1]]);\n\t\t\t\tk++;\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t};\n\tvector<vector<ll>> area(4);\n\trep(i,0,2){\n\t\trep(j,0,2){\n\t\t\tarea[i*2+j]=f();\n\t\t\tswap(U,D);\n\t\t}\n\t\treverse(all(order));\n\t\treverse(all(U));\n\t\treverse(all(D));\n\t}\n\tll ans=area[0][len-1]+area[1][len-1];\n\trep(i,1,len-1){\n\t\tchmin(ans,area[0][i]+area[1][i]+area[2][len-1-i]+area[3][len-1-i]);\n\t}\n\tcout<<(1+ans)/2<<\"\\n\";\n}","accuracy":1,"time_ms":80,"memory_kb":19928,"score_of_the_acc":-2,"final_rank":7},{"submission_id":"aoj_2786_7180959","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\nusing ll = long long;\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;}\nconst int INF = (1<<30)-1;\n#define all(p) p.begin(),p.end()\nconst int mod=998244353;\n\nint main(){\n\tint N;\n\tcin>>N;\n\tset<ll> s;\n\tvector<pair<ll,ll>> p(N);\n\trep(i,0,N){\n\t\tcin>>p[i].first>>p[i].second;\n\t\ts.insert(p[i].first);\n\t}\n\tsort(all(p));\n\tmap<int,int> m;\n\tvector<ll> order={167};\n\tint len=1;\n\tfor(auto x:s) m[x]=len,len++,order.push_back(x);\n\torder.push_back(167);\n\tvector<ll> U(len+1,-INF),D(len+1,-INF);\n\trep(i,0,N){\n\t\tint a=m[p[i].first];\n\t\tchmax(U[a],p[i].second);\n\t\tchmax(D[a],-p[i].second);\n\t}\n\tauto f=[&]()->vector<ll>{\n\t\tvector<ll> ans(len+1);\n\t\tvector<int> p(len+1);\n\t\tint k=0;\n\t\trep(i,1,len){\n\t\t\tans[i]=ans[i-1];\n\t\t\tif(k==0){\n\t\t\t\tp[k]=i;\n\t\t\t\tk++;\n\t\t\t}else if(k==1){\n\t\t\t\tp[k]=i;\n\t\t\t\tk++;\n\t\t\t\tans[i]+=abs(order[i]-order[i-1])*(U[i]+U[i-1]);\n\t\t\t}else{\n\t\t\t\twhile(2<=k){\n\t\t\t\t\tint a=p[k-2],b=p[k-1],c=i;\n\t\t\t\t\t//U[b]<=(U[a]*dist(b,c)+U[c]*dist(a,b))/dist(a,c);\n\t\t\t\t\tif(U[b]*abs(order[a]-order[c])<=U[a]*abs(order[b]-order[c])+U[c]*abs(order[b]-order[a])){\n\t\t\t\t\t\tans[i]-=abs(order[b]-order[a])*(U[a]+U[b]);\n\t\t\t\t\t\tk--;\n\t\t\t\t\t}\n\t\t\t\t\telse break;\n\t\t\t\t}\n\t\t\t\tp[k]=i;\n\t\t\t\tans[i]+=abs(order[i]-order[p[k-1]])*(U[i]+U[p[k-1]]);\n\t\t\t\tk++;\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t};\n\tvector<vector<ll>> area(4);\n\trep(i,0,2){\n\t\trep(j,0,2){\n\t\t\tarea[i*2+j]=f();\n\t\t\tswap(U,D);\n\t\t}\n\t\treverse(all(order));\n\t\treverse(all(U));\n\t\treverse(all(D));\n\t}\n\tll ans=(1ll<<62);\n\trep(i,0,len){\n\t\tchmin(ans,area[0][i]+area[1][i]+area[2][len-1-i]+area[3][len-1-i]);\n\t}\n\tcout<<(1+ans)/2<<\"\\n\";\n}","accuracy":0.1,"time_ms":10,"memory_kb":5856,"score_of_the_acc":-0.1281,"final_rank":19},{"submission_id":"aoj_2786_6790609","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\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];\n if (i < (int) v.size() - 1) os << \" \";\n }\n return os;\n}\n\nusing T = ll;\nusing Vec = std::complex<T>;\n\nconst T PI = std::acos(-1);\n\nconstexpr T eps = 1e-10;\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\ninline bool lt(T a, T b) { return a < b - eps; }\ninline bool leq(T a, T b) { return a <= b + eps; }\n\nstd::istream& operator>>(std::istream& is, Vec& p) {\n T x, y;\n is >> x >> y;\n p = {x, y};\n return is;\n}\n\nstruct Line {\n Vec p1, p2;\n Line() = default;\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Segment {\n Vec p1, p2;\n Segment() = default;\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Circle {\n Vec c;\n T r;\n Circle() = default;\n Circle(const Vec& c, T r) : c(c), r(r) {}\n};\n\nusing Polygon = std::vector<Vec>;\n\nT dot(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).real();\n}\n\nT cross(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).imag();\n}\n\nVec rot(const Vec& a, T ang) {\n return a * Vec(std::cos(ang), std::sin(ang));\n}\n\nVec perp(const Vec& a) {\n return Vec(-a.imag(), a.real());\n}\n\nVec projection(const Line& l, const Vec& p) {\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\n}\n\nVec reflection(const Line& l, const Vec& p) {\n return T(2) * projection(l, p) - p;\n}\n\n// 0: collinear\n// 1: counter-clockwise\n// -1: clockwise\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\n if (eq(cross(b - a, c - a), 0)) return 0;\n if (lt(cross(b - a, c - a), 0)) return -1;\n return 1;\n}\n\nvoid sort_by_arg(std::vector<Vec>& pts) {\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\n if (cross(p, q) == 0) {\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\n return (p.real() > q.real());\n }\n return (cross(p, q) > 0);\n });\n}\n\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\n int n = pts.size();\n if (n == 1) return pts;\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\n });\n int k = 0; // the number of vertices in the convex hull\n std::vector<Vec> ch(2 * n);\n // right\n for (int i = 0; i < n; ++i) {\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n int t = k;\n // left\n for (int i = n - 2; i >= 0; --i) {\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n ch.resize(k - 1);\n return ch;\n}\n\n\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int N;\n cin >> N;\n vector<Vec> pts(N);\n for (auto& p : pts) cin >> p;\n\n if (N <= 2) {\n cout << 0 << endl;\n return 0;\n }\n\n auto calc = [&](vector<Vec> pts) {\n sort(all(pts), [&](auto& p1, auto& p2) {\n if (p1.real() == p2.real()) return p1.imag() < p2.imag();\n return p1.real() < p2.real();\n });\n vector<ll> area(N+1, 4e18);\n vector<Vec> lower, upper;\n lower.push_back(pts[0]);\n upper.push_back(pts[0]);\n area[0] = area[1] = 0;\n ll a = 0;\n for (int i = 1; i < N; ) {\n int j = i;\n while (j < N && pts[i].real() == pts[j].real()) {\n while (lower.size() >= 2 && leq(cross(lower.back()-lower[lower.size()-2], pts[j]-lower.back()), 0)) {\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\n lower.pop_back();\n }\n while (upper.size() >= 2 && leq(0, cross(upper.back()-upper[upper.size()-2], pts[j]-upper.back()))) {\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\n upper.pop_back();\n }\n a += abs(cross(upper.back()-pts[j], lower.back()-pts[j]));\n upper.push_back(pts[j]);\n lower.push_back(pts[j]);\n ++j;\n }\n area[j] = a;\n i = j;\n }\n return area;\n };\n\n auto left = calc(pts);\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\n auto right = calc(pts);\n ll ans = 4e18;\n rep(i,0,N+1) {\n chmin(ans, (left[i]+right[N-i]+1)/2);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":10316,"score_of_the_acc":-0.5473,"final_rank":2},{"submission_id":"aoj_2786_6790458","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\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];\n if (i < (int) v.size() - 1) os << \" \";\n }\n return os;\n}\n\nusing T = ll;\nusing Vec = std::complex<T>;\n\nconst T PI = std::acos(-1);\n\nconstexpr T eps = 1e-10;\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\ninline bool lt(T a, T b) { return a < b - eps; }\ninline bool leq(T a, T b) { return a <= b + eps; }\n\nstd::istream& operator>>(std::istream& is, Vec& p) {\n T x, y;\n is >> x >> y;\n p = {x, y};\n return is;\n}\n\nstruct Line {\n Vec p1, p2;\n Line() = default;\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Segment {\n Vec p1, p2;\n Segment() = default;\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Circle {\n Vec c;\n T r;\n Circle() = default;\n Circle(const Vec& c, T r) : c(c), r(r) {}\n};\n\nusing Polygon = std::vector<Vec>;\n\nT dot(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).real();\n}\n\nT cross(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).imag();\n}\n\nVec rot(const Vec& a, T ang) {\n return a * Vec(std::cos(ang), std::sin(ang));\n}\n\nVec perp(const Vec& a) {\n return Vec(-a.imag(), a.real());\n}\n\nVec projection(const Line& l, const Vec& p) {\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\n}\n\nVec reflection(const Line& l, const Vec& p) {\n return T(2) * projection(l, p) - p;\n}\n\n// 0: collinear\n// 1: counter-clockwise\n// -1: clockwise\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\n if (eq(cross(b - a, c - a), 0)) return 0;\n if (lt(cross(b - a, c - a), 0)) return -1;\n return 1;\n}\n\nvoid sort_by_arg(std::vector<Vec>& pts) {\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\n if (cross(p, q) == 0) {\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\n return (p.real() > q.real());\n }\n return (cross(p, q) > 0);\n });\n}\n\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\n int n = pts.size();\n if (n == 1) return pts;\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\n });\n int k = 0; // the number of vertices in the convex hull\n std::vector<Vec> ch(2 * n);\n // right\n for (int i = 0; i < n; ++i) {\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n int t = k;\n // left\n for (int i = n - 2; i >= 0; --i) {\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n ch.resize(k - 1);\n return ch;\n}\n\n\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int N;\n cin >> N;\n vector<Vec> pts(N);\n for (auto& p : pts) cin >> p;\n\n if (N <= 2) {\n cout << 0 << endl;\n return 0;\n }\n\n auto calc = [&](vector<Vec> pts) {\n sort(all(pts), [&](auto& p1, auto& p2) {\n if (p1.real() == p2.real()) p1.imag() < p2.imag();\n return p1.real() < p2.real();\n });\n vector<ll> area(N+1, 4e18);\n vector<Vec> lower, upper;\n lower.push_back(pts[0]);\n upper.push_back(pts[0]);\n area[0] = area[1] = 0;\n ll a = 0;\n for (int i = 1; i < N; ) {\n int j = i;\n while (j < N && pts[i].real() == pts[j].real()) {\n while (lower.size() >= 2 && leq(cross(lower.back()-lower[lower.size()-2], pts[j]-lower.back()), 0)) {\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\n lower.pop_back();\n }\n while (upper.size() >= 2 && leq(0, cross(upper.back()-upper[upper.size()-2], pts[j]-upper.back()))) {\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\n upper.pop_back();\n }\n a += abs(cross(upper.back()-pts[j], lower.back()-pts[j]));\n upper.push_back(pts[j]);\n lower.push_back(pts[j]);\n ++j;\n }\n area[j] = a;\n i = j;\n }\n return area;\n };\n\n auto left = calc(pts);\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\n auto right = calc(pts);\n ll ans = 4e18;\n rep(i,0,N+1) {\n chmin(ans, (left[i]+right[N-i]+1)/2);\n }\n cout << ans << endl;\n}","accuracy":0.675,"time_ms":20,"memory_kb":7120,"score_of_the_acc":-0.3493,"final_rank":9},{"submission_id":"aoj_2786_6790415","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\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];\n if (i < (int) v.size() - 1) os << \" \";\n }\n return os;\n}\n\nusing T = ll;\nusing Vec = std::complex<T>;\n\nconst T PI = std::acos(-1);\n\nconstexpr T eps = 1e-10;\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\ninline bool lt(T a, T b) { return a < b - eps; }\ninline bool leq(T a, T b) { return a <= b + eps; }\n\nstd::istream& operator>>(std::istream& is, Vec& p) {\n T x, y;\n is >> x >> y;\n p = {x, y};\n return is;\n}\n\nstruct Line {\n Vec p1, p2;\n Line() = default;\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Segment {\n Vec p1, p2;\n Segment() = default;\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Circle {\n Vec c;\n T r;\n Circle() = default;\n Circle(const Vec& c, T r) : c(c), r(r) {}\n};\n\nusing Polygon = std::vector<Vec>;\n\nT dot(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).real();\n}\n\nT cross(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).imag();\n}\n\nVec rot(const Vec& a, T ang) {\n return a * Vec(std::cos(ang), std::sin(ang));\n}\n\nVec perp(const Vec& a) {\n return Vec(-a.imag(), a.real());\n}\n\nVec projection(const Line& l, const Vec& p) {\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\n}\n\nVec reflection(const Line& l, const Vec& p) {\n return T(2) * projection(l, p) - p;\n}\n\n// 0: collinear\n// 1: counter-clockwise\n// -1: clockwise\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\n if (eq(cross(b - a, c - a), 0)) return 0;\n if (lt(cross(b - a, c - a), 0)) return -1;\n return 1;\n}\n\nvoid sort_by_arg(std::vector<Vec>& pts) {\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\n if (cross(p, q) == 0) {\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\n return (p.real() > q.real());\n }\n return (cross(p, q) > 0);\n });\n}\n\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\n int n = pts.size();\n if (n == 1) return pts;\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\n });\n int k = 0; // the number of vertices in the convex hull\n std::vector<Vec> ch(2 * n);\n // right\n for (int i = 0; i < n; ++i) {\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n int t = k;\n // left\n for (int i = n - 2; i >= 0; --i) {\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n ch.resize(k - 1);\n return ch;\n}\n\n\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int N;\n cin >> N;\n vector<Vec> pts(N);\n for (auto& p : pts) cin >> p;\n\n if (N <= 2) {\n cout << 0 << endl;\n return 0;\n }\n\n auto calc = [&](vector<Vec> pts) {\n sort(all(pts), [&](auto& p1, auto& p2) { return p1.real() < p2.real(); });\n vector<ll> area(N+1, 4e18);\n vector<Vec> lower, upper;\n if (pts[0].real() < pts[1].real()) {\n lower.push_back(pts[0]);\n lower.push_back(pts[1]);\n upper.push_back(pts[0]);\n upper.push_back(pts[1]);\n } else {\n if (pts[0].imag() < pts[1].imag()) swap(pts[0], pts[1]);\n lower.push_back(pts[0]);\n lower.push_back(pts[1]);\n upper.push_back(pts[1]);\n upper.push_back(pts[0]);\n }\n area[0] = area[1] = area[2] = 0;\n ll a = 0;\n for (int i = 2; i < N; ) {\n int j = i;\n while (j < N && pts[i].real() == pts[j].real()) {\n while (lower.size() >= 2 && leq(cross(lower.back()-lower[lower.size()-2], pts[j]-lower.back()), 0)) {\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\n lower.pop_back();\n }\n while (upper.size() >= 2 && leq(0, cross(upper.back()-upper[upper.size()-2], pts[j]-upper.back()))) {\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\n upper.pop_back();\n }\n a += abs(cross(upper.back()-pts[j], lower.back()-pts[j]));\n upper.push_back(pts[j]);\n lower.push_back(pts[j]);\n ++j;\n }\n area[j] = a;\n i = j;\n }\n return area;\n };\n\n auto left = calc(pts);\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\n auto right = calc(pts);\n ll ans = 4e18;\n rep(i,0,N+1) {\n chmin(ans, (left[i]+right[N-i]+1)/2);\n }\n cout << ans << endl;\n}","accuracy":0.675,"time_ms":20,"memory_kb":7040,"score_of_the_acc":-0.3443,"final_rank":8},{"submission_id":"aoj_2786_6790407","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\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];\n if (i < (int) v.size() - 1) os << \" \";\n }\n return os;\n}\n\nusing T = ll;\nusing Vec = std::complex<T>;\n\nconst T PI = std::acos(-1);\n\nconstexpr T eps = 1e-10;\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\ninline bool lt(T a, T b) { return a < b - eps; }\ninline bool leq(T a, T b) { return a <= b + eps; }\n\nstd::istream& operator>>(std::istream& is, Vec& p) {\n T x, y;\n is >> x >> y;\n p = {x, y};\n return is;\n}\n\nstruct Line {\n Vec p1, p2;\n Line() = default;\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Segment {\n Vec p1, p2;\n Segment() = default;\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Circle {\n Vec c;\n T r;\n Circle() = default;\n Circle(const Vec& c, T r) : c(c), r(r) {}\n};\n\nusing Polygon = std::vector<Vec>;\n\nT dot(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).real();\n}\n\nT cross(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).imag();\n}\n\nVec rot(const Vec& a, T ang) {\n return a * Vec(std::cos(ang), std::sin(ang));\n}\n\nVec perp(const Vec& a) {\n return Vec(-a.imag(), a.real());\n}\n\nVec projection(const Line& l, const Vec& p) {\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\n}\n\nVec reflection(const Line& l, const Vec& p) {\n return T(2) * projection(l, p) - p;\n}\n\n// 0: collinear\n// 1: counter-clockwise\n// -1: clockwise\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\n if (eq(cross(b - a, c - a), 0)) return 0;\n if (lt(cross(b - a, c - a), 0)) return -1;\n return 1;\n}\n\nvoid sort_by_arg(std::vector<Vec>& pts) {\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\n if (cross(p, q) == 0) {\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\n return (p.real() > q.real());\n }\n return (cross(p, q) > 0);\n });\n}\n\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\n int n = pts.size();\n if (n == 1) return pts;\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\n });\n int k = 0; // the number of vertices in the convex hull\n std::vector<Vec> ch(2 * n);\n // right\n for (int i = 0; i < n; ++i) {\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n int t = k;\n // left\n for (int i = n - 2; i >= 0; --i) {\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n ch.resize(k - 1);\n return ch;\n}\n\n\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int N;\n cin >> N;\n vector<Vec> pts(N);\n for (auto& p : pts) cin >> p;\n\n if (N <= 2) {\n cout << 0 << endl;\n return 0;\n }\n\n auto calc = [&](vector<Vec> pts) {\n sort(all(pts), [&](auto& p1, auto& p2) { return p1.real() < p2.real(); });\n vector<ll> area(N+1, 4e18);\n vector<Vec> lower, upper;\n if (pts[0].real() < pts[1].real()) {\n lower.push_back(pts[0]);\n lower.push_back(pts[1]);\n upper.push_back(pts[0]);\n upper.push_back(pts[1]);\n } else {\n if (pts[0].imag() < pts[1].imag()) swap(pts[0], pts[1]);\n lower.push_back(pts[0]);\n lower.push_back(pts[1]);\n upper.push_back(pts[1]);\n upper.push_back(pts[0]);\n }\n area[0] = area[1] = area[2] = 0;\n ll a = 0;\n for (int i = 2; i < N; ) {\n int j = i;\n while (j < N && pts[i].real() == pts[j].real()) {\n while (lower.size() >= 2 && lt(cross(lower.back()-lower[lower.size()-2], pts[j]-lower.back()), 0)) {\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\n lower.pop_back();\n }\n while (upper.size() >= 2 && lt(0, cross(upper.back()-upper[upper.size()-2], pts[j]-upper.back()))) {\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\n upper.pop_back();\n }\n a += abs(cross(upper.back()-pts[j], lower.back()-pts[j]));\n upper.push_back(pts[j]);\n lower.push_back(pts[j]);\n ++j;\n }\n area[j] = a;\n i = j;\n }\n return area;\n };\n\n auto left = calc(pts);\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\n auto right = calc(pts);\n ll ans = 4e18;\n rep(i,0,N+1) {\n chmin(ans, (left[i]+right[N-i]+1)/2);\n }\n cout << ans << endl;\n}","accuracy":0.6,"time_ms":20,"memory_kb":7016,"score_of_the_acc":-0.3429,"final_rank":10},{"submission_id":"aoj_2786_6790332","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\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];\n if (i < (int) v.size() - 1) os << \" \";\n }\n return os;\n}\n\nusing T = ll;\nusing Vec = std::complex<T>;\n\nconst T PI = std::acos(-1);\n\nconstexpr T eps = 1e-10;\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\ninline bool lt(T a, T b) { return a < b - eps; }\ninline bool leq(T a, T b) { return a <= b + eps; }\n\nstd::istream& operator>>(std::istream& is, Vec& p) {\n T x, y;\n is >> x >> y;\n p = {x, y};\n return is;\n}\n\nstruct Line {\n Vec p1, p2;\n Line() = default;\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Segment {\n Vec p1, p2;\n Segment() = default;\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Circle {\n Vec c;\n T r;\n Circle() = default;\n Circle(const Vec& c, T r) : c(c), r(r) {}\n};\n\nusing Polygon = std::vector<Vec>;\n\nT dot(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).real();\n}\n\nT cross(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).imag();\n}\n\nVec rot(const Vec& a, T ang) {\n return a * Vec(std::cos(ang), std::sin(ang));\n}\n\nVec perp(const Vec& a) {\n return Vec(-a.imag(), a.real());\n}\n\nVec projection(const Line& l, const Vec& p) {\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\n}\n\nVec reflection(const Line& l, const Vec& p) {\n return T(2) * projection(l, p) - p;\n}\n\n// 0: collinear\n// 1: counter-clockwise\n// -1: clockwise\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\n if (eq(cross(b - a, c - a), 0)) return 0;\n if (lt(cross(b - a, c - a), 0)) return -1;\n return 1;\n}\n\nvoid sort_by_arg(std::vector<Vec>& pts) {\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\n if (cross(p, q) == 0) {\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\n return (p.real() > q.real());\n }\n return (cross(p, q) > 0);\n });\n}\n\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\n int n = pts.size();\n if (n == 1) return pts;\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\n });\n int k = 0; // the number of vertices in the convex hull\n std::vector<Vec> ch(2 * n);\n // right\n for (int i = 0; i < n; ++i) {\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n int t = k;\n // left\n for (int i = n - 2; i >= 0; --i) {\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n ch.resize(k - 1);\n return ch;\n}\n\n\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int N;\n cin >> N;\n vector<Vec> pts(N);\n for (auto& p : pts) cin >> p;\n\n if (N <= 2) {\n cout << 0 << endl;\n return 0;\n }\n\n sort(all(pts), [&](auto& p1, auto& p2) {\n return p1.real() < p2.real();\n });\n\n auto calc = [&](vector<Vec> pts) {\n sort(all(pts), [&](auto& p1, auto& p2) { return p1.real() < p2.real(); });\n vector<ll> area(N+1, 4e18);\n vector<Vec> lower, upper;\n if (pts[0].real() < pts[1].real()) {\n lower.push_back(pts[0]);\n lower.push_back(pts[1]);\n upper.push_back(pts[0]);\n upper.push_back(pts[1]);\n } else {\n if (pts[0].imag() < pts[1].imag()) swap(pts[0], pts[1]);\n lower.push_back(pts[0]);\n lower.push_back(pts[1]);\n upper.push_back(pts[1]);\n upper.push_back(pts[0]);\n }\n area[0] = area[1] = area[2] = 0;\n ll a = 0;\n for (int i = 2; i < N; ) {\n int j = i+1;\n while (j < N && pts[i].real() == pts[j].real()) ++j;\n rep(k,i,j) {\n while (lower.size() >= 2 && lt(cross(lower.back()-lower[lower.size()-2], pts[k]-lower.back()), 0)) {\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\n lower.pop_back();\n }\n while (upper.size() >= 2 && lt(0, cross(upper.back()-upper[upper.size()-2], pts[k]-upper.back()))) {\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\n upper.pop_back();\n }\n a += abs(cross(upper.back()-pts[k], lower.back()-pts[k]));\n upper.push_back(pts[k]);\n lower.push_back(pts[k]);\n }\n area[j] = a;\n i = j;\n }\n return area;\n };\n\n auto left = calc(pts);\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\n auto right = calc(pts);\n ll ans = 4e18;\n rep(i,0,N+1) {\n chmin(ans, (left[i]+right[N-i]+1)/2);\n }\n cout << ans << endl;\n}","accuracy":0.6,"time_ms":20,"memory_kb":7156,"score_of_the_acc":-0.3515,"final_rank":11},{"submission_id":"aoj_2786_6790300","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\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];\n if (i < (int) v.size() - 1) os << \" \";\n }\n return os;\n}\n\nusing T = ll;\nusing Vec = std::complex<T>;\n\nconst T PI = std::acos(-1);\n\nconstexpr T eps = 1e-10;\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\ninline bool lt(T a, T b) { return a < b - eps; }\ninline bool leq(T a, T b) { return a <= b + eps; }\n\nstd::istream& operator>>(std::istream& is, Vec& p) {\n T x, y;\n is >> x >> y;\n p = {x, y};\n return is;\n}\n\nstruct Line {\n Vec p1, p2;\n Line() = default;\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Segment {\n Vec p1, p2;\n Segment() = default;\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Circle {\n Vec c;\n T r;\n Circle() = default;\n Circle(const Vec& c, T r) : c(c), r(r) {}\n};\n\nusing Polygon = std::vector<Vec>;\n\nT dot(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).real();\n}\n\nT cross(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).imag();\n}\n\nVec rot(const Vec& a, T ang) {\n return a * Vec(std::cos(ang), std::sin(ang));\n}\n\nVec perp(const Vec& a) {\n return Vec(-a.imag(), a.real());\n}\n\nVec projection(const Line& l, const Vec& p) {\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\n}\n\nVec reflection(const Line& l, const Vec& p) {\n return T(2) * projection(l, p) - p;\n}\n\n// 0: collinear\n// 1: counter-clockwise\n// -1: clockwise\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\n if (eq(cross(b - a, c - a), 0)) return 0;\n if (lt(cross(b - a, c - a), 0)) return -1;\n return 1;\n}\n\nvoid sort_by_arg(std::vector<Vec>& pts) {\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\n if (cross(p, q) == 0) {\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\n return (p.real() > q.real());\n }\n return (cross(p, q) > 0);\n });\n}\n\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\n int n = pts.size();\n if (n == 1) return pts;\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\n });\n int k = 0; // the number of vertices in the convex hull\n std::vector<Vec> ch(2 * n);\n // right\n for (int i = 0; i < n; ++i) {\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n int t = k;\n // left\n for (int i = n - 2; i >= 0; --i) {\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\n ch[k++] = pts[i];\n }\n ch.resize(k - 1);\n return ch;\n}\n\n\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int N;\n cin >> N;\n vector<Vec> pts(N);\n for (auto& p : pts) cin >> p;\n\n if (N <= 2) {\n cout << 0 << endl;\n return 0;\n }\n\n sort(all(pts), [&](auto& p1, auto& p2) {\n return p1.real() < p2.real();\n });\n\n auto calc = [&](vector<Vec> pts) {\n vector<ll> area(N+1, 4e18);\n vector<Vec> lower, upper;\n if (pts[0].real() < pts[1].real()) {\n lower.push_back(pts[0]);\n lower.push_back(pts[1]);\n upper.push_back(pts[0]);\n upper.push_back(pts[1]);\n } else {\n if (pts[0].imag() < pts[1].imag()) swap(pts[0], pts[1]);\n lower.push_back(pts[0]);\n lower.push_back(pts[1]);\n upper.push_back(pts[1]);\n upper.push_back(pts[0]);\n }\n area[0] = area[1] = area[2] = 0;\n ll a = 0;\n for (int i = 2; i < N; ) {\n int j = i+1;\n while (j < N && pts[i].real() == pts[j].real()) ++j;\n rep(k,i,j) {\n while (lower.size() >= 2 && lt(cross(lower.back()-lower[lower.size()-2], pts[k]-lower.back()), 0)) {\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\n lower.pop_back();\n }\n while (upper.size() >= 2 && lt(0, cross(upper.back()-upper[upper.size()-2], pts[k]-upper.back()))) {\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\n upper.pop_back();\n }\n a += abs(cross(upper.back()-pts[k], lower.back()-pts[k]));\n upper.push_back(pts[k]);\n lower.push_back(pts[k]);\n }\n area[j] = a;\n i = j;\n }\n return area;\n };\n\n auto left = calc(pts);\n reverse(all(pts));\n auto right = calc(pts);\n ll ans = 4e18;\n rep(i,0,N+1) {\n chmin(ans, (left[i]+right[N-i]+1)/2);\n }\n cout << ans << endl;\n}","accuracy":0.325,"time_ms":20,"memory_kb":7048,"score_of_the_acc":-0.3448,"final_rank":12}],"string":"[\n {\n \"submission_id\": \"aoj_2786_10850971\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define PB push_back\\n#define MP make_pair\\n#define F first\\n#define S second\\n\\n#define FRI freopen(\\\"zin.txt\\\",\\\"r\\\",stdin)\\n#define FRO freopen(\\\"out.txt\\\",\\\"w\\\",stdout)\\n#define DB(x) #x\\\" =>\\\",x\\n#define debug(args...) {dbg,args; cerr<<endl;}\\n#define RAD(x) ((x*PI)/180)\\n#define DEG(x) ((x*180)/PI)\\n#define NEX(x,y) ((x)==(y)-1?0:(x)+1)\\n#define PRE(x,y) ((x)==0?(y)-1:(x)-1)\\n\\n#define EPS 1e-12\\n#define INF 10000000000007LL\\n#define MAXN 100005\\nusing namespace std;\\n\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef long double LD;\\n\\nstruct debugger{\\n template<typename T> debugger& operator , (const T& v){\\n cerr<<v<<\\\" \\\";\\n return *this;\\n }\\n}dbg;\\n\\nclass PT {\\npublic:\\n LL x, y;\\n PT() {}\\n PT(LL x, LL y) : x(x), y(y) {}\\n PT(const PT &p) : x(p.x), y(p.y) {}\\n PT operator + (const PT &p) const { return PT(x+p.x, y+p.y); }\\n PT operator - (const PT &p) const { return PT(x-p.x, y-p.y); }\\n};\\n\\nLL SignedArea(PT a,PT b,PT c) {\\n PT temp1(b.x-a.x,b.y-a.y),temp2(c.x-a.x,c.y-a.y);\\n return temp1.x*temp2.y-temp1.y*temp2.x;\\n}\\n\\nbool XYasscending(PT a,PT b) {\\n if(a.x==b.x) return a.y<b.y;\\n return a.x<b.x;\\n}\\n\\nvector<PT>rawPts,U,L;\\nvector<LL>xCoords,hi,lo;\\nLL area[2][MAXN];\\n\\nint main() {\\n// FRI;\\n int i,n;\\n LL x,y,ans,r1,r2,leftLo,leftHi;\\n PT pivot;\\n scanf(\\\"%d\\\",&n);\\n for(i=0;i<n;i++) {\\n scanf(\\\"%lld %lld\\\",&x,&y);\\n rawPts.PB(PT(x,y));\\n }\\n sort(rawPts.begin(),rawPts.end(),XYasscending);\\n for(i=0;i<rawPts.size();i++) {\\n if(i==0||rawPts[i].x!=rawPts[i-1].x) {\\n xCoords.PB(rawPts[i].x);\\n lo.PB(rawPts[i].y);\\n hi.PB(rawPts[i].y);\\n }\\n hi[hi.size()-1]=rawPts[i].y;\\n }\\n area[0][0]=0;\\n pivot=PT(xCoords[0],lo[0]);\\n\\n U.PB(PT(xCoords[0],lo[0]));\\n U.PB(PT(xCoords[0],hi[0]));\\n L.PB(PT(xCoords[0],hi[0]));\\n L.PB(PT(xCoords[0],lo[0]));\\n\\n for(i=1;i<xCoords.size();i++) {\\n area[0][i]=area[0][i-1];\\n// cout<<\\\"Considering \\\"<<xCoords[i]<<\\\" \\\"<<hi[i]<<\\\" \\\"<<lo[i]<<endl;\\n// cout<<\\\"Initial \\\"<<area[0][i]<<endl;\\n while(true) {\\n if(U.size()<2) break;\\n if(SignedArea(U[U.size()-2],U[U.size()-1],PT(xCoords[i],hi[i]))>=0) {\\n area[0][i]-=SignedArea(pivot,U[U.size()-2],U[U.size()-1]);\\n// cout<<\\\"Reduced \\\"<<area[0][i]<<endl;\\n U.pop_back();\\n }\\n else break;\\n }\\n U.PB(PT(xCoords[i],hi[i]));\\n area[0][i]+=SignedArea(pivot,U[U.size()-2],U[U.size()-1]);\\n// cout<<\\\"Increased \\\"<<area[0][i]<<endl;\\n\\n while(true) {\\n if(L.size()<2) break;\\n if(SignedArea(L[L.size()-2],L[L.size()-1],PT(xCoords[i],lo[i]))<=0) {\\n area[0][i]+=SignedArea(pivot,L[L.size()-2],L[L.size()-1]);\\n// cout<<\\\"Reduced \\\"<<area[0][i]<<endl;\\n L.pop_back();\\n }\\n else break;\\n }\\n L.PB(PT(xCoords[i],lo[i]));\\n area[0][i]-=SignedArea(pivot,L[L.size()-2],L[L.size()-1]);\\n// cout<<\\\"Increased \\\"<<area[0][i]<<endl;\\n\\n area[0][i]-=SignedArea(pivot,PT(xCoords[i-1],hi[i-1]),PT(xCoords[i-1],lo[i-1]));\\n// cout<<\\\"Here \\\"<<area[0][i]<<endl;\\n area[0][i]+=SignedArea(pivot,PT(xCoords[i],hi[i]),PT(xCoords[i],lo[i]));\\n// cout<<\\\"Final \\\"<<area[0][i]<<endl;\\n }\\n\\n area[1][xCoords.size()-1]=0;\\n pivot=PT(xCoords[xCoords.size()-1],lo[xCoords.size()-1]);\\n\\n U.clear();\\n L.clear();\\n\\n U.PB(PT(xCoords[xCoords.size()-1],lo[xCoords.size()-1]));\\n U.PB(PT(xCoords[xCoords.size()-1],hi[xCoords.size()-1]));\\n L.PB(PT(xCoords[xCoords.size()-1],hi[xCoords.size()-1]));\\n L.PB(PT(xCoords[xCoords.size()-1],lo[xCoords.size()-1]));\\n\\n for(i=xCoords.size()-2;i>=0;i--) {\\n area[1][i]=area[1][i+1];\\n while(true) {\\n if(U.size()<2) break;\\n if(SignedArea(U[U.size()-2],U[U.size()-1],PT(xCoords[i],hi[i]))<=0) {\\n area[1][i]-=SignedArea(pivot,U[U.size()-2],U[U.size()-1]);\\n U.pop_back();\\n }\\n else break;\\n }\\n U.PB(PT(xCoords[i],hi[i]));\\n area[1][i]+=SignedArea(pivot,U[U.size()-2],U[U.size()-1]);\\n\\n while(true) {\\n if(L.size()<2) break;\\n if(SignedArea(L[L.size()-2],L[L.size()-1],PT(xCoords[i],lo[i]))>=0) {\\n area[1][i]+=SignedArea(pivot,L[L.size()-2],L[L.size()-1]);\\n L.pop_back();\\n }\\n else break;\\n }\\n L.PB(PT(xCoords[i],lo[i]));\\n area[1][i]-=SignedArea(pivot,L[L.size()-2],L[L.size()-1]);\\n\\n area[1][i]-=SignedArea(pivot,PT(xCoords[i+1],hi[i+1]),PT(xCoords[i+1],lo[i+1]));\\n area[1][i]+=SignedArea(pivot,PT(xCoords[i],hi[i]),PT(xCoords[i],lo[i]));\\n }\\n\\n ans=abs(area[0][0])+abs(area[1][1]);\\n for(i=1;i<xCoords.size()-1;i++) ans=min(ans,abs(area[0][i])+abs(area[1][i+1]));\\n\\n if(ans&1) cout<<(ans+1)/2<<endl;\\n else cout<<ans/2<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 11432,\n \"score_of_the_acc\": -0.6165,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2786_10690700\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nlong long X[100009];\\nlong long Y[100009];\\nlong long KEEP[100009];\\nlong long MX[100009];\\nlong long MI[100009];\\nlong long ANS[100009],ANSS[100009];\\nvector<long long>vec,XX[100009];\\nmap<long long,long long>mymap;\\n\\nvector<pair<long long,long long> >U,L;\\n\\nvoid prnt(pair<long long,long long> A)\\n{\\n cout<<A.first<<\\\" \\\"<<A.second<<endl;\\n}\\n\\npair<long long,long long> minu(pair<long long,long long> A,pair<long long,long long> B)\\n{\\n pair<long long,long long> C;\\n C.first=-A.first*B.second+B.first*A.second;\\n C.second=A.first*B.first;\\n long long temp=__gcd(abs(C.first),abs(C.second));\\n C.first/=temp;\\n C.second/=temp;\\n\\n if(C.second<0)\\n {\\n C.first*=-1;\\n C.second*=-1;\\n }\\n return C;\\n}\\n\\npair<long long,long long> get(pair<long long,long long> A,pair<long long,long long> B)\\n{\\n pair<long long,long long> C;\\n C.first=B.first-A.first;\\n C.second=B.second-A.second;\\n\\n long long temp=__gcd(abs(C.first),abs(C.second));\\n C.first/=temp;\\n C.second/=temp;\\n\\n if(C.second<0)\\n {\\n C.first*=-1;\\n C.second*=-1;\\n }\\n\\n return C;\\n}\\n\\nlong long get_area(pair<long long,long long> A,pair<long long,long long> B , pair<long long,long long>C)\\n{\\n long long ans=0;\\n ans+=(A.first*B.second-A.second*B.first);\\n ans+=(B.first*C.second-B.second*C.first);\\n ans+=(C.first*A.second-C.second*A.first);\\n return abs(ans);\\n}\\n\\nint main()\\n{\\n long long n,i,j,k,l,ans,ind,siz,mi,mx,sl,su,temp,now;\\n pair<long long,long long> now_ans,prev;\\n cin>>n;\\n\\n for(i=1;i<=n;i++)\\n {\\n scanf(\\\"%lld%lld\\\",&X[i],&Y[i]);\\n vec.push_back(X[i]);\\n }\\n\\n sort(vec.begin(),vec.end());\\n\\n ind=0;\\n\\n for(i=0;i<n;i++)\\n {\\n if(i) if(vec[i]==vec[i-1]) continue;\\n\\n mymap[vec[i]]=++ind;\\n KEEP[ind]=vec[i];\\n }\\n\\n for(i=1;i<=n;i++)\\n {\\n XX[mymap[X[i]]].push_back(Y[i]);\\n }\\n\\n for(i=1;i<=ind;i++) sort(XX[i].begin(),XX[i].end());\\n for(i=1;i<=ind;i++)\\n {\\n siz=XX[i].size();\\n MI[i]=XX[i][0];\\n MX[i]=XX[i][siz-1];\\n }\\n\\n U.clear();\\n L.clear();\\n sl=0;\\n su=0;\\n\\n for(i=1;i<=ind;i++)\\n {\\n\\n temp=0;\\n if(sl==0)\\n {\\n L.push_back(make_pair(KEEP[i],MI[i]));\\n sl++;\\n }\\n else\\n {\\n prev=get(L[sl-1],make_pair(KEEP[i],MI[i]));\\n now=sl-1;\\n\\n while(1)\\n {\\n if(now<0) break;\\n now_ans=get(L[now],make_pair(KEEP[i],MI[i]));\\n if(minu(now_ans,prev).first<0) break;\\n prev=now_ans;\\n now--;\\n }\\n\\n for(j=sl-1;j>now+1;j--)\\n {\\n temp+=get_area(make_pair(KEEP[i],MI[i]),L[j],L[j-1]);\\n }\\n\\n for(j=sl-1;j>now+1;j--) L.pop_back();\\n L.push_back(make_pair(KEEP[i],MI[i]));\\n sl=L.size();\\n }\\n\\n\\n if(su==0)\\n {\\n U.push_back(make_pair(KEEP[i],MX[i]));\\n su++;\\n }\\n else\\n {\\n prev=get(U[su-1],make_pair(KEEP[i],MX[i]));\\n now=su-1;\\n while(1)\\n {\\n if(now<0) break;\\n now_ans=get(U[now],make_pair(KEEP[i],MX[i]));\\n if(minu(now_ans,prev).first>0) break;\\n prev=now_ans;\\n now--;\\n }\\n\\n\\n for(j=su-1;j>now+1;j--)\\n {\\n temp+=get_area(make_pair(KEEP[i],MX[i]),U[j],U[j-1]);\\n }\\n\\n for(j=su-1;j>now+1;j--) U.pop_back();\\n U.push_back(make_pair(KEEP[i],MX[i]));\\n su=U.size();\\n\\n }\\n\\n if(i>1) temp+=(MX[i]-MI[i]+MX[i-1]-MI[i-1])*(KEEP[i]-KEEP[i-1]);\\n\\n ANS[i]=ANS[i-1]+temp;\\n }\\n\\n U.clear();\\n L.clear();\\n sl=0;\\n su=0;\\n\\n\\n for(i=ind;i>=1;i--)\\n {\\n temp=0;\\n if(sl==0)\\n {\\n L.push_back(make_pair(KEEP[i],MI[i]));\\n sl++;\\n }\\n else\\n {\\n prev=get(L[sl-1],make_pair(KEEP[i],MI[i]));\\n now=sl-1;\\n while(1)\\n {\\n if(now<0) break;\\n now_ans=get(L[now],make_pair(KEEP[i],MI[i]));\\n if(minu(now_ans,prev).first>0) break;\\n prev=now_ans;\\n now--;\\n }\\n\\n\\n for(j=sl-1;j>now+1;j--)\\n {\\n temp+=get_area(make_pair(KEEP[i],MI[i]),L[j],L[j-1]);\\n }\\n\\n for(j=sl-1;j>now+1;j--) L.pop_back();\\n L.push_back(make_pair(KEEP[i],MI[i]));\\n sl=L.size();\\n }\\n\\n if(su==0)\\n {\\n U.push_back(make_pair(KEEP[i],MX[i]));\\n su++;\\n }\\n else\\n {\\n prev=get(U[su-1],make_pair(KEEP[i],MX[i]));\\n now=su-1;\\n while(1)\\n {\\n if(now<0) break;\\n now_ans=get(U[now],make_pair(KEEP[i],MX[i]));\\n if(minu(now_ans,prev).first<0) break;\\n prev=now_ans;\\n now--;\\n }\\n\\n\\n for(j=su-1;j>now+1;j--)\\n {\\n temp+=get_area(make_pair(KEEP[i],MX[i]),U[j],U[j-1]);\\n }\\n\\n for(j=su-1;j>now+1;j--) U.pop_back();\\n U.push_back(make_pair(KEEP[i],MX[i]));\\n su=U.size();\\n\\n }\\n\\n if(i<ind) temp+=(MX[i]-MI[i]+MX[i+1]-MI[i+1])*(-KEEP[i]+KEEP[i+1]);\\n\\n ANSS[i]=ANSS[i+1]+temp;\\n }\\n\\n\\n ans=1LL<<62;\\n\\n for(i=0;i<=ind;i++)\\n {\\n ans=min(ans,ANS[i]+ANSS[i+1]);\\n }\\n\\n cout<<(1+ans)/2<<endl;\\n\\n\\n\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 70,\n \"memory_kb\": 11340,\n \"score_of_the_acc\": -1.325,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2786_10296372\",\n \"code_snippet\": \"// AOJ #2786 Share the Ruins Preservation\\n// 2025.3.14\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\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 P { ll x, y; };\\n\\nll cross(const P &a, const P &b, const P &c) {\\n return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);\\n}\\n\\nll cross(const P &a, const P &b) {\\n return a.x * b.y - a.y * b.x;\\n}\\n\\nvector<ld> getPrefixArea(const vector<P>& pts) {\\n int n = pts.size();\\n vector<ld> pre(n, 0.0L);\\n vector<P> L;\\n vector<ld> LS;\\n vector<P> U;\\n vector<ld> US;\\n for (int i = 0; i < n; i++){\\n P p = pts[i];\\n while(L.size() >= 2 && cross(L[L.size()-2], L[L.size()-1], p) <= 0) {\\n L.pop_back();\\n LS.pop_back();\\n }\\n if(L.empty()){\\n L.push_back(p);\\n LS.push_back(0);\\n } else {\\n L.push_back(p);\\n ll c = cross(L[L.size()-2], p);\\n ld sum = (LS.empty()? 0 : LS.back()) + c;\\n LS.push_back(sum);\\n }\\n\\n while(U.size() >= 2 && cross(U[U.size()-2], U[U.size()-1], p) >= 0) {\\n U.pop_back();\\n US.pop_back();\\n }\\n if(U.empty()){\\n U.push_back(p);\\n US.push_back(0);\\n } else {\\n U.push_back(p);\\n ll c = cross(U[U.size()-2], p);\\n ld sum = (US.empty()? 0 : US.back()) + c;\\n US.push_back(sum);\\n }\\n\\n if(i < 2) {\\n pre[i] = 0.0L;\\n } else {\\n ld area2 = US.back() - LS.back();\\n if(area2 < 0) area2 = -area2;\\n pre[i] = area2 / 2.0L;\\n }\\n }\\n return pre;\\n}\\n\\nvector<ld> getSuffixArea(const vector<P>& pts) {\\n int n = pts.size();\\n vector<ld> suf(n, 0.0L);\\n vector<P> L;\\n vector<ld> LS;\\n vector<P> U;\\n vector<ld> US;\\n for (int i = n-1; i >= 0; i--){\\n P p = pts[i];\\n while(L.size() >= 2 && cross(L[L.size()-2], L[L.size()-1], p) <= 0) {\\n L.pop_back();\\n LS.pop_back();\\n }\\n if(L.empty()){\\n L.push_back(p);\\n LS.push_back(0);\\n } else {\\n L.push_back(p);\\n ll c = cross(L[L.size()-2], p);\\n ld sum = (LS.empty()? 0 : LS.back()) + c;\\n LS.push_back(sum);\\n }\\n\\n while(U.size() >= 2 && cross(U[U.size()-2], U[U.size()-1], p) >= 0) {\\n U.pop_back();\\n US.pop_back();\\n }\\n if(U.empty()){\\n U.push_back(p);\\n US.push_back(0);\\n } else {\\n U.push_back(p);\\n ll c = cross(U[U.size()-2], p);\\n ld sum = (US.empty()? 0 : US.back()) + c;\\n US.push_back(sum);\\n }\\n\\n if(i > n-3) {\\n suf[i] = 0.0L;\\n } else {\\n ld area2 = US.back() - LS.back();\\n if(area2 < 0) area2 = -area2;\\n suf[i] = area2 / 2.0L;\\n }\\n }\\n return suf;\\n}\\n\\nint main(){\\n int n = Cin();\\n vector<P> pts(n);\\n for (int i = 0; i < n; i++){\\n pts[i].x = Cin(), pts[i].y = Cin();\\n }\\n sort(pts.begin(), pts.end(), [](const P &a, const P &b){\\n if(a.x == b.x) return a.y < b.y;\\n return a.x < b.x;\\n });\\n\\n vector<ld> pre = getPrefixArea(pts);\\n vector<ld> suf = getSuffixArea(pts);\\n\\n ld ans = pre[n-1];\\n for (int i = 0; i < n-1; i++){\\n if(pts[i].x < pts[i+1].x){\\n ld tot = pre[i] + suf[i+1];\\n if(tot < ans) ans = tot;\\n }\\n }\\n Cout((ll)floor(ans + 0.5L));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 12136,\n \"score_of_the_acc\": -0.5172,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2786_9822918\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nstruct Point {\\n ll X, Y;\\n Point() : X(0), Y(0) {}\\n Point(ll x, ll y) : X(x), Y(y) {}\\n};\\n\\nll cross(Point A, Point B) {\\n return A.X * B.Y - A.Y * B.X;\\n}\\n\\nll Area(Point A, Point B, Point C) {\\n B.X -= A.X, B.Y -= A.Y;\\n C.X -= A.X, C.Y -= A.Y;\\n return abs(cross(B,C));\\n}\\n\\nint ccw(Point A, Point B, Point C) {\\n B.X -= A.X, B.Y -= A.Y;\\n C.X -= A.X, C.Y -= A.Y;\\n if (cross(B,C) > 0) return 1;\\n if (cross(B,C) < 0) return -1;\\n return 0;\\n}\\n\\nvector<ll> Calc(vector<Point> P) {\\n int N = P.size();\\n vector<ll> Ret(N+1);\\n Ret[0] = Ret[1] = 0;\\n vector<Point> upper, lower;\\n upper.push_back(P[0]), lower.push_back(P[0]);\\n rep(i,1,N) {\\n Ret[i+1] = Ret[i];\\n while(upper.size() >= 2 && ccw(upper[upper.size()-2],upper.back(),P[i]) == 1) {\\n Ret[i+1] -= Area(upper[upper.size()-2], upper.back(), lower.back());\\n upper.pop_back();\\n }\\n while(lower.size() >= 2 && ccw(lower[lower.size()-2],lower.back(),P[i]) == -1) {\\n Ret[i+1] -= Area(lower[lower.size()-2], lower.back(), upper.back());\\n lower.pop_back();\\n }\\n Ret[i+1] += Area(lower.back(), upper.back(), P[i]);\\n lower.push_back(P[i]), upper.push_back(P[i]);\\n }\\n return Ret;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<Point> P(N), RP(N);\\n rep(i,0,N) {\\n ll x, y;\\n cin >> x >> y;\\n P[i] = Point(x,y);\\n RP[i] = Point(-x,y);\\n }\\n sort(ALL(P), [&](Point P1, Point P2){\\n if (P1.X == P2.X) return P1.Y < P2.Y;\\n return P1.X < P2.X;\\n });\\n sort(ALL(RP), [&](Point P1, Point P2){\\n if (P1.X == P2.X) return P1.Y < P2.Y;\\n return P1.X < P2.X;\\n });\\n auto A = Calc(P), RA = Calc(RP);\\n reverse(ALL(RA));\\n ll ANS = RA[0];\\n rep(i,0,N-1) {\\n if (P[i].X == P[i+1].X) continue;\\n chmin(ANS, A[i+1]+RA[i+1]);\\n }\\n cout << (ANS+1)/2 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 14204,\n \"score_of_the_acc\": -1.2168,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2786_9822906\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nusing T = double;\\nconst T eps = 1e-8;\\nusing Point = complex<T>;\\nusing Poly = vector<Point>;\\n#define X real()\\n#define Y imag()\\ntemplate <typename T> inline bool eq(const T &a, const T &b) {\\n return fabs(a - b) < eps;\\n}\\nbool cmp(const Point &a, const Point &b) {\\n auto sub = [&](Point a) {\\n return (a.Y < 0 ? -1 : (a.Y == 0 && a.X >= 0 ? 0 : 1));\\n };\\n if (sub(a) != sub(b))\\n return sub(a) < sub(b);\\n return a.Y * b.X < a.X * b.Y;\\n}\\nstruct Line {\\n Point a, b, dir;\\n Line() {}\\n Line(Point _a, Point _b) : a(_a), b(_b), dir(b - a) {}\\n Line(T A, T B, T C) {\\n if (eq(A, .0)) {\\n a = Point(0, C / B), b = Point(1 / C / B);\\n } else if (eq(B, .0)) {\\n a = Point(C / A, 0), b = Point(C / A, 1);\\n } else {\\n a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n }\\n};\\nstruct Segment : Line {\\n Segment() {}\\n Segment(Point _a, Point _b) : Line(_a, _b) {}\\n};\\nstruct Circle {\\n Point p;\\n T r;\\n Circle() {}\\n Circle(Point _p, T _r) : p(_p), r(_r) {}\\n};\\n\\nistream &operator>>(istream &is, Point &p) {\\n T x, y;\\n is >> x >> y;\\n p = Point(x, y);\\n return is;\\n}\\nostream &operator<<(ostream &os, Point &p) {\\n os << fixed << setprecision(12) << p.X << ' ' << p.Y;\\n return os;\\n}\\nPoint unit(const Point &a) {\\n return a / abs(a);\\n}\\nT dot(const Point &a, const Point &b) {\\n return a.X * b.X + a.Y * b.Y;\\n}\\nT cross(const Point &a, const Point &b) {\\n return a.X * b.Y - a.Y * b.X;\\n}\\nPoint rot(const Point &a, const T &theta) {\\n return Point(cos(theta) * a.X - sin(theta) * a.Y,\\n sin(theta) * a.X + cos(theta) * a.Y);\\n}\\nPoint rot90(const Point &a) {\\n return Point(-a.Y, a.X);\\n}\\nT arg(const Point &a, const Point &b, const Point &c) {\\n double ret = acos(dot(a - b, c - b) / abs(a - b) / abs(c - b));\\n if (cross(a - b, c - b) < 0)\\n ret = -ret;\\n return ret;\\n}\\n\\nPoint Projection(const Line &l, const Point &p) {\\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\nPoint Projection(const Segment &l, const Point &p) {\\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\nPoint Reflection(const Line &l, const Point &p) {\\n return p + (Projection(l, p) - p) * 2.;\\n}\\nint ccw(const Point &a, Point b, Point c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > eps)\\n return 1; // ccw\\n\\n if (cross(b, c) < -eps)\\n return -1; // cw\\n\\n if (dot(b, c) < 0)\\n return 2; // c,a,b\\n\\n if (norm(b) < norm(c))\\n return -2; // a,b,c\\n\\n return 0; // a,c,b\\n\\n}\\nbool isOrthogonal(const Line &a, const Line &b) {\\n return eq(dot(a.b - a.a, b.b - b.a), .0);\\n}\\nbool isParallel(const Line &a, const Line &b) {\\n return eq(cross(a.b - a.a, b.b - b.a), .0);\\n}\\nbool isIntersect(const Segment &a, const Segment &b) {\\n return ccw(a.a, a.b, b.a) * ccw(a.a, a.b, b.b) <= 0 and\\n ccw(b.a, b.b, a.a) * ccw(b.a, b.b, a.b) <= 0;\\n}\\nint isIntersect(const Circle &a, const Circle &b) {\\n T d = abs(a.p - b.p);\\n if (d > a.r + b.r + eps)\\n return 4;\\n if (eq(d, a.r + b.r))\\n return 3;\\n if (eq(d, abs(a.r - b.r)))\\n return 1;\\n if (d < abs(a.r - b.r) - eps)\\n return 0;\\n return 2;\\n}\\nT Dist(const Line &a, const Point &b) {\\n Point c = Projection(a, b);\\n return abs(c - b);\\n}\\nT Dist(const Segment &a, const Point &b) {\\n if (dot(a.b - a.a, b - a.a) < eps)\\n return abs(b - a.a);\\n if (dot(a.a - a.b, b - a.b) < eps)\\n return abs(b - a.b);\\n return abs(cross(a.b - a.a, b - a.a)) / abs(a.b - a.a);\\n}\\nT Dist(const Segment &a, const Segment &b) {\\n if (isIntersect(a, b))\\n return .0;\\n T res = min({Dist(a, b.a), Dist(a, b.b), Dist(b, a.a), Dist(b, a.b)});\\n return res;\\n}\\nPoint Intersection(const Line &a, const Line &b) {\\n T d1 = cross(a.b - a.a, b.b - b.a);\\n T d2 = cross(a.b - a.a, a.b - b.a);\\n if (eq(d1, 0.) and eq(d2, 0.))\\n return b.a;\\n return b.a + (b.b - b.a) * (d2 / d1);\\n}\\nPoly Intersection(const Circle &a, const Line &b) {\\n Poly res;\\n T d = Dist(b, a.p);\\n if (d > a.r + eps)\\n return res;\\n Point h = Projection(b, a.p);\\n if (eq(d, a.r)) {\\n res.push_back(h);\\n return res;\\n }\\n Point e = unit(b.b - b.a);\\n T ph = sqrt(a.r * a.r - d * d);\\n res.push_back(h - e * ph);\\n res.push_back(h + e * ph);\\n return res;\\n}\\nPoly Intersection(const Circle &a, const Segment &b) {\\n Line c(b.a, b.b);\\n Poly sub = Intersection(a, c);\\n double xmi = min(b.a.X, b.b.X), xma = max(b.a.X, b.b.X);\\n double ymi = min(b.a.Y, b.b.Y), yma = max(b.a.Y, b.b.Y);\\n Poly res;\\n rep(i, 0, sub.size()) {\\n if (xmi <= sub[i].X + eps and sub[i].X - eps <= xma and\\n ymi <= sub[i].Y + eps and sub[i].Y - eps <= yma) {\\n res.push_back(sub[i]);\\n }\\n }\\n return res;\\n}\\nPoly Intersection(const Circle &a, const Circle &b) {\\n Poly res;\\n int mode = isIntersect(a, b);\\n T d = abs(a.p - b.p);\\n if (mode == 4 or mode == 0)\\n return res;\\n if (mode == 3) {\\n T t = a.r / (a.r + b.r);\\n res.push_back(a.p + (b.p - a.p) * t);\\n return res;\\n }\\n if (mode == 1) {\\n if (b.r < a.r - eps) {\\n res.push_back(a.p + (b.p - a.p) * (a.r / d));\\n } else {\\n res.push_back(b.p + (a.p - b.p) * (b.r / d));\\n }\\n return res;\\n }\\n T rc = (a.r * a.r + d * d - b.r * b.r) / d / 2.;\\n T rs = sqrt(a.r * a.r - rc * rc);\\n if (a.r - abs(rc) < eps)\\n rs = 0;\\n Point e = unit(b.p - a.p);\\n res.push_back(a.p + rc * e + rs * e * Point(0, 1));\\n res.push_back(a.p + rc * e + rs * e * Point(0, -1));\\n return res;\\n}\\nPoly HalfplaneIntersection(vector<Line> &H) {\\n sort(ALL(H), [&](Line &l1, Line &l2) { return cmp(l1.dir, l2.dir); });\\n auto outside = [&](Line &L, Point p) -> bool {\\n return cross(L.dir, p - L.a) < -eps;\\n };\\n deque<Line> deq;\\n int sz = 0;\\n rep(i, 0, SZ(H)) {\\n while (sz > 1 and\\n outside(H[i], Intersection(deq[sz - 1], deq[sz - 2]))) {\\n deq.pop_back();\\n sz--;\\n }\\n while (sz > 1 and outside(H[i], Intersection(deq[0], deq[1]))) {\\n deq.pop_front();\\n sz--;\\n }\\n if (sz > 0 and fabs(cross(H[i].dir, deq[sz - 1].dir)) < eps) {\\n if (dot(H[i].dir, deq[sz - 1].dir) < 0) {\\n return {};\\n }\\n if (outside(H[i], deq[sz - 1].a)) {\\n deq.pop_back();\\n sz--;\\n } else\\n continue;\\n }\\n deq.push_back(H[i]);\\n sz++;\\n }\\n\\n while (sz > 2 and outside(deq[0], Intersection(deq[sz - 1], deq[sz - 2]))) {\\n deq.pop_back();\\n sz--;\\n }\\n while (sz > 2 and outside(deq[sz - 1], Intersection(deq[0], deq[1]))) {\\n deq.pop_front();\\n sz--;\\n }\\n if (sz < 3)\\n return {};\\n deq.push_back(deq.front());\\n Poly ret;\\n rep(i, 0, sz) ret.push_back(Intersection(deq[i], deq[i + 1]));\\n return ret;\\n}\\n\\nT Area(const Poly &a) {\\n T res = 0;\\n int n = a.size();\\n rep(i, 0, n) res += cross(a[i], a[(i + 1) % n]);\\n return fabs(res / 2.);\\n}\\nT Area(const Poly &a, const Circle &b) {\\n int n = a.size();\\n if (n < 3)\\n return .0;\\n auto rec = [&](auto self, const Circle &c, const Point &p1,\\n const Point &p2) {\\n Point va = c.p - p1, vb = c.p - p2;\\n T f = cross(va, vb), res = .0;\\n if (eq(f, .0))\\n return res;\\n if (max(abs(va), abs(vb)) < c.r + eps)\\n return f;\\n if (Dist(Segment(p1, p2), c.p) > c.r - eps)\\n return c.r * c.r * arg(vb * conj(va));\\n auto u = Intersection(c, Segment(p1, p2));\\n Poly sub;\\n sub.push_back(p1);\\n for (auto &x : u)\\n sub.push_back(x);\\n sub.push_back(p2);\\n rep(i, 0, sub.size() - 1) res += self(self, c, sub[i], sub[i + 1]);\\n return res;\\n };\\n T res = .0;\\n rep(i, 0, n) res += rec(rec, b, a[i], a[(i + 1) % n]);\\n return fabs(res / 2.);\\n}\\nT Area(const Circle &a, const Circle &b) {\\n T d = abs(a.p - b.p);\\n if (d >= a.r + b.r - eps)\\n return .0;\\n if (d <= abs(a.r - b.r) + eps) {\\n T r = min(a.r, b.r);\\n return M_PI * r * r;\\n }\\n T ath = acos((a.r * a.r + d * d - b.r * b.r) / d / a.r / 2.);\\n T res = a.r * a.r * (ath - sin(ath * 2) / 2.);\\n T bth = acos((b.r * b.r + d * d - a.r * a.r) / d / b.r / 2.);\\n res += b.r * b.r * (bth - sin(bth * 2) / 2.);\\n return fabs(res);\\n}\\nbool isConvex(const Poly &a) {\\n int n = a.size();\\n int cur, pre, nxt;\\n rep(i, 0, n) {\\n pre = (i - 1 + n) % n;\\n nxt = (i + 1) % n;\\n cur = i;\\n if (ccw(a[pre], a[cur], a[nxt]) == -1)\\n return 0;\\n }\\n return 1;\\n}\\nint isContained(const Poly &a,\\n const Point &b) { // 0:not contain,1:on edge,2:contain\\n\\n bool res = 0;\\n int n = a.size();\\n rep(i, 0, n) {\\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\\n if (p.Y > q.Y)\\n swap(p, q);\\n if (p.Y < eps and eps < q.Y and cross(p, q) > eps)\\n res ^= 1;\\n if (eq(cross(p, q), .0) and dot(p, q) < eps)\\n return 1;\\n }\\n return (res ? 2 : 0);\\n}\\nPoly ConvexHull(Poly &a) {\\n sort(ALL(a), [](const Point &p, const Point &q) {\\n return (eq(p.Y, q.Y) ? p.X < q.X : p.Y < q.Y);\\n });\\n a.erase(unique(ALL(a)), a.end());\\n int n = a.size(), k = 0;\\n Poly res(n * 2);\\n for (int i = 0; i < n; res[k++] = a[i++]) {\\n while (k >= 2 and\\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\\n k--;\\n }\\n for (int i = n - 2, t = k + 1; i >= 0; res[k++] = a[i--]) {\\n while (k >= t and\\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\\n k--;\\n }\\n res.resize(k - 1);\\n return res;\\n}\\nT Diam(const Poly &a) {\\n int n = a.size();\\n int x = 0, y = 0;\\n rep(i, 1, n) {\\n if (a[i].Y > a[x].Y)\\n x = i;\\n if (a[i].Y < a[y].Y)\\n y = i;\\n }\\n T res = abs(a[x] - a[y]);\\n int i = x, j = y;\\n do {\\n if (cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j]) < 0)\\n i = (i + 1) % n;\\n else\\n j = (j + 1) % n;\\n chmax(res, abs(a[i] - a[j]));\\n } while (i != x or j != y);\\n return res;\\n}\\nPoly Cut(const Poly &a, const Line &l) {\\n int n = a.size();\\n Poly res;\\n rep(i, 0, n) {\\n Point p = a[i], q = a[(i + 1) % n];\\n if (ccw(l.a, l.b, p) != -1)\\n res.push_back(p);\\n if (ccw(l.a, l.b, p) * ccw(l.a, l.b, q) < 0)\\n res.push_back(Intersection(Line(p, q), l));\\n }\\n return res;\\n}\\n\\nT Closest(Poly &a) {\\n int n = a.size();\\n if (n <= 1)\\n return 0;\\n sort(ALL(a), [&](Point a, Point b) {\\n return (eq(a.X, b.X) ? a.Y < b.Y : a.X < b.X);\\n });\\n Poly buf(n);\\n auto rec = [&](auto self, int lb, int rb) -> T {\\n if (rb - lb <= 1)\\n return (T)INF;\\n int mid = (lb + rb) >> 1;\\n auto x = a[mid].X;\\n T res = min(self(self, lb, mid), self(self, mid, rb));\\n inplace_merge(a.begin() + lb, a.begin() + mid, a.begin() + rb,\\n [&](auto p, auto q) { return p.Y < q.Y; });\\n int ptr = 0;\\n rep(i, lb, rb) {\\n if (abs(a[i].X - x) >= res)\\n continue;\\n rep(j, 0, ptr) {\\n auto sub = a[i] - buf[ptr - 1 - j];\\n if (sub.Y >= res)\\n break;\\n chmin(res, abs(sub));\\n }\\n buf[ptr++] = a[i];\\n }\\n return res;\\n };\\n return rec(rec, 0, n);\\n}\\n\\nCircle Incircle(const Point &a, const Point &b, const Point &c) {\\n T A = abs(b - c), B = abs(c - a), C = abs(a - b);\\n Point p(A * a.X + B * b.X + C * c.X, A * a.Y + B * b.Y + C * c.Y);\\n p /= (A + B + C);\\n T r = Dist(Line(a, b), p);\\n return Circle(p, r);\\n}\\nCircle Circumcircle(const Point &a, const Point &b, const Point &c) {\\n Line l1((a + b) / 2., (a + b) / 2. + (b - a) * Point(0, 1));\\n Line l2((b + c) / 2., (b + c) / 2. + (c - b) * Point(0, 1));\\n Point p = Intersection(l1, l2);\\n return Circle(p, abs(p - a));\\n}\\nPoly tangent(const Point &a, const Circle &b) {\\n return Intersection(b, Circle(a, sqrt(norm(b.p - a) - b.r * b.r)));\\n}\\nvector<Line> tangent(const Circle &a, const Circle &b) {\\n vector<Line> res;\\n T d = abs(a.p - b.p);\\n if (eq(d, 0.))\\n return res;\\n Point u = unit(b.p - a.p);\\n Point v = u * Point(0, 1);\\n for (int t : {-1, 1}) {\\n T h = (a.r + b.r * t) / d;\\n if (eq(h * h, 1.)) {\\n res.push_back(Line(a.p + (h > 0 ? u : -u) * a.r,\\n a.p + (h > 0 ? u : -u) * a.r + v));\\n } else if (1 > h * h) {\\n Point U = u * h, V = v * sqrt(1 - h * h);\\n res.push_back(Line(a.p + (U + V) * a.r, b.p - (U + V) * (b.r * t)));\\n res.push_back(Line(a.p + (U - V) * a.r, b.p - (U - V) * (b.r * t)));\\n }\\n }\\n return res;\\n}\\n\\n/**\\n * @brief Geometry\\n */\\n\\nvector<double> Calc(vector<Point> P) {\\n int N = P.size();\\n vector<double> Ret(N+1);\\n Ret[0] = Ret[1] = 0.0;\\n vector<Point> upper, lower;\\n upper.push_back(P[0]), lower.push_back(P[0]);\\n rep(i,1,N) {\\n Ret[i+1] = Ret[i];\\n while(upper.size() >= 2 && ccw(upper[upper.size()-2],upper.back(),P[i]) == 1) {\\n Ret[i+1] -= Area({upper[upper.size()-2], upper.back(), lower.back()});\\n upper.pop_back();\\n }\\n while(lower.size() >= 2 && ccw(lower[lower.size()-2],lower.back(),P[i]) == -1) {\\n Ret[i+1] -= Area({lower[lower.size()-2], lower.back(), upper.back()});\\n lower.pop_back();\\n }\\n Ret[i+1] += Area({lower.back(), upper.back(), P[i]});\\n lower.push_back(P[i]), upper.push_back(P[i]);\\n }\\n return Ret;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<Point> P(N), RP(N);\\n rep(i,0,N) {\\n double x, y;\\n cin >> x >> y;\\n P[i] = Point(x,y);\\n RP[i] = Point(-x,y);\\n }\\n sort(ALL(P), [&](Point P1, Point P2){\\n if (eq(P1.real(),P2.real())) return P1.imag() < P2.imag();\\n return P1.real() < P2.real();\\n });\\n sort(ALL(RP), [&](Point P1, Point P2){\\n if (eq(P1.real(),P2.real())) return P1.imag() < P2.imag();\\n return P1.real() < P2.real();\\n });\\n auto A = Calc(P), RA = Calc(RP);\\n reverse(ALL(RA));\\n double ANS = RA[0];\\n rep(i,0,N-1) {\\n if (eq(P[i].real(),P[i+1].real())) continue;\\n chmin(ANS, A[i+1]+RA[i+1]);\\n }\\n cout << round(ANS) << endl;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 10,\n \"memory_kb\": 4288,\n \"score_of_the_acc\": -0.031,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2786_9711336\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nconst long long INF = 15LL << 59;\\n\\nclass point {\\npublic:\\n\\tlong long x, y;\\n\\tpoint() : x(0), y(0) {}\\n\\tpoint(long long x_, long long y_) : x(x_), y(y_) {}\\n\\tpoint& operator+=(const point& p) { x += p.x; y += p.y; return *this; }\\n\\tpoint& operator-=(const point& p) { x -= p.x; y -= p.y; return *this; }\\n\\tpoint operator+(const point& p) const { return point(*this) += p; }\\n\\tpoint operator-(const point& p) const { return point(*this) -= p; }\\n\\tlong long cross(const point& p) const { return x * p.y - y * p.x; }\\n};\\n\\nvector<long long> subcalc(int N, const vector<point>& P) {\\n\\tvector<long long> ans = { 0 };\\n\\tlong long area = 0;\\n\\tvector<int> s1, s2;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (s1.empty() || P[s1[s1.size() - 1]].y >= P[i].y) {\\n\\t\\t\\twhile (s1.size() >= 2) {\\n\\t\\t\\t\\tint v1 = s1[s1.size() - 1];\\n\\t\\t\\t\\tint v2 = s1[s1.size() - 2];\\n\\t\\t\\t\\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\\n\\t\\t\\t\\t\\tarea -= P[v2].cross(P[v1]);\\n\\t\\t\\t\\t\\ts1.pop_back();\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (s1.size() >= 1) {\\n\\t\\t\\t\\tarea += P[s1[s1.size() - 1]].cross(P[i]);\\n\\t\\t\\t}\\n\\t\\t\\ts1.push_back(i);\\n\\t\\t}\\n\\t\\twhile (s2.size() >= 1 && P[s2[s2.size() - 1]].y >= P[i].y) {\\n\\t\\t\\tif (s2.size() >= 2) {\\n\\t\\t\\t\\tarea -= P[s2[s2.size() - 2]].cross(P[s2[s2.size() - 1]]);\\n\\t\\t\\t}\\n\\t\\t\\ts2.pop_back();\\n\\t\\t}\\n\\t\\twhile (s2.size() >= 2) {\\n\\t\\t\\tint v1 = s2[s2.size() - 1];\\n\\t\\t\\tint v2 = s2[s2.size() - 2];\\n\\t\\t\\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\\n\\t\\t\\t\\tarea -= P[v2].cross(P[v1]);\\n\\t\\t\\t\\ts2.pop_back();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (s2.size() >= 1) {\\n\\t\\t\\tarea += P[s2[s2.size() - 1]].cross(P[i]);\\n\\t\\t}\\n\\t\\ts2.push_back(i);\\n\\t\\tif (i == N - 1 || P[i].x != P[i + 1].x) {\\n\\t\\t\\tans.push_back(area);\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nvector<long long> calc(int N, vector<point> P) {\\n\\tvector<long long> res1 = subcalc(N, P);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tP[i].y *= -1;\\n\\t}\\n\\tvector<long long> res2 = subcalc(N, P);\\n\\tvector<long long> res3(res1.size());\\n\\tfor (int i = 0; i < int(res1.size()); i++) {\\n\\t\\tres3[i] = res1[i] + res2[i];\\n\\t}\\n\\treturn res3;\\n}\\n\\nlong long solve(int N, vector<point> P) {\\n\\tsort(P.begin(), P.end(), [&](const point& p1, const point& p2) {\\n\\t\\treturn p1.x != p2.x ? p1.x < p2.x : p1.y < p2.y;\\n\\t});\\n\\tvector<long long> res1 = calc(N, P);\\n\\treverse(P.begin(), P.end());\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tP[i].x *= -1;\\n\\t\\tP[i].y *= -1;\\n\\t}\\n\\tvector<long long> res2 = calc(N, P);\\n\\treverse(res2.begin(), res2.end());\\n\\tlong long ans = INF;\\n\\tfor (int i = 0; i < int(res1.size()); i++) {\\n\\t\\tans = min(ans, res1[i] + res2[i]);\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<point> P(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> P[i].x >> P[i].y;\\n\\t}\\n\\tlong long ans = solve(N, P);\\n\\tcout << (ans + 1) / 2 << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 11160,\n \"score_of_the_acc\": -1.0282,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2786_9711332\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nconst long long INF = 7LL << 59;\\n\\nclass point {\\npublic:\\n\\tlong long x, y;\\n\\tpoint() : x(0), y(0) {}\\n\\tpoint(long long x_, long long y_) : x(x_), y(y_) {}\\n\\tpoint& operator+=(const point& p) { x += p.x; y += p.y; return *this; }\\n\\tpoint& operator-=(const point& p) { x -= p.x; y -= p.y; return *this; }\\n\\tpoint operator+(const point& p) const { return point(*this) += p; }\\n\\tpoint operator-(const point& p) const { return point(*this) -= p; }\\n\\tlong long cross(const point& p) const { return x * p.y - y * p.x; }\\n};\\n\\nvector<long long> subcalc(int N, const vector<point>& P) {\\n\\tvector<long long> ans = { 0 };\\n\\tlong long area = 0;\\n\\tvector<int> s1, s2;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (s1.empty() || P[s1[s1.size() - 1]].y >= P[i].y) {\\n\\t\\t\\twhile (s1.size() >= 2) {\\n\\t\\t\\t\\tint v1 = s1[s1.size() - 1];\\n\\t\\t\\t\\tint v2 = s1[s1.size() - 2];\\n\\t\\t\\t\\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\\n\\t\\t\\t\\t\\tarea -= P[v2].cross(P[v1]);\\n\\t\\t\\t\\t\\ts1.pop_back();\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (s1.size() >= 1) {\\n\\t\\t\\t\\tarea += P[s1[s1.size() - 1]].cross(P[i]);\\n\\t\\t\\t}\\n\\t\\t\\ts1.push_back(i);\\n\\t\\t}\\n\\t\\twhile (s2.size() >= 1 && P[s2[s2.size() - 1]].y >= P[i].y) {\\n\\t\\t\\tif (s2.size() >= 2) {\\n\\t\\t\\t\\tarea -= P[s2[s2.size() - 2]].cross(P[s2[s2.size() - 1]]);\\n\\t\\t\\t}\\n\\t\\t\\ts2.pop_back();\\n\\t\\t}\\n\\t\\twhile (s2.size() >= 2) {\\n\\t\\t\\tint v1 = s2[s2.size() - 1];\\n\\t\\t\\tint v2 = s2[s2.size() - 2];\\n\\t\\t\\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\\n\\t\\t\\t\\tarea -= P[v2].cross(P[v1]);\\n\\t\\t\\t\\ts2.pop_back();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (s2.size() >= 1) {\\n\\t\\t\\tarea += P[s2[s2.size() - 1]].cross(P[i]);\\n\\t\\t}\\n\\t\\ts2.push_back(i);\\n\\t\\tif (i == N - 1 || P[i].x != P[i + 1].x) {\\n\\t\\t\\tans.push_back(area);\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nvector<long long> calc(int N, vector<point> P) {\\n\\tvector<long long> res1 = subcalc(N, P);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tP[i].y *= -1;\\n\\t}\\n\\tvector<long long> res2 = subcalc(N, P);\\n\\tvector<long long> res3(res1.size());\\n\\tfor (int i = 0; i < int(res1.size()); i++) {\\n\\t\\tres3[i] = res1[i] + res2[i];\\n\\t}\\n\\treturn res3;\\n}\\n\\nlong long solve(int N, vector<point> P) {\\n\\tsort(P.begin(), P.end(), [&](const point& p1, const point& p2) {\\n\\t\\treturn p1.x != p2.x ? p1.x < p2.x : p1.y < p2.y;\\n\\t});\\n\\tvector<long long> res1 = calc(N, P);\\n\\treverse(P.begin(), P.end());\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tP[i].x *= -1;\\n\\t\\tP[i].y *= -1;\\n\\t}\\n\\tvector<long long> res2 = calc(N, P);\\n\\treverse(res2.begin(), res2.end());\\n\\tlong long ans = INF;\\n\\tfor (int i = 0; i < int(res1.size()); i++) {\\n\\t\\tans = min(ans, res1[i] + res2[i]);\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<point> P(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> P[i].x >> P[i].y;\\n\\t}\\n\\tlong long ans = solve(N, P);\\n\\tcout << (ans + 1) / 2 << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 10,\n \"memory_kb\": 4504,\n \"score_of_the_acc\": -0.0444,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2786_9711303\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nconst long long INF = 3LL << 59;\\n\\nclass point {\\npublic:\\n\\tlong long x, y;\\n\\tpoint() : x(0), y(0) {}\\n\\tpoint(long long x_, long long y_) : x(x_), y(y_) {}\\n\\tpoint& operator+=(const point& p) { x += p.x; y += p.y; return *this; }\\n\\tpoint& operator-=(const point& p) { x -= p.x; y -= p.y; return *this; }\\n\\tpoint operator+(const point& p) const { return point(*this) += p; }\\n\\tpoint operator-(const point& p) const { return point(*this) -= p; }\\n\\tlong long cross(const point& p) const { return x * p.y - y * p.x; }\\n};\\n\\n#include <string>\\n\\nstring to_string(const vector<int>& arr) {\\n\\tstring res = \\\"[\\\";\\n\\tfor (int i = 0; i < arr.size(); i++) {\\n\\t\\tif (i != 0) {\\n\\t\\t\\tres += \\\", \\\";\\n\\t\\t}\\n\\t\\tres += to_string(arr[i]);\\n\\t}\\n\\tres += \\\"]\\\";\\n\\treturn res;\\n}\\n\\nvector<long long> subcalc(int N, const vector<point>& P) {\\n\\tvector<long long> ans = { 0 };\\n\\tlong long area = 0;\\n\\tvector<int> s1, s2;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (s1.empty() || P[s1[s1.size() - 1]].y >= P[i].y) {\\n\\t\\t\\twhile (s1.size() >= 2) {\\n\\t\\t\\t\\tint v1 = s1[s1.size() - 1];\\n\\t\\t\\t\\tint v2 = s1[s1.size() - 2];\\n\\t\\t\\t\\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\\n\\t\\t\\t\\t\\tarea -= P[v2].cross(P[v1]);\\n\\t\\t\\t\\t\\ts1.pop_back();\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (s1.size() >= 1) {\\n\\t\\t\\t\\tarea += P[s1[s1.size() - 1]].cross(P[i]);\\n\\t\\t\\t}\\n\\t\\t\\ts1.push_back(i);\\n\\t\\t}\\n\\t\\twhile (s2.size() >= 1 && P[s2[s2.size() - 1]].y >= P[i].y) {\\n\\t\\t\\tif (s2.size() >= 2) {\\n\\t\\t\\t\\tarea -= P[s2[s2.size() - 2]].cross(P[s2[s2.size() - 1]]);\\n\\t\\t\\t}\\n\\t\\t\\ts2.pop_back();\\n\\t\\t}\\n\\t\\twhile (s2.size() >= 2) {\\n\\t\\t\\tint v1 = s2[s2.size() - 1];\\n\\t\\t\\tint v2 = s2[s2.size() - 2];\\n\\t\\t\\tif ((P[v1] - P[i]).cross(P[v2] - P[i]) >= 0) {\\n\\t\\t\\t\\tarea -= P[v2].cross(P[v1]);\\n\\t\\t\\t\\ts2.pop_back();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (s2.size() >= 1) {\\n\\t\\t\\tarea += P[s2[s2.size() - 1]].cross(P[i]);\\n\\t\\t}\\n\\t\\ts2.push_back(i);\\n\\t\\tif (i == N - 1 || P[i].x != P[i + 1].x) {\\n\\t\\t\\tans.push_back(area);\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nvector<long long> calc(int N, vector<point> P) {\\n\\tvector<long long> res1 = subcalc(N, P);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tP[i].y *= -1;\\n\\t}\\n\\tvector<long long> res2 = subcalc(N, P);\\n\\tvector<long long> res3(res1.size());\\n\\tfor (int i = 0; i < int(res1.size()); i++) {\\n\\t\\tres3[i] = res1[i] + res2[i];\\n\\t}\\n\\treturn res3;\\n}\\n\\nlong long solve(int N, vector<point> P) {\\n\\tsort(P.begin(), P.end(), [&](const point& p1, const point& p2) {\\n\\t\\treturn p1.x != p2.x ? p1.x < p2.x : p1.y < p2.y;\\n\\t});\\n\\tvector<long long> res1 = calc(N, P);\\n\\treverse(P.begin(), P.end());\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tP[i].x *= -1;\\n\\t\\tP[i].y *= -1;\\n\\t}\\n\\tvector<long long> res2 = calc(N, P);\\n\\treverse(res2.begin(), res2.end());\\n\\tlong long ans = INF;\\n\\tfor (int i = 0; i < int(res1.size()); i++) {\\n\\t\\tans = min(ans, res1[i] + res2[i]);\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<point> P(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> P[i].x >> P[i].y;\\n\\t}\\n\\tlong long ans = solve(N, P);\\n\\tcout << (ans + 1) / 2 << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 10,\n \"memory_kb\": 4504,\n \"score_of_the_acc\": -0.0444,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2786_9669250\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define sz(A) ((ll)A.size())\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nstruct segtree{\\n vi tree;\\n int n;\\n ll op(ll a,ll b){return max(a,b);}\\n ll e(){return -1e18;}\\n segtree(int _N){\\n n=1;\\n while(n<_N)n<<=1;\\n tree.assign(2*n,e());\\n }\\n void set(int i,ll x){\\n i+=n;\\n tree[i]=x;\\n while(i>1){\\n i>>=1;\\n tree[i]=op(tree[2*i],tree[2*i+1]);\\n }\\n }\\n ll prod(int l,int r){\\n l+=n;r+=n;\\n ll L=e(),R=e();\\n while(l<r){\\n if(l%2)L=op(L,tree[l++]);\\n if(r%2)R=op(tree[--r],R);\\n l>>=1;r>>=1;\\n }\\n return op(L,R);\\n }\\n};\\nint main(){\\n ll N;cin>>N;\\n vector<pi>A(N);\\n REP(i,N)cin>>A[i].first>>A[i].second;\\n vi X;\\n REP(i,N)X.emplace_back(A[i].first);\\n sort(ALL(X));\\n X.erase(unique(ALL(X)),X.end());\\n vi D(sz(X),1e18),U(sz(X),-1e18);\\n REP(i,N){\\n int x=LB(X,A[i].first);\\n D[x]=min(D[x],A[i].second);\\n U[x]=max(U[x],A[i].second);\\n }\\n N=X.size();\\n\\n vi ans1(N+1),ans2(N+1);\\n auto f=[](pi a,pi b){\\n return a.first*b.second-a.second*b.first;\\n };\\n {\\n stack<pi>upper,lower;\\n __int128 area=0;\\n upper.emplace(pi(X[0],U[0]));\\n lower.emplace(pi(X[0],D[0]));\\n FOR(i,1,N){\\n area-=f(lower.top(),upper.top());\\n while(sz(upper)>1){\\n auto p=upper.top();upper.pop();\\n auto q=upper.top();\\n area-=f(p,q);\\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\\n upper.emplace(p);\\n area+=f(p,q);\\n break;\\n }\\n area+=f(pi(X[i],U[i]),upper.top());\\n upper.emplace(pi(X[i],U[i]));\\n while(sz(lower)>1){\\n auto p=lower.top();lower.pop();\\n auto q=lower.top();\\n area-=f(q,p);\\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\\n area+=f(q,p);\\n lower.emplace(p);\\n break;\\n }\\n area+=f(lower.top(),pi(X[i],D[i]));\\n lower.emplace(pi(X[i],D[i]));\\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\\n ans1[i+1]=area;\\n assert(area>=0);\\n }\\n }\\n {\\n REP(i,N)X[i]=-X[i];\\n reverse(ALL(X));\\n reverse(ALL(D));\\n reverse(ALL(U));\\n stack<pi>upper,lower;\\n __int128 area=0;\\n upper.emplace(pi(X[0],U[0]));\\n lower.emplace(pi(X[0],D[0]));\\n FOR(i,1,N){\\n area-=f(lower.top(),upper.top());\\n while(sz(upper)>1){\\n auto p=upper.top();upper.pop();\\n auto q=upper.top();\\n area-=f(p,q);\\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\\n upper.emplace(p);\\n area+=f(p,q);\\n break;\\n }\\n area+=f(pi(X[i],U[i]),upper.top());\\n upper.emplace(pi(X[i],U[i]));\\n while(sz(lower)>1){\\n auto p=lower.top();lower.pop();\\n auto q=lower.top();\\n area-=f(q,p);\\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\\n lower.emplace(p);\\n area+=f(q,p);\\n break;\\n }\\n area+=f(lower.top(),pi(X[i],D[i]));\\n lower.emplace(pi(X[i],D[i]));\\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\\n assert(area>=0);\\n ans2[i+1]=area;\\n }\\n }\\n ll ans=9e18;\\n REP(i,N+1)ans=min(ans,ans1[i]+ans2[N-i]);\\n cout<<(ans+1)/2<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 10056,\n \"score_of_the_acc\": -1.1026,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2786_9669192\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define sz(A) ((ll)A.size())\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nstruct segtree{\\n vi tree;\\n int n;\\n ll op(ll a,ll b){return max(a,b);}\\n ll e(){return -1e18;}\\n segtree(int _N){\\n n=1;\\n while(n<_N)n<<=1;\\n tree.assign(2*n,e());\\n }\\n void set(int i,ll x){\\n i+=n;\\n tree[i]=x;\\n while(i>1){\\n i>>=1;\\n tree[i]=op(tree[2*i],tree[2*i+1]);\\n }\\n }\\n ll prod(int l,int r){\\n l+=n;r+=n;\\n ll L=e(),R=e();\\n while(l<r){\\n if(l%2)L=op(L,tree[l++]);\\n if(r%2)R=op(tree[--r],R);\\n l>>=1;r>>=1;\\n }\\n return op(L,R);\\n }\\n};\\nint main(){\\n ll N;cin>>N;\\n vector<pi>A(N);\\n REP(i,N)cin>>A[i].first>>A[i].second;\\n vi X;\\n REP(i,N)X.emplace_back(A[i].first);\\n sort(ALL(X));\\n X.erase(unique(ALL(X)),X.end());\\n vi D(sz(X),1e18),U(sz(X),-1e18);\\n REP(i,N){\\n int x=LB(X,A[i].first);\\n D[x]=min(D[x],A[i].second);\\n U[x]=max(U[x],A[i].second);\\n }\\n N=X.size();\\n\\n vi ans1(N+1),ans2(N+1);\\n auto f=[](pi a,pi b){\\n return a.first*b.second-a.second*b.first;\\n };\\n {\\n stack<pi>upper,lower;\\n __int128 area=0;\\n upper.emplace(pi(X[0],U[0]));\\n lower.emplace(pi(X[0],D[0]));\\n FOR(i,1,N){\\n area-=f(lower.top(),upper.top());\\n while(sz(upper)>1){\\n auto p=upper.top();upper.pop();\\n auto q=upper.top();\\n area-=f(p,q);\\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\\n upper.emplace(p);\\n area+=f(p,q);\\n break;\\n }\\n area+=f(pi(X[i],U[i]),upper.top());\\n upper.emplace(pi(X[i],U[i]));\\n while(sz(lower)>1){\\n auto p=lower.top();lower.pop();\\n auto q=lower.top();\\n area-=f(q,p);\\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\\n area+=f(q,p);\\n lower.emplace(p);\\n break;\\n }\\n area+=f(lower.top(),pi(X[i],D[i]));\\n lower.emplace(pi(X[i],D[i]));\\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\\n ans1[i+1]=area;\\n }\\n }\\n {\\n REP(i,N)X[i]=-X[i];\\n reverse(ALL(X));\\n reverse(ALL(D));\\n reverse(ALL(U));\\n stack<pi>upper,lower;\\n __int128 area=0;\\n upper.emplace(pi(X[0],U[0]));\\n lower.emplace(pi(X[0],D[0]));\\n FOR(i,1,N){\\n area-=f(lower.top(),upper.top());\\n while(sz(upper)>1){\\n auto p=upper.top();upper.pop();\\n auto q=upper.top();\\n area-=f(p,q);\\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\\n upper.emplace(p);\\n area+=f(p,q);\\n break;\\n }\\n area+=f(pi(X[i],U[i]),upper.top());\\n upper.emplace(pi(X[i],U[i]));\\n while(sz(lower)>1){\\n auto p=lower.top();lower.pop();\\n auto q=lower.top();\\n area-=f(q,p);\\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\\n lower.emplace(p);\\n area+=f(q,p);\\n break;\\n }\\n area+=f(lower.top(),pi(X[i],D[i]));\\n lower.emplace(pi(X[i],D[i]));\\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\\n ans2[i+1]=area;\\n }\\n }\\n ll ans=5e18;\\n REP(i,N+1)ans=min(ans,ans1[i]+ans2[N-i]);\\n cout<<(ans+1)/2<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 10,\n \"memory_kb\": 3788,\n \"score_of_the_acc\": 0,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2786_9669178\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define sz(A) ((ll)A.size())\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nstruct segtree{\\n vi tree;\\n int n;\\n ll op(ll a,ll b){return max(a,b);}\\n ll e(){return -1e18;}\\n segtree(int _N){\\n n=1;\\n while(n<_N)n<<=1;\\n tree.assign(2*n,e());\\n }\\n void set(int i,ll x){\\n i+=n;\\n tree[i]=x;\\n while(i>1){\\n i>>=1;\\n tree[i]=op(tree[2*i],tree[2*i+1]);\\n }\\n }\\n ll prod(int l,int r){\\n l+=n;r+=n;\\n ll L=e(),R=e();\\n while(l<r){\\n if(l%2)L=op(L,tree[l++]);\\n if(r%2)R=op(tree[--r],R);\\n l>>=1;r>>=1;\\n }\\n return op(L,R);\\n }\\n};\\nint main(){\\n ll N;cin>>N;\\n vector<pi>A(N);\\n REP(i,N)cin>>A[i].first>>A[i].second;\\n vi X;\\n REP(i,N)X.emplace_back(A[i].first);\\n sort(ALL(X));\\n X.erase(unique(ALL(X)),X.end());\\n vi D(sz(X),1e18),U(sz(X),-1e18);\\n REP(i,N){\\n int x=LB(X,A[i].first);\\n D[x]=min(D[x],A[i].second);\\n U[x]=max(U[x],A[i].second);\\n }\\n N=X.size();\\n\\n vi ans1(N+1),ans2(N+1);\\n auto f=[](pi a,pi b){\\n return a.first*b.second-a.second*b.first;\\n };\\n {\\n stack<pi>upper,lower;\\n ll area=0;\\n upper.emplace(pi(X[0],U[0]));\\n lower.emplace(pi(X[0],D[0]));\\n FOR(i,1,N){\\n area-=f(lower.top(),upper.top());\\n while(sz(upper)>1){\\n auto p=upper.top();upper.pop();\\n auto q=upper.top();\\n area-=f(p,q);\\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\\n upper.emplace(p);\\n area+=f(p,q);\\n break;\\n }\\n area+=f(pi(X[i],U[i]),upper.top());\\n upper.emplace(pi(X[i],U[i]));\\n while(sz(lower)>1){\\n auto p=lower.top();lower.pop();\\n auto q=lower.top();\\n area-=f(q,p);\\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\\n area+=f(q,p);\\n lower.emplace(p);\\n break;\\n }\\n area+=f(lower.top(),pi(X[i],D[i]));\\n lower.emplace(pi(X[i],D[i]));\\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\\n ans1[i+1]=area;\\n }\\n }\\n {\\n REP(i,N)X[i]=-X[i];\\n reverse(ALL(X));\\n reverse(ALL(D));\\n reverse(ALL(U));\\n stack<pi>upper,lower;\\n ll area=0;\\n upper.emplace(pi(X[0],U[0]));\\n lower.emplace(pi(X[0],D[0]));\\n FOR(i,1,N){\\n area-=f(lower.top(),upper.top());\\n while(sz(upper)>1){\\n auto p=upper.top();upper.pop();\\n auto q=upper.top();\\n area-=f(p,q);\\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\\n upper.emplace(p);\\n area+=f(p,q);\\n break;\\n }\\n area+=f(pi(X[i],U[i]),upper.top());\\n upper.emplace(pi(X[i],U[i]));\\n while(sz(lower)>1){\\n auto p=lower.top();lower.pop();\\n auto q=lower.top();\\n area-=f(q,p);\\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\\n lower.emplace(p);\\n area+=f(q,p);\\n break;\\n }\\n area+=f(lower.top(),pi(X[i],D[i]));\\n lower.emplace(pi(X[i],D[i]));\\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\\n ans2[i+1]+=area;\\n }\\n }\\n ll ans=5e18;\\n REP(i,N+1)ans=min(ans,ans1[i]+ans2[N-i]);\\n cout<<(ans+1)/2<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 10,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.0087,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2786_9669174\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define sz(A) ((ll)A.size())\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nstruct segtree{\\n vi tree;\\n int n;\\n ll op(ll a,ll b){return max(a,b);}\\n ll e(){return -1e18;}\\n segtree(int _N){\\n n=1;\\n while(n<_N)n<<=1;\\n tree.assign(2*n,e());\\n }\\n void set(int i,ll x){\\n i+=n;\\n tree[i]=x;\\n while(i>1){\\n i>>=1;\\n tree[i]=op(tree[2*i],tree[2*i+1]);\\n }\\n }\\n ll prod(int l,int r){\\n l+=n;r+=n;\\n ll L=e(),R=e();\\n while(l<r){\\n if(l%2)L=op(L,tree[l++]);\\n if(r%2)R=op(tree[--r],R);\\n l>>=1;r>>=1;\\n }\\n return op(L,R);\\n }\\n};\\nint main(){\\n ll N;cin>>N;\\n vector<pi>A(N);\\n REP(i,N)cin>>A[i].first>>A[i].second;\\n vi X;\\n REP(i,N)X.emplace_back(A[i].first);\\n sort(ALL(X));\\n X.erase(unique(ALL(X)),X.end());\\n vi D(sz(X),1e18),U(sz(X),-1e18);\\n REP(i,N){\\n int x=LB(X,A[i].first);\\n D[x]=min(D[x],A[i].second);\\n U[x]=max(U[x],A[i].second);\\n }\\n N=X.size();\\n\\n vi ans1(N+1),ans2(N+1);\\n auto f=[](pi a,pi b){\\n return a.first*b.second-a.second*b.first;\\n };\\n {\\n stack<pi>upper,lower;\\n ll area=0;\\n upper.emplace(pi(X[0],U[0]));\\n lower.emplace(pi(X[0],D[0]));\\n FOR(i,1,N){\\n area-=f(lower.top(),upper.top());\\n while(sz(upper)>1){\\n auto p=upper.top();upper.pop();\\n auto q=upper.top();\\n area-=f(p,q);\\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\\n upper.emplace(p);\\n area+=f(p,q);\\n break;\\n }\\n area+=f(pi(X[i],U[i]),upper.top());\\n upper.emplace(pi(X[i],U[i]));\\n while(sz(lower)>1){\\n auto p=lower.top();lower.pop();\\n auto q=lower.top();\\n area-=f(q,p);\\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\\n area+=f(q,p);\\n lower.emplace(p);\\n break;\\n }\\n area+=f(lower.top(),pi(X[i],D[i]));\\n lower.emplace(pi(X[i],D[i]));\\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\\n ans1[i+1]=area;\\n }\\n }\\n {\\n REP(i,N)X[i]=-X[i];\\n reverse(ALL(X));\\n reverse(ALL(D));\\n reverse(ALL(U));\\n stack<pi>upper,lower;\\n ll area=0;\\n upper.emplace(pi(X[0],U[0]));\\n lower.emplace(pi(X[0],D[0]));\\n FOR(i,1,N){\\n area-=f(lower.top(),upper.top());\\n while(sz(upper)>1){\\n auto p=upper.top();upper.pop();\\n auto q=upper.top();\\n area-=f(p,q);\\n if(f(pi(p.first-q.first,p.second-q.second),pi(X[i]-q.first,U[i]-q.second))>=0)continue;\\n upper.emplace(p);\\n area+=f(p,q);\\n break;\\n }\\n area+=f(pi(X[i],U[i]),upper.top());\\n upper.emplace(pi(X[i],U[i]));\\n while(sz(lower)>1){\\n auto p=lower.top();lower.pop();\\n auto q=lower.top();\\n area-=f(q,p);\\n if(f(pi(X[i]-q.first,D[i]-q.second),pi(p.first-q.first,p.second-q.second))>=0)continue;\\n lower.emplace(p);\\n area+=f(q,p);\\n break;\\n }\\n area+=f(lower.top(),pi(X[i],D[i]));\\n lower.emplace(pi(X[i],D[i]));\\n area+=f(pi(X[i],D[i]),pi(X[i],U[i]));\\n ans2[i+1]+=area;\\n }\\n }\\n //REP(i,N+1)cout<<ans1[i]<<\\\" \\\";cout<<endl;\\n //REP(i,N+1)cout<<ans2[i]<<\\\" \\\";cout<<endl;\\n ll ans=1e18;\\n REP(i,N+1)ans=min(ans,ans1[i]+ans2[N-i]);\\n cout<<(ans+1)/2<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 10,\n \"memory_kb\": 3912,\n \"score_of_the_acc\": -0.0077,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2786_7181025\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\nusing ll = long long;\\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;}\\nconst int INF = (1<<30)-1;\\n#define all(p) p.begin(),p.end()\\nconst int mod=998244353;\\n\\nint main(){\\n\\tint N;\\n\\tcin>>N;\\n\\tset<ll> s;\\n\\tvector<pair<ll,ll>> p(N);\\n\\trep(i,0,N){\\n\\t\\tcin>>p[i].first>>p[i].second;\\n\\t\\ts.insert(p[i].first);\\n\\t}\\n\\tsort(all(p));\\n\\tmap<int,int> m;\\n\\tvector<ll> order={167};\\n\\tint len=1;\\n\\tfor(auto x:s) m[x]=len,len++,order.push_back(x);\\n\\torder.push_back(167);\\n\\tvector<ll> U(len+1,-INF),D(len+1,-INF);\\n\\trep(i,0,N){\\n\\t\\tint a=m[p[i].first];\\n\\t\\tchmax(U[a],p[i].second);\\n\\t\\tchmax(D[a],-p[i].second);\\n\\t}\\n\\tauto f=[&]()->vector<ll>{\\n\\t\\tvector<ll> ans(len+1);\\n\\t\\tvector<int> p(len+1);\\n\\t\\tint k=0;\\n\\t\\trep(i,1,len){\\n\\t\\t\\tans[i]=ans[i-1];\\n\\t\\t\\tif(k==0){\\n\\t\\t\\t\\tp[k]=i;\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t}else if(k==1){\\n\\t\\t\\t\\tp[k]=i;\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t\\tans[i]+=abs(order[i]-order[i-1])*(U[i]+U[i-1]);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\twhile(2<=k){\\n\\t\\t\\t\\t\\tint a=p[k-2],b=p[k-1],c=i;\\n\\t\\t\\t\\t\\t//U[b]<=(U[a]*dist(b,c)+U[c]*dist(a,b))/dist(a,c);\\n\\t\\t\\t\\t\\tif(U[b]*abs(order[a]-order[c])<=U[a]*abs(order[b]-order[c])+U[c]*abs(order[b]-order[a])){\\n\\t\\t\\t\\t\\t\\tans[i]-=abs(order[b]-order[a])*(U[a]+U[b]);\\n\\t\\t\\t\\t\\t\\tk--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tp[k]=i;\\n\\t\\t\\t\\tans[i]+=abs(order[i]-order[p[k-1]])*(U[i]+U[p[k-1]]);\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t};\\n\\tvector<vector<ll>> area(4);\\n\\trep(i,0,2){\\n\\t\\trep(j,0,2){\\n\\t\\t\\tarea[i*2+j]=f();\\n\\t\\t\\tswap(U,D);\\n\\t\\t}\\n\\t\\treverse(all(order));\\n\\t\\treverse(all(U));\\n\\t\\treverse(all(D));\\n\\t}\\n\\tll ans=area[0][len-1]+area[1][len-1];\\n\\trep(i,1,len-1){\\n\\t\\tchmin(ans,area[0][i]+area[1][i]+area[2][len-1-i]+area[3][len-1-i]);\\n\\t}\\n\\tcout<<(1+ans)/2<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 19928,\n \"score_of_the_acc\": -2,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2786_7180959\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\nusing ll = long long;\\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;}\\nconst int INF = (1<<30)-1;\\n#define all(p) p.begin(),p.end()\\nconst int mod=998244353;\\n\\nint main(){\\n\\tint N;\\n\\tcin>>N;\\n\\tset<ll> s;\\n\\tvector<pair<ll,ll>> p(N);\\n\\trep(i,0,N){\\n\\t\\tcin>>p[i].first>>p[i].second;\\n\\t\\ts.insert(p[i].first);\\n\\t}\\n\\tsort(all(p));\\n\\tmap<int,int> m;\\n\\tvector<ll> order={167};\\n\\tint len=1;\\n\\tfor(auto x:s) m[x]=len,len++,order.push_back(x);\\n\\torder.push_back(167);\\n\\tvector<ll> U(len+1,-INF),D(len+1,-INF);\\n\\trep(i,0,N){\\n\\t\\tint a=m[p[i].first];\\n\\t\\tchmax(U[a],p[i].second);\\n\\t\\tchmax(D[a],-p[i].second);\\n\\t}\\n\\tauto f=[&]()->vector<ll>{\\n\\t\\tvector<ll> ans(len+1);\\n\\t\\tvector<int> p(len+1);\\n\\t\\tint k=0;\\n\\t\\trep(i,1,len){\\n\\t\\t\\tans[i]=ans[i-1];\\n\\t\\t\\tif(k==0){\\n\\t\\t\\t\\tp[k]=i;\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t}else if(k==1){\\n\\t\\t\\t\\tp[k]=i;\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t\\tans[i]+=abs(order[i]-order[i-1])*(U[i]+U[i-1]);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\twhile(2<=k){\\n\\t\\t\\t\\t\\tint a=p[k-2],b=p[k-1],c=i;\\n\\t\\t\\t\\t\\t//U[b]<=(U[a]*dist(b,c)+U[c]*dist(a,b))/dist(a,c);\\n\\t\\t\\t\\t\\tif(U[b]*abs(order[a]-order[c])<=U[a]*abs(order[b]-order[c])+U[c]*abs(order[b]-order[a])){\\n\\t\\t\\t\\t\\t\\tans[i]-=abs(order[b]-order[a])*(U[a]+U[b]);\\n\\t\\t\\t\\t\\t\\tk--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tp[k]=i;\\n\\t\\t\\t\\tans[i]+=abs(order[i]-order[p[k-1]])*(U[i]+U[p[k-1]]);\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t};\\n\\tvector<vector<ll>> area(4);\\n\\trep(i,0,2){\\n\\t\\trep(j,0,2){\\n\\t\\t\\tarea[i*2+j]=f();\\n\\t\\t\\tswap(U,D);\\n\\t\\t}\\n\\t\\treverse(all(order));\\n\\t\\treverse(all(U));\\n\\t\\treverse(all(D));\\n\\t}\\n\\tll ans=(1ll<<62);\\n\\trep(i,0,len){\\n\\t\\tchmin(ans,area[0][i]+area[1][i]+area[2][len-1-i]+area[3][len-1-i]);\\n\\t}\\n\\tcout<<(1+ans)/2<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 10,\n \"memory_kb\": 5856,\n \"score_of_the_acc\": -0.1281,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2786_6790609\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\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];\\n if (i < (int) v.size() - 1) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nusing T = ll;\\nusing Vec = std::complex<T>;\\n\\nconst T PI = std::acos(-1);\\n\\nconstexpr T eps = 1e-10;\\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\\ninline bool lt(T a, T b) { return a < b - eps; }\\ninline bool leq(T a, T b) { return a <= b + eps; }\\n\\nstd::istream& operator>>(std::istream& is, Vec& p) {\\n T x, y;\\n is >> x >> y;\\n p = {x, y};\\n return is;\\n}\\n\\nstruct Line {\\n Vec p1, p2;\\n Line() = default;\\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Segment {\\n Vec p1, p2;\\n Segment() = default;\\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Circle {\\n Vec c;\\n T r;\\n Circle() = default;\\n Circle(const Vec& c, T r) : c(c), r(r) {}\\n};\\n\\nusing Polygon = std::vector<Vec>;\\n\\nT dot(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).real();\\n}\\n\\nT cross(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).imag();\\n}\\n\\nVec rot(const Vec& a, T ang) {\\n return a * Vec(std::cos(ang), std::sin(ang));\\n}\\n\\nVec perp(const Vec& a) {\\n return Vec(-a.imag(), a.real());\\n}\\n\\nVec projection(const Line& l, const Vec& p) {\\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\\n}\\n\\nVec reflection(const Line& l, const Vec& p) {\\n return T(2) * projection(l, p) - p;\\n}\\n\\n// 0: collinear\\n// 1: counter-clockwise\\n// -1: clockwise\\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\\n if (eq(cross(b - a, c - a), 0)) return 0;\\n if (lt(cross(b - a, c - a), 0)) return -1;\\n return 1;\\n}\\n\\nvoid sort_by_arg(std::vector<Vec>& pts) {\\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\\n if (cross(p, q) == 0) {\\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\\n return (p.real() > q.real());\\n }\\n return (cross(p, q) > 0);\\n });\\n}\\n\\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\\n int n = pts.size();\\n if (n == 1) return pts;\\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\\n });\\n int k = 0; // the number of vertices in the convex hull\\n std::vector<Vec> ch(2 * n);\\n // right\\n for (int i = 0; i < n; ++i) {\\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n int t = k;\\n // left\\n for (int i = n - 2; i >= 0; --i) {\\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int N;\\n cin >> N;\\n vector<Vec> pts(N);\\n for (auto& p : pts) cin >> p;\\n\\n if (N <= 2) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n auto calc = [&](vector<Vec> pts) {\\n sort(all(pts), [&](auto& p1, auto& p2) {\\n if (p1.real() == p2.real()) return p1.imag() < p2.imag();\\n return p1.real() < p2.real();\\n });\\n vector<ll> area(N+1, 4e18);\\n vector<Vec> lower, upper;\\n lower.push_back(pts[0]);\\n upper.push_back(pts[0]);\\n area[0] = area[1] = 0;\\n ll a = 0;\\n for (int i = 1; i < N; ) {\\n int j = i;\\n while (j < N && pts[i].real() == pts[j].real()) {\\n while (lower.size() >= 2 && leq(cross(lower.back()-lower[lower.size()-2], pts[j]-lower.back()), 0)) {\\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\\n lower.pop_back();\\n }\\n while (upper.size() >= 2 && leq(0, cross(upper.back()-upper[upper.size()-2], pts[j]-upper.back()))) {\\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\\n upper.pop_back();\\n }\\n a += abs(cross(upper.back()-pts[j], lower.back()-pts[j]));\\n upper.push_back(pts[j]);\\n lower.push_back(pts[j]);\\n ++j;\\n }\\n area[j] = a;\\n i = j;\\n }\\n return area;\\n };\\n\\n auto left = calc(pts);\\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\\n auto right = calc(pts);\\n ll ans = 4e18;\\n rep(i,0,N+1) {\\n chmin(ans, (left[i]+right[N-i]+1)/2);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 10316,\n \"score_of_the_acc\": -0.5473,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2786_6790458\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\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];\\n if (i < (int) v.size() - 1) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nusing T = ll;\\nusing Vec = std::complex<T>;\\n\\nconst T PI = std::acos(-1);\\n\\nconstexpr T eps = 1e-10;\\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\\ninline bool lt(T a, T b) { return a < b - eps; }\\ninline bool leq(T a, T b) { return a <= b + eps; }\\n\\nstd::istream& operator>>(std::istream& is, Vec& p) {\\n T x, y;\\n is >> x >> y;\\n p = {x, y};\\n return is;\\n}\\n\\nstruct Line {\\n Vec p1, p2;\\n Line() = default;\\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Segment {\\n Vec p1, p2;\\n Segment() = default;\\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Circle {\\n Vec c;\\n T r;\\n Circle() = default;\\n Circle(const Vec& c, T r) : c(c), r(r) {}\\n};\\n\\nusing Polygon = std::vector<Vec>;\\n\\nT dot(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).real();\\n}\\n\\nT cross(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).imag();\\n}\\n\\nVec rot(const Vec& a, T ang) {\\n return a * Vec(std::cos(ang), std::sin(ang));\\n}\\n\\nVec perp(const Vec& a) {\\n return Vec(-a.imag(), a.real());\\n}\\n\\nVec projection(const Line& l, const Vec& p) {\\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\\n}\\n\\nVec reflection(const Line& l, const Vec& p) {\\n return T(2) * projection(l, p) - p;\\n}\\n\\n// 0: collinear\\n// 1: counter-clockwise\\n// -1: clockwise\\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\\n if (eq(cross(b - a, c - a), 0)) return 0;\\n if (lt(cross(b - a, c - a), 0)) return -1;\\n return 1;\\n}\\n\\nvoid sort_by_arg(std::vector<Vec>& pts) {\\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\\n if (cross(p, q) == 0) {\\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\\n return (p.real() > q.real());\\n }\\n return (cross(p, q) > 0);\\n });\\n}\\n\\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\\n int n = pts.size();\\n if (n == 1) return pts;\\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\\n });\\n int k = 0; // the number of vertices in the convex hull\\n std::vector<Vec> ch(2 * n);\\n // right\\n for (int i = 0; i < n; ++i) {\\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n int t = k;\\n // left\\n for (int i = n - 2; i >= 0; --i) {\\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int N;\\n cin >> N;\\n vector<Vec> pts(N);\\n for (auto& p : pts) cin >> p;\\n\\n if (N <= 2) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n auto calc = [&](vector<Vec> pts) {\\n sort(all(pts), [&](auto& p1, auto& p2) {\\n if (p1.real() == p2.real()) p1.imag() < p2.imag();\\n return p1.real() < p2.real();\\n });\\n vector<ll> area(N+1, 4e18);\\n vector<Vec> lower, upper;\\n lower.push_back(pts[0]);\\n upper.push_back(pts[0]);\\n area[0] = area[1] = 0;\\n ll a = 0;\\n for (int i = 1; i < N; ) {\\n int j = i;\\n while (j < N && pts[i].real() == pts[j].real()) {\\n while (lower.size() >= 2 && leq(cross(lower.back()-lower[lower.size()-2], pts[j]-lower.back()), 0)) {\\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\\n lower.pop_back();\\n }\\n while (upper.size() >= 2 && leq(0, cross(upper.back()-upper[upper.size()-2], pts[j]-upper.back()))) {\\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\\n upper.pop_back();\\n }\\n a += abs(cross(upper.back()-pts[j], lower.back()-pts[j]));\\n upper.push_back(pts[j]);\\n lower.push_back(pts[j]);\\n ++j;\\n }\\n area[j] = a;\\n i = j;\\n }\\n return area;\\n };\\n\\n auto left = calc(pts);\\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\\n auto right = calc(pts);\\n ll ans = 4e18;\\n rep(i,0,N+1) {\\n chmin(ans, (left[i]+right[N-i]+1)/2);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.675,\n \"time_ms\": 20,\n \"memory_kb\": 7120,\n \"score_of_the_acc\": -0.3493,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2786_6790415\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\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];\\n if (i < (int) v.size() - 1) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nusing T = ll;\\nusing Vec = std::complex<T>;\\n\\nconst T PI = std::acos(-1);\\n\\nconstexpr T eps = 1e-10;\\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\\ninline bool lt(T a, T b) { return a < b - eps; }\\ninline bool leq(T a, T b) { return a <= b + eps; }\\n\\nstd::istream& operator>>(std::istream& is, Vec& p) {\\n T x, y;\\n is >> x >> y;\\n p = {x, y};\\n return is;\\n}\\n\\nstruct Line {\\n Vec p1, p2;\\n Line() = default;\\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Segment {\\n Vec p1, p2;\\n Segment() = default;\\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Circle {\\n Vec c;\\n T r;\\n Circle() = default;\\n Circle(const Vec& c, T r) : c(c), r(r) {}\\n};\\n\\nusing Polygon = std::vector<Vec>;\\n\\nT dot(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).real();\\n}\\n\\nT cross(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).imag();\\n}\\n\\nVec rot(const Vec& a, T ang) {\\n return a * Vec(std::cos(ang), std::sin(ang));\\n}\\n\\nVec perp(const Vec& a) {\\n return Vec(-a.imag(), a.real());\\n}\\n\\nVec projection(const Line& l, const Vec& p) {\\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\\n}\\n\\nVec reflection(const Line& l, const Vec& p) {\\n return T(2) * projection(l, p) - p;\\n}\\n\\n// 0: collinear\\n// 1: counter-clockwise\\n// -1: clockwise\\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\\n if (eq(cross(b - a, c - a), 0)) return 0;\\n if (lt(cross(b - a, c - a), 0)) return -1;\\n return 1;\\n}\\n\\nvoid sort_by_arg(std::vector<Vec>& pts) {\\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\\n if (cross(p, q) == 0) {\\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\\n return (p.real() > q.real());\\n }\\n return (cross(p, q) > 0);\\n });\\n}\\n\\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\\n int n = pts.size();\\n if (n == 1) return pts;\\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\\n });\\n int k = 0; // the number of vertices in the convex hull\\n std::vector<Vec> ch(2 * n);\\n // right\\n for (int i = 0; i < n; ++i) {\\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n int t = k;\\n // left\\n for (int i = n - 2; i >= 0; --i) {\\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int N;\\n cin >> N;\\n vector<Vec> pts(N);\\n for (auto& p : pts) cin >> p;\\n\\n if (N <= 2) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n auto calc = [&](vector<Vec> pts) {\\n sort(all(pts), [&](auto& p1, auto& p2) { return p1.real() < p2.real(); });\\n vector<ll> area(N+1, 4e18);\\n vector<Vec> lower, upper;\\n if (pts[0].real() < pts[1].real()) {\\n lower.push_back(pts[0]);\\n lower.push_back(pts[1]);\\n upper.push_back(pts[0]);\\n upper.push_back(pts[1]);\\n } else {\\n if (pts[0].imag() < pts[1].imag()) swap(pts[0], pts[1]);\\n lower.push_back(pts[0]);\\n lower.push_back(pts[1]);\\n upper.push_back(pts[1]);\\n upper.push_back(pts[0]);\\n }\\n area[0] = area[1] = area[2] = 0;\\n ll a = 0;\\n for (int i = 2; i < N; ) {\\n int j = i;\\n while (j < N && pts[i].real() == pts[j].real()) {\\n while (lower.size() >= 2 && leq(cross(lower.back()-lower[lower.size()-2], pts[j]-lower.back()), 0)) {\\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\\n lower.pop_back();\\n }\\n while (upper.size() >= 2 && leq(0, cross(upper.back()-upper[upper.size()-2], pts[j]-upper.back()))) {\\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\\n upper.pop_back();\\n }\\n a += abs(cross(upper.back()-pts[j], lower.back()-pts[j]));\\n upper.push_back(pts[j]);\\n lower.push_back(pts[j]);\\n ++j;\\n }\\n area[j] = a;\\n i = j;\\n }\\n return area;\\n };\\n\\n auto left = calc(pts);\\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\\n auto right = calc(pts);\\n ll ans = 4e18;\\n rep(i,0,N+1) {\\n chmin(ans, (left[i]+right[N-i]+1)/2);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.675,\n \"time_ms\": 20,\n \"memory_kb\": 7040,\n \"score_of_the_acc\": -0.3443,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2786_6790407\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\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];\\n if (i < (int) v.size() - 1) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nusing T = ll;\\nusing Vec = std::complex<T>;\\n\\nconst T PI = std::acos(-1);\\n\\nconstexpr T eps = 1e-10;\\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\\ninline bool lt(T a, T b) { return a < b - eps; }\\ninline bool leq(T a, T b) { return a <= b + eps; }\\n\\nstd::istream& operator>>(std::istream& is, Vec& p) {\\n T x, y;\\n is >> x >> y;\\n p = {x, y};\\n return is;\\n}\\n\\nstruct Line {\\n Vec p1, p2;\\n Line() = default;\\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Segment {\\n Vec p1, p2;\\n Segment() = default;\\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Circle {\\n Vec c;\\n T r;\\n Circle() = default;\\n Circle(const Vec& c, T r) : c(c), r(r) {}\\n};\\n\\nusing Polygon = std::vector<Vec>;\\n\\nT dot(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).real();\\n}\\n\\nT cross(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).imag();\\n}\\n\\nVec rot(const Vec& a, T ang) {\\n return a * Vec(std::cos(ang), std::sin(ang));\\n}\\n\\nVec perp(const Vec& a) {\\n return Vec(-a.imag(), a.real());\\n}\\n\\nVec projection(const Line& l, const Vec& p) {\\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\\n}\\n\\nVec reflection(const Line& l, const Vec& p) {\\n return T(2) * projection(l, p) - p;\\n}\\n\\n// 0: collinear\\n// 1: counter-clockwise\\n// -1: clockwise\\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\\n if (eq(cross(b - a, c - a), 0)) return 0;\\n if (lt(cross(b - a, c - a), 0)) return -1;\\n return 1;\\n}\\n\\nvoid sort_by_arg(std::vector<Vec>& pts) {\\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\\n if (cross(p, q) == 0) {\\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\\n return (p.real() > q.real());\\n }\\n return (cross(p, q) > 0);\\n });\\n}\\n\\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\\n int n = pts.size();\\n if (n == 1) return pts;\\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\\n });\\n int k = 0; // the number of vertices in the convex hull\\n std::vector<Vec> ch(2 * n);\\n // right\\n for (int i = 0; i < n; ++i) {\\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n int t = k;\\n // left\\n for (int i = n - 2; i >= 0; --i) {\\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int N;\\n cin >> N;\\n vector<Vec> pts(N);\\n for (auto& p : pts) cin >> p;\\n\\n if (N <= 2) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n auto calc = [&](vector<Vec> pts) {\\n sort(all(pts), [&](auto& p1, auto& p2) { return p1.real() < p2.real(); });\\n vector<ll> area(N+1, 4e18);\\n vector<Vec> lower, upper;\\n if (pts[0].real() < pts[1].real()) {\\n lower.push_back(pts[0]);\\n lower.push_back(pts[1]);\\n upper.push_back(pts[0]);\\n upper.push_back(pts[1]);\\n } else {\\n if (pts[0].imag() < pts[1].imag()) swap(pts[0], pts[1]);\\n lower.push_back(pts[0]);\\n lower.push_back(pts[1]);\\n upper.push_back(pts[1]);\\n upper.push_back(pts[0]);\\n }\\n area[0] = area[1] = area[2] = 0;\\n ll a = 0;\\n for (int i = 2; i < N; ) {\\n int j = i;\\n while (j < N && pts[i].real() == pts[j].real()) {\\n while (lower.size() >= 2 && lt(cross(lower.back()-lower[lower.size()-2], pts[j]-lower.back()), 0)) {\\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\\n lower.pop_back();\\n }\\n while (upper.size() >= 2 && lt(0, cross(upper.back()-upper[upper.size()-2], pts[j]-upper.back()))) {\\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\\n upper.pop_back();\\n }\\n a += abs(cross(upper.back()-pts[j], lower.back()-pts[j]));\\n upper.push_back(pts[j]);\\n lower.push_back(pts[j]);\\n ++j;\\n }\\n area[j] = a;\\n i = j;\\n }\\n return area;\\n };\\n\\n auto left = calc(pts);\\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\\n auto right = calc(pts);\\n ll ans = 4e18;\\n rep(i,0,N+1) {\\n chmin(ans, (left[i]+right[N-i]+1)/2);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.6,\n \"time_ms\": 20,\n \"memory_kb\": 7016,\n \"score_of_the_acc\": -0.3429,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2786_6790332\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\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];\\n if (i < (int) v.size() - 1) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nusing T = ll;\\nusing Vec = std::complex<T>;\\n\\nconst T PI = std::acos(-1);\\n\\nconstexpr T eps = 1e-10;\\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\\ninline bool lt(T a, T b) { return a < b - eps; }\\ninline bool leq(T a, T b) { return a <= b + eps; }\\n\\nstd::istream& operator>>(std::istream& is, Vec& p) {\\n T x, y;\\n is >> x >> y;\\n p = {x, y};\\n return is;\\n}\\n\\nstruct Line {\\n Vec p1, p2;\\n Line() = default;\\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Segment {\\n Vec p1, p2;\\n Segment() = default;\\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Circle {\\n Vec c;\\n T r;\\n Circle() = default;\\n Circle(const Vec& c, T r) : c(c), r(r) {}\\n};\\n\\nusing Polygon = std::vector<Vec>;\\n\\nT dot(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).real();\\n}\\n\\nT cross(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).imag();\\n}\\n\\nVec rot(const Vec& a, T ang) {\\n return a * Vec(std::cos(ang), std::sin(ang));\\n}\\n\\nVec perp(const Vec& a) {\\n return Vec(-a.imag(), a.real());\\n}\\n\\nVec projection(const Line& l, const Vec& p) {\\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\\n}\\n\\nVec reflection(const Line& l, const Vec& p) {\\n return T(2) * projection(l, p) - p;\\n}\\n\\n// 0: collinear\\n// 1: counter-clockwise\\n// -1: clockwise\\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\\n if (eq(cross(b - a, c - a), 0)) return 0;\\n if (lt(cross(b - a, c - a), 0)) return -1;\\n return 1;\\n}\\n\\nvoid sort_by_arg(std::vector<Vec>& pts) {\\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\\n if (cross(p, q) == 0) {\\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\\n return (p.real() > q.real());\\n }\\n return (cross(p, q) > 0);\\n });\\n}\\n\\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\\n int n = pts.size();\\n if (n == 1) return pts;\\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\\n });\\n int k = 0; // the number of vertices in the convex hull\\n std::vector<Vec> ch(2 * n);\\n // right\\n for (int i = 0; i < n; ++i) {\\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n int t = k;\\n // left\\n for (int i = n - 2; i >= 0; --i) {\\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int N;\\n cin >> N;\\n vector<Vec> pts(N);\\n for (auto& p : pts) cin >> p;\\n\\n if (N <= 2) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n sort(all(pts), [&](auto& p1, auto& p2) {\\n return p1.real() < p2.real();\\n });\\n\\n auto calc = [&](vector<Vec> pts) {\\n sort(all(pts), [&](auto& p1, auto& p2) { return p1.real() < p2.real(); });\\n vector<ll> area(N+1, 4e18);\\n vector<Vec> lower, upper;\\n if (pts[0].real() < pts[1].real()) {\\n lower.push_back(pts[0]);\\n lower.push_back(pts[1]);\\n upper.push_back(pts[0]);\\n upper.push_back(pts[1]);\\n } else {\\n if (pts[0].imag() < pts[1].imag()) swap(pts[0], pts[1]);\\n lower.push_back(pts[0]);\\n lower.push_back(pts[1]);\\n upper.push_back(pts[1]);\\n upper.push_back(pts[0]);\\n }\\n area[0] = area[1] = area[2] = 0;\\n ll a = 0;\\n for (int i = 2; i < N; ) {\\n int j = i+1;\\n while (j < N && pts[i].real() == pts[j].real()) ++j;\\n rep(k,i,j) {\\n while (lower.size() >= 2 && lt(cross(lower.back()-lower[lower.size()-2], pts[k]-lower.back()), 0)) {\\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\\n lower.pop_back();\\n }\\n while (upper.size() >= 2 && lt(0, cross(upper.back()-upper[upper.size()-2], pts[k]-upper.back()))) {\\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\\n upper.pop_back();\\n }\\n a += abs(cross(upper.back()-pts[k], lower.back()-pts[k]));\\n upper.push_back(pts[k]);\\n lower.push_back(pts[k]);\\n }\\n area[j] = a;\\n i = j;\\n }\\n return area;\\n };\\n\\n auto left = calc(pts);\\n rep(i,0,N) pts[i] = Vec(-pts[i].real(), pts[i].imag());\\n auto right = calc(pts);\\n ll ans = 4e18;\\n rep(i,0,N+1) {\\n chmin(ans, (left[i]+right[N-i]+1)/2);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.6,\n \"time_ms\": 20,\n \"memory_kb\": 7156,\n \"score_of_the_acc\": -0.3515,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2786_6790300\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\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];\\n if (i < (int) v.size() - 1) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nusing T = ll;\\nusing Vec = std::complex<T>;\\n\\nconst T PI = std::acos(-1);\\n\\nconstexpr T eps = 1e-10;\\ninline bool eq(T a, T b) { return std::abs(a - b) <= eps; }\\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) <= eps; }\\ninline bool lt(T a, T b) { return a < b - eps; }\\ninline bool leq(T a, T b) { return a <= b + eps; }\\n\\nstd::istream& operator>>(std::istream& is, Vec& p) {\\n T x, y;\\n is >> x >> y;\\n p = {x, y};\\n return is;\\n}\\n\\nstruct Line {\\n Vec p1, p2;\\n Line() = default;\\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Segment {\\n Vec p1, p2;\\n Segment() = default;\\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Circle {\\n Vec c;\\n T r;\\n Circle() = default;\\n Circle(const Vec& c, T r) : c(c), r(r) {}\\n};\\n\\nusing Polygon = std::vector<Vec>;\\n\\nT dot(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).real();\\n}\\n\\nT cross(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).imag();\\n}\\n\\nVec rot(const Vec& a, T ang) {\\n return a * Vec(std::cos(ang), std::sin(ang));\\n}\\n\\nVec perp(const Vec& a) {\\n return Vec(-a.imag(), a.real());\\n}\\n\\nVec projection(const Line& l, const Vec& p) {\\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\\n}\\n\\nVec reflection(const Line& l, const Vec& p) {\\n return T(2) * projection(l, p) - p;\\n}\\n\\n// 0: collinear\\n// 1: counter-clockwise\\n// -1: clockwise\\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\\n if (eq(cross(b - a, c - a), 0)) return 0;\\n if (lt(cross(b - a, c - a), 0)) return -1;\\n return 1;\\n}\\n\\nvoid sort_by_arg(std::vector<Vec>& pts) {\\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\\n if (cross(p, q) == 0) {\\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\\n return (p.real() > q.real());\\n }\\n return (cross(p, q) > 0);\\n });\\n}\\n\\nstd::vector<Vec> convex_hull(std::vector<Vec>& pts) {\\n int n = pts.size();\\n if (n == 1) return pts;\\n std::sort(pts.begin(), pts.end(), [](const Vec& v1, const Vec& v2) {\\n return (v1.imag() != v2.imag()) ? (v1.imag() < v2.imag()) : (v1.real() < v2.real());\\n });\\n int k = 0; // the number of vertices in the convex hull\\n std::vector<Vec> ch(2 * n);\\n // right\\n for (int i = 0; i < n; ++i) {\\n while (k > 1 && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n int t = k;\\n // left\\n for (int i = n - 2; i >= 0; --i) {\\n while (k > t && lt(cross(ch[k-1] - ch[k-2], pts[i] - ch[k-1]), 0)) --k;\\n ch[k++] = pts[i];\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int N;\\n cin >> N;\\n vector<Vec> pts(N);\\n for (auto& p : pts) cin >> p;\\n\\n if (N <= 2) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n sort(all(pts), [&](auto& p1, auto& p2) {\\n return p1.real() < p2.real();\\n });\\n\\n auto calc = [&](vector<Vec> pts) {\\n vector<ll> area(N+1, 4e18);\\n vector<Vec> lower, upper;\\n if (pts[0].real() < pts[1].real()) {\\n lower.push_back(pts[0]);\\n lower.push_back(pts[1]);\\n upper.push_back(pts[0]);\\n upper.push_back(pts[1]);\\n } else {\\n if (pts[0].imag() < pts[1].imag()) swap(pts[0], pts[1]);\\n lower.push_back(pts[0]);\\n lower.push_back(pts[1]);\\n upper.push_back(pts[1]);\\n upper.push_back(pts[0]);\\n }\\n area[0] = area[1] = area[2] = 0;\\n ll a = 0;\\n for (int i = 2; i < N; ) {\\n int j = i+1;\\n while (j < N && pts[i].real() == pts[j].real()) ++j;\\n rep(k,i,j) {\\n while (lower.size() >= 2 && lt(cross(lower.back()-lower[lower.size()-2], pts[k]-lower.back()), 0)) {\\n a -= abs(cross(lower[lower.size()-2]-lower.back(), upper.back()-lower.back()));\\n lower.pop_back();\\n }\\n while (upper.size() >= 2 && lt(0, cross(upper.back()-upper[upper.size()-2], pts[k]-upper.back()))) {\\n a -= abs(cross(upper[upper.size()-2]-upper.back(), lower.back()-upper.back()));\\n upper.pop_back();\\n }\\n a += abs(cross(upper.back()-pts[k], lower.back()-pts[k]));\\n upper.push_back(pts[k]);\\n lower.push_back(pts[k]);\\n }\\n area[j] = a;\\n i = j;\\n }\\n return area;\\n };\\n\\n auto left = calc(pts);\\n reverse(all(pts));\\n auto right = calc(pts);\\n ll ans = 4e18;\\n rep(i,0,N+1) {\\n chmin(ans, (left[i]+right[N-i]+1)/2);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.325,\n \"time_ms\": 20,\n \"memory_kb\": 7048,\n \"score_of_the_acc\": -0.3448,\n \"final_rank\": 12\n }\n]","isConversational":false}}},{"rowIdx":1674,"cells":{"group_id":{"kind":"string","value":"aoj_2785_cpp"},"problem_description":{"kind":"string","value":"Escape from the Hell\nOne day, Buddha looked into the hell and found an office worker. He did evil, such as enforcing hard work on his subordinates. However, he made only one good in his life. He refused an unreasonable request from his customer to save the lives of his subordinates. Buddha thought that, as the reward of the good, the office worker should have had a chance to escape from the hell. Buddha took a spider silk and put down to the hell.\nThe office worker climbed up with the spider silk, however the length of the way $L$ meters was too long to escape one day. He had $N$ energy drinks and drunk one of them each day. The day he drunk the i-th energy drink he could climb $A_i$ meters in the daytime and after that slided down $B_i$ meters in the night. If he could reach at the height greater than or equal to the $L$ meters in the daytime, he could escape without sliding down. After the $N$ days the silk would be cut.\nHe realized that other sinners climbed the silk in the night. They climbed $C_i$ meters in the $i$-th night without sliding down in the daytime. If they catched up with the office worker, they should have conflicted and the silk would be cut. Therefore he needed to escape before other sinners catched him. Your task is to write a program computing the best order of energy drink and output the earliest day which he could escape. If he could not escape, your program should output -1.\nInput\nThe input consists of a single test case.\n$N$ $L$\n$A_1$ $B_1$\n$A_2$ $B_2$\n...\n$A_N$ $B_N$\n$C_1$\n$C_2$\n...\n$C_N$\nThe first line contains two integers $N$ ($1 \\leq N \\leq 10^5$) and $L$ ($1 \\leq L \\leq 10^9$), which mean the number of energy drinks and the length of the spider silk respectively. The following $N$ lines show the information of the drinks: the $i$-th of them indicates the $i$-th energy drink, he climbed up $A_i$ ($1 \\leq A_i \\leq 10^9$) meters and slided down $B_i$ ($1 \\leq B_i \\leq 10^9$) meters. Next $N$ lines show how far other sinners climbed: the $i$-th of them contains an integer $C_i$ ($1 \\leq C_i \\leq 10^9$), which means they climbed up $C_i$ meters in the $i$-th day.\nOutput\nPrint the earliest day which he could escape. If he could not escape, print -1 instead.\nSample Input 1\n3 9\n6 3\n5 2\n3 1\n2\n2\n2\nOutput for the Sample Input 1\n2\nSample Input 2\n5 20\n3 2\n4 2\n6 3\n8 4\n10 5\n4\n2\n3\n4\n5\nOutput for the Sample Input 2\n-1\nSample Input 3\n5 20\n6 5\n7 3\n10 3\n10 14\n4 7\n2\n5\n3\n9\n2\nOutput for the Sample Input 3\n3\nSample Input 4\n4 12\n8 4\n6 4\n2 1\n2 1\n1\n1\n4\n4\nOutput for the Sample Input 4\n-1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2785_10946038","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define si(a) scanf(\"%d\",&a)\n#define f first\n#define s second\n#define mp(a,b) make_pair(a,b)\n#define MAX 100005\n#define INF 1LL<<50\ntypedef pair <int, int> Pii;\n\nstruct Less {\n bool operator () (Pii a, Pii b) {\n if ((a.f - a.s) == (b.f - b.s)) return a.f<b.f;\n return (a.f-a.s)>(b.f-b.s);\n }\n}LL;\n\nvector<pair<long long,long long> > all;\nint n,L,C[MAX];\nlong long cumall[MAX],cumC[MAX],ttt[MAX];\nbool allright[MAX];\n\nbool f(int x)\n{\n x--;\n if(!x){\n for(int i=0;i<n;i++)\n if(all[i].f>=L)\n return true;\n return false;\n }\n int i;\n ttt[x+1]=INF;\n for(i=x;i>0;i--)\n ttt[i]=min(ttt[i+1],cumall[i]-cumC[i-1]);\n long long mx=0;\n for(i=0;i<x;i++){\n if(i && !allright[i-1])\n continue;\n long long nowmin=ttt[i+1];\n nowmin-=(all[i].f-all[i].s);\n if(nowmin<=0)\n continue;\n mx=max(mx,cumall[x]-(all[i].f-all[i].s)+all[i].f);\n }\n if(allright[x-1]){\n for(i=x;i<n;i++)\n mx=max(mx,cumall[x-1]+all[i].f);\n }\n return mx>=L;\n}\n\nint main()\n{\n //freopen(\"input.txt\",\"r\",stdin);\n int N,i;\n long long mx=0;\n si(N);si(L);\n for(i=0;i<N;i++){\n long long a,b;\n scanf(\"%lld%lld\",&a,&b);\n if(a<b){\n mx=max(mx,a);\n continue;\n }\n all.push_back(mp(a,b));\n n++;\n }\n for(i=0;i<n;i++)si(C[i]);\n sort(all.begin(),all.end(),LL);\n cumall[0]=all[0].f-all[0].s;\n cumC[0]=C[0];\n allright[0]=(cumall[0]>cumC[0]);\n for(i=1;i<n;i++){\n cumall[i]=cumall[i-1]+(all[i].f-all[i].s);\n cumC[i]=cumC[i-1]+C[i];\n allright[i]=(cumall[i]>cumC[i]);\n }\n long long ans=INF;\n if(mx){\n if(mx>=L)ans=1;\n else{\n for(i=0;i<n;i++){\n if(!allright[i])\n break;\n if(cumall[i]+mx>=L){\n ans=i+2;\n break;\n }\n }\n }\n }\n int l=0,r=n;\n if(f(r)){\n while(r-l>1){\n int mid=(l+r)>>1;\n if(f(mid))r=mid;\n else l=mid;\n }\n ans=min(ans,(long long)r);\n }\n if(ans==INF)printf(\"-1\\n\");\n else\n printf(\"%lld\\n\",ans);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":7604,"score_of_the_acc":-0.3544,"final_rank":1},{"submission_id":"aoj_2785_10691082","code_snippet":"//\n/*\nID: kfoozmi1\nLANG: C++\nTASK:\n*/\n#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef kfoozminus\n#define dbg(args...) do {cerr << #args << \" : \"; faltu(args); } while(0)\n\nvoid faltu() {\n\tcerr << endl;\n}\n\ntemplate <typename T>\nvoid faltu(T a[], int n) {\n\tfor(int i = 0; i < n; ++i) cerr << a[i] << ' ';\n\tcerr << endl;\n}\n\ntemplate <typename First, typename ... hello>\nvoid faltu(First arg, const hello&... rest) {\n\tcerr << arg << ' ';\n\tfaltu(rest...);\n}\n#else\n#define dbg(args...)\n#endif\n\n#define PB push_back\n#define F first\n#define S second\n#define MP make_pair\n#define SQR(a) ((a) * (a))\n#define vsort(v) sort(v.begin(), v.end())\n#define memset(a, b) memset(a, b, sizeof a)\n#define PQ priority_queue\n#define PI acos(-1)\n#define EPS 1e-9\n\n#define B1 43\n#define B2 43\n\n#define MOD1 1000000007\n#define MOD2 1000000009\n#define MOD 1000000007\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\n//int dx[] = {0, 0, +1, -1};\n//int dy[] = {+1, -1, 0, 0};\n//int dx[] = {+1, 0, -1, 0, +1, +1, -1, -1};\n//int dy[] = {0, +1, 0, -1, +1, -1, +1, -1};\n\ninline bool checkBit(ll n, int i) { return n & (1LL << i); }\ninline ll setBit(ll n, int i) { return n | (1LL << i); }\ninline ll resetBit(ll n, int i) { return n & (~ (1LL << i)); }\ninline bool EQ(double a, double b) { return fabs(a-b) < EPS; }\ninline double dist(double ix, double iy, double jx, double jy) { return sqrt(SQR(ix - jx) + SQR(iy - jy)); }\n\n#define PMX 1000000\n\nint marked[PMX/64+2];\n\n#define mark(x) marked[x>>6] |= (1<<((x&63)>>1))\n#define check(x) (marked[x>>6] & (1<<((x&63)>>1)))\n\nbool isPrime(int x)\n{\n return (x>1) && ((x==2) || ((x&1) && (!(check(x)))));\n}\n\nvoid seive(int n)\n{\n int i, j;\n for(i=3; i*i<=n; i+=2)\n {\n if(!check(i))\n {\n for(j=i*i; j<=n; j+=i<<1)\n {\n mark(j);\n }\n }\n }\n}\n\nll bigMod(ll a, ll b)\n{\n\tll r = 1;\n\twhile(b) {\n\t\tif(b & 1) (r *= a) %= MOD;\n\t\tb >>= 1;\n\t\t(a *= a) %= MOD;\n\t}\n\treturn r;\n}\n\nll add(ll a, ll b)\n{\n\tll ret = a + b;\n\tif(ret >= MOD) ret -= MOD;\n\treturn ret;\n}\n\nll sub(ll a, ll b)\n{\n\tll ret = a - b;\n\tif(ret < 0) ret += MOD;\n\treturn ret;\n}\n\n#define INF 100000000\n#define MX 100007\n\nint t[4 * MX], in[MX], shoja[MX], a[MX], b[MX], c[MX];\nvector< pii > v;\n\nvoid update(int nd, int tl, int tr, int pos, int val)\n{\n\tif(tl == tr) {\n\n\t\tt[nd] = val;\n\t\treturn ;\n\t}\n\n\tint tm = (tl + tr) >> 1;\n\tint lc = nd << 1;\n\tint rc = lc | 1;\n\n\tif(pos <= tm) update(lc, tl, tm, pos, val);\n\telse update(rc, tm + 1, tr, pos, val);\n\n\tt[nd] = min(t[lc], t[rc]);\n}\n\nint query(int nd, int tl, int tr, int l, int r)\n{\n\tif(tl >= l && tr <= r) return t[nd];\n\n\tint tm = (tl + tr) >> 1;\n\tint lc = nd << 1;\n\tint rc = lc | 1;\n\n\tif(r <= tm) return query(lc, tl, tm, l, r);\n\telse if(l > tm) return query(rc, tm + 1, tr, l, r);\n\telse return min(query(lc, tl, tm, l, r), query(rc, tm + 1, tr, l, r));\n}\n\nint main()\n{\n#ifdef kfoozminus\n\t//freopen(\"in\", \"r\", stdin);\n\t//freopen(\"out\", \"w\", stdout);\n#endif\n\tint L, _L, i, mn, mx, mid, p, n, midd, day;\n\n\tscanf(\"%d %d\", &n, &L);\n\tfor(i = 1; i <= n; i ++) {\n\n\t\tscanf(\"%d %d\", &a[i], &b[i]);\n\t\tif(a[i] > b[i]) v.PB({ a[i] - b[i], i} );\n\t\telse in[i] = -1;\n\t}\n\tvsort(v);\n\treverse(v.begin(), v.end());\n\tint sz = v.size();\n\tfor(i = 0; i < sz; i ++) in[ v[i].S ] = i;\n\tfor(i = 1; i <= n; i ++) {\n\t\t\n\t\tscanf(\"%d\", &c[i]);\n\t\tc[i] += c[i - 1];\n\t}\n\tfor(i = 1; i < sz; i ++) v[i].F += v[i - 1].F;\n\n\tif(sz) shoja[0] = v[0].F - c[1];\n\tfor(i = 1; i < sz; i ++) {\n\n\t\tshoja[i] = min(shoja[i - 1], v[i].F - c[i + 1]);\n\t\tupdate(1, 0, sz - 1, i, v[i].F - c[i]);\n\t\tdbg(i, v[i].F - c[i]);\n\t}\n\tday = INF;\n\tfor(i = 1; i <= n; i ++) {\n\n\t\t_L = L - a[i];\n\t\tif(_L <= 0) {\n\t\t\tday = 1;\n\t\t\tbreak;\n\t\t}\n\t\tif(in[i] == -1) {\n\t\t\tif(sz < 1) continue;\n\t\t\tmn = 0;\n\t\t\tmx = sz - 1;\n\t\t\twhile(mn < mx) {\n\n\t\t\t\tmid = (mn + mx) >> 1;\n\t\t\t\tif(v[mid].F < _L) mn = mid + 1;\n\t\t\t\telse mx = mid;\n\t\t\t}\n\t\t\tif(v[mn].F < _L) continue;\n\t\t\tif(shoja[mn] > 0) day = min(day, mn + 2);\n\t\t\tdbg(i, mn + 1);\n\t\t}\n\t\telse {\n\t\t\tif(sz <= 1) continue;\n\t\t\tmn = 0;\n\t\t\tmx = sz - 2;\n\t\t\twhile(mn < mx) {\n\n\t\t\t\tmid = (mn + mx) >> 1;\n\t\t\t\tif(mid >= in[i]) midd = mid + 1;\n\t\t\t\telse midd = mid;\n\t\t\t\tif(v[midd].F - (mid >= in[i]) * (a[i] - b[i]) < _L) mn = mid + 1;\n\t\t\t\telse mx = mid;\n\t\t\t}\n\t\t\tif(v[mn + (mn >= in[i])].F - (mn >= in[i]) * (a[i] - b[i]) < _L) continue;\n\t\t\tmn += (mn >= in[i]);\n\n\t\t\tif(mn < in[i]) {\n\t\t\t\tif(shoja[mn] > 0) day = min(day, mn + 2);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tp = query(1, 0, sz - 1, in[i] + 1, mn);\n\t\t\t\tif((shoja[ in[i] - 1] > 0) &&(p - (a[i] - b[i]) > 0)) day = min(day, mn + 1);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\", day == INF ? -1: day);\n return 0;\n}","accuracy":0.10416666666666667,"time_ms":10,"memory_kb":4868,"score_of_the_acc":0,"final_rank":20},{"submission_id":"aoj_2785_10691078","code_snippet":"#include <bits/stdc++.h>\n\n#define rep(i,n) for(i=1;i<=n;i++)\n#define Rep(i,n) for(i=0;i<n;i++)\n\n#define mem(ara,val) memset(ara,val,sizeof(ara))\n#define pb(x) push_back(x)\n#define sz(x) x.size()\n\n#define INF 1000000000000000000ll\n#define Max 200005\n#define mod 1000000007\n\n#define si(x) scanf(\"%d\",&x)\n#define sii(x,y) scanf(\"%d %d\",&x,&y)\n#define siii(x,y,z) scanf(\"%d %d %d\",&x,&y,&z)\n\n#define sl(x) scanf(\"%lld\",&x)\n#define sll(x,y) scanf(\"%lld %lld\",&x,&y)\n#define slll(x,y,z) scanf(\"%lld %lld %lld\",&x,&y,&z)\n\n#define FI freopen(\"in.txt\",\"r\",stdin)\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef unsigned long long ULL;\n\nstruct info\n{\n LL h,d;\n info() {}\n info(LL _h,LL _d) {\n h = _h;\n d = _d;\n }\n bool operator < (const info & p) const\n {\n if(d == p.d)return h < p.h;\n else return d > p.d;\n }\n};\ninfo ara[Max];\nLL n,need[Max],L;\n\n/// brute\nLL brute()\n{\n LL i,mn = INF;\n for(LL flag=1;flag<=n;flag++)\n {\n LL tot = 0,cnt = 0;\n LL reach = L - ara[flag].h;\n LL done = 0;\n\n if(reach <= 0)\n {\n mn = min(mn,1ll);\n continue;\n }\n\n rep(i,n)\n {\n if(i == flag)continue;\n cnt++;\n tot += ara[i].d;\n if(tot < need[cnt])break;\n if(tot >= reach)\n {\n done = 1;\n break;\n }\n }\n if(done)\n {\n mn = min(mn,cnt+1);\n }\n }\n return mn;\n}\n///brute\n\n\n\n\nLL afford[Max],cum[Max],good,sat;\nLL tree[4*Max];\n\nvoid init(LL ind,LL b,LL e)\n{\n if(b == e)\n {\n tree[ind] = afford[b];\n return;\n }\n LL mid = (b + e) / 2,l = 2 * ind,r = l + 1;\n init(l,b,mid);\n init(r,mid+1,e);\n tree[ind] = min(tree[l],tree[r]);\n}\n\nLL Q(LL ind,LL b,LL e,LL i,LL j)\n{\n if(i > j)return INF;\n if(b == i && e == j)return tree[ind];\n LL mid = (b + e) / 2,l = 2 * ind,r = l + 1;\n return min( Q(l,b,mid,i,min(mid,j)) , Q(r,mid+1,e,max(mid+1,i),j) );\n}\n\nLL bin(LL x)\n{\n LL low = 1,high = sat,mid,ans = -1;\n while( low <= high )\n {\n mid = (low + high) / 2;\n if(cum[mid] >= x)\n {\n ans = mid;\n high = mid - 1;\n }\n else low = mid + 1;\n }\n return ans;\n}\n\nLL F()\n{\n LL i,f = 0;\n rep(i,n)\n {\n if(ara[i].d <= 0)break;\n good = i;\n cum[i] = cum[i-1] + ara[i].d;\n afford[i] = cum[i] - need[i-1];\n if(!f)\n {\n sat = i;\n if(cum[i] < need[i])f = 1;\n }\n }\n if(sat)init(1,1,sat);\n\n LL ret = INF;\n rep(i,sat)\n {\n LL delta = ara[i].d;\n LL jump = ara[i].h;\n LL pos = bin( L - jump + delta );\n if( pos == -1 )continue;\n LL rmq = INF;\n if(sat)rmq = Q(1,1,sat,i+1,pos);\n if(rmq < delta)continue;\n //if(i == 5)printf(\"pos %lld rmq %lld delta %lld\\n\",pos,rmq,delta);\n LL day = pos;\n if(pos < i)day++;\n //if(day == 1)printf(\"i %lld\\n\",i);\n ret = min(ret,day);\n }\n\n for(i=sat+1;i<=n;i++)\n {\n LL jump = ara[i].h;\n LL pos = bin( L - jump );\n if(pos == -1)continue;\n LL day = pos + 1;\n ret = min(ret,day);\n }\n\n return ret;\n}\n\nint main()\n{\n\n //srand( time(0) );\n //FI;\n LL i,x,y;\n sll(n,L);\n rep(i,n)\n {\n sll(x,y);\n ara[i] = info(x,x-y);\n }\n need[0] = 1;\n rep(i,n)\n {\n sl(x);\n need[i] = need[i-1] + x;\n }\n\n /*n = 10000;\n L = rand() % 10000 + 1;\n rep(i,n)\n {\n x = rand() % 30 + 1;\n y = rand() % 60 + 1;\n ara[i] = info(x,x-y);\n }\n\n rep(i,n)\n {\n x = rand() % 5 + 1;\n need[i] = need[i-1] + x;\n }*/\n\n sort(ara+1,ara+n+1);\n\n LL ret = F();\n if(ret == INF)ret = -1;\n printf(\"%lld\\n\",ret);\n //printf(\"brute %lld\\n\",brute());\n //printf(\"my %lld\\n\",F());\n return 0;\n}","accuracy":0.8333333333333334,"time_ms":30,"memory_kb":13936,"score_of_the_acc":-0.9555,"final_rank":13},{"submission_id":"aoj_2785_10691076","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i,n) for(i = 0; i<n; i++)\n#define repl(i,n) for(i = 1; i<=n; i++)\n\n#define sz(x) (int)x.size()\n#define pb push_back\n#define all(x) x.begin(), x.end()\n#define uu first\n#define vv second\n#define mem(x,y) memset(x,y,sizeof(x))\n#define sdi(x) scanf(\"%d\",&x)\n#define sdii(x,y) scanf(\"%d %d\",&x,&y)\n#define sdiii(x,y,z) scanf(\"%d %d %d\",&x,&y,&z)\n#define sdl(x) scanf(\"%lld\",&x)\n#define sdll(x,y) scanf(\"%lld %lld\",&x,&y)\n#define sdlll(x,y,z) scanf(\"%lld %lld %lld\",&x,&y,&z)\n#define sds(x) scanf(\"%s\",s);\n#define pfi(x) printf(\"%d\\n\",x)\n#define pfii(x,y) printf(\"%d %d\\n\",x,y)\n#define pfiii(x,y,z) printf(\"%d %d %d\\n\",x,y,z)\n#define pfl(x) printf(\"%lld\\n\",x)\n#define pfll(x,y) printf(\"%lld %lld\\n\",x,y)\n#define pflll(x,y,z) printf(\"%lld %lld %lld\\n\",x,y,z)\n\n#define eps 1e-9\n//#define OK cerr<< \"OK\" << '\\n'\n//#define DB(x) cerr << #x \" = \" << x << '\\n'\n\n#define FRE(i,a,b) for(i = a; i<=b; i++)\n#define FRL(i,a,b) for(i = a; i<b; i++)\n#define un(x) x.erase(unique(all(x)),x.end())\n#define sf(x) scanf(\"%d\",&x)\n#define sff(x,y) scanf(\"%d %d\",&x,&y)\n#define sfff(x,y,z) scanf(\"%d %d %d\",&x,&y,&z)\n#define sl(x) scanf(\"%lld\",&x)\n#define sll(x,y) scanf(\"%lld %lld\",&x,&y)\n#define slll(x,y,z) scanf(\"%lld %lld %lld\",&x,&y,&z)\n#define D(x) cerr << #x \" = \" << x << '\\n'\n#define DBG cerr << \"Hi\" << '\\n'\n#define PI acose(-1.00)\n#define xx first\n#define yy second\n\ntypedef double db;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int,int> pii;\ntypedef pair<long long,long long> pll;\n\ninline int setBit(int N, int pos) { return N=N|(1<<pos);}\ninline int resetBit(int N, int pos) {return N=N &~(1<<pos);}\ninline bool checkBit(int N, int pos) {return (bool) (N & (1<<pos));}\n\n\n//int fx[] = {+0, +0, +1, -1, +1, -1, +1};\n//int fy[] = {-1, +1, +0, +0, +1, -1, -1};\n\n\nconst int MAX = 100005;\nint n, ub;\nLL c[MAX], cumDelta[MAX], cumC[MAX], tree[MAX*4], l;\nstruct data {\n int a, b;\n inline bool operator < (const data &p) const {\n return ((a-b) > (p.a-p.b));\n }\n} arr[MAX];\n\nvoid init(int node, int beg, int endd) {\n if(beg == endd) {\n tree[node] = cumDelta[beg] - cumC[beg];\n return;\n }\n\n int left = node << 1;\n int right = left + 1;\n int mid = (beg+endd) >> 1;\n\n init(left, beg, mid);\n init(right, mid+1, endd);\n\n tree[node] = min(tree[left], tree[right]);\n}\n\nvoid update(int node, int beg, int endd, int x, LL val) {\n if(beg == endd) {\n tree[node] += val;\n return;\n }\n\n int left = node << 1;\n int right = left + 1;\n int mid = (beg+endd) >> 1;\n\n if(x <= mid) update(left, beg, mid, x, val);\n else update(right, mid+1, endd, x, val);\n\n tree[node] = min(tree[left], tree[right]);\n}\n\nLL query(int node, int beg, int endd, int x, int y) {\n if(x > y) return LLONG_MAX;\n if(beg == x && endd == y) return tree[node];\n\n int left = node << 1;\n int right = left + 1;\n int mid = (beg+endd) >> 1;\n\n LL l = query(left, beg, mid, x, min(y, mid));\n LL r = query(right, mid+1, endd, max(x, mid+1), y);\n\n return min(l, r);\n}\n\ninline int bs(int idx) {\n int low=1, high=ub, mid, ret=n+5;\n while(low <= high) {\n mid = (low+high) >> 1;\n LL x = cumDelta[mid];\n if(mid >= idx) x -= (arr[idx].a - arr[idx].b);\n if(x >= l - arr[idx].a) {\n ret = min(ret, mid);\n high = mid-1;\n }\n else low = mid+1;\n }\n return ret;\n}\n\ninline int check(int idx) {\n update(1, 1, n, idx, -cumDelta[idx]);\n if(idx < n) update(1, 1, n, idx, cumDelta[idx+1]);\n if(arr[idx].a >= l) return 1;\n int here = bs(idx);\n// DB(here);\n if(here > n) return here;\n if(query(1, 1, n, 1, here) >= 0ll) {\n if(idx > here) here++;\n return here;\n }\n else return n+5;\n}\n\nint solve() {\n int ret = n+5, i;\n for(i=n; i>=1; i--) {\n int x = check(i);\n// DB(x);\n ret = min(ret, x);\n }\n if(ret > n) return -1;\n else return ret;\n}\n\nint main() {\n// freopen(\"in.txt\", \"r\", stdin);\n// freopen(\"out.txt\", \"w\", stdout);\n\n int i;\n\n sdi(n);\n sdl(l);\n repl(i, n) sdll(arr[i].a, arr[i].b);\n repl(i, n) sdl(c[i]);\n\n sort(arr+1, arr+1+n);\n ub = 0;\n repl(i, n) {\n if(arr[i].a >= arr[i].b) ub = i;\n }\n repl(i, n) {\n cumDelta[i] = cumDelta[i-1];\n cumDelta[i] += (arr[i].a - arr[i].b);\n }\n repl(i, n) {\n cumC[i] = cumC[i-1];\n cumC[i] += c[i];\n }\n\n// repl(i, n) pfll(arr[i].a, arr[i].b); puts(\"----------\");\n// repl(i, n) pfl(c[i]);\n\n init(1, 1, n);\n pfi(solve());\n\n return 0;\n}","accuracy":0.7291666666666666,"time_ms":40,"memory_kb":9788,"score_of_the_acc":-0.8375,"final_rank":14},{"submission_id":"aoj_2785_10493893","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = long long;\n#define rep(i,n) for(i64 i=0; i<i64(n); i++)\n\nstruct RMQ{\n i64 N;\n vector<i64> A;\n RMQ(vector<i64> a = {}){\n N = 1; while(N < i64(a.size())) N*=2;\n A.assign(N*2, 1ll<<60);\n rep(i,a.size()) A[N+i] = a[i];\n for(i64 i=N-1; i>=1; i--) A[i] = min(A[i*2], A[i*2+1]);\n }\n i64 query(i64 l, i64 r){\n l += N; r += N;\n i64 res = 1ll << 60;\n while(l < r){\n if(l%2) res = min(res, A[l++]);\n if(r%2) res = min(res, A[--r]);\n l /= 2; r /= 2;\n }\n return res;\n }\n};\n\nbool nachia = false;\n\ni64 solve(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\n i64 ans = N+1;\n sort(A.rbegin(), A.rend());\n vector<i64> K(N+1); rep(i,N) K[i+1] = K[i] + C[i];\n\n vector<i64> D(N+1);\n rep(i,N) D[i+1] = D[i] + A[i].first;\n i64 cap_straight = 0;\n while(cap_straight < N && D[cap_straight+1] > K[cap_straight+1]) cap_straight++;\n\n vector<i64> capdiff(N);\n rep(i,N) capdiff[i] = D[i+1] - K[i];\n auto ds = RMQ(capdiff);\n\n if(nachia){\n cout << \"D = \"; for(auto d : D){ cout << d << \" \"; } cout << endl;\n cout << \"cap = \"; for(auto d : capdiff){ cout << d << \" \"; } cout << endl;\n }\n\n i64 maxDi = max_element(D.begin(), D.end()) - D.begin();\n\n rep(f,N){\n if(nachia) cout << \"f = \" << f << endl;\n if(f >= maxDi || D[f] + A[f].second >= L){\n if(nachia) cout << \" case A\" << endl;\n if(D[maxDi] + A[f].second < L) continue;\n i64 t = lower_bound(D.begin(), D.begin() + maxDi + 1, L-A[f].second) - D.begin();\n if(cap_straight < t) continue;\n t += 1;\n if(nachia) cout << \" ok t = \" << t << endl;\n if(t < ans) ans = t;\n continue;\n }\n if(nachia) cout << \" case B\" << endl;\n if(cap_straight < f) continue;\n i64 offset = A[f].second - A[f].first;\n i64 loss = A[f].first;\n if(D[maxDi] + offset < L) continue;\n i64 g = lower_bound(D.begin(), D.begin() + maxDi + 1, L-offset) - D.begin();\n i64 cap = ds.query(f+1, g);\n if(nachia){ cout << \" query : \"; for(int i=f+1; i<g; i++){ cout <<capdiff[i] << \" \"; } cout << endl; }\n if(nachia){ cout << \" offset = \" << offset << \" , g = \" << g << \" , cap = \" << cap << endl; }\n if(cap <= loss) continue;\n if(g < ans) ans = g;\n }\n \n if(ans == N+1) return -1;\n return ans;\n}\n\ni64 naive(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\n i64 ans = N+1;\n sort(A.rbegin(), A.rend());\n rep(f,N){\n i64 a = 0, c = 0;\n i64 t = 0;\n rep(j,N) if(j != f){\n if(A[f].second + a >= L) break;\n a += A[j].first;\n c += C[t];\n t++;\n if(a <= c){ t = -1; break; }\n }\n if(t < 0) continue;\n if(A[f].second + a >= L){\n i64 k = t + 1;\n if(k < ans) ans = k;\n }\n }\n return ans > N ? -1 : ans;\n}\n\n\nvoid testcase(){\n i64 N; cin >> N;\n i64 L; cin >> L;\n vector<pair<i64,i64>> A(N);\n rep(i,N){\n i64 a,b; cin >> a >> b;\n A[i] = { a-b, a };\n }\n vector<i64> C(N); rep(i,N) cin >> C[i];\n i64 ans = solve(N, L, A, C);\n cout << ans << \"\\n\";\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n testcase();\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":13060,"score_of_the_acc":-0.7287,"final_rank":5},{"submission_id":"aoj_2785_10492640","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = long long;\n#define rep(i,n) for(i64 i=0; i<i64(n); i++)\n\nstruct RMQ{\n i64 N;\n vector<i64> A;\n RMQ(vector<i64> a = {}){\n N = 1; while(N < i64(a.size())) N*=2;\n A.assign(N*2, 1ll<<60);\n rep(i,a.size()) A[N+i] = a[i];\n for(i64 i=N-1; i>=1; i--) A[i] = min(A[i*2], A[i*2+1]);\n }\n i64 query(i64 l, i64 r){\n l += N; r += N;\n i64 res = 1ll << 60;\n while(l < r){\n if(l%2) res = min(res, A[l++]);\n if(r%2) res = min(res, A[--r]);\n l /= 2; r /= 2;\n }\n return res;\n }\n};\n\nbool nachia = false;\n\ni64 solve(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\n i64 ans = N+1;\n sort(A.rbegin(), A.rend());\n vector<i64> K(N+1); rep(i,N) K[i+1] = K[i] + C[i];\n\n vector<i64> D(N+1);\n rep(i,N) D[i+1] = D[i] + A[i].first;\n i64 cap_straight = 0;\n while(cap_straight < N && D[cap_straight+1] > K[cap_straight+1]) cap_straight++;\n\n vector<i64> capdiff(N);\n rep(i,N) capdiff[i] = D[i+1] - K[i];\n auto ds = RMQ(capdiff);\n\n if(nachia){\n cout << \"D = \"; for(auto d : D){ cout << d << \" \"; } cout << endl;\n cout << \"cap = \"; for(auto d : capdiff){ cout << d << \" \"; } cout << endl;\n }\n\n i64 maxDi = max_element(D.begin(), D.end()) - D.begin();\n\n rep(f,N){\n if(nachia) cout << \"f = \" << f << endl;\n if(f >= maxDi || D[f] >= L){\n if(nachia) cout << \" case A\" << endl;\n i64 t = lower_bound(D.begin(), D.begin() + maxDi + 1, L-A[f].second) - D.begin();\n if(cap_straight < t) continue;\n t += 1;\n if(t < ans) ans = t;\n continue;\n }\n if(nachia) cout << \" case B\" << endl;\n if(cap_straight < f) continue;\n i64 offset = A[f].second - A[f].first;\n if(D[maxDi] + offset < L) continue;\n i64 g = lower_bound(D.begin(), D.begin() + maxDi + 1, L-offset) - D.begin();\n i64 cap = ds.query(f, g);\n if(nachia) cout << \" offset = \" << offset << \" , g = \" << g << \" , cap = \" << cap << endl;\n if(cap < offset) continue;\n if(g < ans) ans = g;\n }\n \n if(ans == N+1) return -1;\n return ans;\n}\n\nvoid testcase(){\n i64 N; cin >> N;\n i64 L; cin >> L;\n vector<pair<i64,i64>> A(N);\n rep(i,N){\n i64 a,b; cin >> a >> b;\n A[i] = { a-b, a };\n }\n vector<i64> C(N); rep(i,N) cin >> C[i];\n i64 ans = solve(N, L, A, C);\n cout << ans << \"\\n\";\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n testcase();\n return 0;\n}","accuracy":0.6041666666666666,"time_ms":20,"memory_kb":12968,"score_of_the_acc":-0.7224,"final_rank":16},{"submission_id":"aoj_2785_10492625","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = long long;\n#define rep(i,n) for(i64 i=0; i<i64(n); i++)\n\nstruct RMQ{\n i64 N;\n vector<i64> A;\n RMQ(vector<i64> a = {}){\n N = 1; while(N < i64(a.size())) N*=2;\n A.assign(N*2, 1ll<<60);\n rep(i,a.size()) A[N+i] = a[i];\n for(i64 i=N-1; i>=1; i--) A[i] = min(A[i*2], A[i*2+1]);\n }\n i64 query(i64 l, i64 r){\n l += N; r += N;\n i64 res = 1ll << 60;\n while(l < r){\n if(l%2) res = min(res, A[l++]);\n if(r%2) res = min(res, A[--r]);\n l /= 2; r /= 2;\n }\n return res;\n }\n};\n\nbool nachia = false;\n\ni64 solve(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\n i64 ans = N+1;\n sort(A.rbegin(), A.rend());\n vector<i64> K(N+1); rep(i,N) K[i+1] = K[i] + C[i];\n\n vector<i64> D(N+1);\n rep(i,N) D[i+1] = D[i] + A[i].first;\n i64 cap_straight = 0;\n while(cap_straight < N && D[cap_straight+1] >= K[cap_straight+1]) cap_straight++;\n\n vector<i64> capdiff(N);\n rep(i,N) capdiff[i] = D[i+1] - K[i];\n auto ds = RMQ(capdiff);\n\n if(nachia){\n cout << \"D = \"; for(auto d : D){ cout << d << \" \"; } cout << endl;\n cout << \"cap = \"; for(auto d : capdiff){ cout << d << \" \"; } cout << endl;\n }\n\n i64 maxDi = max_element(D.begin(), D.end()) - D.begin();\n\n rep(f,N){\n if(nachia) cout << \"f = \" << f << endl;\n if(f >= maxDi || D[f] >= L){\n if(nachia) cout << \" case A\" << endl;\n i64 t = lower_bound(D.begin(), D.begin() + maxDi + 1, L-A[f].second) - D.begin();\n if(cap_straight < t) continue;\n t += 1;\n if(t < ans) ans = t;\n continue;\n }\n if(nachia) cout << \" case B\" << endl;\n if(cap_straight < f) continue;\n i64 offset = A[f].second - A[f].first;\n if(D[maxDi] + offset < L) continue;\n i64 g = lower_bound(D.begin(), D.begin() + maxDi + 1, L-offset) - D.begin();\n i64 cap = ds.query(f, g);\n if(nachia) cout << \" offset = \" << offset << \" , g = \" << g << \" , cap = \" << cap << endl;\n if(cap < offset) continue;\n if(g < ans) ans = g;\n }\n \n if(ans == N+1) return -1;\n return ans;\n}\n\nvoid testcase(){\n i64 N; cin >> N;\n i64 L; cin >> L;\n vector<pair<i64,i64>> A(N);\n rep(i,N){\n i64 a,b; cin >> a >> b;\n A[i] = { a-b, a };\n }\n vector<i64> C(N); rep(i,N) cin >> C[i];\n i64 ans = solve(N, L, A, C);\n cout << ans << \"\\n\";\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n testcase();\n return 0;\n}","accuracy":0.6041666666666666,"time_ms":20,"memory_kb":12964,"score_of_the_acc":-0.7221,"final_rank":15},{"submission_id":"aoj_2785_10492612","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = long long;\n#define rep(i,n) for(i64 i=0; i<i64(n); i++)\n\nstruct RMQ{\n i64 N;\n vector<i64> A;\n RMQ(vector<i64> a = {}){\n N = 1; while(N < i64(a.size())) N*=2;\n A.assign(N*2, 1ll<<60);\n rep(i,a.size()) A[N+i] = a[i];\n for(i64 i=N-1; i>=1; i--) A[i] = min(A[i*2], A[i*2+1]);\n }\n i64 query(i64 l, i64 r){\n l += N; r += N;\n i64 res = 1ll << 60;\n while(l < r){\n if(l%2) res = min(res, A[l++]);\n if(r%2) res = min(res, A[--r]);\n l /= 2; r /= 2;\n }\n return res;\n }\n};\n\nbool nachia = false;\n\ni64 solve(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\n i64 ans = N+1;\n sort(A.rbegin(), A.rend());\n vector<i64> K(N+1); rep(i,N) K[i+1] = K[i] + C[i];\n\n vector<i64> D(N+1);\n rep(i,N) D[i+1] = D[i] + A[i].first;\n i64 cap_straight = 0;\n while(cap_straight < N && D[cap_straight+1] >= K[cap_straight]) cap_straight++;\n\n vector<i64> capdiff(N);\n rep(i,N) capdiff[i] = D[i+1] - K[i];\n auto ds = RMQ(capdiff);\n\n if(nachia){\n cout << \"D = \"; for(auto d : D){ cout << d << \" \"; } cout << endl;\n cout << \"cap = \"; for(auto d : capdiff){ cout << d << \" \"; } cout << endl;\n }\n\n i64 maxDi = max_element(D.begin(), D.end()) - D.begin();\n\n rep(f,N){\n if(nachia) cout << \"f = \" << f << endl;\n if(f >= maxDi || D[f] >= L){\n if(nachia) cout << \" case A\" << endl;\n i64 t = lower_bound(D.begin(), D.begin() + maxDi + 1, L-A[f].second) - D.begin();\n if(cap_straight < t) continue;\n t += 1;\n if(t < ans) ans = t;\n continue;\n }\n if(nachia) cout << \" case B\" << endl;\n if(cap_straight < f) continue;\n i64 offset = A[f].second - A[f].first;\n if(D[maxDi] + offset < L) continue;\n i64 g = lower_bound(D.begin(), D.begin() + maxDi + 1, L-offset) - D.begin();\n i64 cap = ds.query(f, g);\n if(nachia) cout << \" offset = \" << offset << \" , g = \" << g << \" , cap = \" << cap << endl;\n if(cap < offset) continue;\n if(g < ans) ans = g;\n }\n \n if(ans == N+1) return -1;\n return ans;\n}\n\nvoid testcase(){\n i64 N; cin >> N;\n i64 L; cin >> L;\n vector<pair<i64,i64>> A(N);\n rep(i,N){\n i64 a,b; cin >> a >> b;\n A[i] = { a-b, a };\n }\n vector<i64> C(N); rep(i,N) cin >> C[i];\n i64 ans = solve(N, L, A, C);\n cout << ans << \"\\n\";\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n testcase();\n return 0;\n}","accuracy":0.6041666666666666,"time_ms":20,"memory_kb":13004,"score_of_the_acc":-0.7248,"final_rank":17},{"submission_id":"aoj_2785_10295856","code_snippet":"// AOJ #2785 Escape from the Hell\n// 2025.3.14\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = LLONG_MAX;\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(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\tpc('\\n');\n}\n\nstruct Drink { ll a, b; };\n\nint solve(){\n int N = Cin();\n ll L = Cin();\n\n vector<Drink> dArr(N);\n priority_queue< pair<ll,int> > pqA;\n priority_queue< pair<ll,int> > pqB;\n\n vector< pair<ll,int> > ord;\n for(int i = 0; i < N; i++){\n dArr[i].a = Cin(), dArr[i].b = Cin();\n ord.push_back({dArr[i].a - dArr[i].b, i});\n pqA.push({dArr[i].a, i});\n }\n vector<ll> C(N);\n for(int i = 0; i < N; i++) C[i] = Cin();\n\n sort(ord.begin(), ord.end(), [&dArr](auto &p, auto &q) {\n return (p.first == q.first) ? (dArr[p.second].b < dArr[q.second].b) : (p.first > q.first);\n });\n\n vector<ll> usedDay(N, INF);\n ll myH = 0;\n ll enemyH = 0;\n int delPtr = 0;\n\n if(!pqA.empty() && pqA.top().first >= L) return 1;\n\n for(int i = 0; i < N; i++){\n while(!pqA.empty() && usedDay[pqA.top().second] < i) pqA.pop();\n if(!pqA.empty() && myH + pqA.top().first >= L) return i+1;\n\n int curIdx = ord[i].second;\n ll delta = ord[i].first;\n myH += delta;\n\n pqB.push({ dArr[curIdx].b, curIdx });\n\n while(delPtr < i && myH - ord[delPtr].first <= enemyH) delPtr++;\n\n while(!pqB.empty() && usedDay[pqB.top().second] < delPtr) pqB.pop();\n\n if(!pqB.empty() && myH + pqB.top().first >= L) return i+1;\n\n usedDay[curIdx] = i;\n enemyH += C[i];\n if(enemyH >= myH) return -1;\n }\n return -1;\n}\n\nint main() {\n Cout(solve());\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":12276,"score_of_the_acc":-0.6749,"final_rank":4},{"submission_id":"aoj_2785_10295768","code_snippet":"// AOJ #2785 Escape from the Hell\n// 2025.3.14\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct Dr { ll A, B, d; };\n\nstruct Seg {\n int n;\n vector<ll> seg;\n Seg(int n): n(n) {\n seg.assign(2*n, 0);\n }\n void build(const vector<ll>& arr) {\n for (int i = 0; i < n; i++) seg[n+i] = arr[i];\n for (int i = n-1; i > 0; i--) seg[i] = max(seg[2*i], seg[2*i+1]);\n }\n ll qry(int l, int r) {\n ll res = 0;\n l += n; r += n;\n while(l <= r){\n if(l % 2 == 1){ res = max(res, seg[l]); l++; }\n if(r % 2 == 0){ res = max(res, seg[r]); r--; }\n l /= 2; r /= 2;\n }\n return res;\n }\n};\n\nbool cmp(const Dr &p, const Dr &q){\n if(p.d == q.d) return p.B < q.B;\n return p.d > q.d;\n}\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int n; ll L;\n cin >> n >> L;\n vector<Dr> v(n);\n for (int i = 0; i < n; i++){\n cin >> v[i].A >> v[i].B;\n v[i].d = v[i].A - v[i].B;\n }\n vector<ll> C(n);\n for (int i = 0; i < n; i++) cin >> C[i];\n\n sort(v.begin(), v.end(), cmp);\n\n vector<ll> suf(n);\n suf[n-1] = v[n-1].A;\n for (int i = n-2; i >= 0; i--) suf[i] = max(v[i].A, suf[i+1]);\n\n vector<ll> arr(n);\n for (int i = 0; i < n; i++) arr[i] = v[i].B;\n\n Seg segt(n);\n segt.build(arr);\n\n vector<ll> S(n+1, 0);\n for (int i = 1; i <= n; i++) S[i] = S[i-1] + v[i-1].d;\n vector<ll> M(n+1, 0);\n for (int i = 1; i <= n; i++) M[i] = M[i-1] + C[i-1];\n\n if(n >= 1 && suf[0] >= L){\n cout << 1 << endl;\n return 0;\n }\n\n int ans = -1;\n ll mn = LLONG_MAX;\n for (int d = 2; d <= n; d++){\n ll cur = S[d-1] - M[d-1];\n if(cur <= 0) break;\n mn = min(mn, cur);\n\n if(d-1 < n && S[d-1] + suf[d-1] >= L){\n ans = d;\n break;\n }\n\n int lo = 0, hi = d-1, pos = d;\n while(lo <= hi){\n int mid = (lo + hi) / 2;\n if(v[mid].d < mn) pos = mid, hi = mid - 1;\n else lo = mid + 1;\n }\n if(pos < d){\n ll cand = segt.qry(pos, d-1);\n if(S[d-1] + cand >= L){\n ans = d;\n break;\n }\n }\n }\n cout << (ans == -1 ? -1 : ans) << endl;\n return 0;\n}","accuracy":0.2916666666666667,"time_ms":20,"memory_kb":10324,"score_of_the_acc":-0.541,"final_rank":18},{"submission_id":"aoj_2785_9836741","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n ll n,L;cin >> n >> L;\n vi a(n),b(n);\n rep(i,n)cin >> a[i] >> b[i];\n vi c(n);cin >> c;\n vi idx(n);\n iota(ALL(idx),0);\n sort(ALL(idx),[&](int i,int j){\n return a[i]-b[i] > a[j]-b[j];\n });\n vi ruiC(n+1);\n rep(i,n)ruiC[i+1] = ruiC[i] + c[i];\n vi rui(n+1);\n rep(i,n)rui[i+1] = rui[i] + a[idx[i]] - b[idx[i]];\n int res = MOD;\n ll lst = n;\n rep(i,n)if(ruiC[i+1] >= rui[i+1]){\n lst = i;\n break;\n }\n {\n vi v;\n for(int i = n-1;i >= 0;i--){\n if(a[idx[i]] <= b[idx[i]]){\n v.emplace_back(a[idx[i]]);\n rui.pop_back();ruiC.pop_back();\n }else break;\n }\n n = sz(rui)-1;\n chmin(lst,n);\n for(auto au : v){\n int k = LB(rui,L-au);\n if(k-1 >= lst)continue;\n chmin(res,k+1);\n }\n }\n min_priority_queue<P> que;\n for(int i = n-1;i >= 0;i--){\n int A = a[idx[i]],B = b[idx[i]];\n while(!que.empty()){\n auto [x,y] = que.top();\n if(x <= A-B){\n chmin(lst,y);\n que.pop();\n }else break;\n }\n int k = LB(rui,L-A);\n int g = 0;\n if(k >= i+1){g = 1;\n k = LB(rui,L-A+(A-B));\n }\n if(k-1 < lst)chmin(res,k-g+1);\n que.push({rui[i+1]-ruiC[i],i});\n }\n cout << (res == MOD ? -1 : res) << \"\\n\";\n \n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":9852,"score_of_the_acc":-0.5086,"final_rank":2},{"submission_id":"aoj_2785_9836735","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n ll n,L;cin >> n >> L;\n vi a(n),b(n);\n rep(i,n)cin >> a[i] >> b[i];\n vi c(n);cin >> c;\n vi idx(n);\n iota(ALL(idx),0);\n sort(ALL(idx),[&](int i,int j){\n return a[i]-b[i] > a[j]-b[j];\n });\n vi ruiC(n+1);\n rep(i,n)ruiC[i+1] = ruiC[i] + c[i];\n vi rui(n+1);\n rep(i,n)rui[i+1] = rui[i] + a[idx[i]] - b[idx[i]];\n int res = MOD;\n {\n vi v;\n for(int i = n-1;i >= 0;i--){\n if(a[idx[i]] <= b[idx[i]]){\n v.emplace_back(a[idx[i]]);\n rui.pop_back();ruiC.pop_back();\n }else break;\n }\n n = sz(rui)-1;\n for(auto au : v){\n int k = LB(rui,L-au);\n if(k-1 > n-1)continue;\n chmin(res,k+1);\n }\n }\n ll lst = n;\n rep(i,n)if(ruiC[i+1] >= rui[i+1]){\n lst = i;\n break;\n }\n min_priority_queue<P> que;\n for(int i = n-1;i >= 0;i--){\n int A = a[idx[i]],B = b[idx[i]];\n while(!que.empty()){\n auto [x,y] = que.top();\n if(x <= A-B){\n chmin(lst,y);\n que.pop();\n }else break;\n }\n int k = LB(rui,L-A);\n int g = 0;\n if(k >= i+1){g = 1;\n k = LB(rui,L-A+(A-B));\n }\n if(k-1 < lst)chmin(res,k-g+1);\n que.push({rui[i+1]-ruiC[i],i});\n }\n cout << (res == MOD ? -1 : res) << \"\\n\";\n \n\n return 0;\n}","accuracy":0.8333333333333334,"time_ms":30,"memory_kb":9912,"score_of_the_acc":-0.6794,"final_rank":12},{"submission_id":"aoj_2785_9836716","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n ll n,L;cin >> n >> L;\n vi a(n),b(n);\n rep(i,n)cin >> a[i] >> b[i];\n vi c(n);cin >> c;\n vi idx(n);\n iota(ALL(idx),0);\n sort(ALL(idx),[&](int i,int j){\n return a[i]-b[i] > a[j]-b[j];\n });\n vi ruiC(n+1);\n rep(i,n)ruiC[i+1] = ruiC[i] + c[i];\n vi rui(n+1);\n rep(i,n)rui[i+1] = rui[i] + a[idx[i]] - b[idx[i]];\n ll lst = n;\n rep(i,n)if(ruiC[i+1] >= rui[i+1]){\n lst = i;\n break;\n }\n min_priority_queue<P> que;\n int res = MOD;\n for(int i = n-1;i >= 0;i--){\n int A = a[idx[i]],B = b[idx[i]];\n while(!que.empty()){\n auto [x,y] = que.top();\n if(x <= A-B){\n chmin(lst,y);\n que.pop();\n }else break;\n }\n int k = LB(rui,L-A);\n int g = 0;\n if(k >= i+1){g = 1;\n k = LB(rui,L-A+(A-B));\n }\n if(k-1 < lst)chmin(res,k-g+1);\n que.push({rui[i+1]-ruiC[i],i});\n }\n cout << (res == MOD ? -1 : res) << \"\\n\";\n \n\n return 0;\n}","accuracy":0.875,"time_ms":20,"memory_kb":9768,"score_of_the_acc":-0.5028,"final_rank":11},{"submission_id":"aoj_2785_9831050","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\ntemplate <typename M, typename N, M (*f)(M, M), M (*g)(M, N), M (*m1)()>\nstruct SegmentTree {\n int sz, n;\n vector<M> data;\n SegmentTree(int _n = 0) : n(_n) {\n sz = 1;\n while (sz < _n)\n sz <<= 1;\n data.assign(2 * sz, m1());\n }\n void run(vector<M> &v) {\n for (int i = 0; i < (int)v.size(); i++)\n data[i + sz] = v[i];\n for (int k = sz - 1; k > 0; k--)\n data[k] = f(data[2 * k], data[2 * k + 1]);\n }\n void set(int k, const M &x) {\n k += sz;\n data[k] = x;\n while (k >>= 1)\n data[k] = f(data[2 * k], data[2 * k + 1]);\n }\n void update(int k, const N &x) {\n k += sz;\n data[k] = g(data[k], x);\n while (k >>= 1)\n data[k] = f(data[2 * k], data[2 * k + 1]);\n }\n M query(int a, int b) {\n M L = m1(), R = m1();\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if (a & 1)\n L = f(L, data[a++]);\n if (b & 1)\n R = f(data[--b], R);\n }\n return f(L, R);\n }\n M operator[](const int &k) const {\n return data[k + sz];\n }\n vector<M> get() {\n return {data.begin() + sz, data.begin() + sz + n};\n }\n template <class F> int max_right(int L, F ch) const {\n int l = sz + L, w = 1;\n M ansL = m1();\n for (; L + w <= sz; l >>= 1, w <<= 1)\n if (l & 1) {\n if (not ch(f(ansL, data[l])))\n break;\n ansL = f(ansL, data[l++]);\n L += w;\n }\n while (l <<= 1, w >>= 1) {\n if (L + w <= sz && ch(f(ansL, data[l]))) {\n ansL = f(ansL, data[l++]);\n L += w;\n }\n }\n return L;\n }\n template <class F> int min_left(int R, F ch) const {\n int r = sz + R, w = 1;\n M ansR = m1();\n for (; R - w >= 0; r >>= 1, w <<= 1)\n if (r & 1) {\n if (not ch(f(data[r - 1], ansR)))\n break;\n ansR = f(data[--r], ansR);\n R -= w;\n }\n while (r <<= 1, w >>= 1) {\n if (R - w >= 0 && ch(f(data[r - 1], ansR))) {\n ansR = f(data[--r], ansR);\n R -= w;\n }\n }\n return R;\n }\n};\n\n/**\n * @brief Segment Tree\n */\n\nll f(ll A, ll B) {return min(A,B);}\nll g(ll A, ll B) {return B;}\nll e() {return INF;}\n\nint main() {\n int N;\n ll L;\n cin >> N >> L;\n vector<pair<ll,ll>> A(N);\n vector<ll> C(N);\n rep(i,0,N) cin >> A[i].first >> A[i].second;\n rep(i,0,N) cin >> C[i];\n sort(ALL(A),[&](pair<ll,ll> p, pair<ll,ll> q){return p.first-p.second > q.first-q.second;});\n vector<ll> D(N);\n rep(i,0,N) D[i] = A[i].first-A[i].second;\n vector<ll> DS(N+1);\n DS[0] = 0;\n rep(i,0,N) DS[i+1] = DS[i] + max(D[i], 0LL);\n vector<ll> E0(N), E1(N-1);\n rep(i,0,N) E0[i] = A[i].first-A[i].second-C[i];\n rep(i,0,N-1) E1[i] = A[i+1].first-A[i+1].second-C[i];\n vector<ll> ES0(N+1), ES1(N);\n ES0[0] = ES1[0] = 0;\n rep(i,0,N) ES0[i+1] = ES0[i] + E0[i];\n rep(i,0,N-1) ES1[i+1] = ES1[i] + E1[i];\n SegmentTree<ll,ll,f,g,e> Seg0(N+1), Seg1(N);\n Seg0.run(ES0);\n Seg1.run(ES1);\n int ANS = inf;\n rep(i,0,N) {\n if (DS[i] + A[i].first >= L) {\n int ID = LB(DS, L - A[i].first);\n if (Seg0.query(1,ID+1) > 0) chmin(ANS, ID+1);\n }\n else if (DS[N] - max(D[i], 0LL) + A[i].first >= L) {\n int ID = LB(DS, L - A[i].first + max(D[i], 0LL));\n if (Seg0.query(1,i+1) > 0 && ES0[i] + Seg1.query(i+1, ID) - ES1[i] > 0) chmin(ANS, ID);\n }\n }\n cout << (ANS == inf ? -1 : ANS) << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":14128,"score_of_the_acc":-1.6353,"final_rank":9},{"submission_id":"aoj_2785_9669146","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nstruct segtree{\n vi tree;\n int n;\n ll op(ll a,ll b){return max(a,b);}\n ll e(){return -1e18;}\n segtree(int _N){\n n=1;\n while(n<_N)n<<=1;\n tree.assign(2*n,e());\n }\n void set(int i,ll x){\n i+=n;\n tree[i]=x;\n while(i>1){\n i>>=1;\n tree[i]=op(tree[2*i],tree[2*i+1]);\n }\n }\n ll prod(int l,int r){\n l+=n;r+=n;\n ll L=e(),R=e();\n while(l<r){\n if(l%2)L=op(L,tree[l++]);\n if(r%2)R=op(tree[--r],R);\n l>>=1;r>>=1;\n }\n return op(L,R);\n }\n};\nstruct minsegtree{\n vi tree;\n int n;\n ll op(ll a,ll b){return min(a,b);}\n ll e(){return 1e18;}\n minsegtree(int _N){\n n=1;\n while(n<_N)n<<=1;\n tree.assign(2*n,e());\n }\n void set(int i,ll x){\n i+=n;\n tree[i]=x;\n while(i>1){\n i>>=1;\n tree[i]=op(tree[2*i],tree[2*i+1]);\n }\n }\n ll prod(int l,int r){\n l+=n;r+=n;\n ll L=e(),R=e();\n while(l<r){\n if(l%2)L=op(L,tree[l++]);\n if(r%2)R=op(tree[--r],R);\n l>>=1;r>>=1;\n }\n return op(L,R);\n }\n};\nint main(){\n ll N,L;cin>>N>>L;\n vector<pi>A(N);\n REP(i,N)cin>>A[i].first>>A[i].second;\n REP(i,N)A[i].second=min(A[i].first,A[i].second);\n REP(i,N)A[i]=pi(A[i].first-A[i].second,-A[i].first);\n sort(ALL(A));\n reverse(ALL(A));\n REP(i,N)A[i].second*=-1;\n vi D(N+1);\n REP(i,N)D[i+1]=D[i]+A[i].first;\n vi C(N+1);\n REP(i,N)cin>>C[i+1];\n FOR(i,1,N+1)C[i]+=C[i-1];\n ll ans=1e18,m=*max_element(ALL(D));\n minsegtree seg(N+1),seg0(N);\n REP(i,N+1)seg.set(i,D[i]-C[i]);\n REP(i,N)seg0.set(i,D[i+1]-C[i]);\n REP(i,N){\n if(D[i]+A[i].second>=L){\n ll t=lower_bound(D.begin(),D.begin()+i,L-A[i].second)-D.begin();\n if(seg.prod(1,t+1)>0)ans=min(ans,t+1);\n }\n else if(m-A[i].first+A[i].second>=L){\n ll t=lower_bound(D.begin(),D.end(),L-A[i].second+A[i].first)-D.begin();\n if(t<i+1)continue;\n if(seg.prod(1,i+1)<=0)continue;\n if(seg0.prod(i+1,t)<=A[i].first)continue;\n ans=min(ans,t);\n }\n }\n if(ans>1e17)ans=-1;\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":10232,"score_of_the_acc":-1.368,"final_rank":7},{"submission_id":"aoj_2785_9669085","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(A) A.begin(),A.end()\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nstruct segtree{\n vi tree;\n int n;\n ll op(ll a,ll b){return max(a,b);}\n ll e(){return -1e18;}\n segtree(int _N){\n n=1;\n while(n<_N)n<<=1;\n tree.assign(2*n,e());\n }\n void set(int i,ll x){\n i+=n;\n tree[i]=x;\n while(i>1){\n i>>=1;\n tree[i]=op(tree[2*i],tree[2*i+1]);\n }\n }\n ll prod(int l,int r){\n l+=n;r+=n;\n ll L=e(),R=e();\n while(l<r){\n if(l%2)L=op(L,tree[l++]);\n if(r%2)R=op(tree[--r],R);\n l>>=1;r>>=1;\n }\n return op(L,R);\n }\n};\nint main(){\n ll N,L;cin>>N>>L;\n vector<pi>A(N);\n REP(i,N)cin>>A[i].first>>A[i].second;\n REP(i,N)A[i]=pi(A[i].first-A[i].second,-A[i].first);\n sort(ALL(A));\n reverse(ALL(A));\n segtree seg(N);\n REP(i,N)seg.set(i,-A[i].second);\n vi C(N);\n REP(i,N)cin>>C[i];\n FOR(i,1,N)C[i]+=C[i-1];\n int l=0;\n REP(i,N){\n if(seg.prod(0,N)+l>=L){\n cout<<i+1<<endl;\n return 0;\n }\n seg.set(i,-1e18);\n l+=A[i].first;\n if(l<=C[i]){\n cout<<-1<<endl;return 0;\n }\n }\n cout<<-1<<endl;\n return 0;\n}","accuracy":0.2916666666666667,"time_ms":50,"memory_kb":7192,"score_of_the_acc":-0.8261,"final_rank":19},{"submission_id":"aoj_2785_8321648","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst long long INF = (3LL << 59);\n\nclass drink {\npublic:\n\tlong long a, b;\n\tdrink() : a(0), b(0) {}\n\tdrink(long long a_, long long b_) : a(a_), b(b_) {}\n};\n\nclass segtree {\nprivate:\n\tint sz;\n\tvector<long long> val;\npublic:\n\tsegtree() : sz(0), val(vector<long long>()) {}\n\tsegtree(int n) {\n\t\tsz = (n >= 3 ? 1 << (32 - __builtin_clz(n - 1)) : n);\n\t\tval.resize(sz * 2, -INF);\n\t}\n\tvoid update(int pos, long long x) {\n\t\tpos += sz;\n\t\tval[pos] = x;\n\t\twhile (pos > 1) {\n\t\t\tpos /= 2;\n\t\t\tval[pos] = max(val[pos * 2], val[pos * 2 + 1]);\n\t\t}\n\t}\n\tlong long rangemax(int l, int r) const {\n\t\tlong long res = -INF;\n\t\tl += sz;\n\t\tr += sz;\n\t\twhile (l != r) {\n\t\t\tif (l & 1) res = max(res, val[l++]);\n\t\t\tif (r & 1) res = max(res, val[--r]);\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n};\n\nint main() {\n\t// step #1. input\n\tint N; long long L;\n\tcin >> N >> L;\n\tvector<drink> D(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> D[i].a >> D[i].b;\n\t}\n\tvector<int> C(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> C[i];\n\t}\n\n\t// step #2. solve\n\tsort(D.begin(), D.end(), [&](const drink& d1, const drink& d2) {\n\t\treturn d1.a - d1.b > d2.a - d2.b;\n\t});\n\tvector<long long> F(N);\n\tsegtree seg1(N), seg2(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tF[i] = D[i].a - D[i].b;\n\t\tseg1.update(i, D[i].a);\n\t\tseg2.update(i, D[i].b);\n\t}\n\tint answer = -1;\n\tlong long height = F[0];\n\tlong long diff = F[0] + 1;\n\tlong long diffmin = diff;\n\tfor (int r = 1; r <= N; r++) {\n\t\tif (diffmin <= 0) {\n\t\t\tbreak;\n\t\t}\n\t\tint pos = lower_bound(F.begin(), F.end(), diffmin - 1, [](long long v1, long long v2) { return v1 > v2; }) - F.begin();\n\t\tif (pos < r - 1) {\n\t\t\tlong long bmax = seg2.rangemax(pos, r - 1);\n\t\t\tlong long h = height + bmax;\n\t\t\tif (h >= L) {\n\t\t\t\tanswer = r;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (pos < r) {\n\t\t\tlong long amax = seg1.rangemax(r - 1, N);\n\t\t\tlong long h = height - F[r - 1] + amax;\n\t\t\tif (h >= L) {\n\t\t\t\tanswer = r;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (r != N) {\n\t\t\theight += F[r];\n\t\t\tdiff += F[r] - C[r - 1];\n\t\t\tif (r == 1) {\n\t\t\t\tdiff -= 1;\n\t\t\t}\n\t\t\tdiffmin = min(diffmin, diff);\n\t\t}\n\t}\n\n\t// step #3. output\n\tcout << answer << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":9920,"score_of_the_acc":-1.3466,"final_rank":6},{"submission_id":"aoj_2785_7235761","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define foa(s, v) for(auto &s : v)\n#define all(v) v.begin(), v.end()\n#define REPname(a,b,c,d,...) d\n#define rep(...) REPname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP2(i,l,r) for(int i = l; i < r; i++)\n#define REP1(i, x) REP2(i,0,x)\n#define REP0(x) REP1(SPJ, x)\n#define sz(x) int(x.size())\n\ntemplate <class T>\nusing V=vector<T>;\n\ntemplate <class T>\nusing VV=vector<V<T>>;\n\ntemplate<class T>\nusing pqmin = priority_queue<T, V<T>, greater<T>>;\nusing ll = long long ;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = V<vll>;\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\ntemplate<class T>\ninline bool chmax(T &a, T b){\n\treturn a < b ? a=b, 1 : 0;\n}\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\treturn a > b ? a = b, 1 : 0;\n}\n\ntemplate <class T>\nvoid view(T x) {\n\tcerr << x;\n}\n\ntemplate <class T>\nvoid view(V<T> v) {\n\tcerr << \"{ \";\n\tfoa(t, v) {view(t) ; cerr << \", \";}\n\tcerr << \"}\";\n\tcerr << endl;\n}\n\n\ntemplate <class T>\nvoid view(VV<T> v) {\n\tcerr << \"{ \";\n\tfoa(t, v) {view(t) ; cerr << \",\\n\";}\n\tcerr << \"}\";\n\tcerr << endl;\n}\n\n\n// template <c0lass T>\nvoid view(int x) {\n\tcerr << x;\n}\n\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <class T>\nvoid debug_out(T x) {\n\tview(x);\n}\ntemplate <class H, class... T>\nvoid debug_out(H h, T... 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 << \"]\\n\"; \\\n\t} while(0)\n#else\n#define debug(...) (void(0))\n#endif\nusing vvi = V<vi>;\n\nstruct uf{\n\tvector<int> dat;\n\tuf(int n) : dat(n, -1) {}\n\tint root(int x) \n\t{\n\t\tint& p = dat[x];\n\t\tif(p < 0) return x;\n\t\treturn p = root(p);\n\t}\n\tbool merge(int x, int y) {\n\t\tx = root(x);\n\t\ty = root(y);\n\t\tif(x == y) return false;\n\t\tif(-dat[x] < -dat[y]) swap(x, y);\n\t\tdat[x] += dat[y];\n\t\tdat[y] = x;\n\t\treturn true;\n\t}\n};\n\nll modpow(ll x, ll n, ll md){\n\tll ret = 1 % md;\n\twhile(n > 0){\n\t\tif(n & 1) {ret *= x; ret %= md;}\n\t\tn >>= 1;\n\t\tx *= x;\n\t\tx %= md;\n\t}\n\tif(ret < 0) ret += abs(md);\n\treturn ret;\n}\n\nusing S = ll;\nusing F = ll; // +\nconstexpr ll e = INF;\nconstexpr ll id = 0LL;\nconstexpr ll replace_e = e;\nll op(ll a, ll b) {return min(a,b);}\nll mapping(F f, S s) {return S(f+s);}\nll composition(F f, F g) {return f+g;}\nstruct node {\n\tnode *l = nullptr;\n\tnode *r = nullptr;\n\tint lo, hi;\n\tll mset = e;\n\tll madd = id;\n\tll val = e;\n\tnode(int lo, int hi) : lo(lo), hi(hi) {}\n\tnode (vll& v, int lo, int hi) : lo(lo), hi(hi) {\n\t\tif(lo + 1 < hi) {\n\t\t\tint mid = lo + (hi - lo) / 2;\n\t\t\tl = new node (v, lo, mid);\n\t\t\tr = new node(v, mid, hi);\n\t\t\tval = op(l->val, r->val);\n\t\t}\n\t\telse {\n\t\t\tval = v[lo];\n\t\t}\n\t}\n\n\tS query(int L, int R) {\n\t\tif(R <= lo || hi <= L) return e;\n\t\tif(L <=lo && hi <= R) return val;\n\t\tpush();\n\t\treturn op(l->query(L, R), r->query(L,R));\n\t}\n\n\tvoid set(int L, int R, ll x) {\n\t\tif(R <= lo || hi <= L) return;\n\t\tif(L <= lo && hi <= R) mset = val = x, madd = id;\n\t\telse {\n\t\t\tpush(), l->set (L, R, x) , r->set(L,R,x);\n\t\t\tval = op(l->val, r->val);\n\t\t}\n\t}\n\n\tvoid add(int L, int R, ll x) {\n\t\tif(R <= lo || hi <= L) return;\n\t\tif(L <= lo && hi <= R) {\n\t\t\tif(mset != replace_e) mset = mapping(x, mset);\n\t\t\telse madd = composition(x, madd);\n\t\t\tval = mapping(x, val);\n\t\t} else {\n\t\t\tpush(), l->add(L, R, x), r->add(L, R, x);\n\t\t\tval = op(l->val, r->val);\n\t\t}\n\t}\n\n\tvoid push() {\n\t\tif(!l) {\n\t\t\tint mid = lo + (hi - lo) / 2;\n\t\t\tl = new node(lo, mid);\n\t\t\tr = new node(mid, hi);\n\t\t}\n\t\tif(mset != replace_e)\n\t\t\tl->set(lo, hi, mset), r->set(lo, hi, mset), mset = replace_e;\n\t\telse if(madd)\n\t\t\tl->add(lo, hi, madd), r->add(lo, hi, madd), madd = id;\n\t}\n};\n\nint solve(int n){\n\tll len; cin >> len;\n\tV<pair<ll, ll>> up_bonus;\n\tll largest_bonus = -INF;\n\trep(n) {\n\t\tll a, b; cin >> a >> b;\n\t\tll up = a - b;\n\t\tif(up > 0) {\n\t\t\tup_bonus.emplace_back(up, b);\n\t\t} else if(a > 0) {\n\t\t\tchmax(largest_bonus, a);\n\t\t}\n\t}\n\tvll criminals = {0LL};\n\trep(n) {\n\t\tll c;\n\t\tcin >> c; \n\t\tcriminals.push_back(criminals.back() + c);\n\t}\n\n\tsort(all(up_bonus));\n\treverse(all(up_bonus));\n\n\tvector<ll> s = {0};\n\tfor(auto [c, d] : up_bonus) {\n\t\ts.push_back(s.back() + c);\n\t}\n\n\tconst int plus_size = up_bonus.size();\n\tif(plus_size == 0) {\n\t\tif(len <= largest_bonus) return 1;\n\t\treturn -1;\n\t}\n\n\tvector<ll> tab = s;\n\ttab.front() = INF;\n\ttab.at(1) = INF;\n\n\trep(i, 2, int(tab.size())) {\n\t\ttab[i] -= criminals[i-1];\n\t}\n\n\tnode* rmq = new node(tab, 0, int(tab.size()));\n\n\tint ans = n + 10;\n\n\trep(i, plus_size) {\n\t\tauto [up, bonus] = up_bonus.at(i);\n\n\t\tif(i && s[i] <= criminals[i]) break;\n\t\tif(s[i] + largest_bonus >= len) chmin(ans, i + 1);\n\n\t\tconst int from_here = int(lower_bound(all(s), len - bonus) - s.begin());\n\t\tif(from_here == int(s.size())) continue;\n\t\tif(from_here <= i + 1) {chmin(ans, i + 1); continue;}\n\n\t\tif(rmq->query(i + 2, from_here + 1) <= up) continue;\n\n\t\tchmin(ans, from_here);\n\t}\n\n\tif(s.back() > criminals.back() && s.back() + largest_bonus >= len) chmin(ans, plus_size + 1);\n\n\tif(ans > n) return -1;\n\treturn ans;\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\tint n;\n\twhile(cin >> n && n) cout<< solve(n) << '\\n';\n}","accuracy":1,"time_ms":40,"memory_kb":19376,"score_of_the_acc":-1.4953,"final_rank":8},{"submission_id":"aoj_2785_7235723","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define foa(s, v) for(auto &s : v)\n#define all(v) v.begin(), v.end()\n#define REPname(a,b,c,d,...) d\n#define rep(...) REPname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP2(i,l,r) for(int i = l; i < r; i++)\n#define REP1(i, x) REP2(i,0,x)\n#define REP0(x) REP1(SPJ, x)\n#define sz(x) int(x.size())\n\ntemplate <class T>\nusing V=vector<T>;\n\ntemplate <class T>\nusing VV=vector<V<T>>;\n\ntemplate<class T>\nusing pqmin = priority_queue<T, V<T>, greater<T>>;\nusing ll = long long ;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = V<vll>;\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\ntemplate<class T>\ninline bool chmax(T &a, T b){\n\treturn a < b ? a=b, 1 : 0;\n}\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\treturn a > b ? a = b, 1 : 0;\n}\n\ntemplate <class T>\nvoid view(T x) {\n\tcerr << x;\n}\n\ntemplate <class T>\nvoid view(V<T> v) {\n\tcerr << \"{ \";\n\tfoa(t, v) {view(t) ; cerr << \", \";}\n\tcerr << \"}\";\n\tcerr << endl;\n}\n\n\ntemplate <class T>\nvoid view(VV<T> v) {\n\tcerr << \"{ \";\n\tfoa(t, v) {view(t) ; cerr << \",\\n\";}\n\tcerr << \"}\";\n\tcerr << endl;\n}\n\n\n// template <c0lass T>\nvoid view(int x) {\n\tcerr << x;\n}\n\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <class T>\nvoid debug_out(T x) {\n\tview(x);\n}\ntemplate <class H, class... T>\nvoid debug_out(H h, T... 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 << \"]\\n\"; \\\n\t} while(0)\n#else\n#define debug(...) (void(0))\n#endif\nusing vvi = V<vi>;\n\nstruct uf{\n\tvector<int> dat;\n\tuf(int n) : dat(n, -1) {}\n\tint root(int x) \n\t{\n\t\tint& p = dat[x];\n\t\tif(p < 0) return x;\n\t\treturn p = root(p);\n\t}\n\tbool merge(int x, int y) {\n\t\tx = root(x);\n\t\ty = root(y);\n\t\tif(x == y) return false;\n\t\tif(-dat[x] < -dat[y]) swap(x, y);\n\t\tdat[x] += dat[y];\n\t\tdat[y] = x;\n\t\treturn true;\n\t}\n};\n\nll modpow(ll x, ll n, ll md){\n\tll ret = 1 % md;\n\twhile(n > 0){\n\t\tif(n & 1) {ret *= x; ret %= md;}\n\t\tn >>= 1;\n\t\tx *= x;\n\t\tx %= md;\n\t}\n\tif(ret < 0) ret += abs(md);\n\treturn ret;\n}\n\nusing S = ll;\nusing F = ll; // +\nconstexpr ll e = INF;\nconstexpr ll id = 0LL;\nconstexpr ll replace_e = e;\nll op(ll a, ll b) {return min(a,b);}\nll mapping(F f, S s) {return S(f+s);}\nll composition(F f, F g) {return f+g;}\nstruct node {\n\tnode *l = nullptr;\n\tnode *r = nullptr;\n\tint lo, hi;\n\tll mset = e;\n\tll madd = id;\n\tll val = e;\n\tnode(int lo, int hi) : lo(lo), hi(hi) {}\n\tnode (vll& v, int lo, int hi) : lo(lo), hi(hi) {\n\t\tif(lo + 1 < hi) {\n\t\t\tint mid = lo + (hi - lo) / 2;\n\t\t\tl = new node (v, lo, mid);\n\t\t\tr = new node(v, mid, hi);\n\t\t\tval = op(l->val, r->val);\n\t\t}\n\t\telse {\n\t\t\tval = v[lo];\n\t\t}\n\t}\n\n\tS query(int L, int R) {\n\t\tif(R <= lo || hi <= L) return e;\n\t\tif(L <=lo && hi <= R) return val;\n\t\tpush();\n\t\treturn op(l->query(L, R), r->query(L,R));\n\t}\n\n\tvoid set(int L, int R, ll x) {\n\t\tif(R <= lo || hi <= L) return;\n\t\tif(L <= lo && hi <= R) mset = val = x, madd = id;\n\t\telse {\n\t\t\tpush(), l->set (L, R, x) , r->set(L,R,x);\n\t\t\tval = op(l->val, r->val);\n\t\t}\n\t}\n\n\tvoid add(int L, int R, ll x) {\n\t\tif(R <= lo || hi <= L) return;\n\t\tif(L <= lo && hi <= R) {\n\t\t\tif(mset != replace_e) mset = mapping(x, mset);\n\t\t\telse madd = composition(x, madd);\n\t\t\tval = mapping(x, val);\n\t\t} else {\n\t\t\tpush(), l->add(L, R, x), r->add(L, R, x);\n\t\t\tval = op(l->val, r->val);\n\t\t}\n\t}\n\n\tvoid push() {\n\t\tif(!l) {\n\t\t\tint mid = lo + (hi - lo) / 2;\n\t\t\tl = new node(lo, mid);\n\t\t\tr = new node(mid, hi);\n\t\t}\n\t\tif(mset != replace_e)\n\t\t\tl->set(lo, hi, mset), r->set(lo, hi, mset), mset = replace_e;\n\t\telse if(madd)\n\t\t\tl->add(lo, hi, madd), r->add(lo, hi, madd), madd = id;\n\t}\n};\n\nint solve(int n){\n\tll len; cin >> len;\n\tV<pair<ll, ll>> up_bonus;\n\tll largest_bonus = -1;\n\trep(n) {\n\t\tll a, b; cin >> a >> b;\n\t\tll up = a - b;\n\t\tif(up > 0) {\n\t\t\tup_bonus.emplace_back(up, b);\n\t\t} else if(a > 0) {\n\t\t\tchmax(largest_bonus, a);\n\t\t}\n\t}\n\tvll criminals = {0LL};\n\trep(n) {\n\t\tll c;\n\t\tcin >> c; \n\t\tcriminals.push_back(criminals.back() + c);\n\t}\n\n\tsort(all(up_bonus));\n\treverse(all(up_bonus));\n\n\tvector<ll> s = {0};\n\tfor(auto [c, d] : up_bonus) {\n\t\ts.push_back(s.back() + c);\n\t}\n\n\tconst int ss = int(s.size());\n\n\tvector<ll> tab = s;\n\tif(ss < 2) {\n\t\tif(len <= largest_bonus) return 1;\n\t\treturn -1;\n\t}\n\n\ttab.front() = INF;\n\ttab.at(1) = INF;\n\n\trep(i, 2, ss) {\n\t\ttab[i] -= criminals[i-1];\n\t}\n\n\tnode* rmq = new node(tab, 0, ss);\n\n\tint ans = n + 10;\n\n\trep(i, int(up_bonus.size())) {\n\t\tauto [up, bonus] = up_bonus.at(i);\n\n\t\tif(i && s[i] <= criminals[i]) break;\n\t\tif(s[i] + largest_bonus >= len) chmin(ans, i + 1);\n\n\t\tconst int from_here = int(lower_bound(all(s), len - bonus) - s.begin());\n\t\tif(from_here == ss) continue;\n\t\tif(from_here <= i + 1) {chmin(ans, i + 1); continue;}\n\n\t\tif(rmq->query(i + 2, from_here + 1) <= up) continue;\n\n\t\tchmin(ans, from_here);\n\t}\n\n\tif(ans > n) return -1;\n\treturn ans;\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\tint n;\n\twhile(cin >> n && n) cout<< solve(n) << '\\n';\n}","accuracy":0.9791666666666666,"time_ms":40,"memory_kb":19444,"score_of_the_acc":-1.5,"final_rank":10},{"submission_id":"aoj_2785_7176631","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}\n\nconst int mx = 1e9;\nconst ll inf = 1e18;\n\nstruct segtree {\n using S = ll; // 例\n S op(S a,S b) {return min(a,b);}\n S e() {return inf;}\n\n int n;\n vector<S> tree;\n segtree(int n) : n(n), tree(vector<S>(n*2, e())) {}\n\n void update(int pos,S val){\n pos += n; tree[pos] = val;\n while(pos > 1){\n tree[pos/2] = op(tree[pos], tree[pos^1]);\n pos /= 2;\n }\n }\n // [l,r)\n S query(int l, int r) {\n S sml = e(), smr = e();\n for(l += n, r += n; l < r; l >>= 1, r >>= 1){\n if(l%2) sml = op(sml, tree[l++]);\n if(r%2) smr = op(tree[--r], smr);\n }\n return op(sml,smr);\n }\n};\n\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n; cin >> n;\n ll L; cin >> L;\n vector<pair<ll,ll>> v(n);\n for (int i = 0; i < n; ++i) {\n ll a,b; cin >> a >> b;\n v[i] = {a-b, a};\n }\n sort(v.rbegin(), v.rend());\n\n vector<ll> c(n);\n for (int i = 0; i < n; ++i) {\n cin >> c[i];\n }\n int res = mx;\n // ソート順で使う場合\n {\n vector<ll> rmx(n);\n for (int i = n-1; i >= 0; --i) {\n rmx[i] = max(rmx[i], v[i].second);\n if(i+1 < n){\n rmx[i] = max(rmx[i], rmx[i+1]);\n }\n }\n ll ss = 0;\n ll cs = 0;\n if(rmx[0] >= L) res = 1;\n for (int i = 0; i < n - 1; ++i) {\n ss += v[i].first;\n cs += c[i];\n if(ss <= cs) break;\n if(ss + rmx[i+1] >= L){\n res = min(res, i+2);\n }\n }\n }\n // aでかいのを後回しにする場合\n {\n vector<ll> dif(n-1);\n for (int i = 0; i < n - 1; ++i) {\n dif[i] = v[i+1].first-c[i];\n }\n segtree seg(n-1);\n vector<ll> dsum(n);\n for (int i = 0; i < n - 1; ++i) {\n dsum[i+1] = dsum[i] + dif[i];\n seg.update(i, dsum[i+1]);\n }\n\n vector<ll> sum(n+1);\n for (int i = 0; i < n; ++i) {\n sum[i+1] = sum[i] + v[i].first;\n }\n ll ss = 0;\n ll cs = 0;\n for (int i = 0; i+1 < n; ++i) {\n // iを後回し\n int l = i-1, r = n;\n while(r-l > 1){\n int mid = (l+r)/2;\n ll u = sum[mid+1]-v[i].first+v[i].second;\n if(u >= L){\n r = mid;\n }\n else{\n l = mid;\n }\n }\n bool ok = true;\n if(r == n or r == i) ok = false;\n // 正当性確認\n if(ok){\n // [i,r)のdifの前から累積和の最小値を調べる\n ll pds = dsum[i];\n ll mi = seg.query(i,r);\n if(mi-pds+ss-cs > 0){\n res = min(res, r+1);\n }\n }\n // 次の更新\n {\n ss += v[i].first;\n cs += c[i];\n if(ss <= cs) break;\n }\n }\n }\n if(res == mx) res = -1;\n cout << res << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":9284,"score_of_the_acc":-0.6363,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2785_10946038\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define si(a) scanf(\\\"%d\\\",&a)\\n#define f first\\n#define s second\\n#define mp(a,b) make_pair(a,b)\\n#define MAX 100005\\n#define INF 1LL<<50\\ntypedef pair <int, int> Pii;\\n\\nstruct Less {\\n bool operator () (Pii a, Pii b) {\\n if ((a.f - a.s) == (b.f - b.s)) return a.f<b.f;\\n return (a.f-a.s)>(b.f-b.s);\\n }\\n}LL;\\n\\nvector<pair<long long,long long> > all;\\nint n,L,C[MAX];\\nlong long cumall[MAX],cumC[MAX],ttt[MAX];\\nbool allright[MAX];\\n\\nbool f(int x)\\n{\\n x--;\\n if(!x){\\n for(int i=0;i<n;i++)\\n if(all[i].f>=L)\\n return true;\\n return false;\\n }\\n int i;\\n ttt[x+1]=INF;\\n for(i=x;i>0;i--)\\n ttt[i]=min(ttt[i+1],cumall[i]-cumC[i-1]);\\n long long mx=0;\\n for(i=0;i<x;i++){\\n if(i && !allright[i-1])\\n continue;\\n long long nowmin=ttt[i+1];\\n nowmin-=(all[i].f-all[i].s);\\n if(nowmin<=0)\\n continue;\\n mx=max(mx,cumall[x]-(all[i].f-all[i].s)+all[i].f);\\n }\\n if(allright[x-1]){\\n for(i=x;i<n;i++)\\n mx=max(mx,cumall[x-1]+all[i].f);\\n }\\n return mx>=L;\\n}\\n\\nint main()\\n{\\n //freopen(\\\"input.txt\\\",\\\"r\\\",stdin);\\n int N,i;\\n long long mx=0;\\n si(N);si(L);\\n for(i=0;i<N;i++){\\n long long a,b;\\n scanf(\\\"%lld%lld\\\",&a,&b);\\n if(a<b){\\n mx=max(mx,a);\\n continue;\\n }\\n all.push_back(mp(a,b));\\n n++;\\n }\\n for(i=0;i<n;i++)si(C[i]);\\n sort(all.begin(),all.end(),LL);\\n cumall[0]=all[0].f-all[0].s;\\n cumC[0]=C[0];\\n allright[0]=(cumall[0]>cumC[0]);\\n for(i=1;i<n;i++){\\n cumall[i]=cumall[i-1]+(all[i].f-all[i].s);\\n cumC[i]=cumC[i-1]+C[i];\\n allright[i]=(cumall[i]>cumC[i]);\\n }\\n long long ans=INF;\\n if(mx){\\n if(mx>=L)ans=1;\\n else{\\n for(i=0;i<n;i++){\\n if(!allright[i])\\n break;\\n if(cumall[i]+mx>=L){\\n ans=i+2;\\n break;\\n }\\n }\\n }\\n }\\n int l=0,r=n;\\n if(f(r)){\\n while(r-l>1){\\n int mid=(l+r)>>1;\\n if(f(mid))r=mid;\\n else l=mid;\\n }\\n ans=min(ans,(long long)r);\\n }\\n if(ans==INF)printf(\\\"-1\\\\n\\\");\\n else\\n printf(\\\"%lld\\\\n\\\",ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7604,\n \"score_of_the_acc\": -0.3544,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2785_10691082\",\n \"code_snippet\": \"//\\n/*\\nID: kfoozmi1\\nLANG: C++\\nTASK:\\n*/\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef kfoozminus\\n#define dbg(args...) do {cerr << #args << \\\" : \\\"; faltu(args); } while(0)\\n\\nvoid faltu() {\\n\\tcerr << endl;\\n}\\n\\ntemplate <typename T>\\nvoid faltu(T a[], int n) {\\n\\tfor(int i = 0; i < n; ++i) cerr << a[i] << ' ';\\n\\tcerr << endl;\\n}\\n\\ntemplate <typename First, typename ... hello>\\nvoid faltu(First arg, const hello&... rest) {\\n\\tcerr << arg << ' ';\\n\\tfaltu(rest...);\\n}\\n#else\\n#define dbg(args...)\\n#endif\\n\\n#define PB push_back\\n#define F first\\n#define S second\\n#define MP make_pair\\n#define SQR(a) ((a) * (a))\\n#define vsort(v) sort(v.begin(), v.end())\\n#define memset(a, b) memset(a, b, sizeof a)\\n#define PQ priority_queue\\n#define PI acos(-1)\\n#define EPS 1e-9\\n\\n#define B1 43\\n#define B2 43\\n\\n#define MOD1 1000000007\\n#define MOD2 1000000009\\n#define MOD 1000000007\\n\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n\\n//int dx[] = {0, 0, +1, -1};\\n//int dy[] = {+1, -1, 0, 0};\\n//int dx[] = {+1, 0, -1, 0, +1, +1, -1, -1};\\n//int dy[] = {0, +1, 0, -1, +1, -1, +1, -1};\\n\\ninline bool checkBit(ll n, int i) { return n & (1LL << i); }\\ninline ll setBit(ll n, int i) { return n | (1LL << i); }\\ninline ll resetBit(ll n, int i) { return n & (~ (1LL << i)); }\\ninline bool EQ(double a, double b) { return fabs(a-b) < EPS; }\\ninline double dist(double ix, double iy, double jx, double jy) { return sqrt(SQR(ix - jx) + SQR(iy - jy)); }\\n\\n#define PMX 1000000\\n\\nint marked[PMX/64+2];\\n\\n#define mark(x) marked[x>>6] |= (1<<((x&63)>>1))\\n#define check(x) (marked[x>>6] & (1<<((x&63)>>1)))\\n\\nbool isPrime(int x)\\n{\\n return (x>1) && ((x==2) || ((x&1) && (!(check(x)))));\\n}\\n\\nvoid seive(int n)\\n{\\n int i, j;\\n for(i=3; i*i<=n; i+=2)\\n {\\n if(!check(i))\\n {\\n for(j=i*i; j<=n; j+=i<<1)\\n {\\n mark(j);\\n }\\n }\\n }\\n}\\n\\nll bigMod(ll a, ll b)\\n{\\n\\tll r = 1;\\n\\twhile(b) {\\n\\t\\tif(b & 1) (r *= a) %= MOD;\\n\\t\\tb >>= 1;\\n\\t\\t(a *= a) %= MOD;\\n\\t}\\n\\treturn r;\\n}\\n\\nll add(ll a, ll b)\\n{\\n\\tll ret = a + b;\\n\\tif(ret >= MOD) ret -= MOD;\\n\\treturn ret;\\n}\\n\\nll sub(ll a, ll b)\\n{\\n\\tll ret = a - b;\\n\\tif(ret < 0) ret += MOD;\\n\\treturn ret;\\n}\\n\\n#define INF 100000000\\n#define MX 100007\\n\\nint t[4 * MX], in[MX], shoja[MX], a[MX], b[MX], c[MX];\\nvector< pii > v;\\n\\nvoid update(int nd, int tl, int tr, int pos, int val)\\n{\\n\\tif(tl == tr) {\\n\\n\\t\\tt[nd] = val;\\n\\t\\treturn ;\\n\\t}\\n\\n\\tint tm = (tl + tr) >> 1;\\n\\tint lc = nd << 1;\\n\\tint rc = lc | 1;\\n\\n\\tif(pos <= tm) update(lc, tl, tm, pos, val);\\n\\telse update(rc, tm + 1, tr, pos, val);\\n\\n\\tt[nd] = min(t[lc], t[rc]);\\n}\\n\\nint query(int nd, int tl, int tr, int l, int r)\\n{\\n\\tif(tl >= l && tr <= r) return t[nd];\\n\\n\\tint tm = (tl + tr) >> 1;\\n\\tint lc = nd << 1;\\n\\tint rc = lc | 1;\\n\\n\\tif(r <= tm) return query(lc, tl, tm, l, r);\\n\\telse if(l > tm) return query(rc, tm + 1, tr, l, r);\\n\\telse return min(query(lc, tl, tm, l, r), query(rc, tm + 1, tr, l, r));\\n}\\n\\nint main()\\n{\\n#ifdef kfoozminus\\n\\t//freopen(\\\"in\\\", \\\"r\\\", stdin);\\n\\t//freopen(\\\"out\\\", \\\"w\\\", stdout);\\n#endif\\n\\tint L, _L, i, mn, mx, mid, p, n, midd, day;\\n\\n\\tscanf(\\\"%d %d\\\", &n, &L);\\n\\tfor(i = 1; i <= n; i ++) {\\n\\n\\t\\tscanf(\\\"%d %d\\\", &a[i], &b[i]);\\n\\t\\tif(a[i] > b[i]) v.PB({ a[i] - b[i], i} );\\n\\t\\telse in[i] = -1;\\n\\t}\\n\\tvsort(v);\\n\\treverse(v.begin(), v.end());\\n\\tint sz = v.size();\\n\\tfor(i = 0; i < sz; i ++) in[ v[i].S ] = i;\\n\\tfor(i = 1; i <= n; i ++) {\\n\\t\\t\\n\\t\\tscanf(\\\"%d\\\", &c[i]);\\n\\t\\tc[i] += c[i - 1];\\n\\t}\\n\\tfor(i = 1; i < sz; i ++) v[i].F += v[i - 1].F;\\n\\n\\tif(sz) shoja[0] = v[0].F - c[1];\\n\\tfor(i = 1; i < sz; i ++) {\\n\\n\\t\\tshoja[i] = min(shoja[i - 1], v[i].F - c[i + 1]);\\n\\t\\tupdate(1, 0, sz - 1, i, v[i].F - c[i]);\\n\\t\\tdbg(i, v[i].F - c[i]);\\n\\t}\\n\\tday = INF;\\n\\tfor(i = 1; i <= n; i ++) {\\n\\n\\t\\t_L = L - a[i];\\n\\t\\tif(_L <= 0) {\\n\\t\\t\\tday = 1;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tif(in[i] == -1) {\\n\\t\\t\\tif(sz < 1) continue;\\n\\t\\t\\tmn = 0;\\n\\t\\t\\tmx = sz - 1;\\n\\t\\t\\twhile(mn < mx) {\\n\\n\\t\\t\\t\\tmid = (mn + mx) >> 1;\\n\\t\\t\\t\\tif(v[mid].F < _L) mn = mid + 1;\\n\\t\\t\\t\\telse mx = mid;\\n\\t\\t\\t}\\n\\t\\t\\tif(v[mn].F < _L) continue;\\n\\t\\t\\tif(shoja[mn] > 0) day = min(day, mn + 2);\\n\\t\\t\\tdbg(i, mn + 1);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif(sz <= 1) continue;\\n\\t\\t\\tmn = 0;\\n\\t\\t\\tmx = sz - 2;\\n\\t\\t\\twhile(mn < mx) {\\n\\n\\t\\t\\t\\tmid = (mn + mx) >> 1;\\n\\t\\t\\t\\tif(mid >= in[i]) midd = mid + 1;\\n\\t\\t\\t\\telse midd = mid;\\n\\t\\t\\t\\tif(v[midd].F - (mid >= in[i]) * (a[i] - b[i]) < _L) mn = mid + 1;\\n\\t\\t\\t\\telse mx = mid;\\n\\t\\t\\t}\\n\\t\\t\\tif(v[mn + (mn >= in[i])].F - (mn >= in[i]) * (a[i] - b[i]) < _L) continue;\\n\\t\\t\\tmn += (mn >= in[i]);\\n\\n\\t\\t\\tif(mn < in[i]) {\\n\\t\\t\\t\\tif(shoja[mn] > 0) day = min(day, mn + 2);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tp = query(1, 0, sz - 1, in[i] + 1, mn);\\n\\t\\t\\t\\tif((shoja[ in[i] - 1] > 0) &&(p - (a[i] - b[i]) > 0)) day = min(day, mn + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\", day == INF ? -1: day);\\n return 0;\\n}\",\n \"accuracy\": 0.10416666666666667,\n \"time_ms\": 10,\n \"memory_kb\": 4868,\n \"score_of_the_acc\": 0,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2785_10691078\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define rep(i,n) for(i=1;i<=n;i++)\\n#define Rep(i,n) for(i=0;i<n;i++)\\n\\n#define mem(ara,val) memset(ara,val,sizeof(ara))\\n#define pb(x) push_back(x)\\n#define sz(x) x.size()\\n\\n#define INF 1000000000000000000ll\\n#define Max 200005\\n#define mod 1000000007\\n\\n#define si(x) scanf(\\\"%d\\\",&x)\\n#define sii(x,y) scanf(\\\"%d %d\\\",&x,&y)\\n#define siii(x,y,z) scanf(\\\"%d %d %d\\\",&x,&y,&z)\\n\\n#define sl(x) scanf(\\\"%lld\\\",&x)\\n#define sll(x,y) scanf(\\\"%lld %lld\\\",&x,&y)\\n#define slll(x,y,z) scanf(\\\"%lld %lld %lld\\\",&x,&y,&z)\\n\\n#define FI freopen(\\\"in.txt\\\",\\\"r\\\",stdin)\\n\\nusing namespace std;\\n\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\n\\nstruct info\\n{\\n LL h,d;\\n info() {}\\n info(LL _h,LL _d) {\\n h = _h;\\n d = _d;\\n }\\n bool operator < (const info & p) const\\n {\\n if(d == p.d)return h < p.h;\\n else return d > p.d;\\n }\\n};\\ninfo ara[Max];\\nLL n,need[Max],L;\\n\\n/// brute\\nLL brute()\\n{\\n LL i,mn = INF;\\n for(LL flag=1;flag<=n;flag++)\\n {\\n LL tot = 0,cnt = 0;\\n LL reach = L - ara[flag].h;\\n LL done = 0;\\n\\n if(reach <= 0)\\n {\\n mn = min(mn,1ll);\\n continue;\\n }\\n\\n rep(i,n)\\n {\\n if(i == flag)continue;\\n cnt++;\\n tot += ara[i].d;\\n if(tot < need[cnt])break;\\n if(tot >= reach)\\n {\\n done = 1;\\n break;\\n }\\n }\\n if(done)\\n {\\n mn = min(mn,cnt+1);\\n }\\n }\\n return mn;\\n}\\n///brute\\n\\n\\n\\n\\nLL afford[Max],cum[Max],good,sat;\\nLL tree[4*Max];\\n\\nvoid init(LL ind,LL b,LL e)\\n{\\n if(b == e)\\n {\\n tree[ind] = afford[b];\\n return;\\n }\\n LL mid = (b + e) / 2,l = 2 * ind,r = l + 1;\\n init(l,b,mid);\\n init(r,mid+1,e);\\n tree[ind] = min(tree[l],tree[r]);\\n}\\n\\nLL Q(LL ind,LL b,LL e,LL i,LL j)\\n{\\n if(i > j)return INF;\\n if(b == i && e == j)return tree[ind];\\n LL mid = (b + e) / 2,l = 2 * ind,r = l + 1;\\n return min( Q(l,b,mid,i,min(mid,j)) , Q(r,mid+1,e,max(mid+1,i),j) );\\n}\\n\\nLL bin(LL x)\\n{\\n LL low = 1,high = sat,mid,ans = -1;\\n while( low <= high )\\n {\\n mid = (low + high) / 2;\\n if(cum[mid] >= x)\\n {\\n ans = mid;\\n high = mid - 1;\\n }\\n else low = mid + 1;\\n }\\n return ans;\\n}\\n\\nLL F()\\n{\\n LL i,f = 0;\\n rep(i,n)\\n {\\n if(ara[i].d <= 0)break;\\n good = i;\\n cum[i] = cum[i-1] + ara[i].d;\\n afford[i] = cum[i] - need[i-1];\\n if(!f)\\n {\\n sat = i;\\n if(cum[i] < need[i])f = 1;\\n }\\n }\\n if(sat)init(1,1,sat);\\n\\n LL ret = INF;\\n rep(i,sat)\\n {\\n LL delta = ara[i].d;\\n LL jump = ara[i].h;\\n LL pos = bin( L - jump + delta );\\n if( pos == -1 )continue;\\n LL rmq = INF;\\n if(sat)rmq = Q(1,1,sat,i+1,pos);\\n if(rmq < delta)continue;\\n //if(i == 5)printf(\\\"pos %lld rmq %lld delta %lld\\\\n\\\",pos,rmq,delta);\\n LL day = pos;\\n if(pos < i)day++;\\n //if(day == 1)printf(\\\"i %lld\\\\n\\\",i);\\n ret = min(ret,day);\\n }\\n\\n for(i=sat+1;i<=n;i++)\\n {\\n LL jump = ara[i].h;\\n LL pos = bin( L - jump );\\n if(pos == -1)continue;\\n LL day = pos + 1;\\n ret = min(ret,day);\\n }\\n\\n return ret;\\n}\\n\\nint main()\\n{\\n\\n //srand( time(0) );\\n //FI;\\n LL i,x,y;\\n sll(n,L);\\n rep(i,n)\\n {\\n sll(x,y);\\n ara[i] = info(x,x-y);\\n }\\n need[0] = 1;\\n rep(i,n)\\n {\\n sl(x);\\n need[i] = need[i-1] + x;\\n }\\n\\n /*n = 10000;\\n L = rand() % 10000 + 1;\\n rep(i,n)\\n {\\n x = rand() % 30 + 1;\\n y = rand() % 60 + 1;\\n ara[i] = info(x,x-y);\\n }\\n\\n rep(i,n)\\n {\\n x = rand() % 5 + 1;\\n need[i] = need[i-1] + x;\\n }*/\\n\\n sort(ara+1,ara+n+1);\\n\\n LL ret = F();\\n if(ret == INF)ret = -1;\\n printf(\\\"%lld\\\\n\\\",ret);\\n //printf(\\\"brute %lld\\\\n\\\",brute());\\n //printf(\\\"my %lld\\\\n\\\",F());\\n return 0;\\n}\",\n \"accuracy\": 0.8333333333333334,\n \"time_ms\": 30,\n \"memory_kb\": 13936,\n \"score_of_the_acc\": -0.9555,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2785_10691076\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i,n) for(i = 0; i<n; i++)\\n#define repl(i,n) for(i = 1; i<=n; i++)\\n\\n#define sz(x) (int)x.size()\\n#define pb push_back\\n#define all(x) x.begin(), x.end()\\n#define uu first\\n#define vv second\\n#define mem(x,y) memset(x,y,sizeof(x))\\n#define sdi(x) scanf(\\\"%d\\\",&x)\\n#define sdii(x,y) scanf(\\\"%d %d\\\",&x,&y)\\n#define sdiii(x,y,z) scanf(\\\"%d %d %d\\\",&x,&y,&z)\\n#define sdl(x) scanf(\\\"%lld\\\",&x)\\n#define sdll(x,y) scanf(\\\"%lld %lld\\\",&x,&y)\\n#define sdlll(x,y,z) scanf(\\\"%lld %lld %lld\\\",&x,&y,&z)\\n#define sds(x) scanf(\\\"%s\\\",s);\\n#define pfi(x) printf(\\\"%d\\\\n\\\",x)\\n#define pfii(x,y) printf(\\\"%d %d\\\\n\\\",x,y)\\n#define pfiii(x,y,z) printf(\\\"%d %d %d\\\\n\\\",x,y,z)\\n#define pfl(x) printf(\\\"%lld\\\\n\\\",x)\\n#define pfll(x,y) printf(\\\"%lld %lld\\\\n\\\",x,y)\\n#define pflll(x,y,z) printf(\\\"%lld %lld %lld\\\\n\\\",x,y,z)\\n\\n#define eps 1e-9\\n//#define OK cerr<< \\\"OK\\\" << '\\\\n'\\n//#define DB(x) cerr << #x \\\" = \\\" << x << '\\\\n'\\n\\n#define FRE(i,a,b) for(i = a; i<=b; i++)\\n#define FRL(i,a,b) for(i = a; i<b; i++)\\n#define un(x) x.erase(unique(all(x)),x.end())\\n#define sf(x) scanf(\\\"%d\\\",&x)\\n#define sff(x,y) scanf(\\\"%d %d\\\",&x,&y)\\n#define sfff(x,y,z) scanf(\\\"%d %d %d\\\",&x,&y,&z)\\n#define sl(x) scanf(\\\"%lld\\\",&x)\\n#define sll(x,y) scanf(\\\"%lld %lld\\\",&x,&y)\\n#define slll(x,y,z) scanf(\\\"%lld %lld %lld\\\",&x,&y,&z)\\n#define D(x) cerr << #x \\\" = \\\" << x << '\\\\n'\\n#define DBG cerr << \\\"Hi\\\" << '\\\\n'\\n#define PI acose(-1.00)\\n#define xx first\\n#define yy second\\n\\ntypedef double db;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef pair<int,int> pii;\\ntypedef pair<long long,long long> pll;\\n\\ninline int setBit(int N, int pos) { return N=N|(1<<pos);}\\ninline int resetBit(int N, int pos) {return N=N &~(1<<pos);}\\ninline bool checkBit(int N, int pos) {return (bool) (N & (1<<pos));}\\n\\n\\n//int fx[] = {+0, +0, +1, -1, +1, -1, +1};\\n//int fy[] = {-1, +1, +0, +0, +1, -1, -1};\\n\\n\\nconst int MAX = 100005;\\nint n, ub;\\nLL c[MAX], cumDelta[MAX], cumC[MAX], tree[MAX*4], l;\\nstruct data {\\n int a, b;\\n inline bool operator < (const data &p) const {\\n return ((a-b) > (p.a-p.b));\\n }\\n} arr[MAX];\\n\\nvoid init(int node, int beg, int endd) {\\n if(beg == endd) {\\n tree[node] = cumDelta[beg] - cumC[beg];\\n return;\\n }\\n\\n int left = node << 1;\\n int right = left + 1;\\n int mid = (beg+endd) >> 1;\\n\\n init(left, beg, mid);\\n init(right, mid+1, endd);\\n\\n tree[node] = min(tree[left], tree[right]);\\n}\\n\\nvoid update(int node, int beg, int endd, int x, LL val) {\\n if(beg == endd) {\\n tree[node] += val;\\n return;\\n }\\n\\n int left = node << 1;\\n int right = left + 1;\\n int mid = (beg+endd) >> 1;\\n\\n if(x <= mid) update(left, beg, mid, x, val);\\n else update(right, mid+1, endd, x, val);\\n\\n tree[node] = min(tree[left], tree[right]);\\n}\\n\\nLL query(int node, int beg, int endd, int x, int y) {\\n if(x > y) return LLONG_MAX;\\n if(beg == x && endd == y) return tree[node];\\n\\n int left = node << 1;\\n int right = left + 1;\\n int mid = (beg+endd) >> 1;\\n\\n LL l = query(left, beg, mid, x, min(y, mid));\\n LL r = query(right, mid+1, endd, max(x, mid+1), y);\\n\\n return min(l, r);\\n}\\n\\ninline int bs(int idx) {\\n int low=1, high=ub, mid, ret=n+5;\\n while(low <= high) {\\n mid = (low+high) >> 1;\\n LL x = cumDelta[mid];\\n if(mid >= idx) x -= (arr[idx].a - arr[idx].b);\\n if(x >= l - arr[idx].a) {\\n ret = min(ret, mid);\\n high = mid-1;\\n }\\n else low = mid+1;\\n }\\n return ret;\\n}\\n\\ninline int check(int idx) {\\n update(1, 1, n, idx, -cumDelta[idx]);\\n if(idx < n) update(1, 1, n, idx, cumDelta[idx+1]);\\n if(arr[idx].a >= l) return 1;\\n int here = bs(idx);\\n// DB(here);\\n if(here > n) return here;\\n if(query(1, 1, n, 1, here) >= 0ll) {\\n if(idx > here) here++;\\n return here;\\n }\\n else return n+5;\\n}\\n\\nint solve() {\\n int ret = n+5, i;\\n for(i=n; i>=1; i--) {\\n int x = check(i);\\n// DB(x);\\n ret = min(ret, x);\\n }\\n if(ret > n) return -1;\\n else return ret;\\n}\\n\\nint main() {\\n// freopen(\\\"in.txt\\\", \\\"r\\\", stdin);\\n// freopen(\\\"out.txt\\\", \\\"w\\\", stdout);\\n\\n int i;\\n\\n sdi(n);\\n sdl(l);\\n repl(i, n) sdll(arr[i].a, arr[i].b);\\n repl(i, n) sdl(c[i]);\\n\\n sort(arr+1, arr+1+n);\\n ub = 0;\\n repl(i, n) {\\n if(arr[i].a >= arr[i].b) ub = i;\\n }\\n repl(i, n) {\\n cumDelta[i] = cumDelta[i-1];\\n cumDelta[i] += (arr[i].a - arr[i].b);\\n }\\n repl(i, n) {\\n cumC[i] = cumC[i-1];\\n cumC[i] += c[i];\\n }\\n\\n// repl(i, n) pfll(arr[i].a, arr[i].b); puts(\\\"----------\\\");\\n// repl(i, n) pfl(c[i]);\\n\\n init(1, 1, n);\\n pfi(solve());\\n\\n return 0;\\n}\",\n \"accuracy\": 0.7291666666666666,\n \"time_ms\": 40,\n \"memory_kb\": 9788,\n \"score_of_the_acc\": -0.8375,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2785_10493893\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing i64 = long long;\\n#define rep(i,n) for(i64 i=0; i<i64(n); i++)\\n\\nstruct RMQ{\\n i64 N;\\n vector<i64> A;\\n RMQ(vector<i64> a = {}){\\n N = 1; while(N < i64(a.size())) N*=2;\\n A.assign(N*2, 1ll<<60);\\n rep(i,a.size()) A[N+i] = a[i];\\n for(i64 i=N-1; i>=1; i--) A[i] = min(A[i*2], A[i*2+1]);\\n }\\n i64 query(i64 l, i64 r){\\n l += N; r += N;\\n i64 res = 1ll << 60;\\n while(l < r){\\n if(l%2) res = min(res, A[l++]);\\n if(r%2) res = min(res, A[--r]);\\n l /= 2; r /= 2;\\n }\\n return res;\\n }\\n};\\n\\nbool nachia = false;\\n\\ni64 solve(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\\n i64 ans = N+1;\\n sort(A.rbegin(), A.rend());\\n vector<i64> K(N+1); rep(i,N) K[i+1] = K[i] + C[i];\\n\\n vector<i64> D(N+1);\\n rep(i,N) D[i+1] = D[i] + A[i].first;\\n i64 cap_straight = 0;\\n while(cap_straight < N && D[cap_straight+1] > K[cap_straight+1]) cap_straight++;\\n\\n vector<i64> capdiff(N);\\n rep(i,N) capdiff[i] = D[i+1] - K[i];\\n auto ds = RMQ(capdiff);\\n\\n if(nachia){\\n cout << \\\"D = \\\"; for(auto d : D){ cout << d << \\\" \\\"; } cout << endl;\\n cout << \\\"cap = \\\"; for(auto d : capdiff){ cout << d << \\\" \\\"; } cout << endl;\\n }\\n\\n i64 maxDi = max_element(D.begin(), D.end()) - D.begin();\\n\\n rep(f,N){\\n if(nachia) cout << \\\"f = \\\" << f << endl;\\n if(f >= maxDi || D[f] + A[f].second >= L){\\n if(nachia) cout << \\\" case A\\\" << endl;\\n if(D[maxDi] + A[f].second < L) continue;\\n i64 t = lower_bound(D.begin(), D.begin() + maxDi + 1, L-A[f].second) - D.begin();\\n if(cap_straight < t) continue;\\n t += 1;\\n if(nachia) cout << \\\" ok t = \\\" << t << endl;\\n if(t < ans) ans = t;\\n continue;\\n }\\n if(nachia) cout << \\\" case B\\\" << endl;\\n if(cap_straight < f) continue;\\n i64 offset = A[f].second - A[f].first;\\n i64 loss = A[f].first;\\n if(D[maxDi] + offset < L) continue;\\n i64 g = lower_bound(D.begin(), D.begin() + maxDi + 1, L-offset) - D.begin();\\n i64 cap = ds.query(f+1, g);\\n if(nachia){ cout << \\\" query : \\\"; for(int i=f+1; i<g; i++){ cout <<capdiff[i] << \\\" \\\"; } cout << endl; }\\n if(nachia){ cout << \\\" offset = \\\" << offset << \\\" , g = \\\" << g << \\\" , cap = \\\" << cap << endl; }\\n if(cap <= loss) continue;\\n if(g < ans) ans = g;\\n }\\n \\n if(ans == N+1) return -1;\\n return ans;\\n}\\n\\ni64 naive(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\\n i64 ans = N+1;\\n sort(A.rbegin(), A.rend());\\n rep(f,N){\\n i64 a = 0, c = 0;\\n i64 t = 0;\\n rep(j,N) if(j != f){\\n if(A[f].second + a >= L) break;\\n a += A[j].first;\\n c += C[t];\\n t++;\\n if(a <= c){ t = -1; break; }\\n }\\n if(t < 0) continue;\\n if(A[f].second + a >= L){\\n i64 k = t + 1;\\n if(k < ans) ans = k;\\n }\\n }\\n return ans > N ? -1 : ans;\\n}\\n\\n\\nvoid testcase(){\\n i64 N; cin >> N;\\n i64 L; cin >> L;\\n vector<pair<i64,i64>> A(N);\\n rep(i,N){\\n i64 a,b; cin >> a >> b;\\n A[i] = { a-b, a };\\n }\\n vector<i64> C(N); rep(i,N) cin >> C[i];\\n i64 ans = solve(N, L, A, C);\\n cout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n testcase();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 13060,\n \"score_of_the_acc\": -0.7287,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2785_10492640\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing i64 = long long;\\n#define rep(i,n) for(i64 i=0; i<i64(n); i++)\\n\\nstruct RMQ{\\n i64 N;\\n vector<i64> A;\\n RMQ(vector<i64> a = {}){\\n N = 1; while(N < i64(a.size())) N*=2;\\n A.assign(N*2, 1ll<<60);\\n rep(i,a.size()) A[N+i] = a[i];\\n for(i64 i=N-1; i>=1; i--) A[i] = min(A[i*2], A[i*2+1]);\\n }\\n i64 query(i64 l, i64 r){\\n l += N; r += N;\\n i64 res = 1ll << 60;\\n while(l < r){\\n if(l%2) res = min(res, A[l++]);\\n if(r%2) res = min(res, A[--r]);\\n l /= 2; r /= 2;\\n }\\n return res;\\n }\\n};\\n\\nbool nachia = false;\\n\\ni64 solve(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\\n i64 ans = N+1;\\n sort(A.rbegin(), A.rend());\\n vector<i64> K(N+1); rep(i,N) K[i+1] = K[i] + C[i];\\n\\n vector<i64> D(N+1);\\n rep(i,N) D[i+1] = D[i] + A[i].first;\\n i64 cap_straight = 0;\\n while(cap_straight < N && D[cap_straight+1] > K[cap_straight+1]) cap_straight++;\\n\\n vector<i64> capdiff(N);\\n rep(i,N) capdiff[i] = D[i+1] - K[i];\\n auto ds = RMQ(capdiff);\\n\\n if(nachia){\\n cout << \\\"D = \\\"; for(auto d : D){ cout << d << \\\" \\\"; } cout << endl;\\n cout << \\\"cap = \\\"; for(auto d : capdiff){ cout << d << \\\" \\\"; } cout << endl;\\n }\\n\\n i64 maxDi = max_element(D.begin(), D.end()) - D.begin();\\n\\n rep(f,N){\\n if(nachia) cout << \\\"f = \\\" << f << endl;\\n if(f >= maxDi || D[f] >= L){\\n if(nachia) cout << \\\" case A\\\" << endl;\\n i64 t = lower_bound(D.begin(), D.begin() + maxDi + 1, L-A[f].second) - D.begin();\\n if(cap_straight < t) continue;\\n t += 1;\\n if(t < ans) ans = t;\\n continue;\\n }\\n if(nachia) cout << \\\" case B\\\" << endl;\\n if(cap_straight < f) continue;\\n i64 offset = A[f].second - A[f].first;\\n if(D[maxDi] + offset < L) continue;\\n i64 g = lower_bound(D.begin(), D.begin() + maxDi + 1, L-offset) - D.begin();\\n i64 cap = ds.query(f, g);\\n if(nachia) cout << \\\" offset = \\\" << offset << \\\" , g = \\\" << g << \\\" , cap = \\\" << cap << endl;\\n if(cap < offset) continue;\\n if(g < ans) ans = g;\\n }\\n \\n if(ans == N+1) return -1;\\n return ans;\\n}\\n\\nvoid testcase(){\\n i64 N; cin >> N;\\n i64 L; cin >> L;\\n vector<pair<i64,i64>> A(N);\\n rep(i,N){\\n i64 a,b; cin >> a >> b;\\n A[i] = { a-b, a };\\n }\\n vector<i64> C(N); rep(i,N) cin >> C[i];\\n i64 ans = solve(N, L, A, C);\\n cout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n testcase();\\n return 0;\\n}\",\n \"accuracy\": 0.6041666666666666,\n \"time_ms\": 20,\n \"memory_kb\": 12968,\n \"score_of_the_acc\": -0.7224,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2785_10492625\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing i64 = long long;\\n#define rep(i,n) for(i64 i=0; i<i64(n); i++)\\n\\nstruct RMQ{\\n i64 N;\\n vector<i64> A;\\n RMQ(vector<i64> a = {}){\\n N = 1; while(N < i64(a.size())) N*=2;\\n A.assign(N*2, 1ll<<60);\\n rep(i,a.size()) A[N+i] = a[i];\\n for(i64 i=N-1; i>=1; i--) A[i] = min(A[i*2], A[i*2+1]);\\n }\\n i64 query(i64 l, i64 r){\\n l += N; r += N;\\n i64 res = 1ll << 60;\\n while(l < r){\\n if(l%2) res = min(res, A[l++]);\\n if(r%2) res = min(res, A[--r]);\\n l /= 2; r /= 2;\\n }\\n return res;\\n }\\n};\\n\\nbool nachia = false;\\n\\ni64 solve(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\\n i64 ans = N+1;\\n sort(A.rbegin(), A.rend());\\n vector<i64> K(N+1); rep(i,N) K[i+1] = K[i] + C[i];\\n\\n vector<i64> D(N+1);\\n rep(i,N) D[i+1] = D[i] + A[i].first;\\n i64 cap_straight = 0;\\n while(cap_straight < N && D[cap_straight+1] >= K[cap_straight+1]) cap_straight++;\\n\\n vector<i64> capdiff(N);\\n rep(i,N) capdiff[i] = D[i+1] - K[i];\\n auto ds = RMQ(capdiff);\\n\\n if(nachia){\\n cout << \\\"D = \\\"; for(auto d : D){ cout << d << \\\" \\\"; } cout << endl;\\n cout << \\\"cap = \\\"; for(auto d : capdiff){ cout << d << \\\" \\\"; } cout << endl;\\n }\\n\\n i64 maxDi = max_element(D.begin(), D.end()) - D.begin();\\n\\n rep(f,N){\\n if(nachia) cout << \\\"f = \\\" << f << endl;\\n if(f >= maxDi || D[f] >= L){\\n if(nachia) cout << \\\" case A\\\" << endl;\\n i64 t = lower_bound(D.begin(), D.begin() + maxDi + 1, L-A[f].second) - D.begin();\\n if(cap_straight < t) continue;\\n t += 1;\\n if(t < ans) ans = t;\\n continue;\\n }\\n if(nachia) cout << \\\" case B\\\" << endl;\\n if(cap_straight < f) continue;\\n i64 offset = A[f].second - A[f].first;\\n if(D[maxDi] + offset < L) continue;\\n i64 g = lower_bound(D.begin(), D.begin() + maxDi + 1, L-offset) - D.begin();\\n i64 cap = ds.query(f, g);\\n if(nachia) cout << \\\" offset = \\\" << offset << \\\" , g = \\\" << g << \\\" , cap = \\\" << cap << endl;\\n if(cap < offset) continue;\\n if(g < ans) ans = g;\\n }\\n \\n if(ans == N+1) return -1;\\n return ans;\\n}\\n\\nvoid testcase(){\\n i64 N; cin >> N;\\n i64 L; cin >> L;\\n vector<pair<i64,i64>> A(N);\\n rep(i,N){\\n i64 a,b; cin >> a >> b;\\n A[i] = { a-b, a };\\n }\\n vector<i64> C(N); rep(i,N) cin >> C[i];\\n i64 ans = solve(N, L, A, C);\\n cout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n testcase();\\n return 0;\\n}\",\n \"accuracy\": 0.6041666666666666,\n \"time_ms\": 20,\n \"memory_kb\": 12964,\n \"score_of_the_acc\": -0.7221,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2785_10492612\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing i64 = long long;\\n#define rep(i,n) for(i64 i=0; i<i64(n); i++)\\n\\nstruct RMQ{\\n i64 N;\\n vector<i64> A;\\n RMQ(vector<i64> a = {}){\\n N = 1; while(N < i64(a.size())) N*=2;\\n A.assign(N*2, 1ll<<60);\\n rep(i,a.size()) A[N+i] = a[i];\\n for(i64 i=N-1; i>=1; i--) A[i] = min(A[i*2], A[i*2+1]);\\n }\\n i64 query(i64 l, i64 r){\\n l += N; r += N;\\n i64 res = 1ll << 60;\\n while(l < r){\\n if(l%2) res = min(res, A[l++]);\\n if(r%2) res = min(res, A[--r]);\\n l /= 2; r /= 2;\\n }\\n return res;\\n }\\n};\\n\\nbool nachia = false;\\n\\ni64 solve(i64 N, i64 L, vector<pair<i64,i64>> A, vector<i64> C){\\n i64 ans = N+1;\\n sort(A.rbegin(), A.rend());\\n vector<i64> K(N+1); rep(i,N) K[i+1] = K[i] + C[i];\\n\\n vector<i64> D(N+1);\\n rep(i,N) D[i+1] = D[i] + A[i].first;\\n i64 cap_straight = 0;\\n while(cap_straight < N && D[cap_straight+1] >= K[cap_straight]) cap_straight++;\\n\\n vector<i64> capdiff(N);\\n rep(i,N) capdiff[i] = D[i+1] - K[i];\\n auto ds = RMQ(capdiff);\\n\\n if(nachia){\\n cout << \\\"D = \\\"; for(auto d : D){ cout << d << \\\" \\\"; } cout << endl;\\n cout << \\\"cap = \\\"; for(auto d : capdiff){ cout << d << \\\" \\\"; } cout << endl;\\n }\\n\\n i64 maxDi = max_element(D.begin(), D.end()) - D.begin();\\n\\n rep(f,N){\\n if(nachia) cout << \\\"f = \\\" << f << endl;\\n if(f >= maxDi || D[f] >= L){\\n if(nachia) cout << \\\" case A\\\" << endl;\\n i64 t = lower_bound(D.begin(), D.begin() + maxDi + 1, L-A[f].second) - D.begin();\\n if(cap_straight < t) continue;\\n t += 1;\\n if(t < ans) ans = t;\\n continue;\\n }\\n if(nachia) cout << \\\" case B\\\" << endl;\\n if(cap_straight < f) continue;\\n i64 offset = A[f].second - A[f].first;\\n if(D[maxDi] + offset < L) continue;\\n i64 g = lower_bound(D.begin(), D.begin() + maxDi + 1, L-offset) - D.begin();\\n i64 cap = ds.query(f, g);\\n if(nachia) cout << \\\" offset = \\\" << offset << \\\" , g = \\\" << g << \\\" , cap = \\\" << cap << endl;\\n if(cap < offset) continue;\\n if(g < ans) ans = g;\\n }\\n \\n if(ans == N+1) return -1;\\n return ans;\\n}\\n\\nvoid testcase(){\\n i64 N; cin >> N;\\n i64 L; cin >> L;\\n vector<pair<i64,i64>> A(N);\\n rep(i,N){\\n i64 a,b; cin >> a >> b;\\n A[i] = { a-b, a };\\n }\\n vector<i64> C(N); rep(i,N) cin >> C[i];\\n i64 ans = solve(N, L, A, C);\\n cout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n testcase();\\n return 0;\\n}\",\n \"accuracy\": 0.6041666666666666,\n \"time_ms\": 20,\n \"memory_kb\": 13004,\n \"score_of_the_acc\": -0.7248,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2785_10295856\",\n \"code_snippet\": \"// AOJ #2785 Escape from the Hell\\n// 2025.3.14\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll INF = LLONG_MAX;\\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(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\\tpc('\\\\n');\\n}\\n\\nstruct Drink { ll a, b; };\\n\\nint solve(){\\n int N = Cin();\\n ll L = Cin();\\n\\n vector<Drink> dArr(N);\\n priority_queue< pair<ll,int> > pqA;\\n priority_queue< pair<ll,int> > pqB;\\n\\n vector< pair<ll,int> > ord;\\n for(int i = 0; i < N; i++){\\n dArr[i].a = Cin(), dArr[i].b = Cin();\\n ord.push_back({dArr[i].a - dArr[i].b, i});\\n pqA.push({dArr[i].a, i});\\n }\\n vector<ll> C(N);\\n for(int i = 0; i < N; i++) C[i] = Cin();\\n\\n sort(ord.begin(), ord.end(), [&dArr](auto &p, auto &q) {\\n return (p.first == q.first) ? (dArr[p.second].b < dArr[q.second].b) : (p.first > q.first);\\n });\\n\\n vector<ll> usedDay(N, INF);\\n ll myH = 0;\\n ll enemyH = 0;\\n int delPtr = 0;\\n\\n if(!pqA.empty() && pqA.top().first >= L) return 1;\\n\\n for(int i = 0; i < N; i++){\\n while(!pqA.empty() && usedDay[pqA.top().second] < i) pqA.pop();\\n if(!pqA.empty() && myH + pqA.top().first >= L) return i+1;\\n\\n int curIdx = ord[i].second;\\n ll delta = ord[i].first;\\n myH += delta;\\n\\n pqB.push({ dArr[curIdx].b, curIdx });\\n\\n while(delPtr < i && myH - ord[delPtr].first <= enemyH) delPtr++;\\n\\n while(!pqB.empty() && usedDay[pqB.top().second] < delPtr) pqB.pop();\\n\\n if(!pqB.empty() && myH + pqB.top().first >= L) return i+1;\\n\\n usedDay[curIdx] = i;\\n enemyH += C[i];\\n if(enemyH >= myH) return -1;\\n }\\n return -1;\\n}\\n\\nint main() {\\n Cout(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 12276,\n \"score_of_the_acc\": -0.6749,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2785_10295768\",\n \"code_snippet\": \"// AOJ #2785 Escape from the Hell\\n// 2025.3.14\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nstruct Dr { ll A, B, d; };\\n\\nstruct Seg {\\n int n;\\n vector<ll> seg;\\n Seg(int n): n(n) {\\n seg.assign(2*n, 0);\\n }\\n void build(const vector<ll>& arr) {\\n for (int i = 0; i < n; i++) seg[n+i] = arr[i];\\n for (int i = n-1; i > 0; i--) seg[i] = max(seg[2*i], seg[2*i+1]);\\n }\\n ll qry(int l, int r) {\\n ll res = 0;\\n l += n; r += n;\\n while(l <= r){\\n if(l % 2 == 1){ res = max(res, seg[l]); l++; }\\n if(r % 2 == 0){ res = max(res, seg[r]); r--; }\\n l /= 2; r /= 2;\\n }\\n return res;\\n }\\n};\\n\\nbool cmp(const Dr &p, const Dr &q){\\n if(p.d == q.d) return p.B < q.B;\\n return p.d > q.d;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n int n; ll L;\\n cin >> n >> L;\\n vector<Dr> v(n);\\n for (int i = 0; i < n; i++){\\n cin >> v[i].A >> v[i].B;\\n v[i].d = v[i].A - v[i].B;\\n }\\n vector<ll> C(n);\\n for (int i = 0; i < n; i++) cin >> C[i];\\n\\n sort(v.begin(), v.end(), cmp);\\n\\n vector<ll> suf(n);\\n suf[n-1] = v[n-1].A;\\n for (int i = n-2; i >= 0; i--) suf[i] = max(v[i].A, suf[i+1]);\\n\\n vector<ll> arr(n);\\n for (int i = 0; i < n; i++) arr[i] = v[i].B;\\n\\n Seg segt(n);\\n segt.build(arr);\\n\\n vector<ll> S(n+1, 0);\\n for (int i = 1; i <= n; i++) S[i] = S[i-1] + v[i-1].d;\\n vector<ll> M(n+1, 0);\\n for (int i = 1; i <= n; i++) M[i] = M[i-1] + C[i-1];\\n\\n if(n >= 1 && suf[0] >= L){\\n cout << 1 << endl;\\n return 0;\\n }\\n\\n int ans = -1;\\n ll mn = LLONG_MAX;\\n for (int d = 2; d <= n; d++){\\n ll cur = S[d-1] - M[d-1];\\n if(cur <= 0) break;\\n mn = min(mn, cur);\\n\\n if(d-1 < n && S[d-1] + suf[d-1] >= L){\\n ans = d;\\n break;\\n }\\n\\n int lo = 0, hi = d-1, pos = d;\\n while(lo <= hi){\\n int mid = (lo + hi) / 2;\\n if(v[mid].d < mn) pos = mid, hi = mid - 1;\\n else lo = mid + 1;\\n }\\n if(pos < d){\\n ll cand = segt.qry(pos, d-1);\\n if(S[d-1] + cand >= L){\\n ans = d;\\n break;\\n }\\n }\\n }\\n cout << (ans == -1 ? -1 : ans) << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.2916666666666667,\n \"time_ms\": 20,\n \"memory_kb\": 10324,\n \"score_of_the_acc\": -0.541,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2785_9836741\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\\\" \\\"<<p.second;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n ll n,L;cin >> n >> L;\\n vi a(n),b(n);\\n rep(i,n)cin >> a[i] >> b[i];\\n vi c(n);cin >> c;\\n vi idx(n);\\n iota(ALL(idx),0);\\n sort(ALL(idx),[&](int i,int j){\\n return a[i]-b[i] > a[j]-b[j];\\n });\\n vi ruiC(n+1);\\n rep(i,n)ruiC[i+1] = ruiC[i] + c[i];\\n vi rui(n+1);\\n rep(i,n)rui[i+1] = rui[i] + a[idx[i]] - b[idx[i]];\\n int res = MOD;\\n ll lst = n;\\n rep(i,n)if(ruiC[i+1] >= rui[i+1]){\\n lst = i;\\n break;\\n }\\n {\\n vi v;\\n for(int i = n-1;i >= 0;i--){\\n if(a[idx[i]] <= b[idx[i]]){\\n v.emplace_back(a[idx[i]]);\\n rui.pop_back();ruiC.pop_back();\\n }else break;\\n }\\n n = sz(rui)-1;\\n chmin(lst,n);\\n for(auto au : v){\\n int k = LB(rui,L-au);\\n if(k-1 >= lst)continue;\\n chmin(res,k+1);\\n }\\n }\\n min_priority_queue<P> que;\\n for(int i = n-1;i >= 0;i--){\\n int A = a[idx[i]],B = b[idx[i]];\\n while(!que.empty()){\\n auto [x,y] = que.top();\\n if(x <= A-B){\\n chmin(lst,y);\\n que.pop();\\n }else break;\\n }\\n int k = LB(rui,L-A);\\n int g = 0;\\n if(k >= i+1){g = 1;\\n k = LB(rui,L-A+(A-B));\\n }\\n if(k-1 < lst)chmin(res,k-g+1);\\n que.push({rui[i+1]-ruiC[i],i});\\n }\\n cout << (res == MOD ? -1 : res) << \\\"\\\\n\\\";\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 9852,\n \"score_of_the_acc\": -0.5086,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2785_9836735\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\\\" \\\"<<p.second;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n ll n,L;cin >> n >> L;\\n vi a(n),b(n);\\n rep(i,n)cin >> a[i] >> b[i];\\n vi c(n);cin >> c;\\n vi idx(n);\\n iota(ALL(idx),0);\\n sort(ALL(idx),[&](int i,int j){\\n return a[i]-b[i] > a[j]-b[j];\\n });\\n vi ruiC(n+1);\\n rep(i,n)ruiC[i+1] = ruiC[i] + c[i];\\n vi rui(n+1);\\n rep(i,n)rui[i+1] = rui[i] + a[idx[i]] - b[idx[i]];\\n int res = MOD;\\n {\\n vi v;\\n for(int i = n-1;i >= 0;i--){\\n if(a[idx[i]] <= b[idx[i]]){\\n v.emplace_back(a[idx[i]]);\\n rui.pop_back();ruiC.pop_back();\\n }else break;\\n }\\n n = sz(rui)-1;\\n for(auto au : v){\\n int k = LB(rui,L-au);\\n if(k-1 > n-1)continue;\\n chmin(res,k+1);\\n }\\n }\\n ll lst = n;\\n rep(i,n)if(ruiC[i+1] >= rui[i+1]){\\n lst = i;\\n break;\\n }\\n min_priority_queue<P> que;\\n for(int i = n-1;i >= 0;i--){\\n int A = a[idx[i]],B = b[idx[i]];\\n while(!que.empty()){\\n auto [x,y] = que.top();\\n if(x <= A-B){\\n chmin(lst,y);\\n que.pop();\\n }else break;\\n }\\n int k = LB(rui,L-A);\\n int g = 0;\\n if(k >= i+1){g = 1;\\n k = LB(rui,L-A+(A-B));\\n }\\n if(k-1 < lst)chmin(res,k-g+1);\\n que.push({rui[i+1]-ruiC[i],i});\\n }\\n cout << (res == MOD ? -1 : res) << \\\"\\\\n\\\";\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 0.8333333333333334,\n \"time_ms\": 30,\n \"memory_kb\": 9912,\n \"score_of_the_acc\": -0.6794,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2785_9836716\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\\\" \\\"<<p.second;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n ll n,L;cin >> n >> L;\\n vi a(n),b(n);\\n rep(i,n)cin >> a[i] >> b[i];\\n vi c(n);cin >> c;\\n vi idx(n);\\n iota(ALL(idx),0);\\n sort(ALL(idx),[&](int i,int j){\\n return a[i]-b[i] > a[j]-b[j];\\n });\\n vi ruiC(n+1);\\n rep(i,n)ruiC[i+1] = ruiC[i] + c[i];\\n vi rui(n+1);\\n rep(i,n)rui[i+1] = rui[i] + a[idx[i]] - b[idx[i]];\\n ll lst = n;\\n rep(i,n)if(ruiC[i+1] >= rui[i+1]){\\n lst = i;\\n break;\\n }\\n min_priority_queue<P> que;\\n int res = MOD;\\n for(int i = n-1;i >= 0;i--){\\n int A = a[idx[i]],B = b[idx[i]];\\n while(!que.empty()){\\n auto [x,y] = que.top();\\n if(x <= A-B){\\n chmin(lst,y);\\n que.pop();\\n }else break;\\n }\\n int k = LB(rui,L-A);\\n int g = 0;\\n if(k >= i+1){g = 1;\\n k = LB(rui,L-A+(A-B));\\n }\\n if(k-1 < lst)chmin(res,k-g+1);\\n que.push({rui[i+1]-ruiC[i],i});\\n }\\n cout << (res == MOD ? -1 : res) << \\\"\\\\n\\\";\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 0.875,\n \"time_ms\": 20,\n \"memory_kb\": 9768,\n \"score_of_the_acc\": -0.5028,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2785_9831050\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\ntemplate <typename M, typename N, M (*f)(M, M), M (*g)(M, N), M (*m1)()>\\nstruct SegmentTree {\\n int sz, n;\\n vector<M> data;\\n SegmentTree(int _n = 0) : n(_n) {\\n sz = 1;\\n while (sz < _n)\\n sz <<= 1;\\n data.assign(2 * sz, m1());\\n }\\n void run(vector<M> &v) {\\n for (int i = 0; i < (int)v.size(); i++)\\n data[i + sz] = v[i];\\n for (int k = sz - 1; k > 0; k--)\\n data[k] = f(data[2 * k], data[2 * k + 1]);\\n }\\n void set(int k, const M &x) {\\n k += sz;\\n data[k] = x;\\n while (k >>= 1)\\n data[k] = f(data[2 * k], data[2 * k + 1]);\\n }\\n void update(int k, const N &x) {\\n k += sz;\\n data[k] = g(data[k], x);\\n while (k >>= 1)\\n data[k] = f(data[2 * k], data[2 * k + 1]);\\n }\\n M query(int a, int b) {\\n M L = m1(), R = m1();\\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if (a & 1)\\n L = f(L, data[a++]);\\n if (b & 1)\\n R = f(data[--b], R);\\n }\\n return f(L, R);\\n }\\n M operator[](const int &k) const {\\n return data[k + sz];\\n }\\n vector<M> get() {\\n return {data.begin() + sz, data.begin() + sz + n};\\n }\\n template <class F> int max_right(int L, F ch) const {\\n int l = sz + L, w = 1;\\n M ansL = m1();\\n for (; L + w <= sz; l >>= 1, w <<= 1)\\n if (l & 1) {\\n if (not ch(f(ansL, data[l])))\\n break;\\n ansL = f(ansL, data[l++]);\\n L += w;\\n }\\n while (l <<= 1, w >>= 1) {\\n if (L + w <= sz && ch(f(ansL, data[l]))) {\\n ansL = f(ansL, data[l++]);\\n L += w;\\n }\\n }\\n return L;\\n }\\n template <class F> int min_left(int R, F ch) const {\\n int r = sz + R, w = 1;\\n M ansR = m1();\\n for (; R - w >= 0; r >>= 1, w <<= 1)\\n if (r & 1) {\\n if (not ch(f(data[r - 1], ansR)))\\n break;\\n ansR = f(data[--r], ansR);\\n R -= w;\\n }\\n while (r <<= 1, w >>= 1) {\\n if (R - w >= 0 && ch(f(data[r - 1], ansR))) {\\n ansR = f(data[--r], ansR);\\n R -= w;\\n }\\n }\\n return R;\\n }\\n};\\n\\n/**\\n * @brief Segment Tree\\n */\\n\\nll f(ll A, ll B) {return min(A,B);}\\nll g(ll A, ll B) {return B;}\\nll e() {return INF;}\\n\\nint main() {\\n int N;\\n ll L;\\n cin >> N >> L;\\n vector<pair<ll,ll>> A(N);\\n vector<ll> C(N);\\n rep(i,0,N) cin >> A[i].first >> A[i].second;\\n rep(i,0,N) cin >> C[i];\\n sort(ALL(A),[&](pair<ll,ll> p, pair<ll,ll> q){return p.first-p.second > q.first-q.second;});\\n vector<ll> D(N);\\n rep(i,0,N) D[i] = A[i].first-A[i].second;\\n vector<ll> DS(N+1);\\n DS[0] = 0;\\n rep(i,0,N) DS[i+1] = DS[i] + max(D[i], 0LL);\\n vector<ll> E0(N), E1(N-1);\\n rep(i,0,N) E0[i] = A[i].first-A[i].second-C[i];\\n rep(i,0,N-1) E1[i] = A[i+1].first-A[i+1].second-C[i];\\n vector<ll> ES0(N+1), ES1(N);\\n ES0[0] = ES1[0] = 0;\\n rep(i,0,N) ES0[i+1] = ES0[i] + E0[i];\\n rep(i,0,N-1) ES1[i+1] = ES1[i] + E1[i];\\n SegmentTree<ll,ll,f,g,e> Seg0(N+1), Seg1(N);\\n Seg0.run(ES0);\\n Seg1.run(ES1);\\n int ANS = inf;\\n rep(i,0,N) {\\n if (DS[i] + A[i].first >= L) {\\n int ID = LB(DS, L - A[i].first);\\n if (Seg0.query(1,ID+1) > 0) chmin(ANS, ID+1);\\n }\\n else if (DS[N] - max(D[i], 0LL) + A[i].first >= L) {\\n int ID = LB(DS, L - A[i].first + max(D[i], 0LL));\\n if (Seg0.query(1,i+1) > 0 && ES0[i] + Seg1.query(i+1, ID) - ES1[i] > 0) chmin(ANS, ID);\\n }\\n }\\n cout << (ANS == inf ? -1 : ANS) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 14128,\n \"score_of_the_acc\": -1.6353,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2785_9669146\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nstruct segtree{\\n vi tree;\\n int n;\\n ll op(ll a,ll b){return max(a,b);}\\n ll e(){return -1e18;}\\n segtree(int _N){\\n n=1;\\n while(n<_N)n<<=1;\\n tree.assign(2*n,e());\\n }\\n void set(int i,ll x){\\n i+=n;\\n tree[i]=x;\\n while(i>1){\\n i>>=1;\\n tree[i]=op(tree[2*i],tree[2*i+1]);\\n }\\n }\\n ll prod(int l,int r){\\n l+=n;r+=n;\\n ll L=e(),R=e();\\n while(l<r){\\n if(l%2)L=op(L,tree[l++]);\\n if(r%2)R=op(tree[--r],R);\\n l>>=1;r>>=1;\\n }\\n return op(L,R);\\n }\\n};\\nstruct minsegtree{\\n vi tree;\\n int n;\\n ll op(ll a,ll b){return min(a,b);}\\n ll e(){return 1e18;}\\n minsegtree(int _N){\\n n=1;\\n while(n<_N)n<<=1;\\n tree.assign(2*n,e());\\n }\\n void set(int i,ll x){\\n i+=n;\\n tree[i]=x;\\n while(i>1){\\n i>>=1;\\n tree[i]=op(tree[2*i],tree[2*i+1]);\\n }\\n }\\n ll prod(int l,int r){\\n l+=n;r+=n;\\n ll L=e(),R=e();\\n while(l<r){\\n if(l%2)L=op(L,tree[l++]);\\n if(r%2)R=op(tree[--r],R);\\n l>>=1;r>>=1;\\n }\\n return op(L,R);\\n }\\n};\\nint main(){\\n ll N,L;cin>>N>>L;\\n vector<pi>A(N);\\n REP(i,N)cin>>A[i].first>>A[i].second;\\n REP(i,N)A[i].second=min(A[i].first,A[i].second);\\n REP(i,N)A[i]=pi(A[i].first-A[i].second,-A[i].first);\\n sort(ALL(A));\\n reverse(ALL(A));\\n REP(i,N)A[i].second*=-1;\\n vi D(N+1);\\n REP(i,N)D[i+1]=D[i]+A[i].first;\\n vi C(N+1);\\n REP(i,N)cin>>C[i+1];\\n FOR(i,1,N+1)C[i]+=C[i-1];\\n ll ans=1e18,m=*max_element(ALL(D));\\n minsegtree seg(N+1),seg0(N);\\n REP(i,N+1)seg.set(i,D[i]-C[i]);\\n REP(i,N)seg0.set(i,D[i+1]-C[i]);\\n REP(i,N){\\n if(D[i]+A[i].second>=L){\\n ll t=lower_bound(D.begin(),D.begin()+i,L-A[i].second)-D.begin();\\n if(seg.prod(1,t+1)>0)ans=min(ans,t+1);\\n }\\n else if(m-A[i].first+A[i].second>=L){\\n ll t=lower_bound(D.begin(),D.end(),L-A[i].second+A[i].first)-D.begin();\\n if(t<i+1)continue;\\n if(seg.prod(1,i+1)<=0)continue;\\n if(seg0.prod(i+1,t)<=A[i].first)continue;\\n ans=min(ans,t);\\n }\\n }\\n if(ans>1e17)ans=-1;\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 10232,\n \"score_of_the_acc\": -1.368,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2785_9669085\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(A) A.begin(),A.end()\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nstruct segtree{\\n vi tree;\\n int n;\\n ll op(ll a,ll b){return max(a,b);}\\n ll e(){return -1e18;}\\n segtree(int _N){\\n n=1;\\n while(n<_N)n<<=1;\\n tree.assign(2*n,e());\\n }\\n void set(int i,ll x){\\n i+=n;\\n tree[i]=x;\\n while(i>1){\\n i>>=1;\\n tree[i]=op(tree[2*i],tree[2*i+1]);\\n }\\n }\\n ll prod(int l,int r){\\n l+=n;r+=n;\\n ll L=e(),R=e();\\n while(l<r){\\n if(l%2)L=op(L,tree[l++]);\\n if(r%2)R=op(tree[--r],R);\\n l>>=1;r>>=1;\\n }\\n return op(L,R);\\n }\\n};\\nint main(){\\n ll N,L;cin>>N>>L;\\n vector<pi>A(N);\\n REP(i,N)cin>>A[i].first>>A[i].second;\\n REP(i,N)A[i]=pi(A[i].first-A[i].second,-A[i].first);\\n sort(ALL(A));\\n reverse(ALL(A));\\n segtree seg(N);\\n REP(i,N)seg.set(i,-A[i].second);\\n vi C(N);\\n REP(i,N)cin>>C[i];\\n FOR(i,1,N)C[i]+=C[i-1];\\n int l=0;\\n REP(i,N){\\n if(seg.prod(0,N)+l>=L){\\n cout<<i+1<<endl;\\n return 0;\\n }\\n seg.set(i,-1e18);\\n l+=A[i].first;\\n if(l<=C[i]){\\n cout<<-1<<endl;return 0;\\n }\\n }\\n cout<<-1<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.2916666666666667,\n \"time_ms\": 50,\n \"memory_kb\": 7192,\n \"score_of_the_acc\": -0.8261,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2785_8321648\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst long long INF = (3LL << 59);\\n\\nclass drink {\\npublic:\\n\\tlong long a, b;\\n\\tdrink() : a(0), b(0) {}\\n\\tdrink(long long a_, long long b_) : a(a_), b(b_) {}\\n};\\n\\nclass segtree {\\nprivate:\\n\\tint sz;\\n\\tvector<long long> val;\\npublic:\\n\\tsegtree() : sz(0), val(vector<long long>()) {}\\n\\tsegtree(int n) {\\n\\t\\tsz = (n >= 3 ? 1 << (32 - __builtin_clz(n - 1)) : n);\\n\\t\\tval.resize(sz * 2, -INF);\\n\\t}\\n\\tvoid update(int pos, long long x) {\\n\\t\\tpos += sz;\\n\\t\\tval[pos] = x;\\n\\t\\twhile (pos > 1) {\\n\\t\\t\\tpos /= 2;\\n\\t\\t\\tval[pos] = max(val[pos * 2], val[pos * 2 + 1]);\\n\\t\\t}\\n\\t}\\n\\tlong long rangemax(int l, int r) const {\\n\\t\\tlong long res = -INF;\\n\\t\\tl += sz;\\n\\t\\tr += sz;\\n\\t\\twhile (l != r) {\\n\\t\\t\\tif (l & 1) res = max(res, val[l++]);\\n\\t\\t\\tif (r & 1) res = max(res, val[--r]);\\n\\t\\t\\tl >>= 1;\\n\\t\\t\\tr >>= 1;\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n};\\n\\nint main() {\\n\\t// step #1. input\\n\\tint N; long long L;\\n\\tcin >> N >> L;\\n\\tvector<drink> D(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> D[i].a >> D[i].b;\\n\\t}\\n\\tvector<int> C(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> C[i];\\n\\t}\\n\\n\\t// step #2. solve\\n\\tsort(D.begin(), D.end(), [&](const drink& d1, const drink& d2) {\\n\\t\\treturn d1.a - d1.b > d2.a - d2.b;\\n\\t});\\n\\tvector<long long> F(N);\\n\\tsegtree seg1(N), seg2(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tF[i] = D[i].a - D[i].b;\\n\\t\\tseg1.update(i, D[i].a);\\n\\t\\tseg2.update(i, D[i].b);\\n\\t}\\n\\tint answer = -1;\\n\\tlong long height = F[0];\\n\\tlong long diff = F[0] + 1;\\n\\tlong long diffmin = diff;\\n\\tfor (int r = 1; r <= N; r++) {\\n\\t\\tif (diffmin <= 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tint pos = lower_bound(F.begin(), F.end(), diffmin - 1, [](long long v1, long long v2) { return v1 > v2; }) - F.begin();\\n\\t\\tif (pos < r - 1) {\\n\\t\\t\\tlong long bmax = seg2.rangemax(pos, r - 1);\\n\\t\\t\\tlong long h = height + bmax;\\n\\t\\t\\tif (h >= L) {\\n\\t\\t\\t\\tanswer = r;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (pos < r) {\\n\\t\\t\\tlong long amax = seg1.rangemax(r - 1, N);\\n\\t\\t\\tlong long h = height - F[r - 1] + amax;\\n\\t\\t\\tif (h >= L) {\\n\\t\\t\\t\\tanswer = r;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (r != N) {\\n\\t\\t\\theight += F[r];\\n\\t\\t\\tdiff += F[r] - C[r - 1];\\n\\t\\t\\tif (r == 1) {\\n\\t\\t\\t\\tdiff -= 1;\\n\\t\\t\\t}\\n\\t\\t\\tdiffmin = min(diffmin, diff);\\n\\t\\t}\\n\\t}\\n\\n\\t// step #3. output\\n\\tcout << answer << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 9920,\n \"score_of_the_acc\": -1.3466,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2785_7235761\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) v.begin(), v.end()\\n#define REPname(a,b,c,d,...) d\\n#define rep(...) REPname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP2(i,l,r) for(int i = l; i < r; i++)\\n#define REP1(i, x) REP2(i,0,x)\\n#define REP0(x) REP1(SPJ, x)\\n#define sz(x) int(x.size())\\n\\ntemplate <class T>\\nusing V=vector<T>;\\n\\ntemplate <class T>\\nusing VV=vector<V<T>>;\\n\\ntemplate<class T>\\nusing pqmin = priority_queue<T, V<T>, greater<T>>;\\nusing ll = long long ;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = V<vll>;\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\ntemplate<class T>\\ninline bool chmax(T &a, T b){\\n\\treturn a < b ? a=b, 1 : 0;\\n}\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\treturn a > b ? a = b, 1 : 0;\\n}\\n\\ntemplate <class T>\\nvoid view(T x) {\\n\\tcerr << x;\\n}\\n\\ntemplate <class T>\\nvoid view(V<T> v) {\\n\\tcerr << \\\"{ \\\";\\n\\tfoa(t, v) {view(t) ; cerr << \\\", \\\";}\\n\\tcerr << \\\"}\\\";\\n\\tcerr << endl;\\n}\\n\\n\\ntemplate <class T>\\nvoid view(VV<T> v) {\\n\\tcerr << \\\"{ \\\";\\n\\tfoa(t, v) {view(t) ; cerr << \\\",\\\\n\\\";}\\n\\tcerr << \\\"}\\\";\\n\\tcerr << endl;\\n}\\n\\n\\n// template <c0lass T>\\nvoid view(int x) {\\n\\tcerr << x;\\n}\\n\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <class T>\\nvoid debug_out(T x) {\\n\\tview(x);\\n}\\ntemplate <class H, class... T>\\nvoid debug_out(H h, T... 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 << \\\"]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#else\\n#define debug(...) (void(0))\\n#endif\\nusing vvi = V<vi>;\\n\\nstruct uf{\\n\\tvector<int> dat;\\n\\tuf(int n) : dat(n, -1) {}\\n\\tint root(int x) \\n\\t{\\n\\t\\tint& p = dat[x];\\n\\t\\tif(p < 0) return x;\\n\\t\\treturn p = root(p);\\n\\t}\\n\\tbool merge(int x, int y) {\\n\\t\\tx = root(x);\\n\\t\\ty = root(y);\\n\\t\\tif(x == y) return false;\\n\\t\\tif(-dat[x] < -dat[y]) swap(x, y);\\n\\t\\tdat[x] += dat[y];\\n\\t\\tdat[y] = x;\\n\\t\\treturn true;\\n\\t}\\n};\\n\\nll modpow(ll x, ll n, ll md){\\n\\tll ret = 1 % md;\\n\\twhile(n > 0){\\n\\t\\tif(n & 1) {ret *= x; ret %= md;}\\n\\t\\tn >>= 1;\\n\\t\\tx *= x;\\n\\t\\tx %= md;\\n\\t}\\n\\tif(ret < 0) ret += abs(md);\\n\\treturn ret;\\n}\\n\\nusing S = ll;\\nusing F = ll; // +\\nconstexpr ll e = INF;\\nconstexpr ll id = 0LL;\\nconstexpr ll replace_e = e;\\nll op(ll a, ll b) {return min(a,b);}\\nll mapping(F f, S s) {return S(f+s);}\\nll composition(F f, F g) {return f+g;}\\nstruct node {\\n\\tnode *l = nullptr;\\n\\tnode *r = nullptr;\\n\\tint lo, hi;\\n\\tll mset = e;\\n\\tll madd = id;\\n\\tll val = e;\\n\\tnode(int lo, int hi) : lo(lo), hi(hi) {}\\n\\tnode (vll& v, int lo, int hi) : lo(lo), hi(hi) {\\n\\t\\tif(lo + 1 < hi) {\\n\\t\\t\\tint mid = lo + (hi - lo) / 2;\\n\\t\\t\\tl = new node (v, lo, mid);\\n\\t\\t\\tr = new node(v, mid, hi);\\n\\t\\t\\tval = op(l->val, r->val);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tval = v[lo];\\n\\t\\t}\\n\\t}\\n\\n\\tS query(int L, int R) {\\n\\t\\tif(R <= lo || hi <= L) return e;\\n\\t\\tif(L <=lo && hi <= R) return val;\\n\\t\\tpush();\\n\\t\\treturn op(l->query(L, R), r->query(L,R));\\n\\t}\\n\\n\\tvoid set(int L, int R, ll x) {\\n\\t\\tif(R <= lo || hi <= L) return;\\n\\t\\tif(L <= lo && hi <= R) mset = val = x, madd = id;\\n\\t\\telse {\\n\\t\\t\\tpush(), l->set (L, R, x) , r->set(L,R,x);\\n\\t\\t\\tval = op(l->val, r->val);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid add(int L, int R, ll x) {\\n\\t\\tif(R <= lo || hi <= L) return;\\n\\t\\tif(L <= lo && hi <= R) {\\n\\t\\t\\tif(mset != replace_e) mset = mapping(x, mset);\\n\\t\\t\\telse madd = composition(x, madd);\\n\\t\\t\\tval = mapping(x, val);\\n\\t\\t} else {\\n\\t\\t\\tpush(), l->add(L, R, x), r->add(L, R, x);\\n\\t\\t\\tval = op(l->val, r->val);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid push() {\\n\\t\\tif(!l) {\\n\\t\\t\\tint mid = lo + (hi - lo) / 2;\\n\\t\\t\\tl = new node(lo, mid);\\n\\t\\t\\tr = new node(mid, hi);\\n\\t\\t}\\n\\t\\tif(mset != replace_e)\\n\\t\\t\\tl->set(lo, hi, mset), r->set(lo, hi, mset), mset = replace_e;\\n\\t\\telse if(madd)\\n\\t\\t\\tl->add(lo, hi, madd), r->add(lo, hi, madd), madd = id;\\n\\t}\\n};\\n\\nint solve(int n){\\n\\tll len; cin >> len;\\n\\tV<pair<ll, ll>> up_bonus;\\n\\tll largest_bonus = -INF;\\n\\trep(n) {\\n\\t\\tll a, b; cin >> a >> b;\\n\\t\\tll up = a - b;\\n\\t\\tif(up > 0) {\\n\\t\\t\\tup_bonus.emplace_back(up, b);\\n\\t\\t} else if(a > 0) {\\n\\t\\t\\tchmax(largest_bonus, a);\\n\\t\\t}\\n\\t}\\n\\tvll criminals = {0LL};\\n\\trep(n) {\\n\\t\\tll c;\\n\\t\\tcin >> c; \\n\\t\\tcriminals.push_back(criminals.back() + c);\\n\\t}\\n\\n\\tsort(all(up_bonus));\\n\\treverse(all(up_bonus));\\n\\n\\tvector<ll> s = {0};\\n\\tfor(auto [c, d] : up_bonus) {\\n\\t\\ts.push_back(s.back() + c);\\n\\t}\\n\\n\\tconst int plus_size = up_bonus.size();\\n\\tif(plus_size == 0) {\\n\\t\\tif(len <= largest_bonus) return 1;\\n\\t\\treturn -1;\\n\\t}\\n\\n\\tvector<ll> tab = s;\\n\\ttab.front() = INF;\\n\\ttab.at(1) = INF;\\n\\n\\trep(i, 2, int(tab.size())) {\\n\\t\\ttab[i] -= criminals[i-1];\\n\\t}\\n\\n\\tnode* rmq = new node(tab, 0, int(tab.size()));\\n\\n\\tint ans = n + 10;\\n\\n\\trep(i, plus_size) {\\n\\t\\tauto [up, bonus] = up_bonus.at(i);\\n\\n\\t\\tif(i && s[i] <= criminals[i]) break;\\n\\t\\tif(s[i] + largest_bonus >= len) chmin(ans, i + 1);\\n\\n\\t\\tconst int from_here = int(lower_bound(all(s), len - bonus) - s.begin());\\n\\t\\tif(from_here == int(s.size())) continue;\\n\\t\\tif(from_here <= i + 1) {chmin(ans, i + 1); continue;}\\n\\n\\t\\tif(rmq->query(i + 2, from_here + 1) <= up) continue;\\n\\n\\t\\tchmin(ans, from_here);\\n\\t}\\n\\n\\tif(s.back() > criminals.back() && s.back() + largest_bonus >= len) chmin(ans, plus_size + 1);\\n\\n\\tif(ans > n) return -1;\\n\\treturn ans;\\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\\tint n;\\n\\twhile(cin >> n && n) cout<< solve(n) << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 19376,\n \"score_of_the_acc\": -1.4953,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2785_7235723\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) v.begin(), v.end()\\n#define REPname(a,b,c,d,...) d\\n#define rep(...) REPname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP2(i,l,r) for(int i = l; i < r; i++)\\n#define REP1(i, x) REP2(i,0,x)\\n#define REP0(x) REP1(SPJ, x)\\n#define sz(x) int(x.size())\\n\\ntemplate <class T>\\nusing V=vector<T>;\\n\\ntemplate <class T>\\nusing VV=vector<V<T>>;\\n\\ntemplate<class T>\\nusing pqmin = priority_queue<T, V<T>, greater<T>>;\\nusing ll = long long ;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = V<vll>;\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\ntemplate<class T>\\ninline bool chmax(T &a, T b){\\n\\treturn a < b ? a=b, 1 : 0;\\n}\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\treturn a > b ? a = b, 1 : 0;\\n}\\n\\ntemplate <class T>\\nvoid view(T x) {\\n\\tcerr << x;\\n}\\n\\ntemplate <class T>\\nvoid view(V<T> v) {\\n\\tcerr << \\\"{ \\\";\\n\\tfoa(t, v) {view(t) ; cerr << \\\", \\\";}\\n\\tcerr << \\\"}\\\";\\n\\tcerr << endl;\\n}\\n\\n\\ntemplate <class T>\\nvoid view(VV<T> v) {\\n\\tcerr << \\\"{ \\\";\\n\\tfoa(t, v) {view(t) ; cerr << \\\",\\\\n\\\";}\\n\\tcerr << \\\"}\\\";\\n\\tcerr << endl;\\n}\\n\\n\\n// template <c0lass T>\\nvoid view(int x) {\\n\\tcerr << x;\\n}\\n\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <class T>\\nvoid debug_out(T x) {\\n\\tview(x);\\n}\\ntemplate <class H, class... T>\\nvoid debug_out(H h, T... 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 << \\\"]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#else\\n#define debug(...) (void(0))\\n#endif\\nusing vvi = V<vi>;\\n\\nstruct uf{\\n\\tvector<int> dat;\\n\\tuf(int n) : dat(n, -1) {}\\n\\tint root(int x) \\n\\t{\\n\\t\\tint& p = dat[x];\\n\\t\\tif(p < 0) return x;\\n\\t\\treturn p = root(p);\\n\\t}\\n\\tbool merge(int x, int y) {\\n\\t\\tx = root(x);\\n\\t\\ty = root(y);\\n\\t\\tif(x == y) return false;\\n\\t\\tif(-dat[x] < -dat[y]) swap(x, y);\\n\\t\\tdat[x] += dat[y];\\n\\t\\tdat[y] = x;\\n\\t\\treturn true;\\n\\t}\\n};\\n\\nll modpow(ll x, ll n, ll md){\\n\\tll ret = 1 % md;\\n\\twhile(n > 0){\\n\\t\\tif(n & 1) {ret *= x; ret %= md;}\\n\\t\\tn >>= 1;\\n\\t\\tx *= x;\\n\\t\\tx %= md;\\n\\t}\\n\\tif(ret < 0) ret += abs(md);\\n\\treturn ret;\\n}\\n\\nusing S = ll;\\nusing F = ll; // +\\nconstexpr ll e = INF;\\nconstexpr ll id = 0LL;\\nconstexpr ll replace_e = e;\\nll op(ll a, ll b) {return min(a,b);}\\nll mapping(F f, S s) {return S(f+s);}\\nll composition(F f, F g) {return f+g;}\\nstruct node {\\n\\tnode *l = nullptr;\\n\\tnode *r = nullptr;\\n\\tint lo, hi;\\n\\tll mset = e;\\n\\tll madd = id;\\n\\tll val = e;\\n\\tnode(int lo, int hi) : lo(lo), hi(hi) {}\\n\\tnode (vll& v, int lo, int hi) : lo(lo), hi(hi) {\\n\\t\\tif(lo + 1 < hi) {\\n\\t\\t\\tint mid = lo + (hi - lo) / 2;\\n\\t\\t\\tl = new node (v, lo, mid);\\n\\t\\t\\tr = new node(v, mid, hi);\\n\\t\\t\\tval = op(l->val, r->val);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tval = v[lo];\\n\\t\\t}\\n\\t}\\n\\n\\tS query(int L, int R) {\\n\\t\\tif(R <= lo || hi <= L) return e;\\n\\t\\tif(L <=lo && hi <= R) return val;\\n\\t\\tpush();\\n\\t\\treturn op(l->query(L, R), r->query(L,R));\\n\\t}\\n\\n\\tvoid set(int L, int R, ll x) {\\n\\t\\tif(R <= lo || hi <= L) return;\\n\\t\\tif(L <= lo && hi <= R) mset = val = x, madd = id;\\n\\t\\telse {\\n\\t\\t\\tpush(), l->set (L, R, x) , r->set(L,R,x);\\n\\t\\t\\tval = op(l->val, r->val);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid add(int L, int R, ll x) {\\n\\t\\tif(R <= lo || hi <= L) return;\\n\\t\\tif(L <= lo && hi <= R) {\\n\\t\\t\\tif(mset != replace_e) mset = mapping(x, mset);\\n\\t\\t\\telse madd = composition(x, madd);\\n\\t\\t\\tval = mapping(x, val);\\n\\t\\t} else {\\n\\t\\t\\tpush(), l->add(L, R, x), r->add(L, R, x);\\n\\t\\t\\tval = op(l->val, r->val);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid push() {\\n\\t\\tif(!l) {\\n\\t\\t\\tint mid = lo + (hi - lo) / 2;\\n\\t\\t\\tl = new node(lo, mid);\\n\\t\\t\\tr = new node(mid, hi);\\n\\t\\t}\\n\\t\\tif(mset != replace_e)\\n\\t\\t\\tl->set(lo, hi, mset), r->set(lo, hi, mset), mset = replace_e;\\n\\t\\telse if(madd)\\n\\t\\t\\tl->add(lo, hi, madd), r->add(lo, hi, madd), madd = id;\\n\\t}\\n};\\n\\nint solve(int n){\\n\\tll len; cin >> len;\\n\\tV<pair<ll, ll>> up_bonus;\\n\\tll largest_bonus = -1;\\n\\trep(n) {\\n\\t\\tll a, b; cin >> a >> b;\\n\\t\\tll up = a - b;\\n\\t\\tif(up > 0) {\\n\\t\\t\\tup_bonus.emplace_back(up, b);\\n\\t\\t} else if(a > 0) {\\n\\t\\t\\tchmax(largest_bonus, a);\\n\\t\\t}\\n\\t}\\n\\tvll criminals = {0LL};\\n\\trep(n) {\\n\\t\\tll c;\\n\\t\\tcin >> c; \\n\\t\\tcriminals.push_back(criminals.back() + c);\\n\\t}\\n\\n\\tsort(all(up_bonus));\\n\\treverse(all(up_bonus));\\n\\n\\tvector<ll> s = {0};\\n\\tfor(auto [c, d] : up_bonus) {\\n\\t\\ts.push_back(s.back() + c);\\n\\t}\\n\\n\\tconst int ss = int(s.size());\\n\\n\\tvector<ll> tab = s;\\n\\tif(ss < 2) {\\n\\t\\tif(len <= largest_bonus) return 1;\\n\\t\\treturn -1;\\n\\t}\\n\\n\\ttab.front() = INF;\\n\\ttab.at(1) = INF;\\n\\n\\trep(i, 2, ss) {\\n\\t\\ttab[i] -= criminals[i-1];\\n\\t}\\n\\n\\tnode* rmq = new node(tab, 0, ss);\\n\\n\\tint ans = n + 10;\\n\\n\\trep(i, int(up_bonus.size())) {\\n\\t\\tauto [up, bonus] = up_bonus.at(i);\\n\\n\\t\\tif(i && s[i] <= criminals[i]) break;\\n\\t\\tif(s[i] + largest_bonus >= len) chmin(ans, i + 1);\\n\\n\\t\\tconst int from_here = int(lower_bound(all(s), len - bonus) - s.begin());\\n\\t\\tif(from_here == ss) continue;\\n\\t\\tif(from_here <= i + 1) {chmin(ans, i + 1); continue;}\\n\\n\\t\\tif(rmq->query(i + 2, from_here + 1) <= up) continue;\\n\\n\\t\\tchmin(ans, from_here);\\n\\t}\\n\\n\\tif(ans > n) return -1;\\n\\treturn ans;\\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\\tint n;\\n\\twhile(cin >> n && n) cout<< solve(n) << '\\\\n';\\n}\",\n \"accuracy\": 0.9791666666666666,\n \"time_ms\": 40,\n \"memory_kb\": 19444,\n \"score_of_the_acc\": -1.5,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2785_7176631\",\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}\\n\\nconst int mx = 1e9;\\nconst ll inf = 1e18;\\n\\nstruct segtree {\\n using S = ll; // 例\\n S op(S a,S b) {return min(a,b);}\\n S e() {return inf;}\\n\\n int n;\\n vector<S> tree;\\n segtree(int n) : n(n), tree(vector<S>(n*2, e())) {}\\n\\n void update(int pos,S val){\\n pos += n; tree[pos] = val;\\n while(pos > 1){\\n tree[pos/2] = op(tree[pos], tree[pos^1]);\\n pos /= 2;\\n }\\n }\\n // [l,r)\\n S query(int l, int r) {\\n S sml = e(), smr = e();\\n for(l += n, r += n; l < r; l >>= 1, r >>= 1){\\n if(l%2) sml = op(sml, tree[l++]);\\n if(r%2) smr = op(tree[--r], smr);\\n }\\n return op(sml,smr);\\n }\\n};\\n\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n; cin >> n;\\n ll L; cin >> L;\\n vector<pair<ll,ll>> v(n);\\n for (int i = 0; i < n; ++i) {\\n ll a,b; cin >> a >> b;\\n v[i] = {a-b, a};\\n }\\n sort(v.rbegin(), v.rend());\\n\\n vector<ll> c(n);\\n for (int i = 0; i < n; ++i) {\\n cin >> c[i];\\n }\\n int res = mx;\\n // ソート順で使う場合\\n {\\n vector<ll> rmx(n);\\n for (int i = n-1; i >= 0; --i) {\\n rmx[i] = max(rmx[i], v[i].second);\\n if(i+1 < n){\\n rmx[i] = max(rmx[i], rmx[i+1]);\\n }\\n }\\n ll ss = 0;\\n ll cs = 0;\\n if(rmx[0] >= L) res = 1;\\n for (int i = 0; i < n - 1; ++i) {\\n ss += v[i].first;\\n cs += c[i];\\n if(ss <= cs) break;\\n if(ss + rmx[i+1] >= L){\\n res = min(res, i+2);\\n }\\n }\\n }\\n // aでかいのを後回しにする場合\\n {\\n vector<ll> dif(n-1);\\n for (int i = 0; i < n - 1; ++i) {\\n dif[i] = v[i+1].first-c[i];\\n }\\n segtree seg(n-1);\\n vector<ll> dsum(n);\\n for (int i = 0; i < n - 1; ++i) {\\n dsum[i+1] = dsum[i] + dif[i];\\n seg.update(i, dsum[i+1]);\\n }\\n\\n vector<ll> sum(n+1);\\n for (int i = 0; i < n; ++i) {\\n sum[i+1] = sum[i] + v[i].first;\\n }\\n ll ss = 0;\\n ll cs = 0;\\n for (int i = 0; i+1 < n; ++i) {\\n // iを後回し\\n int l = i-1, r = n;\\n while(r-l > 1){\\n int mid = (l+r)/2;\\n ll u = sum[mid+1]-v[i].first+v[i].second;\\n if(u >= L){\\n r = mid;\\n }\\n else{\\n l = mid;\\n }\\n }\\n bool ok = true;\\n if(r == n or r == i) ok = false;\\n // 正当性確認\\n if(ok){\\n // [i,r)のdifの前から累積和の最小値を調べる\\n ll pds = dsum[i];\\n ll mi = seg.query(i,r);\\n if(mi-pds+ss-cs > 0){\\n res = min(res, r+1);\\n }\\n }\\n // 次の更新\\n {\\n ss += v[i].first;\\n cs += c[i];\\n if(ss <= cs) break;\\n }\\n }\\n }\\n if(res == mx) res = -1;\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 9284,\n \"score_of_the_acc\": -0.6363,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1675,"cells":{"group_id":{"kind":"string","value":"aoj_2787_cpp"},"problem_description":{"kind":"string","value":"Pipe Fitter and the Fierce Dogs\nYou, a proud pipe fitter of ICPC (International Community for Pipe Connection), undertake a new task. The area in which you will take charge of piping work is a rectangular shape with $W$ blocks from west to east and $H$ blocks from north to south. We refer to the block at the $i$-th from west and the $j$-th from north as $(i, j)$. The westernmost and northernmost block is $(1, 1)$, and the easternmost and southernmost block is $(W,H)$. To make the area good scenery, the block $(i, j)$ has exactly one house if and only if both of $i$ and $j$ are odd numbers.\nYour task is to construct a water pipe network in the area such that every house in the area is supplied water through the network. A water pipe network consists of pipelines. A pipeline is made by connecting one or more pipes, and a pipeline with l pipes is constructed as follows:\nchoose a first house, and connect the house to an underground water source with a\nspecial pipe\n.\nchoose an $i$-th house ($2 \\leq i \\leq l$), and connect the $i$-th house to the ($i - 1$)-th house with a\ncommon pipe\n. In this case, there is a condition to choose a next $i$-th house because the area is slope land. Let $(x, y)$ be the block of the ($i - 1$)-th house. An $i$-th house must be located at either $(x - 2, y + 2)$, $(x, y + 2)$, or $(x + 2, y + 2)$. A common pipe connecting two houses must be located at $(x - 1, y + 1)$, $(x, y + 1)$, or $(x + 1, y + 1)$, respectively.\nIn addition, you should notice the followings when you construct several pipelines:\nFor each house, exactly one pipeline is through the house.\nMultiple pipes can be located at one block.\nIn your task, common pipes are common, so you can use any number of common pipes. On the other hand, special pipes are special, so the number of available special pipes in this task is restricted under ICPC regulation.\nBesides the restriction of available special pipes, there is another factor obstructing your pipe work: fierce dogs. Some of the blocks which do not contain a house seem to be home of fierce dogs. Each dog always stays at his/her home block. Since several dogs must not live at the same block as their home, you can assume each block is home of only one dog, or not home of any dogs.\nThe figure below is an example of a water pipe network in a 5 $\\times$ 5 area with 4 special pipes. This corresponds to the first sample.\nLocating a common pipe at a no-dog block costs 1 unit time, but locating a common pipe at a dog-living block costs 2 unit time because you have to fight against the fierce dog. Note that when you locate multiple pipes at the same block, each pipe-locating costs 1 unit time for no-dog blocks and 2 for dog-living blocks, respectively. By the way, special pipes are very special, so locating a special pipe costs 0 unit time.\nYou, a proud pipe fitter, want to accomplish this task as soon as possible. Fortunately, you get a list of blocks which are home of dogs. You have frequently participated in programmi\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2787_10851470","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <cassert>\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;\nconst ll mod=1000000007;\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;}\n// head\n\nconst int N=10100;\n//map<int,int> dp,v,c;\nVI cand,d[N];\nint w,h,k,n,x,y,v[N],c[N],dp[N];\n//int query(int x) { return (--dp.upper_bound(x))->se;}\nint solve(VI x) {\n/*\tv.clear(); c.clear();\n\tcand.clear();\n\tfor (auto p:x) {\n\t\tif (p%2==0) c[p/2+1]=1;\n\t\telse v[p/2+1]=1;\n\t\tcand.pb(p/2+1);\n\t\tif (p/2+2<=(w+1)/2) cand.pb(p/2+2);\n\t\tif (p/2+3<=(w+1)/2) cand.pb(p/2+3);\n\t}\n\tcand.pb((w+1)/2);\n\tcand.pb(0);\n\tsort(all(cand));\n\tcand.erase(unique(all(cand)),cand.end());\n\tdp.clear();\n\tdp[0]=0;\n\trep(x,1,SZ(cand)) {\n\t\tint i=cand[x];\n\t\tdp[i]=query(i-1)+v[i];\n\t\tif (i-2>=0) dp[i]=min(dp[i],query(i-2)+c[i]);\n\t}\n\treturn dp[w/2+1];*/\n\trep(i,1,w/2+2) {\n\t\tv[i]=c[i]=0;\n\t}\n\tfor (auto p:x) {\n\t\tif (p%2==0) c[p/2+1]=1; else v[p/2+1]=1;\n\t}\n\tdp[0]=0;\n\trep(i,1,w/2+2) {\n\t\tdp[i]=dp[i-1]+v[i];\n\t\tif (i>=2) dp[i]=min(dp[i],dp[i-2]+2*c[i]);\n\t}\n\treturn dp[w/2+1];\n}\nint main() {\n\tscanf(\"%d%d%d\",&w,&h,&k);\n\tk-=(w+1)/2;\n\tif (k<0) {\n\t\tputs(\"-1\");\n\t\treturn 0;\n\t}\n\tscanf(\"%d\",&n);\n\trep(i,0,n) {\n\t\tscanf(\"%d%d\",&x,&y);\n\t\tif (y%2==0) d[y/2].pb(x);\n\t}\n\tint r=0;\n\trep(i,1,h/2+1) r+=solve(d[i]);\n\tint cur=(h/2)*(w/2+1)-r;\n\tint dd=min(r,k); r-=dd; k-=dd;\n\tdd=min(cur,k); cur-=dd; k-=dd;\n\tprintf(\"%d\\n\",cur+r*2);\n}","accuracy":1,"time_ms":60,"memory_kb":3692,"score_of_the_acc":-0.0485,"final_rank":5},{"submission_id":"aoj_2787_9808820","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n\n// https://ei1333.github.io/luzhiled/snippets/graph/dinic.html\ntemplate<typename flow_t>\nstruct Dinic{\n /*\n 復元をするときはfromの頂点から出る辺からのcapを出力．\n is_e == trueの時その辺は元のグラフにあった\"本当の\"辺．\n \"本当の\"辺eについてfr -> toにv[e.to][e.ref].capだけフローが流れている．\n 二部マッチングの復元の場合，仮想の始点（終点）から（へ）の辺に注意．\n */\n struct edge{\n int to;\n flow_t cap;\n int ref;//逆辺の番号\n bool is_e;//本物の辺かどうか\n int idx;//入力で与えられる辺としてのindex\n };\n vector<vector<edge>> v;\n vector<int> mn_cost,iter;\n const flow_t inf;\n Dinic(int n):inf(numeric_limits<flow_t>::max()),v(n){}\n void add_edge(int fr,int to,flow_t cap,int idx = -1){\n v[fr].emplace_back((edge){to,cap,(int)v[to].size(),true,idx});\n v[to].emplace_back((edge){fr,0,(int)v[fr].size()-1,false,idx});\n }\n bool bfs(int s,int t){\n mn_cost.assign(v.size(),-1);\n queue<int> que;\n mn_cost[s] = 0;\n que.push(s);\n while(!que.empty() && mn_cost[t] == -1){\n int ov = que.front();que.pop();\n for(auto &e : v[ov]){\n if(e.cap > 0 && mn_cost[e.to] == -1){\n mn_cost[e.to] = mn_cost[ov] + 1;\n que.push(e.to);\n }\n }\n }\n return mn_cost[t] != -1;\n }\n flow_t dfs(int ov,const int t,flow_t flow){\n if(ov == t)return flow;\n for(int &i = iter[ov];i < v[ov].size();i++){\n edge &e = v[ov][i];\n if(e.cap > 0 && mn_cost[ov] < mn_cost[e.to]){\n flow_t d = dfs(e.to,t,min(flow,e.cap));\n if(d > 0){\n e.cap -= d;\n v[e.to][e.ref].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n // O(m n^2)(n:頂点数 m:辺数)\n flow_t max_flow(int s,int t){\n flow_t flow = 0;\n while(bfs(s,t)){\n iter.assign(v.size(),0);\n flow_t f = 0;\n while((f = dfs(s,t,inf)) > 0)flow += f;\n }\n return flow;\n }\n void output(){\n for(int i = 0;i < v.size();i++){\n for(auto &e : v[i]) {\n if(!e.is_e) continue;\n auto &rev_e = v[e.to][e.ref];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << \"\\n\";\n }\n }\n }\n};\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n ll h,w,K;cin >> w >> h >> K;\n int n;cin >> n;\n vector<set<int>> st(h+1);\n rep(i,n){\n ll x,y;cin >> x >> y;\n st[y].insert(x);\n }\n K -= (w+1)/2;\n if(K < 0){\n cout << \"-1\\n\";\n return 0;\n }\n ll res = 0;\n for(int i = 2;i <= h;i+=2){\n set<int> cand;\n for(auto au : st[i]){\n for(int j = -2;j <= 2;j++){\n if((au+j+100)%2 == 1 && au+j >= 1 && au+j <= w)cand.insert(au+j);\n }\n }\n int SZ = sz(cand);\n Dinic<int> dn(SZ*2 + 2);\n int S = SZ*2,T = S+1;\n int cnt = 0;\n for(auto au : cand){\n for(int j = -2;j <= 2;j+=2){\n if(cand.count(au+j) && !st[i].count(au+(j/2))){\n dn.add_edge(cnt,SZ+cnt+(j/2),1);\n }\n }\n cnt++;\n }\n rep(i,SZ){\n dn.add_edge(S,i,1);\n dn.add_edge(SZ+i,T,1);\n }\n ll flw = dn.max_flow(S,T);\n res += (w+1)/2 - cnt + flw;\n flw = cnt-flw;\n int k = min(K,flw);\n K -= k;\n flw -= k;\n res += flw*2;\n }\n if(K)res -= min(res,K);\n cout << res << \"\\n\";\n \n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":9144,"score_of_the_acc":-0.0884,"final_rank":12},{"submission_id":"aoj_2787_9808676","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\n int N, M, K;\n cin >> M >> N >> K;\n if ((M+1)/2 > K) {\n cout << -1 << endl;\n return 0;\n }\n K -= (M+1)/2;\n int Q;\n cin >> Q;\n vector<vector<int>> X(N);\n while(Q--) {\n int A, B;\n cin >> B >> A;\n A--, B--;\n X[A].push_back(B);\n }\n int ANS = 0;\n rep(i,0,(N-1)/2) {\n vector<bool> B(M,false);\n for (int j : X[i*2+1]) B[j] = true;\n vector<int> DP((M+1)/2+1,inf);\n DP[0] = 0;\n rep(j,0,(M+1)/2) {\n chmin(DP[j+1], DP[j] + (B[j*2] ? 1 : 0));\n if (j+2 < (M+1)/2+1) chmin(DP[j+2], DP[j] + (B[j*2+1] ? 2 : 0));\n }\n ANS += DP[(M+1)/2];\n }\n int ANS2 = ((N-1)/2)*((M+1)/2)-ANS;\n int MIN = min(ANS, K);\n K -= MIN;\n ANS -= MIN;\n MIN = min(ANS2, K);\n ANS2 -= MIN;\n cout << ANS2 + ANS * 2 << endl;\n}","accuracy":1,"time_ms":80,"memory_kb":4208,"score_of_the_acc":-0.0697,"final_rank":11},{"submission_id":"aoj_2787_9669512","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nstruct segtree{\n vi tree;\n int n;\n ll op(ll a,ll b){return max(a,b);}\n ll e(){return -1e18;}\n segtree(int _N){\n n=1;\n while(n<_N)n<<=1;\n tree.assign(2*n,e());\n }\n void set(int i,ll x){\n i+=n;\n tree[i]=x;\n while(i>1){\n i>>=1;\n tree[i]=op(tree[2*i],tree[2*i+1]);\n }\n }\n ll prod(int l,int r){\n l+=n;r+=n;\n ll L=e(),R=e();\n while(l<r){\n if(l%2)L=op(L,tree[l++]);\n if(r%2)R=op(tree[--r],R);\n l>>=1;r>>=1;\n }\n return op(L,R);\n }\n};\nint main(){\n ll W,H,K,N;cin>>W>>H>>K>>N;\n vvi D(H);\n REP(i,N){\n ll x,y;cin>>x>>y;x--;y--;\n if(y%2)D[y].emplace_back(x);\n }\n if(K<(W+1)/2){cout<<-1<<endl;return 0;}\n K-=(W+1)/2;\n ll ans=0;\n vi DP(W/2+2,1e18);\n REP(i,H/2){\n auto A=D[2*i+1];\n if(W==1){\n if(sz(A))ans++;\n continue;\n }\n vi B,C;\n for(auto i:A){\n if(i%2)C.emplace_back(i/2);\n else B.emplace_back(i/2);\n }\n sort(ALL(B));\n sort(ALL(C));\n vi X;\n FOR(j,-5,6){\n for(auto k:B){\n if(0<=k+j&&k+j<=(W+1)/2)X.emplace_back(k+j);\n }\n for(auto k:C){\n if(0<=k+j&&k+j<=(W+1)/2)X.emplace_back(k+j);\n }\n }\n sort(ALL(X));\n X.erase(unique(ALL(X)),X.end());\n REP(i,sz(X)){\n ll j=i;\n while(i<sz(X)&&X[i]==X[j]+i-j)i++;\n FOR(k,j,i)DP[X[k]]=1e18;\n DP[X[j]]=0;\n FOR(k,j,i-1){\n if(binary_search(ALL(C),X[k])==false&&k+2<i)DP[X[k+2]]=min(DP[X[k+2]],DP[X[k]]);\n DP[X[k+1]]=min(DP[X[k+1]],DP[X[k]]+binary_search(ALL(B),X[k]));\n }\n ans+=DP[X[i-1]];\n i--;\n }\n // DP[0]=0;\n // REP(i,W/2+1){\n // if(i&&!binary_search(ALL(C),i-1))DP[i+1]=DP[i-1];\n // DP[i+1]=min(DP[i+1],DP[i]+binary_search(ALL(B),i));\n // }\n // ans+=DP.back();\n //i->i+1 にコスト B\n //i->i+2 はNG\n //Aのうち最小で何個踏むことになるのか \n }\n ll total=(H/2)*((W+1)/2);\n if(K>=ans)cout<<max(0LL,total-K)<<endl;\n else cout<<total+ans-2*K<<endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":6268,"score_of_the_acc":-0.0486,"final_rank":6},{"submission_id":"aoj_2787_9640066","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint dog[10001][10001];\nint dp[10010];\n\nint main() {\n int W, H, K;\n scanf(\"%d%d%d\", &W, &H, &K);\n int N;\n scanf(\"%d\", &N);\n int x, y;\n for (int i = 1; i <= N; i++) {\n scanf(\"%d%d\", &y, &x);\n dog[x][y] = 1;\n }\n if (K < W / 2 + 1) { // Если не хватило для каждой верхней трубы\n printf(\"-1\\n\");\n return 0;\n }\n int ans = 0;\n for (int i = 2; i < H; i += 2) {\n memset(dp, 0x3f, sizeof(dp));\n dp[0] = 0;\n // Считается только доп время за трубы.\n for (int j = 1; j <= W; j += 2) {\n // Напрямую сверху {\n dp[j] = dog[i][j];\n if (j > 1) {\n dp[j] += dp[j-2];\n }\n // }\n // Крест накрест {\n if (j > 3) {\n dp[j] = min(dp[j], dp[j-4] + 2 * dog[i][j-1]);\n } else if (j > 1) {\n dp[j] = min(dp[j], 2 * dog[i][j-1]);\n }\n // }\n }\n ans += dp[W];\n }\n K -= W / 2 + 1;\n int num = (H / 2) * (W / 2 + 1) - ans;\n if (K <= ans) {\n ans -= K;\n } else {\n K -= ans;\n ans = 0;\n if (K <= num) {\n num -= K;\n } else {\n K -= num;\n num = 0;\n }\n }\n printf(\"%d\\n\", ans * 2 + num);\n}","accuracy":1,"time_ms":130,"memory_kb":268172,"score_of_the_acc":-1.1154,"final_rank":19},{"submission_id":"aoj_2787_8408349","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// ===================================================================== Solve Function =====================================================================\npair<int, int> SubSolve(int N, vector<bool> L1, vector<bool> L2) {\n // Step 1. First Division\n vector<int> vec;\n vec.push_back(0);\n for (int i = 0; i < N; i++) {\n if (L2[i] == true) vec.push_back(i + 1);\n }\n vec.push_back(N);\n\n // Step 2. Second Greedy\n vector<int> cons(N + 1, 0);\n for (int i = 0; i < (int)vec.size() - 1; i++) {\n if ((vec[i + 1] - vec[i]) % 2 == 0) continue;\n int cnt = 0;\n for (int j = vec[i]; j < vec[i + 1]; j++) {\n if (L1[j] == false && (j - vec[i]) % 2 == 0) cnt += 1;\n }\n if (cnt >= 1) continue;\n\n // Special Case\n int num = 0; if (vec[i] >= 1) num = cons[vec[i] - 1];\n int idx = -1;\n if (num % 2 == 0) idx = vec[i + 1] - 1;\n if (num % 2 == 1) idx = vec[i];\n cons[idx] = num + 1;\n }\n\n // Step 3. Calculate\n int ret1 = 0;\n int ret2 = 0;\n for (int i = 0; i < N + 1; i++) {\n if (cons[i] >= 1 && cons[i + 1] == 0) {\n ret1 += (cons[i] / 2);\n ret2 += (cons[i] % 2);\n }\n }\n return make_pair(ret1, ret2);\n}\n\n// ===================================================================== Main Function =====================================================================\nint W;\nint H;\nint K;\nint N, X[1 << 19], Y[1 << 19];\nbool Dog[10009][10009];\n\nint main() {\n // Step 1. Input\n cin >> W >> H >> K;\n cin >> N;\n for (int i = 1; i <= N; i++) cin >> Y[i] >> X[i];\n for (int i = 1; i <= N; i++) Dog[X[i]][Y[i]] = true;\n\n // Step 2. Get Answer\n int Answer1 = 0;\n int Answer2 = 0;\n for (int i = 2; i <= H; i += 2) {\n vector<bool> L1((W + 1) / 2, false);\n vector<bool> L2((W - 1) / 2, false);\n for (int j = 1; j <= W; j++) {\n if (Dog[i][j] == false) continue;\n if (j % 2 == 1) L1[(j - 1) / 2] = true;\n if (j % 2 == 0) L2[(j - 1) / 2] = true;\n }\n pair<int, int> ret = SubSolve(L1.size(), L1, L2);\n Answer1 += ret.first;\n Answer2 += ret.second;\n }\n \n // Step 3. Output\n if (K < ((W + 1) / 2)) {\n cout << \"-1\" << endl;\n }\n else {\n int cur = 2 * Answer1 + 1 * Answer2;\n int rem = K - ((W + 1) / 2);\n int FinalAns = 0;\n if (rem < Answer1) FinalAns = cur - 2 * rem;\n else if (rem < Answer1 + Answer2) FinalAns = (Answer1 + Answer2 - rem);\n else FinalAns = 0;\n cout << max(0, ((H + 1) / 2) * ((W + 1) / 2) - K) + FinalAns << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":103696,"score_of_the_acc":-0.4553,"final_rank":17},{"submission_id":"aoj_2787_8399597","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <cstdint>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <functional>\n#include <ctime>\n#include <fstream>\n#include <cmath>\n#include <limits>\n#include <chrono>\n#include <numeric>\n#include <type_traits>\n#include <iomanip>\n#include <float.h>\n#include <math.h>\n#include <cassert>\n#include <random>\n//#include <bit>\n#include <cstdint>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\nusing ll = long long;\n\n\n\n\nll ll_gcd(ll a, ll b) {\n\tif (a < b) return ll_gcd(b, a);\n\tll r;\n\twhile ((r = a % b)) {\n\t\ta = b;\n\t\tb = r;\n\t}\n\treturn b;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\n\tif (n < 0)return 0;\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\nlong long modinv(long long a, long long mod) {\n\treturn modpow(a, mod - 2, mod);\n}\n\nll merge_cnt(vector<ll>& a) {\n\tint n = a.size();\n\tif (n <= 1) { return 0; }\n\n\tll cnt = 0;\n\tvector<ll> b(a.begin(), a.begin() + n / 2);\n\tvector<ll> c(a.begin() + n / 2, a.end());\n\n\tcnt += merge_cnt(b);\n\tcnt += merge_cnt(c);\n\n\tint ai = 0, bi = 0, ci = 0;\n\twhile (ai < n) {\n\t\tif (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {\n\t\t\ta[ai++] = b[bi++];\n\t\t}\n\t\telse {\n\t\t\tcnt += n / 2 - bi;\n\t\t\ta[ai++] = c[ci++];\n\t\t}\n\t}\n\treturn cnt;\n}\n\ntemplate< typename T >\nsize_t longest_increasing_subsequence(const vector< T >& a, bool strict) {\n\tvector< T > lis;\n\tfor (auto& p : a) {\n\t\ttypename vector< T >::iterator it;\n\t\tif (strict) it = lower_bound(begin(lis), end(lis), p);\n\t\telse it = upper_bound(begin(lis), end(lis), p);\n\t\tif (end(lis) == it) lis.emplace_back(p);\n\t\telse *it = p;\n\t}\n\treturn lis.size();\n}\n\n\nconstexpr uint32_t PrimitiveRoot(uint32_t mod) {\n\tusing u64 = uint64_t;\n\tif (mod == 2) return 1;\n\tu64 ds[32] = {};\n\tint idx = 0;\n\tu64 m = mod - 1;\n\tfor (u64 i = 2; i * i <= m; ++i) {\n\t\tif (m % i == 0) {\n\t\t\tds[idx++] = i;\n\t\t\twhile (m % i == 0) m /= i;\n\t\t}\n\t}\n\tif (m != 1) ds[idx++] = m;\n\n\tuint32_t pr = 2;\n\twhile (1) {\n\t\tint flg = 1;\n\t\tfor (int i = 0; i < idx; ++i) {\n\t\t\tu64 a = pr, b = (mod - 1) / ds[i], r = 1;\n\t\t\twhile (b) {\n\t\t\t\tif (b & 1) r = r * a % mod;\n\t\t\t\ta = a * a % mod;\n\t\t\t\tb >>= 1;\n\t\t\t}\n\t\t\tif (r == 1) {\n\t\t\t\tflg = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flg == 1) break;\n\t\t++pr;\n\t}\n\treturn pr;\n}\n\n\nstruct edge { ll to; ll cost; };\ntypedef pair<ll, ll> P;\nstruct graph {\n\tll V;\n\tvector<vector<edge> > G;\n\tvector<ll> d;\n\n\tgraph(ll n) {\n\t\tinit(n);\n\t}\n\n\tvoid init(ll n) {\n\t\tV = n;\n\t\tG.resize(V);\n\t\td.resize(V);\n\t\tfor (int i = 0; i < V; i++) {\n\t\t\td[i] = 2000000000000000000;\n\t\t}\n\t}\n\n\tvoid add_edge(ll s, ll t, ll cost) {\n\t\tedge e;\n\t\te.to = t, e.cost = cost;\n\t\tG[s].push_back(e);\n\t}\n\n\tvoid dijkstra(ll s) {\n\t\tfor (int i = 0; i < V; i++) {\n\t\t\td[i] = 2000000000000000000;\n\t\t}\n\t\td[s] = 0;\n\t\tpriority_queue<P, vector<P>, greater<P> > que;\n\t\tque.push(P(0, s));\n\t\twhile (!que.empty()) {\n\t\t\tP p = que.top(); que.pop();\n\t\t\tll v = p.second;\n\t\t\tif (d[v] < p.first) continue;\n\t\t\tfor (auto e : G[v]) {\n\t\t\t\tif (d[e.to] > d[v] + e.cost) {\n\t\t\t\t\td[e.to] = d[v] + e.cost;\n\t\t\t\t\tque.push(P(d[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nstruct UnionFind {\n\tvector <ll> par;\n\tvector <ll> siz;\n\tUnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {\n\t\tfor (ll i = 0; i < sz_; ++i) par[i] = i;\n\t}\n\tvoid init(ll sz_) {\n\t\tpar.resize(sz_);\n\t\tsiz.assign(sz_, 1LL);\n\t\tfor (ll i = 0; i < sz_; ++i) par[i] = i;\n\t}\n\tll root(ll x) {\n\t\twhile (par[x] != x) {\n\t\t\tx = par[x] = par[par[x]];\n\t\t}\n\t\treturn x;\n\t}\n\tbool merge(ll x, ll y) {\n\t\tx = root(x);\n\t\ty = root(y);\n\t\tif (x == y) return false;\n\t\tif (siz[x] < siz[y]) swap(x, y);\n\t\tsiz[x] += siz[y];\n\t\tpar[y] = x;\n\t\treturn true;\n\t}\n\n\tbool issame(ll x, ll y) {\n\t\treturn root(x) == root(y);\n\t}\n\n\tll size(ll x) {\n\t\treturn siz[root(x)];\n\t}\n};\n\n//using mint = modint998244353;\n\n\nlong long extGCD(long long a, long long b, long long& x, long long& y) {\n\tif (b == 0) {\n\t\tx = 1;\n\t\ty = 0;\n\t\treturn a;\n\t}\n\tlong long d = extGCD(b, a % b, y, x);\n\ty -= a / b * x;\n\treturn d;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tll w, h, k;\n\tcin >> h >> w >> k;\n\tll n;\n\tcin >> n;\n\tvector<vector<ll>> z(w,{-1,h});\n\tfor (int i = 0; i < n; i++) {\n\t\tll x, y;\n\t\tcin >> x >> y;\n\t\ty--;\n\t\tx--;\n\t\tz[y].push_back(x);\n\t}\n\tll ans = 0;\n\tfor (int i = 0; i < w; i++) {\n\t\tif (i % 2 == 0)continue;\n\t\tsort(z[i].begin(), z[i].end());\n\t\tvector<vector<ll>> a(1);\n\t\tll now = 0;\n\t\tfor (int j = 0; j < z[i].size(); j++) {\n\t\t\ta[now].push_back(z[i][j]);\n\t\t\tif (z[i][j] != h && z[i][j] != -1 && z[i][j] % 2 == 1) {\n\t\t\t\tnow++;\n\t\t\t\ta.push_back({});\n\t\t\t\ta[now].push_back(z[i][j]);\n\t\t\t}\n\t\t}\n\t\t\tfor (int ij = 0; ij < a.size(); ij++) {\n\t\t\t\tll t = 1;\n\t\t\t\tif ((a[ij][a[ij].size() - 1] - a[ij][0]) % 4 == 0)t = 0;\n\t\t\t\tset<ll> p;\n\t\t\t\tfor (int k = 1; k < a[ij].size(); k++) {\n\t\t\t\t\tp.insert(a[ij][k]);\n\t\t\t\t}\n\t\t\t\tfor (int ks = a[ij][0] +1; ks < a[ij][a[ij].size() - 1]; ks+=4) {\n\t\t\t\t\tif (!p.count(ks)) {\n\t\t\t\t\t\tt = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tans += t;\n\t\t\t}\n\t\t\n\t}\n\tif (h / 2 + 1 > k)cout << -1 << endl;\n\telse if (ans + h / 2 + 1 < k) {\n\t\tcout << max((ll)(h / 2+1) * (w / 2+1) - k, (ll)0) << endl;\n\t}\n\telse {\n\t\tcout << (h / 2 + 1) * (w / 2 + 1) + (ans)-2 * (k)+h/2+1 << endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":4872,"score_of_the_acc":-0.0049,"final_rank":1},{"submission_id":"aoj_2787_7181378","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\nusing ll = long long;\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;}\nconst int INF = (1<<30)-1;\n#define all(p) p.begin(),p.end()\nconst int mod=998244353;\n\nint main(){\n\tint W,H,K;\n\tcin>>W>>H>>K;\n\tint N;\n\tcin>>N;\n\tvector<vector<int>> p(H/2);\n\trep(i,0,N){\n\t\tint x,y;\n\t\tcin>>x>>y;\n\t\tif(y%2) continue;\n\t\tp[y/2-1].push_back(x-1);\n\t}\n\tint ans=0;\n\trep(i,0,H/2){\n\t\tvector<int> dp(W/2+3,INF);\n\t\tp[i].push_back(INF);\n\t\tsort(all(p[i]));\n\t\tint ind=0;\n\t\tdp[0]=0;\n\t\trep(j,0,W/2+1){\n\t\t\tif(p[i][ind]==j*2){\n\t\t\t\tchmin(dp[j+1],dp[j]+1);\n\t\t\t\tind++;\n\t\t\t}else{\n\t\t\t\tchmin(dp[j+1],dp[j]);\n\t\t\t}\n\t\t\tif(p[i][ind]==j*2+1){\n\t\t\t\tchmin(dp[j+2],dp[j]+2);\n\t\t\t\tind++;\n\t\t\t}else{\n\t\t\t\tchmin(dp[j+2],dp[j]);\n\t\t\t}\n\t\t}\n\t\tans+=dp[W/2+1];\n\t}\n\tif(K<W/2+1){\n\t\tcout<<\"-1\\n\";\n\t\treturn 0;\n\t}\n\tans=max(0,ans-(K-(W/2+1)));\n\tans+=max(0,(W/2+1)*(H/2+1)-K);\n\tcout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":70,"memory_kb":3956,"score_of_the_acc":-0.0591,"final_rank":10},{"submission_id":"aoj_2787_7177866","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 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\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int w,h,k; cin >> w >> h >> k;\n int n; cin >> n;\n h = (h+1)/2;\n w = (w+1)/2;\n if(w > k){\n cout << -1 << endl;\n return 0;\n }\n vector<vector<int>> v(h-1);\n for(int i=0;i<n;i++){\n int x,y; cin >> x >> y;\n if(y%2 == 0){\n v[y/2-1].push_back(x-1);\n }\n }\n constexpr int mx = 1e9;\n int cost = 0; // 2\n vector<int> dp(w+1,mx);\n for(int i=0;i+1<h;i++){\n if(!v[i].size()) continue;\n fill(dp.begin(), dp.end(), mx);\n dp[0] = 0;\n vector<bool> down(w),cross(w);\n for(int j:v[i]){\n if(j%2 == 0) down[j/2] = true;\n else cross[j/2] = true;\n }\n for(int j=0;j<w;j++){\n dp[j+1] = min(dp[j+1], dp[j]+down[j]);\n if(j+1<w){\n dp[j+2] = min(dp[j+2], dp[j]+cross[j]+cross[j]);\n }\n }\n cost += dp.back();\n }\n int res = (h-1)*w;\n k -= w;\n if(k >= cost){\n res -= k;\n }\n else{\n res += (cost-k);\n res -= k;\n }\n cout << max(0,res) << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":3988,"score_of_the_acc":-0.0496,"final_rank":8},{"submission_id":"aoj_2787_7177860","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 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\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int w,h,k; cin >> w >> h >> k;\n int n; cin >> n;\n h = (h+1)/2;\n w = (w+1)/2;\n if(w > k){\n cout << -1 << endl;\n return 0;\n }\n vector<vector<int>> v(h-1);\n for(int i=0;i<n;i++){\n int x,y; cin >> x >> y;\n if(y%2 == 0){\n v[y/2-1].push_back(x-1);\n }\n }\n constexpr int mx = 1e9;\n int cost = 0; // 2\n for(int i=0;i+1<h;i++){\n if(!v[i].size()) continue;\n vector<int> dp(w+1,mx);\n dp[0] = 0;\n vector<bool> down(w),cross(w);\n for(int j:v[i]){\n if(j%2 == 0) down[j/2] = true;\n else cross[j/2] = true;\n }\n for(int j=0;j<w;j++){\n dp[j+1] = min(dp[j+1], dp[j]+down[j]);\n if(j+1<w){\n dp[j+2] = min(dp[j+2], dp[j]+cross[j]+cross[j]);\n }\n }\n cost += dp.back();\n }\n int res = (h-1)*w;\n k -= w;\n if(k >= cost){\n res -= k;\n }\n else{\n res += (cost-k);\n res -= k;\n }\n cout << max(0,res) << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":3960,"score_of_the_acc":-0.0495,"final_rank":7},{"submission_id":"aoj_2787_6054152","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define eps 1e-9\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\n\n#define popcount __builtin_popcount\n#define next __next\n#define prev __prev\n\n#ifndef LOCAL\n#define dmp(...) ;\n#else\n#define dmp(...) \\\n cerr << \"[ \" << #__VA_ARGS__ << \" ] : \" << dump_str(__VA_ARGS__) << endl\n#endif\n\n// ---------------- Utility ------------------\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a >= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\n\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\n// ----------------- Input -------------------\n\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\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}\n\n// ----------------- Output ------------------\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ',' << p.second;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (const T &e : v) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const deque<T> &d) {\n for (const T &e : d) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const set<T> &s) {\n os << \"{ \";\n for (const T &e : s) os << e << \" \";\n return os << \"}\";\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const map<T, U> &m) {\n os << \"{ \";\n for (const auto &[key, val] : m) os << \"( \" << key << \" -> \" << val << \" ) \";\n return os << \"}\";\n}\n\ntemplate <class TupleTy, size_t... I>\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\n (..., (os << (I == 0 ? \"\" : \",\") << std::get<I>(t)));\n}\n\ntemplate <class... Args>\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\n os << \"(\";\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\n return os << \")\";\n}\n\nvoid dump_str_rec(ostringstream &) {}\n\ntemplate <class Head, class... Tail>\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << \", \" << head;\n dump_str_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate <class T, class... U>\nstring dump_str(T &&arg, U &&... args) {\n ostringstream oss;\n oss << arg;\n dump_str_rec(oss, forward<U>(args)...);\n return oss.str();\n}\n\n// --------------- Fast I/O ------------------\n\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n// ------------------ ACL --------------------\n\n// #include <atcoder/modint>\n// constexpr int MOD = 998244353;\n// constexpr int MOD = 1000000007;\n// using mint = atcoder::static_modint<MOD>;\n// ostream &operator<<(ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\n// ------------ End of template --------------\n\n#define endl \"\\n\"\nusing ll = long long;\nusing pii = pair<int, int>;\n\nconst bool multitest = false;\n\nvoid solve() {\n ll W, H, K;\n cin >> W >> H >> K;\n int N;\n cin >> N;\n\n set<int> us;\n for (int i = 0; i < N; i++) {\n int x, y;\n cin >> x >> y;\n us.insert(y * (int)W + x);\n }\n\n ll w = (W + 1) / 2;\n ll h = (H + 1) / 2;\n if (K < w) {\n cout << -1 << endl;\n return;\n }\n\n if (K >= w * h) {\n cout << 0 << endl;\n return;\n }\n\n K -= w;\n\n ll need_dog = 0ll;\n\n auto check = [&](int X, int Y) {\n if (us.count(X * (int)W + Y))\n return true;\n else\n return false;\n };\n\n for (int i = 3; i <= H; i += 2) {\n vector<ll> dp(w + 1, INF);\n dp[0] = 0;\n for (int j = 0; j < w; j++) {\n if (check(i - 1, 2 * j + 1))\n chmin(dp[j + 1], dp[j] + 1);\n else\n chmin(dp[j + 1], dp[j]);\n if (j + 2 <= w) {\n if (check(i - 1, 2 * j + 2))\n chmin(dp[j + 2], dp[j] + 2);\n else\n chmin(dp[j + 2], dp[j]);\n }\n }\n dmp(dp[w]);\n need_dog += dp[w];\n }\n\n ll need_common = (h - 1) * w - need_dog;\n\n {\n ll val = min(need_dog, K);\n need_dog -= val;\n K -= val;\n }\n\n {\n ll val = min(need_common, K);\n need_common -= val;\n K -= val;\n }\n\n cout << need_common + need_dog * 2ll << endl;\n return;\n}\n\nint main() {\n fastio();\n if (!multitest) {\n solve();\n } else {\n cerr << \"[Warning] Multi testcase mode on\" << endl;\n int t;\n cin >> t;\n while (t--) solve();\n }\n return 0;\n}","accuracy":1,"time_ms":1050,"memory_kb":8100,"score_of_the_acc":-1.0171,"final_rank":18},{"submission_id":"aoj_2787_6024536","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.11.03 12:07:40 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\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 popcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\n#pragma endregion\n\n#pragma region aliases\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nconst int inf = 1e9;\nconst long long INF = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod_1000000007 = 1000000007;\nconst int mod_998244353 = 998244353;\n\n#pragma endregion\n\n#pragma region basic_operation\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 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) { std::cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(bool f = 1) { std::cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { std::cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag = true) {\n\tif(!flag) return;\n\tstd::cout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\treturn (a + b - 1) / b;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\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\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\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 < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\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\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(std::vector<T> &a) {\n\tauto vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::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>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::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\nnamespace viewer {\nvoid view(const long long e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\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\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\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::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\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\tstd::cerr << \"{ }\";\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\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n} // namespace viewer\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\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tviewer::view(x); \\\n\t\tstd::cerr << '\\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\nll solve(int w) {\n\tint h;\n\tll k;\n\tcin >> h >> k;\n\tint n;\n\tcin >> n;\n\tV<pair<int, int>> dogs;\n\trep(n) {\n\t\tint x, y;\n\t\tcin >> y >> x;\n\t\tdogs.emplace_back(x, y);\n\t}\n\tsort(all(dogs));\n\n\tll houses = ll(dup(h, 2)) * ll(dup(w, 2));\n\tll cost = dup(w, 2);\n\tif(cost > k) return -1;\n\thouses -= cost;\n\tk -= cost;\n\tcost = 0;\n\n\tfor(auto it = dogs.begin(); it != dogs.end();) {\n\t\tint x = it->first;\n\t\tvi ys;\n\t\twhile(it != dogs.end() && it->first == x) {\n\t\t\tys.push_back((it++)->second);\n\t\t}\n\t\tdebug(x, ys);\n\t\tif(x & 1) continue;\n\n\t\tset<int> yset(ys.begin(), ys.end());\n\n\t\tint pre_notvalid = -1;\n\t\tfoa(y, ys) {\n\t\t\tif(y & 1) {\n\t\t\t\tif(pre_notvalid == y) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else if(!yset.count(y - 1) && pre_notvalid != y - 2) {\n\t\t\t\t\t// ok\n\t\t\t\t} else if(!yset.count(y + 1) && y + 2 <= w) {\n\t\t\t\t\tpre_notvalid = y + 2;\n\t\t\t\t} else {\n\t\t\t\t\tcost++;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// pass\n\t\t\t}\n\t\t}\n\t}\n\n\tdebug(houses, cost, k);\n\n\tll ret = 0;\n\tll special_two = min(cost, k);\n\tk -= special_two;\n\thouses -= cost;\n\tcost -= special_two;\n\tret += cost * 2 + max(0LL, houses - k);\n\treturn ret;\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tstd::cout << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint w;\n\twhile(cin >> w && w) {\n\t\tcout << solve(w) << dl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4252,"score_of_the_acc":-0.0122,"final_rank":2},{"submission_id":"aoj_2787_5826973","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=100005,INF=1<<30;\n\nvector<int> wh[MAX];\n\nint dp[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 H,W,K;cin>>W>>H>>K;\n int N;cin>>N;\n set<pair<int,int>> SE;\n \n for(int i=0;i<N;i++){\n int h,w;cin>>w>>h;\n wh[h].push_back(w+4);\n SE.insert(mp(h,w+4));\n }\n \n int need=0;\n \n for(int i=1;i<=H;i++){\n sort(all(wh[i]));\n int j=0;\n while(j<si(wh[i])){\n int k=j+1;\n while(k<si(wh[i])&&wh[i][k]-wh[i][k-1]<=6) k++;\n int s=wh[i][j]-1,t=wh[i][k-1]+1;\n if(s%2==0) s--;\n if(s<5) s+=2;\n if(t%2==0) t++;\n if(t>W+4) t-=2;\n for(int w=s;w<=t;w++) dp[w]=INF;\n dp[s-2]=0;\n for(int w=s-2;w<t;w+=2){\n if(SE.count(mp(i,w+2))) chmin(dp[w+2],dp[w]+1);\n else chmin(dp[w+2],dp[w]);\n \n if(w+4<=t){\n if(SE.count(mp(i,w+3))) chmin(dp[w+4],dp[w]+2);\n else chmin(dp[w+4],dp[w]);\n }\n }\n \n //cout<<j<<\" \"<<k<<\" \"<<s<<\" \"<<t<<\" \"<<dp[t]<<endl;\n \n need+=dp[t];\n \n j=k;\n }\n }\n \n if(K<(W+1)/2){\n cout<<-1<<endl;\n }else{\n K-=(W+1)/2;\n int al=(H-1)/2*(W+1)/2;\n chmin(K,al);\n int ans=al+need;\n if(need>=K) ans-=2*K;\n else ans-=2*need+(K-need);\n \n cout<<ans<<endl;\n \n }\n}","accuracy":1,"time_ms":40,"memory_kb":11304,"score_of_the_acc":-0.0581,"final_rank":9},{"submission_id":"aoj_2787_5404181","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 10000000;\nint main(){\n int W, H, K;\n cin >> W >> H >> K;\n int w = (W + 1) / 2, h = (H + 1) / 2;\n if (K < w){\n cout << -1 << endl;\n } else {\n int N;\n cin >> N;\n vector<vector<int>> p(h);\n for (int i = 0; i < N; i++){\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n if (y % 2 == 1){\n p[(y - 1) / 2].push_back(x);\n }\n }\n int mn = 0;\n for (int i = 0; i < h; i++){\n if (!p[i].empty()){\n \tint cnt = p[i].size();\n set<int> st;\n for (int j = 0; j < cnt; j++){;\n st.insert(p[i][j]);\n }\n vector<int> dp(w + 1, INF);\n dp[0] = 0;\n for (int j = 0; j < w; j++){\n if (st.count(j * 2) == 0){\n dp[j + 1] = min(dp[j + 1], dp[j]);\n } else {\n dp[j + 1] = min(dp[j + 1], dp[j] + 1);\n }\n if (j < w - 1){\n if (st.count(j * 2 + 1) == 0){\n dp[j + 2] = min(dp[j + 2], dp[j]);\n } else {\n dp[j + 2] = min(dp[j + 2], dp[j] + 2);\n }\n }\n }\n mn += dp[w];\n }\n }\n int ans = (h - 1) * w + mn;\n K -= w;\n if (K < mn){\n ans -= K * 2;\n } else {\n ans -= mn * 2;\n K -= mn;\n ans = max(ans - K, 0);\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":250,"memory_kb":3884,"score_of_the_acc":-0.2319,"final_rank":15},{"submission_id":"aoj_2787_5404179","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 10000000;\nint main(){\n int W, H, K;\n cin >> W >> H >> K;\n int w = (W + 1) / 2, h = (H + 1) / 2;\n if (K < w){\n cout << -1 << endl;\n } else {\n int N;\n cin >> N;\n vector<vector<int>> p(h);\n for (int i = 0; i < N; i++){\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n if (y % 2 == 1){\n p[(y - 1) / 2].push_back(x);\n }\n }\n int mn = 0;\n for (int i = 0; i < h; i++){\n if (!p[i].empty()){\n p[i].insert(p[i].begin(), -1);\n p[i].push_back(W);\n int cnt = p[i].size();\n /*\n vector<int> d(cnt - 1);\n for (int j = 0; j < cnt - 1; j++){\n d[j] = p[i][j + 1] - p[i][j];\n if (d[j] > 8){\n d[j] -= (d[j] - 8) / 2 * 2;\n }\n }\n for (int j = 0; j < cnt - 1; j++){\n p[i][j + 1] = p[i][j] + d[j];\n }\n */\n int W2 = (p[i][cnt - 1] + 1) / 2;\n set<int> st;\n for (int j = 1; j < cnt - 1; j++){;\n st.insert(p[i][j]);\n }\n vector<int> dp(W2 + 1, INF);\n dp[0] = 0;\n for (int j = 0; j < W2; j++){\n if (st.count(j * 2) == 0){\n dp[j + 1] = min(dp[j + 1], dp[j]);\n } else {\n dp[j + 1] = min(dp[j + 1], dp[j] + 1);\n }\n if (j < W2 - 1){\n if (st.count(j * 2 + 1) == 0){\n dp[j + 2] = min(dp[j + 2], dp[j]);\n } else {\n dp[j + 2] = min(dp[j + 2], dp[j] + 2);\n }\n }\n }\n mn += dp[W2];\n }\n }\n int ans = (h - 1) * w + mn;\n K -= w;\n if (K < mn){\n ans -= K * 2;\n } else {\n ans -= mn * 2;\n K -= mn;\n ans = max(ans - K, 0);\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":180,"memory_kb":3724,"score_of_the_acc":-0.164,"final_rank":13},{"submission_id":"aoj_2787_5356638","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#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<unordered_set>\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 = 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 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 = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)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}\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)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 22;\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}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nbool exi[10000];\nint dp[10005];\nvoid solve() {\n\tint w, h, k; cin >> w >> h >> k;\n\tint n; cin >> n;\n\tvector<vector<int>> vs(h);\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y; x--; y--;\n\t\tvs[y].push_back(x);\n\t}\n\tk -= (w/2+1);\n\tif (k < 0) {\n\t\tcout << -1 << \"\\n\"; return;\n\t}\n\tint c1 = 0, c2 = 0;\n\tfor (int i = 1; i < h; i += 2) {\n\t\tfor (int x : vs[i])exi[x] = true;\n\t\tfor (int j = 0; j < w+2; j += 2) {\n\t\t\tdp[j] = mod;\n\t\t}\n\t\tdp[0] = 0;\n\t\tfor (int j = 0; j < w; j += 2) {\n\t\t\t//single\n\t\t\tif (exi[j]) {\n\t\t\t\tdp[j + 2] = min(dp[j + 2], dp[j] + 1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tdp[j + 2] = min(dp[j + 2], dp[j]);\n\t\t\t}\n\t\t\t//double\n\t\t\tif (j + 2 < w) {\n\t\t\t\tint cost = 0;\n\t\t\t\tif (exi[j + 1]) {\n\t\t\t\t\tcost = 2;\n\t\t\t\t}\n\t\t\t\tdp[j + 4] = min(dp[j + 4], dp[j] + cost);\n\t\t\t}\n\t\t}\n\t\tc2 += dp[w + 1];\n\t\tc1 += (w / 2 + 1) - dp[w + 1];\n\t\tfor (int x : vs[i])exi[x] = false;\n\t}\n\t//cout << c1 << \" \" << c2 << \"\\n\";\n\tint ans = c1 + 2 * c2;\n\tint m = min(c2, k);\n\tans -= 2 * m; k -= m;\n\tm = min(c1, k);\n\tans -= m;\n\tcout << ans << \"\\n\";\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//init_f();\n\t//init();\n\t//expr();\n\t//int t; cin >> t; rep(i, t)\n\t\t//expr();\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":69764,"score_of_the_acc":-0.2886,"final_rank":16},{"submission_id":"aoj_2787_5315011","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nconst int inf = 1e9;\n\nint prev(int a, vector<int> &v){\n auto itr = lower_bound(v.begin(), v.end(), a);\n if(itr == v.begin()) return -inf;\n return *(itr-1);\n}\nint next(int a, vector<int> &v){\n auto itr = lower_bound(v.begin(), v.end(), a);\n if(itr == v.end()) return inf;\n return *itr;\n}\nbool isin(int a, vector<int> &v){\n auto itr = lower_bound(v.begin(), v.end(), a);\n return itr!=v.end() and *itr==a;\n}\n\nint main(){\n int w,h,k;\n cin >> w >> h >> k;\n w=(w+1)/2; h=h/2;\n if(w > k){\n cout << -1 << endl;\n return 0;\n }\n k -= w;\n int n;\n cin >> n;\n vector<vector<int>> a(h);\n for(int i=0; i<n; i++){\n int x,y;\n cin >> x >> y;\n if(y%2 == 0){\n a[y/2-1].push_back(x-1);\n }\n }\n for(auto& v: a){\n sort(v.begin(), v.end());\n }\n\n int ans = 0;\n vector<int> dp(w+1, inf);\n for(int i=0; i<h; i++){\n int base = 2*w*(h-i);\n dp[0] = base;\n for(int j=0; j<w; j++){\n int x = 2*j;\n // skip\n int nj = min(next(x, a[i])/2 -1, w);\n int pj = prev(x, a[i])/2;\n if(pj+2<j and j+2<nj){\n dp[nj] = dp[j]+(nj-j);\n j = nj-1;\n continue;\n }\n // normal\n if(j < w-1){\n int cost = (isin(x+1, a[i]))? 4: 2;\n dp[j+2] = min(dp[j+2], dp[j]+cost);\n }\n int cost = (isin(x, a[i]))? 2: 1;\n dp[j+1] = min(dp[j+1], dp[j]+cost);\n }\n ans += dp[w]-base;\n }\n int two = ans -h*w;\n int one = ans -2*two;\n if(k > two){\n ans = max(two +one -k, 0);\n }else{\n ans = 2*(two-k) +one;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3992,"score_of_the_acc":-0.0208,"final_rank":4},{"submission_id":"aoj_2787_5314991","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nconst int inf = 1e9;\n\nint next(int a, vector<int> &v){\n auto itr = lower_bound(v.begin(), v.end(), a);\n if(itr == v.end()) return inf;\n return *itr;\n}\nbool isin(int a, vector<int> &v){\n auto itr = lower_bound(v.begin(), v.end(), a);\n return itr!=v.end() and *itr==a;\n}\n\nint main(){\n int w,h,k;\n cin >> w >> h >> k;\n w=(w+1)/2; h=h/2;\n if(w > k){\n cout << -1 << endl;\n return 0;\n }\n k -= w;\n int n;\n cin >> n;\n vector<vector<int>> a(h);\n for(int i=0; i<n; i++){\n int x,y;\n cin >> x >> y;\n if(y%2 == 0){\n a[y/2-1].push_back(x-1);\n }\n }\n for(auto& v: a){\n sort(v.begin(), v.end());\n }\n\n int ans = 0;\n vector<int> dp(w+1, inf);\n for(int i=0; i<h; i++){\n int base = 2*w*(h-i);\n dp[0] = base;\n for(int j=0; j<w; j++){\n int x = 2*j;\n // skip\n int nj = min(next(x, a[i])/2 -1, w);\n if(nj > j+2){\n dp[nj] = dp[j]+(nj-j);\n j = nj-1;\n continue;\n }\n // normal\n if(j < w-1){\n int cost = (isin(x+1, a[i]))? 4: 2;\n dp[j+2] = min(dp[j+2], dp[j]+cost);\n }\n int cost = (isin(x, a[i]))? 2: 1;\n dp[j+1] = min(dp[j+1], dp[j]+cost);\n }\n ans += dp[w]-base;\n }\n int two = ans -h*w;\n int one = ans -2*two;\n if(k > two){\n ans = max(two +one -k, 0);\n }else{\n ans = 2*(two-k) +one;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":0.5925925925925926,"time_ms":20,"memory_kb":3832,"score_of_the_acc":-0.0106,"final_rank":20},{"submission_id":"aoj_2787_4894064","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<LL,LL> 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 for(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 for(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 if(vec_n==-1)vec_n=vec_s.size();\n for(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 if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\nint main(){\n LL n,m;\n int i,j,k;\n LL a,b,c;\n LL w,h;\n LL x,y;\n set<P> s1,s2;\n cin>>w>>h>>m;\n vector<vector<LL>> v1(h);\n cin>>n;\n for(i=0;i<n;i++){\n cin>>a>>b;\n a--,b--;\n s1.insert(make_pair(a,b));\n if(b%2==0)continue;\n a/=2,b=(b+1)/2;\n if(s2.find(make_pair(a,b))==s2.end()){\n v1[b].push_back(a);\n s2.insert(make_pair(a,b));\n }\n a--;\n if(a<0)continue;\n if(s2.find(make_pair(a,b))==s2.end()){\n v1[b].push_back(a);\n s2.insert(make_pair(a,b));\n }\n }\n if(m<=w/2){\n cout<<-1<<endl;\n return 0;\n }\n m-=w/2+1;\n b=0;\n for(i=1;i<h/2+1;i++){\n int t[5]={0};\n a=-10;\n sort(v1[i].begin(),v1[i].end());\n if(v1[i].empty() || v1[i].back()!=w/2)v1[i].push_back(w/2);\n for(auto num:v1[i]){\n if(a+1==num){\n t[0]=t[1],t[1]=t[2],t[2]=INF;\n }else{\n t[0]=min({t[1],t[2]});\n t[1]=t[2]=INF;\n }\n a=num;\n x=num*2,y=i*2;\n if(s1.find(make_pair(x,y-1))!=s1.end())t[1]=min(t[0]+1,t[1]);\n else t[1]=min(t[0],t[1]);\n if(s1.find(make_pair(x+1,y-1))!=s1.end())t[2]=min(t[0]+2,t[2]);\n else t[2]=min(t[0],t[2]);\n }\n b+=t[1];\n }\n a=(w/2+1)*(h/2)-b;\n c=min(b,m);\n b-=c,m-=c;\n a-=min(a,m);\n cout<<a+2*b<<endl;\n}","accuracy":1,"time_ms":140,"memory_kb":18336,"score_of_the_acc":-0.1808,"final_rank":14},{"submission_id":"aoj_2787_3931324","code_snippet":"#include<deque>\n#include<queue>\n#include<vector>\n#include<algorithm>\n#include<iostream>\n#include<set>\n#include<cmath>\n#include<tuple>\n#include<string>\n#include<chrono>\n#include<functional>\n#include<iterator>\n#include<random>\n#include<unordered_set>\n#include<array>\n#include<map>\n#include<iomanip>\n#include<assert.h>\n#include<list>\n#include<bitset>\n#include<stack>\n#include<memory>\n#include<numeric>\nusing namespace std;\nusing namespace std::chrono;\ntypedef long long int llint;\ntypedef long double lldo;\n#define mp make_pair\n#define mt make_tuple\n#define pub push_back\n#define puf push_front\n#define pob pop_back\n#define pof pop_front\n#define fir first\n#define sec second\n#define res resize\n#define ins insert\n#define era erase\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\nconst llint mod=1000000007;\nconst llint big=2.19e15+1;\nconst long double pai=3.141592653589793238462643383279502884197;\nconst long double eps=1e-12;\ntemplate <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}\ntemplate <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\ntemplate<class T>llint LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\ntemplate<class T>llint UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\n\nint main(void){\n\tint w,h,K,n,i;cin>>w>>h>>K>>n;\n\tint H=(h+1)/2,W=(w+1)/2;\n\tvector<pair<int,int>>dog(n+1);\n\tdog[n]=mp(mod,mod);\n\tfor(i=0;i<n;i++){cin>>dog[i].sec>>dog[i].fir;}\n\tSO(dog);\n\tK-=W;\n\tif(K<0){cout<<-1<<endl;return 0;}\n\tpair<int,int>mae=mp(-1,-1);\n\tint ans=0,dp=0,ep=0,fp=0;\n\tfor(auto it:dog){\n\t\tif(mae.fir!=it.fir||mae.sec+6<=it.sec){//清算します\n\t\t\tans+=min({dp,ep,fp});\n\t\t\tdp=0;ep=0;fp=0;\n\t\t\tif(it.sec==1){dp=99;}\n\t\t\t\n\t\t}else{\n\t\t\tfor(i=mae.sec+1;i<=it.sec;i++){\n\t\t\t\tif(i%2==1){int sp=min(dp,ep);dp=fp;ep=sp;fp=sp;}\n\t\t\t}\n\t\t}\n\t\tif(it.sec%2==0){fp+=2;}//中間\n\t\telse{ep++;}\n\t\tif(it.sec==w){fp=mod;}\n\t\tmae=it;\n\t}\n\t//cerr<<\"ans=\"<<ans<<endl;\n\tcout<<max(0,(H-1)*W-K)+max(0,ans-K)<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3576,"score_of_the_acc":-0.0192,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2787_10851470\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <cmath>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <cassert>\\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;\\nconst ll mod=1000000007;\\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;}\\n// head\\n\\nconst int N=10100;\\n//map<int,int> dp,v,c;\\nVI cand,d[N];\\nint w,h,k,n,x,y,v[N],c[N],dp[N];\\n//int query(int x) { return (--dp.upper_bound(x))->se;}\\nint solve(VI x) {\\n/*\\tv.clear(); c.clear();\\n\\tcand.clear();\\n\\tfor (auto p:x) {\\n\\t\\tif (p%2==0) c[p/2+1]=1;\\n\\t\\telse v[p/2+1]=1;\\n\\t\\tcand.pb(p/2+1);\\n\\t\\tif (p/2+2<=(w+1)/2) cand.pb(p/2+2);\\n\\t\\tif (p/2+3<=(w+1)/2) cand.pb(p/2+3);\\n\\t}\\n\\tcand.pb((w+1)/2);\\n\\tcand.pb(0);\\n\\tsort(all(cand));\\n\\tcand.erase(unique(all(cand)),cand.end());\\n\\tdp.clear();\\n\\tdp[0]=0;\\n\\trep(x,1,SZ(cand)) {\\n\\t\\tint i=cand[x];\\n\\t\\tdp[i]=query(i-1)+v[i];\\n\\t\\tif (i-2>=0) dp[i]=min(dp[i],query(i-2)+c[i]);\\n\\t}\\n\\treturn dp[w/2+1];*/\\n\\trep(i,1,w/2+2) {\\n\\t\\tv[i]=c[i]=0;\\n\\t}\\n\\tfor (auto p:x) {\\n\\t\\tif (p%2==0) c[p/2+1]=1; else v[p/2+1]=1;\\n\\t}\\n\\tdp[0]=0;\\n\\trep(i,1,w/2+2) {\\n\\t\\tdp[i]=dp[i-1]+v[i];\\n\\t\\tif (i>=2) dp[i]=min(dp[i],dp[i-2]+2*c[i]);\\n\\t}\\n\\treturn dp[w/2+1];\\n}\\nint main() {\\n\\tscanf(\\\"%d%d%d\\\",&w,&h,&k);\\n\\tk-=(w+1)/2;\\n\\tif (k<0) {\\n\\t\\tputs(\\\"-1\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\tscanf(\\\"%d\\\",&n);\\n\\trep(i,0,n) {\\n\\t\\tscanf(\\\"%d%d\\\",&x,&y);\\n\\t\\tif (y%2==0) d[y/2].pb(x);\\n\\t}\\n\\tint r=0;\\n\\trep(i,1,h/2+1) r+=solve(d[i]);\\n\\tint cur=(h/2)*(w/2+1)-r;\\n\\tint dd=min(r,k); r-=dd; k-=dd;\\n\\tdd=min(cur,k); cur-=dd; k-=dd;\\n\\tprintf(\\\"%d\\\\n\\\",cur+r*2);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3692,\n \"score_of_the_acc\": -0.0485,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2787_9808820\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\\\" \\\"<<p.second;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\n\\n// https://ei1333.github.io/luzhiled/snippets/graph/dinic.html\\ntemplate<typename flow_t>\\nstruct Dinic{\\n /*\\n 復元をするときはfromの頂点から出る辺からのcapを出力．\\n is_e == trueの時その辺は元のグラフにあった\\\"本当の\\\"辺．\\n \\\"本当の\\\"辺eについてfr -> toにv[e.to][e.ref].capだけフローが流れている．\\n 二部マッチングの復元の場合，仮想の始点（終点）から（へ）の辺に注意．\\n */\\n struct edge{\\n int to;\\n flow_t cap;\\n int ref;//逆辺の番号\\n bool is_e;//本物の辺かどうか\\n int idx;//入力で与えられる辺としてのindex\\n };\\n vector<vector<edge>> v;\\n vector<int> mn_cost,iter;\\n const flow_t inf;\\n Dinic(int n):inf(numeric_limits<flow_t>::max()),v(n){}\\n void add_edge(int fr,int to,flow_t cap,int idx = -1){\\n v[fr].emplace_back((edge){to,cap,(int)v[to].size(),true,idx});\\n v[to].emplace_back((edge){fr,0,(int)v[fr].size()-1,false,idx});\\n }\\n bool bfs(int s,int t){\\n mn_cost.assign(v.size(),-1);\\n queue<int> que;\\n mn_cost[s] = 0;\\n que.push(s);\\n while(!que.empty() && mn_cost[t] == -1){\\n int ov = que.front();que.pop();\\n for(auto &e : v[ov]){\\n if(e.cap > 0 && mn_cost[e.to] == -1){\\n mn_cost[e.to] = mn_cost[ov] + 1;\\n que.push(e.to);\\n }\\n }\\n }\\n return mn_cost[t] != -1;\\n }\\n flow_t dfs(int ov,const int t,flow_t flow){\\n if(ov == t)return flow;\\n for(int &i = iter[ov];i < v[ov].size();i++){\\n edge &e = v[ov][i];\\n if(e.cap > 0 && mn_cost[ov] < mn_cost[e.to]){\\n flow_t d = dfs(e.to,t,min(flow,e.cap));\\n if(d > 0){\\n e.cap -= d;\\n v[e.to][e.ref].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n // O(m n^2)(n:頂点数 m:辺数)\\n flow_t max_flow(int s,int t){\\n flow_t flow = 0;\\n while(bfs(s,t)){\\n iter.assign(v.size(),0);\\n flow_t f = 0;\\n while((f = dfs(s,t,inf)) > 0)flow += f;\\n }\\n return flow;\\n }\\n void output(){\\n for(int i = 0;i < v.size();i++){\\n for(auto &e : v[i]) {\\n if(!e.is_e) continue;\\n auto &rev_e = v[e.to][e.ref];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << \\\"\\\\n\\\";\\n }\\n }\\n }\\n};\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n ll h,w,K;cin >> w >> h >> K;\\n int n;cin >> n;\\n vector<set<int>> st(h+1);\\n rep(i,n){\\n ll x,y;cin >> x >> y;\\n st[y].insert(x);\\n }\\n K -= (w+1)/2;\\n if(K < 0){\\n cout << \\\"-1\\\\n\\\";\\n return 0;\\n }\\n ll res = 0;\\n for(int i = 2;i <= h;i+=2){\\n set<int> cand;\\n for(auto au : st[i]){\\n for(int j = -2;j <= 2;j++){\\n if((au+j+100)%2 == 1 && au+j >= 1 && au+j <= w)cand.insert(au+j);\\n }\\n }\\n int SZ = sz(cand);\\n Dinic<int> dn(SZ*2 + 2);\\n int S = SZ*2,T = S+1;\\n int cnt = 0;\\n for(auto au : cand){\\n for(int j = -2;j <= 2;j+=2){\\n if(cand.count(au+j) && !st[i].count(au+(j/2))){\\n dn.add_edge(cnt,SZ+cnt+(j/2),1);\\n }\\n }\\n cnt++;\\n }\\n rep(i,SZ){\\n dn.add_edge(S,i,1);\\n dn.add_edge(SZ+i,T,1);\\n }\\n ll flw = dn.max_flow(S,T);\\n res += (w+1)/2 - cnt + flw;\\n flw = cnt-flw;\\n int k = min(K,flw);\\n K -= k;\\n flw -= k;\\n res += flw*2;\\n }\\n if(K)res -= min(res,K);\\n cout << res << \\\"\\\\n\\\";\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 9144,\n \"score_of_the_acc\": -0.0884,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2787_9808676\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\n int N, M, K;\\n cin >> M >> N >> K;\\n if ((M+1)/2 > K) {\\n cout << -1 << endl;\\n return 0;\\n }\\n K -= (M+1)/2;\\n int Q;\\n cin >> Q;\\n vector<vector<int>> X(N);\\n while(Q--) {\\n int A, B;\\n cin >> B >> A;\\n A--, B--;\\n X[A].push_back(B);\\n }\\n int ANS = 0;\\n rep(i,0,(N-1)/2) {\\n vector<bool> B(M,false);\\n for (int j : X[i*2+1]) B[j] = true;\\n vector<int> DP((M+1)/2+1,inf);\\n DP[0] = 0;\\n rep(j,0,(M+1)/2) {\\n chmin(DP[j+1], DP[j] + (B[j*2] ? 1 : 0));\\n if (j+2 < (M+1)/2+1) chmin(DP[j+2], DP[j] + (B[j*2+1] ? 2 : 0));\\n }\\n ANS += DP[(M+1)/2];\\n }\\n int ANS2 = ((N-1)/2)*((M+1)/2)-ANS;\\n int MIN = min(ANS, K);\\n K -= MIN;\\n ANS -= MIN;\\n MIN = min(ANS2, K);\\n ANS2 -= MIN;\\n cout << ANS2 + ANS * 2 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4208,\n \"score_of_the_acc\": -0.0697,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2787_9669512\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define sz(A) ((ll)A.size())\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nstruct segtree{\\n vi tree;\\n int n;\\n ll op(ll a,ll b){return max(a,b);}\\n ll e(){return -1e18;}\\n segtree(int _N){\\n n=1;\\n while(n<_N)n<<=1;\\n tree.assign(2*n,e());\\n }\\n void set(int i,ll x){\\n i+=n;\\n tree[i]=x;\\n while(i>1){\\n i>>=1;\\n tree[i]=op(tree[2*i],tree[2*i+1]);\\n }\\n }\\n ll prod(int l,int r){\\n l+=n;r+=n;\\n ll L=e(),R=e();\\n while(l<r){\\n if(l%2)L=op(L,tree[l++]);\\n if(r%2)R=op(tree[--r],R);\\n l>>=1;r>>=1;\\n }\\n return op(L,R);\\n }\\n};\\nint main(){\\n ll W,H,K,N;cin>>W>>H>>K>>N;\\n vvi D(H);\\n REP(i,N){\\n ll x,y;cin>>x>>y;x--;y--;\\n if(y%2)D[y].emplace_back(x);\\n }\\n if(K<(W+1)/2){cout<<-1<<endl;return 0;}\\n K-=(W+1)/2;\\n ll ans=0;\\n vi DP(W/2+2,1e18);\\n REP(i,H/2){\\n auto A=D[2*i+1];\\n if(W==1){\\n if(sz(A))ans++;\\n continue;\\n }\\n vi B,C;\\n for(auto i:A){\\n if(i%2)C.emplace_back(i/2);\\n else B.emplace_back(i/2);\\n }\\n sort(ALL(B));\\n sort(ALL(C));\\n vi X;\\n FOR(j,-5,6){\\n for(auto k:B){\\n if(0<=k+j&&k+j<=(W+1)/2)X.emplace_back(k+j);\\n }\\n for(auto k:C){\\n if(0<=k+j&&k+j<=(W+1)/2)X.emplace_back(k+j);\\n }\\n }\\n sort(ALL(X));\\n X.erase(unique(ALL(X)),X.end());\\n REP(i,sz(X)){\\n ll j=i;\\n while(i<sz(X)&&X[i]==X[j]+i-j)i++;\\n FOR(k,j,i)DP[X[k]]=1e18;\\n DP[X[j]]=0;\\n FOR(k,j,i-1){\\n if(binary_search(ALL(C),X[k])==false&&k+2<i)DP[X[k+2]]=min(DP[X[k+2]],DP[X[k]]);\\n DP[X[k+1]]=min(DP[X[k+1]],DP[X[k]]+binary_search(ALL(B),X[k]));\\n }\\n ans+=DP[X[i-1]];\\n i--;\\n }\\n // DP[0]=0;\\n // REP(i,W/2+1){\\n // if(i&&!binary_search(ALL(C),i-1))DP[i+1]=DP[i-1];\\n // DP[i+1]=min(DP[i+1],DP[i]+binary_search(ALL(B),i));\\n // }\\n // ans+=DP.back();\\n //i->i+1 にコスト B\\n //i->i+2 はNG\\n //Aのうち最小で何個踏むことになるのか \\n }\\n ll total=(H/2)*((W+1)/2);\\n if(K>=ans)cout<<max(0LL,total-K)<<endl;\\n else cout<<total+ans-2*K<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6268,\n \"score_of_the_acc\": -0.0486,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2787_9640066\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint dog[10001][10001];\\nint dp[10010];\\n\\nint main() {\\n int W, H, K;\\n scanf(\\\"%d%d%d\\\", &W, &H, &K);\\n int N;\\n scanf(\\\"%d\\\", &N);\\n int x, y;\\n for (int i = 1; i <= N; i++) {\\n scanf(\\\"%d%d\\\", &y, &x);\\n dog[x][y] = 1;\\n }\\n if (K < W / 2 + 1) { // Если не хватило для каждой верхней трубы\\n printf(\\\"-1\\\\n\\\");\\n return 0;\\n }\\n int ans = 0;\\n for (int i = 2; i < H; i += 2) {\\n memset(dp, 0x3f, sizeof(dp));\\n dp[0] = 0;\\n // Считается только доп время за трубы.\\n for (int j = 1; j <= W; j += 2) {\\n // Напрямую сверху {\\n dp[j] = dog[i][j];\\n if (j > 1) {\\n dp[j] += dp[j-2];\\n }\\n // }\\n // Крест накрест {\\n if (j > 3) {\\n dp[j] = min(dp[j], dp[j-4] + 2 * dog[i][j-1]);\\n } else if (j > 1) {\\n dp[j] = min(dp[j], 2 * dog[i][j-1]);\\n }\\n // }\\n }\\n ans += dp[W];\\n }\\n K -= W / 2 + 1;\\n int num = (H / 2) * (W / 2 + 1) - ans;\\n if (K <= ans) {\\n ans -= K;\\n } else {\\n K -= ans;\\n ans = 0;\\n if (K <= num) {\\n num -= K;\\n } else {\\n K -= num;\\n num = 0;\\n }\\n }\\n printf(\\\"%d\\\\n\\\", ans * 2 + num);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 268172,\n \"score_of_the_acc\": -1.1154,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2787_8408349\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// ===================================================================== Solve Function =====================================================================\\npair<int, int> SubSolve(int N, vector<bool> L1, vector<bool> L2) {\\n // Step 1. First Division\\n vector<int> vec;\\n vec.push_back(0);\\n for (int i = 0; i < N; i++) {\\n if (L2[i] == true) vec.push_back(i + 1);\\n }\\n vec.push_back(N);\\n\\n // Step 2. Second Greedy\\n vector<int> cons(N + 1, 0);\\n for (int i = 0; i < (int)vec.size() - 1; i++) {\\n if ((vec[i + 1] - vec[i]) % 2 == 0) continue;\\n int cnt = 0;\\n for (int j = vec[i]; j < vec[i + 1]; j++) {\\n if (L1[j] == false && (j - vec[i]) % 2 == 0) cnt += 1;\\n }\\n if (cnt >= 1) continue;\\n\\n // Special Case\\n int num = 0; if (vec[i] >= 1) num = cons[vec[i] - 1];\\n int idx = -1;\\n if (num % 2 == 0) idx = vec[i + 1] - 1;\\n if (num % 2 == 1) idx = vec[i];\\n cons[idx] = num + 1;\\n }\\n\\n // Step 3. Calculate\\n int ret1 = 0;\\n int ret2 = 0;\\n for (int i = 0; i < N + 1; i++) {\\n if (cons[i] >= 1 && cons[i + 1] == 0) {\\n ret1 += (cons[i] / 2);\\n ret2 += (cons[i] % 2);\\n }\\n }\\n return make_pair(ret1, ret2);\\n}\\n\\n// ===================================================================== Main Function =====================================================================\\nint W;\\nint H;\\nint K;\\nint N, X[1 << 19], Y[1 << 19];\\nbool Dog[10009][10009];\\n\\nint main() {\\n // Step 1. Input\\n cin >> W >> H >> K;\\n cin >> N;\\n for (int i = 1; i <= N; i++) cin >> Y[i] >> X[i];\\n for (int i = 1; i <= N; i++) Dog[X[i]][Y[i]] = true;\\n\\n // Step 2. Get Answer\\n int Answer1 = 0;\\n int Answer2 = 0;\\n for (int i = 2; i <= H; i += 2) {\\n vector<bool> L1((W + 1) / 2, false);\\n vector<bool> L2((W - 1) / 2, false);\\n for (int j = 1; j <= W; j++) {\\n if (Dog[i][j] == false) continue;\\n if (j % 2 == 1) L1[(j - 1) / 2] = true;\\n if (j % 2 == 0) L2[(j - 1) / 2] = true;\\n }\\n pair<int, int> ret = SubSolve(L1.size(), L1, L2);\\n Answer1 += ret.first;\\n Answer2 += ret.second;\\n }\\n \\n // Step 3. Output\\n if (K < ((W + 1) / 2)) {\\n cout << \\\"-1\\\" << endl;\\n }\\n else {\\n int cur = 2 * Answer1 + 1 * Answer2;\\n int rem = K - ((W + 1) / 2);\\n int FinalAns = 0;\\n if (rem < Answer1) FinalAns = cur - 2 * rem;\\n else if (rem < Answer1 + Answer2) FinalAns = (Answer1 + Answer2 - rem);\\n else FinalAns = 0;\\n cout << max(0, ((H + 1) / 2) * ((W + 1) / 2) - K) + FinalAns << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 103696,\n \"score_of_the_acc\": -0.4553,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2787_8399597\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <tuple>\\n#include <cstdint>\\n#include <cstdio>\\n#include <map>\\n#include <cstdint>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <deque>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <bitset>\\n#include <cctype>\\n#include <functional>\\n#include <ctime>\\n#include <fstream>\\n#include <cmath>\\n#include <limits>\\n#include <chrono>\\n#include <numeric>\\n#include <type_traits>\\n#include <iomanip>\\n#include <float.h>\\n#include <math.h>\\n#include <cassert>\\n#include <random>\\n//#include <bit>\\n#include <cstdint>\\n//#include <atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\nusing ll = long long;\\n\\n\\n\\n\\nll ll_gcd(ll a, ll b) {\\n\\tif (a < b) return ll_gcd(b, a);\\n\\tll r;\\n\\twhile ((r = a % b)) {\\n\\t\\ta = b;\\n\\t\\tb = r;\\n\\t}\\n\\treturn b;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\n\\tif (n < 0)return 0;\\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\\nlong long modinv(long long a, long long mod) {\\n\\treturn modpow(a, mod - 2, mod);\\n}\\n\\nll merge_cnt(vector<ll>& a) {\\n\\tint n = a.size();\\n\\tif (n <= 1) { return 0; }\\n\\n\\tll cnt = 0;\\n\\tvector<ll> b(a.begin(), a.begin() + n / 2);\\n\\tvector<ll> c(a.begin() + n / 2, a.end());\\n\\n\\tcnt += merge_cnt(b);\\n\\tcnt += merge_cnt(c);\\n\\n\\tint ai = 0, bi = 0, ci = 0;\\n\\twhile (ai < n) {\\n\\t\\tif (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {\\n\\t\\t\\ta[ai++] = b[bi++];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcnt += n / 2 - bi;\\n\\t\\t\\ta[ai++] = c[ci++];\\n\\t\\t}\\n\\t}\\n\\treturn cnt;\\n}\\n\\ntemplate< typename T >\\nsize_t longest_increasing_subsequence(const vector< T >& a, bool strict) {\\n\\tvector< T > lis;\\n\\tfor (auto& p : a) {\\n\\t\\ttypename vector< T >::iterator it;\\n\\t\\tif (strict) it = lower_bound(begin(lis), end(lis), p);\\n\\t\\telse it = upper_bound(begin(lis), end(lis), p);\\n\\t\\tif (end(lis) == it) lis.emplace_back(p);\\n\\t\\telse *it = p;\\n\\t}\\n\\treturn lis.size();\\n}\\n\\n\\nconstexpr uint32_t PrimitiveRoot(uint32_t mod) {\\n\\tusing u64 = uint64_t;\\n\\tif (mod == 2) return 1;\\n\\tu64 ds[32] = {};\\n\\tint idx = 0;\\n\\tu64 m = mod - 1;\\n\\tfor (u64 i = 2; i * i <= m; ++i) {\\n\\t\\tif (m % i == 0) {\\n\\t\\t\\tds[idx++] = i;\\n\\t\\t\\twhile (m % i == 0) m /= i;\\n\\t\\t}\\n\\t}\\n\\tif (m != 1) ds[idx++] = m;\\n\\n\\tuint32_t pr = 2;\\n\\twhile (1) {\\n\\t\\tint flg = 1;\\n\\t\\tfor (int i = 0; i < idx; ++i) {\\n\\t\\t\\tu64 a = pr, b = (mod - 1) / ds[i], r = 1;\\n\\t\\t\\twhile (b) {\\n\\t\\t\\t\\tif (b & 1) r = r * a % mod;\\n\\t\\t\\t\\ta = a * a % mod;\\n\\t\\t\\t\\tb >>= 1;\\n\\t\\t\\t}\\n\\t\\t\\tif (r == 1) {\\n\\t\\t\\t\\tflg = 0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (flg == 1) break;\\n\\t\\t++pr;\\n\\t}\\n\\treturn pr;\\n}\\n\\n\\nstruct edge { ll to; ll cost; };\\ntypedef pair<ll, ll> P;\\nstruct graph {\\n\\tll V;\\n\\tvector<vector<edge> > G;\\n\\tvector<ll> d;\\n\\n\\tgraph(ll n) {\\n\\t\\tinit(n);\\n\\t}\\n\\n\\tvoid init(ll n) {\\n\\t\\tV = n;\\n\\t\\tG.resize(V);\\n\\t\\td.resize(V);\\n\\t\\tfor (int i = 0; i < V; i++) {\\n\\t\\t\\td[i] = 2000000000000000000;\\n\\t\\t}\\n\\t}\\n\\n\\tvoid add_edge(ll s, ll t, ll cost) {\\n\\t\\tedge e;\\n\\t\\te.to = t, e.cost = cost;\\n\\t\\tG[s].push_back(e);\\n\\t}\\n\\n\\tvoid dijkstra(ll s) {\\n\\t\\tfor (int i = 0; i < V; i++) {\\n\\t\\t\\td[i] = 2000000000000000000;\\n\\t\\t}\\n\\t\\td[s] = 0;\\n\\t\\tpriority_queue<P, vector<P>, greater<P> > que;\\n\\t\\tque.push(P(0, s));\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tP p = que.top(); que.pop();\\n\\t\\t\\tll v = p.second;\\n\\t\\t\\tif (d[v] < p.first) continue;\\n\\t\\t\\tfor (auto e : G[v]) {\\n\\t\\t\\t\\tif (d[e.to] > d[v] + e.cost) {\\n\\t\\t\\t\\t\\td[e.to] = d[v] + e.cost;\\n\\t\\t\\t\\t\\tque.push(P(d[e.to], e.to));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\nstruct UnionFind {\\n\\tvector <ll> par;\\n\\tvector <ll> siz;\\n\\tUnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {\\n\\t\\tfor (ll i = 0; i < sz_; ++i) par[i] = i;\\n\\t}\\n\\tvoid init(ll sz_) {\\n\\t\\tpar.resize(sz_);\\n\\t\\tsiz.assign(sz_, 1LL);\\n\\t\\tfor (ll i = 0; i < sz_; ++i) par[i] = i;\\n\\t}\\n\\tll root(ll x) {\\n\\t\\twhile (par[x] != x) {\\n\\t\\t\\tx = par[x] = par[par[x]];\\n\\t\\t}\\n\\t\\treturn x;\\n\\t}\\n\\tbool merge(ll x, ll y) {\\n\\t\\tx = root(x);\\n\\t\\ty = root(y);\\n\\t\\tif (x == y) return false;\\n\\t\\tif (siz[x] < siz[y]) swap(x, y);\\n\\t\\tsiz[x] += siz[y];\\n\\t\\tpar[y] = x;\\n\\t\\treturn true;\\n\\t}\\n\\n\\tbool issame(ll x, ll y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\n\\tll size(ll x) {\\n\\t\\treturn siz[root(x)];\\n\\t}\\n};\\n\\n//using mint = modint998244353;\\n\\n\\nlong long extGCD(long long a, long long b, long long& x, long long& y) {\\n\\tif (b == 0) {\\n\\t\\tx = 1;\\n\\t\\ty = 0;\\n\\t\\treturn a;\\n\\t}\\n\\tlong long d = extGCD(b, a % b, y, x);\\n\\ty -= a / b * x;\\n\\treturn d;\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tll w, h, k;\\n\\tcin >> h >> w >> k;\\n\\tll n;\\n\\tcin >> n;\\n\\tvector<vector<ll>> z(w,{-1,h});\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tll x, y;\\n\\t\\tcin >> x >> y;\\n\\t\\ty--;\\n\\t\\tx--;\\n\\t\\tz[y].push_back(x);\\n\\t}\\n\\tll ans = 0;\\n\\tfor (int i = 0; i < w; i++) {\\n\\t\\tif (i % 2 == 0)continue;\\n\\t\\tsort(z[i].begin(), z[i].end());\\n\\t\\tvector<vector<ll>> a(1);\\n\\t\\tll now = 0;\\n\\t\\tfor (int j = 0; j < z[i].size(); j++) {\\n\\t\\t\\ta[now].push_back(z[i][j]);\\n\\t\\t\\tif (z[i][j] != h && z[i][j] != -1 && z[i][j] % 2 == 1) {\\n\\t\\t\\t\\tnow++;\\n\\t\\t\\t\\ta.push_back({});\\n\\t\\t\\t\\ta[now].push_back(z[i][j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\tfor (int ij = 0; ij < a.size(); ij++) {\\n\\t\\t\\t\\tll t = 1;\\n\\t\\t\\t\\tif ((a[ij][a[ij].size() - 1] - a[ij][0]) % 4 == 0)t = 0;\\n\\t\\t\\t\\tset<ll> p;\\n\\t\\t\\t\\tfor (int k = 1; k < a[ij].size(); k++) {\\n\\t\\t\\t\\t\\tp.insert(a[ij][k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int ks = a[ij][0] +1; ks < a[ij][a[ij].size() - 1]; ks+=4) {\\n\\t\\t\\t\\t\\tif (!p.count(ks)) {\\n\\t\\t\\t\\t\\t\\tt = 0;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tans += t;\\n\\t\\t\\t}\\n\\t\\t\\n\\t}\\n\\tif (h / 2 + 1 > k)cout << -1 << endl;\\n\\telse if (ans + h / 2 + 1 < k) {\\n\\t\\tcout << max((ll)(h / 2+1) * (w / 2+1) - k, (ll)0) << endl;\\n\\t}\\n\\telse {\\n\\t\\tcout << (h / 2 + 1) * (w / 2 + 1) + (ans)-2 * (k)+h/2+1 << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4872,\n \"score_of_the_acc\": -0.0049,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2787_7181378\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\nusing ll = long long;\\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;}\\nconst int INF = (1<<30)-1;\\n#define all(p) p.begin(),p.end()\\nconst int mod=998244353;\\n\\nint main(){\\n\\tint W,H,K;\\n\\tcin>>W>>H>>K;\\n\\tint N;\\n\\tcin>>N;\\n\\tvector<vector<int>> p(H/2);\\n\\trep(i,0,N){\\n\\t\\tint x,y;\\n\\t\\tcin>>x>>y;\\n\\t\\tif(y%2) continue;\\n\\t\\tp[y/2-1].push_back(x-1);\\n\\t}\\n\\tint ans=0;\\n\\trep(i,0,H/2){\\n\\t\\tvector<int> dp(W/2+3,INF);\\n\\t\\tp[i].push_back(INF);\\n\\t\\tsort(all(p[i]));\\n\\t\\tint ind=0;\\n\\t\\tdp[0]=0;\\n\\t\\trep(j,0,W/2+1){\\n\\t\\t\\tif(p[i][ind]==j*2){\\n\\t\\t\\t\\tchmin(dp[j+1],dp[j]+1);\\n\\t\\t\\t\\tind++;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tchmin(dp[j+1],dp[j]);\\n\\t\\t\\t}\\n\\t\\t\\tif(p[i][ind]==j*2+1){\\n\\t\\t\\t\\tchmin(dp[j+2],dp[j]+2);\\n\\t\\t\\t\\tind++;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tchmin(dp[j+2],dp[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans+=dp[W/2+1];\\n\\t}\\n\\tif(K<W/2+1){\\n\\t\\tcout<<\\\"-1\\\\n\\\";\\n\\t\\treturn 0;\\n\\t}\\n\\tans=max(0,ans-(K-(W/2+1)));\\n\\tans+=max(0,(W/2+1)*(H/2+1)-K);\\n\\tcout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3956,\n \"score_of_the_acc\": -0.0591,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2787_7177866\",\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 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\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int w,h,k; cin >> w >> h >> k;\\n int n; cin >> n;\\n h = (h+1)/2;\\n w = (w+1)/2;\\n if(w > k){\\n cout << -1 << endl;\\n return 0;\\n }\\n vector<vector<int>> v(h-1);\\n for(int i=0;i<n;i++){\\n int x,y; cin >> x >> y;\\n if(y%2 == 0){\\n v[y/2-1].push_back(x-1);\\n }\\n }\\n constexpr int mx = 1e9;\\n int cost = 0; // 2\\n vector<int> dp(w+1,mx);\\n for(int i=0;i+1<h;i++){\\n if(!v[i].size()) continue;\\n fill(dp.begin(), dp.end(), mx);\\n dp[0] = 0;\\n vector<bool> down(w),cross(w);\\n for(int j:v[i]){\\n if(j%2 == 0) down[j/2] = true;\\n else cross[j/2] = true;\\n }\\n for(int j=0;j<w;j++){\\n dp[j+1] = min(dp[j+1], dp[j]+down[j]);\\n if(j+1<w){\\n dp[j+2] = min(dp[j+2], dp[j]+cross[j]+cross[j]);\\n }\\n }\\n cost += dp.back();\\n }\\n int res = (h-1)*w;\\n k -= w;\\n if(k >= cost){\\n res -= k;\\n }\\n else{\\n res += (cost-k);\\n res -= k;\\n }\\n cout << max(0,res) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3988,\n \"score_of_the_acc\": -0.0496,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2787_7177860\",\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 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\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int w,h,k; cin >> w >> h >> k;\\n int n; cin >> n;\\n h = (h+1)/2;\\n w = (w+1)/2;\\n if(w > k){\\n cout << -1 << endl;\\n return 0;\\n }\\n vector<vector<int>> v(h-1);\\n for(int i=0;i<n;i++){\\n int x,y; cin >> x >> y;\\n if(y%2 == 0){\\n v[y/2-1].push_back(x-1);\\n }\\n }\\n constexpr int mx = 1e9;\\n int cost = 0; // 2\\n for(int i=0;i+1<h;i++){\\n if(!v[i].size()) continue;\\n vector<int> dp(w+1,mx);\\n dp[0] = 0;\\n vector<bool> down(w),cross(w);\\n for(int j:v[i]){\\n if(j%2 == 0) down[j/2] = true;\\n else cross[j/2] = true;\\n }\\n for(int j=0;j<w;j++){\\n dp[j+1] = min(dp[j+1], dp[j]+down[j]);\\n if(j+1<w){\\n dp[j+2] = min(dp[j+2], dp[j]+cross[j]+cross[j]);\\n }\\n }\\n cost += dp.back();\\n }\\n int res = (h-1)*w;\\n k -= w;\\n if(k >= cost){\\n res -= k;\\n }\\n else{\\n res += (cost-k);\\n res -= k;\\n }\\n cout << max(0,res) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3960,\n \"score_of_the_acc\": -0.0495,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2787_6054152\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define eps 1e-9\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n\\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\\n\\n#define popcount __builtin_popcount\\n#define next __next\\n#define prev __prev\\n\\n#ifndef LOCAL\\n#define dmp(...) ;\\n#else\\n#define dmp(...) \\\\\\n cerr << \\\"[ \\\" << #__VA_ARGS__ << \\\" ] : \\\" << dump_str(__VA_ARGS__) << endl\\n#endif\\n\\n// ---------------- Utility ------------------\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\n\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\n// ----------------- Input -------------------\\n\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\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}\\n\\n// ----------------- Output ------------------\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ',' << p.second;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (const T &e : v) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const deque<T> &d) {\\n for (const T &e : d) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const set<T> &s) {\\n os << \\\"{ \\\";\\n for (const T &e : s) os << e << \\\" \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const map<T, U> &m) {\\n os << \\\"{ \\\";\\n for (const auto &[key, val] : m) os << \\\"( \\\" << key << \\\" -> \\\" << val << \\\" ) \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class TupleTy, size_t... I>\\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\\n (..., (os << (I == 0 ? \\\"\\\" : \\\",\\\") << std::get<I>(t)));\\n}\\n\\ntemplate <class... Args>\\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\\n os << \\\"(\\\";\\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\\n return os << \\\")\\\";\\n}\\n\\nvoid dump_str_rec(ostringstream &) {}\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << \\\", \\\" << head;\\n dump_str_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate <class T, class... U>\\nstring dump_str(T &&arg, U &&... args) {\\n ostringstream oss;\\n oss << arg;\\n dump_str_rec(oss, forward<U>(args)...);\\n return oss.str();\\n}\\n\\n// --------------- Fast I/O ------------------\\n\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n// ------------------ ACL --------------------\\n\\n// #include <atcoder/modint>\\n// constexpr int MOD = 998244353;\\n// constexpr int MOD = 1000000007;\\n// using mint = atcoder::static_modint<MOD>;\\n// ostream &operator<<(ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\n// ------------ End of template --------------\\n\\n#define endl \\\"\\\\n\\\"\\nusing ll = long long;\\nusing pii = pair<int, int>;\\n\\nconst bool multitest = false;\\n\\nvoid solve() {\\n ll W, H, K;\\n cin >> W >> H >> K;\\n int N;\\n cin >> N;\\n\\n set<int> us;\\n for (int i = 0; i < N; i++) {\\n int x, y;\\n cin >> x >> y;\\n us.insert(y * (int)W + x);\\n }\\n\\n ll w = (W + 1) / 2;\\n ll h = (H + 1) / 2;\\n if (K < w) {\\n cout << -1 << endl;\\n return;\\n }\\n\\n if (K >= w * h) {\\n cout << 0 << endl;\\n return;\\n }\\n\\n K -= w;\\n\\n ll need_dog = 0ll;\\n\\n auto check = [&](int X, int Y) {\\n if (us.count(X * (int)W + Y))\\n return true;\\n else\\n return false;\\n };\\n\\n for (int i = 3; i <= H; i += 2) {\\n vector<ll> dp(w + 1, INF);\\n dp[0] = 0;\\n for (int j = 0; j < w; j++) {\\n if (check(i - 1, 2 * j + 1))\\n chmin(dp[j + 1], dp[j] + 1);\\n else\\n chmin(dp[j + 1], dp[j]);\\n if (j + 2 <= w) {\\n if (check(i - 1, 2 * j + 2))\\n chmin(dp[j + 2], dp[j] + 2);\\n else\\n chmin(dp[j + 2], dp[j]);\\n }\\n }\\n dmp(dp[w]);\\n need_dog += dp[w];\\n }\\n\\n ll need_common = (h - 1) * w - need_dog;\\n\\n {\\n ll val = min(need_dog, K);\\n need_dog -= val;\\n K -= val;\\n }\\n\\n {\\n ll val = min(need_common, K);\\n need_common -= val;\\n K -= val;\\n }\\n\\n cout << need_common + need_dog * 2ll << endl;\\n return;\\n}\\n\\nint main() {\\n fastio();\\n if (!multitest) {\\n solve();\\n } else {\\n cerr << \\\"[Warning] Multi testcase mode on\\\" << endl;\\n int t;\\n cin >> t;\\n while (t--) solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1050,\n \"memory_kb\": 8100,\n \"score_of_the_acc\": -1.0171,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2787_6024536\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.11.03 12:07:40 */\\n\\n// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region macros\\n\\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 popcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\n#pragma endregion\\n\\n#pragma region aliases\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nconst int inf = 1e9;\\nconst long long INF = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nconst int mod_1000000007 = 1000000007;\\nconst int mod_998244353 = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_operation\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 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) { std::cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { std::cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag = true) {\\n\\tif(!flag) return;\\n\\tstd::cout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\treturn (a + b - 1) / b;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\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\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\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 < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\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\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(std::vector<T> &a) {\\n\\tauto vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::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>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::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\\nnamespace viewer {\\nvoid view(const long long e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\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\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\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::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\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\\tstd::cerr << \\\"{ }\\\";\\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\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n} // namespace viewer\\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\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tviewer::view(x); \\\\\\n\\t\\tstd::cerr << '\\\\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\\nll solve(int w) {\\n\\tint h;\\n\\tll k;\\n\\tcin >> h >> k;\\n\\tint n;\\n\\tcin >> n;\\n\\tV<pair<int, int>> dogs;\\n\\trep(n) {\\n\\t\\tint x, y;\\n\\t\\tcin >> y >> x;\\n\\t\\tdogs.emplace_back(x, y);\\n\\t}\\n\\tsort(all(dogs));\\n\\n\\tll houses = ll(dup(h, 2)) * ll(dup(w, 2));\\n\\tll cost = dup(w, 2);\\n\\tif(cost > k) return -1;\\n\\thouses -= cost;\\n\\tk -= cost;\\n\\tcost = 0;\\n\\n\\tfor(auto it = dogs.begin(); it != dogs.end();) {\\n\\t\\tint x = it->first;\\n\\t\\tvi ys;\\n\\t\\twhile(it != dogs.end() && it->first == x) {\\n\\t\\t\\tys.push_back((it++)->second);\\n\\t\\t}\\n\\t\\tdebug(x, ys);\\n\\t\\tif(x & 1) continue;\\n\\n\\t\\tset<int> yset(ys.begin(), ys.end());\\n\\n\\t\\tint pre_notvalid = -1;\\n\\t\\tfoa(y, ys) {\\n\\t\\t\\tif(y & 1) {\\n\\t\\t\\t\\tif(pre_notvalid == y) {\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t} else if(!yset.count(y - 1) && pre_notvalid != y - 2) {\\n\\t\\t\\t\\t\\t// ok\\n\\t\\t\\t\\t} else if(!yset.count(y + 1) && y + 2 <= w) {\\n\\t\\t\\t\\t\\tpre_notvalid = y + 2;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tcost++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// pass\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdebug(houses, cost, k);\\n\\n\\tll ret = 0;\\n\\tll special_two = min(cost, k);\\n\\tk -= special_two;\\n\\thouses -= cost;\\n\\tcost -= special_two;\\n\\tret += cost * 2 + max(0LL, houses - k);\\n\\treturn ret;\\n}\\n\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tstd::cout << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint w;\\n\\twhile(cin >> w && w) {\\n\\t\\tcout << solve(w) << dl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4252,\n \"score_of_the_acc\": -0.0122,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2787_5826973\",\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=100005,INF=1<<30;\\n\\nvector<int> wh[MAX];\\n\\nint dp[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 H,W,K;cin>>W>>H>>K;\\n int N;cin>>N;\\n set<pair<int,int>> SE;\\n \\n for(int i=0;i<N;i++){\\n int h,w;cin>>w>>h;\\n wh[h].push_back(w+4);\\n SE.insert(mp(h,w+4));\\n }\\n \\n int need=0;\\n \\n for(int i=1;i<=H;i++){\\n sort(all(wh[i]));\\n int j=0;\\n while(j<si(wh[i])){\\n int k=j+1;\\n while(k<si(wh[i])&&wh[i][k]-wh[i][k-1]<=6) k++;\\n int s=wh[i][j]-1,t=wh[i][k-1]+1;\\n if(s%2==0) s--;\\n if(s<5) s+=2;\\n if(t%2==0) t++;\\n if(t>W+4) t-=2;\\n for(int w=s;w<=t;w++) dp[w]=INF;\\n dp[s-2]=0;\\n for(int w=s-2;w<t;w+=2){\\n if(SE.count(mp(i,w+2))) chmin(dp[w+2],dp[w]+1);\\n else chmin(dp[w+2],dp[w]);\\n \\n if(w+4<=t){\\n if(SE.count(mp(i,w+3))) chmin(dp[w+4],dp[w]+2);\\n else chmin(dp[w+4],dp[w]);\\n }\\n }\\n \\n //cout<<j<<\\\" \\\"<<k<<\\\" \\\"<<s<<\\\" \\\"<<t<<\\\" \\\"<<dp[t]<<endl;\\n \\n need+=dp[t];\\n \\n j=k;\\n }\\n }\\n \\n if(K<(W+1)/2){\\n cout<<-1<<endl;\\n }else{\\n K-=(W+1)/2;\\n int al=(H-1)/2*(W+1)/2;\\n chmin(K,al);\\n int ans=al+need;\\n if(need>=K) ans-=2*K;\\n else ans-=2*need+(K-need);\\n \\n cout<<ans<<endl;\\n \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 11304,\n \"score_of_the_acc\": -0.0581,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2787_5404181\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 10000000;\\nint main(){\\n int W, H, K;\\n cin >> W >> H >> K;\\n int w = (W + 1) / 2, h = (H + 1) / 2;\\n if (K < w){\\n cout << -1 << endl;\\n } else {\\n int N;\\n cin >> N;\\n vector<vector<int>> p(h);\\n for (int i = 0; i < N; i++){\\n int x, y;\\n cin >> x >> y;\\n x--;\\n y--;\\n if (y % 2 == 1){\\n p[(y - 1) / 2].push_back(x);\\n }\\n }\\n int mn = 0;\\n for (int i = 0; i < h; i++){\\n if (!p[i].empty()){\\n \\tint cnt = p[i].size();\\n set<int> st;\\n for (int j = 0; j < cnt; j++){;\\n st.insert(p[i][j]);\\n }\\n vector<int> dp(w + 1, INF);\\n dp[0] = 0;\\n for (int j = 0; j < w; j++){\\n if (st.count(j * 2) == 0){\\n dp[j + 1] = min(dp[j + 1], dp[j]);\\n } else {\\n dp[j + 1] = min(dp[j + 1], dp[j] + 1);\\n }\\n if (j < w - 1){\\n if (st.count(j * 2 + 1) == 0){\\n dp[j + 2] = min(dp[j + 2], dp[j]);\\n } else {\\n dp[j + 2] = min(dp[j + 2], dp[j] + 2);\\n }\\n }\\n }\\n mn += dp[w];\\n }\\n }\\n int ans = (h - 1) * w + mn;\\n K -= w;\\n if (K < mn){\\n ans -= K * 2;\\n } else {\\n ans -= mn * 2;\\n K -= mn;\\n ans = max(ans - K, 0);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3884,\n \"score_of_the_acc\": -0.2319,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2787_5404179\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 10000000;\\nint main(){\\n int W, H, K;\\n cin >> W >> H >> K;\\n int w = (W + 1) / 2, h = (H + 1) / 2;\\n if (K < w){\\n cout << -1 << endl;\\n } else {\\n int N;\\n cin >> N;\\n vector<vector<int>> p(h);\\n for (int i = 0; i < N; i++){\\n int x, y;\\n cin >> x >> y;\\n x--;\\n y--;\\n if (y % 2 == 1){\\n p[(y - 1) / 2].push_back(x);\\n }\\n }\\n int mn = 0;\\n for (int i = 0; i < h; i++){\\n if (!p[i].empty()){\\n p[i].insert(p[i].begin(), -1);\\n p[i].push_back(W);\\n int cnt = p[i].size();\\n /*\\n vector<int> d(cnt - 1);\\n for (int j = 0; j < cnt - 1; j++){\\n d[j] = p[i][j + 1] - p[i][j];\\n if (d[j] > 8){\\n d[j] -= (d[j] - 8) / 2 * 2;\\n }\\n }\\n for (int j = 0; j < cnt - 1; j++){\\n p[i][j + 1] = p[i][j] + d[j];\\n }\\n */\\n int W2 = (p[i][cnt - 1] + 1) / 2;\\n set<int> st;\\n for (int j = 1; j < cnt - 1; j++){;\\n st.insert(p[i][j]);\\n }\\n vector<int> dp(W2 + 1, INF);\\n dp[0] = 0;\\n for (int j = 0; j < W2; j++){\\n if (st.count(j * 2) == 0){\\n dp[j + 1] = min(dp[j + 1], dp[j]);\\n } else {\\n dp[j + 1] = min(dp[j + 1], dp[j] + 1);\\n }\\n if (j < W2 - 1){\\n if (st.count(j * 2 + 1) == 0){\\n dp[j + 2] = min(dp[j + 2], dp[j]);\\n } else {\\n dp[j + 2] = min(dp[j + 2], dp[j] + 2);\\n }\\n }\\n }\\n mn += dp[W2];\\n }\\n }\\n int ans = (h - 1) * w + mn;\\n K -= w;\\n if (K < mn){\\n ans -= K * 2;\\n } else {\\n ans -= mn * 2;\\n K -= mn;\\n ans = max(ans - K, 0);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3724,\n \"score_of_the_acc\": -0.164,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2787_5356638\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#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<unordered_set>\\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 = 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 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 = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)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}\\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)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 22;\\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}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nbool exi[10000];\\nint dp[10005];\\nvoid solve() {\\n\\tint w, h, k; cin >> w >> h >> k;\\n\\tint n; cin >> n;\\n\\tvector<vector<int>> vs(h);\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y; x--; y--;\\n\\t\\tvs[y].push_back(x);\\n\\t}\\n\\tk -= (w/2+1);\\n\\tif (k < 0) {\\n\\t\\tcout << -1 << \\\"\\\\n\\\"; return;\\n\\t}\\n\\tint c1 = 0, c2 = 0;\\n\\tfor (int i = 1; i < h; i += 2) {\\n\\t\\tfor (int x : vs[i])exi[x] = true;\\n\\t\\tfor (int j = 0; j < w+2; j += 2) {\\n\\t\\t\\tdp[j] = mod;\\n\\t\\t}\\n\\t\\tdp[0] = 0;\\n\\t\\tfor (int j = 0; j < w; j += 2) {\\n\\t\\t\\t//single\\n\\t\\t\\tif (exi[j]) {\\n\\t\\t\\t\\tdp[j + 2] = min(dp[j + 2], dp[j] + 1);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tdp[j + 2] = min(dp[j + 2], dp[j]);\\n\\t\\t\\t}\\n\\t\\t\\t//double\\n\\t\\t\\tif (j + 2 < w) {\\n\\t\\t\\t\\tint cost = 0;\\n\\t\\t\\t\\tif (exi[j + 1]) {\\n\\t\\t\\t\\t\\tcost = 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdp[j + 4] = min(dp[j + 4], dp[j] + cost);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tc2 += dp[w + 1];\\n\\t\\tc1 += (w / 2 + 1) - dp[w + 1];\\n\\t\\tfor (int x : vs[i])exi[x] = false;\\n\\t}\\n\\t//cout << c1 << \\\" \\\" << c2 << \\\"\\\\n\\\";\\n\\tint ans = c1 + 2 * c2;\\n\\tint m = min(c2, k);\\n\\tans -= 2 * m; k -= m;\\n\\tm = min(c1, k);\\n\\tans -= m;\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//init_f();\\n\\t//init();\\n\\t//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\t\\t//expr();\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 69764,\n \"score_of_the_acc\": -0.2886,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2787_5315011\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\nconst int inf = 1e9;\\n\\nint prev(int a, vector<int> &v){\\n auto itr = lower_bound(v.begin(), v.end(), a);\\n if(itr == v.begin()) return -inf;\\n return *(itr-1);\\n}\\nint next(int a, vector<int> &v){\\n auto itr = lower_bound(v.begin(), v.end(), a);\\n if(itr == v.end()) return inf;\\n return *itr;\\n}\\nbool isin(int a, vector<int> &v){\\n auto itr = lower_bound(v.begin(), v.end(), a);\\n return itr!=v.end() and *itr==a;\\n}\\n\\nint main(){\\n int w,h,k;\\n cin >> w >> h >> k;\\n w=(w+1)/2; h=h/2;\\n if(w > k){\\n cout << -1 << endl;\\n return 0;\\n }\\n k -= w;\\n int n;\\n cin >> n;\\n vector<vector<int>> a(h);\\n for(int i=0; i<n; i++){\\n int x,y;\\n cin >> x >> y;\\n if(y%2 == 0){\\n a[y/2-1].push_back(x-1);\\n }\\n }\\n for(auto& v: a){\\n sort(v.begin(), v.end());\\n }\\n\\n int ans = 0;\\n vector<int> dp(w+1, inf);\\n for(int i=0; i<h; i++){\\n int base = 2*w*(h-i);\\n dp[0] = base;\\n for(int j=0; j<w; j++){\\n int x = 2*j;\\n // skip\\n int nj = min(next(x, a[i])/2 -1, w);\\n int pj = prev(x, a[i])/2;\\n if(pj+2<j and j+2<nj){\\n dp[nj] = dp[j]+(nj-j);\\n j = nj-1;\\n continue;\\n }\\n // normal\\n if(j < w-1){\\n int cost = (isin(x+1, a[i]))? 4: 2;\\n dp[j+2] = min(dp[j+2], dp[j]+cost);\\n }\\n int cost = (isin(x, a[i]))? 2: 1;\\n dp[j+1] = min(dp[j+1], dp[j]+cost);\\n }\\n ans += dp[w]-base;\\n }\\n int two = ans -h*w;\\n int one = ans -2*two;\\n if(k > two){\\n ans = max(two +one -k, 0);\\n }else{\\n ans = 2*(two-k) +one;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3992,\n \"score_of_the_acc\": -0.0208,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2787_5314991\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\nconst int inf = 1e9;\\n\\nint next(int a, vector<int> &v){\\n auto itr = lower_bound(v.begin(), v.end(), a);\\n if(itr == v.end()) return inf;\\n return *itr;\\n}\\nbool isin(int a, vector<int> &v){\\n auto itr = lower_bound(v.begin(), v.end(), a);\\n return itr!=v.end() and *itr==a;\\n}\\n\\nint main(){\\n int w,h,k;\\n cin >> w >> h >> k;\\n w=(w+1)/2; h=h/2;\\n if(w > k){\\n cout << -1 << endl;\\n return 0;\\n }\\n k -= w;\\n int n;\\n cin >> n;\\n vector<vector<int>> a(h);\\n for(int i=0; i<n; i++){\\n int x,y;\\n cin >> x >> y;\\n if(y%2 == 0){\\n a[y/2-1].push_back(x-1);\\n }\\n }\\n for(auto& v: a){\\n sort(v.begin(), v.end());\\n }\\n\\n int ans = 0;\\n vector<int> dp(w+1, inf);\\n for(int i=0; i<h; i++){\\n int base = 2*w*(h-i);\\n dp[0] = base;\\n for(int j=0; j<w; j++){\\n int x = 2*j;\\n // skip\\n int nj = min(next(x, a[i])/2 -1, w);\\n if(nj > j+2){\\n dp[nj] = dp[j]+(nj-j);\\n j = nj-1;\\n continue;\\n }\\n // normal\\n if(j < w-1){\\n int cost = (isin(x+1, a[i]))? 4: 2;\\n dp[j+2] = min(dp[j+2], dp[j]+cost);\\n }\\n int cost = (isin(x, a[i]))? 2: 1;\\n dp[j+1] = min(dp[j+1], dp[j]+cost);\\n }\\n ans += dp[w]-base;\\n }\\n int two = ans -h*w;\\n int one = ans -2*two;\\n if(k > two){\\n ans = max(two +one -k, 0);\\n }else{\\n ans = 2*(two-k) +one;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.5925925925925926,\n \"time_ms\": 20,\n \"memory_kb\": 3832,\n \"score_of_the_acc\": -0.0106,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2787_4894064\",\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<LL,LL> 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 for(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 for(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 if(vec_n==-1)vec_n=vec_s.size();\\n for(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 if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\nint main(){\\n LL n,m;\\n int i,j,k;\\n LL a,b,c;\\n LL w,h;\\n LL x,y;\\n set<P> s1,s2;\\n cin>>w>>h>>m;\\n vector<vector<LL>> v1(h);\\n cin>>n;\\n for(i=0;i<n;i++){\\n cin>>a>>b;\\n a--,b--;\\n s1.insert(make_pair(a,b));\\n if(b%2==0)continue;\\n a/=2,b=(b+1)/2;\\n if(s2.find(make_pair(a,b))==s2.end()){\\n v1[b].push_back(a);\\n s2.insert(make_pair(a,b));\\n }\\n a--;\\n if(a<0)continue;\\n if(s2.find(make_pair(a,b))==s2.end()){\\n v1[b].push_back(a);\\n s2.insert(make_pair(a,b));\\n }\\n }\\n if(m<=w/2){\\n cout<<-1<<endl;\\n return 0;\\n }\\n m-=w/2+1;\\n b=0;\\n for(i=1;i<h/2+1;i++){\\n int t[5]={0};\\n a=-10;\\n sort(v1[i].begin(),v1[i].end());\\n if(v1[i].empty() || v1[i].back()!=w/2)v1[i].push_back(w/2);\\n for(auto num:v1[i]){\\n if(a+1==num){\\n t[0]=t[1],t[1]=t[2],t[2]=INF;\\n }else{\\n t[0]=min({t[1],t[2]});\\n t[1]=t[2]=INF;\\n }\\n a=num;\\n x=num*2,y=i*2;\\n if(s1.find(make_pair(x,y-1))!=s1.end())t[1]=min(t[0]+1,t[1]);\\n else t[1]=min(t[0],t[1]);\\n if(s1.find(make_pair(x+1,y-1))!=s1.end())t[2]=min(t[0]+2,t[2]);\\n else t[2]=min(t[0],t[2]);\\n }\\n b+=t[1];\\n }\\n a=(w/2+1)*(h/2)-b;\\n c=min(b,m);\\n b-=c,m-=c;\\n a-=min(a,m);\\n cout<<a+2*b<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 18336,\n \"score_of_the_acc\": -0.1808,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2787_3931324\",\n \"code_snippet\": \"#include<deque>\\n#include<queue>\\n#include<vector>\\n#include<algorithm>\\n#include<iostream>\\n#include<set>\\n#include<cmath>\\n#include<tuple>\\n#include<string>\\n#include<chrono>\\n#include<functional>\\n#include<iterator>\\n#include<random>\\n#include<unordered_set>\\n#include<array>\\n#include<map>\\n#include<iomanip>\\n#include<assert.h>\\n#include<list>\\n#include<bitset>\\n#include<stack>\\n#include<memory>\\n#include<numeric>\\nusing namespace std;\\nusing namespace std::chrono;\\ntypedef long long int llint;\\ntypedef long double lldo;\\n#define mp make_pair\\n#define mt make_tuple\\n#define pub push_back\\n#define puf push_front\\n#define pob pop_back\\n#define pof pop_front\\n#define fir first\\n#define sec second\\n#define res resize\\n#define ins insert\\n#define era erase\\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\\nconst llint mod=1000000007;\\nconst llint big=2.19e15+1;\\nconst long double pai=3.141592653589793238462643383279502884197;\\nconst long double eps=1e-12;\\ntemplate <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}\\ntemplate <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}\\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\\ntemplate<class T>llint LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\\ntemplate<class T>llint UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\\n\\nint main(void){\\n\\tint w,h,K,n,i;cin>>w>>h>>K>>n;\\n\\tint H=(h+1)/2,W=(w+1)/2;\\n\\tvector<pair<int,int>>dog(n+1);\\n\\tdog[n]=mp(mod,mod);\\n\\tfor(i=0;i<n;i++){cin>>dog[i].sec>>dog[i].fir;}\\n\\tSO(dog);\\n\\tK-=W;\\n\\tif(K<0){cout<<-1<<endl;return 0;}\\n\\tpair<int,int>mae=mp(-1,-1);\\n\\tint ans=0,dp=0,ep=0,fp=0;\\n\\tfor(auto it:dog){\\n\\t\\tif(mae.fir!=it.fir||mae.sec+6<=it.sec){//清算します\\n\\t\\t\\tans+=min({dp,ep,fp});\\n\\t\\t\\tdp=0;ep=0;fp=0;\\n\\t\\t\\tif(it.sec==1){dp=99;}\\n\\t\\t\\t\\n\\t\\t}else{\\n\\t\\t\\tfor(i=mae.sec+1;i<=it.sec;i++){\\n\\t\\t\\t\\tif(i%2==1){int sp=min(dp,ep);dp=fp;ep=sp;fp=sp;}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(it.sec%2==0){fp+=2;}//中間\\n\\t\\telse{ep++;}\\n\\t\\tif(it.sec==w){fp=mod;}\\n\\t\\tmae=it;\\n\\t}\\n\\t//cerr<<\\\"ans=\\\"<<ans<<endl;\\n\\tcout<<max(0,(H-1)*W-K)+max(0,ans-K)<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.0192,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1676,"cells":{"group_id":{"kind":"string","value":"aoj_2796_cpp"},"problem_description":{"kind":"string","value":"F: 紙の折りたたみ / Folding Paper\n問題文\n高さ $H$ マス、幅 $W$ マスの格子状に区切られた長方形の紙がある。\n$0$ から数えて上から $i$ 行目、左から $j$ 列目のマスには整数 $i \\times W+j$ が書かれている。 $H=2, W=3$ の例を下の図に示す。\nAOR イカちゃんは、この紙に対して次のような操作を順に行った。\n$1$ マス分の面積になるまでマスの区切り線に沿って繰り返し折る。この時の折る線や山谷、順番などは任意である。紙を破らない任意の折り方ができる。\n$4$ 辺を切り落として $H \\times W$ 枚の紙に分割する。\n上から順にめくっていき、書かれていた整数を並べた数列 $S$ を作る。\n例えば、下の図のように折った後切った場合、$S$ として $4, 3, 0, 5, 2, 1$ が得られる。このように、間に差し込むような折り方も可能である。\nあなたは AOR イカちゃんから数列 $S$ を受け取った。\nしかし、AOR イカちゃんのことを信用していないので、これが本物か確かめたい。\n$S$ と一致するような紙の折り方が存在するなら \"YES\" を、しないなら \"NO\" を出力するプログラムを書け。\n入力\n$H \\ W$\n$S_0 \\cdots S_{HW-1}$\n入力の制約\n$1 \\le H, W \\le 500$\n$S$ は $0$ から $H \\times W - 1$ までの整数を $1$ つずつ含む\n出力\n\"YES\" または \"NO\" を $1$ 行で出力せよ。\nサンプル\nサンプル入力1\n1 4\n0 1 2 3\nサンプル出力1\nYES\nサンプル入力2\n2 3\n4 3 0 5 2 1\nサンプル出力2\nYES\n問題文中の例である。\nサンプル入力3\n1 4\n0 2 1 3\nサンプル出力3\nNO\nサンプル入力4\n2 2\n0 1 3 2\nサンプル出力4\nYES\n$2$ 回半分に折る。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2796_4958013","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\nll mod_pow(ll x, ll n, ll m = mod) {\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 << 2;\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}\n\nll gcd(ll a, ll b) {\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tll r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = -mod;\npublic:\n\tSegT(vector<int> v) {\n\t\tint n = v.size();\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t\trep(i, n) {\n\t\t\tnode[i + sz - 1] = v[i];\n\t\t}\n\t\tper(i, sz - 1) {\n\t\t\tnode[i] = f(node[2 * i + 1], node[2 * i + 2]);\n\t\t}\n\t}\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn max(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\n\nvoid solve() {\n\tint h, w; cin >> h >> w;\n\tvector<int> a(h * w);\n\trep(i, h * w)cin >> a[i];\n\tvector<int> t(h * w);\n\trep(i, h * w)t[a[i]] = i;\n\tvector<bool> invy(h * w), invt(h * w);\n\tqueue<int> q;\n\tvector<bool> used(h * w,false);\n\tused[0] = true; q.push(0);\n\tvector<int> vs;\n\twhile (!q.empty()) {\n\t\tint v = q.front(); q.pop();\n\t\tvs.push_back(v);\n\t\tint x = a[v] / w;\n\t\tint y = a[v] % w;\n\t\tif (x - 1 >= 0) {\n\t\t\tint to = t[(x - 1) * w + y];\n\t\t\tif (!used[to])used[to] = true, q.push(to);\n\t\t}\n\t\tif (x + 1 < h) {\n\t\t\tint to = t[(x + 1) * w + y];\n\t\t\tif (!used[to])used[to] = true, q.push(to);\n\t\t}\n\t\tif (y - 1 >= 0) {\n\t\t\tint to = t[x * w + y-1];\n\t\t\tif (!used[to])used[to] = true, q.push(to);\n\t\t}\n\t\tif (y + 1 < w) {\n\t\t\tint to = t[x * w + y+1];\n\t\t\tif (!used[to])used[to] = true, q.push(to);\n\t\t}\n\t}\n\tfill(all(used), false);\n\tinvy[0] = false;\n\tinvt[0] = false;\n\tused[0] = true;\n\tvector<P> seg[4];\n\trep(i, vs.size()) {\n\t\t//cout << vs[i] << \"\\n\";\n\t\tint v = vs[i];\n\t\tint x = a[v] / w;\n\t\tint y = a[v] % w;\n\t\tif (y - 1 >= 0) {\n\t\t\tint to = t[x * w + y-1];\n\t\t\tbool by = false, bt = false;\n\t\t\tif (!invy[v]) {\n\t\t\t\tby = true;\n\t\t\t\tif(!used[to])seg[0].push_back(minmax(v, to));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tby = false;\n\t\t\t\tif(!used[to])seg[1].push_back(minmax(v, to));\n\t\t\t}\n\t\t\tbt = invt[v];\n\t\t\tif (used[to]) {\n\t\t\t\tif (invy[to] != by || invt[to] != bt) {\n\t\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tused[to] = true;\n\t\t\t\tinvy[to] = by, invt[to] = bt;\n\t\t\t}\n\t\t}\n\t\tif (y + 1 < w) {\n\t\t\tint to = t[x * w + y + 1];\n\t\t\tbool by = false, bt = false;\n\t\t\tif (!invy[v]) {\n\t\t\t\tby = true;\n\t\t\t\tif(!used[to])seg[1].push_back(minmax(v, to));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tby = false;\n\t\t\t\tif(!used[to])seg[0].push_back(minmax(v, to));\n\t\t\t}\n\t\t\tbt = invt[v];\n\t\t\tif (used[to]) {\n\t\t\t\tif (invy[to] != by || invt[to] != bt) {\n\t\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tused[to] = true;\n\t\t\t\tinvy[to] = by, invt[to] = bt;\n\t\t\t}\n\t\t}\n\t\tif (x - 1 >= 0) {\n\t\t\tint to = t[(x - 1) * w + y];\n\t\t\tbool by = false, bt = false;\n\t\t\tif (!invt[v]) {\n\t\t\t\tbt = true;\n\t\t\t\tif(!used[to])seg[2].push_back(minmax(v, to));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tbt = false;\n\t\t\t\tif(!used[to])seg[3].push_back(minmax(v, to));\n\t\t\t}\n\t\t\tby = invy[v];\n\t\t\tif (used[to]) {\n\t\t\t\tif (invy[to] != by || invt[to] != bt) {\n\t\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tused[to] = true;\n\t\t\t\tinvy[to] = by, invt[to] = bt;\n\t\t\t}\n\t\t}\n\t\tif (x + 1 < h) {\n\t\t\tint to = t[(x + 1) * w + y];\n\t\t\tbool by = false, bt = false;\n\t\t\tif (!invt[v]) {\n\t\t\t\tbt = true;\n\t\t\t\tif(!used[to])seg[3].push_back(minmax(v, to));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tbt = false;\n\t\t\t\tif(!used[to])seg[2].push_back(minmax(v, to));\n\t\t\t}\n\t\t\tby = invy[v];\n\t\t\tif (used[to]) {\n\t\t\t\tif (invy[to] != by || invt[to] != bt) {\n\t\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tused[to] = true;\n\t\t\t\tinvy[to] = by, invt[to] = bt;\n\t\t\t}\n\t\t}\n\t}\n\trep(i, 4) {\n\t\tvector<P> s = seg[i];\n\t\t//cout << \"hello\\n\";\n\t\t//rep(j, s.size())cout << s[j].first << \" \" << s[j].second << \"\\n\";\n\t\tsort(all(s));\n\t\tvector<int> ori(h * w);\n\t\trep(j, s.size()) {\n\t\t\tint le = j;\n\t\t\twhile (j + 1 < s.size() && s[j + 1].first == s[j].first)j++;\n\t\t\tif (le != j) {\n\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t}\n\t\t\tori[s[j].first] = s[j].second;\n\t\t}\n\t\tSegT st(ori);\n\t\trep(j, s.size()) {\n\t\t\tint q = st.query(s[j].first + 1, s[j].second);\n\t\t\tif (q >= s[j].second) {\n\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t}\n\t\t}\n\t}\n\tcout << \"YES\\n\";\n}\n\n\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\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":70,"memory_kb":14104,"score_of_the_acc":-1.3333,"final_rank":5},{"submission_id":"aoj_2796_4955666","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\nll mod_pow(ll x, ll n, ll m = mod) {\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 << 2;\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}\n\nll gcd(ll a, ll b) {\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tll r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = -mod;\npublic:\n\tSegT(vector<int> v) {\n\t\tint n = v.size();\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t\trep(i, n) {\n\t\t\tnode[i + sz - 1] = v[i];\n\t\t}\n\t\tper(i, sz - 1) {\n\t\t\tnode[i] = f(node[2 * i + 1], node[2 * i + 2]);\n\t\t}\n\t}\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn max(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\n\nvoid solve() {\n\tint h, w; cin >> h >> w;\n\tvector<int> a(h * w);\n\trep(i, h * w)cin >> a[i];\n\tvector<int> t(h * w);\n\trep(i, h * w)t[a[i]] = i;\n\tvector<bool> invy(h * w), invt(h * w);\n\tqueue<int> q;\n\tvector<bool> used(h * w,false);\n\tused[0] = true; q.push(0);\n\tvector<int> vs;\n\twhile (!q.empty()) {\n\t\tint v = q.front(); q.pop();\n\t\tvs.push_back(v);\n\t\tint x = a[v] / w;\n\t\tint y = a[v] % w;\n\t\tif (x - 1 >= 0) {\n\t\t\tint to = t[(x - 1) * w + y];\n\t\t\tif (!used[to])used[to] = true, q.push(to);\n\t\t}\n\t\tif (x + 1 < h) {\n\t\t\tint to = t[(x + 1) * w + y];\n\t\t\tif (!used[to])used[to] = true, q.push(to);\n\t\t}\n\t\tif (y - 1 >= 0) {\n\t\t\tint to = t[x * w + y-1];\n\t\t\tif (!used[to])used[to] = true, q.push(to);\n\t\t}\n\t\tif (y + 1 < w) {\n\t\t\tint to = t[x * w + y+1];\n\t\t\tif (!used[to])used[to] = true, q.push(to);\n\t\t}\n\t}\n\tfill(all(used), false);\n\tinvy[0] = false;\n\tinvt[0] = false;\n\tused[0] = true;\n\tvector<P> seg[4];\n\trep(i, vs.size()) {\n\t\t//cout << vs[i] << \"\\n\";\n\t\tint v = vs[i];\n\t\tint x = a[v] / w;\n\t\tint y = a[v] % w;\n\t\tif (y - 1 >= 0) {\n\t\t\tint to = t[x * w + y-1];\n\t\t\tbool by = false, bt = false;\n\t\t\tif (!invy[v]) {\n\t\t\t\tby = true;\n\t\t\t\tif(!used[to])seg[0].push_back(minmax(v, to));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tby = false;\n\t\t\t\tif(!used[to])seg[1].push_back(minmax(v, to));\n\t\t\t}\n\t\t\tbt = invt[v];\n\t\t\tif (used[to]) {\n\t\t\t\tif (invy[to] != by || invt[to] != bt) {\n\t\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tused[to] = true;\n\t\t\t\tinvy[to] = by, invt[to] = bt;\n\t\t\t}\n\t\t}\n\t\tif (y + 1 < w) {\n\t\t\tint to = t[x * w + y + 1];\n\t\t\tbool by = false, bt = false;\n\t\t\tif (!invy[v]) {\n\t\t\t\tby = true;\n\t\t\t\tif(!used[to])seg[1].push_back(minmax(v, to));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tby = false;\n\t\t\t\tif(!used[to])seg[0].push_back(minmax(v, to));\n\t\t\t}\n\t\t\tbt = invt[v];\n\t\t\tif (used[to]) {\n\t\t\t\tif (invy[to] != by || invt[to] != bt) {\n\t\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tused[to] = true;\n\t\t\t\tinvy[to] = by, invt[to] = bt;\n\t\t\t}\n\t\t}\n\t\tif (x - 1 >= 0) {\n\t\t\tint to = t[(x - 1) * w + y];\n\t\t\tbool by = false, bt = false;\n\t\t\tif (!invt[v]) {\n\t\t\t\tbt = true;\n\t\t\t\tif(!used[to])seg[2].push_back(minmax(v, to));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tbt = false;\n\t\t\t\tif(!used[to])seg[3].push_back(minmax(v, to));\n\t\t\t}\n\t\t\tby = invy[v];\n\t\t\tif (used[to]) {\n\t\t\t\tif (invy[to] != by || invt[to] != bt) {\n\t\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tused[to] = true;\n\t\t\t\tinvy[to] = by, invt[to] = bt;\n\t\t\t}\n\t\t}\n\t\tif (x + 1 < h) {\n\t\t\tint to = t[(x + 1) * w + y];\n\t\t\tbool by = false, bt = false;\n\t\t\tif (!invt[v]) {\n\t\t\t\tbt = true;\n\t\t\t\tif(!used[to])seg[3].push_back(minmax(v, to));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tbt = false;\n\t\t\t\tif(!used[to])seg[2].push_back(minmax(v, to));\n\t\t\t}\n\t\t\tby = invy[v];\n\t\t\tif (used[to]) {\n\t\t\t\tif (invy[to] != by || invt[to] != bt) {\n\t\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tused[to] = true;\n\t\t\t\tinvy[to] = by, invt[to] = bt;\n\t\t\t}\n\t\t}\n\t}\n\trep(i, 4) {\n\t\tvector<P> s = seg[i];\n\t\t//cout << \"hello\\n\";\n\t\t//rep(j, s.size())cout << s[j].first << \" \" << s[j].second << \"\\n\";\n\t\tsort(all(s));\n\t\tvector<int> ori(h * w);\n\t\trep(j, s.size()) {\n\t\t\tint le = j;\n\t\t\twhile (j + 1 < s.size() && s[j + 1].first == s[j].first)j++;\n\t\t\tif (le != j) {\n\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t}\n\t\t\tori[s[j].first] = s[j].second;\n\t\t}\n\t\tSegT st(ori);\n\t\trep(j, s.size()) {\n\t\t\tint q = st.query(s[j].first + 1, s[j].second);\n\t\t\tif (q >= s[j].second) {\n\t\t\t\tcout << \"NO\\n\"; return;\n\t\t\t}\n\t\t}\n\t}\n\tcout << \"YES\\n\";\n}\n\n\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\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":70,"memory_kb":13852,"score_of_the_acc":-1.3079,"final_rank":4},{"submission_id":"aoj_2796_2240850","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\n\nint H,W;\nint t[250000];\nint u[250001];\nbool rh[250001];\nbool rw[250001];\n\nint dy[]={-1,0,1,0};\nint dx[]={0,1,0,-1};\n\nbool solve(){\n int sy=t[0]/W;\n int sx=t[0]%W;\n for(int i=1;i<H*W;i++){\n int y=t[i]/W;\n int x=t[i]%W;\n if( abs(y-sy)%2 == 1 )rh[ t[i] ]=true;\n if( abs(x-sx)%2 == 1 )rw[ t[i] ]=true;\n }\n \n int last=-1;\n stack<int> total;\n stack<int> st[4];\n \n for(int i=0;i<H*W;i++){\n int n=t[i];\n vector<P> v;\n for(int dir=0;dir<4;dir++){\n int y=n/W+dy[dir];\n int x=n%W+dx[dir];\n if(y<0||H<=y)continue;\n if(x<0||W<=x)continue;\n int m=y*W+x;\n v.push_back(P(u[m],dir));\n }\n \n sort(v.begin(),v.end());\n reverse(v.begin(),v.end());\n \n for(int j=0;j<(int)v.size();j++){\n int dir=v[j].second;\n int y=n/W+dy[dir];\n int x=n%W+dx[dir];\n int m=y*W+x;\n int ndir=dir;\n if(rh[n]&&ndir%2==0)ndir=(ndir+2)%4;\n if(rw[n]&&ndir%2==1)ndir=(ndir+2)%4;\n stack<int> &w=st[ndir];\n if(u[m]<i){\n // cout<<\"pop \"<<n<<' '<<m<<' '<<ndir<<endl;\n if(w.empty()||w.top()!=n)return false;\n w.pop();\n // if(total.top()<last)return false;\n total.pop();\n last=i;\n }\n }\n \n for(int j=0;j<(int)v.size();j++){\n int dir=v[j].second;\n int y=n/W+dy[dir];\n int x=n%W+dx[dir];\n int m=y*W+x;\n int ndir=dir;\n if(rh[n]&&ndir%2==0)ndir=(ndir+2)%4;\n if(rw[n]&&ndir%2==1)ndir=(ndir+2)%4;\n stack<int> &w=st[ndir];\n if(u[m]>=i){\n // cout<<\"push \"<<n<<' '<<m<<' '<<ndir<<endl;\n w.push(m);\n total.push(i);\n }\n }\n }\n return true;\n}\n\nint main(){\n cin>>H>>W;\n for(int i=0;i<H*W;i++){\n cin>>t[i];\n u[t[i]]=i;\n }\n cout<<(solve()?\"YES\":\"NO\")<<endl;\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":5916,"score_of_the_acc":-1.1733,"final_rank":3},{"submission_id":"aoj_2796_2001060","code_snippet":"#include <bits/stdc++.h>\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 all(c) c.begin(),c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nusing namespace std;\ntemplate<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<\"(\"<<p.fs<<\",\"<<p.sc<<\")\";}\ntemplate<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<\"sz = \"<<vc.size()<<endl<<\"[\";for(const T& v:vc) o<<v<<\",\";o<<\"]\";return o;}\nint H,W;\ntypedef pair<int,int> P;\nint ids[500*500];\nbool ok(vector<P> vp){\n\trep(i,H*W) ids[i]=0;\n\tint N=vp.size();\n\trep(i,N){\n\t\tint in=vp[i].fs,out=vp[i].sc;\n\t\tif(in>out) swap(in,out);\n\t\tids[in]=i+1;\n\t\tids[out]=-(i+1);\n\t}\n\tstack<int> st;\n\trep(i,H*W) if(ids[i]!=0){\n\t\tint x=ids[i];\n\t\tif(x>0){\n\t\t\tst.push(x);\n\t\t}else{\n\t\t\tint y=st.top();st.pop();\n\t\t\tif(-x!=y) return 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint p[500*500];\nbool solve(){\n\tcin>>H>>W;\n\trep(i,H*W){\n\t\tint a;\n\t\tcin>>a;\n\t\tp[a]=i;\n\t}\n\tvector<P> vp[2];\n\trep(i,H) rep(j,W-1){\n\t\tvp[j%2].pb(P(p[i*W+j],p[i*W+j+1]));\n\t}\n\tif(!ok(vp[0])||!ok(vp[1])) return 0;\n\tvp[0].clear(),vp[1].clear();\n\trep(j,W) rep(i,H-1){\n\t\tvp[i%2].pb(P(p[i*W+j],p[(i+1)*W+j]));\n\t}\n\tif(!ok(vp[0])||!ok(vp[1])) return 0;\n\treturn 1;\n}\nint main(){\n\tif(solve()) puts(\"YES\");\n\telse puts(\"NO\");\n}","accuracy":1,"time_ms":60,"memory_kb":8796,"score_of_the_acc":-0.4641,"final_rank":2},{"submission_id":"aoj_2796_2000860","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\nusing ll = long long;\nconstexpr ll TEN(int n) { return (n == 0) ? 1 : 10LL * TEN(n-1); }\n\nusing P = pair<int, int>;\nbool ok(vector<P> v) {\n for (auto &p: v) {\n if (p.first > p.second) {\n swap(p.first, p.second);\n }\n }\n sort(begin(v), end(v));\n vector<P> st;\n for (auto p: v) {\n while (st.size() && st.back().second < p.first) {\n st.pop_back();\n }\n if (st.size() && st.back().second < p.second) {\n return false;\n }\n st.push_back(p);\n }\n return true;\n}\n\nint main() {\n int h, w;\n scanf(\"%d %d\", &h, &w);\n int n = h*w;\n int rid[n];\n for (int i = 0; i < n; i++) {\n int a;\n cin >> a;\n rid[a] = i;\n }\n\n for (int y = 0; y < h; y++) {\n vector<P> v[2];\n for (int x = 0; x < w-1; x++) {\n int id = y*w+x;\n v[x%2].push_back(P(rid[id], rid[id+1]));\n }\n if (!ok(v[0]) || !ok(v[1])) {\n cout << \"NO\" << endl;\n return 0;\n }\n }\n\n for (int x = 0; x < w; x++) {\n vector<P> v[2];\n for (int y = 0; y < h-1; y++) {\n int id = y*w+x;\n v[y%2].push_back(P(rid[id], rid[id+w]));\n }\n if (!ok(v[0]) || !ok(v[1])) {\n cout << \"NO\" << endl;\n return 0;\n } \n }\n cout << \"YES\" << endl;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":4200,"score_of_the_acc":-0.3333,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2796_4958013\",\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\\nll mod_pow(ll x, ll n, ll m = mod) {\\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 << 2;\\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}\\n\\nll gcd(ll a, ll b) {\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tll r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = -mod;\\npublic:\\n\\tSegT(vector<int> v) {\\n\\t\\tint n = v.size();\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t\\trep(i, n) {\\n\\t\\t\\tnode[i + sz - 1] = v[i];\\n\\t\\t}\\n\\t\\tper(i, sz - 1) {\\n\\t\\t\\tnode[i] = f(node[2 * i + 1], node[2 * i + 2]);\\n\\t\\t}\\n\\t}\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn max(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\n\\nvoid solve() {\\n\\tint h, w; cin >> h >> w;\\n\\tvector<int> a(h * w);\\n\\trep(i, h * w)cin >> a[i];\\n\\tvector<int> t(h * w);\\n\\trep(i, h * w)t[a[i]] = i;\\n\\tvector<bool> invy(h * w), invt(h * w);\\n\\tqueue<int> q;\\n\\tvector<bool> used(h * w,false);\\n\\tused[0] = true; q.push(0);\\n\\tvector<int> vs;\\n\\twhile (!q.empty()) {\\n\\t\\tint v = q.front(); q.pop();\\n\\t\\tvs.push_back(v);\\n\\t\\tint x = a[v] / w;\\n\\t\\tint y = a[v] % w;\\n\\t\\tif (x - 1 >= 0) {\\n\\t\\t\\tint to = t[(x - 1) * w + y];\\n\\t\\t\\tif (!used[to])used[to] = true, q.push(to);\\n\\t\\t}\\n\\t\\tif (x + 1 < h) {\\n\\t\\t\\tint to = t[(x + 1) * w + y];\\n\\t\\t\\tif (!used[to])used[to] = true, q.push(to);\\n\\t\\t}\\n\\t\\tif (y - 1 >= 0) {\\n\\t\\t\\tint to = t[x * w + y-1];\\n\\t\\t\\tif (!used[to])used[to] = true, q.push(to);\\n\\t\\t}\\n\\t\\tif (y + 1 < w) {\\n\\t\\t\\tint to = t[x * w + y+1];\\n\\t\\t\\tif (!used[to])used[to] = true, q.push(to);\\n\\t\\t}\\n\\t}\\n\\tfill(all(used), false);\\n\\tinvy[0] = false;\\n\\tinvt[0] = false;\\n\\tused[0] = true;\\n\\tvector<P> seg[4];\\n\\trep(i, vs.size()) {\\n\\t\\t//cout << vs[i] << \\\"\\\\n\\\";\\n\\t\\tint v = vs[i];\\n\\t\\tint x = a[v] / w;\\n\\t\\tint y = a[v] % w;\\n\\t\\tif (y - 1 >= 0) {\\n\\t\\t\\tint to = t[x * w + y-1];\\n\\t\\t\\tbool by = false, bt = false;\\n\\t\\t\\tif (!invy[v]) {\\n\\t\\t\\t\\tby = true;\\n\\t\\t\\t\\tif(!used[to])seg[0].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tby = false;\\n\\t\\t\\t\\tif(!used[to])seg[1].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\tbt = invt[v];\\n\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\tif (invy[to] != by || invt[to] != bt) {\\n\\t\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\tinvy[to] = by, invt[to] = bt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (y + 1 < w) {\\n\\t\\t\\tint to = t[x * w + y + 1];\\n\\t\\t\\tbool by = false, bt = false;\\n\\t\\t\\tif (!invy[v]) {\\n\\t\\t\\t\\tby = true;\\n\\t\\t\\t\\tif(!used[to])seg[1].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tby = false;\\n\\t\\t\\t\\tif(!used[to])seg[0].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\tbt = invt[v];\\n\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\tif (invy[to] != by || invt[to] != bt) {\\n\\t\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\tinvy[to] = by, invt[to] = bt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (x - 1 >= 0) {\\n\\t\\t\\tint to = t[(x - 1) * w + y];\\n\\t\\t\\tbool by = false, bt = false;\\n\\t\\t\\tif (!invt[v]) {\\n\\t\\t\\t\\tbt = true;\\n\\t\\t\\t\\tif(!used[to])seg[2].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tbt = false;\\n\\t\\t\\t\\tif(!used[to])seg[3].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\tby = invy[v];\\n\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\tif (invy[to] != by || invt[to] != bt) {\\n\\t\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\tinvy[to] = by, invt[to] = bt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (x + 1 < h) {\\n\\t\\t\\tint to = t[(x + 1) * w + y];\\n\\t\\t\\tbool by = false, bt = false;\\n\\t\\t\\tif (!invt[v]) {\\n\\t\\t\\t\\tbt = true;\\n\\t\\t\\t\\tif(!used[to])seg[3].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tbt = false;\\n\\t\\t\\t\\tif(!used[to])seg[2].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\tby = invy[v];\\n\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\tif (invy[to] != by || invt[to] != bt) {\\n\\t\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\tinvy[to] = by, invt[to] = bt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\trep(i, 4) {\\n\\t\\tvector<P> s = seg[i];\\n\\t\\t//cout << \\\"hello\\\\n\\\";\\n\\t\\t//rep(j, s.size())cout << s[j].first << \\\" \\\" << s[j].second << \\\"\\\\n\\\";\\n\\t\\tsort(all(s));\\n\\t\\tvector<int> ori(h * w);\\n\\t\\trep(j, s.size()) {\\n\\t\\t\\tint le = j;\\n\\t\\t\\twhile (j + 1 < s.size() && s[j + 1].first == s[j].first)j++;\\n\\t\\t\\tif (le != j) {\\n\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t}\\n\\t\\t\\tori[s[j].first] = s[j].second;\\n\\t\\t}\\n\\t\\tSegT st(ori);\\n\\t\\trep(j, s.size()) {\\n\\t\\t\\tint q = st.query(s[j].first + 1, s[j].second);\\n\\t\\t\\tif (q >= s[j].second) {\\n\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << \\\"YES\\\\n\\\";\\n}\\n\\n\\n\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\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\": 70,\n \"memory_kb\": 14104,\n \"score_of_the_acc\": -1.3333,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2796_4955666\",\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\\nll mod_pow(ll x, ll n, ll m = mod) {\\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 << 2;\\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}\\n\\nll gcd(ll a, ll b) {\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tll r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = -mod;\\npublic:\\n\\tSegT(vector<int> v) {\\n\\t\\tint n = v.size();\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t\\trep(i, n) {\\n\\t\\t\\tnode[i + sz - 1] = v[i];\\n\\t\\t}\\n\\t\\tper(i, sz - 1) {\\n\\t\\t\\tnode[i] = f(node[2 * i + 1], node[2 * i + 2]);\\n\\t\\t}\\n\\t}\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn max(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\n\\nvoid solve() {\\n\\tint h, w; cin >> h >> w;\\n\\tvector<int> a(h * w);\\n\\trep(i, h * w)cin >> a[i];\\n\\tvector<int> t(h * w);\\n\\trep(i, h * w)t[a[i]] = i;\\n\\tvector<bool> invy(h * w), invt(h * w);\\n\\tqueue<int> q;\\n\\tvector<bool> used(h * w,false);\\n\\tused[0] = true; q.push(0);\\n\\tvector<int> vs;\\n\\twhile (!q.empty()) {\\n\\t\\tint v = q.front(); q.pop();\\n\\t\\tvs.push_back(v);\\n\\t\\tint x = a[v] / w;\\n\\t\\tint y = a[v] % w;\\n\\t\\tif (x - 1 >= 0) {\\n\\t\\t\\tint to = t[(x - 1) * w + y];\\n\\t\\t\\tif (!used[to])used[to] = true, q.push(to);\\n\\t\\t}\\n\\t\\tif (x + 1 < h) {\\n\\t\\t\\tint to = t[(x + 1) * w + y];\\n\\t\\t\\tif (!used[to])used[to] = true, q.push(to);\\n\\t\\t}\\n\\t\\tif (y - 1 >= 0) {\\n\\t\\t\\tint to = t[x * w + y-1];\\n\\t\\t\\tif (!used[to])used[to] = true, q.push(to);\\n\\t\\t}\\n\\t\\tif (y + 1 < w) {\\n\\t\\t\\tint to = t[x * w + y+1];\\n\\t\\t\\tif (!used[to])used[to] = true, q.push(to);\\n\\t\\t}\\n\\t}\\n\\tfill(all(used), false);\\n\\tinvy[0] = false;\\n\\tinvt[0] = false;\\n\\tused[0] = true;\\n\\tvector<P> seg[4];\\n\\trep(i, vs.size()) {\\n\\t\\t//cout << vs[i] << \\\"\\\\n\\\";\\n\\t\\tint v = vs[i];\\n\\t\\tint x = a[v] / w;\\n\\t\\tint y = a[v] % w;\\n\\t\\tif (y - 1 >= 0) {\\n\\t\\t\\tint to = t[x * w + y-1];\\n\\t\\t\\tbool by = false, bt = false;\\n\\t\\t\\tif (!invy[v]) {\\n\\t\\t\\t\\tby = true;\\n\\t\\t\\t\\tif(!used[to])seg[0].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tby = false;\\n\\t\\t\\t\\tif(!used[to])seg[1].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\tbt = invt[v];\\n\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\tif (invy[to] != by || invt[to] != bt) {\\n\\t\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\tinvy[to] = by, invt[to] = bt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (y + 1 < w) {\\n\\t\\t\\tint to = t[x * w + y + 1];\\n\\t\\t\\tbool by = false, bt = false;\\n\\t\\t\\tif (!invy[v]) {\\n\\t\\t\\t\\tby = true;\\n\\t\\t\\t\\tif(!used[to])seg[1].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tby = false;\\n\\t\\t\\t\\tif(!used[to])seg[0].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\tbt = invt[v];\\n\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\tif (invy[to] != by || invt[to] != bt) {\\n\\t\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\tinvy[to] = by, invt[to] = bt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (x - 1 >= 0) {\\n\\t\\t\\tint to = t[(x - 1) * w + y];\\n\\t\\t\\tbool by = false, bt = false;\\n\\t\\t\\tif (!invt[v]) {\\n\\t\\t\\t\\tbt = true;\\n\\t\\t\\t\\tif(!used[to])seg[2].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tbt = false;\\n\\t\\t\\t\\tif(!used[to])seg[3].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\tby = invy[v];\\n\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\tif (invy[to] != by || invt[to] != bt) {\\n\\t\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\tinvy[to] = by, invt[to] = bt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (x + 1 < h) {\\n\\t\\t\\tint to = t[(x + 1) * w + y];\\n\\t\\t\\tbool by = false, bt = false;\\n\\t\\t\\tif (!invt[v]) {\\n\\t\\t\\t\\tbt = true;\\n\\t\\t\\t\\tif(!used[to])seg[3].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tbt = false;\\n\\t\\t\\t\\tif(!used[to])seg[2].push_back(minmax(v, to));\\n\\t\\t\\t}\\n\\t\\t\\tby = invy[v];\\n\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\tif (invy[to] != by || invt[to] != bt) {\\n\\t\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\tinvy[to] = by, invt[to] = bt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\trep(i, 4) {\\n\\t\\tvector<P> s = seg[i];\\n\\t\\t//cout << \\\"hello\\\\n\\\";\\n\\t\\t//rep(j, s.size())cout << s[j].first << \\\" \\\" << s[j].second << \\\"\\\\n\\\";\\n\\t\\tsort(all(s));\\n\\t\\tvector<int> ori(h * w);\\n\\t\\trep(j, s.size()) {\\n\\t\\t\\tint le = j;\\n\\t\\t\\twhile (j + 1 < s.size() && s[j + 1].first == s[j].first)j++;\\n\\t\\t\\tif (le != j) {\\n\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t}\\n\\t\\t\\tori[s[j].first] = s[j].second;\\n\\t\\t}\\n\\t\\tSegT st(ori);\\n\\t\\trep(j, s.size()) {\\n\\t\\t\\tint q = st.query(s[j].first + 1, s[j].second);\\n\\t\\t\\tif (q >= s[j].second) {\\n\\t\\t\\t\\tcout << \\\"NO\\\\n\\\"; return;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << \\\"YES\\\\n\\\";\\n}\\n\\n\\n\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\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\": 70,\n \"memory_kb\": 13852,\n \"score_of_the_acc\": -1.3079,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2796_2240850\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\n\\nint H,W;\\nint t[250000];\\nint u[250001];\\nbool rh[250001];\\nbool rw[250001];\\n\\nint dy[]={-1,0,1,0};\\nint dx[]={0,1,0,-1};\\n\\nbool solve(){\\n int sy=t[0]/W;\\n int sx=t[0]%W;\\n for(int i=1;i<H*W;i++){\\n int y=t[i]/W;\\n int x=t[i]%W;\\n if( abs(y-sy)%2 == 1 )rh[ t[i] ]=true;\\n if( abs(x-sx)%2 == 1 )rw[ t[i] ]=true;\\n }\\n \\n int last=-1;\\n stack<int> total;\\n stack<int> st[4];\\n \\n for(int i=0;i<H*W;i++){\\n int n=t[i];\\n vector<P> v;\\n for(int dir=0;dir<4;dir++){\\n int y=n/W+dy[dir];\\n int x=n%W+dx[dir];\\n if(y<0||H<=y)continue;\\n if(x<0||W<=x)continue;\\n int m=y*W+x;\\n v.push_back(P(u[m],dir));\\n }\\n \\n sort(v.begin(),v.end());\\n reverse(v.begin(),v.end());\\n \\n for(int j=0;j<(int)v.size();j++){\\n int dir=v[j].second;\\n int y=n/W+dy[dir];\\n int x=n%W+dx[dir];\\n int m=y*W+x;\\n int ndir=dir;\\n if(rh[n]&&ndir%2==0)ndir=(ndir+2)%4;\\n if(rw[n]&&ndir%2==1)ndir=(ndir+2)%4;\\n stack<int> &w=st[ndir];\\n if(u[m]<i){\\n // cout<<\\\"pop \\\"<<n<<' '<<m<<' '<<ndir<<endl;\\n if(w.empty()||w.top()!=n)return false;\\n w.pop();\\n // if(total.top()<last)return false;\\n total.pop();\\n last=i;\\n }\\n }\\n \\n for(int j=0;j<(int)v.size();j++){\\n int dir=v[j].second;\\n int y=n/W+dy[dir];\\n int x=n%W+dx[dir];\\n int m=y*W+x;\\n int ndir=dir;\\n if(rh[n]&&ndir%2==0)ndir=(ndir+2)%4;\\n if(rw[n]&&ndir%2==1)ndir=(ndir+2)%4;\\n stack<int> &w=st[ndir];\\n if(u[m]>=i){\\n // cout<<\\\"push \\\"<<n<<' '<<m<<' '<<ndir<<endl;\\n w.push(m);\\n total.push(i);\\n }\\n }\\n }\\n return true;\\n}\\n\\nint main(){\\n cin>>H>>W;\\n for(int i=0;i<H*W;i++){\\n cin>>t[i];\\n u[t[i]]=i;\\n }\\n cout<<(solve()?\\\"YES\\\":\\\"NO\\\")<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 5916,\n \"score_of_the_acc\": -1.1733,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2796_2001060\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\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 all(c) c.begin(),c.end()\\n#define pb push_back\\n#define fs first\\n#define sc second\\n#define show(x) cout << #x << \\\" = \\\" << x << endl\\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\nusing namespace std;\\ntemplate<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<\\\"(\\\"<<p.fs<<\\\",\\\"<<p.sc<<\\\")\\\";}\\ntemplate<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<\\\"sz = \\\"<<vc.size()<<endl<<\\\"[\\\";for(const T& v:vc) o<<v<<\\\",\\\";o<<\\\"]\\\";return o;}\\nint H,W;\\ntypedef pair<int,int> P;\\nint ids[500*500];\\nbool ok(vector<P> vp){\\n\\trep(i,H*W) ids[i]=0;\\n\\tint N=vp.size();\\n\\trep(i,N){\\n\\t\\tint in=vp[i].fs,out=vp[i].sc;\\n\\t\\tif(in>out) swap(in,out);\\n\\t\\tids[in]=i+1;\\n\\t\\tids[out]=-(i+1);\\n\\t}\\n\\tstack<int> st;\\n\\trep(i,H*W) if(ids[i]!=0){\\n\\t\\tint x=ids[i];\\n\\t\\tif(x>0){\\n\\t\\t\\tst.push(x);\\n\\t\\t}else{\\n\\t\\t\\tint y=st.top();st.pop();\\n\\t\\t\\tif(-x!=y) return 0;\\n\\t\\t}\\n\\t}\\n\\treturn 1;\\n}\\nint p[500*500];\\nbool solve(){\\n\\tcin>>H>>W;\\n\\trep(i,H*W){\\n\\t\\tint a;\\n\\t\\tcin>>a;\\n\\t\\tp[a]=i;\\n\\t}\\n\\tvector<P> vp[2];\\n\\trep(i,H) rep(j,W-1){\\n\\t\\tvp[j%2].pb(P(p[i*W+j],p[i*W+j+1]));\\n\\t}\\n\\tif(!ok(vp[0])||!ok(vp[1])) return 0;\\n\\tvp[0].clear(),vp[1].clear();\\n\\trep(j,W) rep(i,H-1){\\n\\t\\tvp[i%2].pb(P(p[i*W+j],p[(i+1)*W+j]));\\n\\t}\\n\\tif(!ok(vp[0])||!ok(vp[1])) return 0;\\n\\treturn 1;\\n}\\nint main(){\\n\\tif(solve()) puts(\\\"YES\\\");\\n\\telse puts(\\\"NO\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 8796,\n \"score_of_the_acc\": -0.4641,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2796_2000860\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n\\nusing namespace std;\\nusing ll = long long;\\nconstexpr ll TEN(int n) { return (n == 0) ? 1 : 10LL * TEN(n-1); }\\n\\nusing P = pair<int, int>;\\nbool ok(vector<P> v) {\\n for (auto &p: v) {\\n if (p.first > p.second) {\\n swap(p.first, p.second);\\n }\\n }\\n sort(begin(v), end(v));\\n vector<P> st;\\n for (auto p: v) {\\n while (st.size() && st.back().second < p.first) {\\n st.pop_back();\\n }\\n if (st.size() && st.back().second < p.second) {\\n return false;\\n }\\n st.push_back(p);\\n }\\n return true;\\n}\\n\\nint main() {\\n int h, w;\\n scanf(\\\"%d %d\\\", &h, &w);\\n int n = h*w;\\n int rid[n];\\n for (int i = 0; i < n; i++) {\\n int a;\\n cin >> a;\\n rid[a] = i;\\n }\\n\\n for (int y = 0; y < h; y++) {\\n vector<P> v[2];\\n for (int x = 0; x < w-1; x++) {\\n int id = y*w+x;\\n v[x%2].push_back(P(rid[id], rid[id+1]));\\n }\\n if (!ok(v[0]) || !ok(v[1])) {\\n cout << \\\"NO\\\" << endl;\\n return 0;\\n }\\n }\\n\\n for (int x = 0; x < w; x++) {\\n vector<P> v[2];\\n for (int y = 0; y < h-1; y++) {\\n int id = y*w+x;\\n v[y%2].push_back(P(rid[id], rid[id+w]));\\n }\\n if (!ok(v[0]) || !ok(v[1])) {\\n cout << \\\"NO\\\" << endl;\\n return 0;\\n } \\n }\\n cout << \\\"YES\\\" << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 4200,\n \"score_of_the_acc\": -0.3333,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1677,"cells":{"group_id":{"kind":"string","value":"aoj_2792_cpp"},"problem_description":{"kind":"string","value":"B: イカったー / SNS\n問題文\nAOR イカちゃんは最近少し機嫌が悪い。\nどうやら、”イカったー”のフォロー数とフォロワー数の比が気に入らないようだ\n。現在、AOR イカちゃんのフォロー数は $A$ 人、フォロワー数は $B$ 人であり、比は $A:B$ である。\nそこで、AOR イカちゃんはフォロー数とフォロワー数の比が気に入った整数比になるように、\nフォロー数\nを増減させることにした。\nなお気に入った整数比とは、比に含まれるどちらの値も $1$ 以上 $N$ 以下の整数となるように表せる比である。\nしかし、AOR イカちゃんはできるだけフォロー数を変更したくないので、変更前との差の絶対値をできるだけ小さくしたい。\nAOR イカちゃんの機嫌を良くするために、少なくともフォロー数をいくつ変更する必要があるかを求めるプログラムを作成せよ。\n入力\n$A \\ B \\ N$\n入力の制約\n$1 \\le A, \\ B \\le 10^{12}$\n$1 \\leq N \\leq 100 $\n出力\n気に入った整数比にできる、$A$ の変化量の絶対値の最小値を出力せよ。\nサンプル\nサンプル入力1\n19 30 3\nサンプル出力1\n1\nサンプル入力2\n3 7 7\nサンプル出力2\n0\nサンプル入力3\n3 7 1\nサンプル出力3\n4\nサンプル入力4\n102 30 3\nサンプル出力4\n12\nフォローを $12$ 人減らすことで $90:30 \\ (=3:1)$ になり、比の大きい方の数字が $3$ 以下となります。\nこのとき、変化量は $12$ です。\nサンプル入力5\n3 4 2\nサンプル出力5\n1\n一人フォローを外すと $2:4 \\ (=1:2)$ に、フォローすると $4:4 \\ (=1:1)$ になり、どちらも増減の絶対値は $1$ でそれが答えです。\nサンプル入力6\n1 100 2\nサンプル出力6\n49\n最低でも $1$ 人はフォローしていなければいけない事に注意してください。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2792_2000870","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nlong long cl(long long a,long long b,long long n){\n long long na=a+(b-a%b);\n if(na/b>n){\n na=n*b;\n return abs(a-na);\n }else{\n long long na2=a-a%b;\n if(na2==0) return abs(a-na);\n return min(abs(a-na),abs(a-na2));\n }\n}\n\n\nint main(){\n long long a,b,n;\n long long ans = 1e12;\n cin>>a>>b>>n;\n for(long long i=1;i*i<=b;i++){\n if(b%i) continue;\n if(b/i<=n){\n long long c=cl(a,i,n);\n if(c<ans) ans=c;\n }\n if(b/(b/i)<=n){ \n long long d=cl(a,b/i,n);\n if(d<ans) ans=d;\n }\n }\n cout<<ans<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1156,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2792_2000832","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nlong long cl(int a,int b,int n){\n long long na=a+(b-a%b);\n if(na/b>n){\n na=n*b;\n return abs(a-na);\n }else{\n long long na2=a-a%b;\n if(na2 == 0) na2 = 1e12;\n return min(abs(a-na),abs(a-na2));\n }\n}\n\n\nint main(){\n long long a,b,n;\n long long ans = 1e12;\n cin>>a>>b>>n;\n for(long long i=1;i*i<=b;i++){\n if(b%i) continue;\n if(b/i<=n){\n long long c=cl(a,i,n);\n if(c<ans) ans=c;\n }\n if(b/(b/i)<=n){ \n long long d=cl(a,b/i,n);\n if(d<ans) ans=d;\n }\n }\n cout<<ans<<endl;\n\n return 0;\n}","accuracy":0.15789473684210525,"time_ms":10,"memory_kb":1160,"score_of_the_acc":-0.0019,"final_rank":4},{"submission_id":"aoj_2792_2000791","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n\nstruct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}init;\n\ntypedef long long LL;\n#define fin \"\\n\"\nvoid chmin(LL &a,LL b){a=min(a,b);}\nLL f(LL a,LL b){return (a+b-1)/b;}\nint main(){\n LL A,B,N;\n cin>>A>>B>>N;\n LL res=1e15;\n for(LL i=1;i<=1000000;i++)\n if(B%i==0){\n {\n LL m=i;\n LL b=B/m;\n if(B/m<=N)\n for(LL a=1;a<=N;a++)\n chmin(res,abs(a*m-A));\n \n \n }\n {\n LL m=B/i;\n LL b=B/m;\n if(B/m<=N)\n for(LL a=1;a<=N;a++)\n chmin(res,abs(a*m-A));\n \n }\n }\n cout<<res<<fin;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3208,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_2792_2000783","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long int64;\nconst int64 INF = 1LL << 58;\n\nint main()\n{\n int64 A, B, N;\n cin >> A >> B >> N;\n\n vector< int64 > prime;\n for(int64 i = 1; i * i <= B; i++) {\n if(B % i == 0) {\n prime.push_back(i);\n if(i != B / i) prime.push_back(B / i);\n }\n }\n\n\n\n int64 ret = INF;\n for(int64 k : prime) {\n if(B / k > N) continue;\n int64 prev = A / k * k;\n int64 next = (A + k - 1) / k * k;\n int64 gcd1 = __gcd(prev, B);\n int64 gcd2 = __gcd(next, B);\n if(prev > 0 && B / gcd1 <= N && prev / gcd1 <= N) ret = min(ret, llabs(prev - A));\n if(next > 0 && B / gcd2 <= N && next / gcd2 <= N) ret = min(ret, llabs(next - A));\n }\n for(int64 k = B; k / B <= N; k += B) {\n ret = min(ret, llabs(k - A));\n }\n cout << ret << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3156,"score_of_the_acc":-0.9747,"final_rank":2},{"submission_id":"aoj_2792_2000770","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n\nstruct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}init;\n\ntypedef long long LL;\n#define fin \"\\n\"\nvoid chmin(LL &a,LL b){a=min(a,b);}\nLL f(LL a,LL b){return (a+b-1)/b;}\nint main(){\n LL A,B,N;\n cin>>A>>B>>N;\n LL res=1e15;\n for(LL i=1;i<=1000000;i++)\n if(B%i==0){\n {\n LL m=i;\n LL a=f(A,m);\n LL b=B/m;\n if(a<=N&&b<=N)\n chmin(res,a*m-A);\n a=A/m;\n if(a<=N&&b<=N&&a>0)\n chmin(res,A-a*m);\n }\n {\n LL m=B/i;\n LL a=f(A,m);\n LL b=B/m;\n if(a<=N&&b<=N)\n chmin(res,a*m-A);\n a=A/m;\n if(a<=N&&b<=N&&a>0)\n chmin(res,A-a*m);\n }\n }\n cout<<res<<fin;\n\n return 0;\n}","accuracy":0.15789473684210525,"time_ms":10,"memory_kb":3208,"score_of_the_acc":-1,"final_rank":6},{"submission_id":"aoj_2792_2000687","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long int64;\nconst int64 INF = 1LL << 58;\n\nint main()\n{\n int64 A, B, N;\n cin >> A >> B >> N;\n\n\n vector< int64 > prime;\n for(int64 i = 1; i * i <= B; i++) {\n if(B % i == 0) {\n prime.push_back(i);\n if(i != B / i) prime.push_back(B / i);\n }\n }\n\n int64 ret = INF;\n for(int64 k : prime) {\n if(B / k > N) continue;\n int64 prev = A / k * k;\n int64 next = (A + k - 1) / k * k;\n if(prev / k > 0 && prev / k <= N) ret = min(ret, llabs(prev - A));\n if(next / k > 0 && next / k <= N) ret = min(ret, llabs(next - A));\n }\n cout << ret << endl;\n}","accuracy":0.15789473684210525,"time_ms":10,"memory_kb":3160,"score_of_the_acc":-0.9766,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2792_2000870\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nlong long cl(long long a,long long b,long long n){\\n long long na=a+(b-a%b);\\n if(na/b>n){\\n na=n*b;\\n return abs(a-na);\\n }else{\\n long long na2=a-a%b;\\n if(na2==0) return abs(a-na);\\n return min(abs(a-na),abs(a-na2));\\n }\\n}\\n\\n\\nint main(){\\n long long a,b,n;\\n long long ans = 1e12;\\n cin>>a>>b>>n;\\n for(long long i=1;i*i<=b;i++){\\n if(b%i) continue;\\n if(b/i<=n){\\n long long c=cl(a,i,n);\\n if(c<ans) ans=c;\\n }\\n if(b/(b/i)<=n){ \\n long long d=cl(a,b/i,n);\\n if(d<ans) ans=d;\\n }\\n }\\n cout<<ans<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1156,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2792_2000832\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nlong long cl(int a,int b,int n){\\n long long na=a+(b-a%b);\\n if(na/b>n){\\n na=n*b;\\n return abs(a-na);\\n }else{\\n long long na2=a-a%b;\\n if(na2 == 0) na2 = 1e12;\\n return min(abs(a-na),abs(a-na2));\\n }\\n}\\n\\n\\nint main(){\\n long long a,b,n;\\n long long ans = 1e12;\\n cin>>a>>b>>n;\\n for(long long i=1;i*i<=b;i++){\\n if(b%i) continue;\\n if(b/i<=n){\\n long long c=cl(a,i,n);\\n if(c<ans) ans=c;\\n }\\n if(b/(b/i)<=n){ \\n long long d=cl(a,b/i,n);\\n if(d<ans) ans=d;\\n }\\n }\\n cout<<ans<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 10,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.0019,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2792_2000791\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n\\nstruct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}init;\\n\\ntypedef long long LL;\\n#define fin \\\"\\\\n\\\"\\nvoid chmin(LL &a,LL b){a=min(a,b);}\\nLL f(LL a,LL b){return (a+b-1)/b;}\\nint main(){\\n LL A,B,N;\\n cin>>A>>B>>N;\\n LL res=1e15;\\n for(LL i=1;i<=1000000;i++)\\n if(B%i==0){\\n {\\n LL m=i;\\n LL b=B/m;\\n if(B/m<=N)\\n for(LL a=1;a<=N;a++)\\n chmin(res,abs(a*m-A));\\n \\n \\n }\\n {\\n LL m=B/i;\\n LL b=B/m;\\n if(B/m<=N)\\n for(LL a=1;a<=N;a++)\\n chmin(res,abs(a*m-A));\\n \\n }\\n }\\n cout<<res<<fin;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2792_2000783\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long int64;\\nconst int64 INF = 1LL << 58;\\n\\nint main()\\n{\\n int64 A, B, N;\\n cin >> A >> B >> N;\\n\\n vector< int64 > prime;\\n for(int64 i = 1; i * i <= B; i++) {\\n if(B % i == 0) {\\n prime.push_back(i);\\n if(i != B / i) prime.push_back(B / i);\\n }\\n }\\n\\n\\n\\n int64 ret = INF;\\n for(int64 k : prime) {\\n if(B / k > N) continue;\\n int64 prev = A / k * k;\\n int64 next = (A + k - 1) / k * k;\\n int64 gcd1 = __gcd(prev, B);\\n int64 gcd2 = __gcd(next, B);\\n if(prev > 0 && B / gcd1 <= N && prev / gcd1 <= N) ret = min(ret, llabs(prev - A));\\n if(next > 0 && B / gcd2 <= N && next / gcd2 <= N) ret = min(ret, llabs(next - A));\\n }\\n for(int64 k = B; k / B <= N; k += B) {\\n ret = min(ret, llabs(k - A));\\n }\\n cout << ret << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.9747,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2792_2000770\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n\\nstruct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}init;\\n\\ntypedef long long LL;\\n#define fin \\\"\\\\n\\\"\\nvoid chmin(LL &a,LL b){a=min(a,b);}\\nLL f(LL a,LL b){return (a+b-1)/b;}\\nint main(){\\n LL A,B,N;\\n cin>>A>>B>>N;\\n LL res=1e15;\\n for(LL i=1;i<=1000000;i++)\\n if(B%i==0){\\n {\\n LL m=i;\\n LL a=f(A,m);\\n LL b=B/m;\\n if(a<=N&&b<=N)\\n chmin(res,a*m-A);\\n a=A/m;\\n if(a<=N&&b<=N&&a>0)\\n chmin(res,A-a*m);\\n }\\n {\\n LL m=B/i;\\n LL a=f(A,m);\\n LL b=B/m;\\n if(a<=N&&b<=N)\\n chmin(res,a*m-A);\\n a=A/m;\\n if(a<=N&&b<=N&&a>0)\\n chmin(res,A-a*m);\\n }\\n }\\n cout<<res<<fin;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 10,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -1,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2792_2000687\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long int64;\\nconst int64 INF = 1LL << 58;\\n\\nint main()\\n{\\n int64 A, B, N;\\n cin >> A >> B >> N;\\n\\n\\n vector< int64 > prime;\\n for(int64 i = 1; i * i <= B; i++) {\\n if(B % i == 0) {\\n prime.push_back(i);\\n if(i != B / i) prime.push_back(B / i);\\n }\\n }\\n\\n int64 ret = INF;\\n for(int64 k : prime) {\\n if(B / k > N) continue;\\n int64 prev = A / k * k;\\n int64 next = (A + k - 1) / k * k;\\n if(prev / k > 0 && prev / k <= N) ret = min(ret, llabs(prev - A));\\n if(next / k > 0 && next / k <= N) ret = min(ret, llabs(next - A));\\n }\\n cout << ret << endl;\\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 10,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -0.9766,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1678,"cells":{"group_id":{"kind":"string","value":"aoj_2788_cpp"},"problem_description":{"kind":"string","value":"Multisect\nWe are developing the world's coolest AI robot product. After the long struggle, we finally managed to send our product at revision $R_{RC}$ to QA team as a release candidate. However, they reported that some tests failed! Because we were too lazy to set up a continuous integration system, we have no idea when our software corrupted. We only know that the software passed all the test at the past revision $R_{PASS}$. To determine the revision $R_{ENBUG}$ ($R_{PASS} < R_{ENBUG} \\leq R_{RC}$) in which our software started to fail, we must test our product revision-by-revision.\nHere, we can assume the following conditions:\nWhen we test at the revision $R$, the test passes if $R < R_{ENBUG}$, or fails otherwise.\nIt is equally possible, which revision between $R_{PASS} + 1$ and $R_{RC}$ is $R_{ENBUG}$.\nFrom the first assumption, we don't need to test all the revisions. All we have to do is to find the revision $R$ such that the test at $R - 1$ passes and the test at $R$ fails. We have $K$ testing devices. Using them, we can test at most $K$ different revisions simultaneously. We call this \"parallel testing\". By the restriction of the testing environment, we cannot start new tests until a current parallel testing finishes, even if we don't use all the $K$ devices.\nParallel testings take some cost. The more tests fail, the more costly the parallel testing becomes. If $i$ tests fail in a parallel testing, its cost is $T_i$ ($0 \\leq i \\leq K$). And if we run parallel testings multiple times, the total cost is the sum of their costs.\nOf course we want to minimize the total cost to determine $R_{ENBUG}$, by choosing carefully how many and which revisions to test on each parallel testing. What is the minimum expected value of the total cost if we take an optimal strategy?\nInput\nThe input consists of a single test case with the following format.\n$R_{PASS}$ $R_{RC}$ $K$\n$T_0$ $T_1$ ... $T_K$\n$R_{PASS}$ and $R_{RC}$ are integers that represent the revision numbers of our software at which the test passed and failed, respectively. $1 \\leq R_{PASS} < R_{RC} \\leq 1,000$ holds. $K$ ($1 \\leq K \\leq 30$) is the maximum number of revisions we can test in a single parallel testing. $T_i$ is an integer that represents the cost of a parallel testing in which $i$ tests fail ($0 \\leq i \\leq K$). You can assume $1 \\leq T_0 \\leq T_1 \\leq ... \\leq T_K \\leq 100,000$.\nOutput\nOutput the minimum expected value of the total cost. The output should not contain an error greater than 0.0001.\nSample Input 1\n1 10 2\n1 1 1\nOutput for the Sample Input 1\n2.0\nSample Input 2\n1 100 1\n100 100\nOutput for the Sample Input 2\n670.7070707\nSample Input 3\n100 200 4\n1 1 2 2 3\nOutput for the Sample Input 3\n4.6400000\nSample Input 4\n2 3 4\n1 2 3 4 5\nOutput for the Sample Input 4\n0.0\nSample Input 5\n998 1000 4\n10 100 1000 10000 100000\nOutput for the Sample Input 5\n55.0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2788_10853223","code_snippet":"#include <bits/stdc++.h>\n//#include <ext/pb_ds/assoc_container.hpp>\n//#include <ext/pb_ds/tree_policy.hpp>\nusing namespace std;\n//using namespace __gnu_pbds; //new version c++\n//using namespace pb_ds;\n\n#define PB push_back\n#define MP make_pair\n#define SZ size()\n#define REP(i, n) for(int i = 0; i < (n); i++)\n#define ITR(i, j, n) for(int i = (j); i < (n); i++)\n#define mem(array, val) memset(array, val, sizeof(array))\n#define READ(filename) freopen(filename, \"r\", stdin)\n#define WRITE(filename) freopen(filename, \"w\", stdout)\n#define Fr first\n#define Sc second\n#define si(a) scanf(\"%d\", &a)\n#define sl(a) scanf(\"%lld\", &a)\n#define sd(a) scanf(\"%lf\", &a)\n#define ss(a) scanf(\"%s\", a)\n#define sii(a, b) scanf(\"%d%d\", &a, &b)\n#define sll(a, b) scanf(\"%lld%lld\", &a, &b)\n#define sdd(a, b) scanf(\"%lf%lf\", &a, &b)\n#define debug(x) cout << #x << \": \" << x << endl\n#define Fast_IO ios_base::sync_with_stdio(0);cin.tie(0)\n\ntypedef long long Long;\ntypedef pair <int, int> Pii;\n///<-------------------------------------------------END OF TEMPLATE-------------------------------------------------->\n\n#define MAX 1005\n#define MAXG 35\nint K, T[MAXG];\ndouble dp[MAX][MAXG];\n\nint main() {\n int rp, rc, N;\n sii(rp, rc); si(K);\n REP(i, K+1) si(T[i]);\n\n N = rc - rp;\n dp[1][1] = T[0];\n ITR(n, 2, N+1) {\n dp[n][1] = 1e12;\n\n ITR(k, 2, K+2) {\n if(k > n) break;\n dp[n][k] = 1e12;\n ITR(sz, 1, n) {\n if(n-sz < k-1) break;\n dp[n][k] = min(dp[n][k], (double(sz) / double(n)) * (dp[sz][1] - T[0] + T[k-1]) + (double(n - sz) / double(n)) * dp[n-sz][k-1]);\n }\n dp[n][1] = min(dp[n][1], dp[n][k]);\n }\n dp[n][1] += T[0];\n //printf(\"DP[%d]: %.8lf\\n\", n, DP[n]);\n }\n\n printf(\"%.8lf\\n\", dp[N][1] - T[0]);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3840,"score_of_the_acc":-0.0972,"final_rank":10},{"submission_id":"aoj_2788_9669629","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) RFOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\nstruct segtree{\n vi tree;\n int n;\n ll op(ll a,ll b){return max(a,b);}\n ll e(){return -1e18;}\n segtree(int _N){\n n=1;\n while(n<_N)n<<=1;\n tree.assign(2*n,e());\n }\n void set(int i,ll x){\n i+=n;\n tree[i]=x;\n while(i>1){\n i>>=1;\n tree[i]=op(tree[2*i],tree[2*i+1]);\n }\n }\n ll prod(int l,int r){\n l+=n;r+=n;\n ll L=e(),R=e();\n while(l<r){\n if(l%2)L=op(L,tree[l++]);\n if(r%2)R=op(tree[--r],R);\n l>>=1;r>>=1;\n }\n return op(L,R);\n }\n};\nint main(){\n ll a,b,K;cin>>a>>b>>K;\n vi T(K+1);\n REP(i,K+1)cin>>T[i];\n vector<vector<ld>>DP(1000,vector<ld>(K+2,1e18));\n REP(i,K+2)DP[0][i]=0;\n DP[1][K+1]=0;\n FOR(D,1,1000){\n RREP(_D,D)RREP(j,K+1){\n DP[D][j+1]=min(DP[D][j+1],DP[_D][j]+T[K-j]*(D-_D)+DP[D-_D][K+1]);\n }\n }\n //FOR(i,1,10){\n //for(auto j:DP[i])cout<<j<<\" \";cout<<endl;\n //}\n printf(\"%.20Lf\\n\",DP[b-a][K+1]/(b-a));\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":4028,"score_of_the_acc":-0.1557,"final_rank":12},{"submission_id":"aoj_2788_8428091","code_snippet":"#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nint ri() {\n\tint n;\n\tscanf(\"%d\", &n);\n\treturn n;\n}\n\ntypedef double D;\n\nint main() {\n\tint pass = ri();\n\tint rc = ri();\n\t\n\tint n = rc - pass;\n\tint k = ri();\n\tstd::vector<int> t(k + 1);\n\tfor (auto &i : t) i = ri();\n\t\n\tstd::vector<D> res(n + 1, 1e18);\n\tstd::vector<std::vector<D> > dp(k + 2, std::vector<D>(n + 1, 1e18));\n\t\n\tres[0] = res[1] = 0;\n\tdp[1][1] = t[0];\n\tfor (int i = 2; i <= n; i++) {\n\t\tfor (int j = 1; j <= k + 1; j++) {\n\t\t\tfor (int l = 1; l < i; l++) {\n\t\t\t\tdp[j][i] = std::min(dp[j][i], dp[j - 1][l] + (i - l) * (res[i - l] + t[j - 1]));\n\t\t\t}\n\t\t}\n\t\t\n\t\tdouble tmp = 1e18;\n\t\tfor (int j = 1; j <= k + 1; j++) tmp = std::min(tmp, dp[j][i]);\n\t\tres[i] = tmp / i;\n\t\t\n\t\tdp[1][i] = std::min(dp[1][i], tmp + (double) t[0] * i);\n\t}\n\tprintf(\"%.11f\\n\", res[n]);\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3664,"score_of_the_acc":-0.0697,"final_rank":5},{"submission_id":"aoj_2788_7182094","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\nusing ll = long long;\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;}\nconst int INF = (1<<30)-1;\n#define all(p) p.begin(),p.end()\nconst int mod=998244353;\n\nint main(){\n\tint A,B,K;\n\tcin>>A>>B>>K;\n\tvector<double> T(K+1);\n\trep(i,0,K+1) cin>>T[i];\n\tint N=B-A;\n\tvector<vector<double>> dp(N+1,vector<double>(K+2,INF));\n\trep(i,0,K+2) dp[0][i]=0;\n\tdp[1][0]=0;\n\trep(i,1,N+1){\n\t\trep(j,0,N-i+1) rep(k,1,K+2){\n\t\t\t//if(i==1) cout<<j<<\" \"<<k<<\" \"<<dp[2][0]<<endl;\n\t\t\tchmin(dp[i+j][k-1],dp[j][k]+dp[i][0]+T[k-1]*i);\n\t\t}\n\t\t//cout<<i<<\" : \"<<fixed<<setprecision(20)<<dp[i][0]/(double)(i)<<\"\\n\";\n\t}\n\tcout<<fixed<<setprecision(20)<<dp[N][0]/(double)(N)<<\"\\n\";\n}","accuracy":1,"time_ms":10,"memory_kb":3856,"score_of_the_acc":-0.0957,"final_rank":9},{"submission_id":"aoj_2788_6798456","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n#define X first\n#define Y second\n#define SZ(a) ((int)a.size())\n#define ALL(v) v.begin(), v.end()\n#define pb push_back\n\nconst double INF = 9e18;\ndouble dp[1005], dp2[55][1005];\ndouble cst[55];\n\nint main() {\n ios::sync_with_stdio(0), cin.tie(0);\n int l, r, k;\n cin >> l >> r >> k;\n r -= l;\n for (int i = 0; i <= k; ++i)\n cin >> cst[i];\n for (int j = 0; j <= k + 1; ++j)\n fill(dp2[j] + 1, dp2[j] + r + 1, INF);\n for (int i = 2; i <= r; ++i) {\n for (int j = k; j >= 0; --j)\n for (int p = 1; p <= r; ++p)\n dp2[j][p] = min(dp2[j][p], dp2[j + 1][p - (i - 1)] + (double)(i - 1) * (dp[i - 1] + cst[j]));\n dp[i] = INF;\n dp[i] = min(dp[i], dp2[0][i] / i);\n }\n cout << fixed << setprecision(7) << dp[r] << \"\\n\";\n}","accuracy":1,"time_ms":10,"memory_kb":3560,"score_of_the_acc":-0.0211,"final_rank":2},{"submission_id":"aoj_2788_6702572","code_snippet":"/**\n * author: otera\n**/\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing int128_t = __int128_t;\n#define repa(i, n) for(int i = 0; i < n; ++ i)\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\n#define pb push_back\n#define pf push_front\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define rall(c) c.rbegin(), c.rend()\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)))\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 si(c) (int)(c).size()\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\n#define kth_bit(x, k) ((x>>k)&1)\n#define unless(A) if(!(A))\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\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 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 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> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\ntemplate <class T> using vvvc = vector<vvc<T>>;\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T, class U> using umap = unordered_map<T, U>;\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 << ' '; }\ntemplate<class T> void print(const T& a){ cout << a; }\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\nint out(){ cout << '\\n'; return 0; }\ntemplate<class T> int out(const T& t){ print(t); cout << '\\n'; return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#define dump(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...)\n#define dump(...)\n#endif\n\nstruct io_setup {\n io_setup(int precision = 20) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(precision);\n }\n} io_setup_ {};\n\nconst int inf = 1e9 + 7;\n\nvoid solve() {\n INT(r_pass, r_rc, k);\n VEC(int, t, k + 1);\n int n = r_rc - r_pass;\n if(n == 1) {\n out(0.0);\n return;\n }\n vvc<ld> dp(n + 1, vc<ld>(k + 1, inf));\n vc<ld> sum(n + 1, inf);\n for(int j = 1; j <= k; ++ j) {\n dp[1][j] = 0.0;\n }\n sum[0] = 0.0; sum[1] = 0.0;\n for(int i = 2; i <= n; ++ i) {\n for(int j = 1; j <= k; ++ j) {\n for(int p = 1; p <= i - j; ++ p) {\n ld res = 0.0;\n if(j != 1) res = (ld)(i - p) * (dp[i - p][j - 1]) / (ld)i + (ld)p * ((ld)t[j] + sum[p]) / (ld)i;\n else res = (ld)(i - p) * ((ld)t[0] + sum[i - p]) / (ld)i + (ld)p * ((ld)t[j] + sum[p]) / (ld)i;\n debug(i, j, p, res);\n chmin(dp[i][j], res);\n }\n debug(i, j, dp[i][j]);\n // sum[i] += dp[i][j];\n chmin(sum[i], dp[i][j]);\n }\n }\n ld ans = inf;\n for(int j = 1; j <= k; ++ j) {\n chmin(ans, dp[n][j]);\n }\n out(ans);\n}\n\nsigned main() {\n int testcase = 1;\n // in(testcase);\n while(testcase--) solve();\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3820,"score_of_the_acc":-0.109,"final_rank":11},{"submission_id":"aoj_2788_6702564","code_snippet":"/**\n * author: otera\n**/\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing int128_t = __int128_t;\n#define repa(i, n) for(int i = 0; i < n; ++ i)\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\n#define pb push_back\n#define pf push_front\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define rall(c) c.rbegin(), c.rend()\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)))\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 si(c) (int)(c).size()\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\n#define kth_bit(x, k) ((x>>k)&1)\n#define unless(A) if(!(A))\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\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 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 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> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\ntemplate <class T> using vvvc = vector<vvc<T>>;\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T, class U> using umap = unordered_map<T, U>;\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 << ' '; }\ntemplate<class T> void print(const T& a){ cout << a; }\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\nint out(){ cout << '\\n'; return 0; }\ntemplate<class T> int out(const T& t){ print(t); cout << '\\n'; return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#define dump(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...)\n#define dump(...)\n#endif\n\nstruct io_setup {\n io_setup(int precision = 20) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(precision);\n }\n} io_setup_ {};\n\nconst int inf = 1e9 + 7;\n\nvoid solve() {\n INT(r_pass, r_rc, k);\n VEC(int, t, k + 1);\n int n = r_rc - r_pass;\n if(n == 1) {\n out(0.0);\n return;\n }\n vvc<ld> dp(n + 1, vc<ld>(k + 1, inf));\n vc<ld> sum(n + 1, inf);\n for(int j = 1; j <= k; ++ j) {\n dp[1][j] = 0.0;\n }\n sum[0] = 0.0; sum[1] = 0.0;\n for(int i = 2; i <= n; ++ i) {\n for(int j = 1; j <= k; ++ j) {\n for(int p = 1; p <= i - 1; ++ p) {\n ld res = 0.0;\n if(j != 1) res = (ld)(i - p) / (ld)i * (dp[i - p][j - 1]) + (ld)p / (ld)i * (t[j] + sum[p]);\n else res = (ld)(i - p) / (ld)i * (t[0] + sum[i - p]) + (ld)p / (ld)i * (t[j] + sum[p]);\n debug(i, j, p, res);\n chmin(dp[i][j], res);\n }\n debug(i, j, dp[i][j]);\n // sum[i] += dp[i][j];\n chmin(sum[i], dp[i][j]);\n }\n }\n ld ans = inf;\n for(int j = 1; j <= k; ++ j) {\n chmin(ans, dp[n][j]);\n }\n out(ans);\n}\n\nsigned main() {\n int testcase = 1;\n // in(testcase);\n while(testcase--) solve();\n return 0;\n}","accuracy":0.15384615384615385,"time_ms":40,"memory_kb":3580,"score_of_the_acc":-0.0429,"final_rank":17},{"submission_id":"aoj_2788_6702561","code_snippet":"/**\n * author: otera\n**/\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing int128_t = __int128_t;\n#define repa(i, n) for(int i = 0; i < n; ++ i)\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\n#define pb push_back\n#define pf push_front\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define rall(c) c.rbegin(), c.rend()\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)))\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 si(c) (int)(c).size()\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\n#define kth_bit(x, k) ((x>>k)&1)\n#define unless(A) if(!(A))\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\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 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 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> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\ntemplate <class T> using vvvc = vector<vvc<T>>;\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T, class U> using umap = unordered_map<T, U>;\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 << ' '; }\ntemplate<class T> void print(const T& a){ cout << a; }\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\nint out(){ cout << '\\n'; return 0; }\ntemplate<class T> int out(const T& t){ print(t); cout << '\\n'; return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#define dump(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...)\n#define dump(...)\n#endif\n\nstruct io_setup {\n io_setup(int precision = 20) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(precision);\n }\n} io_setup_ {};\n\nconst int inf = 1e9 + 7;\n\nvoid solve() {\n INT(r_pass, r_rc, k);\n VEC(int, t, k + 1);\n int n = r_rc - r_pass;\n vvc<ld> dp(n + 1, vc<ld>(k + 1, inf));\n vc<ld> sum(n + 1, inf);\n for(int j = 1; j <= k; ++ j) {\n dp[1][j] = 0.0;\n }\n sum[0] = 0.0; sum[1] = 0.0;\n for(int i = 2; i <= n; ++ i) {\n for(int j = 1; j <= k; ++ j) {\n for(int p = 1; p <= i - 1; ++ p) {\n ld res = 0.0;\n if(j != 1) res = (ld)(i - p) / (ld)i * (dp[i - p][j - 1]) + (ld)p / (ld)i * (t[j] + sum[p]);\n else res = (ld)(i - p) / (ld)i * (t[0] + sum[i - p]) + (ld)p / (ld)i * (t[j] + sum[p]);\n debug(i, j, p, res);\n chmin(dp[i][j], res);\n }\n debug(i, j, dp[i][j]);\n // sum[i] += dp[i][j];\n chmin(sum[i], dp[i][j]);\n }\n }\n ld ans = inf;\n for(int j = 1; j <= k; ++ j) {\n chmin(ans, dp[n][j]);\n }\n out(ans);\n}\n\nsigned main() {\n int testcase = 1;\n // in(testcase);\n while(testcase--) solve();\n return 0;\n}","accuracy":0.15384615384615385,"time_ms":40,"memory_kb":3568,"score_of_the_acc":-0.0399,"final_rank":16},{"submission_id":"aoj_2788_6648013","code_snippet":"#include <bits/stdc++.h>\n\n#include <limits>\n#include <type_traits>\n\nnamespace suisen {\n// ! utility\ntemplate <typename ...Types>\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\ntemplate <bool cond_v, typename Then, typename OrElse>\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\n if constexpr (cond_v) {\n return std::forward<Then>(then);\n } else {\n return std::forward<OrElse>(or_else);\n }\n}\n\n// ! function\ntemplate <typename ReturnType, typename Callable, typename ...Args>\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\ntemplate <typename F, typename T>\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\ntemplate <typename F, typename T>\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\n\ntemplate <typename Comparator, typename T>\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\n\n// ! integral\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\ntemplate <typename T, unsigned int n>\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\ntemplate <typename T, unsigned int n>\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\n\n// ?\ntemplate <typename T>\nstruct safely_multipliable {};\ntemplate <>\nstruct safely_multipliable<int> { using type = long long; };\ntemplate <>\nstruct safely_multipliable<long long> { using type = __int128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\ntemplate <>\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<float> { using type = float; };\ntemplate <>\nstruct safely_multipliable<double> { using type = double; };\ntemplate <>\nstruct safely_multipliable<long double> { using type = long double; };\ntemplate <typename T>\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\n\n} // namespace suisen\n\n// ! type aliases\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n\ntemplate <typename T>\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <typename T, typename U>\nusing umap = std::unordered_map<T, U>;\n\n// ! macros (capital: internal macro)\n#define OVERLOAD2(_1,_2,name,...) name\n#define OVERLOAD3(_1,_2,_3,name,...) name\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\n\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\n#define REP3(i,l,r) REP4(i,l,r,1)\n#define REP2(i,n) REP3(i,0,n)\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\n#define REPINF2(i,l) REPINF3(i,l,1)\n#define REPINF1(i) REPINF2(i,0)\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\n#define RREP3(i,l,r) RREP4(i,l,r,1)\n#define RREP2(i,n) RREP3(i,0,n)\n\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\n\n#define CAT_I(a, b) a##b\n#define CAT(a, b) CAT_I(a, b)\n#define UNIQVAR(tag) CAT(tag, __LINE__)\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\n\n#define all(iterable) std::begin(iterable), std::end(iterable)\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\n\n#ifdef LOCAL\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <class T, class... Args>\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\n constexpr const char* prefix = \"[\\033[32mDEBUG\\033[m] \";\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \"\" : \"(\";\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \"\" : \")\";\n std::cerr << prefix << open_brakets << s << close_brakets << \": \" << open_brakets << std::forward<T>(first);\n ((std::cerr << \", \" << std::forward<Args>(args)), ...);\n std::cerr << close_brakets << \"\\n\";\n}\n\n#else\n# define debug(...) void(0)\n#endif\n\n// ! I/O utilities\n\n// pair\ntemplate <typename T, typename U>\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U> &a) {\n return out << a.first << ' ' << a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...> &a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return out;\n } else {\n out << std::get<N>(a);\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\n out << ' ';\n }\n return operator<<<N + 1>(out, a);\n }\n}\n// vector\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const std::vector<T> &a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\n// array\ntemplate <typename T, size_t N>\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N> &a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\ninline void print() { std::cout << '\\n'; }\ntemplate <typename Head, typename... Tail>\ninline void print(const Head &head, const Tail &...tails) {\n std::cout << head;\n if (sizeof...(tails)) std::cout << ' ';\n print(tails...);\n}\ntemplate <typename Iterable>\nauto print_all(const Iterable& v, std::string sep = \" \", std::string end = \"\\n\") -> decltype(std::cout << *v.begin(), void()) {\n for (auto it = v.begin(); it != v.end();) {\n std::cout << *it;\n if (++it != v.end()) std::cout << sep;\n }\n std::cout << end;\n}\n\n// pair\ntemplate <typename T, typename U>\nstd::istream& operator>>(std::istream& in, std::pair<T, U> &a) {\n return in >> a.first >> a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::istream& operator>>(std::istream& in, std::tuple<Args...> &a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return in;\n } else {\n return operator>><N + 1>(in >> std::get<N>(a), a);\n }\n}\n// vector\ntemplate <typename T>\nstd::istream& operator>>(std::istream& in, std::vector<T> &a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\n// array\ntemplate <typename T, size_t N>\nstd::istream& operator>>(std::istream& in, std::array<T, N> &a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\ntemplate <typename ...Args>\nvoid read(Args &...args) {\n ( std::cin >> ... >> args );\n}\n\n// ! integral utilities\n\n// Returns pow(-1, n)\ntemplate <typename T>\nconstexpr inline int pow_m1(T n) {\n return -(n & 1) | 1;\n}\n// Returns pow(-1, n)\ntemplate <>\nconstexpr inline int pow_m1<bool>(bool n) {\n return -int(n) | 1;\n}\n\n// Returns floor(x / y)\ntemplate <typename T>\nconstexpr inline T fld(const T x, const T y) {\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\n}\ntemplate <typename T>\nconstexpr inline T cld(const T x, const T y) {\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\n}\n\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int popcount(const T x) { return __builtin_popcount(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int popcount(const T x) { return __builtin_popcount(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int popcount(const T x) { return __builtin_popcountll(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\ntemplate <typename T>\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> - 1 - count_lz(x); }\ntemplate <typename T>\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\ntemplate <typename T>\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\ntemplate <typename T>\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\n\nstruct all_subset {\n struct all_subset_iter {\n const int s; int t;\n constexpr all_subset_iter(int s) : s(s), t(s + 1) {}\n constexpr auto operator*() const { return t; }\n constexpr auto operator++() {}\n constexpr auto operator!=(std::nullptr_t) { return t ? (--t &= s, true) : false; }\n };\n int s;\n constexpr all_subset(int s) : s(s) {}\n constexpr auto begin() { return all_subset_iter(s); }\n constexpr auto end() { return nullptr; }\n};\n\n// ! container\n\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\nauto priqueue_comp(const Comparator comparator) {\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\n}\n\ntemplate <typename Iterable>\nauto isize(const Iterable &iterable) -> decltype(int(iterable.size())) {\n return iterable.size();\n}\n\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\nauto generate_vector(int n, Gen generator) {\n std::vector<T> v(n);\n for (int i = 0; i < n; ++i) v[i] = generator(i);\n return v;\n}\ntemplate <typename T>\nauto generate_range_vector(T l, T r) {\n return generate_vector(r - l, [l](int i) { return l + i; });\n}\ntemplate <typename T>\nauto generate_range_vector(T n) {\n return generate_range_vector(0, n);\n}\n\ntemplate <typename T>\nvoid sort_unique_erase(std::vector<T> &a) {\n std::sort(a.begin(), a.end());\n a.erase(std::unique(a.begin(), a.end()), a.end());\n}\n\ntemplate <typename InputIterator, typename BiConsumer>\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\n}\ntemplate <typename Container, typename BiConsumer>\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()){\n foreach_adjacent_values(c.begin(), c.end(), f);\n}\n\n// ! other utilities\n\n// x <- min(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmin(T &x, const T &y) {\n if (y >= x) return false;\n x = y;\n return true;\n}\n// x <- max(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmax(T &x, const T &y) {\n if (y <= x) return false;\n x = y;\n return true;\n}\n\nnamespace suisen {}\nusing namespace suisen;\nusing namespace std;\n\nstruct io_setup {\n io_setup(int precision = 20) {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(precision);\n }\n} io_setup_ {};\n\n// ! code from here\n\nconstexpr long long inf = numeric_limits<long long>::max() / 2;\n\nint main() {\n input(int, l, r, k);\n const int n = r - l;\n\n vector<long long> t(k + 1);\n read(t);\n\n vector<vector<long long>> dp(n + 1, vector<long long>(k + 1, inf));\n vector<long long> dp_min(n + 1, inf);\n dp[1][0] = dp_min[1] = 0;\n\n rep(i, 2, n + 1) {\n rep(x0, 1, i) {\n int x1 = i - x0;\n chmin(dp[i][1], x0 * t[1] + dp_min[x0] + x1 * t[0] + dp_min[x1]);\n chmin(dp_min[i], dp[i][1]);\n }\n rep(j, 2, k + 1) {\n rep(x, 1, i) {\n chmin(dp[i][j], dp[i - x][j - 1] + x * t[j] + dp_min[x]);\n }\n chmin(dp_min[i], dp[i][j]);\n }\n \n }\n\n print((double) dp_min[n] / n);\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3720,"score_of_the_acc":-0.0614,"final_rank":3},{"submission_id":"aoj_2788_6044487","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=1000000007,MAX=1005;\nconst ll INF=1LL<<60;\ndouble dp[MAX];\ndouble cost[MAX][33];\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 A,B,K;cin>>A>>B>>K;\n int N=B-A;\n vector<double> C(K+1);\n for(int i=0;i<=K;i++) cin>>C[i];\n \n for(int t=2;t<=N;t++){\n for(int i=0;i<MAX;i++) for(int j=0;j<33;j++) cost[i][j]=INF;\n cost[t][0]=0;\n for(int i=t;i>=1;i--){\n for(int j=0;j<=K;j++){\n if(cost[i][j]==INF) continue;\n int need=(i+K-j)/(K+1-j);\n for(int k=need;k<=i;k++){\n int to=i-k;\n if(i==t&&to==0) continue;\n if(to<0) continue;\n chmin(cost[to][j+1],cost[i][j]+(double)(i-to)/t*(C[j]+dp[i-to]));\n }\n }\n }\n dp[t]=INF;\n for(int j=1;j<=K+1;j++) chmin(dp[t],cost[0][j]);\n }\n \n cout<<fixed<<setprecision(25)<<dp[N]<<endl;\n}","accuracy":1,"time_ms":1800,"memory_kb":3900,"score_of_the_acc":-1.1067,"final_rank":15},{"submission_id":"aoj_2788_6012567","code_snippet":"//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n#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<unordered_set>\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\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 = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)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}\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)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 2;\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}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nld dp[1005][35];\nld ans[1005];\nvoid solve() {\n\tint a, b, m; cin >> a >> b >> m;\n\tint n = b - a;\n\tvector<int> cost(m + 1);\n\trep(i, m + 1)cin >> cost[i];\n\trep(i, n + 1)rep(j, m+2)dp[i][j] = INF;\n\trep(i, n + 1)ans[i] = INF;\n\tans[0] = 0;\n\tans[1] = 0;\n\tdp[0][0] = 0;\n\tfor (int len = 1; len <= n; len++) {\n\t\trep(c, m+1) {\n\t\t\tfor (int ad = 1; ad < len; ad++) {\n\t\t\t\tld val = dp[len - ad][c] + ad * cost[c] + ad*ans[ad];\n\t\t\t\tdp[len][c + 1] = min(dp[len][c + 1], val);\n\t\t\t}\n\t\t}\n\t\trep(c, m + 2)ans[len] = min(ans[len], dp[len][c]/len);\n\t\trep(c, m + 1) {\n\t\t\tfor (int ad = len; ad <= len; ad++) {\n\t\t\t\tld val = dp[len - ad][c] + ad * cost[c] + ad * ans[ad];\n\t\t\t\tdp[len][c + 1] = min(dp[len][c + 1], val);\n\t\t\t}\n\t\t}\n\t}\n\t//cout << dp[3][1] << \"\\n\";\n\t//cout << ans[1] << \"\\n\";\n\tcout << ans[n] << \"\\n\";\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(8);\n\t//init_f();\n\t//init();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4072,"score_of_the_acc":-0.1724,"final_rank":13},{"submission_id":"aoj_2788_5183868","code_snippet":"#include <bits/stdc++.h>\n#define maxn 100086\n\nusing namespace std;\n\nint l, r, n, m;\nint t[maxn];\ndouble f[maxn][40], g[maxn];\n\nint main(){\n\tscanf(\"%d%d%d\", &l, &r, &m);\n\tfor(int i = 0;i <= m;i++) scanf(\"%d\", &t[i]);\n\tn = r - l;\n\tf[1][0] = t[0], g[1] = 0;\n\tfor(int i = 1;i <= m;i++) f[1][i] = 1e18;\n\tfor(int i = 2;i <= n;i++){\n\t\tg[i] = 1e18;\n\t\tfor(int j = 1;j <= m;j++){\n\t\t\tf[i][j] = 1e18;\n\t\t\tfor(int k = 1;k < i;k++){\n\t\t\t\tf[i][j] = min(f[i][j], f[i - k][j - 1] + k * (g[k] + t[j])); \t\n\t\t\t}\n\t\t\tg[i] = min(g[i], f[i][j] / i);\n\t\t}\n\t\tf[i][0] = i * (g[i] + t[0]);\n\t}\n\tprintf(\"%.10f\", g[n]);\n}","accuracy":1,"time_ms":20,"memory_kb":3532,"score_of_the_acc":-0.0197,"final_rank":1},{"submission_id":"aoj_2788_5179071","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint r_pass,r_rc,k;\nint n;\nint a[55];\ndouble dp[1005][35];\n\nint main()\n{\n cin>>r_pass>>r_rc>>k;\n n=r_rc-r_pass;\n for (int i=0;i<=k;i++)\n {\n cin>>a[i];\n }\n for (int i=2;i<=1000;i++)\n {\n for (int j=0;j<=k;j++)\n {\n dp[i][j]=1e10;\n }\n }\n for (int i=2;i<=n;i++)\n {\n for (int j=1;j<=k;j++)\n {\n for (int u=1;u<i;u++)\n {\n dp[i][j]=min(dp[i][j],1.0*u/i*(dp[u][j-1]+(j==1)*a[0])+1.0*(i-u)/i*(dp[i-u][0]+a[j]));\n }\n }\n for (int j=1;j<k;j++)\n {\n dp[i][j+1]=min(dp[i][j+1],dp[i][j]);\n }\n dp[i][0]=dp[i][k];\n }\n printf(\"%.6f\\n\",dp[n][k]);\n return 0;\n}","accuracy":0.15384615384615385,"time_ms":100,"memory_kb":3476,"score_of_the_acc":-0.0503,"final_rank":18},{"submission_id":"aoj_2788_5178003","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cassert>\n#include <cstring>\n#include <cmath>\n#include <functional>\n#include <algorithm>\n#include <utility>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#ifdef XLor\n #define dbg(args...) cout << \"\" << #args << \" -> \", err(args)\n void err() { std::cout << \"\" << std::endl; }\n template<typename T, typename...Args>\n void err(T a, Args...args) { std::cout << a << ' '; err(args...); }\n#else\n #define dbg(...)\n#endif\n#define ms(a,b) memset(a,b,sizeof(a))\nusing namespace std;\nusing ll = long long;\nusing PII = pair<int,int>;\nconst int mod = 998244353;\nconst int inf = 1 << 30;\nconst int maxn = 2000 + 5;\n\nint n, k, a[maxn];\ndouble f[maxn][maxn], g[maxn];\n\nint main() {\n int rp, rc;\n scanf(\"%d%d%d\", &rp, &rc, &k);\n n = rc - rp;\n for (int i = 0; i <= k; i++) {\n scanf(\"%d\", a + i);\n }\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= k; j++) {\n f[i][j] = 1e18;\n }\n }\n f[1][0] = g[1] = 0.0;\n f[1][1] = a[1];\n for (int i = 2; i <= n; i++) {\n for (int k = 1; k < i; k++) {\n double cur = 1.0 * (i - k) / i * (g[i - k] + a[0]) + 1.0 * k / i * (g[k] + a[1]);\n f[i][1] = min(f[i][1], cur);\n }\n g[i] = f[i][1];\n for (int j = 2; j <= k; j++) {\n for (int k = 1; k < i; k++) {\n double cur = 1.0 * (i - k) / i * f[i - k][j - 1];\n cur += 1.0 * k / i * (a[j] + g[k]);\n f[i][j] = min(f[i][j], cur);\n }\n // dbg(i, j, f[i][j]);\n g[i] = min(g[i], f[i][j]);\n }\n // dbg(i, g[i]);\n }\n printf(\"%.8lf\\n\", g[n]);\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":7448,"score_of_the_acc":-1.0503,"final_rank":14},{"submission_id":"aoj_2788_3155523","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(int i=(int)(a);i<(int)(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 1e16\n#define mod 1000000007\n\nint N,K;\ndouble T[33];\ndouble dp[1011][33];\ndouble minc[1011];\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n {\n int r1,r2;\n cin>>r1>>r2;\n N=r2-r1;\n }\n cin>>K;\n rep(i,K+1)cin>>T[i];\n\n rep(i,N+1)repl(j,1,K+1)dp[i][j]=INF;\n rep(i,N+1)minc[i]=INF;\n minc[0]=0; minc[1]=0;\n repl(i,2,N+1){\n repl(j,1,K+1){\n repl(k,1,i){\n int l=i-k;\n double p1=(double)l/(double)i;\n double p2=(double)(i-l)/(double)i;\n if(j>1){\n minch(dp[i][j],p2*dp[k][j-1]+p1*(T[j]+minc[l]));\n }else{\n minch(dp[i][j],p2*(minc[i-l]+T[0])+p1*(T[j]+minc[l]));\n }\n }\n minch(minc[i],dp[i][j]);\n }\n }\n printf(\"%.10f\\n\", minc[N]);\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3528,"score_of_the_acc":-0.0634,"final_rank":4},{"submission_id":"aoj_2788_3154618","code_snippet":"#include <bits/stdc++.h>\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\ndouble dp[1001];\nint a,b,k;\nint t[35];\nint sum[35];\ndouble ct[35];\ndouble dp2[1001][35];\n\ndouble solve(int sz);\ndouble solve2(int sz,int i);\n\ndouble solve2(int sz,int i){\n\tif(dp2[sz][i]>=0.0)return dp2[sz][i];\n\tif(sz<=0){\n\t\treturn 1e18;\n\t}\n\tif(i==0)return t[0]*sz+solve(sz)*sz;\n\tdouble ans=1e18;\n\tfor(int j=1;j<=sz-1;j++){\n\t\tdouble val=solve(j)*j;\n\t\tval+=t[i]*j;\n\t\tval+=solve2(sz-j,i-1);\n\t\tans=min(ans,val);\n\t}\n\treturn dp2[sz][i]=ans;\n}\n\ndouble solve(int sz){\n\tif(dp[sz]>=0.0)return dp[sz];\n\tif(sz<=1)return 0;\n\tdouble ans=1e18;\n\tfor(int i=1;i<=min(k,sz-1);i++){\n\t\tans=min((double)solve2(sz,i)/sz,ans);\n\t}\n\treturn (dp[sz]=ans);\n}\n\nint main(void){\n\tscanf(\"%d%d%d\",&a,&b,&k);\n\tint n=b-a;\n\tfor(int i=0;i<=k;i++){\n\t\tscanf(\"%d\",&t[i]);\n\t}\n\tfor(int i=0;i<=k;i++){\n\t\tsum[i+1]+=sum[i];\n\t\tsum[i+1]+=t[i];\n\t\tct[i+1]=(double)sum[i+1]/(i+1);\n\t}\n\tfor(int i=0;i<=n+1;i++){\n\t\tdp[i]=-1.0;\n\t\tfor(int j=0;j<=k+1;j++){\n\t\t\tdp2[i][j]=-1;\n\t\t}\n\t}\n\tprintf(\"%.10f\\n\",solve(n));\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3700,"score_of_the_acc":-0.0787,"final_rank":7},{"submission_id":"aoj_2788_3154614","code_snippet":"#include <bits/stdc++.h>\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\ndouble dp[1001];\nint a,b,k;\nint t[35];\nint sum[35];\ndouble ct[35];\ndouble dp2[1001][35];\n\ndouble solve(int sz);\ndouble solve2(int sz,int i);\n\ndouble solve2(int sz,int i){\n\tif(dp2[sz][i]>=0.0)return dp2[sz][i];\n\tif(sz<=0){\n\t\treturn 1e18;\n\t}\n\tif(i==0)return t[0]*sz+solve(sz)*sz;\n\tdouble ans=1e18;\n\tfor(int j=1;j<=sz-1;j++){\n\t\tdouble val=solve(j)*j;\n\t\tval+=t[i]*j;\n\t\tval+=solve2(sz-j,i-1);\n\t\tans=min(ans,val);\n\t}\n\t//printf(\"solve2 %d %d %f\\n\",sz,i,ans);\n\treturn dp2[sz][i]=ans;\n}\n\ndouble solve(int sz){\n\tif(dp[sz]>=0.0)return dp[sz];\n\tif(sz<=1)return 0;\n\t//printf(\"%d\\n\",sz);\n\tdouble ans=1e18;\n\tfor(int i=1;i<=min(k,sz-1);i++){\n\t\t/*\n\t\tdouble val=0;\n\t\tint v1=sz%(i+1);\n\t\tint v2=i+1-v1;\n\t\tint len=sz/(i+1);\n\t\tprintf(\"%d %d %d\\n\",v1,v2,len);\n\t\tfor(int j=0;j<v2;j++){\n\t\t\tval+=(double)t[j]*len/(sz);\n\t\t}\n\t\tfor(int j=v2;j<=i;j++){\n\t\t\tval+=(double)t[j]*(len+1)/(sz);\n\t\t}\n\t\tval+=(double)solve(len)*(v2*len)/(sz);\n\t\tif(v1>0)val+=(double)solve(len+1)*(sz-v2*len)/(sz);\n\t\t*/\n\t\tans=min((double)solve2(sz,i)/sz,ans);\n\t}\n\t//printf(\"%d %.2f\\n\",sz,ans);\n\treturn (dp[sz]=ans);\n}\n\nint main(void){\n\tscanf(\"%d%d%d\",&a,&b,&k);\n\tint n=b-a;\n\tfor(int i=0;i<=k;i++){\n\t\tscanf(\"%d\",&t[i]);\n\t}\n\tfor(int i=0;i<=k;i++){\n\t\tsum[i+1]+=sum[i];\n\t\tsum[i+1]+=t[i];\n\t\tct[i+1]=(double)sum[i+1]/(i+1);\n\t\t//printf(\"%.5f\\n\",ct[i+1]);\n\t}\n\tfor(int i=0;i<=n+1;i++){\n\t\tdp[i]=-1.0;\n\t\tfor(int j=0;j<=k+1;j++){\n\t\t\tdp2[i][j]=-1;\n\t\t}\n\t}\n\tprintf(\"%.10f\\n\",solve(n));\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3720,"score_of_the_acc":-0.0838,"final_rank":8},{"submission_id":"aoj_2788_3112386","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 1005\n#define SIZE 31\n\nint R_OK,R_FALSE,K;\ndouble cost[SIZE];\ndouble dp[SIZE][NUM];\ndouble memo[NUM];\n\n\ndouble recursive(int length){\n\n\tif(memo[length] != DBL_MAX){\n\t\treturn memo[length];\n\t}\n\n\tfor(int x = 1; x <= min(K,length); x++){\n\n\t\tif(x == 1){\n\n\t\t\tfor(int start = 1; start <= length-1; start++){\n\n\t\t\t\tdp[x][length] = min(dp[x][length],(double)start/(double)length*(recursive(start)+cost[1])+\n\t\t\t\t\t\t(double)(length-start)/(double)length*(recursive(length-start)+cost[0]));\n\t\t\t}\n\n\t\t}else{\n\n\t\t\tfor(int start = 1; start <= length-x; start++){\n\n\t\t\t\tdp[x][length] = min(dp[x][length],(double)start/(double)length*(recursive(start)+cost[x])+\n\t\t\t\t\t\t(double)(length-start)/(double)length*dp[x-1][length-start]);\n\t\t\t}\n\t\t}\n\t\tmemo[length] = min(memo[length],dp[x][length]);\n\t}\n\n\treturn memo[length];\n}\n\nint main(){\n\n\tscanf(\"%d %d %d\",&R_OK,&R_FALSE,&K);\n\n\tint max_index = R_FALSE-R_OK;\n\n\tfor(int i = 0; i <= K; i++){\n\t\tscanf(\"%lf\",&cost[i]);\n\t}\n\n\tfor(int i = 0; i <= min(K,max_index); i++){\n\t\tfor(int k = 0; k <= max_index; k++){\n \t\t\tdp[i][k] = DBL_MAX;\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= max_index; i++)memo[i] = DBL_MAX;\n\n\tmemo[0] = 0;\n\tmemo[1] = 0;\n\tmemo[2] = (cost[0]+cost[1])/2.0;\n\tdp[1][2] = memo[2];\n\n\tprintf(\"%.10lf\\n\",recursive(max_index));\n\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3556,"score_of_the_acc":-0.0704,"final_rank":6},{"submission_id":"aoj_2788_3006181","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int N = 1e3 + 10;\nconst int K = 31;\nconst long double inf = 1e18;\n\nlong double f[N][K], g[N], t[K];\n\ninline void chkmin(long double &a, long double b) {\n\tif (a > b) a = b;\n}\n\nint main() {\n\tint a, b;\tscanf(\"%d%d\", &a, &b);\n\tint K;\t\tscanf(\"%d\", &K);\n\tint n = b - a;\n\tfor (int i = 0; i <= K; i++) {\n\t\tdouble x; scanf(\"%lf\", &x);\n\t\tt[i] = x;\n\t}\n\tfor (int i = 2; i <= n; i++) {\n\t\tf[i][1] = inf;\n\t\tfor (int j = 1; j < i; j++) {\n\t\t\tint a = j, b = i - j;\n\t\t\tchkmin(f[i][1], a * (g[a] + t[1]) / i + b * (g[b] + t[0]) / i);\n\t\t}\n\t\tg[i] = f[i][1];\n\t\tfor (int k = 2; k <= K; k++) {\n\t\t\tf[i][k] = inf;\n\t\t\tfor (int j = 0; j <= i; j++) if (f[b][k-1] < inf){\n\t\t\t\tint a = j;\n\t\t\t\tint b = i - j;\n\t\t\t\tchkmin(f[i][k], a * (g[a] + t[k]) / i + f[b][k-1] * b / i);\n\t\t\t}\n\t\t\tchkmin(g[i], f[i][k]);\n\t\t}\n\t}\n\tprintf(\"%.10lf\\n\", (double)g[n]);\n\treturn 0;\n}\n/*\n1 100 1\n100 100\n*/","accuracy":0.15384615384615385,"time_ms":130,"memory_kb":3720,"score_of_the_acc":-0.1285,"final_rank":19},{"submission_id":"aoj_2788_3006157","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int N = 1e3 + 10;\nconst int K = 31;\nconst long double inf = 1e18;\n\nlong double f[N][K], g[N], t[K];\n\ninline void chkmin(long double &a, long double b) {\n\tif (a > b) a = b;\n}\n\nint main() {\n\tint a, b;\tscanf(\"%d%d\", &a, &b);\n\tint K;\t\tscanf(\"%d\", &K);\n\tint n = b - a;\n\tfor (int i = 0; i <= K; i++) {\n\t\tdouble x; scanf(\"%lf\", &x);\n\t\tt[i] = x;\n\t}\n\tfor (int i = 2; i <= n; i++) {\n\t\tf[i][1] = inf;\n\t\tfor (int j = 1; j < i; j++) {\n\t\t\tint a = j, b = i - j;\n\t\t\tchkmin(f[i][1], a * (g[a] + t[1]) / i + b * (g[b] + t[0]) / i);\n\t\t}\n\t\tg[i] = f[i][1];\n\t\tfor (int k = 2; k <= K; k++) {\n\t\t\tf[i][k] = inf;\n\t\t\tfor (int j = 1; j < i; j++) if (f[b][k-1] < inf){\n\t\t\t\tint a = j;\n\t\t\t\tint b = i - j;\n\t\t\t\tchkmin(f[i][k], a * (g[a] + t[k]) / i + f[b][k-1] * b / i);\n\t\t\t}\n\t\t\tchkmin(g[i], f[i][k]);\n\t\t}\n\t}\n\tprintf(\"%.10lf\\n\", (double)g[n]);\n\treturn 0;\n}","accuracy":0.15384615384615385,"time_ms":140,"memory_kb":3720,"score_of_the_acc":-0.1341,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_2788_10853223\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <ext/pb_ds/assoc_container.hpp>\\n//#include <ext/pb_ds/tree_policy.hpp>\\nusing namespace std;\\n//using namespace __gnu_pbds; //new version c++\\n//using namespace pb_ds;\\n\\n#define PB push_back\\n#define MP make_pair\\n#define SZ size()\\n#define REP(i, n) for(int i = 0; i < (n); i++)\\n#define ITR(i, j, n) for(int i = (j); i < (n); i++)\\n#define mem(array, val) memset(array, val, sizeof(array))\\n#define READ(filename) freopen(filename, \\\"r\\\", stdin)\\n#define WRITE(filename) freopen(filename, \\\"w\\\", stdout)\\n#define Fr first\\n#define Sc second\\n#define si(a) scanf(\\\"%d\\\", &a)\\n#define sl(a) scanf(\\\"%lld\\\", &a)\\n#define sd(a) scanf(\\\"%lf\\\", &a)\\n#define ss(a) scanf(\\\"%s\\\", a)\\n#define sii(a, b) scanf(\\\"%d%d\\\", &a, &b)\\n#define sll(a, b) scanf(\\\"%lld%lld\\\", &a, &b)\\n#define sdd(a, b) scanf(\\\"%lf%lf\\\", &a, &b)\\n#define debug(x) cout << #x << \\\": \\\" << x << endl\\n#define Fast_IO ios_base::sync_with_stdio(0);cin.tie(0)\\n\\ntypedef long long Long;\\ntypedef pair <int, int> Pii;\\n///<-------------------------------------------------END OF TEMPLATE-------------------------------------------------->\\n\\n#define MAX 1005\\n#define MAXG 35\\nint K, T[MAXG];\\ndouble dp[MAX][MAXG];\\n\\nint main() {\\n int rp, rc, N;\\n sii(rp, rc); si(K);\\n REP(i, K+1) si(T[i]);\\n\\n N = rc - rp;\\n dp[1][1] = T[0];\\n ITR(n, 2, N+1) {\\n dp[n][1] = 1e12;\\n\\n ITR(k, 2, K+2) {\\n if(k > n) break;\\n dp[n][k] = 1e12;\\n ITR(sz, 1, n) {\\n if(n-sz < k-1) break;\\n dp[n][k] = min(dp[n][k], (double(sz) / double(n)) * (dp[sz][1] - T[0] + T[k-1]) + (double(n - sz) / double(n)) * dp[n-sz][k-1]);\\n }\\n dp[n][1] = min(dp[n][1], dp[n][k]);\\n }\\n dp[n][1] += T[0];\\n //printf(\\\"DP[%d]: %.8lf\\\\n\\\", n, DP[n]);\\n }\\n\\n printf(\\\"%.8lf\\\\n\\\", dp[N][1] - T[0]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.0972,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2788_9669629\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\\n#define RREP(i,n) RFOR(i,0,n)\\n#define sz(A) ((ll)A.size())\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\nstruct segtree{\\n vi tree;\\n int n;\\n ll op(ll a,ll b){return max(a,b);}\\n ll e(){return -1e18;}\\n segtree(int _N){\\n n=1;\\n while(n<_N)n<<=1;\\n tree.assign(2*n,e());\\n }\\n void set(int i,ll x){\\n i+=n;\\n tree[i]=x;\\n while(i>1){\\n i>>=1;\\n tree[i]=op(tree[2*i],tree[2*i+1]);\\n }\\n }\\n ll prod(int l,int r){\\n l+=n;r+=n;\\n ll L=e(),R=e();\\n while(l<r){\\n if(l%2)L=op(L,tree[l++]);\\n if(r%2)R=op(tree[--r],R);\\n l>>=1;r>>=1;\\n }\\n return op(L,R);\\n }\\n};\\nint main(){\\n ll a,b,K;cin>>a>>b>>K;\\n vi T(K+1);\\n REP(i,K+1)cin>>T[i];\\n vector<vector<ld>>DP(1000,vector<ld>(K+2,1e18));\\n REP(i,K+2)DP[0][i]=0;\\n DP[1][K+1]=0;\\n FOR(D,1,1000){\\n RREP(_D,D)RREP(j,K+1){\\n DP[D][j+1]=min(DP[D][j+1],DP[_D][j]+T[K-j]*(D-_D)+DP[D-_D][K+1]);\\n }\\n }\\n //FOR(i,1,10){\\n //for(auto j:DP[i])cout<<j<<\\\" \\\";cout<<endl;\\n //}\\n printf(\\\"%.20Lf\\\\n\\\",DP[b-a][K+1]/(b-a));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4028,\n \"score_of_the_acc\": -0.1557,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2788_8428091\",\n \"code_snippet\": \"#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nint ri() {\\n\\tint n;\\n\\tscanf(\\\"%d\\\", &n);\\n\\treturn n;\\n}\\n\\ntypedef double D;\\n\\nint main() {\\n\\tint pass = ri();\\n\\tint rc = ri();\\n\\t\\n\\tint n = rc - pass;\\n\\tint k = ri();\\n\\tstd::vector<int> t(k + 1);\\n\\tfor (auto &i : t) i = ri();\\n\\t\\n\\tstd::vector<D> res(n + 1, 1e18);\\n\\tstd::vector<std::vector<D> > dp(k + 2, std::vector<D>(n + 1, 1e18));\\n\\t\\n\\tres[0] = res[1] = 0;\\n\\tdp[1][1] = t[0];\\n\\tfor (int i = 2; i <= n; i++) {\\n\\t\\tfor (int j = 1; j <= k + 1; j++) {\\n\\t\\t\\tfor (int l = 1; l < i; l++) {\\n\\t\\t\\t\\tdp[j][i] = std::min(dp[j][i], dp[j - 1][l] + (i - l) * (res[i - l] + t[j - 1]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tdouble tmp = 1e18;\\n\\t\\tfor (int j = 1; j <= k + 1; j++) tmp = std::min(tmp, dp[j][i]);\\n\\t\\tres[i] = tmp / i;\\n\\t\\t\\n\\t\\tdp[1][i] = std::min(dp[1][i], tmp + (double) t[0] * i);\\n\\t}\\n\\tprintf(\\\"%.11f\\\\n\\\", res[n]);\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.0697,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2788_7182094\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\nusing ll = long long;\\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;}\\nconst int INF = (1<<30)-1;\\n#define all(p) p.begin(),p.end()\\nconst int mod=998244353;\\n\\nint main(){\\n\\tint A,B,K;\\n\\tcin>>A>>B>>K;\\n\\tvector<double> T(K+1);\\n\\trep(i,0,K+1) cin>>T[i];\\n\\tint N=B-A;\\n\\tvector<vector<double>> dp(N+1,vector<double>(K+2,INF));\\n\\trep(i,0,K+2) dp[0][i]=0;\\n\\tdp[1][0]=0;\\n\\trep(i,1,N+1){\\n\\t\\trep(j,0,N-i+1) rep(k,1,K+2){\\n\\t\\t\\t//if(i==1) cout<<j<<\\\" \\\"<<k<<\\\" \\\"<<dp[2][0]<<endl;\\n\\t\\t\\tchmin(dp[i+j][k-1],dp[j][k]+dp[i][0]+T[k-1]*i);\\n\\t\\t}\\n\\t\\t//cout<<i<<\\\" : \\\"<<fixed<<setprecision(20)<<dp[i][0]/(double)(i)<<\\\"\\\\n\\\";\\n\\t}\\n\\tcout<<fixed<<setprecision(20)<<dp[N][0]/(double)(N)<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3856,\n \"score_of_the_acc\": -0.0957,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2788_6798456\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n#define X first\\n#define Y second\\n#define SZ(a) ((int)a.size())\\n#define ALL(v) v.begin(), v.end()\\n#define pb push_back\\n\\nconst double INF = 9e18;\\ndouble dp[1005], dp2[55][1005];\\ndouble cst[55];\\n\\nint main() {\\n ios::sync_with_stdio(0), cin.tie(0);\\n int l, r, k;\\n cin >> l >> r >> k;\\n r -= l;\\n for (int i = 0; i <= k; ++i)\\n cin >> cst[i];\\n for (int j = 0; j <= k + 1; ++j)\\n fill(dp2[j] + 1, dp2[j] + r + 1, INF);\\n for (int i = 2; i <= r; ++i) {\\n for (int j = k; j >= 0; --j)\\n for (int p = 1; p <= r; ++p)\\n dp2[j][p] = min(dp2[j][p], dp2[j + 1][p - (i - 1)] + (double)(i - 1) * (dp[i - 1] + cst[j]));\\n dp[i] = INF;\\n dp[i] = min(dp[i], dp2[0][i] / i);\\n }\\n cout << fixed << setprecision(7) << dp[r] << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3560,\n \"score_of_the_acc\": -0.0211,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2788_6702572\",\n \"code_snippet\": \"/**\\n * author: otera\\n**/\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing int128_t = __int128_t;\\n#define repa(i, n) for(int i = 0; i < n; ++ i)\\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define overload3(a, b, c, d, ...) d\\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\\ntypedef pair<int, int> P;\\ntypedef pair<ll, ll> LP;\\n#define pb push_back\\n#define pf push_front\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define rall(c) c.rbegin(), c.rend()\\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)))\\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 si(c) (int)(c).size()\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\n#define kth_bit(x, k) ((x>>k)&1)\\n#define unless(A) if(!(A))\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\\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 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 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> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T, class U> using umap = unordered_map<T, U>;\\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 << ' '; }\\ntemplate<class T> void print(const T& a){ cout << a; }\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\\nint out(){ cout << '\\\\n'; return 0; }\\ntemplate<class T> int out(const T& t){ print(t); cout << '\\\\n'; return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\\n#define CHOOSE(a) CHOOSE2 a\\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\\n#define debug_1(x1) cout<<#x1<<\\\": \\\"<<x1<<endl\\n#define debug_2(x1,x2) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<endl\\n#define debug_3(x1,x2,x3) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<endl\\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<endl\\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<\\\", \\\"#x5<<\\\": \\\"<<x5<<endl\\n#ifdef DEBUG\\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\\n#define dump(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...)\\n#define dump(...)\\n#endif\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(precision);\\n }\\n} io_setup_ {};\\n\\nconst int inf = 1e9 + 7;\\n\\nvoid solve() {\\n INT(r_pass, r_rc, k);\\n VEC(int, t, k + 1);\\n int n = r_rc - r_pass;\\n if(n == 1) {\\n out(0.0);\\n return;\\n }\\n vvc<ld> dp(n + 1, vc<ld>(k + 1, inf));\\n vc<ld> sum(n + 1, inf);\\n for(int j = 1; j <= k; ++ j) {\\n dp[1][j] = 0.0;\\n }\\n sum[0] = 0.0; sum[1] = 0.0;\\n for(int i = 2; i <= n; ++ i) {\\n for(int j = 1; j <= k; ++ j) {\\n for(int p = 1; p <= i - j; ++ p) {\\n ld res = 0.0;\\n if(j != 1) res = (ld)(i - p) * (dp[i - p][j - 1]) / (ld)i + (ld)p * ((ld)t[j] + sum[p]) / (ld)i;\\n else res = (ld)(i - p) * ((ld)t[0] + sum[i - p]) / (ld)i + (ld)p * ((ld)t[j] + sum[p]) / (ld)i;\\n debug(i, j, p, res);\\n chmin(dp[i][j], res);\\n }\\n debug(i, j, dp[i][j]);\\n // sum[i] += dp[i][j];\\n chmin(sum[i], dp[i][j]);\\n }\\n }\\n ld ans = inf;\\n for(int j = 1; j <= k; ++ j) {\\n chmin(ans, dp[n][j]);\\n }\\n out(ans);\\n}\\n\\nsigned main() {\\n int testcase = 1;\\n // in(testcase);\\n while(testcase--) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3820,\n \"score_of_the_acc\": -0.109,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2788_6702564\",\n \"code_snippet\": \"/**\\n * author: otera\\n**/\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing int128_t = __int128_t;\\n#define repa(i, n) for(int i = 0; i < n; ++ i)\\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define overload3(a, b, c, d, ...) d\\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\\ntypedef pair<int, int> P;\\ntypedef pair<ll, ll> LP;\\n#define pb push_back\\n#define pf push_front\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define rall(c) c.rbegin(), c.rend()\\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)))\\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 si(c) (int)(c).size()\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\n#define kth_bit(x, k) ((x>>k)&1)\\n#define unless(A) if(!(A))\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\\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 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 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> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T, class U> using umap = unordered_map<T, U>;\\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 << ' '; }\\ntemplate<class T> void print(const T& a){ cout << a; }\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\\nint out(){ cout << '\\\\n'; return 0; }\\ntemplate<class T> int out(const T& t){ print(t); cout << '\\\\n'; return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\\n#define CHOOSE(a) CHOOSE2 a\\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\\n#define debug_1(x1) cout<<#x1<<\\\": \\\"<<x1<<endl\\n#define debug_2(x1,x2) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<endl\\n#define debug_3(x1,x2,x3) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<endl\\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<endl\\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<\\\", \\\"#x5<<\\\": \\\"<<x5<<endl\\n#ifdef DEBUG\\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\\n#define dump(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...)\\n#define dump(...)\\n#endif\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(precision);\\n }\\n} io_setup_ {};\\n\\nconst int inf = 1e9 + 7;\\n\\nvoid solve() {\\n INT(r_pass, r_rc, k);\\n VEC(int, t, k + 1);\\n int n = r_rc - r_pass;\\n if(n == 1) {\\n out(0.0);\\n return;\\n }\\n vvc<ld> dp(n + 1, vc<ld>(k + 1, inf));\\n vc<ld> sum(n + 1, inf);\\n for(int j = 1; j <= k; ++ j) {\\n dp[1][j] = 0.0;\\n }\\n sum[0] = 0.0; sum[1] = 0.0;\\n for(int i = 2; i <= n; ++ i) {\\n for(int j = 1; j <= k; ++ j) {\\n for(int p = 1; p <= i - 1; ++ p) {\\n ld res = 0.0;\\n if(j != 1) res = (ld)(i - p) / (ld)i * (dp[i - p][j - 1]) + (ld)p / (ld)i * (t[j] + sum[p]);\\n else res = (ld)(i - p) / (ld)i * (t[0] + sum[i - p]) + (ld)p / (ld)i * (t[j] + sum[p]);\\n debug(i, j, p, res);\\n chmin(dp[i][j], res);\\n }\\n debug(i, j, dp[i][j]);\\n // sum[i] += dp[i][j];\\n chmin(sum[i], dp[i][j]);\\n }\\n }\\n ld ans = inf;\\n for(int j = 1; j <= k; ++ j) {\\n chmin(ans, dp[n][j]);\\n }\\n out(ans);\\n}\\n\\nsigned main() {\\n int testcase = 1;\\n // in(testcase);\\n while(testcase--) solve();\\n return 0;\\n}\",\n \"accuracy\": 0.15384615384615385,\n \"time_ms\": 40,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.0429,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2788_6702561\",\n \"code_snippet\": \"/**\\n * author: otera\\n**/\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing int128_t = __int128_t;\\n#define repa(i, n) for(int i = 0; i < n; ++ i)\\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define overload3(a, b, c, d, ...) d\\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\\ntypedef pair<int, int> P;\\ntypedef pair<ll, ll> LP;\\n#define pb push_back\\n#define pf push_front\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define rall(c) c.rbegin(), c.rend()\\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)))\\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 si(c) (int)(c).size()\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\n#define kth_bit(x, k) ((x>>k)&1)\\n#define unless(A) if(!(A))\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\\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 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 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> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T, class U> using umap = unordered_map<T, U>;\\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 << ' '; }\\ntemplate<class T> void print(const T& a){ cout << a; }\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\\nint out(){ cout << '\\\\n'; return 0; }\\ntemplate<class T> int out(const T& t){ print(t); cout << '\\\\n'; return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\\n#define CHOOSE(a) CHOOSE2 a\\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\\n#define debug_1(x1) cout<<#x1<<\\\": \\\"<<x1<<endl\\n#define debug_2(x1,x2) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<endl\\n#define debug_3(x1,x2,x3) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<endl\\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<endl\\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<\\\", \\\"#x5<<\\\": \\\"<<x5<<endl\\n#ifdef DEBUG\\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\\n#define dump(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...)\\n#define dump(...)\\n#endif\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(precision);\\n }\\n} io_setup_ {};\\n\\nconst int inf = 1e9 + 7;\\n\\nvoid solve() {\\n INT(r_pass, r_rc, k);\\n VEC(int, t, k + 1);\\n int n = r_rc - r_pass;\\n vvc<ld> dp(n + 1, vc<ld>(k + 1, inf));\\n vc<ld> sum(n + 1, inf);\\n for(int j = 1; j <= k; ++ j) {\\n dp[1][j] = 0.0;\\n }\\n sum[0] = 0.0; sum[1] = 0.0;\\n for(int i = 2; i <= n; ++ i) {\\n for(int j = 1; j <= k; ++ j) {\\n for(int p = 1; p <= i - 1; ++ p) {\\n ld res = 0.0;\\n if(j != 1) res = (ld)(i - p) / (ld)i * (dp[i - p][j - 1]) + (ld)p / (ld)i * (t[j] + sum[p]);\\n else res = (ld)(i - p) / (ld)i * (t[0] + sum[i - p]) + (ld)p / (ld)i * (t[j] + sum[p]);\\n debug(i, j, p, res);\\n chmin(dp[i][j], res);\\n }\\n debug(i, j, dp[i][j]);\\n // sum[i] += dp[i][j];\\n chmin(sum[i], dp[i][j]);\\n }\\n }\\n ld ans = inf;\\n for(int j = 1; j <= k; ++ j) {\\n chmin(ans, dp[n][j]);\\n }\\n out(ans);\\n}\\n\\nsigned main() {\\n int testcase = 1;\\n // in(testcase);\\n while(testcase--) solve();\\n return 0;\\n}\",\n \"accuracy\": 0.15384615384615385,\n \"time_ms\": 40,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.0399,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2788_6648013\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace suisen {\\n// ! utility\\ntemplate <typename ...Types>\\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\\ntemplate <bool cond_v, typename Then, typename OrElse>\\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\\n if constexpr (cond_v) {\\n return std::forward<Then>(then);\\n } else {\\n return std::forward<OrElse>(or_else);\\n }\\n}\\n\\n// ! function\\ntemplate <typename ReturnType, typename Callable, typename ...Args>\\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\\ntemplate <typename F, typename T>\\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\\ntemplate <typename F, typename T>\\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\\n\\ntemplate <typename Comparator, typename T>\\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\\n\\n// ! integral\\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\\ntemplate <typename T, unsigned int n>\\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\\ntemplate <typename T, unsigned int n>\\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\\n\\n// ?\\ntemplate <typename T>\\nstruct safely_multipliable {};\\ntemplate <>\\nstruct safely_multipliable<int> { using type = long long; };\\ntemplate <>\\nstruct safely_multipliable<long long> { using type = __int128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<float> { using type = float; };\\ntemplate <>\\nstruct safely_multipliable<double> { using type = double; };\\ntemplate <>\\nstruct safely_multipliable<long double> { using type = long double; };\\ntemplate <typename T>\\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\\n\\n} // namespace suisen\\n\\n// ! type aliases\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\n\\ntemplate <typename T>\\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <typename T, typename U>\\nusing umap = std::unordered_map<T, U>;\\n\\n// ! macros (capital: internal macro)\\n#define OVERLOAD2(_1,_2,name,...) name\\n#define OVERLOAD3(_1,_2,_3,name,...) name\\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\\n\\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\\n#define REP3(i,l,r) REP4(i,l,r,1)\\n#define REP2(i,n) REP3(i,0,n)\\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\\n#define REPINF2(i,l) REPINF3(i,l,1)\\n#define REPINF1(i) REPINF2(i,0)\\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\\n#define RREP3(i,l,r) RREP4(i,l,r,1)\\n#define RREP2(i,n) RREP3(i,0,n)\\n\\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\\n\\n#define CAT_I(a, b) a##b\\n#define CAT(a, b) CAT_I(a, b)\\n#define UNIQVAR(tag) CAT(tag, __LINE__)\\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\\n\\n#define all(iterable) std::begin(iterable), std::end(iterable)\\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\\n\\n#ifdef LOCAL\\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\\n\\ntemplate <class T, class... Args>\\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\\n constexpr const char* prefix = \\\"[\\\\033[32mDEBUG\\\\033[m] \\\";\\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\"(\\\";\\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\")\\\";\\n std::cerr << prefix << open_brakets << s << close_brakets << \\\": \\\" << open_brakets << std::forward<T>(first);\\n ((std::cerr << \\\", \\\" << std::forward<Args>(args)), ...);\\n std::cerr << close_brakets << \\\"\\\\n\\\";\\n}\\n\\n#else\\n# define debug(...) void(0)\\n#endif\\n\\n// ! I/O utilities\\n\\n// pair\\ntemplate <typename T, typename U>\\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U> &a) {\\n return out << a.first << ' ' << a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...> &a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return out;\\n } else {\\n out << std::get<N>(a);\\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\\n out << ' ';\\n }\\n return operator<<<N + 1>(out, a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& out, const std::vector<T> &a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N> &a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <typename Head, typename... Tail>\\ninline void print(const Head &head, const Tail &...tails) {\\n std::cout << head;\\n if (sizeof...(tails)) std::cout << ' ';\\n print(tails...);\\n}\\ntemplate <typename Iterable>\\nauto print_all(const Iterable& v, std::string sep = \\\" \\\", std::string end = \\\"\\\\n\\\") -> decltype(std::cout << *v.begin(), void()) {\\n for (auto it = v.begin(); it != v.end();) {\\n std::cout << *it;\\n if (++it != v.end()) std::cout << sep;\\n }\\n std::cout << end;\\n}\\n\\n// pair\\ntemplate <typename T, typename U>\\nstd::istream& operator>>(std::istream& in, std::pair<T, U> &a) {\\n return in >> a.first >> a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::istream& operator>>(std::istream& in, std::tuple<Args...> &a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return in;\\n } else {\\n return operator>><N + 1>(in >> std::get<N>(a), a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::istream& operator>>(std::istream& in, std::vector<T> &a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::istream& operator>>(std::istream& in, std::array<T, N> &a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\ntemplate <typename ...Args>\\nvoid read(Args &...args) {\\n ( std::cin >> ... >> args );\\n}\\n\\n// ! integral utilities\\n\\n// Returns pow(-1, n)\\ntemplate <typename T>\\nconstexpr inline int pow_m1(T n) {\\n return -(n & 1) | 1;\\n}\\n// Returns pow(-1, n)\\ntemplate <>\\nconstexpr inline int pow_m1<bool>(bool n) {\\n return -int(n) | 1;\\n}\\n\\n// Returns floor(x / y)\\ntemplate <typename T>\\nconstexpr inline T fld(const T x, const T y) {\\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\\n}\\ntemplate <typename T>\\nconstexpr inline T cld(const T x, const T y) {\\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\\n}\\n\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int popcount(const T x) { return __builtin_popcount(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int popcount(const T x) { return __builtin_popcount(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int popcount(const T x) { return __builtin_popcountll(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T>\\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> - 1 - count_lz(x); }\\ntemplate <typename T>\\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\\ntemplate <typename T>\\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\\ntemplate <typename T>\\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\\n\\nstruct all_subset {\\n struct all_subset_iter {\\n const int s; int t;\\n constexpr all_subset_iter(int s) : s(s), t(s + 1) {}\\n constexpr auto operator*() const { return t; }\\n constexpr auto operator++() {}\\n constexpr auto operator!=(std::nullptr_t) { return t ? (--t &= s, true) : false; }\\n };\\n int s;\\n constexpr all_subset(int s) : s(s) {}\\n constexpr auto begin() { return all_subset_iter(s); }\\n constexpr auto end() { return nullptr; }\\n};\\n\\n// ! container\\n\\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\\nauto priqueue_comp(const Comparator comparator) {\\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\\n}\\n\\ntemplate <typename Iterable>\\nauto isize(const Iterable &iterable) -> decltype(int(iterable.size())) {\\n return iterable.size();\\n}\\n\\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\\nauto generate_vector(int n, Gen generator) {\\n std::vector<T> v(n);\\n for (int i = 0; i < n; ++i) v[i] = generator(i);\\n return v;\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T l, T r) {\\n return generate_vector(r - l, [l](int i) { return l + i; });\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T n) {\\n return generate_range_vector(0, n);\\n}\\n\\ntemplate <typename T>\\nvoid sort_unique_erase(std::vector<T> &a) {\\n std::sort(a.begin(), a.end());\\n a.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\n\\ntemplate <typename InputIterator, typename BiConsumer>\\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\\n}\\ntemplate <typename Container, typename BiConsumer>\\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()){\\n foreach_adjacent_values(c.begin(), c.end(), f);\\n}\\n\\n// ! other utilities\\n\\n// x <- min(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmin(T &x, const T &y) {\\n if (y >= x) return false;\\n x = y;\\n return true;\\n}\\n// x <- max(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmax(T &x, const T &y) {\\n if (y <= x) return false;\\n x = y;\\n return true;\\n}\\n\\nnamespace suisen {}\\nusing namespace suisen;\\nusing namespace std;\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(precision);\\n }\\n} io_setup_ {};\\n\\n// ! code from here\\n\\nconstexpr long long inf = numeric_limits<long long>::max() / 2;\\n\\nint main() {\\n input(int, l, r, k);\\n const int n = r - l;\\n\\n vector<long long> t(k + 1);\\n read(t);\\n\\n vector<vector<long long>> dp(n + 1, vector<long long>(k + 1, inf));\\n vector<long long> dp_min(n + 1, inf);\\n dp[1][0] = dp_min[1] = 0;\\n\\n rep(i, 2, n + 1) {\\n rep(x0, 1, i) {\\n int x1 = i - x0;\\n chmin(dp[i][1], x0 * t[1] + dp_min[x0] + x1 * t[0] + dp_min[x1]);\\n chmin(dp_min[i], dp[i][1]);\\n }\\n rep(j, 2, k + 1) {\\n rep(x, 1, i) {\\n chmin(dp[i][j], dp[i - x][j - 1] + x * t[j] + dp_min[x]);\\n }\\n chmin(dp_min[i], dp[i][j]);\\n }\\n \\n }\\n\\n print((double) dp_min[n] / n);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.0614,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2788_6044487\",\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=1000000007,MAX=1005;\\nconst ll INF=1LL<<60;\\ndouble dp[MAX];\\ndouble cost[MAX][33];\\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 A,B,K;cin>>A>>B>>K;\\n int N=B-A;\\n vector<double> C(K+1);\\n for(int i=0;i<=K;i++) cin>>C[i];\\n \\n for(int t=2;t<=N;t++){\\n for(int i=0;i<MAX;i++) for(int j=0;j<33;j++) cost[i][j]=INF;\\n cost[t][0]=0;\\n for(int i=t;i>=1;i--){\\n for(int j=0;j<=K;j++){\\n if(cost[i][j]==INF) continue;\\n int need=(i+K-j)/(K+1-j);\\n for(int k=need;k<=i;k++){\\n int to=i-k;\\n if(i==t&&to==0) continue;\\n if(to<0) continue;\\n chmin(cost[to][j+1],cost[i][j]+(double)(i-to)/t*(C[j]+dp[i-to]));\\n }\\n }\\n }\\n dp[t]=INF;\\n for(int j=1;j<=K+1;j++) chmin(dp[t],cost[0][j]);\\n }\\n \\n cout<<fixed<<setprecision(25)<<dp[N]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1800,\n \"memory_kb\": 3900,\n \"score_of_the_acc\": -1.1067,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2788_6012567\",\n \"code_snippet\": \"//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n#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<unordered_set>\\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\\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 = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)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}\\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)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 2;\\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}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nld dp[1005][35];\\nld ans[1005];\\nvoid solve() {\\n\\tint a, b, m; cin >> a >> b >> m;\\n\\tint n = b - a;\\n\\tvector<int> cost(m + 1);\\n\\trep(i, m + 1)cin >> cost[i];\\n\\trep(i, n + 1)rep(j, m+2)dp[i][j] = INF;\\n\\trep(i, n + 1)ans[i] = INF;\\n\\tans[0] = 0;\\n\\tans[1] = 0;\\n\\tdp[0][0] = 0;\\n\\tfor (int len = 1; len <= n; len++) {\\n\\t\\trep(c, m+1) {\\n\\t\\t\\tfor (int ad = 1; ad < len; ad++) {\\n\\t\\t\\t\\tld val = dp[len - ad][c] + ad * cost[c] + ad*ans[ad];\\n\\t\\t\\t\\tdp[len][c + 1] = min(dp[len][c + 1], val);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(c, m + 2)ans[len] = min(ans[len], dp[len][c]/len);\\n\\t\\trep(c, m + 1) {\\n\\t\\t\\tfor (int ad = len; ad <= len; ad++) {\\n\\t\\t\\t\\tld val = dp[len - ad][c] + ad * cost[c] + ad * ans[ad];\\n\\t\\t\\t\\tdp[len][c + 1] = min(dp[len][c + 1], val);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cout << dp[3][1] << \\\"\\\\n\\\";\\n\\t//cout << ans[1] << \\\"\\\\n\\\";\\n\\tcout << ans[n] << \\\"\\\\n\\\";\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(8);\\n\\t//init_f();\\n\\t//init();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4072,\n \"score_of_the_acc\": -0.1724,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2788_5183868\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define maxn 100086\\n\\nusing namespace std;\\n\\nint l, r, n, m;\\nint t[maxn];\\ndouble f[maxn][40], g[maxn];\\n\\nint main(){\\n\\tscanf(\\\"%d%d%d\\\", &l, &r, &m);\\n\\tfor(int i = 0;i <= m;i++) scanf(\\\"%d\\\", &t[i]);\\n\\tn = r - l;\\n\\tf[1][0] = t[0], g[1] = 0;\\n\\tfor(int i = 1;i <= m;i++) f[1][i] = 1e18;\\n\\tfor(int i = 2;i <= n;i++){\\n\\t\\tg[i] = 1e18;\\n\\t\\tfor(int j = 1;j <= m;j++){\\n\\t\\t\\tf[i][j] = 1e18;\\n\\t\\t\\tfor(int k = 1;k < i;k++){\\n\\t\\t\\t\\tf[i][j] = min(f[i][j], f[i - k][j - 1] + k * (g[k] + t[j])); \\t\\n\\t\\t\\t}\\n\\t\\t\\tg[i] = min(g[i], f[i][j] / i);\\n\\t\\t}\\n\\t\\tf[i][0] = i * (g[i] + t[0]);\\n\\t}\\n\\tprintf(\\\"%.10f\\\", g[n]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.0197,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2788_5179071\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint r_pass,r_rc,k;\\nint n;\\nint a[55];\\ndouble dp[1005][35];\\n\\nint main()\\n{\\n cin>>r_pass>>r_rc>>k;\\n n=r_rc-r_pass;\\n for (int i=0;i<=k;i++)\\n {\\n cin>>a[i];\\n }\\n for (int i=2;i<=1000;i++)\\n {\\n for (int j=0;j<=k;j++)\\n {\\n dp[i][j]=1e10;\\n }\\n }\\n for (int i=2;i<=n;i++)\\n {\\n for (int j=1;j<=k;j++)\\n {\\n for (int u=1;u<i;u++)\\n {\\n dp[i][j]=min(dp[i][j],1.0*u/i*(dp[u][j-1]+(j==1)*a[0])+1.0*(i-u)/i*(dp[i-u][0]+a[j]));\\n }\\n }\\n for (int j=1;j<k;j++)\\n {\\n dp[i][j+1]=min(dp[i][j+1],dp[i][j]);\\n }\\n dp[i][0]=dp[i][k];\\n }\\n printf(\\\"%.6f\\\\n\\\",dp[n][k]);\\n return 0;\\n}\",\n \"accuracy\": 0.15384615384615385,\n \"time_ms\": 100,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.0503,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2788_5178003\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cassert>\\n#include <cstring>\\n#include <cmath>\\n#include <functional>\\n#include <algorithm>\\n#include <utility>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#ifdef XLor\\n #define dbg(args...) cout << \\\"\\\" << #args << \\\" -> \\\", err(args)\\n void err() { std::cout << \\\"\\\" << std::endl; }\\n template<typename T, typename...Args>\\n void err(T a, Args...args) { std::cout << a << ' '; err(args...); }\\n#else\\n #define dbg(...)\\n#endif\\n#define ms(a,b) memset(a,b,sizeof(a))\\nusing namespace std;\\nusing ll = long long;\\nusing PII = pair<int,int>;\\nconst int mod = 998244353;\\nconst int inf = 1 << 30;\\nconst int maxn = 2000 + 5;\\n\\nint n, k, a[maxn];\\ndouble f[maxn][maxn], g[maxn];\\n\\nint main() {\\n int rp, rc;\\n scanf(\\\"%d%d%d\\\", &rp, &rc, &k);\\n n = rc - rp;\\n for (int i = 0; i <= k; i++) {\\n scanf(\\\"%d\\\", a + i);\\n }\\n for (int i = 0; i <= n; i++) {\\n for (int j = 0; j <= k; j++) {\\n f[i][j] = 1e18;\\n }\\n }\\n f[1][0] = g[1] = 0.0;\\n f[1][1] = a[1];\\n for (int i = 2; i <= n; i++) {\\n for (int k = 1; k < i; k++) {\\n double cur = 1.0 * (i - k) / i * (g[i - k] + a[0]) + 1.0 * k / i * (g[k] + a[1]);\\n f[i][1] = min(f[i][1], cur);\\n }\\n g[i] = f[i][1];\\n for (int j = 2; j <= k; j++) {\\n for (int k = 1; k < i; k++) {\\n double cur = 1.0 * (i - k) / i * f[i - k][j - 1];\\n cur += 1.0 * k / i * (a[j] + g[k]);\\n f[i][j] = min(f[i][j], cur);\\n }\\n // dbg(i, j, f[i][j]);\\n g[i] = min(g[i], f[i][j]);\\n }\\n // dbg(i, g[i]);\\n }\\n printf(\\\"%.8lf\\\\n\\\", g[n]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 7448,\n \"score_of_the_acc\": -1.0503,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2788_3155523\",\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(int i=(int)(a);i<(int)(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 1e16\\n#define mod 1000000007\\n\\nint N,K;\\ndouble T[33];\\ndouble dp[1011][33];\\ndouble minc[1011];\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n {\\n int r1,r2;\\n cin>>r1>>r2;\\n N=r2-r1;\\n }\\n cin>>K;\\n rep(i,K+1)cin>>T[i];\\n\\n rep(i,N+1)repl(j,1,K+1)dp[i][j]=INF;\\n rep(i,N+1)minc[i]=INF;\\n minc[0]=0; minc[1]=0;\\n repl(i,2,N+1){\\n repl(j,1,K+1){\\n repl(k,1,i){\\n int l=i-k;\\n double p1=(double)l/(double)i;\\n double p2=(double)(i-l)/(double)i;\\n if(j>1){\\n minch(dp[i][j],p2*dp[k][j-1]+p1*(T[j]+minc[l]));\\n }else{\\n minch(dp[i][j],p2*(minc[i-l]+T[0])+p1*(T[j]+minc[l]));\\n }\\n }\\n minch(minc[i],dp[i][j]);\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", minc[N]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -0.0634,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2788_3154618\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define MOD 1000000007LL\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\n\\ndouble dp[1001];\\nint a,b,k;\\nint t[35];\\nint sum[35];\\ndouble ct[35];\\ndouble dp2[1001][35];\\n\\ndouble solve(int sz);\\ndouble solve2(int sz,int i);\\n\\ndouble solve2(int sz,int i){\\n\\tif(dp2[sz][i]>=0.0)return dp2[sz][i];\\n\\tif(sz<=0){\\n\\t\\treturn 1e18;\\n\\t}\\n\\tif(i==0)return t[0]*sz+solve(sz)*sz;\\n\\tdouble ans=1e18;\\n\\tfor(int j=1;j<=sz-1;j++){\\n\\t\\tdouble val=solve(j)*j;\\n\\t\\tval+=t[i]*j;\\n\\t\\tval+=solve2(sz-j,i-1);\\n\\t\\tans=min(ans,val);\\n\\t}\\n\\treturn dp2[sz][i]=ans;\\n}\\n\\ndouble solve(int sz){\\n\\tif(dp[sz]>=0.0)return dp[sz];\\n\\tif(sz<=1)return 0;\\n\\tdouble ans=1e18;\\n\\tfor(int i=1;i<=min(k,sz-1);i++){\\n\\t\\tans=min((double)solve2(sz,i)/sz,ans);\\n\\t}\\n\\treturn (dp[sz]=ans);\\n}\\n\\nint main(void){\\n\\tscanf(\\\"%d%d%d\\\",&a,&b,&k);\\n\\tint n=b-a;\\n\\tfor(int i=0;i<=k;i++){\\n\\t\\tscanf(\\\"%d\\\",&t[i]);\\n\\t}\\n\\tfor(int i=0;i<=k;i++){\\n\\t\\tsum[i+1]+=sum[i];\\n\\t\\tsum[i+1]+=t[i];\\n\\t\\tct[i+1]=(double)sum[i+1]/(i+1);\\n\\t}\\n\\tfor(int i=0;i<=n+1;i++){\\n\\t\\tdp[i]=-1.0;\\n\\t\\tfor(int j=0;j<=k+1;j++){\\n\\t\\t\\tdp2[i][j]=-1;\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%.10f\\\\n\\\",solve(n));\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3700,\n \"score_of_the_acc\": -0.0787,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2788_3154614\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define MOD 1000000007LL\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\n\\ndouble dp[1001];\\nint a,b,k;\\nint t[35];\\nint sum[35];\\ndouble ct[35];\\ndouble dp2[1001][35];\\n\\ndouble solve(int sz);\\ndouble solve2(int sz,int i);\\n\\ndouble solve2(int sz,int i){\\n\\tif(dp2[sz][i]>=0.0)return dp2[sz][i];\\n\\tif(sz<=0){\\n\\t\\treturn 1e18;\\n\\t}\\n\\tif(i==0)return t[0]*sz+solve(sz)*sz;\\n\\tdouble ans=1e18;\\n\\tfor(int j=1;j<=sz-1;j++){\\n\\t\\tdouble val=solve(j)*j;\\n\\t\\tval+=t[i]*j;\\n\\t\\tval+=solve2(sz-j,i-1);\\n\\t\\tans=min(ans,val);\\n\\t}\\n\\t//printf(\\\"solve2 %d %d %f\\\\n\\\",sz,i,ans);\\n\\treturn dp2[sz][i]=ans;\\n}\\n\\ndouble solve(int sz){\\n\\tif(dp[sz]>=0.0)return dp[sz];\\n\\tif(sz<=1)return 0;\\n\\t//printf(\\\"%d\\\\n\\\",sz);\\n\\tdouble ans=1e18;\\n\\tfor(int i=1;i<=min(k,sz-1);i++){\\n\\t\\t/*\\n\\t\\tdouble val=0;\\n\\t\\tint v1=sz%(i+1);\\n\\t\\tint v2=i+1-v1;\\n\\t\\tint len=sz/(i+1);\\n\\t\\tprintf(\\\"%d %d %d\\\\n\\\",v1,v2,len);\\n\\t\\tfor(int j=0;j<v2;j++){\\n\\t\\t\\tval+=(double)t[j]*len/(sz);\\n\\t\\t}\\n\\t\\tfor(int j=v2;j<=i;j++){\\n\\t\\t\\tval+=(double)t[j]*(len+1)/(sz);\\n\\t\\t}\\n\\t\\tval+=(double)solve(len)*(v2*len)/(sz);\\n\\t\\tif(v1>0)val+=(double)solve(len+1)*(sz-v2*len)/(sz);\\n\\t\\t*/\\n\\t\\tans=min((double)solve2(sz,i)/sz,ans);\\n\\t}\\n\\t//printf(\\\"%d %.2f\\\\n\\\",sz,ans);\\n\\treturn (dp[sz]=ans);\\n}\\n\\nint main(void){\\n\\tscanf(\\\"%d%d%d\\\",&a,&b,&k);\\n\\tint n=b-a;\\n\\tfor(int i=0;i<=k;i++){\\n\\t\\tscanf(\\\"%d\\\",&t[i]);\\n\\t}\\n\\tfor(int i=0;i<=k;i++){\\n\\t\\tsum[i+1]+=sum[i];\\n\\t\\tsum[i+1]+=t[i];\\n\\t\\tct[i+1]=(double)sum[i+1]/(i+1);\\n\\t\\t//printf(\\\"%.5f\\\\n\\\",ct[i+1]);\\n\\t}\\n\\tfor(int i=0;i<=n+1;i++){\\n\\t\\tdp[i]=-1.0;\\n\\t\\tfor(int j=0;j<=k+1;j++){\\n\\t\\t\\tdp2[i][j]=-1;\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%.10f\\\\n\\\",solve(n));\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.0838,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2788_3112386\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 1005\\n#define SIZE 31\\n\\nint R_OK,R_FALSE,K;\\ndouble cost[SIZE];\\ndouble dp[SIZE][NUM];\\ndouble memo[NUM];\\n\\n\\ndouble recursive(int length){\\n\\n\\tif(memo[length] != DBL_MAX){\\n\\t\\treturn memo[length];\\n\\t}\\n\\n\\tfor(int x = 1; x <= min(K,length); x++){\\n\\n\\t\\tif(x == 1){\\n\\n\\t\\t\\tfor(int start = 1; start <= length-1; start++){\\n\\n\\t\\t\\t\\tdp[x][length] = min(dp[x][length],(double)start/(double)length*(recursive(start)+cost[1])+\\n\\t\\t\\t\\t\\t\\t(double)(length-start)/(double)length*(recursive(length-start)+cost[0]));\\n\\t\\t\\t}\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int start = 1; start <= length-x; start++){\\n\\n\\t\\t\\t\\tdp[x][length] = min(dp[x][length],(double)start/(double)length*(recursive(start)+cost[x])+\\n\\t\\t\\t\\t\\t\\t(double)(length-start)/(double)length*dp[x-1][length-start]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmemo[length] = min(memo[length],dp[x][length]);\\n\\t}\\n\\n\\treturn memo[length];\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d\\\",&R_OK,&R_FALSE,&K);\\n\\n\\tint max_index = R_FALSE-R_OK;\\n\\n\\tfor(int i = 0; i <= K; i++){\\n\\t\\tscanf(\\\"%lf\\\",&cost[i]);\\n\\t}\\n\\n\\tfor(int i = 0; i <= min(K,max_index); i++){\\n\\t\\tfor(int k = 0; k <= max_index; k++){\\n \\t\\t\\tdp[i][k] = DBL_MAX;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= max_index; i++)memo[i] = DBL_MAX;\\n\\n\\tmemo[0] = 0;\\n\\tmemo[1] = 0;\\n\\tmemo[2] = (cost[0]+cost[1])/2.0;\\n\\tdp[1][2] = memo[2];\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",recursive(max_index));\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3556,\n \"score_of_the_acc\": -0.0704,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2788_3006181\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int N = 1e3 + 10;\\nconst int K = 31;\\nconst long double inf = 1e18;\\n\\nlong double f[N][K], g[N], t[K];\\n\\ninline void chkmin(long double &a, long double b) {\\n\\tif (a > b) a = b;\\n}\\n\\nint main() {\\n\\tint a, b;\\tscanf(\\\"%d%d\\\", &a, &b);\\n\\tint K;\\t\\tscanf(\\\"%d\\\", &K);\\n\\tint n = b - a;\\n\\tfor (int i = 0; i <= K; i++) {\\n\\t\\tdouble x; scanf(\\\"%lf\\\", &x);\\n\\t\\tt[i] = x;\\n\\t}\\n\\tfor (int i = 2; i <= n; i++) {\\n\\t\\tf[i][1] = inf;\\n\\t\\tfor (int j = 1; j < i; j++) {\\n\\t\\t\\tint a = j, b = i - j;\\n\\t\\t\\tchkmin(f[i][1], a * (g[a] + t[1]) / i + b * (g[b] + t[0]) / i);\\n\\t\\t}\\n\\t\\tg[i] = f[i][1];\\n\\t\\tfor (int k = 2; k <= K; k++) {\\n\\t\\t\\tf[i][k] = inf;\\n\\t\\t\\tfor (int j = 0; j <= i; j++) if (f[b][k-1] < inf){\\n\\t\\t\\t\\tint a = j;\\n\\t\\t\\t\\tint b = i - j;\\n\\t\\t\\t\\tchkmin(f[i][k], a * (g[a] + t[k]) / i + f[b][k-1] * b / i);\\n\\t\\t\\t}\\n\\t\\t\\tchkmin(g[i], f[i][k]);\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%.10lf\\\\n\\\", (double)g[n]);\\n\\treturn 0;\\n}\\n/*\\n1 100 1\\n100 100\\n*/\",\n \"accuracy\": 0.15384615384615385,\n \"time_ms\": 130,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.1285,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2788_3006157\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int N = 1e3 + 10;\\nconst int K = 31;\\nconst long double inf = 1e18;\\n\\nlong double f[N][K], g[N], t[K];\\n\\ninline void chkmin(long double &a, long double b) {\\n\\tif (a > b) a = b;\\n}\\n\\nint main() {\\n\\tint a, b;\\tscanf(\\\"%d%d\\\", &a, &b);\\n\\tint K;\\t\\tscanf(\\\"%d\\\", &K);\\n\\tint n = b - a;\\n\\tfor (int i = 0; i <= K; i++) {\\n\\t\\tdouble x; scanf(\\\"%lf\\\", &x);\\n\\t\\tt[i] = x;\\n\\t}\\n\\tfor (int i = 2; i <= n; i++) {\\n\\t\\tf[i][1] = inf;\\n\\t\\tfor (int j = 1; j < i; j++) {\\n\\t\\t\\tint a = j, b = i - j;\\n\\t\\t\\tchkmin(f[i][1], a * (g[a] + t[1]) / i + b * (g[b] + t[0]) / i);\\n\\t\\t}\\n\\t\\tg[i] = f[i][1];\\n\\t\\tfor (int k = 2; k <= K; k++) {\\n\\t\\t\\tf[i][k] = inf;\\n\\t\\t\\tfor (int j = 1; j < i; j++) if (f[b][k-1] < inf){\\n\\t\\t\\t\\tint a = j;\\n\\t\\t\\t\\tint b = i - j;\\n\\t\\t\\t\\tchkmin(f[i][k], a * (g[a] + t[k]) / i + f[b][k-1] * b / i);\\n\\t\\t\\t}\\n\\t\\t\\tchkmin(g[i], f[i][k]);\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%.10lf\\\\n\\\", (double)g[n]);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.15384615384615385,\n \"time_ms\": 140,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.1341,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1679,"cells":{"group_id":{"kind":"string","value":"aoj_2797_cpp"},"problem_description":{"kind":"string","value":"G: DAG トリオ / DAG Trio\nこの問題は D: DAG Trio (Easy) と制約のみが異なる同じ設定の問題です。\nプロローグ\n弟は最近「だぐとりお」が欲しいとしきりに呟いています。\n心配になった兄が調べたところ、弟のクラスでは $k$-DAG (有向グラフであって、ある $k$ 個の辺を削除すると、辺の向きを無視したときの連結成分数を $k$ にでき、かつそれら全てが DAG である) が流行っており、\n3-DAG を特に DAG トリオと呼ぶことを突き止めました。\n弟に尊敬されたい兄は、与えられたグラフが DAG トリオかどうかを判別するプログラムを作成することにしました。\n問題文\n$N$ 頂点 $M$ 辺の有向グラフが与えられます。\n各頂点には $1$ から $N$ まで番号が振られています。\n各有向辺には $1$ から $M$ まで番号が振られています。\n有向辺 $i$ は頂点 $a_i$ から $b_i$ に向かいます。\nグラフは連結かつ単純です (辺の向きを無視すると、任意の 2 点間に道があり自己ループと多重辺がありません)。\n与えられたグラフが DAG トリオならば ”YES”、そうでないなら ”NO” を出力してください。\n入力\n$N \\ M$\n$a_1 \\ b_1$\n$a_2 \\ b_2$\n$\\vdots$\n$a_M \\ b_M$\n制約\n$3 \\le N \\le 500$\n$\\max(3, N−1) \\le M \\le 30000$\n$1 \\le a_i, b_i \\le N$\nグラフは辺の向きを無視したときに連結である。\n各 $i$ に対して$a_i \\neq b_i$\n異なる $i, j$ に対して $\\{a_i, b_i\\} \\neq \\{a_j, b_j\\}$\n出力\n”YES” または ”NO” を $1$ 行で出力してください。\nサンプル\nサンプル入力1\n3 3\n1 2\n2 3\n3 1\nサンプル出力1\nYES\nサンプル入力2\n6 7\n1 2\n2 3\n4 3\n4 5\n5 6\n6 4\n3 6\nサンプル出力2\nYES\nサンプル入力3\n7 10\n4 2\n4 7\n4 6\n2 7\n2 5\n2 1\n5 6\n1 3\n6 3\n4 3\nサンプル出力3\nNO\nサンプル入力4\n4 4\n1 2\n3 2\n4 3\n2 4\nサンプル出力4\nYES\nサンプル入力5\n8 9\n5 1\n3 8\n1 2\n4 8\n4 7\n7 5\n6 5\n3 2\n4 2\nサンプル出力5\nYES"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2797_2238723","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 50000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MAX_N];\nedge f_edge[MAX_N];\n\nvector<edge> bridges;\n\n\nvector<edge> edge_;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n f_edge[to]=G[pos][i];\n par[to]=pos;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n edge_.push_back(G[pos][i]);\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n edge_.clear();\n \n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n memset(par,-1,sizeof(par));\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool isDag(int id){\n queue<int> Q; \n vector<int> C(N,0);\n int cc=0;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n C[ b[i] ]++;\n }\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\n\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n return (cc==N);\n}\n\nvoid visit(int v){\n if(visited[v])return;\n visited[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n visit(G[v][i].to);\n }\n}\n\nint calcDec(int id){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n }\n int res=0;\n memset(visited,false,sizeof(visited));\n for(int i=0;i<N;i++){\n if(!visited[i]){\n res++;\n visit(i);\n }\n }\n return res;\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n \n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if( rec(e.to,si) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n loope.clear();\n if( rec(i,i) )break;\n }\n \n for(int i=0;i<(int)loope.size();i++)\n if(check( loope[i].id ))return true;\n\n return false;\n}\n\nbool solve(){\n int B=countB(-1);\n if(B==M)return false;\n \n if( !isDag(-1) )return solve2();\n\n int maxm=0;\n\n \n B=countB(-1);\n for(int i=0;i<(int)edge_.size();i++){\n edge e=edge_[i];\n int a=e.from;\n int cc=0;\n while(1){\n if(a==e.to)break;\n if(cnt[a]==1)cc++;\n a=par[a];\n }\n maxm=max(maxm,cc);\n }\n vector<int> v;\n for(int i=0;i<N;i++)\n if(depth[i]>0)\n v.push_back(f_edge[i].id);\n\n for(int i=0;i<(int)v.size();i++){\n if(check(v[i]))return true;\n }\n \n return (B+maxm>=2);\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":1,"time_ms":1050,"memory_kb":6092,"score_of_the_acc":-1.9331,"final_rank":2},{"submission_id":"aoj_2797_2238714","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 50000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\nbool flg[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MAX_N];\n\n\nvector<edge> bridges;\n\n\nvector<edge> edge_;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n par[to]=pos;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n edge_.push_back(G[pos][i]);\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n edge_.clear();\n \n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n memset(par,-1,sizeof(par));\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool isDag(int id){\n queue<int> Q; \n vector<int> C(N,0);\n int cc=0;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n C[ b[i] ]++;\n }\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\n\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n return (cc==N);\n}\n\nvoid visit(int v){\n if(visited[v])return;\n visited[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n visit(G[v][i].to);\n }\n}\n\nint calcDec(int id){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n }\n int res=0;\n memset(visited,false,sizeof(visited));\n for(int i=0;i<N;i++){\n if(!visited[i]){\n res++;\n visit(i);\n }\n }\n return res;\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n \n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if( rec(e.to,si) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n loope.clear();\n if( rec(i,i) )break;\n }\n \n for(int i=0;i<(int)loope.size();i++)\n if(check( loope[i].id ))return true;\n\n return false;\n}\n\nbool solve(){\n int B=countB(-1);\n if(B==M)return false;\n \n if( !isDag(-1) )return solve2();\n\n /*\n for(int i=0;i<M;i++){\n if(check(i)){\n return true;\n }\n }\n */\n int maxm=0;\n\n \n B=countB(-1);\n for(int i=0;i<(int)edge_.size();i++){\n edge e=edge_[i];\n int a=e.from;\n int cc=0;\n while(1){\n if(a==e.to)break;\n if(cnt[a]==1)cc++;\n a=par[a];\n }\n maxm=max(maxm,cc);\n }\n\n for(int i=0;i<M;i++)\n if(check(i))return true;\n /*\n vector<edge> tmp=edge_;\n for(int i=0;i<(int)tmp.size();i++){\n edge e=tmp[i];\n if(check(e.id))return true;\n }\n */\n return (B+maxm>=2);\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":1,"time_ms":1020,"memory_kb":6172,"score_of_the_acc":-1.9352,"final_rank":3},{"submission_id":"aoj_2797_2238711","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 50000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\nbool flg[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MAX_N];\n\n\nvector<edge> bridges;\n\n\nvector<edge> edge_;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n par[to]=pos;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n edge_.push_back(G[pos][i]);\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n edge_.clear();\n \n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n memset(par,-1,sizeof(par));\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool isDag(int id){\n queue<int> Q; \n vector<int> C(N,0);\n int cc=0;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n C[ b[i] ]++;\n }\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\n\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n return (cc==N);\n}\n\nvoid visit(int v){\n if(visited[v])return;\n visited[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n visit(G[v][i].to);\n }\n}\n\nint calcDec(int id){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n }\n int res=0;\n memset(visited,false,sizeof(visited));\n for(int i=0;i<N;i++){\n if(!visited[i]){\n res++;\n visit(i);\n }\n }\n return res;\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n \n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if( rec(e.to,si) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n loope.clear();\n if( rec(i,i) )break;\n }\n \n for(int i=0;i<(int)loope.size();i++)\n if(check( loope[i].id ))return true;\n\n return false;\n}\n\nbool solve(){\n int B=countB(-1);\n if(B==M)return false;\n \n if( !isDag(-1) )return solve2();\n\n /*\n for(int i=0;i<M;i++){\n if(check(i)){\n return true;\n }\n }\n */\n int maxm=0;\n\n \n B=countB(-1);\n for(int i=0;i<(int)edge_.size();i++){\n edge e=edge_[i];\n int a=e.from;\n int cc=0;\n while(1){\n if(a==e.to)break;\n if(cnt[a]==1)cc++;\n a=par[a];\n }\n maxm=max(maxm,cc);\n }\n vector<edge> tmp=edge_;\n for(int i=0;i<(int)tmp.size();i++){\n edge e=tmp[i];\n if(check(e.id))return true;\n }\n return (B+maxm>=2);\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":0.29411764705882354,"time_ms":240,"memory_kb":4448,"score_of_the_acc":-0.5687,"final_rank":10},{"submission_id":"aoj_2797_2238710","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 50000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\nbool flg[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MAX_N];\n\n\nvector<edge> bridges;\n\n\nvector<edge> edge_;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n par[to]=pos;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n edge_.push_back(G[pos][i]);\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n edge_.clear();\n \n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n memset(par,-1,sizeof(par));\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool isDag(int id){\n queue<int> Q; \n vector<int> C(N,0);\n int cc=0;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n C[ b[i] ]++;\n }\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\n\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n return (cc==N);\n}\n\nvoid visit(int v){\n if(visited[v])return;\n visited[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n visit(G[v][i].to);\n }\n}\n\nint calcDec(int id){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n }\n int res=0;\n memset(visited,false,sizeof(visited));\n for(int i=0;i<N;i++){\n if(!visited[i]){\n res++;\n visit(i);\n }\n }\n return res;\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n \n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if( rec(e.to,si) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n loope.clear();\n if( rec(i,i) )break;\n }\n \n for(int i=0;i<(int)loope.size();i++)\n if(check( loope[i].id ))return true;\n\n return false;\n}\n\nbool solve(){\n int B=countB(-1);\n if(B==M)return false;\n \n if( !isDag(-1) )return solve2();\n\n /*\n for(int i=0;i<M;i++){\n if(check(i)){\n return true;\n }\n }\n */\n int maxm=0;\n\n \n B=countB(-1);\n for(int i=0;i<(int)edge_.size();i++){\n edge e=edge_[i];\n int a=e.from;\n int cc=0;\n while(1){\n if(a==e.to)break;\n if(cnt[a]==1)cc++;\n a=par[a];\n }\n maxm=max(maxm,cc);\n\n }\n for(int i=0;i<(int)edge_.size();i++){\n edge e=edge_[i];\n if(check(e.id))return true;\n }\n return (B+maxm>=2);\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":0.29411764705882354,"time_ms":240,"memory_kb":4448,"score_of_the_acc":-0.5687,"final_rank":10},{"submission_id":"aoj_2797_2238708","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 50000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\nbool flg[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MAX_N];\n\n\nvector<edge> bridges;\n\n\nvector<edge> edge_;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n par[to]=pos;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n edge_.push_back(G[pos][i]);\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n edge_.clear();\n \n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n memset(par,-1,sizeof(par));\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool isDag(int id){\n queue<int> Q; \n vector<int> C(N,0);\n int cc=0;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n C[ b[i] ]++;\n }\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\n\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n return (cc==N);\n}\n\nvoid visit(int v){\n if(visited[v])return;\n visited[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n visit(G[v][i].to);\n }\n}\n\nint calcDec(int id){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n }\n int res=0;\n memset(visited,false,sizeof(visited));\n for(int i=0;i<N;i++){\n if(!visited[i]){\n res++;\n visit(i);\n }\n }\n return res;\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n \n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if( rec(e.to,si) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n loope.clear();\n if( rec(i,i) )break;\n }\n \n for(int i=0;i<(int)loope.size();i++)\n if(check( loope[i].id ))return true;\n\n return false;\n}\n\nbool solve(){\n int B=countB(-1);\n if(B==M)return false;\n \n if( !isDag(-1) )return solve2();\n\n /*\n for(int i=0;i<M;i++){\n if(check(i)){\n return true;\n }\n }\n */\n int maxm=0;\n\n \n B=countB(-1);\n for(int i=0;i<(int)edge_.size();i++){\n\n edge e=edge_[i];\n if(check(e.id))return true;\n /*\n int a=e.from;\n int cc=0;\n while(1){\n if(a==e.to)break;\n if(cnt[a]==1)cc++;\n a=par[a];\n }\n maxm=max(maxm,cc);\n */\n }\n return (B+maxm>=2);\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":0.23529411764705882,"time_ms":240,"memory_kb":4468,"score_of_the_acc":-0.5762,"final_rank":12},{"submission_id":"aoj_2797_2238702","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 50000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\nbool flg[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MAX_N];\n\n\nvector<edge> bridges;\n\n\nvector<edge> edge_;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n par[to]=pos;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n edge_.push_back(G[pos][i]);\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n edge_.clear();\n \n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n memset(par,-1,sizeof(par));\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool isDag(int id){\n queue<int> Q; \n vector<int> C(N,0);\n int cc=0;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n C[ b[i] ]++;\n }\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\n\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n return (cc==N);\n}\n\nvoid visit(int v){\n if(visited[v])return;\n visited[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n visit(G[v][i].to);\n }\n}\n\nint calcDec(int id){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n }\n int res=0;\n memset(visited,false,sizeof(visited));\n for(int i=0;i<N;i++){\n if(!visited[i]){\n res++;\n visit(i);\n }\n }\n return res;\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n \n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if( rec(e.to,si) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n loope.clear();\n if( rec(i,i) )break;\n }\n \n for(int i=0;i<(int)loope.size();i++)\n if(check( loope[i].id ))return true;\n\n return false;\n}\n\nbool solve(){\n int B=countB(-1);\n if(B==M)return false;\n\n\n \n if( !isDag(-1) )return solve2();\n\n for(int i=0;i<M;i++){\n if(check(i)){\n return true;\n }\n }\n \n int maxm=0;\n\n B=countB(-1);\n for(int i=0;i<(int)edge_.size();i++){\n edge e=edge_[i];\n int a=e.from;\n int cc=0;\n while(1){\n if(a==e.to)break;\n if(cnt[a]==1)cc++;\n a=par[a];\n // cout<<\"a=\"<<a<<endl;\n // cout<<\"par[a]=\"<<par[a]<<endl;\n // cout<<e.from<<' '<<e.to<<endl;\n }\n maxm=max(maxm,cc);\n }\n return (B+maxm>=2);\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":1,"time_ms":1090,"memory_kb":6096,"score_of_the_acc":-1.9716,"final_rank":4},{"submission_id":"aoj_2797_2238700","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 30000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\nbool flg[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MAX_N];\n\n\nvector<edge> bridges;\n\n\nvector<edge> edge_;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n par[to]=pos;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n edge_.push_back(G[pos][i]);\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n edge_.clear();\n \n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n memset(par,-1,sizeof(par));\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool isDag(int id){\n queue<int> Q; \n vector<int> C(N,0);\n int cc=0;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n C[ b[i] ]++;\n }\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\n\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n return (cc==N);\n}\n\nvoid visit(int v){\n if(visited[v])return;\n visited[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n visit(G[v][i].to);\n }\n}\n\nint calcDec(int id){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n }\n int res=0;\n memset(visited,false,sizeof(visited));\n for(int i=0;i<N;i++){\n if(!visited[i]){\n res++;\n visit(i);\n }\n }\n return res;\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n \n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if( rec(e.to,si) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n loope.clear();\n if( rec(i,i) )break;\n }\n \n for(int i=0;i<(int)loope.size();i++)\n if(check( loope[i].id ))return true;\n\n return false;\n}\n\nbool solve(){\n int B=countB(-1);\n if(B==M)return false;\n\n\n \n if( !isDag(-1) )return solve2();\n\n for(int i=0;i<M;i++){\n if(check(i)){\n return true;\n }\n }\n \n int maxm=0;\n\n B=countB(-1);\n for(int i=0;i<(int)edge_.size();i++){\n edge e=edge_[i];\n int a=e.from;\n int cc=0;\n while(1){\n if(a==e.to)break;\n if(cnt[a]==1)cc++;\n a=par[a];\n // cout<<\"a=\"<<a<<endl;\n // cout<<\"par[a]=\"<<par[a]<<endl;\n // cout<<e.from<<' '<<e.to<<endl;\n }\n maxm=max(maxm,cc);\n }\n return (B+maxm>=2);\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":0.4852941176470588,"time_ms":310,"memory_kb":4632,"score_of_the_acc":-0.7023,"final_rank":5},{"submission_id":"aoj_2797_2238685","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 30000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\nbool flg[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MAX_N];\n\n\nvector<edge> bridges;\n\n\nvector<edge> edge_;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n par[to]=pos;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n edge_.push_back(G[pos][i]);\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n edge_.clear();\n \n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n memset(par,-1,sizeof(par));\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool isDag(int id){\n queue<int> Q; \n vector<int> C(N,0);\n int cc=0;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n C[ b[i] ]++;\n }\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\n\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n return (cc==N);\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n if(flg[id])return false;\n \n int B=countB(id);\n if(B<2)return false;\n if(isDag(id))return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if( rec(e.to,si) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n loope.clear();\n if( rec(i,i) )break;\n }\n \n for(int i=0;i<(int)loope.size();i++)\n if(check( loope[i].id ))return true;\n\n return false;\n}\n\nbool solve(){\n int B=countB(-1);\n if(B==M)return false;\n for(int i=0;i<(int)bridges.size();i++)flg[ bridges[i].id ]=true;\n if( !isDag(-1) )return solve2();\n\n int maxm=0;\n\n for(int i=0;i<(int)edge_.size();i++){\n edge e=edge_[i];\n int a=e.from;\n int cc=0;\n while(1){\n if(a==e.to)break;\n if(cnt[a]==1)cc++;\n a=par[a];\n // cout<<\"a=\"<<a<<endl;\n // cout<<\"par[a]=\"<<par[a]<<endl;\n // cout<<e.from<<' '<<e.to<<endl;\n }\n maxm=max(maxm,cc);\n }\n return (B+maxm>=2);\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":0.29411764705882354,"time_ms":140,"memory_kb":4368,"score_of_the_acc":-0.4462,"final_rank":9},{"submission_id":"aoj_2797_2235254","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 30000\nstruct edge{ int from,to,id; };\nint N,M;\nint a[MAX_M],b[MAX_M];\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nvector<edge> bridges;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n \n int B=countB(id);\n\n memset(visited,false,sizeof(visited));\n int U=0;\n for(int i=0;i<N;i++)\n if(!visited[i])U++,dfs(i,-1);\n \n if(B+U<3)return false;\n \n queue<int> Q;\n vector<int> C(N,0);\n for(int i=0;i<M;i++)\n if(id!=i)C[ b[i] ]++;\n for(int i=0;i<N;i++)\n if(C[i]==0)Q.push(i);\n int cc=0;\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n if(cc==N)return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si,int pre=-1){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if(e.id==pre)continue;\n \n if( rec(e.to,si,e.id) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n\n map<int,bool> used;\n for(int i=0;i<M;i++){\n if(used[a[i]])continue;\n if(check(i))return true;\n used[ a[i] ]=true;\n }\n \n used.clear();\n for(int i=0;i<M;i++){\n if(used[b[i]])continue;\n if(check(i))return true;\n used[ b[i] ]=true;\n }\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n loope.clear();\n if( rec(i,i) ){\n break;\n }\n }\n for(int i=0;i<(int)loope.size();i++){\n if(check( loope[i].id ))return true;\n }\n return false;\n}\n\nbool solve(){\n if(countB(-1)==M)return false;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n if(solve2())return true;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n for(int i=0;i<M;i++)G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n if(solve2())return true; \n return false;\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":0.4852941176470588,"time_ms":530,"memory_kb":4176,"score_of_the_acc":-0.7356,"final_rank":6},{"submission_id":"aoj_2797_2235248","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 30000\nstruct edge{ int from,to,id; };\nint N,M;\nint a[MAX_M],b[MAX_M];\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nvector<edge> bridges;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool check(int id){\n int B=countB(id);\n\n memset(visited,false,sizeof(visited));\n int U=0;\n for(int i=0;i<N;i++)\n if(!visited[i])U++,dfs(i,-1);\n \n if(B+U<3)return false;\n \n queue<int> Q;\n vector<int> C(N,0);\n for(int i=0;i<M;i++)\n if(id!=i)C[ b[i] ]++;\n for(int i=0;i<N;i++)\n if(C[i]==0)Q.push(i);\n int cc=0;\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n if(cc==N)return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si,int pre=-1){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if(e.id==pre)continue;\n \n if( rec(e.to,si,e.id) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n\n map<int,bool> used;\n for(int i=0;i<M;i++){\n if(used[a[i]])continue;\n if(check(i))return true;\n used[ a[i] ]=true;\n }\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n loope.clear();\n if( rec(i,i) ){\n break;\n }\n }\n for(int i=0;i<(int)loope.size();i++){\n if(check( loope[i].id ))return true;\n }\n return false;\n}\n\nbool solve(){\n if(countB(-1)==M)return false;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n if(solve2())return true;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n for(int i=0;i<M;i++)G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n if(solve2())return true; \n return false;\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":0.4852941176470588,"time_ms":840,"memory_kb":4068,"score_of_the_acc":-0.9823,"final_rank":7},{"submission_id":"aoj_2797_2001225","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\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\nnamespace SCC{\n void visit(const vector<vector<int>>&G,vector<int>&vs,vector<int>&used,int v){\n used[v]=true;\n for(auto u:G[v]){\n if(!used[u])visit(G,vs,used,u);\n }\n vs.push_back(v);\n }\n\n void visit2(const vector<vector<int>>&T,vector<int>&used,vector<int>&comp,vector<int>&vec,int k,int v){\n comp[v]=k;\n used[v]=true;\n vec.push_back(v);\n\n for(auto u:T[v]){\n if(!used[u])visit2(T,used,comp,vec,k,u);\n }\n }\n\n //G:?????£?????????????§£???????????°??????\n //H:?????£??????????????°??????1???????????????????´?????????°??????\n //comp:G????????????????????????H?????????????±????????????????\n void decompose(const vector<vector<int>>&G,vector<vector<int>>&H,vector<int>&comp){\n vector<vector<int>>T(G.size());\n for(int i=0;i<G.size();i++){\n for(auto v:G[i]){\n T[v].push_back(i);\n }\n }\n comp.resize(G.size());\n\n vector<int>vs(G.size());\n vector<int>used(G.size());\n for(int i=0;i<G.size();i++){\n if(!used[i])visit(G,vs,used,i);\n }\n reverse(vs.begin(),vs.end());\n fill(used.begin(),used.end(),0);\n\n int K=0;\n vector<vector<int>>S;\n for(auto v:vs){\n if(!used[v]){\n S.push_back(vector<int>());\n visit2(T,used,comp,S.back(),K++,v);\n }\n }\n\n H.resize(K);\n fill(used.begin(),used.end(),0);\n for(int i=0;i<K;i++){\n for(auto v:S[i]){\n for(auto u:G[v]){\n if(used[comp[u]]||comp[v]==comp[u])continue;\n used[comp[u]]=true;\n H[comp[v]].push_back(comp[u]);\n }\n }\n for(auto v:H[i])used[v]=false;\n }\n\n }\n}\n\nstruct UF{\n vector<int>par,sz;\n void init(int n){\n par.resize(n);\n sz.resize(n);\n for(int i=0;i<n;i++){\n par[i]=i;\n sz[i]=1;\n }\n }\n int find(int x){\n return x==par[x]?x:par[x]=find(par[x]);\n }\n void unite(int x,int y){\n x=find(x);y=find(y);\n if(x==y)return;\n sz[x]+=sz[y];\n par[y]=x;\n }\n bool same(int x,int y){\n return find(x)==find(y);\n }\n int size(int x){\n return sz[find(x)];\n }\n};\n\nvector<vint>G;\nvector<pair<int, int> > bridge;\nint ord[1000], low[1000];\nbool vis[1000];\n\nvoid dfs(int v, int p, int &k)\n{\n\tvis[v] = true;\n\n\tord[v] = k++;\n\tlow[v] = ord[v];\n\n\tfor (int i = 0; i < G[v].size(); i++){\n\t\tif (!vis[G[v][i]]){\n\t\t\tdfs(G[v][i], v, k);\n\t\t\tlow[v] = min(low[v], low[G[v][i]]);\n\t\t\tif (ord[v] < low[G[v][i]]) bridge.push_back(make_pair(min(v, G[v][i]), max(v, G[v][i])));\n\t\t}\n\t\telse if (G[v][i] != p){\n\t\t\tlow[v] = min(low[v], ord[G[v][i]]);\n\t\t}\n\t}\n}\n\nint A[100000],B[100000];\n\nvint T[1000];\n\nint N,M;\nvpint backer;\nint sum[1000];\nint par[1000];\nint dep[1000];\nvoid dfs2(int v,int p,int d){\n vis[v]=true;\n par[v]=p;\n dep[v]=d;\n for(auto u:G[v]){\n if(u==p)continue;\n if(vis[u])backer.pb(pint(min(u,v),max(u,v)));\n else{\n dfs2(u,v,d+1);\n }\n }\n}\n\nvoid solve(){\n G=vector<vint>(N);\n rep(i,M)G[A[i]].pb(B[i]),G[B[i]].pb(A[i]);\n memset(vis,0,sizeof(vis));\n dfs2(0,-1,0);\n sort(all(backer));backer.erase(unique(all(backer)),backer.end());\n\n rep(i,backer.size()){\n int v=backer[i].fi,u=backer[i].se;\n while(v!=u){\n if(dep[v]<dep[u])swap(v,u);\n sum[v]++;\n v=par[v];\n }\n }\n\n rep(i,backer.size()){\n int v=backer[i].fi,u=backer[i].se;\n while(v!=u){\n if(dep[v]<dep[u])swap(v,u);\n sum[v]--;\n v=par[v];\n }\n int cnt=0;\n reps(j,1,N)if(sum[j]==0)cnt++;\n\n if(cnt>=2){\n cout<<\"YES\"<<endl;\n return;\n }\n\n v=backer[i].fi;u=backer[i].se;\n while(v!=u){\n if(dep[v]<dep[u])swap(v,u);\n sum[v]++;\n v=par[v];\n }\n }\n cout<<\"NO\"<<endl;\n}\n\nsigned main(){\n cin>>N>>M;\n rep(i,M)cin>>A[i]>>B[i],A[i]--,B[i]--;\n\n bool flag=false;\n int deg[1000]={};\n {\n vector<vint>G(N),H;\n rep(i,M)G[A[i]].pb(B[i]);\n vint comp;\n SCC::decompose(G,H,comp);\n rep(i,M){\n if(comp[A[i]]==comp[B[i]])deg[B[i]]++;\n }\n if(H.size()==N)flag=true;\n }\n\n if(!flag){\n rep(i,M){\n if(deg[B[i]]!=1)continue;\n UF uf;\n uf.init(N);\n rep(j,M)if(i!=j)uf.unite(A[j],B[j]);\n bool ok=true;\n rep(j,N)if(uf.find(j)!=uf.find(0))ok=false;\n if(!ok)continue;\n G=vector<vint>(N);\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]);\n vector<vint>H;vint comp;\n SCC::decompose(G,H,comp);\n if(H.size()!=N)continue;\n G=vector<vint>(N);\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]),G[B[j]].pb(A[j]);\n memset(vis,0,sizeof(vis));\n int K=0;\n bridge.clear();\n dfs(0,-1,K);\n if(bridge.size()>=2){\n cout<<\"YES\"<<endl;\n return 0;\n }\n }\n cout<<\"NO\"<<endl;\n return 0;\n }\n\n solve();\n return 0;\n}","accuracy":0.29411764705882354,"time_ms":10,"memory_kb":3884,"score_of_the_acc":-0.145,"final_rank":8},{"submission_id":"aoj_2797_2001042","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#define rep(i,n) for (int i = 0; i < n; ++i)\n#define drep(i,n) for (int i = n-1; i >= 0; --i)\n#define pb push_back\n#define sz(x) int(x.size())\n#define mins(x,y) x = min(x,y)\n#define maxs(x,y) x = max(x,y)\nusing namespace std;\ninline int in() { int x; scanf(\"%d\", &x); return x;}\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\n\nstruct Lowlink {\n int n, k;\n vvi to, st, br;\n vi ord, low;\n Lowlink(int n=0):n(n),to(n),st(n),br(n),ord(n,-1),low(n){}\n void add(int a, int b) {\n to[a].pb(b); st[a].pb(0);\n to[b].pb(a); st[b].pb(0);\n }\n void dfs(int v, int p=-1) {\n ord[v] = low[v] = k++;\n rep(i,sz(to[v])) {\n int u = to[v][i];\n if (u == p) continue;\n if (ord[u] == -1) {\n st[v][i] = 1;\n dfs(u,v);\n mins(low[v],low[u]);\n } else {\n st[v][i] = -1;\n mins(low[v],ord[u]);\n }\n }\n }\n int init() {\n k = 0;\n dfs(0);\n int res = 0;\n rep(i,n)rep(j,sz(to[i])) {\n int v = i, u = to[i][j];\n if (ord[v] > ord[u]) swap(v,u);\n if (ord[u] == low[u]) res++;\n br[i].pb(ord[u] == low[u]);\n }\n return res/2;\n }\n};\n\nint n, m;\nvvi to;\nvi used, vs;\n\nint rv;\nbool cfs(vvi& to, int v) {\n if (used[v]) {\n if (used[v] == 2) return false;\n rv = v;\n return true;\n }\n used[v] = 1;\n for (int u : to[v]) {\n if (cfs(to,u)) {\n if (rv != -1) vs.pb(v);\n if (rv == v) rv = -1;\n return true;\n }\n }\n used[v] = 2;\n return false;\n}\nbool findCycle(vvi& to) {\n used = vi(n);\n rv = -1;\n rep(i,n) if (!used[i]) {\n if (cfs(to,i)) return true;\n }\n return false;\n}\nbool solve1(int u, int v) {\n // printf(\"%d %d\\n\", v, u);\n vvi t(n);\n rep(i,n) for (int j : to[i]) {\n if (i == v && j == u) continue;\n t[i].pb(j);\n // printf(\"edge %d %d\\n\", i, j);\n }\n if (findCycle(t)) return false;\n // printf(\"%d %d\\n\", v, u);\n Lowlink g(n);\n rep(i,n) for (int j : to[i]) {\n if (i == v && j == u) continue;\n g.add(i,j);\n }\n return g.init() >= 2;\n}\nbool solve2(Lowlink& g, int ei, int ej) {\n Lowlink t(n);\n rep(i,n)rep(j,sz(g.to[i])) {\n if (ei == i && ej == j) continue;\n int u = g.to[i][j];\n if (!g.st[i][j]) continue;\n if (g.st[i][j] == -1 && i < u) continue;\n t.add(i,u);\n }\n return t.init() >= 2;\n}\n\nint main() {\n n = in(); m = in();\n to = vvi(n);\n rep(i,m) {\n int a = in(), b = in();\n --a; --b;\n to[a].pb(b);\n }\n if (findCycle(to)) {\n int s = sz(vs);\n rep(i,s) {\n if (solve1(vs[i],vs[(i+1)%s])) {\n puts(\"YES\");\n return 0;\n }\n }\n } else if (m >= n) {\n Lowlink g(n);\n rep(i,n) for (int u : to[i]) g.add(i,u);\n if (g.init() >= 2) {\n puts(\"YES\");\n return 0;\n }\n rep(i,n) rep(j,sz(g.to[i])) {\n if (g.st[i][j] != 1 || g.br[i][j]) continue;\n if (solve2(g,i,j)) {\n puts(\"YES\");\n return 0;\n }\n }\n }\n puts(\"NO\");\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3496,"score_of_the_acc":-0.0093,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2797_2238723\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 50000\\nstruct edge{ int from,to,id; };\\n\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\n\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nint par[MAX_N];\\nedge f_edge[MAX_N];\\n\\nvector<edge> bridges;\\n\\n\\nvector<edge> edge_;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n f_edge[to]=G[pos][i];\\n par[to]=pos;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n edge_.push_back(G[pos][i]);\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n edge_.clear();\\n \\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n memset(par,-1,sizeof(par));\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool isDag(int id){\\n queue<int> Q; \\n vector<int> C(N,0);\\n int cc=0;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n C[ b[i] ]++;\\n }\\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\\n\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n return (cc==N);\\n}\\n\\nvoid visit(int v){\\n if(visited[v])return;\\n visited[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n visit(G[v][i].to);\\n }\\n}\\n\\nint calcDec(int id){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n }\\n int res=0;\\n memset(visited,false,sizeof(visited));\\n for(int i=0;i<N;i++){\\n if(!visited[i]){\\n res++;\\n visit(i);\\n }\\n }\\n return res;\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n \\n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if( rec(e.to,si) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n loope.clear();\\n if( rec(i,i) )break;\\n }\\n \\n for(int i=0;i<(int)loope.size();i++)\\n if(check( loope[i].id ))return true;\\n\\n return false;\\n}\\n\\nbool solve(){\\n int B=countB(-1);\\n if(B==M)return false;\\n \\n if( !isDag(-1) )return solve2();\\n\\n int maxm=0;\\n\\n \\n B=countB(-1);\\n for(int i=0;i<(int)edge_.size();i++){\\n edge e=edge_[i];\\n int a=e.from;\\n int cc=0;\\n while(1){\\n if(a==e.to)break;\\n if(cnt[a]==1)cc++;\\n a=par[a];\\n }\\n maxm=max(maxm,cc);\\n }\\n vector<int> v;\\n for(int i=0;i<N;i++)\\n if(depth[i]>0)\\n v.push_back(f_edge[i].id);\\n\\n for(int i=0;i<(int)v.size();i++){\\n if(check(v[i]))return true;\\n }\\n \\n return (B+maxm>=2);\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1050,\n \"memory_kb\": 6092,\n \"score_of_the_acc\": -1.9331,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2797_2238714\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 50000\\nstruct edge{ int from,to,id; };\\n\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nbool flg[MAX_M];\\n\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nint par[MAX_N];\\n\\n\\nvector<edge> bridges;\\n\\n\\nvector<edge> edge_;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n par[to]=pos;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n edge_.push_back(G[pos][i]);\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n edge_.clear();\\n \\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n memset(par,-1,sizeof(par));\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool isDag(int id){\\n queue<int> Q; \\n vector<int> C(N,0);\\n int cc=0;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n C[ b[i] ]++;\\n }\\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\\n\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n return (cc==N);\\n}\\n\\nvoid visit(int v){\\n if(visited[v])return;\\n visited[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n visit(G[v][i].to);\\n }\\n}\\n\\nint calcDec(int id){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n }\\n int res=0;\\n memset(visited,false,sizeof(visited));\\n for(int i=0;i<N;i++){\\n if(!visited[i]){\\n res++;\\n visit(i);\\n }\\n }\\n return res;\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n \\n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if( rec(e.to,si) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n loope.clear();\\n if( rec(i,i) )break;\\n }\\n \\n for(int i=0;i<(int)loope.size();i++)\\n if(check( loope[i].id ))return true;\\n\\n return false;\\n}\\n\\nbool solve(){\\n int B=countB(-1);\\n if(B==M)return false;\\n \\n if( !isDag(-1) )return solve2();\\n\\n /*\\n for(int i=0;i<M;i++){\\n if(check(i)){\\n return true;\\n }\\n }\\n */\\n int maxm=0;\\n\\n \\n B=countB(-1);\\n for(int i=0;i<(int)edge_.size();i++){\\n edge e=edge_[i];\\n int a=e.from;\\n int cc=0;\\n while(1){\\n if(a==e.to)break;\\n if(cnt[a]==1)cc++;\\n a=par[a];\\n }\\n maxm=max(maxm,cc);\\n }\\n\\n for(int i=0;i<M;i++)\\n if(check(i))return true;\\n /*\\n vector<edge> tmp=edge_;\\n for(int i=0;i<(int)tmp.size();i++){\\n edge e=tmp[i];\\n if(check(e.id))return true;\\n }\\n */\\n return (B+maxm>=2);\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1020,\n \"memory_kb\": 6172,\n \"score_of_the_acc\": -1.9352,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2797_2238711\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 50000\\nstruct edge{ int from,to,id; };\\n\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nbool flg[MAX_M];\\n\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nint par[MAX_N];\\n\\n\\nvector<edge> bridges;\\n\\n\\nvector<edge> edge_;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n par[to]=pos;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n edge_.push_back(G[pos][i]);\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n edge_.clear();\\n \\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n memset(par,-1,sizeof(par));\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool isDag(int id){\\n queue<int> Q; \\n vector<int> C(N,0);\\n int cc=0;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n C[ b[i] ]++;\\n }\\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\\n\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n return (cc==N);\\n}\\n\\nvoid visit(int v){\\n if(visited[v])return;\\n visited[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n visit(G[v][i].to);\\n }\\n}\\n\\nint calcDec(int id){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n }\\n int res=0;\\n memset(visited,false,sizeof(visited));\\n for(int i=0;i<N;i++){\\n if(!visited[i]){\\n res++;\\n visit(i);\\n }\\n }\\n return res;\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n \\n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if( rec(e.to,si) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n loope.clear();\\n if( rec(i,i) )break;\\n }\\n \\n for(int i=0;i<(int)loope.size();i++)\\n if(check( loope[i].id ))return true;\\n\\n return false;\\n}\\n\\nbool solve(){\\n int B=countB(-1);\\n if(B==M)return false;\\n \\n if( !isDag(-1) )return solve2();\\n\\n /*\\n for(int i=0;i<M;i++){\\n if(check(i)){\\n return true;\\n }\\n }\\n */\\n int maxm=0;\\n\\n \\n B=countB(-1);\\n for(int i=0;i<(int)edge_.size();i++){\\n edge e=edge_[i];\\n int a=e.from;\\n int cc=0;\\n while(1){\\n if(a==e.to)break;\\n if(cnt[a]==1)cc++;\\n a=par[a];\\n }\\n maxm=max(maxm,cc);\\n }\\n vector<edge> tmp=edge_;\\n for(int i=0;i<(int)tmp.size();i++){\\n edge e=tmp[i];\\n if(check(e.id))return true;\\n }\\n return (B+maxm>=2);\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.29411764705882354,\n \"time_ms\": 240,\n \"memory_kb\": 4448,\n \"score_of_the_acc\": -0.5687,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2797_2238710\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 50000\\nstruct edge{ int from,to,id; };\\n\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nbool flg[MAX_M];\\n\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nint par[MAX_N];\\n\\n\\nvector<edge> bridges;\\n\\n\\nvector<edge> edge_;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n par[to]=pos;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n edge_.push_back(G[pos][i]);\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n edge_.clear();\\n \\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n memset(par,-1,sizeof(par));\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool isDag(int id){\\n queue<int> Q; \\n vector<int> C(N,0);\\n int cc=0;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n C[ b[i] ]++;\\n }\\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\\n\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n return (cc==N);\\n}\\n\\nvoid visit(int v){\\n if(visited[v])return;\\n visited[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n visit(G[v][i].to);\\n }\\n}\\n\\nint calcDec(int id){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n }\\n int res=0;\\n memset(visited,false,sizeof(visited));\\n for(int i=0;i<N;i++){\\n if(!visited[i]){\\n res++;\\n visit(i);\\n }\\n }\\n return res;\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n \\n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if( rec(e.to,si) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n loope.clear();\\n if( rec(i,i) )break;\\n }\\n \\n for(int i=0;i<(int)loope.size();i++)\\n if(check( loope[i].id ))return true;\\n\\n return false;\\n}\\n\\nbool solve(){\\n int B=countB(-1);\\n if(B==M)return false;\\n \\n if( !isDag(-1) )return solve2();\\n\\n /*\\n for(int i=0;i<M;i++){\\n if(check(i)){\\n return true;\\n }\\n }\\n */\\n int maxm=0;\\n\\n \\n B=countB(-1);\\n for(int i=0;i<(int)edge_.size();i++){\\n edge e=edge_[i];\\n int a=e.from;\\n int cc=0;\\n while(1){\\n if(a==e.to)break;\\n if(cnt[a]==1)cc++;\\n a=par[a];\\n }\\n maxm=max(maxm,cc);\\n\\n }\\n for(int i=0;i<(int)edge_.size();i++){\\n edge e=edge_[i];\\n if(check(e.id))return true;\\n }\\n return (B+maxm>=2);\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.29411764705882354,\n \"time_ms\": 240,\n \"memory_kb\": 4448,\n \"score_of_the_acc\": -0.5687,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2797_2238708\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 50000\\nstruct edge{ int from,to,id; };\\n\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nbool flg[MAX_M];\\n\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nint par[MAX_N];\\n\\n\\nvector<edge> bridges;\\n\\n\\nvector<edge> edge_;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n par[to]=pos;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n edge_.push_back(G[pos][i]);\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n edge_.clear();\\n \\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n memset(par,-1,sizeof(par));\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool isDag(int id){\\n queue<int> Q; \\n vector<int> C(N,0);\\n int cc=0;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n C[ b[i] ]++;\\n }\\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\\n\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n return (cc==N);\\n}\\n\\nvoid visit(int v){\\n if(visited[v])return;\\n visited[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n visit(G[v][i].to);\\n }\\n}\\n\\nint calcDec(int id){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n }\\n int res=0;\\n memset(visited,false,sizeof(visited));\\n for(int i=0;i<N;i++){\\n if(!visited[i]){\\n res++;\\n visit(i);\\n }\\n }\\n return res;\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n \\n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if( rec(e.to,si) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n loope.clear();\\n if( rec(i,i) )break;\\n }\\n \\n for(int i=0;i<(int)loope.size();i++)\\n if(check( loope[i].id ))return true;\\n\\n return false;\\n}\\n\\nbool solve(){\\n int B=countB(-1);\\n if(B==M)return false;\\n \\n if( !isDag(-1) )return solve2();\\n\\n /*\\n for(int i=0;i<M;i++){\\n if(check(i)){\\n return true;\\n }\\n }\\n */\\n int maxm=0;\\n\\n \\n B=countB(-1);\\n for(int i=0;i<(int)edge_.size();i++){\\n\\n edge e=edge_[i];\\n if(check(e.id))return true;\\n /*\\n int a=e.from;\\n int cc=0;\\n while(1){\\n if(a==e.to)break;\\n if(cnt[a]==1)cc++;\\n a=par[a];\\n }\\n maxm=max(maxm,cc);\\n */\\n }\\n return (B+maxm>=2);\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.23529411764705882,\n \"time_ms\": 240,\n \"memory_kb\": 4468,\n \"score_of_the_acc\": -0.5762,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2797_2238702\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 50000\\nstruct edge{ int from,to,id; };\\n\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nbool flg[MAX_M];\\n\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nint par[MAX_N];\\n\\n\\nvector<edge> bridges;\\n\\n\\nvector<edge> edge_;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n par[to]=pos;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n edge_.push_back(G[pos][i]);\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n edge_.clear();\\n \\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n memset(par,-1,sizeof(par));\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool isDag(int id){\\n queue<int> Q; \\n vector<int> C(N,0);\\n int cc=0;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n C[ b[i] ]++;\\n }\\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\\n\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n return (cc==N);\\n}\\n\\nvoid visit(int v){\\n if(visited[v])return;\\n visited[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n visit(G[v][i].to);\\n }\\n}\\n\\nint calcDec(int id){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n }\\n int res=0;\\n memset(visited,false,sizeof(visited));\\n for(int i=0;i<N;i++){\\n if(!visited[i]){\\n res++;\\n visit(i);\\n }\\n }\\n return res;\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n \\n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if( rec(e.to,si) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n loope.clear();\\n if( rec(i,i) )break;\\n }\\n \\n for(int i=0;i<(int)loope.size();i++)\\n if(check( loope[i].id ))return true;\\n\\n return false;\\n}\\n\\nbool solve(){\\n int B=countB(-1);\\n if(B==M)return false;\\n\\n\\n \\n if( !isDag(-1) )return solve2();\\n\\n for(int i=0;i<M;i++){\\n if(check(i)){\\n return true;\\n }\\n }\\n \\n int maxm=0;\\n\\n B=countB(-1);\\n for(int i=0;i<(int)edge_.size();i++){\\n edge e=edge_[i];\\n int a=e.from;\\n int cc=0;\\n while(1){\\n if(a==e.to)break;\\n if(cnt[a]==1)cc++;\\n a=par[a];\\n // cout<<\\\"a=\\\"<<a<<endl;\\n // cout<<\\\"par[a]=\\\"<<par[a]<<endl;\\n // cout<<e.from<<' '<<e.to<<endl;\\n }\\n maxm=max(maxm,cc);\\n }\\n return (B+maxm>=2);\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1090,\n \"memory_kb\": 6096,\n \"score_of_the_acc\": -1.9716,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2797_2238700\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 30000\\nstruct edge{ int from,to,id; };\\n\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nbool flg[MAX_M];\\n\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nint par[MAX_N];\\n\\n\\nvector<edge> bridges;\\n\\n\\nvector<edge> edge_;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n par[to]=pos;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n edge_.push_back(G[pos][i]);\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n edge_.clear();\\n \\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n memset(par,-1,sizeof(par));\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool isDag(int id){\\n queue<int> Q; \\n vector<int> C(N,0);\\n int cc=0;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n C[ b[i] ]++;\\n }\\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\\n\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n return (cc==N);\\n}\\n\\nvoid visit(int v){\\n if(visited[v])return;\\n visited[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n visit(G[v][i].to);\\n }\\n}\\n\\nint calcDec(int id){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n }\\n int res=0;\\n memset(visited,false,sizeof(visited));\\n for(int i=0;i<N;i++){\\n if(!visited[i]){\\n res++;\\n visit(i);\\n }\\n }\\n return res;\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n \\n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if( rec(e.to,si) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n loope.clear();\\n if( rec(i,i) )break;\\n }\\n \\n for(int i=0;i<(int)loope.size();i++)\\n if(check( loope[i].id ))return true;\\n\\n return false;\\n}\\n\\nbool solve(){\\n int B=countB(-1);\\n if(B==M)return false;\\n\\n\\n \\n if( !isDag(-1) )return solve2();\\n\\n for(int i=0;i<M;i++){\\n if(check(i)){\\n return true;\\n }\\n }\\n \\n int maxm=0;\\n\\n B=countB(-1);\\n for(int i=0;i<(int)edge_.size();i++){\\n edge e=edge_[i];\\n int a=e.from;\\n int cc=0;\\n while(1){\\n if(a==e.to)break;\\n if(cnt[a]==1)cc++;\\n a=par[a];\\n // cout<<\\\"a=\\\"<<a<<endl;\\n // cout<<\\\"par[a]=\\\"<<par[a]<<endl;\\n // cout<<e.from<<' '<<e.to<<endl;\\n }\\n maxm=max(maxm,cc);\\n }\\n return (B+maxm>=2);\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.4852941176470588,\n \"time_ms\": 310,\n \"memory_kb\": 4632,\n \"score_of_the_acc\": -0.7023,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2797_2238685\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 30000\\nstruct edge{ int from,to,id; };\\n\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nbool flg[MAX_M];\\n\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nint par[MAX_N];\\n\\n\\nvector<edge> bridges;\\n\\n\\nvector<edge> edge_;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n par[to]=pos;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n edge_.push_back(G[pos][i]);\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n edge_.clear();\\n \\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n memset(par,-1,sizeof(par));\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool isDag(int id){\\n queue<int> Q; \\n vector<int> C(N,0);\\n int cc=0;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n C[ b[i] ]++;\\n }\\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\\n\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n return (cc==N);\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n if(flg[id])return false;\\n \\n int B=countB(id);\\n if(B<2)return false;\\n if(isDag(id))return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if( rec(e.to,si) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n loope.clear();\\n if( rec(i,i) )break;\\n }\\n \\n for(int i=0;i<(int)loope.size();i++)\\n if(check( loope[i].id ))return true;\\n\\n return false;\\n}\\n\\nbool solve(){\\n int B=countB(-1);\\n if(B==M)return false;\\n for(int i=0;i<(int)bridges.size();i++)flg[ bridges[i].id ]=true;\\n if( !isDag(-1) )return solve2();\\n\\n int maxm=0;\\n\\n for(int i=0;i<(int)edge_.size();i++){\\n edge e=edge_[i];\\n int a=e.from;\\n int cc=0;\\n while(1){\\n if(a==e.to)break;\\n if(cnt[a]==1)cc++;\\n a=par[a];\\n // cout<<\\\"a=\\\"<<a<<endl;\\n // cout<<\\\"par[a]=\\\"<<par[a]<<endl;\\n // cout<<e.from<<' '<<e.to<<endl;\\n }\\n maxm=max(maxm,cc);\\n }\\n return (B+maxm>=2);\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.29411764705882354,\n \"time_ms\": 140,\n \"memory_kb\": 4368,\n \"score_of_the_acc\": -0.4462,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2797_2235254\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 30000\\nstruct edge{ int from,to,id; };\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nvector<edge> bridges;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n \\n int B=countB(id);\\n\\n memset(visited,false,sizeof(visited));\\n int U=0;\\n for(int i=0;i<N;i++)\\n if(!visited[i])U++,dfs(i,-1);\\n \\n if(B+U<3)return false;\\n \\n queue<int> Q;\\n vector<int> C(N,0);\\n for(int i=0;i<M;i++)\\n if(id!=i)C[ b[i] ]++;\\n for(int i=0;i<N;i++)\\n if(C[i]==0)Q.push(i);\\n int cc=0;\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n if(cc==N)return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si,int pre=-1){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if(e.id==pre)continue;\\n \\n if( rec(e.to,si,e.id) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n\\n map<int,bool> used;\\n for(int i=0;i<M;i++){\\n if(used[a[i]])continue;\\n if(check(i))return true;\\n used[ a[i] ]=true;\\n }\\n \\n used.clear();\\n for(int i=0;i<M;i++){\\n if(used[b[i]])continue;\\n if(check(i))return true;\\n used[ b[i] ]=true;\\n }\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n loope.clear();\\n if( rec(i,i) ){\\n break;\\n }\\n }\\n for(int i=0;i<(int)loope.size();i++){\\n if(check( loope[i].id ))return true;\\n }\\n return false;\\n}\\n\\nbool solve(){\\n if(countB(-1)==M)return false;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n if(solve2())return true;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n for(int i=0;i<M;i++)G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n if(solve2())return true; \\n return false;\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.4852941176470588,\n \"time_ms\": 530,\n \"memory_kb\": 4176,\n \"score_of_the_acc\": -0.7356,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2797_2235248\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 30000\\nstruct edge{ int from,to,id; };\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nvector<edge> bridges;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool check(int id){\\n int B=countB(id);\\n\\n memset(visited,false,sizeof(visited));\\n int U=0;\\n for(int i=0;i<N;i++)\\n if(!visited[i])U++,dfs(i,-1);\\n \\n if(B+U<3)return false;\\n \\n queue<int> Q;\\n vector<int> C(N,0);\\n for(int i=0;i<M;i++)\\n if(id!=i)C[ b[i] ]++;\\n for(int i=0;i<N;i++)\\n if(C[i]==0)Q.push(i);\\n int cc=0;\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n if(cc==N)return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si,int pre=-1){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if(e.id==pre)continue;\\n \\n if( rec(e.to,si,e.id) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n\\n map<int,bool> used;\\n for(int i=0;i<M;i++){\\n if(used[a[i]])continue;\\n if(check(i))return true;\\n used[ a[i] ]=true;\\n }\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n loope.clear();\\n if( rec(i,i) ){\\n break;\\n }\\n }\\n for(int i=0;i<(int)loope.size();i++){\\n if(check( loope[i].id ))return true;\\n }\\n return false;\\n}\\n\\nbool solve(){\\n if(countB(-1)==M)return false;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n if(solve2())return true;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n for(int i=0;i<M;i++)G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n if(solve2())return true; \\n return false;\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.4852941176470588,\n \"time_ms\": 840,\n \"memory_kb\": 4068,\n \"score_of_the_acc\": -0.9823,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2797_2001225\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define all(v) (v).begin(),(v).end()\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\n#define pb push_back\\n#define fi first\\n#define se second\\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\\nnamespace SCC{\\n void visit(const vector<vector<int>>&G,vector<int>&vs,vector<int>&used,int v){\\n used[v]=true;\\n for(auto u:G[v]){\\n if(!used[u])visit(G,vs,used,u);\\n }\\n vs.push_back(v);\\n }\\n\\n void visit2(const vector<vector<int>>&T,vector<int>&used,vector<int>&comp,vector<int>&vec,int k,int v){\\n comp[v]=k;\\n used[v]=true;\\n vec.push_back(v);\\n\\n for(auto u:T[v]){\\n if(!used[u])visit2(T,used,comp,vec,k,u);\\n }\\n }\\n\\n //G:?????£?????????????§£???????????°??????\\n //H:?????£??????????????°??????1???????????????????´?????????°??????\\n //comp:G????????????????????????H?????????????±????????????????\\n void decompose(const vector<vector<int>>&G,vector<vector<int>>&H,vector<int>&comp){\\n vector<vector<int>>T(G.size());\\n for(int i=0;i<G.size();i++){\\n for(auto v:G[i]){\\n T[v].push_back(i);\\n }\\n }\\n comp.resize(G.size());\\n\\n vector<int>vs(G.size());\\n vector<int>used(G.size());\\n for(int i=0;i<G.size();i++){\\n if(!used[i])visit(G,vs,used,i);\\n }\\n reverse(vs.begin(),vs.end());\\n fill(used.begin(),used.end(),0);\\n\\n int K=0;\\n vector<vector<int>>S;\\n for(auto v:vs){\\n if(!used[v]){\\n S.push_back(vector<int>());\\n visit2(T,used,comp,S.back(),K++,v);\\n }\\n }\\n\\n H.resize(K);\\n fill(used.begin(),used.end(),0);\\n for(int i=0;i<K;i++){\\n for(auto v:S[i]){\\n for(auto u:G[v]){\\n if(used[comp[u]]||comp[v]==comp[u])continue;\\n used[comp[u]]=true;\\n H[comp[v]].push_back(comp[u]);\\n }\\n }\\n for(auto v:H[i])used[v]=false;\\n }\\n\\n }\\n}\\n\\nstruct UF{\\n vector<int>par,sz;\\n void init(int n){\\n par.resize(n);\\n sz.resize(n);\\n for(int i=0;i<n;i++){\\n par[i]=i;\\n sz[i]=1;\\n }\\n }\\n int find(int x){\\n return x==par[x]?x:par[x]=find(par[x]);\\n }\\n void unite(int x,int y){\\n x=find(x);y=find(y);\\n if(x==y)return;\\n sz[x]+=sz[y];\\n par[y]=x;\\n }\\n bool same(int x,int y){\\n return find(x)==find(y);\\n }\\n int size(int x){\\n return sz[find(x)];\\n }\\n};\\n\\nvector<vint>G;\\nvector<pair<int, int> > bridge;\\nint ord[1000], low[1000];\\nbool vis[1000];\\n\\nvoid dfs(int v, int p, int &k)\\n{\\n\\tvis[v] = true;\\n\\n\\tord[v] = k++;\\n\\tlow[v] = ord[v];\\n\\n\\tfor (int i = 0; i < G[v].size(); i++){\\n\\t\\tif (!vis[G[v][i]]){\\n\\t\\t\\tdfs(G[v][i], v, k);\\n\\t\\t\\tlow[v] = min(low[v], low[G[v][i]]);\\n\\t\\t\\tif (ord[v] < low[G[v][i]]) bridge.push_back(make_pair(min(v, G[v][i]), max(v, G[v][i])));\\n\\t\\t}\\n\\t\\telse if (G[v][i] != p){\\n\\t\\t\\tlow[v] = min(low[v], ord[G[v][i]]);\\n\\t\\t}\\n\\t}\\n}\\n\\nint A[100000],B[100000];\\n\\nvint T[1000];\\n\\nint N,M;\\nvpint backer;\\nint sum[1000];\\nint par[1000];\\nint dep[1000];\\nvoid dfs2(int v,int p,int d){\\n vis[v]=true;\\n par[v]=p;\\n dep[v]=d;\\n for(auto u:G[v]){\\n if(u==p)continue;\\n if(vis[u])backer.pb(pint(min(u,v),max(u,v)));\\n else{\\n dfs2(u,v,d+1);\\n }\\n }\\n}\\n\\nvoid solve(){\\n G=vector<vint>(N);\\n rep(i,M)G[A[i]].pb(B[i]),G[B[i]].pb(A[i]);\\n memset(vis,0,sizeof(vis));\\n dfs2(0,-1,0);\\n sort(all(backer));backer.erase(unique(all(backer)),backer.end());\\n\\n rep(i,backer.size()){\\n int v=backer[i].fi,u=backer[i].se;\\n while(v!=u){\\n if(dep[v]<dep[u])swap(v,u);\\n sum[v]++;\\n v=par[v];\\n }\\n }\\n\\n rep(i,backer.size()){\\n int v=backer[i].fi,u=backer[i].se;\\n while(v!=u){\\n if(dep[v]<dep[u])swap(v,u);\\n sum[v]--;\\n v=par[v];\\n }\\n int cnt=0;\\n reps(j,1,N)if(sum[j]==0)cnt++;\\n\\n if(cnt>=2){\\n cout<<\\\"YES\\\"<<endl;\\n return;\\n }\\n\\n v=backer[i].fi;u=backer[i].se;\\n while(v!=u){\\n if(dep[v]<dep[u])swap(v,u);\\n sum[v]++;\\n v=par[v];\\n }\\n }\\n cout<<\\\"NO\\\"<<endl;\\n}\\n\\nsigned main(){\\n cin>>N>>M;\\n rep(i,M)cin>>A[i]>>B[i],A[i]--,B[i]--;\\n\\n bool flag=false;\\n int deg[1000]={};\\n {\\n vector<vint>G(N),H;\\n rep(i,M)G[A[i]].pb(B[i]);\\n vint comp;\\n SCC::decompose(G,H,comp);\\n rep(i,M){\\n if(comp[A[i]]==comp[B[i]])deg[B[i]]++;\\n }\\n if(H.size()==N)flag=true;\\n }\\n\\n if(!flag){\\n rep(i,M){\\n if(deg[B[i]]!=1)continue;\\n UF uf;\\n uf.init(N);\\n rep(j,M)if(i!=j)uf.unite(A[j],B[j]);\\n bool ok=true;\\n rep(j,N)if(uf.find(j)!=uf.find(0))ok=false;\\n if(!ok)continue;\\n G=vector<vint>(N);\\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]);\\n vector<vint>H;vint comp;\\n SCC::decompose(G,H,comp);\\n if(H.size()!=N)continue;\\n G=vector<vint>(N);\\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]),G[B[j]].pb(A[j]);\\n memset(vis,0,sizeof(vis));\\n int K=0;\\n bridge.clear();\\n dfs(0,-1,K);\\n if(bridge.size()>=2){\\n cout<<\\\"YES\\\"<<endl;\\n return 0;\\n }\\n }\\n cout<<\\\"NO\\\"<<endl;\\n return 0;\\n }\\n\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.29411764705882354,\n \"time_ms\": 10,\n \"memory_kb\": 3884,\n \"score_of_the_acc\": -0.145,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2797_2001042\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#define rep(i,n) for (int i = 0; i < n; ++i)\\n#define drep(i,n) for (int i = n-1; i >= 0; --i)\\n#define pb push_back\\n#define sz(x) int(x.size())\\n#define mins(x,y) x = min(x,y)\\n#define maxs(x,y) x = max(x,y)\\nusing namespace std;\\ninline int in() { int x; scanf(\\\"%d\\\", &x); return x;}\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\n\\nstruct Lowlink {\\n int n, k;\\n vvi to, st, br;\\n vi ord, low;\\n Lowlink(int n=0):n(n),to(n),st(n),br(n),ord(n,-1),low(n){}\\n void add(int a, int b) {\\n to[a].pb(b); st[a].pb(0);\\n to[b].pb(a); st[b].pb(0);\\n }\\n void dfs(int v, int p=-1) {\\n ord[v] = low[v] = k++;\\n rep(i,sz(to[v])) {\\n int u = to[v][i];\\n if (u == p) continue;\\n if (ord[u] == -1) {\\n st[v][i] = 1;\\n dfs(u,v);\\n mins(low[v],low[u]);\\n } else {\\n st[v][i] = -1;\\n mins(low[v],ord[u]);\\n }\\n }\\n }\\n int init() {\\n k = 0;\\n dfs(0);\\n int res = 0;\\n rep(i,n)rep(j,sz(to[i])) {\\n int v = i, u = to[i][j];\\n if (ord[v] > ord[u]) swap(v,u);\\n if (ord[u] == low[u]) res++;\\n br[i].pb(ord[u] == low[u]);\\n }\\n return res/2;\\n }\\n};\\n\\nint n, m;\\nvvi to;\\nvi used, vs;\\n\\nint rv;\\nbool cfs(vvi& to, int v) {\\n if (used[v]) {\\n if (used[v] == 2) return false;\\n rv = v;\\n return true;\\n }\\n used[v] = 1;\\n for (int u : to[v]) {\\n if (cfs(to,u)) {\\n if (rv != -1) vs.pb(v);\\n if (rv == v) rv = -1;\\n return true;\\n }\\n }\\n used[v] = 2;\\n return false;\\n}\\nbool findCycle(vvi& to) {\\n used = vi(n);\\n rv = -1;\\n rep(i,n) if (!used[i]) {\\n if (cfs(to,i)) return true;\\n }\\n return false;\\n}\\nbool solve1(int u, int v) {\\n // printf(\\\"%d %d\\\\n\\\", v, u);\\n vvi t(n);\\n rep(i,n) for (int j : to[i]) {\\n if (i == v && j == u) continue;\\n t[i].pb(j);\\n // printf(\\\"edge %d %d\\\\n\\\", i, j);\\n }\\n if (findCycle(t)) return false;\\n // printf(\\\"%d %d\\\\n\\\", v, u);\\n Lowlink g(n);\\n rep(i,n) for (int j : to[i]) {\\n if (i == v && j == u) continue;\\n g.add(i,j);\\n }\\n return g.init() >= 2;\\n}\\nbool solve2(Lowlink& g, int ei, int ej) {\\n Lowlink t(n);\\n rep(i,n)rep(j,sz(g.to[i])) {\\n if (ei == i && ej == j) continue;\\n int u = g.to[i][j];\\n if (!g.st[i][j]) continue;\\n if (g.st[i][j] == -1 && i < u) continue;\\n t.add(i,u);\\n }\\n return t.init() >= 2;\\n}\\n\\nint main() {\\n n = in(); m = in();\\n to = vvi(n);\\n rep(i,m) {\\n int a = in(), b = in();\\n --a; --b;\\n to[a].pb(b);\\n }\\n if (findCycle(to)) {\\n int s = sz(vs);\\n rep(i,s) {\\n if (solve1(vs[i],vs[(i+1)%s])) {\\n puts(\\\"YES\\\");\\n return 0;\\n }\\n }\\n } else if (m >= n) {\\n Lowlink g(n);\\n rep(i,n) for (int u : to[i]) g.add(i,u);\\n if (g.init() >= 2) {\\n puts(\\\"YES\\\");\\n return 0;\\n }\\n rep(i,n) rep(j,sz(g.to[i])) {\\n if (g.st[i][j] != 1 || g.br[i][j]) continue;\\n if (solve2(g,i,j)) {\\n puts(\\\"YES\\\");\\n return 0;\\n }\\n }\\n }\\n puts(\\\"NO\\\");\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.0093,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1680,"cells":{"group_id":{"kind":"string","value":"aoj_2794_cpp"},"problem_description":{"kind":"string","value":"D: DAG トリオ / DAG Trio\nこの問題は G: DAG Trio (Hard) と制約のみが異なる同じ設定の問題です。\nプロローグ\n弟は最近「だぐとりお」が欲しいとしきりに呟いています。\n心配になった兄が調べたところ、弟のクラスでは $k$-DAG (有向グラフであって、ある $k$ 個の辺を削除すると、辺の向きを無視したときの連結成分数を $k$ にでき、かつそれら全てが DAG である) が流行っており、\n3-DAG を特に DAG トリオと呼ぶことを突き止めました。\n弟に尊敬されたい兄は、与えられたグラフが DAG トリオかどうかを判別するプログラムを作成することにしました。\n問題文\n$N$ 頂点 $M$ 辺の有向グラフが与えられます。\n各頂点には $1$ から $N$ まで番号が振られています。\n各有向辺には $1$ から $M$ まで番号が振られています。\n有向辺 $i$ は頂点 $a_i$ から $b_i$ に向かいます。\nグラフは連結かつ単純です (辺の向きを無視すると、任意の 2 点間に道があり自己ループと多重辺がありません)。\n与えられたグラフが DAG トリオならば ”YES”、そうでないなら ”NO” を出力してください。\n入力\n$N \\ M$\n$a_1 \\ b_1$\n$a_2 \\ b_2$\n$\\vdots$\n$a_M \\ b_M$\n制約\n$3 \\le N \\le 500$\n$\\max(3, N−1) \\le M \\le 1000$\n$1 \\le a_i, b_i \\le N$\nグラフは辺の向きを無視したときに連結である。\n各 $i$ に対して$a_i \\neq b_i$\n異なる $i, j$ に対して $\\{a_i, b_i\\} \\neq \\{a_j, b_j\\}$\n出力\n”YES” または ”NO” を $1$ 行で出力してください。\nサンプル\nサンプル入力1\n3 3\n1 2\n2 3\n3 1\nサンプル出力1\nYES\nサンプル入力2\n6 7\n1 2\n2 3\n4 3\n4 5\n5 6\n6 4\n3 6\nサンプル出力2\nYES\nサンプル入力3\n7 10\n4 2\n4 7\n4 6\n2 7\n2 5\n2 1\n5 6\n1 3\n6 3\n4 3\nサンプル出力3\nNO\nサンプル入力4\n4 4\n1 2\n3 2\n4 3\n2 4\nサンプル出力4\nYES\nサンプル入力5\n8 9\n5 1\n3 8\n1 2\n4 8\n4 7\n7 5\n6 5\n3 2\n4 2\nサンプル出力5\nYES"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2794_2503049","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define N 1000\n#define V_MAX 1000\nusing namespace std;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\n \n \nclass TSort{\npublic:\n int V;\n vector<set<int> > in,out;\n vector<int> sorted;\n TSort(){V = -1,sorted.push_back(-1);}\n TSort(int V){\n in.resize(V);\n out.resize(V);\n sorted.push_back(-1);\n this->V = V;\n }\n \n void add_edge(int from,int to){\n assert(from < V && to < V);\n assert(out[from].count(to) == 0);\n assert(in[to].count(from) == 0);\n out[from].insert(to);\n in[to].insert(from);\n }\n \n void erase_edge(int from,int to){\n out[from].erase(to);\n in[to].erase(from);\n }\n \n void sort(){\n assert(sorted.size() && sorted[0]==-1 && \"sort method is already invoked\");\n sorted.clear();\n queue<int> Q;\n for(int i=0;i<V;i++)if(in[i].empty()) Q.push(i);\n \n while(!Q.empty()){\n int v = Q.front();Q.pop();\n sorted.push_back(v);\n for(int nx:out[v]){\n if(in[nx].size() == 1) Q.push(nx);\n in[nx].erase(v);\n } \n }\n \n for(int i=0;i<V;i++) if(!in[i].empty()) sorted.clear(); // exist loop\n }\n};\n \n\nclass Bridges{\npublic:\n typedef pair<int,int> P;\n int V; //テ」ツδ偲」ツδシテ」ツδ嘉ヲツ閉ー\n vector <int> G[V_MAX]; //テ」ツつーテ」ツδゥテ」ツδ陛」ツ?ョテゥツ堋」テヲツ篠・テ」ツδェテ」ツつケテ」ツδ暗」ツつ津ィツ。ツィテァツ渉セ\n set <P> bridges; // テヲツゥツ?\n int ord[V_MAX]; //ティツ。ツ古」ツ?催」ツ?凝」ツ?妥ゥツ??」ツつ津」ツ?づ」ツつ湘」ツつ嘉」ツ?凖」ツ??\n int low[V_MAX]; //\n \n Bridges(){V = -1;}\n Bridges(int V){this->V = V;}\n \n void add_edge(int a,int b){\n G[a].push_back(b);\n G[b].push_back(a);\n }\n \n void erase_edge(int a,int b){\n for(int i=0;i<(int)G[a].size();i++) if(G[a][i] == b) {G[a].erase(G[a].begin()+i);break;}\n for(int i=0;i<(int)G[b].size();i++) if(G[b][i] == a) {G[b].erase(G[b].begin()+i);break;}\n }\n \n void dfs(int u, int p, int &c){\n ord[u] = low[u] = c++;\n \n for(int v:G[u]){\n if(v == p)continue;\n if(ord[v] == -1){\n dfs(v,u,c);\n low[u] = min(low[u],low[v]);\n }\n else low[u] = min(low[u], ord[v]);\n if(ord[u] < low[v]) bridges.insert(P(min(u,v),max(u,v)));\n }\n }\n \n void bridge(){\n assert(V >= 0 && \"Set number of node V\");\n bridges.clear();\n int c = 0;\n memset(ord,-1,sizeof(ord));\n memset(low,0,sizeof(low));\n for(int i=0;i<V;i++) if(ord[i]==-1) dfs(i,-1,c);\n }\n \n bool isBridge(int u,int v){return bridges.count(P(u,v)) || bridges.count(P(v,u));}\n};\n \nset<int> G[N];\n \nsigned main(){\n int n,m;\n cin>>n>>m;\n TSort T(n);\n Bridges B(n);\n for(int i=0;i<m;i++){\n int a,b;\n cin>>a>>b;a--,b--;\n T.add_edge(a,b);\n B.add_edge(a,b);\n assert(G[b].count(a)== 0);\n G[a].insert(b);\n }\n \n int ans = 0;\n TSort origin = T;\n for(int from=0;from<n;from++)\n for(int to:G[from]){\n T = origin;\n B.bridge();\n if(B.isBridge(from,to)) continue;\n T.erase_edge(from,to);\n B.erase_edge(from,to);\n \n T.sort();\n B.bridge();\n \n if(T.sorted.size() && (int)B.bridges.size()>=2)ans = 1;\n \n T.add_edge(from,to);\n B.add_edge(from,to);\n }\n cout<<(ans?\"YES\":\"NO\")<<endl;\n \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3588,"score_of_the_acc":-0.3848,"final_rank":9},{"submission_id":"aoj_2794_2503048","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define N 1000\n#define V_MAX 1000\nusing namespace std;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\n \n \nclass TSort{\npublic:\n int V;\n vector<set<int> > in,out;\n vector<int> sorted;\n TSort(){V = -1,sorted.push_back(-1);}\n TSort(int V){\n in.resize(V);\n out.resize(V);\n sorted.push_back(-1);\n this->V = V;\n }\n \n void add_edge(int from,int to){\n assert(from < V && to < V);\n assert(out[from].count(to) == 0);\n assert(in[to].count(from) == 0);\n out[from].insert(to);\n in[to].insert(from);\n }\n \n void erase_edge(int from,int to){\n out[from].erase(to);\n in[to].erase(from);\n }\n \n void sort(){\n assert(sorted.size() && sorted[0]==-1 && \"sort method is already invoked\");\n sorted.clear();\n queue<int> Q;\n for(int i=0;i<V;i++)if(in[i].empty()) Q.push(i);\n \n while(!Q.empty()){\n int v = Q.front();Q.pop();\n sorted.push_back(v);\n for(int nx:out[v]){\n if(in[nx].size() == 1) Q.push(nx);\n in[nx].erase(v);\n } \n }\n \n for(int i=0;i<V;i++) if(!in[i].empty()) sorted.clear(); // exist loop\n }\n};\n \n\nclass Bridges{\npublic:\n typedef pair<int,int> P;\n int V; //???????????°\n vector <int> G[V_MAX]; //??°???????????£??\\??????????????¨???\n set <P> bridges; // ???\n int ord[V_MAX]; //?????????????????????????????????\n int low[V_MAX]; //\n \n Bridges(){V = -1;}\n Bridges(int V){this->V = V;}\n \n void add_edge(int a,int b){\n G[a].push_back(b);\n G[b].push_back(a);\n }\n \n void erase_edge(int a,int b){\n for(int i=0;i<(int)G[a].size();i++) if(G[a][i] == b) {G[a].erase(G[a].begin()+i);break;}\n for(int i=0;i<(int)G[b].size();i++) if(G[b][i] == a) {G[b].erase(G[b].begin()+i);break;}\n }\n \n void dfs(int u, int p, int &c){\n ord[u] = low[u] = c++;\n \n for(int v:G[u]){\n if(v == p)continue;\n if(ord[v] == -1){\n dfs(v,u,c);\n low[u] = min(low[u],low[v]);\n }\n else low[u] = min(low[u], ord[v]);\n if(ord[u] < low[v]) bridges.insert(P(min(u,v),max(u,v)));\n }\n }\n \n void bridge(){\n assert(V >= 0 && \"Set number of node V\");\n bridges.clear();\n int c = 0;\n memset(ord,-1,sizeof(ord));\n memset(low,0,sizeof(low));\n for(int i=0;i<V;i++) if(ord[i]==-1) dfs(i,-1,c);\n }\n \n bool isBridge(int u,int v){return bridges.count(P(u,v)) || bridges.count(P(v,u));}\n};\n \nset<int> G[N];\n \nsigned main(){\n int n,m;\n cin>>n>>m;\n TSort T(n);\n Bridges B(n);\n for(int i=0;i<m;i++){\n int a,b;\n cin>>a>>b;a--,b--;\n T.add_edge(a,b);\n B.add_edge(a,b);\n assert(G[b].count(a)== 0);\n G[a].insert(b);\n }\n \n int ans = 0;\n TSort origin = T;\n for(int from=0;from<n;from++)\n for(int to:G[from]){\n T = origin;\n B.bridge();\n if(B.isBridge(from,to)) continue;\n T.erase_edge(from,to);\n B.erase_edge(from,to);\n \n T.sort();\n B.bridge();\n \n if(T.sorted.size() && (int)B.bridges.size()>=2)ans = 1;\n \n T.add_edge(from,to);\n B.add_edge(from,to);\n }\n cout<<(ans?\"YES\":\"NO\")<<endl;\n \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3584,"score_of_the_acc":-0.3842,"final_rank":8},{"submission_id":"aoj_2794_2238698","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 30000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\nbool flg[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MAX_N];\n\n\nvector<edge> bridges;\n\n\nvector<edge> edge_;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n par[to]=pos;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n edge_.push_back(G[pos][i]);\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n edge_.clear();\n \n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n memset(par,-1,sizeof(par));\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool isDag(int id){\n queue<int> Q; \n vector<int> C(N,0);\n int cc=0;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n C[ b[i] ]++;\n }\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\n\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n return (cc==N);\n}\n\nvoid visit(int v){\n if(visited[v])return;\n visited[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n visit(G[v][i].to);\n }\n}\n\nint calcDec(int id){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n }\n int res=0;\n memset(visited,false,sizeof(visited));\n for(int i=0;i<N;i++){\n if(!visited[i]){\n res++;\n visit(i);\n }\n }\n return res;\n}\n\nmap<int,int> mm;\nbool check(int id){\n if(mm.count(id))return false;\n mm[id]=true;\n \n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if( rec(e.to,si) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n loope.clear();\n if( rec(i,i) )break;\n }\n \n for(int i=0;i<(int)loope.size();i++)\n if(check( loope[i].id ))return true;\n\n return false;\n}\n\nbool solve(){\n int B=countB(-1);\n if(B==M)return false;\n\n for(int i=0;i<M;i++){\n if(check(i)){\n // cout<<\"i=\"<<i<<\" a[i]=\"<<a[i]<<\" b[i]=\"<<b[i]<<endl;\n return true;\n }\n }\n \n if( !isDag(-1) )return solve2();\n\n int maxm=0;\n\n B=countB(-1);\n for(int i=0;i<(int)edge_.size();i++){\n edge e=edge_[i];\n int a=e.from;\n int cc=0;\n while(1){\n if(a==e.to)break;\n if(cnt[a]==1)cc++;\n a=par[a];\n // cout<<\"a=\"<<a<<endl;\n // cout<<\"par[a]=\"<<par[a]<<endl;\n // cout<<e.from<<' '<<e.to<<endl;\n }\n maxm=max(maxm,cc);\n }\n return (B+maxm>=2);\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3260,"score_of_the_acc":-0.3513,"final_rank":4},{"submission_id":"aoj_2794_2235673","code_snippet":"#include <iostream>\n#include <vector>\n#include <stack>\n#include <map>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define vi vector<int>\n#define pb push_back\n\nint unused_from, unused_to;\n\n\n#define MAX_V 100000\nvector<int> G[MAX_V];\nvector<int> Grev[MAX_V];\nbool used[MAX_V]={};\nint ord[MAX_V],lowlink[MAX_V];\nint k=0;\n\nvoid dfs(int v,int prev){ //make ord and lowlink\n used[v] = true;\n ord[v]=lowlink[v]=k;\n k++;\n \n rep(i,Grev[v].size()){\n int to = Grev[v][i];\n if((v==unused_from&&to==unused_to)||(v==unused_to&&to==unused_from))continue;\n if(!used[to]){\n dfs(to,v);\n lowlink[v] = min(lowlink[v],lowlink[to]);\n }\n else if(used[to]&&to!=prev){ //use back edge\n lowlink[v] = min(lowlink[v],ord[to]);\n }\n }\n}\n\nvector<pii> enumerateBridge(int e,vector<pii> edges){ //????????????\n vector<pii> ret;\n \n rep(i,e){\n int a = edges[i].first, b = edges[i].second;\n if((a==unused_from&&b==unused_to)||(a==unused_to&&b==unused_from))continue;\n if(ord[a]>ord[b])swap(a,b);\n if(ord[a]<lowlink[b])ret.pb(pii(edges[i].first,edges[i].second));\n }\n return ret;\n}\n\n\n\nbool hasLoop(int v){\n vector<int> in_deg(v,0);\n rep(i,MAX_V){\n rep(j,G[i].size()){\n int from = i, to = G[i][j];\n if(from==unused_from&&to==unused_to)continue;\n in_deg[to]++;\n }\n }\n \n stack<int> st;\n vector<int> list;\n \n rep(i,v)if(in_deg[i]==0)st.push(i);\n \n while(st.size()){\n int q = st.top();\n st.pop();\n list.pb(q);\n \n rep(i,G[q].size()){\n int to = G[q][i];\n if(q==unused_from&&to==unused_to)continue;\n in_deg[to]--;\n if(in_deg[to]==0)st.push(to);\n }\n }\n \n if(list.size()!=v)return true;\n return false;\n \n}\n\n\nint main(){\n int v,e;\n cin>>v>>e;\n vector<pii> edges;\n \n rep(i,e){\n int a,b;\n cin>>a>>b;\n a--,b--;\n edges.pb(pii(a,b));\n G[a].pb(b);\n Grev[a].pb(b),Grev[b].pb(a);\n }\n \n \n dfs(0,-1);\n vector<pii> bridge_list = enumerateBridge(e,edges);\n map<pii,bool> mp;\n rep(i,bridge_list.size())mp[bridge_list[i]]=true;\n \n \n rep(i,MAX_V){\n rep(j,G[i].size()){\n unused_from = i;\n unused_to = G[i][j];\n \n rep(i,MAX_V)used[i]=false;\n k=0;\n dfs(0,-1);\n vector<pii> brg = enumerateBridge(e,edges);\n \n if( not mp[pii(unused_from,unused_to)] && brg.size()>=2 && not hasLoop(v)){\n // cout<<unused_from+1<<\" \"<<unused_to+1<<endl; //1????????????????????????????????????\n cout<<\"YES\"<<endl;\n return 0;\n }\n }\n }\n cout<<\"NO\"<<endl;\n}","accuracy":1,"time_ms":100,"memory_kb":8060,"score_of_the_acc":-1.1343,"final_rank":11},{"submission_id":"aoj_2794_2235242","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 30000\nstruct edge{ int from,to,id; };\nint N,M;\nint a[MAX_M],b[MAX_M];\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nvector<edge> bridges;\n\nvoid dfs(int pos,int prev){\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n if(to==prev)continue;\n if(!visited[to]){\n depth[to]=depth[pos]+1;\n dfs(to,pos);\n cnt[pos]+=cnt[to];\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\n }else if(depth[to]<depth[pos]){\n cnt[pos]++;\n cnt[to]--;\n }\n }\n}\n\nint countB(int id){\n bridges.clear();\n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n memset(cnt,0,sizeof(cnt));\n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++){\n if(i==id)continue;\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\n }\n for(int i=0;i<N;i++){\n if(visited[i])continue;\n dfs(i,-1);\n }\n return bridges.size();\n}\n\nbool check(int id){\n int B=countB(id);\n\n memset(visited,false,sizeof(visited));\n int U=0;\n for(int i=0;i<N;i++)\n if(!visited[i])U++,dfs(i,-1);\n \n if(B+U<3)return false;\n \n queue<int> Q;\n vector<int> C(N,0);\n for(int i=0;i<M;i++)\n if(id!=i)C[ b[i] ]++;\n for(int i=0;i<N;i++)\n if(C[i]==0)Q.push(i);\n int cc=0;\n while(!Q.empty()){\n int pos=Q.front();Q.pop();\n cc++;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i].to;\n C[to]--;\n if(C[to]==0)Q.push(to);\n }\n }\n if(cc==N)return true;\n else return false;\n}\n\nvector<edge> loope;\nbool rec(int pos,int si,int pre=-1){\n if(visited[pos])return (pos==si);\n visited[pos]=true;\n for(int i=0;i<(int)G[pos].size();i++){\n edge e=G[pos][i];\n if(e.id==pre)continue;\n \n if( rec(e.to,si,e.id) ){\n loope.push_back(e);\n return true;\n }\n }\n return false;\n}\n\nbool solve2(){\n\n for(int i=0;i<M;i++){\n if(check(i))return true;\n }\n \n for(int i=0;i<N;i++){\n memset(visited,false,sizeof(visited));\n memset(depth,0,sizeof(depth));\n loope.clear();\n if( rec(i,i) ){\n break;\n }\n }\n for(int i=0;i<(int)loope.size();i++){\n if(check( loope[i].id ))return true;\n }\n return false;\n}\n\nbool solve(){\n if(countB(-1)==M)return false;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n if(solve2())return true;\n \n for(int i=0;i<N;i++)G[i].clear();\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\n for(int i=0;i<M;i++)G[ b[i] ].push_back( (edge){b[i],a[i],i} );\n if(solve2())return true; \n return false;\n}\n\nint main(){\n cin>>N>>M;\n for(int i=0;i<M;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n cout<< ( solve() ? \"YES\" : \"NO\" ) <<endl;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3248,"score_of_the_acc":-0.3645,"final_rank":6},{"submission_id":"aoj_2794_2006752","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\n\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++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define printV(v) for(auto&& x : v){cout << x << \" \";} cout << endl\n#define printVV(vv) for(auto&& v : vv){for(auto&& x : v){cout << x << \" \";}cout << endl;}\n#define printP(p) cout << p.first << \" \" << p.second << endl\n#define printVP(vp) for(auto&& p : vp) printP(p);\n\ntypedef long long ll;\ntypedef pair<int, int> Pii;\ntypedef tuple<int, int, int> TUPLE;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<Pii> vp;\nconst int inf = 1e9;\nconst int mod = 1e9 + 7;\n\ntypedef vector<vector<int>> Graph;\ntypedef pair<int, int> Edge; // (a < b: undirected)\n\nclass BICC {\nprivate:\n const int n;\n\npublic:\n Graph G;\n vi depth;\n vi par;\n map<Edge, int> imosEdge;\n map<Edge, int> EdgeType;\n enum {UNUSED, USED_DFS, BRIDGE};\n vector<Edge> bridges;\n\n\tvi cmp;\n\tint num_cc;\n\tvi size_of_vertex;\n\tGraph G_cc;\npublic:\n BICC(int _n) : n(_n), G(_n), depth(_n, -1), par(_n, -1), cmp(_n, -1), num_cc(0) {}\n Edge getEdge(int a, int b) {\n if (a > b) swap(a, b);\n return Edge(a, b);\n }\n void updateEdgeType(int a, int b, int type) {\n if (a < 0 || b < 0) return;\n EdgeType[getEdge(a, b)] = type;\n }\n void addEdge(int a, int b) {\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n updateEdgeType(a, b, UNUSED);\n }\n void dfsTreeConstruct(int v, int pre) {\n if (depth[v] != -1) return;\n depth[v] = (pre == -1 ? 0 : depth[pre] + 1);\n par[v] = pre;\n updateEdgeType(pre, v, USED_DFS);\n for (auto&& nxt : G[v]) {\n if (nxt != pre) dfsTreeConstruct(nxt, v);\n }\n }\n void updateImos(int a, int b) {\n if (depth[a] < depth[b]) swap(a, b);\n\n if (par[a] != -1) {\n imosEdge[getEdge(a, par[a])]++;\n }\n if (par[b] != -1) {\n imosEdge[getEdge(b, par[b])]--;\n }\n }\n int imosFinal(int v, int pre) {\n int t = 0;\n for (auto&& nxt : G[v]) {\n if (nxt != pre && EdgeType[getEdge(nxt, v)] == USED_DFS) {\n t += imosFinal(nxt, v);\n }\n }\n if (pre != -1) imosEdge[getEdge(v, pre)] += t;\n return pre == -1 ? 0 : imosEdge[getEdge(v, pre)];\n }\n int extractCC(int v, int color) {\n \tif (cmp[v] != -1) return 0;\n \tcmp[v] = color;\n \tint t = 1;\n \tfor (auto&& nxt : G[v]) {\n \t\tif (EdgeType[getEdge(v, nxt)] != BRIDGE) {\n \t\t\tt += extractCC(nxt, color);\n \t\t}\n \t}\n \treturn t;\n }\n void bicc() {\n dfsTreeConstruct(0, -1);\n for (auto&& p : EdgeType) {\n Edge e;\n int type;\n tie(e, type) = p;\n if (type == UNUSED) {\n updateImos(e.first, e.second);\n }\n }\n imosFinal(0, -1);\n for (auto&& p : EdgeType) {\n Edge e;\n int type;\n tie(e, type) = p;\n if (type == USED_DFS) {\n if (imosEdge[e] == 0) {\n EdgeType[e] = BRIDGE;\n bridges.emplace_back(e);\n }\n }\n }\n\n\t\trep(i, n) {\n\t\t\tint size_cc = extractCC(i, num_cc);\n\t\t\tif (size_cc > 0) {\n\t\t\t\tsize_of_vertex.emplace_back(size_cc);\n\t\t\t\tnum_cc++;\n\t\t\t}\n\t\t}\n\n\t \tvector<set<int>> G_cc_st(num_cc);\n\t\tfor (auto&& p : EdgeType) {\n Edge e;\n int type;\n tie(e, type) = p;\n if (type == BRIDGE) {\n\t\t\t\tG_cc_st[cmp[e.first]].insert(cmp[e.second]);\n\t\t\t\tG_cc_st[cmp[e.second]].insert(cmp[e.first]);\n }\n }\n\n\t\trep(i, num_cc) {\n\t\t\tG_cc.emplace_back(vector<int>(all(G_cc_st[i])));\n\t\t}\n }\n vector<Edge> getBridges() {\n return bridges;\n }\n};\n\n\n// false: \"contains cycle\"\nbool dfs(int now, int start, const Graph &G, vector<bool> &visited) {\n visited[now] = true;\n for (auto nxt : G[now]) {\n if (nxt == start) return false;\n if (!visited[nxt] && !dfs(nxt, start, G, visited)) return false;\n }\n return true;\n}\n\nbool isDAG(const Graph &G) {\n int n = G.size();\n rep(i, n) {\n vector<bool> visited(n);\n if (!dfs(i, i, G, visited)) return false;\n }\n return true;\n}\n\nvoid dfs2(int v, int pre, const Graph& G, vector<bool>& visited) {\n if (visited[v]) return;\n visited[v] = true;\n for (auto nxt : G[v]) {\n if (v == pre) continue;\n dfs2(nxt, v, G, visited);\n }\n}\n\nbool isConnected(const Graph& G) {\n int n = G.size();\n vector<bool> visited(n);\n dfs2(0, -1, G, visited);\n rep(i, n) {\n if (!visited[i]) return false;\n }\n return true;\n}\n\nsigned main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int N, M;\n cin >> N >> M;\n vector<pair<int, int>> edges;\n rep(i, M) {\n int a, b;\n cin >> a >> b;\n a--, b--;\n edges.emplace_back(a, b);\n }\n\n rep(i, M) {\n BICC bicc(N);\n Graph G_dir(N);\n rep(j, M) {\n if (j == i) continue;\n bicc.addEdge(edges[j].first, edges[j].second);\n G_dir[edges[j].first].emplace_back(edges[j].second);\n }\n\n // ??????????????????????????¨????????°??????????????£??????????????????????????????\n if (!isConnected(bicc.G)) {\n continue;\n }\n\n bicc.bicc();\n\n if (bicc.num_cc >= 3 && isDAG(G_dir)) {\n cout << \"YES\" << endl;\n return 0;\n }\n }\n\n cout << \"NO\" << endl;\n}","accuracy":1,"time_ms":680,"memory_kb":3404,"score_of_the_acc":-1.3129,"final_rank":12},{"submission_id":"aoj_2794_2004764","code_snippet":"#define _USE_MATH_DEFINES\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <complex>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <limits>\n#include <climits>\n#include <cfloat>\n#include <functional>\nusing namespace std;\n\nbool topologicalSort(const vector<vector<int> >& edges, vector<int>& node)\n{\n int n = edges.size();\n node.resize(n);\n\n vector<int> restEdges(n, 0);\n for(int i=0; i<n; ++i){\n for(unsigned j=0; j<edges[i].size(); ++j){\n ++ restEdges[edges[i][j]];\n }\n }\n\n int restNodes = n;\n queue<int> q;\n for(int i=0; i<n; ++i){\n if(restEdges[i] == 0){\n node[n-restNodes] = i;\n q.push(i);\n -- restNodes;\n }\n }\n\n while(restNodes > 0){\n if(q.empty()){\n node.clear();\n return false;\n }\n int i = q.front();\n q.pop();\n\n for(unsigned j=0; j<edges[i].size(); ++j){\n int k = edges[i][j];\n -- restEdges[k];\n if(restEdges[k] == 0){\n node[n-restNodes] = k;\n q.push(k);\n -- restNodes;\n }\n }\n }\n\n return true;\n}\n\nbool isBridge(const vector<vector<int> >& edges, int a, int b)\n{\n int n = edges.size();\n queue<int> q;\n vector<bool> check(n, false);\n q.push(a);\n check[a] = true;\n while(!q.empty()){\n int x = q.front();\n q.pop();\n for(int y : edges[x]){\n if(!(x == a && y == b) && !check[y]){\n q.push(y);\n check[y] = true;\n }\n }\n }\n return !check[b];\n}\n\nvoid bridgeDecomposition(const vector<vector<int> >& edges, vector<int>& indexConvert,\n vector<vector<int> >& nodesOut, vector<vector<int> >& edgesOut)\n{\n const int n = edges.size();\n vector<int> num(n, -1), low(n, -1);\n vector<bool> isStk(n, false);\n stack<int> stk;\n int cnt = -1;\n nodesOut.clear();\n\n for(int i=0; i<n; ++i){\n stack<tuple<int, int, unsigned> > arg;\n arg.push(make_tuple(i, -1, 0));\n\n while(!arg.empty()){\n int v = get<0>(arg.top());\n int prev = get<1>(arg.top());\n unsigned j = get<2>(arg.top());\n arg.pop();\n\n if(j == 0){\n if(num[v] != -1)\n continue;\n num[v] = low[v] = ++ cnt;\n stk.push(v);\n isStk[v] = true;\n }\n else{\n int w = edges[v][j-1];\n if(w != prev && isStk[w])\n low[v] = min(low[v], low[w]);\n }\n\n if(j < edges[v].size()){\n arg.push(make_tuple(v, prev, j + 1));\n int w = edges[v][j];\n if(w != prev)\n arg.push(make_tuple(w, v, 0));\n }\n else if(low[v] == num[v]){\n nodesOut.push_back(vector<int>());\n for(;;){\n int w = stk.top();\n stk.pop();\n isStk[w] = false;\n nodesOut.back().push_back(w);\n if(v == w)\n break;\n }\n }\n }\n }\n\n const int m = nodesOut.size();\n indexConvert.resize(n);\n for(int i=0; i<m; ++i){\n for(unsigned j=0; j<nodesOut[i].size(); ++j)\n indexConvert[nodesOut[i][j]] = i;\n }\n edgesOut.assign(m, vector<int>());\n vector<set<int> > used(m);\n for(int i=0; i<n; ++i){\n for(unsigned j=0; j<edges[i].size(); ++j){\n int v = indexConvert[i];\n int w = indexConvert[edges[i][j]];\n if(v != w && used[v].find(w) == used[v].end()){\n edgesOut[v].push_back(w);\n used[v].insert(w);\n }\n }\n }\n}\n\nint main()\n{\n int n, m;\n cin >> n >> m;\n vector<vector<int> > edges(n), directedEdges(n);\n for(int i=0; i<m; ++i){\n int a, b;\n cin >> a >> b;\n -- a;\n -- b;\n edges[a].push_back(b);\n edges[b].push_back(a);\n directedEdges[a].push_back(b);\n }\n\n for(int a=0; a<n; ++a){\n for(unsigned i=0; i<directedEdges[a].size(); ++i){\n int b = directedEdges[a][i];\n if(isBridge(edges, a, b))\n continue;\n\n vector<vector<int> > directEdges2 = directedEdges;\n directEdges2[a].erase(find(directEdges2[a].begin(), directEdges2[a].end(), b));\n vector<int> tmp;\n if(!topologicalSort(directEdges2, tmp))\n continue;\n\n vector<vector<int> > edges2 = edges;\n edges2[a].erase(find(edges2[a].begin(), edges2[a].end(), b));\n edges2[b].erase(find(edges2[b].begin(), edges2[b].end(), a));\n vector<int> tmp1;\n vector<vector<int> > nodes, tmp2;\n bridgeDecomposition(edges2, tmp1, nodes, tmp2);\n\n if(nodes.size() >= 3){\n cout << \"YES\" << endl;\n return 0;\n }\n }\n }\n\n cout << \"NO\" << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3208,"score_of_the_acc":-0.2989,"final_rank":3},{"submission_id":"aoj_2794_2001281","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nconst int MAX = 555;\nint N ,M, V;\nvector<int> G[MAX];\nvector<int> rG[MAX];\nbool used[MAX];\nint cmp[MAX];\nvector<int> vs;\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 = vs.size() - 1 ; i >= 0 ; i--){\n if(!used[vs[i]]) rdfs(vs[i],k++);\n }\n return k;\n}\n\nint ord[MAX], low[MAX];\nstruct edgeB{\n int u,v;\n};\n \nvoid dfs(int u, int pre, int &c, vector<int> G[], vector<edgeB> &B){\n ord[u] = low[u] = c++;\n for(int i=0;i<(int)G[u].size();i++){\n int v = G[u][i];\n if(v != pre){\n if(ord[v] == -1){\n dfs(v,u,c,G,B);\n low[u] = min(low[u],low[v]);\n }\n else{\n low[u] = min(low[u],ord[v]);\n }\n if(ord[u] < low[v]) B.push_back((edgeB){u,v});\n }\n }\n}\n \nvoid bridge(int n, vector<int> G[], vector<edgeB> &B){\n B.clear();\n int c = 0;\n fill(ord,ord+n,-1);\n for(int i=0;i<n;i++) if(ord[i]==-1) dfs(i,-1,c,G,B);\n}\n\n\nint A[1111],B[1111];\n\nvoid make_graph(int x){\n for(int i=0;i<N;i++) G[i].clear();\n for(int i=0;i<N;i++) rG[i].clear();\n for(int i=0;i<M;i++){\n if( i == x ) continue;\n add_edge( A[i], B[i] );\n }\n}\n\nvoid make_graph2(int x){\n for(int i=0;i<N;i++) G[i].clear();\n for(int i=0;i<M;i++){\n if( i == x ) continue;\n G[A[i]].push_back( B[i] );\n G[B[i]].push_back( A[i] );\n }\n}\n\nint main(){\n cin >> N >> M; \n V = N;\n for(int i=0;i<M;i++){\n cin >> A[i] >> B[i]; --A[i]; --B[i];\n }\n if( N == 3 ){\n cout << \"YES\" << endl; return 0;\n } else if( M == N-1 ){\n cout << \"NO\" << endl; return 0;\n }\n \n for(int i=0;i<M;i++){\n make_graph(i);\n int n = scc();\n if( n == N ){\n make_graph2(i);\n vector<edgeB> E;\n bridge( N, G, E );\n if( E.size() >= 2 ) {\n\tcout << \"YES\" << endl; return 0;\n }\n }\n }\n cout << \"NO\" << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":1284,"score_of_the_acc":-0.0149,"final_rank":1},{"submission_id":"aoj_2794_2001187","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef pair<int, int> pii;\ntypedef long long ll;\ntypedef vector<int> vi;\n\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define fi first\n#define se second\n#define rep(i,n) rep2(i,0,n)\n#define rep2(i,m,n) for(int i=m;i<(n);i++)\n#define ALL(c) (c).begin(),(c).end()\n\nclass unionfind {\n\tvector<int> par, rank;\n\npublic:\n\tvoid init(int n) {\n\t\tpar.resize(n);\n\t\trank.resize(n);\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tpar[i] = i;\n\t\t\trank[i] = 0;\n\t\t}\n\t}\n\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\n\tvoid unite(int x, int y) {\n\t\tx = find(x);\n\t\ty = find(y);\n\t\tif (x == y) return ;\n\n\t\tif (rank[x] < rank[y]) par[x] = y;\n\t\telse {\n\t\t\tpar[y] = x;\n\t\t\tif (rank[x] == rank[y]) ++rank[x];\n\t\t}\n\t}\n\n\tbool same(int x, int y) { return (find(x) == find(y)); }\n} uf;\n\n#define MAX_V 510\n\nint V;\nvector<int> G[MAX_V], rG[MAX_V];\nvector<int> vs; \n\nbool vis[MAX_V];\nint cmp[MAX_V]; \n\nvoid add_edge(int from, int to)\n{\n\tG[from].pb(to);\n\trG[to].pb(from);\n}\n\nvoid dfs(int v)\n{\n\tvis[v] = true;\n\n\tfor (int to : G[v]) {\n\t\tif (!vis[to]) dfs(to);\n\t}\n\n\tvs.push_back(v);\n}\n\nvoid rdfs(int v, int k)\n{\n\tvis[v] = true;\n\tcmp[v] = k;\n\n\tfor (int to : rG[v]) {\n\t\tif (!vis[to]) rdfs(to, k);\n\t}\n}\n\nint scc()\n{\n\tmemset(vis, 0, sizeof(vis));\n\tvs.clear();\n\n\trep(v, V) if (!vis[v]) dfs(v);\n\n\tmemset(vis, 0, sizeof(vis));\n\n\tint k = 0;\n\treverse(ALL(vs));\n\n\tfor (int v : vs) {\n\t\tif (!vis[v]) rdfs(v, k++);\n\t}\n\n\treturn k;\n}\n\nclass LOWLINK {\npublic:\n\tint V;\n\tvector<int> G[510];\n\tvector<pair<int, int> > bridge;\n\tint ord[510], low[510];\n\tbool vis[510];\n\tbool not1[510];\n\n\tvoid init(int _V)\n\t{\n\t\tV = _V;\n\t\tmemset(vis, 0, sizeof(vis));\n\t\tmemset(not1, 0, sizeof(not1));\n\t\trep(i, V) G[i].clear();\n\t\tbridge.clear();\n\t}\n\n\tvoid calc()\n\t{\n\t\tint k = 0;\n\t\trep(i, V) if (!vis[i]) DFS(i, -1, k);\n\n\t}\n\n\tvoid add_edge(int a, int b)\n\t{\n\t\tG[a].pb(b); G[b].pb(a);\n\t}\n\n\tvoid DFS(int v, int p, int &k)\n\t{\n\t\tvis[v] = true;\n\n\t\tord[v] = k++;\n\t\tlow[v] = ord[v];\n\n\t\tbool isArticulation = false;\n\t\tint ct = 0;\n\n\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\tif (!vis[G[v][i]]) {\n\t\t\t\tct++;\n\t\t\t\tDFS(G[v][i], v, k);\n\t\t\t\tlow[v] = min(low[v], low[G[v][i]]);\n\t\t\t\tif (ord[v] < low[G[v][i]]) {\n\t\t\t\t\tbridge.push_back(make_pair(min(v, G[v][i]), max(v, G[v][i])));\n\t\t\t\t} else {\n\t\t\t\t\tnot1[v] = not1[G[v][i]] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (G[v][i] != p) {\n\t\t\t\tlow[v] = min(low[v], ord[G[v][i]]);\n\t\t\t}\n\t\t}\n\t}\n} T;\n\nint N, M;\nint A[50010], B[50010];\nint in[510];\n\nint main() {\n\tscanf(\"%d %d\", &N, &M);\n\n\tV = N;\n\n\trep(i, M) {\n\t\tscanf(\"%d%d\", &A[i], &B[i]);\n\t\t--A[i]; --B[i];\n\t\t//add_edge(A[i], B[i]);\n\t}\n\n\trep(i, M) {\n\t\tT.init(N);\n\t\trep(j, N) {\n\t\t\tG[j].clear();\n\t\t\trG[j].clear();\n\t\t}\n\n\t\trep(j, M) if (j != i) {\n\t\t\tadd_edge(A[j], B[j]);\n\t\t\tT.add_edge(A[j],B[j]);\n\t\t\tT.add_edge(B[j],A[j]);\n\t\t}\n\n\t\tint now = scc();\n\t\tuf.init(N);\n\n\t\tbool ok = 1;\n\n\t\trep(j, N) {\n\t\t\tfor (int to : G[j]) {\n\t\t\t\tif (cmp[j] == cmp[to]) {\n\t\t\t\t\tok = 0;\n\t\t\t\t}\n\t\t\t\tuf.unite(j, to);\n\t\t\t}\n\t\t}\n\n\t\trep(j, N) {\n\t\t\tif (!uf.same(0,j)) ok=0;\n\t\t}\n\t\tT.calc();\n\n\t\tif (ok && T.bridge.size() >= 2) {\n\t\t\tputs(\"YES\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\tputs(\"NO\");\n\treturn 0;\n\n\tint num = scc();\n\n\tif (num == N) {\n\t\tputs(\"CASE1\");\n\t\tT.init(N);\n\n\t\trep(i, M) {\n\t\t\tT.add_edge(A[i], B[i]);\n\t\t\tT.add_edge(B[i], A[i]);\n\t\t}\n\t\tT.calc();\n\n\t\tcout<<T.bridge.size()<<endl;\n\n\t\tbool size_3 = 0;\n\t\trep(i, N) if (T.not1[i]) size_3 = 1;\n\t\tif (size_3 && T.bridge.size() >= 2) {\n\t\t\tputs(\"YES\");\n\t\t} else {\n\t\t\tputs(\"NO\");\n\t\t}\n\t} else {\n\t\tputs(\"CASE2\");\n\t\tmemset(in, -1, sizeof(in));\n\n\t\tvi cand;\n\t\tint id = -1;\n\t\trep(i, N) cout << cmp[i] << endl;\n\t\trep(i, M) {\n\t\t\tif (cmp[A[i]] == cmp[B[i]]) {\n\t\t\t\tif (in[B[i]] != -1 || (id != -1 && cmp[A[i]] != id)) {\n\t\t\t\t\tputs(\"NO\");\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\n\t\t\t\tid = cmp[A[i]];\n\t\t\t\tin[B[i]] = A[i];\n\t\t\t\tcand.pb(A[i]);\n\t\t\t}\n\t\t}\n\t\tcout<<cand.size()<<endl;\n\n\t\tif (num - 1 + (int)cand.size() != N) {\n\t\t\tputs(\"NO\");\n\t\t\treturn 0;\n\t\t}\n\n\t\tputs(\"DEB\");\n\t\tfor (int v : cand) {\n\t\t\tT.init(N);\n\t\t\trep(i, M) {\n\t\t\t\tif (!(A[i] == in[v] && B[i] == v)) {\n\t\t\t\t\tT.add_edge(A[i], B[i]);\n\t\t\t\t\tT.add_edge(B[i], A[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tT.calc();\n\t\t\tif ((int)T.bridge.size() >= 2) {\n\t\t\t\tputs(\"YES\");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\n\t\tputs(\"NO\");\n\t\treturn 0;\n\t}\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3336,"score_of_the_acc":-0.3625,"final_rank":5},{"submission_id":"aoj_2794_2001159","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\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\nnamespace SCC{\n void visit(const vector<vector<int>>&G,vector<int>&vs,vector<int>&used,int v){\n used[v]=true;\n for(auto u:G[v]){\n if(!used[u])visit(G,vs,used,u);\n }\n vs.push_back(v);\n }\n\n void visit2(const vector<vector<int>>&T,vector<int>&used,vector<int>&comp,vector<int>&vec,int k,int v){\n comp[v]=k;\n used[v]=true;\n vec.push_back(v);\n\n for(auto u:T[v]){\n if(!used[u])visit2(T,used,comp,vec,k,u);\n }\n }\n\n //G:?????£?????????????§£???????????°??????\n //H:?????£??????????????°??????1???????????????????´?????????°??????\n //comp:G????????????????????????H?????????????±????????????????\n void decompose(const vector<vector<int>>&G,vector<vector<int>>&H,vector<int>&comp){\n vector<vector<int>>T(G.size());\n for(int i=0;i<G.size();i++){\n for(auto v:G[i]){\n T[v].push_back(i);\n }\n }\n comp.resize(G.size());\n\n vector<int>vs(G.size());\n vector<int>used(G.size());\n for(int i=0;i<G.size();i++){\n if(!used[i])visit(G,vs,used,i);\n }\n reverse(vs.begin(),vs.end());\n fill(used.begin(),used.end(),0);\n\n int K=0;\n vector<vector<int>>S;\n for(auto v:vs){\n if(!used[v]){\n S.push_back(vector<int>());\n visit2(T,used,comp,S.back(),K++,v);\n }\n }\n\n H.resize(K);\n fill(used.begin(),used.end(),0);\n for(int i=0;i<K;i++){\n for(auto v:S[i]){\n for(auto u:G[v]){\n if(used[comp[u]]||comp[v]==comp[u])continue;\n used[comp[u]]=true;\n H[comp[v]].push_back(comp[u]);\n }\n }\n for(auto v:H[i])used[v]=false;\n }\n\n }\n}\n\nstruct UF{\n vector<int>par,sz;\n void init(int n){\n par.resize(n);\n sz.resize(n);\n for(int i=0;i<n;i++){\n par[i]=i;\n sz[i]=1;\n }\n }\n int find(int x){\n return x==par[x]?x:par[x]=find(par[x]);\n }\n void unite(int x,int y){\n x=find(x);y=find(y);\n if(x==y)return;\n sz[x]+=sz[y];\n par[y]=x;\n }\n bool same(int x,int y){\n return find(x)==find(y);\n }\n int size(int x){\n return sz[find(x)];\n }\n};\n\nvector<vint>G;\nvector<pair<int, int> > bridge;\nint ord[1000], low[1000];\nbool vis[1000];\n\nvoid dfs(int v, int p, int &k)\n{\n\tvis[v] = true;\n\n\tord[v] = k++;\n\tlow[v] = ord[v];\n\n\tfor (int i = 0; i < G[v].size(); i++){\n\t\tif (!vis[G[v][i]]){\n\t\t\tdfs(G[v][i], v, k);\n\t\t\tlow[v] = min(low[v], low[G[v][i]]);\n\t\t\tif (ord[v] < low[G[v][i]]) bridge.push_back(make_pair(min(v, G[v][i]), max(v, G[v][i])));\n\t\t}\n\t\telse if (G[v][i] != p){\n\t\t\tlow[v] = min(low[v], ord[G[v][i]]);\n\t\t}\n\t}\n}\n\nint A[100000],B[100000];\n\nsigned main(){\n int N,M;\n cin>>N>>M;\n rep(i,M)cin>>A[i]>>B[i],A[i]--,B[i]--;\n\n bool flag=false;\n int deg[1000]={};\n {\n vector<vint>G(N),H;\n rep(i,M)G[A[i]].pb(B[i]);\n vint comp;\n SCC::decompose(G,H,comp);\n rep(i,M){\n if(comp[A[i]]==comp[B[i]])deg[B[i]]++;\n }\n if(H.size()==N)flag=true;\n }\n\n if(!flag){\n rep(i,M){\n if(deg[B[i]]!=1)continue;\n UF uf;\n uf.init(N);\n rep(j,M)if(i!=j)uf.unite(A[j],B[j]);\n bool ok=true;\n rep(j,N)if(uf.find(j)!=uf.find(0))ok=false;\n if(!ok)continue;\n G=vector<vint>(N);\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]);\n vector<vint>H;vint comp;\n SCC::decompose(G,H,comp);\n if(H.size()!=N)continue;\n G=vector<vint>(N);\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]),G[B[j]].pb(A[j]);\n memset(vis,0,sizeof(vis));\n int K=0;\n bridge.clear();\n dfs(0,-1,K);\n if(bridge.size()>=2){\n cout<<\"YES\"<<endl;\n return 0;\n }\n }\n cout<<\"NO\"<<endl;\n return 0;\n }\n else{\n rep(i,M){\n UF uf;\n uf.init(N);\n rep(j,M)if(i!=j)uf.unite(A[j],B[j]);\n bool ok=true;\n rep(j,N)if(uf.find(j)!=uf.find(0))ok=false;\n if(!ok)continue;\n G=vector<vint>(N);\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]);\n vector<vint>H;vint comp;\n SCC::decompose(G,H,comp);\n if(H.size()!=N)continue;\n G=vector<vint>(N);\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]),G[B[j]].pb(A[j]);\n memset(vis,0,sizeof(vis));\n int K=0;\n bridge.clear();\n dfs(0,-1,K);\n if(bridge.size()>=2){\n cout<<\"YES\"<<endl;\n return 0;\n }\n }\n cout<<\"NO\"<<endl;\n return 0;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3272,"score_of_the_acc":-0.2934,"final_rank":2},{"submission_id":"aoj_2794_2001136","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define for_(i,a,b) for(int i=(a);i<(b);++i)\n#define for_rev(i,a,b) for(int i=(a);i>=(b);--i)\n#define allof(a) (a).begin(),(a).end()\n#define minit(a,b) memset(a,b,sizeof(a))\n#define size_of(a) int((a).size())\n#define cauto const auto\n\ntypedef pair< int, int > pii;\ntemplate< typename T > using Vec = vector< T >;\n\nclass StronglyConnectedComponentDecomposition {\npublic:\n\tstruct Result {\n\t\tVec< int > topol;\n\t\tVec< Vec< int > > dag;\n\t};\n\t\nprivate:\n\tint N;\n\tconst Vec< Vec< int > >& adj;\n\tVec< Vec< int > > rev_adj;\n\t\n\tVec< int > rev_order;\n\tVec< bool > used;\t\n\tVec< int > topol;\n\t\n\tvoid dfs(int v) {\n\t\tused[v] = true;\n\t\tfor (int u : adj[v]) if (!used[u]) dfs(u);\n\t\trev_order.push_back(v);\n\t}\n\t\n\tvoid revDfs(int v, int k) {\n\t\tused[v] = true;\n\t\ttopol[v] = k;\n\t\tfor (int u : rev_adj[v]) if (!used[u]) revDfs(u, k);\n\t}\n\t\npublic:\n\tStronglyConnectedComponentDecomposition(const Vec< Vec< int > >& _adj_) : N(_adj_.size()), adj(_adj_) {\n\t\trev_adj.assign(N, Vec< int >());\n\t\tfor_(v,0,N) for (int u : adj[v]) rev_adj[u].push_back(v);\n\t}\n\t\n\tResult decomposition() {\n\t\tused.assign(N, false);\n\t\trev_order.clear();\n\t\ttopol.assign(N, -1);\n\t\t\n\t\tfor_(v,0,N) if (!used[v]) dfs(v);\n\t\t\n\t\tfill(allof(used), false);\n\t\t\n\t\tint k = 0, m = rev_order.size();\n\t\t\n\t\tfor_rev(i,m-1,0) {\n\t\t\tint v = rev_order[i];\n\t\t\tif (!used[v]) revDfs(v, k++);\n\t\t}\n\t\t\n\t\tVec< Vec< int > > dag(k);\n\t\t\n\t\tfor_(v,0,N) {\n\t\t\tint tv = topol[v];\n\t\t\t\n\t\t\tfor (int u : adj[v]) {\n\t\t\t\tint tu = topol[u];\n\t\t\t\tif (tv != tu) dag[tv].push_back(tu);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor_(i,0,k) {\n\t\t\tsort(allof(dag[i]));\n\t\t\tdag[i].erase(unique(allof(dag[i])), dag[i].end());\n\t\t}\n\t\t\n\t\treturn Result{ topol, dag };\n\t}\n};\n\nclass FindBridge {\nprivate:\n\tint V;\n\tVec< set< int > > adj;\n\t\n\tVec< int > low, pre;\n\tVec< bool > vis;\n\t\n\tint dfs(int v, int& count, int p, Vec< pii >& br) {\n\t\tpre[v] = count++;\n\t\tlow[v] = pre[v];\n\t\tvis[v] = true;\n\t\t\n\t\tfor (int u : adj[v]) {\n\t\t\tif (pre[u] == -1) {\n\t\t\t\tlow[v] = min(low[v], dfs(u, count, v, br));\n\t\t\t\tif (low[u] == pre[u]) br.push_back(pii(v, u));\n\t\t\t} else {\n\t\t\t\tif (u != p) low[v] = min(low[v], low[u]);\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn low[v];\n\t}\n\t\npublic:\n\tFindBridge(int V__) : V(V__), adj(V__, set< int >()) {}\n\t\n\tvoid addEdge(int u, int v) {\n\t\tadj[u].insert(v);\n\t\tadj[v].insert(u);\n\t}\n\t\n\tVec< pii > get() {\n\t\tVec< pii > br;\n\t\tlow.assign(V, -1);\n\t\tpre.assign(V, -1);\n\t\tvis.assign(V, false);\n\t\tint count = 0;\n\t\tfor_(v,0,V) if (!vis[v]) dfs(0, count, -1, br);\n\t\treturn br;\n\t}\n\t\n\tint count() {\n\t\tVec< pii > br;\n\t\tlow.assign(V, -1);\n\t\tpre.assign(V, -1);\n\t\tvis.assign(V, false);\n\t\tint count = 0;\n\t\tfor_(v,0,V) if (!vis[v]) dfs(0, count, -1, br);\n\t\treturn br.size();\n\t}\n};\n\nint N, M, a[1010], b[1010];\nbool isbr[1010];\nVec< Vec< int > > adj;\n\ntypedef StronglyConnectedComponentDecomposition SCC;\n\nint doSCC() {\t\n\tSCC::Result scc = SCC(adj).decomposition();\n\tVec< int > vcnt(N, 0);\n\tfor_(v,0,N) vcnt[scc.topol[v]]++;\n\tint szov2 = 0;\n\tfor_(i,0,N) if (vcnt[i] >= 2) szov2++;\n\treturn szov2;\n}\n\nvoid findBr() {\n\tFindBridge fb(N);\n\tfor_(i,0,M) fb.addEdge(a[i], b[i]);\n\tVec< pii > vp = fb.get();\n\t\n\tfor (pii p : vp) {\n\t\tfor_(i,0,M) {\n\t\t\tif (p.first == a[i] && p.second == b[i]) isbr[i] = true;\n\t\t\tif (p.first == b[i] && p.second == a[i]) isbr[i] = true;\n\t\t}\n\t}\n}\n\nvoid solve() {\n\tfindBr();\n\t\n\tfor_(ig,0,M) {\n\t\tif (isbr[ig]) continue;\n\t\tadj.assign(N, Vec< int >());\n\t\t\n\t\tfor_(i,0,M) {\n\t\t\tif (i == ig) continue;\n\t\t\tadj[a[i]].push_back(b[i]);\n\t\t}\n\t\t\n\t\tif (doSCC() == 0) {\n\t\t\tFindBridge fb(N);\n\n\t\t\tfor_(i,0,M) {\n\t\t\t\tif (i == ig) continue;\n\t\t\t\tfb.addEdge(a[i], b[i]);\n\t\t\t}\n\t\t\t\n\t\t\tif (fb.count() >= 2) {\n\t\t\t\tputs(\"YES\");\n\t\t\t\texit(0);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tputs(\"NO\");\n}\n\nint main() {\n\tcin >> N >> M;\n\tfor_(i,0,M) {\n\t\tcin >> a[i] >> b[i];\n\t\t--a[i]; --b[i];\n\t}\n\tsolve();\n}","accuracy":1,"time_ms":60,"memory_kb":3300,"score_of_the_acc":-0.3721,"final_rank":7},{"submission_id":"aoj_2794_2000949","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\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\nnamespace SCC{\n void visit(const vector<vector<int>>&G,vector<int>&vs,vector<int>&used,int v){\n used[v]=true;\n for(auto u:G[v]){\n if(!used[u])visit(G,vs,used,u);\n }\n vs.push_back(v);\n }\n\n void visit2(const vector<vector<int>>&T,vector<int>&used,vector<int>&comp,vector<int>&vec,int k,int v){\n comp[v]=k;\n used[v]=true;\n vec.push_back(v);\n\n for(auto u:T[v]){\n if(!used[u])visit2(T,used,comp,vec,k,u);\n }\n }\n\n //G:?????£?????????????§£???????????°??????\n //H:?????£??????????????°??????1???????????????????´?????????°??????\n //comp:G????????????????????????H?????????????±????????????????\n void decompose(const vector<vector<int>>&G,vector<vector<int>>&H,vector<int>&comp){\n vector<vector<int>>T(G.size());\n for(int i=0;i<G.size();i++){\n for(auto v:G[i]){\n T[v].push_back(i);\n }\n }\n comp.resize(G.size());\n\n vector<int>vs(G.size());\n vector<int>used(G.size());\n for(int i=0;i<G.size();i++){\n if(!used[i])visit(G,vs,used,i);\n }\n reverse(vs.begin(),vs.end());\n fill(used.begin(),used.end(),0);\n\n int K=0;\n vector<vector<int>>S;\n for(auto v:vs){\n if(!used[v]){\n S.push_back(vector<int>());\n visit2(T,used,comp,S.back(),K++,v);\n }\n }\n\n H.resize(K);\n fill(used.begin(),used.end(),0);\n for(int i=0;i<K;i++){\n for(auto v:S[i]){\n for(auto u:G[v]){\n if(used[comp[u]]||comp[v]==comp[u])continue;\n used[comp[u]]=true;\n H[comp[v]].push_back(comp[u]);\n }\n }\n for(auto v:H[i])used[v]=false;\n }\n\n }\n}\n\nstruct UF{\n vector<int>par,sz;\n void init(int n){\n par.resize(n);\n sz.resize(n);\n for(int i=0;i<n;i++){\n par[i]=i;\n sz[i]=1;\n }\n }\n int find(int x){\n return x==par[x]?x:par[x]=find(par[x]);\n }\n void unite(int x,int y){\n x=find(x);y=find(y);\n if(x==y)return;\n sz[x]+=sz[y];\n par[y]=x;\n }\n bool same(int x,int y){\n return find(x)==find(y);\n }\n int size(int x){\n return sz[find(x)];\n }\n};\n\nvector<vint>G;\nvector<pair<int, int> > bridge;\nint ord[1000], low[1000];\nbool vis[1000];\n\nvoid dfs(int v, int p, int &k)\n{\n\tvis[v] = true;\n\n\tord[v] = k++;\n\tlow[v] = ord[v];\n\n\tfor (int i = 0; i < G[v].size(); i++){\n\t\tif (!vis[G[v][i]]){\n\t\t\tdfs(G[v][i], v, k);\n\t\t\tlow[v] = min(low[v], low[G[v][i]]);\n\t\t\tif (ord[v] < low[G[v][i]]) bridge.push_back(make_pair(min(v, G[v][i]), max(v, G[v][i])));\n\t\t}\n\t\telse if (G[v][i] != p){\n\t\t\tlow[v] = min(low[v], ord[G[v][i]]);\n\t\t}\n\t}\n}\nsigned main(){\n int N,M;\n int A[1000],B[1000];\n cin>>N>>M;\n rep(i,M)cin>>A[i]>>B[i],A[i]--,B[i]--;\n\n rep(i,M){\n UF uf;\n uf.init(N);\n rep(j,M)if(i!=j)uf.unite(A[j],B[j]);\n bool ok=true;\n rep(j,N)if(uf.find(j)!=uf.find(0))ok=false;\n if(!ok)continue;\n G=vector<vint>(N);\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]);\n vector<vint>H;vint comp;\n SCC::decompose(G,H,comp);\n if(H.size()!=N)continue;\n G=vector<vint>(N);\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]),G[B[j]].pb(A[j]);\n memset(vis,0,sizeof(vis));\n int K=0;\n bridge.clear();\n dfs(0,-1,K);\n if(bridge.size()>=2){\n cout<<\"YES\"<<endl;\n return 0;\n }\n }\n cout<<\"NO\"<<endl;\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3268,"score_of_the_acc":-0.4271,"final_rank":10}],"string":"[\n {\n \"submission_id\": \"aoj_2794_2503049\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define N 1000\\n#define V_MAX 1000\\nusing namespace std;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\n \\n \\nclass TSort{\\npublic:\\n int V;\\n vector<set<int> > in,out;\\n vector<int> sorted;\\n TSort(){V = -1,sorted.push_back(-1);}\\n TSort(int V){\\n in.resize(V);\\n out.resize(V);\\n sorted.push_back(-1);\\n this->V = V;\\n }\\n \\n void add_edge(int from,int to){\\n assert(from < V && to < V);\\n assert(out[from].count(to) == 0);\\n assert(in[to].count(from) == 0);\\n out[from].insert(to);\\n in[to].insert(from);\\n }\\n \\n void erase_edge(int from,int to){\\n out[from].erase(to);\\n in[to].erase(from);\\n }\\n \\n void sort(){\\n assert(sorted.size() && sorted[0]==-1 && \\\"sort method is already invoked\\\");\\n sorted.clear();\\n queue<int> Q;\\n for(int i=0;i<V;i++)if(in[i].empty()) Q.push(i);\\n \\n while(!Q.empty()){\\n int v = Q.front();Q.pop();\\n sorted.push_back(v);\\n for(int nx:out[v]){\\n if(in[nx].size() == 1) Q.push(nx);\\n in[nx].erase(v);\\n } \\n }\\n \\n for(int i=0;i<V;i++) if(!in[i].empty()) sorted.clear(); // exist loop\\n }\\n};\\n \\n\\nclass Bridges{\\npublic:\\n typedef pair<int,int> P;\\n int V; //テ」ツδ偲」ツδシテ」ツδ嘉ヲツ閉ー\\n vector <int> G[V_MAX]; //テ」ツつーテ」ツδゥテ」ツδ陛」ツ?ョテゥツ堋」テヲツ篠・テ」ツδェテ」ツつケテ」ツδ暗」ツつ津ィツ。ツィテァツ渉セ\\n set <P> bridges; // テヲツゥツ?\\n int ord[V_MAX]; //ティツ。ツ古」ツ?催」ツ?凝」ツ?妥ゥツ??」ツつ津」ツ?づ」ツつ湘」ツつ嘉」ツ?凖」ツ??\\n int low[V_MAX]; //\\n \\n Bridges(){V = -1;}\\n Bridges(int V){this->V = V;}\\n \\n void add_edge(int a,int b){\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n \\n void erase_edge(int a,int b){\\n for(int i=0;i<(int)G[a].size();i++) if(G[a][i] == b) {G[a].erase(G[a].begin()+i);break;}\\n for(int i=0;i<(int)G[b].size();i++) if(G[b][i] == a) {G[b].erase(G[b].begin()+i);break;}\\n }\\n \\n void dfs(int u, int p, int &c){\\n ord[u] = low[u] = c++;\\n \\n for(int v:G[u]){\\n if(v == p)continue;\\n if(ord[v] == -1){\\n dfs(v,u,c);\\n low[u] = min(low[u],low[v]);\\n }\\n else low[u] = min(low[u], ord[v]);\\n if(ord[u] < low[v]) bridges.insert(P(min(u,v),max(u,v)));\\n }\\n }\\n \\n void bridge(){\\n assert(V >= 0 && \\\"Set number of node V\\\");\\n bridges.clear();\\n int c = 0;\\n memset(ord,-1,sizeof(ord));\\n memset(low,0,sizeof(low));\\n for(int i=0;i<V;i++) if(ord[i]==-1) dfs(i,-1,c);\\n }\\n \\n bool isBridge(int u,int v){return bridges.count(P(u,v)) || bridges.count(P(v,u));}\\n};\\n \\nset<int> G[N];\\n \\nsigned main(){\\n int n,m;\\n cin>>n>>m;\\n TSort T(n);\\n Bridges B(n);\\n for(int i=0;i<m;i++){\\n int a,b;\\n cin>>a>>b;a--,b--;\\n T.add_edge(a,b);\\n B.add_edge(a,b);\\n assert(G[b].count(a)== 0);\\n G[a].insert(b);\\n }\\n \\n int ans = 0;\\n TSort origin = T;\\n for(int from=0;from<n;from++)\\n for(int to:G[from]){\\n T = origin;\\n B.bridge();\\n if(B.isBridge(from,to)) continue;\\n T.erase_edge(from,to);\\n B.erase_edge(from,to);\\n \\n T.sort();\\n B.bridge();\\n \\n if(T.sorted.size() && (int)B.bridges.size()>=2)ans = 1;\\n \\n T.add_edge(from,to);\\n B.add_edge(from,to);\\n }\\n cout<<(ans?\\\"YES\\\":\\\"NO\\\")<<endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -0.3848,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2794_2503048\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define N 1000\\n#define V_MAX 1000\\nusing namespace std;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\n \\n \\nclass TSort{\\npublic:\\n int V;\\n vector<set<int> > in,out;\\n vector<int> sorted;\\n TSort(){V = -1,sorted.push_back(-1);}\\n TSort(int V){\\n in.resize(V);\\n out.resize(V);\\n sorted.push_back(-1);\\n this->V = V;\\n }\\n \\n void add_edge(int from,int to){\\n assert(from < V && to < V);\\n assert(out[from].count(to) == 0);\\n assert(in[to].count(from) == 0);\\n out[from].insert(to);\\n in[to].insert(from);\\n }\\n \\n void erase_edge(int from,int to){\\n out[from].erase(to);\\n in[to].erase(from);\\n }\\n \\n void sort(){\\n assert(sorted.size() && sorted[0]==-1 && \\\"sort method is already invoked\\\");\\n sorted.clear();\\n queue<int> Q;\\n for(int i=0;i<V;i++)if(in[i].empty()) Q.push(i);\\n \\n while(!Q.empty()){\\n int v = Q.front();Q.pop();\\n sorted.push_back(v);\\n for(int nx:out[v]){\\n if(in[nx].size() == 1) Q.push(nx);\\n in[nx].erase(v);\\n } \\n }\\n \\n for(int i=0;i<V;i++) if(!in[i].empty()) sorted.clear(); // exist loop\\n }\\n};\\n \\n\\nclass Bridges{\\npublic:\\n typedef pair<int,int> P;\\n int V; //???????????°\\n vector <int> G[V_MAX]; //??°???????????£??\\\\??????????????¨???\\n set <P> bridges; // ???\\n int ord[V_MAX]; //?????????????????????????????????\\n int low[V_MAX]; //\\n \\n Bridges(){V = -1;}\\n Bridges(int V){this->V = V;}\\n \\n void add_edge(int a,int b){\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n \\n void erase_edge(int a,int b){\\n for(int i=0;i<(int)G[a].size();i++) if(G[a][i] == b) {G[a].erase(G[a].begin()+i);break;}\\n for(int i=0;i<(int)G[b].size();i++) if(G[b][i] == a) {G[b].erase(G[b].begin()+i);break;}\\n }\\n \\n void dfs(int u, int p, int &c){\\n ord[u] = low[u] = c++;\\n \\n for(int v:G[u]){\\n if(v == p)continue;\\n if(ord[v] == -1){\\n dfs(v,u,c);\\n low[u] = min(low[u],low[v]);\\n }\\n else low[u] = min(low[u], ord[v]);\\n if(ord[u] < low[v]) bridges.insert(P(min(u,v),max(u,v)));\\n }\\n }\\n \\n void bridge(){\\n assert(V >= 0 && \\\"Set number of node V\\\");\\n bridges.clear();\\n int c = 0;\\n memset(ord,-1,sizeof(ord));\\n memset(low,0,sizeof(low));\\n for(int i=0;i<V;i++) if(ord[i]==-1) dfs(i,-1,c);\\n }\\n \\n bool isBridge(int u,int v){return bridges.count(P(u,v)) || bridges.count(P(v,u));}\\n};\\n \\nset<int> G[N];\\n \\nsigned main(){\\n int n,m;\\n cin>>n>>m;\\n TSort T(n);\\n Bridges B(n);\\n for(int i=0;i<m;i++){\\n int a,b;\\n cin>>a>>b;a--,b--;\\n T.add_edge(a,b);\\n B.add_edge(a,b);\\n assert(G[b].count(a)== 0);\\n G[a].insert(b);\\n }\\n \\n int ans = 0;\\n TSort origin = T;\\n for(int from=0;from<n;from++)\\n for(int to:G[from]){\\n T = origin;\\n B.bridge();\\n if(B.isBridge(from,to)) continue;\\n T.erase_edge(from,to);\\n B.erase_edge(from,to);\\n \\n T.sort();\\n B.bridge();\\n \\n if(T.sorted.size() && (int)B.bridges.size()>=2)ans = 1;\\n \\n T.add_edge(from,to);\\n B.add_edge(from,to);\\n }\\n cout<<(ans?\\\"YES\\\":\\\"NO\\\")<<endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.3842,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2794_2238698\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 30000\\nstruct edge{ int from,to,id; };\\n\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nbool flg[MAX_M];\\n\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nint par[MAX_N];\\n\\n\\nvector<edge> bridges;\\n\\n\\nvector<edge> edge_;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n par[to]=pos;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n edge_.push_back(G[pos][i]);\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n edge_.clear();\\n \\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n memset(par,-1,sizeof(par));\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool isDag(int id){\\n queue<int> Q; \\n vector<int> C(N,0);\\n int cc=0;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n C[ b[i] ]++;\\n }\\n for(int i=0;i<N;i++)if(C[i]==0)Q.push(i);\\n\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n return (cc==N);\\n}\\n\\nvoid visit(int v){\\n if(visited[v])return;\\n visited[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n visit(G[v][i].to);\\n }\\n}\\n\\nint calcDec(int id){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n }\\n int res=0;\\n memset(visited,false,sizeof(visited));\\n for(int i=0;i<N;i++){\\n if(!visited[i]){\\n res++;\\n visit(i);\\n }\\n }\\n return res;\\n}\\n\\nmap<int,int> mm;\\nbool check(int id){\\n if(mm.count(id))return false;\\n mm[id]=true;\\n \\n if(countB(id) + calcDec(id)>=3&&isDag(id))return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if( rec(e.to,si) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n loope.clear();\\n if( rec(i,i) )break;\\n }\\n \\n for(int i=0;i<(int)loope.size();i++)\\n if(check( loope[i].id ))return true;\\n\\n return false;\\n}\\n\\nbool solve(){\\n int B=countB(-1);\\n if(B==M)return false;\\n\\n for(int i=0;i<M;i++){\\n if(check(i)){\\n // cout<<\\\"i=\\\"<<i<<\\\" a[i]=\\\"<<a[i]<<\\\" b[i]=\\\"<<b[i]<<endl;\\n return true;\\n }\\n }\\n \\n if( !isDag(-1) )return solve2();\\n\\n int maxm=0;\\n\\n B=countB(-1);\\n for(int i=0;i<(int)edge_.size();i++){\\n edge e=edge_[i];\\n int a=e.from;\\n int cc=0;\\n while(1){\\n if(a==e.to)break;\\n if(cnt[a]==1)cc++;\\n a=par[a];\\n // cout<<\\\"a=\\\"<<a<<endl;\\n // cout<<\\\"par[a]=\\\"<<par[a]<<endl;\\n // cout<<e.from<<' '<<e.to<<endl;\\n }\\n maxm=max(maxm,cc);\\n }\\n return (B+maxm>=2);\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.3513,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2794_2235673\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <stack>\\n#include <map>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define vi vector<int>\\n#define pb push_back\\n\\nint unused_from, unused_to;\\n\\n\\n#define MAX_V 100000\\nvector<int> G[MAX_V];\\nvector<int> Grev[MAX_V];\\nbool used[MAX_V]={};\\nint ord[MAX_V],lowlink[MAX_V];\\nint k=0;\\n\\nvoid dfs(int v,int prev){ //make ord and lowlink\\n used[v] = true;\\n ord[v]=lowlink[v]=k;\\n k++;\\n \\n rep(i,Grev[v].size()){\\n int to = Grev[v][i];\\n if((v==unused_from&&to==unused_to)||(v==unused_to&&to==unused_from))continue;\\n if(!used[to]){\\n dfs(to,v);\\n lowlink[v] = min(lowlink[v],lowlink[to]);\\n }\\n else if(used[to]&&to!=prev){ //use back edge\\n lowlink[v] = min(lowlink[v],ord[to]);\\n }\\n }\\n}\\n\\nvector<pii> enumerateBridge(int e,vector<pii> edges){ //????????????\\n vector<pii> ret;\\n \\n rep(i,e){\\n int a = edges[i].first, b = edges[i].second;\\n if((a==unused_from&&b==unused_to)||(a==unused_to&&b==unused_from))continue;\\n if(ord[a]>ord[b])swap(a,b);\\n if(ord[a]<lowlink[b])ret.pb(pii(edges[i].first,edges[i].second));\\n }\\n return ret;\\n}\\n\\n\\n\\nbool hasLoop(int v){\\n vector<int> in_deg(v,0);\\n rep(i,MAX_V){\\n rep(j,G[i].size()){\\n int from = i, to = G[i][j];\\n if(from==unused_from&&to==unused_to)continue;\\n in_deg[to]++;\\n }\\n }\\n \\n stack<int> st;\\n vector<int> list;\\n \\n rep(i,v)if(in_deg[i]==0)st.push(i);\\n \\n while(st.size()){\\n int q = st.top();\\n st.pop();\\n list.pb(q);\\n \\n rep(i,G[q].size()){\\n int to = G[q][i];\\n if(q==unused_from&&to==unused_to)continue;\\n in_deg[to]--;\\n if(in_deg[to]==0)st.push(to);\\n }\\n }\\n \\n if(list.size()!=v)return true;\\n return false;\\n \\n}\\n\\n\\nint main(){\\n int v,e;\\n cin>>v>>e;\\n vector<pii> edges;\\n \\n rep(i,e){\\n int a,b;\\n cin>>a>>b;\\n a--,b--;\\n edges.pb(pii(a,b));\\n G[a].pb(b);\\n Grev[a].pb(b),Grev[b].pb(a);\\n }\\n \\n \\n dfs(0,-1);\\n vector<pii> bridge_list = enumerateBridge(e,edges);\\n map<pii,bool> mp;\\n rep(i,bridge_list.size())mp[bridge_list[i]]=true;\\n \\n \\n rep(i,MAX_V){\\n rep(j,G[i].size()){\\n unused_from = i;\\n unused_to = G[i][j];\\n \\n rep(i,MAX_V)used[i]=false;\\n k=0;\\n dfs(0,-1);\\n vector<pii> brg = enumerateBridge(e,edges);\\n \\n if( not mp[pii(unused_from,unused_to)] && brg.size()>=2 && not hasLoop(v)){\\n // cout<<unused_from+1<<\\\" \\\"<<unused_to+1<<endl; //1????????????????????????????????????\\n cout<<\\\"YES\\\"<<endl;\\n return 0;\\n }\\n }\\n }\\n cout<<\\\"NO\\\"<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 8060,\n \"score_of_the_acc\": -1.1343,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2794_2235242\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_N 500\\n#define MAX_M 30000\\nstruct edge{ int from,to,id; };\\nint N,M;\\nint a[MAX_M],b[MAX_M];\\nvector<edge> G[MAX_N];\\n\\nbool visited[MAX_N];\\nint depth[MAX_N];\\nint cnt[MAX_N];\\nvector<edge> bridges;\\n\\nvoid dfs(int pos,int prev){\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n if(to==prev)continue;\\n if(!visited[to]){\\n depth[to]=depth[pos]+1;\\n dfs(to,pos);\\n cnt[pos]+=cnt[to];\\n if(cnt[to]==0)bridges.push_back(G[pos][i]);\\n }else if(depth[to]<depth[pos]){\\n cnt[pos]++;\\n cnt[to]--;\\n }\\n }\\n}\\n\\nint countB(int id){\\n bridges.clear();\\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n memset(cnt,0,sizeof(cnt));\\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++){\\n if(i==id)continue;\\n G[ a[i] ].push_back( (edge){ a[i],b[i],i } );\\n G[ b[i] ].push_back( (edge){ b[i],a[i],i } );\\n }\\n for(int i=0;i<N;i++){\\n if(visited[i])continue;\\n dfs(i,-1);\\n }\\n return bridges.size();\\n}\\n\\nbool check(int id){\\n int B=countB(id);\\n\\n memset(visited,false,sizeof(visited));\\n int U=0;\\n for(int i=0;i<N;i++)\\n if(!visited[i])U++,dfs(i,-1);\\n \\n if(B+U<3)return false;\\n \\n queue<int> Q;\\n vector<int> C(N,0);\\n for(int i=0;i<M;i++)\\n if(id!=i)C[ b[i] ]++;\\n for(int i=0;i<N;i++)\\n if(C[i]==0)Q.push(i);\\n int cc=0;\\n while(!Q.empty()){\\n int pos=Q.front();Q.pop();\\n cc++;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i].to;\\n C[to]--;\\n if(C[to]==0)Q.push(to);\\n }\\n }\\n if(cc==N)return true;\\n else return false;\\n}\\n\\nvector<edge> loope;\\nbool rec(int pos,int si,int pre=-1){\\n if(visited[pos])return (pos==si);\\n visited[pos]=true;\\n for(int i=0;i<(int)G[pos].size();i++){\\n edge e=G[pos][i];\\n if(e.id==pre)continue;\\n \\n if( rec(e.to,si,e.id) ){\\n loope.push_back(e);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool solve2(){\\n\\n for(int i=0;i<M;i++){\\n if(check(i))return true;\\n }\\n \\n for(int i=0;i<N;i++){\\n memset(visited,false,sizeof(visited));\\n memset(depth,0,sizeof(depth));\\n loope.clear();\\n if( rec(i,i) ){\\n break;\\n }\\n }\\n for(int i=0;i<(int)loope.size();i++){\\n if(check( loope[i].id ))return true;\\n }\\n return false;\\n}\\n\\nbool solve(){\\n if(countB(-1)==M)return false;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n if(solve2())return true;\\n \\n for(int i=0;i<N;i++)G[i].clear();\\n for(int i=0;i<M;i++)G[ a[i] ].push_back( (edge){a[i],b[i],i} );\\n for(int i=0;i<M;i++)G[ b[i] ].push_back( (edge){b[i],a[i],i} );\\n if(solve2())return true; \\n return false;\\n}\\n\\nint main(){\\n cin>>N>>M;\\n for(int i=0;i<M;i++){\\n cin>>a[i]>>b[i];\\n a[i]--;\\n b[i]--;\\n }\\n cout<< ( solve() ? \\\"YES\\\" : \\\"NO\\\" ) <<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3248,\n \"score_of_the_acc\": -0.3645,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2794_2006752\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\\n\\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++)\\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\\n#define all(a) (a).begin(),(a).end()\\n#define rall(a) (a).rbegin(),(a).rend()\\n#define printV(v) for(auto&& x : v){cout << x << \\\" \\\";} cout << endl\\n#define printVV(vv) for(auto&& v : vv){for(auto&& x : v){cout << x << \\\" \\\";}cout << endl;}\\n#define printP(p) cout << p.first << \\\" \\\" << p.second << endl\\n#define printVP(vp) for(auto&& p : vp) printP(p);\\n\\ntypedef long long ll;\\ntypedef pair<int, int> Pii;\\ntypedef tuple<int, int, int> TUPLE;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<vvi> vvvi;\\ntypedef vector<Pii> vp;\\nconst int inf = 1e9;\\nconst int mod = 1e9 + 7;\\n\\ntypedef vector<vector<int>> Graph;\\ntypedef pair<int, int> Edge; // (a < b: undirected)\\n\\nclass BICC {\\nprivate:\\n const int n;\\n\\npublic:\\n Graph G;\\n vi depth;\\n vi par;\\n map<Edge, int> imosEdge;\\n map<Edge, int> EdgeType;\\n enum {UNUSED, USED_DFS, BRIDGE};\\n vector<Edge> bridges;\\n\\n\\tvi cmp;\\n\\tint num_cc;\\n\\tvi size_of_vertex;\\n\\tGraph G_cc;\\npublic:\\n BICC(int _n) : n(_n), G(_n), depth(_n, -1), par(_n, -1), cmp(_n, -1), num_cc(0) {}\\n Edge getEdge(int a, int b) {\\n if (a > b) swap(a, b);\\n return Edge(a, b);\\n }\\n void updateEdgeType(int a, int b, int type) {\\n if (a < 0 || b < 0) return;\\n EdgeType[getEdge(a, b)] = type;\\n }\\n void addEdge(int a, int b) {\\n G[a].emplace_back(b);\\n G[b].emplace_back(a);\\n updateEdgeType(a, b, UNUSED);\\n }\\n void dfsTreeConstruct(int v, int pre) {\\n if (depth[v] != -1) return;\\n depth[v] = (pre == -1 ? 0 : depth[pre] + 1);\\n par[v] = pre;\\n updateEdgeType(pre, v, USED_DFS);\\n for (auto&& nxt : G[v]) {\\n if (nxt != pre) dfsTreeConstruct(nxt, v);\\n }\\n }\\n void updateImos(int a, int b) {\\n if (depth[a] < depth[b]) swap(a, b);\\n\\n if (par[a] != -1) {\\n imosEdge[getEdge(a, par[a])]++;\\n }\\n if (par[b] != -1) {\\n imosEdge[getEdge(b, par[b])]--;\\n }\\n }\\n int imosFinal(int v, int pre) {\\n int t = 0;\\n for (auto&& nxt : G[v]) {\\n if (nxt != pre && EdgeType[getEdge(nxt, v)] == USED_DFS) {\\n t += imosFinal(nxt, v);\\n }\\n }\\n if (pre != -1) imosEdge[getEdge(v, pre)] += t;\\n return pre == -1 ? 0 : imosEdge[getEdge(v, pre)];\\n }\\n int extractCC(int v, int color) {\\n \\tif (cmp[v] != -1) return 0;\\n \\tcmp[v] = color;\\n \\tint t = 1;\\n \\tfor (auto&& nxt : G[v]) {\\n \\t\\tif (EdgeType[getEdge(v, nxt)] != BRIDGE) {\\n \\t\\t\\tt += extractCC(nxt, color);\\n \\t\\t}\\n \\t}\\n \\treturn t;\\n }\\n void bicc() {\\n dfsTreeConstruct(0, -1);\\n for (auto&& p : EdgeType) {\\n Edge e;\\n int type;\\n tie(e, type) = p;\\n if (type == UNUSED) {\\n updateImos(e.first, e.second);\\n }\\n }\\n imosFinal(0, -1);\\n for (auto&& p : EdgeType) {\\n Edge e;\\n int type;\\n tie(e, type) = p;\\n if (type == USED_DFS) {\\n if (imosEdge[e] == 0) {\\n EdgeType[e] = BRIDGE;\\n bridges.emplace_back(e);\\n }\\n }\\n }\\n\\n\\t\\trep(i, n) {\\n\\t\\t\\tint size_cc = extractCC(i, num_cc);\\n\\t\\t\\tif (size_cc > 0) {\\n\\t\\t\\t\\tsize_of_vertex.emplace_back(size_cc);\\n\\t\\t\\t\\tnum_cc++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t \\tvector<set<int>> G_cc_st(num_cc);\\n\\t\\tfor (auto&& p : EdgeType) {\\n Edge e;\\n int type;\\n tie(e, type) = p;\\n if (type == BRIDGE) {\\n\\t\\t\\t\\tG_cc_st[cmp[e.first]].insert(cmp[e.second]);\\n\\t\\t\\t\\tG_cc_st[cmp[e.second]].insert(cmp[e.first]);\\n }\\n }\\n\\n\\t\\trep(i, num_cc) {\\n\\t\\t\\tG_cc.emplace_back(vector<int>(all(G_cc_st[i])));\\n\\t\\t}\\n }\\n vector<Edge> getBridges() {\\n return bridges;\\n }\\n};\\n\\n\\n// false: \\\"contains cycle\\\"\\nbool dfs(int now, int start, const Graph &G, vector<bool> &visited) {\\n visited[now] = true;\\n for (auto nxt : G[now]) {\\n if (nxt == start) return false;\\n if (!visited[nxt] && !dfs(nxt, start, G, visited)) return false;\\n }\\n return true;\\n}\\n\\nbool isDAG(const Graph &G) {\\n int n = G.size();\\n rep(i, n) {\\n vector<bool> visited(n);\\n if (!dfs(i, i, G, visited)) return false;\\n }\\n return true;\\n}\\n\\nvoid dfs2(int v, int pre, const Graph& G, vector<bool>& visited) {\\n if (visited[v]) return;\\n visited[v] = true;\\n for (auto nxt : G[v]) {\\n if (v == pre) continue;\\n dfs2(nxt, v, G, visited);\\n }\\n}\\n\\nbool isConnected(const Graph& G) {\\n int n = G.size();\\n vector<bool> visited(n);\\n dfs2(0, -1, G, visited);\\n rep(i, n) {\\n if (!visited[i]) return false;\\n }\\n return true;\\n}\\n\\nsigned main() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(0);\\n\\n int N, M;\\n cin >> N >> M;\\n vector<pair<int, int>> edges;\\n rep(i, M) {\\n int a, b;\\n cin >> a >> b;\\n a--, b--;\\n edges.emplace_back(a, b);\\n }\\n\\n rep(i, M) {\\n BICC bicc(N);\\n Graph G_dir(N);\\n rep(j, M) {\\n if (j == i) continue;\\n bicc.addEdge(edges[j].first, edges[j].second);\\n G_dir[edges[j].first].emplace_back(edges[j].second);\\n }\\n\\n // ??????????????????????????¨????????°??????????????£??????????????????????????????\\n if (!isConnected(bicc.G)) {\\n continue;\\n }\\n\\n bicc.bicc();\\n\\n if (bicc.num_cc >= 3 && isDAG(G_dir)) {\\n cout << \\\"YES\\\" << endl;\\n return 0;\\n }\\n }\\n\\n cout << \\\"NO\\\" << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -1.3129,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2794_2004764\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <fstream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\n#include <complex>\\n#include <string>\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <numeric>\\n#include <limits>\\n#include <climits>\\n#include <cfloat>\\n#include <functional>\\nusing namespace std;\\n\\nbool topologicalSort(const vector<vector<int> >& edges, vector<int>& node)\\n{\\n int n = edges.size();\\n node.resize(n);\\n\\n vector<int> restEdges(n, 0);\\n for(int i=0; i<n; ++i){\\n for(unsigned j=0; j<edges[i].size(); ++j){\\n ++ restEdges[edges[i][j]];\\n }\\n }\\n\\n int restNodes = n;\\n queue<int> q;\\n for(int i=0; i<n; ++i){\\n if(restEdges[i] == 0){\\n node[n-restNodes] = i;\\n q.push(i);\\n -- restNodes;\\n }\\n }\\n\\n while(restNodes > 0){\\n if(q.empty()){\\n node.clear();\\n return false;\\n }\\n int i = q.front();\\n q.pop();\\n\\n for(unsigned j=0; j<edges[i].size(); ++j){\\n int k = edges[i][j];\\n -- restEdges[k];\\n if(restEdges[k] == 0){\\n node[n-restNodes] = k;\\n q.push(k);\\n -- restNodes;\\n }\\n }\\n }\\n\\n return true;\\n}\\n\\nbool isBridge(const vector<vector<int> >& edges, int a, int b)\\n{\\n int n = edges.size();\\n queue<int> q;\\n vector<bool> check(n, false);\\n q.push(a);\\n check[a] = true;\\n while(!q.empty()){\\n int x = q.front();\\n q.pop();\\n for(int y : edges[x]){\\n if(!(x == a && y == b) && !check[y]){\\n q.push(y);\\n check[y] = true;\\n }\\n }\\n }\\n return !check[b];\\n}\\n\\nvoid bridgeDecomposition(const vector<vector<int> >& edges, vector<int>& indexConvert,\\n vector<vector<int> >& nodesOut, vector<vector<int> >& edgesOut)\\n{\\n const int n = edges.size();\\n vector<int> num(n, -1), low(n, -1);\\n vector<bool> isStk(n, false);\\n stack<int> stk;\\n int cnt = -1;\\n nodesOut.clear();\\n\\n for(int i=0; i<n; ++i){\\n stack<tuple<int, int, unsigned> > arg;\\n arg.push(make_tuple(i, -1, 0));\\n\\n while(!arg.empty()){\\n int v = get<0>(arg.top());\\n int prev = get<1>(arg.top());\\n unsigned j = get<2>(arg.top());\\n arg.pop();\\n\\n if(j == 0){\\n if(num[v] != -1)\\n continue;\\n num[v] = low[v] = ++ cnt;\\n stk.push(v);\\n isStk[v] = true;\\n }\\n else{\\n int w = edges[v][j-1];\\n if(w != prev && isStk[w])\\n low[v] = min(low[v], low[w]);\\n }\\n\\n if(j < edges[v].size()){\\n arg.push(make_tuple(v, prev, j + 1));\\n int w = edges[v][j];\\n if(w != prev)\\n arg.push(make_tuple(w, v, 0));\\n }\\n else if(low[v] == num[v]){\\n nodesOut.push_back(vector<int>());\\n for(;;){\\n int w = stk.top();\\n stk.pop();\\n isStk[w] = false;\\n nodesOut.back().push_back(w);\\n if(v == w)\\n break;\\n }\\n }\\n }\\n }\\n\\n const int m = nodesOut.size();\\n indexConvert.resize(n);\\n for(int i=0; i<m; ++i){\\n for(unsigned j=0; j<nodesOut[i].size(); ++j)\\n indexConvert[nodesOut[i][j]] = i;\\n }\\n edgesOut.assign(m, vector<int>());\\n vector<set<int> > used(m);\\n for(int i=0; i<n; ++i){\\n for(unsigned j=0; j<edges[i].size(); ++j){\\n int v = indexConvert[i];\\n int w = indexConvert[edges[i][j]];\\n if(v != w && used[v].find(w) == used[v].end()){\\n edgesOut[v].push_back(w);\\n used[v].insert(w);\\n }\\n }\\n }\\n}\\n\\nint main()\\n{\\n int n, m;\\n cin >> n >> m;\\n vector<vector<int> > edges(n), directedEdges(n);\\n for(int i=0; i<m; ++i){\\n int a, b;\\n cin >> a >> b;\\n -- a;\\n -- b;\\n edges[a].push_back(b);\\n edges[b].push_back(a);\\n directedEdges[a].push_back(b);\\n }\\n\\n for(int a=0; a<n; ++a){\\n for(unsigned i=0; i<directedEdges[a].size(); ++i){\\n int b = directedEdges[a][i];\\n if(isBridge(edges, a, b))\\n continue;\\n\\n vector<vector<int> > directEdges2 = directedEdges;\\n directEdges2[a].erase(find(directEdges2[a].begin(), directEdges2[a].end(), b));\\n vector<int> tmp;\\n if(!topologicalSort(directEdges2, tmp))\\n continue;\\n\\n vector<vector<int> > edges2 = edges;\\n edges2[a].erase(find(edges2[a].begin(), edges2[a].end(), b));\\n edges2[b].erase(find(edges2[b].begin(), edges2[b].end(), a));\\n vector<int> tmp1;\\n vector<vector<int> > nodes, tmp2;\\n bridgeDecomposition(edges2, tmp1, nodes, tmp2);\\n\\n if(nodes.size() >= 3){\\n cout << \\\"YES\\\" << endl;\\n return 0;\\n }\\n }\\n }\\n\\n cout << \\\"NO\\\" << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -0.2989,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2794_2001281\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nconst int MAX = 555;\\nint N ,M, V;\\nvector<int> G[MAX];\\nvector<int> rG[MAX];\\nbool used[MAX];\\nint cmp[MAX];\\nvector<int> vs;\\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 = vs.size() - 1 ; i >= 0 ; i--){\\n if(!used[vs[i]]) rdfs(vs[i],k++);\\n }\\n return k;\\n}\\n\\nint ord[MAX], low[MAX];\\nstruct edgeB{\\n int u,v;\\n};\\n \\nvoid dfs(int u, int pre, int &c, vector<int> G[], vector<edgeB> &B){\\n ord[u] = low[u] = c++;\\n for(int i=0;i<(int)G[u].size();i++){\\n int v = G[u][i];\\n if(v != pre){\\n if(ord[v] == -1){\\n dfs(v,u,c,G,B);\\n low[u] = min(low[u],low[v]);\\n }\\n else{\\n low[u] = min(low[u],ord[v]);\\n }\\n if(ord[u] < low[v]) B.push_back((edgeB){u,v});\\n }\\n }\\n}\\n \\nvoid bridge(int n, vector<int> G[], vector<edgeB> &B){\\n B.clear();\\n int c = 0;\\n fill(ord,ord+n,-1);\\n for(int i=0;i<n;i++) if(ord[i]==-1) dfs(i,-1,c,G,B);\\n}\\n\\n\\nint A[1111],B[1111];\\n\\nvoid make_graph(int x){\\n for(int i=0;i<N;i++) G[i].clear();\\n for(int i=0;i<N;i++) rG[i].clear();\\n for(int i=0;i<M;i++){\\n if( i == x ) continue;\\n add_edge( A[i], B[i] );\\n }\\n}\\n\\nvoid make_graph2(int x){\\n for(int i=0;i<N;i++) G[i].clear();\\n for(int i=0;i<M;i++){\\n if( i == x ) continue;\\n G[A[i]].push_back( B[i] );\\n G[B[i]].push_back( A[i] );\\n }\\n}\\n\\nint main(){\\n cin >> N >> M; \\n V = N;\\n for(int i=0;i<M;i++){\\n cin >> A[i] >> B[i]; --A[i]; --B[i];\\n }\\n if( N == 3 ){\\n cout << \\\"YES\\\" << endl; return 0;\\n } else if( M == N-1 ){\\n cout << \\\"NO\\\" << endl; return 0;\\n }\\n \\n for(int i=0;i<M;i++){\\n make_graph(i);\\n int n = scc();\\n if( n == N ){\\n make_graph2(i);\\n vector<edgeB> E;\\n bridge( N, G, E );\\n if( E.size() >= 2 ) {\\n\\tcout << \\\"YES\\\" << endl; return 0;\\n }\\n }\\n }\\n cout << \\\"NO\\\" << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1284,\n \"score_of_the_acc\": -0.0149,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2794_2001187\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef pair<int, int> pii;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\n\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define fi first\\n#define se second\\n#define rep(i,n) rep2(i,0,n)\\n#define rep2(i,m,n) for(int i=m;i<(n);i++)\\n#define ALL(c) (c).begin(),(c).end()\\n\\nclass unionfind {\\n\\tvector<int> par, rank;\\n\\npublic:\\n\\tvoid init(int n) {\\n\\t\\tpar.resize(n);\\n\\t\\trank.resize(n);\\n\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tpar[i] = i;\\n\\t\\t\\trank[i] = 0;\\n\\t\\t}\\n\\t}\\n\\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\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x);\\n\\t\\ty = find(y);\\n\\t\\tif (x == y) return ;\\n\\n\\t\\tif (rank[x] < rank[y]) par[x] = y;\\n\\t\\telse {\\n\\t\\t\\tpar[y] = x;\\n\\t\\t\\tif (rank[x] == rank[y]) ++rank[x];\\n\\t\\t}\\n\\t}\\n\\n\\tbool same(int x, int y) { return (find(x) == find(y)); }\\n} uf;\\n\\n#define MAX_V 510\\n\\nint V;\\nvector<int> G[MAX_V], rG[MAX_V];\\nvector<int> vs; \\n\\nbool vis[MAX_V];\\nint cmp[MAX_V]; \\n\\nvoid add_edge(int from, int to)\\n{\\n\\tG[from].pb(to);\\n\\trG[to].pb(from);\\n}\\n\\nvoid dfs(int v)\\n{\\n\\tvis[v] = true;\\n\\n\\tfor (int to : G[v]) {\\n\\t\\tif (!vis[to]) dfs(to);\\n\\t}\\n\\n\\tvs.push_back(v);\\n}\\n\\nvoid rdfs(int v, int k)\\n{\\n\\tvis[v] = true;\\n\\tcmp[v] = k;\\n\\n\\tfor (int to : rG[v]) {\\n\\t\\tif (!vis[to]) rdfs(to, k);\\n\\t}\\n}\\n\\nint scc()\\n{\\n\\tmemset(vis, 0, sizeof(vis));\\n\\tvs.clear();\\n\\n\\trep(v, V) if (!vis[v]) dfs(v);\\n\\n\\tmemset(vis, 0, sizeof(vis));\\n\\n\\tint k = 0;\\n\\treverse(ALL(vs));\\n\\n\\tfor (int v : vs) {\\n\\t\\tif (!vis[v]) rdfs(v, k++);\\n\\t}\\n\\n\\treturn k;\\n}\\n\\nclass LOWLINK {\\npublic:\\n\\tint V;\\n\\tvector<int> G[510];\\n\\tvector<pair<int, int> > bridge;\\n\\tint ord[510], low[510];\\n\\tbool vis[510];\\n\\tbool not1[510];\\n\\n\\tvoid init(int _V)\\n\\t{\\n\\t\\tV = _V;\\n\\t\\tmemset(vis, 0, sizeof(vis));\\n\\t\\tmemset(not1, 0, sizeof(not1));\\n\\t\\trep(i, V) G[i].clear();\\n\\t\\tbridge.clear();\\n\\t}\\n\\n\\tvoid calc()\\n\\t{\\n\\t\\tint k = 0;\\n\\t\\trep(i, V) if (!vis[i]) DFS(i, -1, k);\\n\\n\\t}\\n\\n\\tvoid add_edge(int a, int b)\\n\\t{\\n\\t\\tG[a].pb(b); G[b].pb(a);\\n\\t}\\n\\n\\tvoid DFS(int v, int p, int &k)\\n\\t{\\n\\t\\tvis[v] = true;\\n\\n\\t\\tord[v] = k++;\\n\\t\\tlow[v] = ord[v];\\n\\n\\t\\tbool isArticulation = false;\\n\\t\\tint ct = 0;\\n\\n\\t\\tfor (int i = 0; i < G[v].size(); i++) {\\n\\t\\t\\tif (!vis[G[v][i]]) {\\n\\t\\t\\t\\tct++;\\n\\t\\t\\t\\tDFS(G[v][i], v, k);\\n\\t\\t\\t\\tlow[v] = min(low[v], low[G[v][i]]);\\n\\t\\t\\t\\tif (ord[v] < low[G[v][i]]) {\\n\\t\\t\\t\\t\\tbridge.push_back(make_pair(min(v, G[v][i]), max(v, G[v][i])));\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnot1[v] = not1[G[v][i]] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if (G[v][i] != p) {\\n\\t\\t\\t\\tlow[v] = min(low[v], ord[G[v][i]]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n} T;\\n\\nint N, M;\\nint A[50010], B[50010];\\nint in[510];\\n\\nint main() {\\n\\tscanf(\\\"%d %d\\\", &N, &M);\\n\\n\\tV = N;\\n\\n\\trep(i, M) {\\n\\t\\tscanf(\\\"%d%d\\\", &A[i], &B[i]);\\n\\t\\t--A[i]; --B[i];\\n\\t\\t//add_edge(A[i], B[i]);\\n\\t}\\n\\n\\trep(i, M) {\\n\\t\\tT.init(N);\\n\\t\\trep(j, N) {\\n\\t\\t\\tG[j].clear();\\n\\t\\t\\trG[j].clear();\\n\\t\\t}\\n\\n\\t\\trep(j, M) if (j != i) {\\n\\t\\t\\tadd_edge(A[j], B[j]);\\n\\t\\t\\tT.add_edge(A[j],B[j]);\\n\\t\\t\\tT.add_edge(B[j],A[j]);\\n\\t\\t}\\n\\n\\t\\tint now = scc();\\n\\t\\tuf.init(N);\\n\\n\\t\\tbool ok = 1;\\n\\n\\t\\trep(j, N) {\\n\\t\\t\\tfor (int to : G[j]) {\\n\\t\\t\\t\\tif (cmp[j] == cmp[to]) {\\n\\t\\t\\t\\t\\tok = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tuf.unite(j, to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trep(j, N) {\\n\\t\\t\\tif (!uf.same(0,j)) ok=0;\\n\\t\\t}\\n\\t\\tT.calc();\\n\\n\\t\\tif (ok && T.bridge.size() >= 2) {\\n\\t\\t\\tputs(\\\"YES\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\tputs(\\\"NO\\\");\\n\\treturn 0;\\n\\n\\tint num = scc();\\n\\n\\tif (num == N) {\\n\\t\\tputs(\\\"CASE1\\\");\\n\\t\\tT.init(N);\\n\\n\\t\\trep(i, M) {\\n\\t\\t\\tT.add_edge(A[i], B[i]);\\n\\t\\t\\tT.add_edge(B[i], A[i]);\\n\\t\\t}\\n\\t\\tT.calc();\\n\\n\\t\\tcout<<T.bridge.size()<<endl;\\n\\n\\t\\tbool size_3 = 0;\\n\\t\\trep(i, N) if (T.not1[i]) size_3 = 1;\\n\\t\\tif (size_3 && T.bridge.size() >= 2) {\\n\\t\\t\\tputs(\\\"YES\\\");\\n\\t\\t} else {\\n\\t\\t\\tputs(\\\"NO\\\");\\n\\t\\t}\\n\\t} else {\\n\\t\\tputs(\\\"CASE2\\\");\\n\\t\\tmemset(in, -1, sizeof(in));\\n\\n\\t\\tvi cand;\\n\\t\\tint id = -1;\\n\\t\\trep(i, N) cout << cmp[i] << endl;\\n\\t\\trep(i, M) {\\n\\t\\t\\tif (cmp[A[i]] == cmp[B[i]]) {\\n\\t\\t\\t\\tif (in[B[i]] != -1 || (id != -1 && cmp[A[i]] != id)) {\\n\\t\\t\\t\\t\\tputs(\\\"NO\\\");\\n\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tid = cmp[A[i]];\\n\\t\\t\\t\\tin[B[i]] = A[i];\\n\\t\\t\\t\\tcand.pb(A[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<cand.size()<<endl;\\n\\n\\t\\tif (num - 1 + (int)cand.size() != N) {\\n\\t\\t\\tputs(\\\"NO\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tputs(\\\"DEB\\\");\\n\\t\\tfor (int v : cand) {\\n\\t\\t\\tT.init(N);\\n\\t\\t\\trep(i, M) {\\n\\t\\t\\t\\tif (!(A[i] == in[v] && B[i] == v)) {\\n\\t\\t\\t\\t\\tT.add_edge(A[i], B[i]);\\n\\t\\t\\t\\t\\tT.add_edge(B[i], A[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tT.calc();\\n\\t\\t\\tif ((int)T.bridge.size() >= 2) {\\n\\t\\t\\t\\tputs(\\\"YES\\\");\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tputs(\\\"NO\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.3625,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2794_2001159\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define all(v) (v).begin(),(v).end()\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\n#define pb push_back\\n#define fi first\\n#define se second\\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\\nnamespace SCC{\\n void visit(const vector<vector<int>>&G,vector<int>&vs,vector<int>&used,int v){\\n used[v]=true;\\n for(auto u:G[v]){\\n if(!used[u])visit(G,vs,used,u);\\n }\\n vs.push_back(v);\\n }\\n\\n void visit2(const vector<vector<int>>&T,vector<int>&used,vector<int>&comp,vector<int>&vec,int k,int v){\\n comp[v]=k;\\n used[v]=true;\\n vec.push_back(v);\\n\\n for(auto u:T[v]){\\n if(!used[u])visit2(T,used,comp,vec,k,u);\\n }\\n }\\n\\n //G:?????£?????????????§£???????????°??????\\n //H:?????£??????????????°??????1???????????????????´?????????°??????\\n //comp:G????????????????????????H?????????????±????????????????\\n void decompose(const vector<vector<int>>&G,vector<vector<int>>&H,vector<int>&comp){\\n vector<vector<int>>T(G.size());\\n for(int i=0;i<G.size();i++){\\n for(auto v:G[i]){\\n T[v].push_back(i);\\n }\\n }\\n comp.resize(G.size());\\n\\n vector<int>vs(G.size());\\n vector<int>used(G.size());\\n for(int i=0;i<G.size();i++){\\n if(!used[i])visit(G,vs,used,i);\\n }\\n reverse(vs.begin(),vs.end());\\n fill(used.begin(),used.end(),0);\\n\\n int K=0;\\n vector<vector<int>>S;\\n for(auto v:vs){\\n if(!used[v]){\\n S.push_back(vector<int>());\\n visit2(T,used,comp,S.back(),K++,v);\\n }\\n }\\n\\n H.resize(K);\\n fill(used.begin(),used.end(),0);\\n for(int i=0;i<K;i++){\\n for(auto v:S[i]){\\n for(auto u:G[v]){\\n if(used[comp[u]]||comp[v]==comp[u])continue;\\n used[comp[u]]=true;\\n H[comp[v]].push_back(comp[u]);\\n }\\n }\\n for(auto v:H[i])used[v]=false;\\n }\\n\\n }\\n}\\n\\nstruct UF{\\n vector<int>par,sz;\\n void init(int n){\\n par.resize(n);\\n sz.resize(n);\\n for(int i=0;i<n;i++){\\n par[i]=i;\\n sz[i]=1;\\n }\\n }\\n int find(int x){\\n return x==par[x]?x:par[x]=find(par[x]);\\n }\\n void unite(int x,int y){\\n x=find(x);y=find(y);\\n if(x==y)return;\\n sz[x]+=sz[y];\\n par[y]=x;\\n }\\n bool same(int x,int y){\\n return find(x)==find(y);\\n }\\n int size(int x){\\n return sz[find(x)];\\n }\\n};\\n\\nvector<vint>G;\\nvector<pair<int, int> > bridge;\\nint ord[1000], low[1000];\\nbool vis[1000];\\n\\nvoid dfs(int v, int p, int &k)\\n{\\n\\tvis[v] = true;\\n\\n\\tord[v] = k++;\\n\\tlow[v] = ord[v];\\n\\n\\tfor (int i = 0; i < G[v].size(); i++){\\n\\t\\tif (!vis[G[v][i]]){\\n\\t\\t\\tdfs(G[v][i], v, k);\\n\\t\\t\\tlow[v] = min(low[v], low[G[v][i]]);\\n\\t\\t\\tif (ord[v] < low[G[v][i]]) bridge.push_back(make_pair(min(v, G[v][i]), max(v, G[v][i])));\\n\\t\\t}\\n\\t\\telse if (G[v][i] != p){\\n\\t\\t\\tlow[v] = min(low[v], ord[G[v][i]]);\\n\\t\\t}\\n\\t}\\n}\\n\\nint A[100000],B[100000];\\n\\nsigned main(){\\n int N,M;\\n cin>>N>>M;\\n rep(i,M)cin>>A[i]>>B[i],A[i]--,B[i]--;\\n\\n bool flag=false;\\n int deg[1000]={};\\n {\\n vector<vint>G(N),H;\\n rep(i,M)G[A[i]].pb(B[i]);\\n vint comp;\\n SCC::decompose(G,H,comp);\\n rep(i,M){\\n if(comp[A[i]]==comp[B[i]])deg[B[i]]++;\\n }\\n if(H.size()==N)flag=true;\\n }\\n\\n if(!flag){\\n rep(i,M){\\n if(deg[B[i]]!=1)continue;\\n UF uf;\\n uf.init(N);\\n rep(j,M)if(i!=j)uf.unite(A[j],B[j]);\\n bool ok=true;\\n rep(j,N)if(uf.find(j)!=uf.find(0))ok=false;\\n if(!ok)continue;\\n G=vector<vint>(N);\\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]);\\n vector<vint>H;vint comp;\\n SCC::decompose(G,H,comp);\\n if(H.size()!=N)continue;\\n G=vector<vint>(N);\\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]),G[B[j]].pb(A[j]);\\n memset(vis,0,sizeof(vis));\\n int K=0;\\n bridge.clear();\\n dfs(0,-1,K);\\n if(bridge.size()>=2){\\n cout<<\\\"YES\\\"<<endl;\\n return 0;\\n }\\n }\\n cout<<\\\"NO\\\"<<endl;\\n return 0;\\n }\\n else{\\n rep(i,M){\\n UF uf;\\n uf.init(N);\\n rep(j,M)if(i!=j)uf.unite(A[j],B[j]);\\n bool ok=true;\\n rep(j,N)if(uf.find(j)!=uf.find(0))ok=false;\\n if(!ok)continue;\\n G=vector<vint>(N);\\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]);\\n vector<vint>H;vint comp;\\n SCC::decompose(G,H,comp);\\n if(H.size()!=N)continue;\\n G=vector<vint>(N);\\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]),G[B[j]].pb(A[j]);\\n memset(vis,0,sizeof(vis));\\n int K=0;\\n bridge.clear();\\n dfs(0,-1,K);\\n if(bridge.size()>=2){\\n cout<<\\\"YES\\\"<<endl;\\n return 0;\\n }\\n }\\n cout<<\\\"NO\\\"<<endl;\\n return 0;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -0.2934,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2794_2001136\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define for_(i,a,b) for(int i=(a);i<(b);++i)\\n#define for_rev(i,a,b) for(int i=(a);i>=(b);--i)\\n#define allof(a) (a).begin(),(a).end()\\n#define minit(a,b) memset(a,b,sizeof(a))\\n#define size_of(a) int((a).size())\\n#define cauto const auto\\n\\ntypedef pair< int, int > pii;\\ntemplate< typename T > using Vec = vector< T >;\\n\\nclass StronglyConnectedComponentDecomposition {\\npublic:\\n\\tstruct Result {\\n\\t\\tVec< int > topol;\\n\\t\\tVec< Vec< int > > dag;\\n\\t};\\n\\t\\nprivate:\\n\\tint N;\\n\\tconst Vec< Vec< int > >& adj;\\n\\tVec< Vec< int > > rev_adj;\\n\\t\\n\\tVec< int > rev_order;\\n\\tVec< bool > used;\\t\\n\\tVec< int > topol;\\n\\t\\n\\tvoid dfs(int v) {\\n\\t\\tused[v] = true;\\n\\t\\tfor (int u : adj[v]) if (!used[u]) dfs(u);\\n\\t\\trev_order.push_back(v);\\n\\t}\\n\\t\\n\\tvoid revDfs(int v, int k) {\\n\\t\\tused[v] = true;\\n\\t\\ttopol[v] = k;\\n\\t\\tfor (int u : rev_adj[v]) if (!used[u]) revDfs(u, k);\\n\\t}\\n\\t\\npublic:\\n\\tStronglyConnectedComponentDecomposition(const Vec< Vec< int > >& _adj_) : N(_adj_.size()), adj(_adj_) {\\n\\t\\trev_adj.assign(N, Vec< int >());\\n\\t\\tfor_(v,0,N) for (int u : adj[v]) rev_adj[u].push_back(v);\\n\\t}\\n\\t\\n\\tResult decomposition() {\\n\\t\\tused.assign(N, false);\\n\\t\\trev_order.clear();\\n\\t\\ttopol.assign(N, -1);\\n\\t\\t\\n\\t\\tfor_(v,0,N) if (!used[v]) dfs(v);\\n\\t\\t\\n\\t\\tfill(allof(used), false);\\n\\t\\t\\n\\t\\tint k = 0, m = rev_order.size();\\n\\t\\t\\n\\t\\tfor_rev(i,m-1,0) {\\n\\t\\t\\tint v = rev_order[i];\\n\\t\\t\\tif (!used[v]) revDfs(v, k++);\\n\\t\\t}\\n\\t\\t\\n\\t\\tVec< Vec< int > > dag(k);\\n\\t\\t\\n\\t\\tfor_(v,0,N) {\\n\\t\\t\\tint tv = topol[v];\\n\\t\\t\\t\\n\\t\\t\\tfor (int u : adj[v]) {\\n\\t\\t\\t\\tint tu = topol[u];\\n\\t\\t\\t\\tif (tv != tu) dag[tv].push_back(tu);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor_(i,0,k) {\\n\\t\\t\\tsort(allof(dag[i]));\\n\\t\\t\\tdag[i].erase(unique(allof(dag[i])), dag[i].end());\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn Result{ topol, dag };\\n\\t}\\n};\\n\\nclass FindBridge {\\nprivate:\\n\\tint V;\\n\\tVec< set< int > > adj;\\n\\t\\n\\tVec< int > low, pre;\\n\\tVec< bool > vis;\\n\\t\\n\\tint dfs(int v, int& count, int p, Vec< pii >& br) {\\n\\t\\tpre[v] = count++;\\n\\t\\tlow[v] = pre[v];\\n\\t\\tvis[v] = true;\\n\\t\\t\\n\\t\\tfor (int u : adj[v]) {\\n\\t\\t\\tif (pre[u] == -1) {\\n\\t\\t\\t\\tlow[v] = min(low[v], dfs(u, count, v, br));\\n\\t\\t\\t\\tif (low[u] == pre[u]) br.push_back(pii(v, u));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif (u != p) low[v] = min(low[v], low[u]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn low[v];\\n\\t}\\n\\t\\npublic:\\n\\tFindBridge(int V__) : V(V__), adj(V__, set< int >()) {}\\n\\t\\n\\tvoid addEdge(int u, int v) {\\n\\t\\tadj[u].insert(v);\\n\\t\\tadj[v].insert(u);\\n\\t}\\n\\t\\n\\tVec< pii > get() {\\n\\t\\tVec< pii > br;\\n\\t\\tlow.assign(V, -1);\\n\\t\\tpre.assign(V, -1);\\n\\t\\tvis.assign(V, false);\\n\\t\\tint count = 0;\\n\\t\\tfor_(v,0,V) if (!vis[v]) dfs(0, count, -1, br);\\n\\t\\treturn br;\\n\\t}\\n\\t\\n\\tint count() {\\n\\t\\tVec< pii > br;\\n\\t\\tlow.assign(V, -1);\\n\\t\\tpre.assign(V, -1);\\n\\t\\tvis.assign(V, false);\\n\\t\\tint count = 0;\\n\\t\\tfor_(v,0,V) if (!vis[v]) dfs(0, count, -1, br);\\n\\t\\treturn br.size();\\n\\t}\\n};\\n\\nint N, M, a[1010], b[1010];\\nbool isbr[1010];\\nVec< Vec< int > > adj;\\n\\ntypedef StronglyConnectedComponentDecomposition SCC;\\n\\nint doSCC() {\\t\\n\\tSCC::Result scc = SCC(adj).decomposition();\\n\\tVec< int > vcnt(N, 0);\\n\\tfor_(v,0,N) vcnt[scc.topol[v]]++;\\n\\tint szov2 = 0;\\n\\tfor_(i,0,N) if (vcnt[i] >= 2) szov2++;\\n\\treturn szov2;\\n}\\n\\nvoid findBr() {\\n\\tFindBridge fb(N);\\n\\tfor_(i,0,M) fb.addEdge(a[i], b[i]);\\n\\tVec< pii > vp = fb.get();\\n\\t\\n\\tfor (pii p : vp) {\\n\\t\\tfor_(i,0,M) {\\n\\t\\t\\tif (p.first == a[i] && p.second == b[i]) isbr[i] = true;\\n\\t\\t\\tif (p.first == b[i] && p.second == a[i]) isbr[i] = true;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid solve() {\\n\\tfindBr();\\n\\t\\n\\tfor_(ig,0,M) {\\n\\t\\tif (isbr[ig]) continue;\\n\\t\\tadj.assign(N, Vec< int >());\\n\\t\\t\\n\\t\\tfor_(i,0,M) {\\n\\t\\t\\tif (i == ig) continue;\\n\\t\\t\\tadj[a[i]].push_back(b[i]);\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (doSCC() == 0) {\\n\\t\\t\\tFindBridge fb(N);\\n\\n\\t\\t\\tfor_(i,0,M) {\\n\\t\\t\\t\\tif (i == ig) continue;\\n\\t\\t\\t\\tfb.addEdge(a[i], b[i]);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (fb.count() >= 2) {\\n\\t\\t\\t\\tputs(\\\"YES\\\");\\n\\t\\t\\t\\texit(0);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tputs(\\\"NO\\\");\\n}\\n\\nint main() {\\n\\tcin >> N >> M;\\n\\tfor_(i,0,M) {\\n\\t\\tcin >> a[i] >> b[i];\\n\\t\\t--a[i]; --b[i];\\n\\t}\\n\\tsolve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3300,\n \"score_of_the_acc\": -0.3721,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2794_2000949\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define all(v) (v).begin(),(v).end()\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\n#define pb push_back\\n#define fi first\\n#define se second\\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\\nnamespace SCC{\\n void visit(const vector<vector<int>>&G,vector<int>&vs,vector<int>&used,int v){\\n used[v]=true;\\n for(auto u:G[v]){\\n if(!used[u])visit(G,vs,used,u);\\n }\\n vs.push_back(v);\\n }\\n\\n void visit2(const vector<vector<int>>&T,vector<int>&used,vector<int>&comp,vector<int>&vec,int k,int v){\\n comp[v]=k;\\n used[v]=true;\\n vec.push_back(v);\\n\\n for(auto u:T[v]){\\n if(!used[u])visit2(T,used,comp,vec,k,u);\\n }\\n }\\n\\n //G:?????£?????????????§£???????????°??????\\n //H:?????£??????????????°??????1???????????????????´?????????°??????\\n //comp:G????????????????????????H?????????????±????????????????\\n void decompose(const vector<vector<int>>&G,vector<vector<int>>&H,vector<int>&comp){\\n vector<vector<int>>T(G.size());\\n for(int i=0;i<G.size();i++){\\n for(auto v:G[i]){\\n T[v].push_back(i);\\n }\\n }\\n comp.resize(G.size());\\n\\n vector<int>vs(G.size());\\n vector<int>used(G.size());\\n for(int i=0;i<G.size();i++){\\n if(!used[i])visit(G,vs,used,i);\\n }\\n reverse(vs.begin(),vs.end());\\n fill(used.begin(),used.end(),0);\\n\\n int K=0;\\n vector<vector<int>>S;\\n for(auto v:vs){\\n if(!used[v]){\\n S.push_back(vector<int>());\\n visit2(T,used,comp,S.back(),K++,v);\\n }\\n }\\n\\n H.resize(K);\\n fill(used.begin(),used.end(),0);\\n for(int i=0;i<K;i++){\\n for(auto v:S[i]){\\n for(auto u:G[v]){\\n if(used[comp[u]]||comp[v]==comp[u])continue;\\n used[comp[u]]=true;\\n H[comp[v]].push_back(comp[u]);\\n }\\n }\\n for(auto v:H[i])used[v]=false;\\n }\\n\\n }\\n}\\n\\nstruct UF{\\n vector<int>par,sz;\\n void init(int n){\\n par.resize(n);\\n sz.resize(n);\\n for(int i=0;i<n;i++){\\n par[i]=i;\\n sz[i]=1;\\n }\\n }\\n int find(int x){\\n return x==par[x]?x:par[x]=find(par[x]);\\n }\\n void unite(int x,int y){\\n x=find(x);y=find(y);\\n if(x==y)return;\\n sz[x]+=sz[y];\\n par[y]=x;\\n }\\n bool same(int x,int y){\\n return find(x)==find(y);\\n }\\n int size(int x){\\n return sz[find(x)];\\n }\\n};\\n\\nvector<vint>G;\\nvector<pair<int, int> > bridge;\\nint ord[1000], low[1000];\\nbool vis[1000];\\n\\nvoid dfs(int v, int p, int &k)\\n{\\n\\tvis[v] = true;\\n\\n\\tord[v] = k++;\\n\\tlow[v] = ord[v];\\n\\n\\tfor (int i = 0; i < G[v].size(); i++){\\n\\t\\tif (!vis[G[v][i]]){\\n\\t\\t\\tdfs(G[v][i], v, k);\\n\\t\\t\\tlow[v] = min(low[v], low[G[v][i]]);\\n\\t\\t\\tif (ord[v] < low[G[v][i]]) bridge.push_back(make_pair(min(v, G[v][i]), max(v, G[v][i])));\\n\\t\\t}\\n\\t\\telse if (G[v][i] != p){\\n\\t\\t\\tlow[v] = min(low[v], ord[G[v][i]]);\\n\\t\\t}\\n\\t}\\n}\\nsigned main(){\\n int N,M;\\n int A[1000],B[1000];\\n cin>>N>>M;\\n rep(i,M)cin>>A[i]>>B[i],A[i]--,B[i]--;\\n\\n rep(i,M){\\n UF uf;\\n uf.init(N);\\n rep(j,M)if(i!=j)uf.unite(A[j],B[j]);\\n bool ok=true;\\n rep(j,N)if(uf.find(j)!=uf.find(0))ok=false;\\n if(!ok)continue;\\n G=vector<vint>(N);\\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]);\\n vector<vint>H;vint comp;\\n SCC::decompose(G,H,comp);\\n if(H.size()!=N)continue;\\n G=vector<vint>(N);\\n rep(j,M)if(i!=j)G[A[j]].pb(B[j]),G[B[j]].pb(A[j]);\\n memset(vis,0,sizeof(vis));\\n int K=0;\\n bridge.clear();\\n dfs(0,-1,K);\\n if(bridge.size()>=2){\\n cout<<\\\"YES\\\"<<endl;\\n return 0;\\n }\\n }\\n cout<<\\\"NO\\\"<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -0.4271,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":1681,"cells":{"group_id":{"kind":"string","value":"aoj_2789_cpp"},"problem_description":{"kind":"string","value":"Compressed Formula\nYou are given a simple, but long formula in a compressed format. A compressed formula is a sequence of $N$ pairs of an integer $r_i$ and a string $s_i$, which consists only of digits ('0'-'9'), '+', '-', and '*'. To restore the original formula from a compressed formula, first we generate strings obtained by repeating $s_i$ $r_i$ times for all $i$, then we concatenate them in order of the sequence.\nYou can assume that a restored original formula is well-formed. More precisely, a restored formula satisfies the following BNF:\n<expression> := <term> | <expression> '+' <term> | <expression> '-' <term>\n<term> := <number> | <term> * <number>\n<number> := <digit> | <non-zero-digit> <number>\n<digit> := '0' | <non-zero-digit>\n<non-zero-digit> := '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9'\nHere, '+' means addition, '-' means subtraction, and '*' means multiplication of integers.\nYour task is to write a program computing the answer of a given formula modulo 1,000,000,007, where $x$ modulo $m$ is a non-negative integer $r$ such that there exists an integer $k$ satisfying $x = km + r$ and $0 \\leq r < m$; it is guaranteed that such $r$ is uniquely determined for integers $x$ and $m$.\nInput\nThe input consists of a single test case.\n$N$\n$r_1$ $s_1$\n$r_2$ $s_2$\n...\n$r_N$ $s_N$\nThe first line contains a single integer $N$ ($1 \\leq N \\leq 10^4$), which is the length of a sequence of a compressed formula. The following $N$ lines represents pieces of a compressed formula. The $i$-th line consists of an integer $r_i$ ($1 \\leq r_i \\leq 10^9$) and a string $s_i$ ($1 \\leq |s_i| \\leq 10$), where $t_i$ is the number of repetition of $s_i$, and $s_i$ is a piece of an original formula. You can assume that an original formula, restored from a given compressed formula by concatenation of repetition of pieces, satisfies the BNF in the problem statement.\nOutput\nPrint the answer of a given compressed formula modulo 1,000,000,007.\nSample Input 1\n1\n5 1\nOutput for the Sample Input 1\n11111\nSample Input 2\n2\n19 2*\n1 2\nOutput for the Sample Input 2\n1048576\nSample Input 3\n2\n1 1-10\n10 01*2+1\nOutput for the Sample Input 3\n999999825\nSample Input 4\n4\n3 12+45-12\n4 12-3*2*1\n5 12345678\n3 11*23*45\nOutput for the Sample Input 4\n20008570"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2789_10865828","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B>\nbool chmax(A &a, B b) { return a < b && (a=b, true); }\ntemplate <class A, class B>\nbool chmin(A &a, B b) { return b < a && (a=b, true); }\n\ntemplate <int MD, int g = 3>\nstruct ModInt {\n using M = ModInt;\n const static inline M G = g;\n unsigned int v;\n ModInt() : v(0) {}\n ModInt(ll w) : v(w % MD + MD) {\n if(v >= MD) v -= MD;\n }\n static M raw(unsigned int v) {\n M res;\n res.v = (v < MD) ? v : v - MD;\n return res;\n }\n explicit operator bool() const {\n return v != 0;\n }\n M operator-() const {\n return M() - *this;\n }\n M operator+(M r) const {\n return raw(v + r.v);\n }\n M operator-(M r) const {\n return raw(v + MD - r.v);\n }\n M operator*(M r) const {\n return raw(ll(v) * r.v % MD);\n }\n M operator/(M r) const {\n return *this * r.inv();\n }\n M& operator+=(M r) {\n return *this = *this + r;\n }\n M& operator-=(M r) {\n return *this = *this - r;\n }\n M& operator*=(M r) {\n return *this = *this * r;\n }\n M& operator/=(M r) {\n return *this = *this / r;\n }\n bool operator==(M r) const {\n return v == r.v;\n }\n M pow(ll n) const {\n M 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 M inv() const {\n return pow(MD - 2);\n }\n friend ostream& operator<<(ostream& os, M r) {\n return os << r.v;\n }\n};\nusing Mint = ModInt<1000000007>;\n\nconst int Z = 4;\nusing Node = array<array<Mint, Z>, Z>;\nNode mul(Node l, Node r){\n Node res;\n REP(i,Z) REP(j,Z) REP(k,Z) res[i][k] += l[i][j] * r[j][k];\n return res;\n}\nNode pow(Node a, ll i){\n if(i == 0){\n Node res;\n REP(i,Z) res[i][i] = 1;\n return res;\n }\n auto b = pow(mul(a,a), i/2);\n if(i%2 == 1) b = mul(b, a);\n return b;\n}\n\nvoid testcase(){\n ll N; cin >> N;\n Node res;\n res[0][3] = 1;\n res[0][0] = 1;\n REP(i,N){\n ll t; cin >> t;\n string s; cin >> s;\n Node x = pow(Node(), 0);\n for(auto c : s){\n Node y;\n if('0' <= c && c <= '9'){\n y[0][0] = 1;\n y[0][1] = c - '0';\n y[1][1] = 10;\n y[2][2] = 1;\n y[3][3] = 1;\n } else if(c == '*'){\n y[1][0] = 1;\n y[2][2] = 1;\n y[3][3] = 1;\n } else if(c == '+' || c == '-') {\n Mint co = (c == '-' ? -1 : 1);\n y[3][0] = co;\n y[1][2] = 1;\n y[2][2] = 1;\n y[3][3] = 1;\n }\n x = mul(x, y);\n }\n res = mul(res, pow(x, t));\n }\n Mint ans = res[0][1] + res[0][2];\n cout << ans.v << \"\\n\";\n}\n\nint main() {\n cin.tie(nullptr)->sync_with_stdio(false);\n testcase();\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3444,"score_of_the_acc":-0.1036,"final_rank":8},{"submission_id":"aoj_2789_10852778","code_snippet":"#include <bits/stdtr1c++.h>\n\n#define MOD 1000000007\n#define clr(ar) memset(ar, 0, sizeof(ar))\n\nusing namespace std;\n\nstruct Matrix{\n int row, col, ar[5][5];\n\n Matrix(){}\n Matrix(int n, int m, int diagonal = 0){\n clr(ar);\n row = n, col = m;\n for (int i = min(n, m) - 1; i >= 0; i--) ar[i][i] = diagonal;\n }\n\n Matrix operator* (const Matrix& other) const{\n int i, j, k;\n\t\tMatrix res(row, other.col);\n\n\t\tfor(i = 0; i < row; i++){\n\t\t\tfor(j = 0; j < other.col; j++){\n long long x = 0;\n\t\t\t\tfor(k = 0; k < col; k++){\n\t\t\t\t\tx += ((long long)ar[i][k] * other.ar[k][j]);\n\t\t\t\t}\n\t\t\t\tres.ar[i][j] = x % MOD;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tMatrix operator^ (long long n) const{\n\t Matrix x = *this, res = Matrix(row, col, 1);\n\t\twhile (n){\n\t\t\tif (n & 1) res = res * x;\n\t\t\tn = n >> 1, x = x * x;\n\t\t}\n\t\treturn res;\n\t}\n} add, sub, mul, res;\n\nconst int n = 4;\nchar str[10010];\n\nvoid generate(){\n add = Matrix(n, n, 1);\n for (int i = 0; i < 2; i++){\n swap(add.ar[i + 1][i + 1], add.ar[i][i + 2]);\n }\n\n sub = add;\n sub.ar[1][3] = MOD - 1;\n\n mul = sub;\n mul.ar[1][3] = 0;\n swap(mul.ar[0][2], mul.ar[1][2]);\n\n res = Matrix(n, n);\n res.ar[1][0] = res.ar[3][0] = 1;\n}\n\nvoid run(int k, const char* str){\n int i, j;\n Matrix x = Matrix(n, n, 1);\n\n for (i = 0; str[i]; i++){\n if (str[i] == '+') x = add * x;\n else if (str[i] == '-') x = sub * x;\n else if (str[i] == '*') x = mul * x;\n else{\n Matrix y = Matrix(n, n, 1);\n y.ar[2][1] = str[i] - 48, y.ar[2][2] *= 10;\n x = y * x;\n }\n }\n\n x = x ^ k;\n res = x * res;\n}\n\nint main(){\n generate();\n int q, i, j, k, l, x, y, z;\n\n scanf(\"%d\", &q);\n while (q--){\n scanf(\"%d %s\", &k, str);\n run(k, str);\n }\n\n res = add * res;\n printf(\"%d\\n\", res.ar[0][0]);\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3588,"score_of_the_acc":-0.0658,"final_rank":5},{"submission_id":"aoj_2789_8525882","code_snippet":"#include <bits/stdc++.h>\n// 04:00\n\nconstexpr long long mod = 1000000007;\n\nlong long mod_pow(long long base, long long exp) {\n long long res = 1;\n while (exp > 0) {\n if (exp & 1) {\n res *= base;\n res %= mod;\n }\n base *= base;\n base %= mod;\n exp >>= 1;\n }\n return res;\n}\n\n// sum (k ^ i) (0 <= i < n)\nlong long sum_mul(long long k, long long n) {\n if (k == 0) return 0;\n if (k == 1) return n;\n long long res = (mod_pow(k, n) - 1 + mod) % mod;\n res *= mod_pow(k - 1, mod - 2);\n res %= mod;\n return res;\n}\n\nstruct SimpleParser {\n using CopyIter = std::string::const_iterator;\n using Iter = CopyIter&;\n std::string line;\n\n SimpleParser(std::string s): line(s) {}\n\n void skip(Iter it, char c) {\n assert(*it == c);\n ++it;\n }\n\n long long parse() {\n // std::cerr << \"start\" << std::endl;\n auto it = line.cbegin();\n auto res = expr(it);\n // std::cerr << \"finish\" << std::endl;\n return res;\n }\n\n long long expr(Iter it) {\n auto res = term(it);\n while (it != line.end() && (*it == '+' || *it == '-')) {\n auto op = *it;\n if (op == '+') {\n skip(it, '+');\n res = (res + term(it)) % mod;\n } else {\n skip(it, '-');\n res = (res - term(it) + mod) % mod;\n }\n }\n return res;\n }\n\n long long term(Iter it) {\n auto res = factor(it);\n while (it != line.end() && (*it == '*')) {\n skip(it, '*');\n res = res * factor(it) % mod;\n }\n return res;\n }\n\n long long factor(Iter it) {\n bool minus = false;\n if (*it == '+') {\n skip(it, '+');\n } else if (*it == '-') {\n skip(it, '-');\n minus = true;\n }\n auto res = number(it);\n if (minus) {\n res = (2 * mod - res) % mod;\n }\n return res;\n }\n\n long long number(Iter it) {\n long long res = 0;\n while (it != line.end() && std::isdigit(*it)) {\n char c = *it;\n skip(it, c);\n res = 10 * res + c - '0';\n res %= mod;\n }\n return res;\n }\n};\n\n// + - *\nstd::pair<long long, std::string> to_A(const std::pair<long long, std::string>& line) {\n auto [r, s] = line;\n size_t pos = 0;\n\n if (s.find('+') != std::string::npos) {\n pos = std::max(pos, s.find_last_of('+'));\n }\n if (s.find('-') != std::string::npos) {\n pos = std::max(pos, s.find_last_of('-'));\n }\n\n std::string lhs = s.substr(0, pos);\n std::string rhs = s.substr(pos);\n assert(rhs.front() == '+' || rhs.front() == '-');\n SimpleParser parser(rhs + lhs);\n auto val = parser.parse();\n val = (r - 1) * val % mod;\n\n std::string res = (lhs + '+' + std::to_string(val) + rhs);\n return {1, res};\n}\n\n// *\nstd::pair<long long, std::string> to_B(const std::pair<long long, std::string>& line) {\n auto [r, s] = line;\n assert(s.find('*') != std::string::npos);\n size_t pos = s.find('*');\n\n std::string lhs = s.substr(0, pos);\n std::string rhs = s.substr(pos);\n assert(rhs.front() == '*');\n\n std::string temp = rhs + lhs;\n temp.erase(temp.begin());\n SimpleParser parser(temp);\n auto val = parser.parse();\n val = mod_pow(val, r - 1);\n std::string res = (lhs + \"*\" + std::to_string(val) + rhs);\n return {1, res};\n}\n\n// + -\nstd::pair<long long, std::string> to_C(const std::pair<long long, std::string>& line) {\n auto [r, s] = line;\n size_t pos = 0;\n\n if (s.find('+') != std::string::npos) {\n pos = std::max(pos, s.find_last_of('+'));\n }\n if (s.find('-') != std::string::npos) {\n pos = std::max(pos, s.find_last_of('-'));\n }\n\n std::string lhs = s.substr(0, pos);\n std::string rhs = s.substr(pos);\n assert(rhs.front() == '+' || rhs.front() == '-');\n SimpleParser parser(rhs + lhs);\n auto val = parser.parse();\n val = (r - 1) * val % mod;\n\n std::string res = (lhs + '+' + std::to_string(val) + rhs);\n return {1, res};\n}\n\nstd::pair<long long, std::string> to_D(const std::pair<long long, std::string>& line) {\n return line;\n}\n\nstd::pair<long long, std::string> preprocess(const std::pair<long long, std::string>& line) {\n auto [r, s] = line;\n bool has_plus_or_minus = (s.find('+') != std::string::npos) || (s.find('-') != std::string::npos);\n bool has_mul = (s.find('*') != std::string::npos);\n\n if (has_plus_or_minus && has_mul) {\n return to_A(line);\n } else if (has_mul) {\n return to_B(line);\n } else if (has_plus_or_minus) {\n return to_C(line);\n } else {\n return to_D(line);\n }\n}\n\nstd::string concat(const std::vector<std::pair<long long, std::string>>& formulas) {\n // std::cerr << \"start concat\" << std::endl;\n std::string res;\n long long val = 0;\n for (int i = 0; i < (int)formulas.size(); i++) {\n // std::cerr << \"concat roop \" << i << std::endl;\n auto [r, s] = formulas[i];\n if (r != 1) {\n // std::cerr << \"ASDASDASDASD\" << std::endl;\n assert(std::all_of(s.begin(), s.end(), [](char c) { return std::isdigit(c); }));\n val *= mod_pow(10, s.size() * r);\n val %= mod;\n\n long long k = mod_pow(10, s.size());\n SimpleParser parser(s);\n auto s_val = parser.parse();\n val += s_val * sum_mul(k, r) % mod;\n val %= mod;\n } else {\n // std::cerr << \"ASDASD\" << std::endl;\n for (int j = 0; j < (int)s.size(); j++) {\n if (std::isdigit(s[j])) {\n val = (10 * val + s[j] - '0') % mod;\n } else {\n res += std::to_string(val);\n val = 0;\n res.push_back(s[j]);\n }\n }\n }\n\n if (i + 1 == (int)formulas.size()) {\n res += std::to_string(val);\n val = 0;\n }\n }\n // std::cerr << \"end concat\" << std::endl;\n return res; \n}\n\nint main() {\n int n;\n std::cin >> n;\n std::vector<std::pair<long long, std::string>> formulas;\n for (int i = 0; i < n; i++) {\n long long r;\n std::string s;\n std::cin >> r >> s;\n formulas.push_back(preprocess({r, s}));\n }\n\n // std::cerr << \"------------ \" << std::endl;\n // std::cerr << \"after preprocess \" << std::endl;\n // for (auto [r, s]: formulas) {\n // std::cerr << r << ' ' << s << std::endl;\n // }\n std::string line = concat(formulas);\n // std::cerr << \"------------ \" << std::endl;\n // std::cerr << \"after concat \" << std::endl;\n // std::cerr << line << std::endl;\n\n SimpleParser parser(line);\n std::cout << parser.parse() << std::endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4444,"score_of_the_acc":-0.0663,"final_rank":6},{"submission_id":"aoj_2789_8403939","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// 最初 * がないと思って誤読した．痛すぎる．\nconst long long mod = 1000000007;\n\nlong long modpow(long long a, long long b, long long m) {\n long long p = 1, q = a;\n for (int i = 0; i < 60; i++) {\n if ((b >> i) & 1) { p *= q; p %= m; }\n q *= q; q %= m;\n }\n return p;\n}\n\nlong long Division(long long a, long long b, long long m) {\n return (a * modpow(b, m - 2, m)) % m;\n}\n\n// ================================================ Solve Function ================================================\nlong long StoiMod(string str) {\n long long eval = 0;\n for (int i = 0; i < (int)str.size(); i++) {\n eval *= 10LL;\n eval += (long long)(str[i] - '0');\n eval %= mod;\n }\n return eval;\n}\n\nlong long Repeat(string str, long long rep) {\n long long val1 = modpow(10, (long long)str.size(), mod);\n long long val2 = modpow(val1, rep, mod);\n long long val3 = Division((val2 + mod - 1) % mod, (val1 + mod - 1) % mod, mod);\n long long base = StoiMod(str);\n return val3 * base % mod;\n}\n\nlong long Solve(vector<pair<string, long long>> Vec) {\n long long Answer1 = 1;\n long long Answer2 = 1;\n vector<vector<string>> List(Vec.size(), vector<string>{});\n /*cout << \"Solve:\" << endl;\n for (int i = 0; i < Vec.size(); i++) cout << \" - \" << Vec[i].first << \" \" << Vec[i].second << endl;*/\n\n // Decompression\n for (int i = 0; i < (int)Vec.size(); i++) {\n string str = \"\";\n for (int j = 0; j < (int)Vec[i].first.size(); j++) {\n if (Vec[i].first[j] == '*') {\n List[i].push_back(str);\n str = \"\";\n }\n else str += Vec[i].first[j];\n }\n List[i].push_back(str);\n }\n\n // Pattern 1\n for (int i = 0; i < (int)Vec.size(); i++) {\n if (List[i].size() == 1) continue;\n for (int j = 1; j < (int)List[i].size() - 1; j++) {\n long long val = StoiMod(List[i][j]);\n Answer1 *= modpow(val, Vec[i].second, mod);\n Answer1 %= mod;\n }\n string str = \"\";\n str += List[i][List[i].size() - 1];\n str += List[i][0];\n long long val = StoiMod(str);\n Answer1 *= modpow(val, Vec[i].second - 1, mod);\n Answer1 %= mod;\n }\n\n // Pattern 2\n int cx = 0;\n while (cx < (int)Vec.size()) {\n int Fin = cx;\n bool Flag = false;\n long long Current = 0;\n if (List[cx].size() == 1) Current = Repeat(List[cx][List[cx].size() - 1], Vec[cx].second);\n if (List[cx].size() >= 2) Current = Repeat(List[cx][List[cx].size() - 1], 1);\n\n // Going Forward\n for (int i = cx + 1; i < (int)Vec.size(); i++) {\n long long Len = List[i][0].size();\n long long Tim = Vec[i].second; if (List[i].size() >= 2) Tim = 1;\n Current *= modpow(10LL, Len * Tim, mod);\n Current %= mod;\n Fin = i;\n Current += Repeat(List[i][0], Tim);\n Current %= mod;\n if (List[i].size() >= 2) break;\n if (i == (int)Vec.size() - 1) Flag = true;\n }\n\n // Terminal\n Answer2 *= Current;\n Answer2 %= mod;\n if (Flag == true || cx == (int)Vec.size() - 1) break;\n cx = Fin;\n }\n if (List[0].size() >= 2) {\n Answer2 *= Repeat(List[0][0], 1);\n Answer2 %= mod;\n }\n\n // Return\n /*cout << \" - Return = \" << Answer1 * Answer2 % mod << \" (\" << Answer1 << \",\" << Answer2 << \")\" << endl;\n cout << endl;*/\n return Answer1 * Answer2 % mod;\n}\n\n// ================================================ Main Function ================================================\nlong long N;\nlong long R[1 << 19];\nstring S[1 << 19];\n\nint main() {\n // Step 1. Input\n cin >> N;\n for (int i = 0; i < N; i++) cin >> R[i] >> S[i];\n vector<pair<string, long long>> Current;\n char CurrentFugo = '+';\n long long Answer = 0;\n\n // Step 2. Get Answer (Part 1)\n for (int i = 0; i < N; i++) {\n string str = \"\";\n for (int j = 0; j < (int)S[i].size(); j++) {\n if (S[i][j] == '+' || S[i][j] == '-') {\n Current.push_back(make_pair(str, 1));\n long long eval = Solve(Current);\n if (CurrentFugo == '+') Answer = (Answer + eval + mod) % mod;\n if (CurrentFugo == '-') Answer = (Answer - eval + mod) % mod;\n str = \"\";\n CurrentFugo = S[i][j];\n Current.clear();\n }\n else str += S[i][j];\n }\n if (str.size() == S[i].size()) Current.push_back(make_pair(str, R[i]));\n if (str.size() != S[i].size()) Current.push_back(make_pair(str, 1LL));\n if (i == N - 1) {\n long long eval = Solve(Current);\n if (CurrentFugo == '+') Answer = (Answer + eval + mod) % mod;\n if (CurrentFugo == '-') Answer = (Answer - eval + mod) % mod;\n }\n }\n\n // Step 3. Get Answer (Part 2)\n for (int i = 0; i < N; i++) {\n string str = \"\";\n char Fugo = '.';\n for (int j = 0; j < (int)S[i].size() * 2; j++) {\n if (S[i][j % S[i].size()] == '+' || S[i][j % S[i].size()] == '-') {\n if (Fugo != '.') {\n long long eval = Solve(vector<pair<string, long long>>{make_pair(str, 1LL)});\n long long tm = R[i] - 1;\n eval = (eval * tm) % mod;\n if (Fugo == '+') Answer = (Answer + eval + mod) % mod;\n if (Fugo == '-') Answer = (Answer - eval + mod) % mod;\n }\n Fugo = S[i][j];\n str = \"\";\n if (j >= S[i].size()) break;\n }\n else str += S[i][j % S[i].size()];\n }\n }\n\n // Step 3. Output\n cout << Answer << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":21852,"score_of_the_acc":-1.0682,"final_rank":15},{"submission_id":"aoj_2789_8334831","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int MOD = 1000000007;\n\nclass modint {\nprivate:\n\tint x;\npublic:\n\tmodint() : x(0) {}\n\tmodint(long long n) : x(n >= 0 ? n % MOD : (n - (-n) % MOD) % MOD) {}\n\tint get() const { return x; }\n\tmodint& operator+=(const modint& m) { x = (x + m.x) % MOD; return *this; }\n\tmodint& operator*=(const modint& m) { x = 1LL * x * m.x % MOD; return *this; }\n\tmodint operator+(const modint& m) const { return modint(*this) += m; }\n\tmodint operator*(const modint& m) const { return modint(*this) *= m; }\n\tmodint pow(long long b) const {\n\t\tmodint a(*this);\n\t\tmodint res(1);\n\t\twhile (b >= 1) {\n\t\t\tif (b % 2 == 1) {\n\t\t\t\tres *= a;\n\t\t\t}\n\t\t\ta *= a;\n\t\t\tb /= 2;\n\t\t}\n\t\treturn res;\n\t}\n};\n\nclass value {\npublic:\n\tmodint m; long long digits;\n\tvalue() : m(modint()), digits(0) {}\n\tvalue(const modint& m_, long long digits_) : m(m_), digits(digits_) {}\n\tstring to_string() const {\n\t\treturn \"(\" + std::to_string(m.get()) + \",\" + std::to_string(digits) + \")\";\n\t}\n};\n\n// state type 0: l\n// state type 1: l] * [a] * [r\n// state type 2: l] * [a] + [b] + [c] * [r\n\nclass expression {\npublic:\n\tint tp;\n\tvalue l, r;\n\tmodint a, b, c;\n\texpression() : tp(-1), l(value()), r(value()), a(modint()), b(modint()), c(modint()) {}\n\texpression(const value& l_) : tp(1), l(l_), r(value()), a(modint()), b(modint()), c(modint()) {}\n\texpression(const value& l_, const modint& a_, const value& r_) : tp(2), l(l_), r(r_), a(a_), b(modint()), c(modint()) {}\n\texpression(const value& l_, const modint& a_, const modint& b_, const modint& c_, const value& r_) : tp(3), l(l_), r(r_), a(a_), b(b_), c(c_) {}\n\tstring to_string() const {\n\t\tif (tp == 1) {\n\t\t\treturn \"?\" + l.to_string() + \"?\";\n\t\t}\n\t\tif (tp == 2) {\n\t\t\treturn \"?\" + l.to_string() + \"*\" + std::to_string(a.get()) + \"*\" + r.to_string() + \"?\";\n\t\t}\n\t\tif (tp == 3) {\n\t\t\treturn \"?\" + l.to_string() + \"*\" + std::to_string(a.get()) + \"+\" + std::to_string(b.get()) + \"+\" + std::to_string(c.get()) + \"*\" + r.to_string() + \"?\";\n\t\t}\n\t\treturn string();\n\t}\n};\n\nvalue merge(const value& v1, const value& v2) {\n\treturn value(v1.m * modint(10).pow(v2.digits) + v2.m, v1.digits + v2.digits);\n}\n\nexpression merge(const expression& e1, const expression& e2) {\n\tif (e1.tp == 1 && e2.tp == 1) {\n\t\treturn expression(merge(e1.l, e2.l));\n\t}\n\tif (e1.tp == 1 && e2.tp == 2) {\n\t\treturn expression(merge(e1.l, e2.l), e2.a, e2.r);\n\t}\n\tif (e1.tp == 1 && e2.tp == 3) {\n\t\treturn expression(merge(e1.l, e2.l), e2.a, e2.b, e2.c, e2.r);\n\t}\n\tif (e1.tp == 2 && e2.tp == 1) {\n\t\treturn expression(e1.l, e1.a, merge(e1.r, e2.l));\n\t}\n\tif (e1.tp == 2 && e2.tp == 2) {\n\t\treturn expression(e1.l, e1.a * merge(e1.r, e2.l).m * e2.a, e2.r);\n\t}\n\t// state type 0: l\n\t// state type 1: l] * [a] * [r\n\t// state type 2: l] * [a] + [b] + [c] * [r\n\tif (e1.tp == 2 && e2.tp == 3) {\n\t\treturn expression(e1.l, e1.a * merge(e1.r, e2.l).m * e2.a, e2.b, e2.c, e2.r);\n\t}\n\tif (e1.tp == 3 && e2.tp == 1) {\n\t\treturn expression(e1.l, e1.a, e1.b, e1.c, merge(e1.r, e2.l));\n\t}\n\tif (e1.tp == 3 && e2.tp == 2) {\n\t\treturn expression(e1.l, e1.a, e1.b, e1.c * merge(e1.r, e2.l).m * e2.a, e2.r);\n\t}\n\tif (e1.tp == 3 && e2.tp == 3) {\n\t\treturn expression(e1.l, e1.a, e1.b + e1.c * merge(e1.r, e2.l).m * e2.a + e2.b, e2.c, e2.r);\n\t}\n\treturn expression();\n}\n\nstring transform(string S) {\n\tstring res;\n\tfor (char c : S) {\n\t\tif (c != '-') {\n\t\t\tres += c;\n\t\t}\n\t\telse {\n\t\t\tres += \"+\" + to_string(MOD - 1) + \"*\";\n\t\t}\n\t}\n\treturn res;\n}\n\nexpression level0(const string& S) {\n\tmodint x;\n\tfor (char c : S) {\n\t\tx = x * 10 + int(c - '0');\n\t}\n\treturn expression(value(x, S.size()));\n}\n\nexpression level1(const string& S) {\n\tfor (int i = int(S.size()) - 1; i >= 0; i--) {\n\t\tif (S[i] == '*') {\n\t\t\texpression lc = level1(S.substr(0, i));\n\t\t\texpression rc = level0(S.substr(i + 1));\n\t\t\texpression mc(value(), modint(1), value());\n\t\t\treturn merge(merge(lc, mc), rc);\n\t\t}\n\t}\n\treturn level0(S);\n}\n\nexpression level2(const string& S) {\n\tfor (int i = int(S.size()) - 1; i >= 0; i--) {\n\t\tif (S[i] == '+') {\n\t\t\texpression lc = level2(S.substr(0, i));\n\t\t\texpression rc = level1(S.substr(i + 1));\n\t\t\texpression mc(value(), modint(1), modint(0), modint(1), value());\n\t\t\treturn merge(merge(lc, mc), rc);\n\t\t}\n\t}\n\treturn level1(S);\n}\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<int> R(N);\n\tvector<string> S(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> R[i] >> S[i];\n\t\tS[i] = transform(S[i]);\n\t}\n\tvector<expression> E(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tE[i] = level2(S[i]);\n\t}\n\tvector<expression> F(N, expression(value()));\n\tfor (int i = 0; i < N; i++) {\n\t\texpression e = E[i];\n\t\tint b = R[i];\n\t\twhile (b >= 1) {\n\t\t\tif (b % 2 == 1) {\n\t\t\t\tF[i] = merge(F[i], e);\n\t\t\t}\n\t\t\te = merge(e, e);\n\t\t\tb /= 2;\n\t\t}\n\t}\n\texpression result = expression(value());\n\tfor (int i = 0; i < N; i++) {\n\t\tresult = merge(result, F[i]);\n\t}\n\texpression aux(value(), modint(1), modint(0), modint(1), value());\n\texpression ans = merge(merge(aux, result), aux);\n\tmodint final_ans = ans.b;\n\tcout << final_ans.get() << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5032,"score_of_the_acc":-0.0978,"final_rank":7},{"submission_id":"aoj_2789_7182433","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\nusing ll = long long;\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;}\nconst int INF = (1<<30)-1;\n#define all(p) p.begin(),p.end()\nconst int mod=1e9+7;\n\n/*\n前から見る\nA = 今の答え\nB = 今の積\nC = 一個前までのやつ\n\nnum\nB' <- B * 10 + C * num\n\n+\nA' <- A + B\nB' <- 1\nC' <- 1\n\n-\nA' <- A + B\nB' <- -1\nC' <- -1\n\n*\nB' <- 0\nC' <- B\n\n*/\n\nint main(){\n\tauto e=[&]()->vector<vector<ll>>{\n\t\tvector<vector<ll>> p(4,vector<ll>(4));\n\t\trep(i,0,4) p[i][i]=1;\n\t\treturn p;\n\t};\n\tauto f=[&](vector<vector<ll>> l,vector<vector<ll>> r)->vector<vector<ll>>{\n\t\tvector<vector<ll>> p(4,vector<ll>(4));\n\t\trep(i,0,4) rep(j,0,4) rep(k,0,4){\n\t\t\tp[i][k]=(p[i][k]+l[i][j]*r[j][k])%mod;\n\t\t}\n\t\treturn p;\n\t};\n\tauto pow_f=[&](vector<vector<ll>> l,int x)->vector<vector<ll>>{\n\t\tauto p=e();\n\t\twhile(x){\n\t\t\tif(x&1) p=f(p,l);\n\t\t\tx/=2;\n\t\t\tl=f(l,l);\n\t\t}\n\t\treturn p;\n\t};\n\tauto ans=e();\n\tint N;\n\tcin>>N;\n\trep(i,0,N+1){\n\t\tint x;\n\t\tstring S;\n\t\tif(i==N) x=1,S='+';\n\t\telse cin>>x>>S;\n\t\tauto tmp=e();\n\t\tauto val=e();\n\t\tfor(auto c:S){\n\t\t\tif(c=='+'){\n\t\t\t\tval={\n\t\t\t\t\t{1,0,0,0},\n\t\t\t\t\t{1,0,0,0},\n\t\t\t\t\t{0,0,0,0},\n\t\t\t\t\t{0,0,1,1}\n\t\t\t\t};\n\t\t\t}else if(c=='-'){\n\t\t\t\tval={\n\t\t\t\t\t{1,0,0,0},\n\t\t\t\t\t{1,0,0,0},\n\t\t\t\t\t{0,0,0,0},\n\t\t\t\t\t{0,0,-1,1}\n\t\t\t\t};\n\t\t\t}else if(c=='*'){\n\t\t\t\tval={\n\t\t\t\t\t{1,0,0,0},\n\t\t\t\t\t{0,0,1,0},\n\t\t\t\t\t{0,0,0,0},\n\t\t\t\t\t{0,0,0,1}\n\t\t\t\t};\n\t\t\t}else{\n\t\t\t\tval={\n\t\t\t\t\t{1,0,0,0},\n\t\t\t\t\t{0,10,0,0},\n\t\t\t\t\t{0,c-'0',1,0},\n\t\t\t\t\t{0,0,0,1}\n\t\t\t\t};\n\t\t\t}\n\t\t\ttmp=f(tmp,val);\n\t\t}\n\t\ttmp=pow_f(tmp,x);\n\t\tans=f(ans,tmp);\n\t}\n\tcout<<(ans[2][0]+ans[3][0]+mod+mod)%mod<<\"\\n\";\n}","accuracy":1,"time_ms":170,"memory_kb":3460,"score_of_the_acc":-0.3772,"final_rank":12},{"submission_id":"aoj_2789_6012592","code_snippet":"//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n#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<unordered_set>\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 = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\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 = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)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}\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)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 2;\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}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nstruct num {\n\tmodint val;\n\tmodint coef;\n};\n\nstruct Data {\n\tvector<num> vn;\n\tvector<char> vc;\n};\n\nnum merge(num a, num b) {\n\treturn { a.val * b.coef + b.val,a.coef * b.coef };\n}\n\nmodint calc(vector<num> vn, vector<char> vc) {\n\tmodint res = 0;\n\tmodint cur = vn[0].val;\n\trep(i, vc.size()) {\n\t\tif (vc[i] == '*') {\n\t\t\tcur*= vn[i + 1].val;\n\t\t}\n\t\telse {\n\t\t\tres += cur;\n\t\t\tcur = vn[i + 1].val;\n\t\t\tif (vc[i] == '-')cur *= -1;\n\t\t}\n\t}\n\tres += cur;\n\treturn res;\n}\nData merge(Data a, Data b) {\n\tvector<num> vn;\n\tvector<char> vc;\n\trep(i, a.vn.size())vn.push_back(a.vn[i]);\n\tvn.back() = merge(vn.back(), b.vn[0]);\n\tfor (int i = 1; i < b.vn.size(); i++)vn.push_back(b.vn[i]);\n\trep(i, a.vc.size())vc.push_back(a.vc[i]);\n\trep(i, b.vc.size())vc.push_back(b.vc[i]);\n\tint cnt = 0;\n\trep(i, vc.size()) {\n\t\tif (vc[i] == '+' || vc[i] == '-')cnt++;\n\t}\n\tif (cnt == 0) {\n\t\tif (vc.size() >= 3) {\n\t\t\tvector<num> nvn;\n\t\t\tvector<char> nvc;\n\t\t\tnvc = { '*','*' };\n\t\t\tnvn.push_back(vn[0]);\n\t\t\tmodint pro = 1;\n\t\t\tfor (int i = 1; i < vn.size() - 1; i++) {\n\t\t\t\tpro *= vn[i].val;\n\t\t\t}\n\t\t\tnvn.push_back({ pro,1 });\n\t\t\tnvn.push_back(vn.back());\n\t\t\tswap(vn, nvn);\n\t\t\tswap(vc, nvc);\n\t\t}\n\t\telse {\n\t\t\t//\n\t\t}\n\t}\n\telse if (cnt == 1) {\n\t\twhile (vc.size() >= 2 && vc[0]=='*'&&vc[1] == '*') {\n\t\t\tmodint pro = vn[1].val * vn[2].val;\n\t\t\tvn.erase(vn.begin() + 2);\n\t\t\tvn[1] = { pro,1 };\n\t\t\tvc.erase(vc.begin() + 1);\n\t\t}\n\t\twhile (vc.size() >= 2 && vc[vc.size() - 2] == '*' && vc[vc.size() - 1] == '*') {\n\t\t\tmodint pro = vn[vn.size() - 3].val * vn[vn.size() - 2].val;\n\t\t\tvn[vn.size() - 2] = { pro,1 };\n\t\t\tvn.erase(vn.begin() + (vn.size() - 3));\n\t\t\tvc.erase(vc.begin() + (vc.size() - 2));\n\t\t}\n\t\t/*rep(i, vc.size())if (vc[i] != '*') {\n\t\t\tif (i >= 2) {\n\t\t\t\tmodint pro = 1;\n\t\t\t\tfor (int j = 1; j <= i; j++) {\n\t\t\t\t\tpro *= vn[j].val;\n\t\t\t\t}\n\t\t\t\tvn[1] = { pro,1 };\n\t\t\t\tvn.erase(vn.begin() + 2, vn.begin() + i + 1);\n\t\t\t\tvc.erase(vc.begin() + 2, vc.begin() + i);\n\t\t\t}\n\t\t\tbreak;\n\t\t}*/\n\t\t/*per(i, vc.size())if (vc[i] != '*') {\n\t\t\tif (vc.size() - i >= 3) {\n\n\t\t\t}\n\t\t\tbreak;\n\t\t}*/\n\t}\n\telse {\n\t\twhile (vc.size() >= 2 && vc[0] == '*' && vc[1] == '*') {\n\t\t\tmodint pro = vn[1].val * vn[2].val;\n\t\t\tvn.erase(vn.begin() + 2);\n\t\t\tvn[1] = { pro,1 };\n\t\t\tvc.erase(vc.begin() + 1);\n\t\t}\n\t\twhile (vc.size() >= 2 && vc[vc.size() - 2] == '*' && vc[vc.size() - 1] == '*') {\n\t\t\tmodint pro = vn[vn.size() - 3].val * vn[vn.size() - 2].val;\n\t\t\tvn[vn.size() - 2] = { pro,1 };\n\t\t\tvn.erase(vn.begin() + (vn.size() - 3));\n\t\t\tvc.erase(vc.begin() + (vc.size() - 2));\n\t\t}\n\t\tint cl, cr;\n\t\trep(i, vc.size())if (vc[i] != '*') {\n\t\t\tcl = i; break;\n\t\t}\n\t\tper(i, vc.size())if (vc[i] != '*') {\n\t\t\tcr = i; break;\n\t\t}\n\t\t//vn...[cl+1,cr]\n\t\t//vc...[cl+1,cr-1]\n\t\tif (vc[cl] == '-') {\n\t\t\tvc[cl] = '+';\n\t\t\tvn[cl + 1].val *= -1;\n\t\t}\n\t\tvector<num> subn;\n\t\tvector<char> subc;\n\t\tRep1(j, cl + 1, cr)subn.push_back(vn[j]);\n\t\tRep1(j, cl + 1, cr - 1) subc.push_back(vc[j]);\n\t\tmodint val = calc(subn,subc);\n\t\tvn.erase(vn.begin() + cl + 1, vn.begin()+cr+1);\n\t\tvn.insert(vn.begin() + cl + 1, { val,1 });\n\t\tvc.erase(vc.begin() + cl + 1, vc.begin() + cr);\n\t}\n\treturn { vn,vc };\n}\n\nData trans(char c) {\n\tvector<num> vn;\n\tvector<char> vc;\n\tif (c == '*'||c=='+'||c=='-') {\n\t\tvn.push_back({ 0,1 });\n\t\tvn.push_back({ 0,1 });\n\t\tvc.push_back(c);\n\t}\n\telse {\n\t\tvn.push_back({ c - '0',10 });\n\t}\n\treturn { vn,vc };\n}\nvoid solve() {\n\tint n; cin >> n;\n\tData e;\n\te.vn.push_back({ 0,1 });\n\tData cur = e;\n\trep(i, n) {\n\t\tint r; cin >> r;\n\t\tstring s; cin >> s;\n\t\tData nw = e;\n\t\tfor (char c : s) {\n\t\t\tData nex = trans(c);\n\t\t\tnw = merge(nw, nex);\n\t\t}\n\t\tData x = e;\n\t\trep(t, 30) {\n\t\t\tif (r & (1 << t))x = merge(x, nw);\n\t\t\tnw = merge(nw, nw);\n\t\t}\n\t\tcur = merge(cur, x);\n\t}\n\tmodint ans = calc(cur.vn,cur.vc);\n\tcout << ans << \"\\n\";\n}\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(8);\n\t//init_f();\n\t//init();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3508,"score_of_the_acc":-0.3343,"final_rank":11},{"submission_id":"aoj_2789_5177701","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define LL long long\n#define PII pair<int,int>\n#define _for(i,j,k) for(int i=j;i<=k;i++)\n#define for_(i,j,k) for(int i=j;i>=k;i--)\n#define lowbit(x) (x&-x)\n#define ls(x) x<<1\n#define rs(x) x<<1|1\n#define inf 0x3f3f3f3f\n#define localtest freopen(\"E:/ACM/2020/input.txt\",\"r\",stdin);\nconst int maxn = 1e4 + 5;\nconst LL mod = 1e9 + 7;\nint n;\nmap<char, LL> pmap;\nLL mp(LL x,LL y){\n x %= mod;\n LL ret = 1ll;\n for (; y;y>>=1,x=(LL)x*x%mod)\n if(y&1)\n ret = (LL)ret * x % mod;\n return ret % mod;\n}\nLL inv(LL x){\n return mp(x, mod - 2);\n}\nstring num2str(LL num){\n string s=\"\";\n while(num){\n s += (num % 10 + '0');\n num /= 10;\n }\n reverse(s.begin(),s.end());\n return s;\n}\nLL str2num(string& s){\n LL num = 0;\n int len = s.length();\n for (int i = 0; i < len;i++){\n num = 10ll * num % mod + (s[i] - '0');\n num %= mod;\n }\n return num;\n}\nLL pro(string& s,bool fg){\n vector<LL> v;\n v.clear();\n //if(s.length()<=0)\n // return 0;\n v.push_back(s[0] - '0');\n int len = s.length(), p = 0;\n for (int i = 1; i < len;i++){\n if(isdigit(s[i])){\n if(v[p]>=0){\n v[p] = 10ll * v[p] % mod + (s[i] - '0');\n v[p] %= mod;\n }\n else{\n ++p;\n v.push_back(s[i] - '0');\n }\n }\n else{\n ++p;\n v.push_back(pmap[s[i]]);\n }\n }\n if(fg)\n v[0] = (LL)(mod - v[0]) % mod;\n vector<LL> u;\n u.push_back(v[0]);\n int cnt = 0;\n for (int i = 1; i <= p;i++){\n if(u[cnt]==-1){\n u.pop_back();\n cnt--;\n LL tmp = u[cnt];\n u.pop_back();\n cnt--;\n tmp = (LL)tmp * v[i] % mod;\n u.push_back(tmp);\n cnt++;\n }\n else{\n u.push_back(v[i]);\n cnt++;\n }\n }\n LL f = 1;\n LL ret = u[0];\n for (int i = 1; i <= cnt;i+=2){\n if(u[i]==-2){\n ret = (LL)(ret + f*u[i + 1]) % mod;\n ret = (LL)(ret + mod) % mod;\n }\n else{\n ret = (LL)(ret - f*u[i + 1]) % mod;\n ret = (LL)(ret + mod) % mod;\n }\n }\n return ret;\n}\nint main(){\n //localtest\n ios::sync_with_stdio(false);\n cin.tie(0);cout.tie(0);\n pmap['*'] = -1;\n pmap['+'] = -2;\n pmap['-'] = -3;\n cin >> n;\n string str=\"\", s;\n LL r = 0;\n _for(i,1,n){\n cin >> r >> s;\n if(r==1){\n str += s;\n }\n else{\n //_for(j, 1, r) str += s;\n int len = s.length(),pos=-1;\n _for(j,0,len-1){\n if(s[j]=='+'){\n pos = j;\n break;\n }\n }\n if(pos!=-1){\n string ss = \"\";\n _for(j,pos+1,len-1){\n ss += s[j];\n }\n _for(j,0,pos-1){\n ss += s[j];\n }\n LL tmp = pro(ss,0);\n tmp = (LL)(r - 1) % mod * tmp % mod;\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\n _for(j,0,pos){\n str += s[j];\n }\n str += num2str(tmp);\n _for(j,pos,len-1){\n str += s[j];\n }\n }\n else{\n _for(j,0,len-1){\n if(s[j]=='-'){\n pos = j;\n break;\n }\n }\n if(pos!=-1){\n string ss = \"\";\n _for(j,pos+1,len-1){\n ss += s[j];\n }\n _for(j,0,pos-1){\n ss += s[j];\n }\n LL tmp = pro(ss,1);\n tmp = (LL)(r - 1) % mod * tmp % mod;\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\n _for(j,0,pos-1){\n str += s[j];\n }\n str += '+';\n str += num2str(tmp);\n _for(j,pos,len-1){\n str += s[j];\n }\n }\n else{\n _for(j,0,len-1){\n if(s[j]=='*'){\n pos = j;\n break;\n }\n }\n if(pos!=-1){\n string ss = \"\";\n _for(j,pos+1,len-1){\n ss += s[j];\n }\n _for(j,0,pos-1){\n ss += s[j];\n }\n LL tmp = pro(ss,0);\n tmp = mp(tmp, r - 1);\n _for(j,0,pos){\n str += s[j];\n }\n str += num2str(tmp);\n _for(j,pos,len-1){\n str += s[j];\n }\n }\n else{\n LL tmp = str2num(s);\n tmp = (LL)(mp(10, (LL)len * r) - 1 + mod) % mod * tmp % mod;\n tmp = (LL)tmp * inv((mp(10, len) - 1 + mod) % mod) % mod;\n int l = str.length() - 1;\n string tmps = \"\";\n if(isdigit(str[l])){\n while(isdigit(str[l])){\n tmps += str[l];\n str.erase(l);\n l--;\n }\n reverse(tmps.begin(), tmps.end());\n //cout << \"tmps:\" << tmps << \"\\n\";\n //cout << \"tmp:\" << tmp << \"\\n\";\n LL num = str2num(tmps);\n //cout << \"num:\" << num << \"\\n\";\n num = (LL)mp(10, (LL)len * r) * num % mod;\n //cout << \"num:\" << num << \"\\n\";\n num = (LL)(num + tmp) % mod;\n str += num2str(num);\n }\n else{\n str += num2str(tmp);\n }\n }\n }\n }\n }\n //cout << str << \"\\n\";\n //cout << pro(str,0) << \"\\n\";\n }\n \n cout << pro(str,0) << \"\\n\";\n\n return 0;\n}\n/*\n5\n900 5+3*11-3*3+55\n1 45+45-33+100\n44 04+40\n9 9*9*9*10\n8 01340\n205143968\n\n4\n999 100+\n9999 010\n99999 *100\n999999 00200\n389822449\n*/","accuracy":0.3877551020408163,"time_ms":10,"memory_kb":4384,"score_of_the_acc":-0.0631,"final_rank":16},{"submission_id":"aoj_2789_5177680","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define LL long long\n#define PII pair<int,int>\n#define _for(i,j,k) for(int i=j;i<=k;i++)\n#define for_(i,j,k) for(int i=j;i>=k;i--)\n#define lowbit(x) (x&-x)\n#define ls(x) x<<1\n#define rs(x) x<<1|1\n#define inf 0x3f3f3f3f\n#define localtest freopen(\"E:/ACM/2020/input.txt\",\"r\",stdin);\nconst int maxn = 1e4 + 5;\nconst LL mod = 1e9 + 7;\nint n;\nmap<char, LL> pmap;\nLL mp(LL x,LL y){\n x %= mod;\n LL ret = 1ll;\n for (; y;y>>=1,x=(LL)x*x%mod)\n if(y&1)\n ret = (LL)ret * x % mod;\n return ret % mod;\n}\nLL inv(LL x){\n return mp(x, mod - 2);\n}\nstring num2str(LL num){\n string s=\"\";\n while(num){\n s += (num % 10 + '0');\n num /= 10;\n }\n reverse(s.begin(),s.end());\n return s;\n}\nLL str2num(string& s){\n LL num = 0;\n int len = s.length();\n for (int i = 0; i < len;i++){\n num = 10ll * num % mod + (s[i] - '0');\n num %= mod;\n }\n return num;\n}\nLL pro(string& s,bool fg){\n vector<LL> v;\n v.clear();\n //if(s.length()<=0)\n // return 0;\n v.push_back(s[0] - '0');\n int len = s.length(), p = 0;\n for (int i = 1; i < len;i++){\n if(isdigit(s[i])){\n if(v[p]>=0){\n v[p] = 10ll * v[p] % mod + (s[i] - '0');\n v[p] %= mod;\n }\n else{\n ++p;\n v.push_back(s[i] - '0');\n }\n }\n else{\n ++p;\n v.push_back(pmap[s[i]]);\n }\n }\n vector<LL> u;\n u.push_back(v[0]);\n int cnt = 0;\n for (int i = 1; i <= p;i++){\n if(u[cnt]==-1){\n u.pop_back();\n cnt--;\n LL tmp = u[cnt];\n u.pop_back();\n cnt--;\n tmp = (LL)tmp * v[i] % mod;\n u.push_back(tmp);\n cnt++;\n }\n else{\n u.push_back(v[i]);\n cnt++;\n }\n }\n LL f = fg ? -1 : 1;\n LL ret = u[0];\n for (int i = 1; i <= cnt;i+=2){\n if(u[i]==-2){\n ret = (LL)(ret + f*u[i + 1]) % mod;\n ret = (LL)(ret + mod) % mod;\n }\n else{\n ret = (LL)(ret - f*u[i + 1]) % mod;\n ret = (LL)(ret + mod) % mod;\n }\n }\n return ret;\n}\nint main(){\n //localtest\n ios::sync_with_stdio(false);\n cin.tie(0);cout.tie(0);\n pmap['*'] = -1;\n pmap['+'] = -2;\n pmap['-'] = -3;\n cin >> n;\n string str=\"\", s;\n LL r = 0;\n _for(i,1,n){\n cin >> r >> s;\n if(r==1){\n str += s;\n }\n else{\n //_for(j, 1, r) str += s;\n int len = s.length(),pos=-1;\n _for(j,0,len-1){\n if(s[j]=='+'){\n pos = j;\n break;\n }\n }\n if(pos!=-1){\n string ss = \"\";\n _for(j,pos+1,len-1){\n ss += s[j];\n }\n _for(j,0,pos-1){\n ss += s[j];\n }\n LL tmp = pro(ss,0);\n tmp = (LL)(r - 1) % mod * tmp % mod;\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\n _for(j,0,pos){\n str += s[j];\n }\n str += num2str(tmp);\n _for(j,pos,len-1){\n str += s[j];\n }\n }\n else{\n _for(j,0,len-1){\n if(s[j]=='-'){\n pos = j;\n break;\n }\n }\n if(pos!=-1){\n string ss = \"\";\n _for(j,pos+1,len-1){\n ss += s[j];\n }\n _for(j,0,pos-1){\n ss += s[j];\n }\n LL tmp = pro(ss,1);\n tmp = (LL)(r - 1) % mod * tmp % mod;\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\n _for(j,0,pos){\n str += s[j];\n }\n str += num2str(tmp);\n _for(j,pos,len-1){\n str += s[j];\n }\n }\n else{\n _for(j,0,len-1){\n if(s[j]=='*'){\n pos = j;\n break;\n }\n }\n if(pos!=-1){\n string ss = \"\";\n _for(j,pos+1,len-1){\n ss += s[j];\n }\n _for(j,0,pos-1){\n ss += s[j];\n }\n LL tmp = pro(ss,0);\n tmp = mp(tmp, r - 1);\n _for(j,0,pos){\n str += s[j];\n }\n str += num2str(tmp);\n _for(j,pos,len-1){\n str += s[j];\n }\n }\n else{\n LL tmp = str2num(s);\n tmp = (LL)(mp(10, (LL)len * r) - 1 + mod) % mod * tmp % mod;\n tmp = (LL)tmp * inv((mp(10, len) - 1 + mod) % mod) % mod;\n int l = str.length() - 1;\n string tmps = \"\";\n if(isdigit(str[l])){\n while(isdigit(str[l])){\n tmps += str[l];\n str.erase(l);\n l--;\n }\n reverse(tmps.begin(), tmps.end());\n //cout << \"tmps:\" << tmps << \"\\n\";\n //cout << \"tmp:\" << tmp << \"\\n\";\n LL num = str2num(tmps);\n //cout << \"num:\" << num << \"\\n\";\n num = (LL)mp(10, (LL)len * r) * num % mod;\n //cout << \"num:\" << num << \"\\n\";\n num = (LL)(num + tmp) % mod;\n str += num2str(num);\n }\n else{\n str += num2str(tmp);\n }\n }\n }\n }\n }\n //cout << str << \"\\n\";\n //cout << pro(str,0) << \"\\n\";\n }\n \n cout << pro(str,0) << \"\\n\";\n\n return 0;\n}\n/*\n5\n900 5+3*11-3*3+55\n1 45+45-33+100\n44 04+40\n9 9*9*9*10\n8 01340\n205143968\n\n4\n999 100+\n9999 010\n99999 *100\n999999 00200\n389822449\n*/","accuracy":0.3877551020408163,"time_ms":10,"memory_kb":4564,"score_of_the_acc":-0.0727,"final_rank":18},{"submission_id":"aoj_2789_5177512","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define LL long long\n#define PII pair<int,int>\n#define _for(i,j,k) for(int i=j;i<=k;i++)\n#define for_(i,j,k) for(int i=j;i>=k;i--)\n#define lowbit(x) (x&-x)\n#define ls(x) x<<1\n#define rs(x) x<<1|1\n#define inf 0x3f3f3f3f\nconst int maxn = 1e4 + 5;\nconst LL mod = 1e9 + 7;\nint n;\nmap<char, LL> pmap;\nLL mp(LL x,LL y){\n x %= mod;\n LL ret = 1ll;\n for (; y;y>>=1,x=(LL)x*x%mod)\n if(y&1)\n ret = (LL)ret * x % mod;\n return ret % mod;\n}\nLL inv(LL x){\n return mp(x, mod - 2);\n}\nstring num2str(LL num){\n string s=\"\";\n while(num){\n s += (num % 10 + '0');\n num /= 10;\n }\n reverse(s.begin(),s.end());\n return s;\n}\nLL str2num(string& s){\n LL num = 0;\n int len = s.length();\n for (int i = 0; i < len;i++){\n num = 10ll * num % mod + (s[i] - '0');\n num %= mod;\n }\n return num;\n}\nLL pro(string& s,bool fg){\n vector<LL> v;\n v.clear();\n //if(s.length()<=0)\n // return 0;\n v.push_back(s[0] - '0');\n int len = s.length(), p = 0;\n for (int i = 1; i < len;i++){\n if(isdigit(s[i])){\n if(v[p]>=0){\n v[p] = 10ll * v[p] % mod + (s[i] - '0');\n v[p] %= mod;\n }\n else{\n ++p;\n v.push_back(s[i] - '0');\n }\n }\n else{\n ++p;\n v.push_back(pmap[s[i]]);\n }\n }\n vector<LL> u;\n u.push_back(v[0]);\n int cnt = 0;\n for (int i = 1; i <= p;i++){\n if(u[cnt]==-1){\n u.pop_back();\n cnt--;\n LL tmp = u[cnt];\n u.pop_back();\n cnt--;\n tmp = (LL)tmp * v[i] % mod;\n u.push_back(tmp);\n cnt++;\n }\n else{\n u.push_back(v[i]);\n cnt++;\n }\n }\n LL f = fg ? -1 : 1;\n LL ret = u[0];\n for (int i = 1; i <= cnt;i+=2){\n if(u[i]==-2){\n ret = (LL)(ret + f*u[i + 1]) % mod;\n ret = (LL)(ret + mod) % mod;\n }\n else{\n ret = (LL)(ret - f*u[i + 1]) % mod;\n ret = (LL)(ret + mod) % mod;\n }\n }\n return ret;\n}\nint main(){\n //localtest\n ios::sync_with_stdio(false);\n cin.tie(0);cout.tie(0);\n pmap['*'] = -1;\n pmap['+'] = -2;\n pmap['-'] = -3;\n cin >> n;\n string str=\"\", s;\n LL r = 0;\n _for(i,1,n){\n cin >> r >> s;\n if(r==1){\n str += s;\n }\n else{\n //_for(j, 1, r) str += s;\n int len = s.length(),pos=-1;\n _for(j,0,len-1){\n if(s[j]=='+'||s[j]=='-'){\n pos = j;\n break;\n }\n }\n if(pos!=-1){\n string ss = \"\";\n _for(j,pos+1,len-1){\n ss += s[j];\n }\n _for(j,0,pos-1){\n ss += s[j];\n }\n LL tmp = pro(ss,s[pos]=='-');\n tmp = (LL)(r - 1) % mod * tmp % mod;\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\n _for(j,0,pos){\n str += s[j];\n }\n str += num2str(tmp);\n _for(j,pos,len-1){\n str += s[j];\n }\n }\n else{\n _for(j,0,len-1){\n if(s[j]=='*'){\n pos = j;\n break;\n }\n }\n if(pos!=-1){\n string ss = \"\";\n _for(j,pos+1,len-1){\n ss += s[j];\n }\n _for(j,0,pos-1){\n ss += s[j];\n }\n LL tmp = pro(ss,0);\n tmp = mp(tmp, r - 1);\n _for(j,0,pos){\n str += s[j];\n }\n str += num2str(tmp);\n _for(j,pos,len-1){\n str += s[j];\n }\n }\n else{\n LL tmp = str2num(s);\n tmp = (LL)(mp(10, (LL)len * r) - 1 + mod) % mod * tmp % mod;\n tmp = (LL)tmp * inv((mp(10, len) - 1 + mod) % mod) % mod;\n int l = str.length() - 1;\n string tmps = \"\";\n if(isdigit(str[l])){\n while(isdigit(str[l])){\n tmps += str[l];\n str.erase(l);\n l--;\n }\n reverse(tmps.begin(), tmps.end());\n //cout << \"tmps:\" << tmps << \"\\n\";\n //cout << \"tmp:\" << tmp << \"\\n\";\n LL num = str2num(tmps);\n //cout << \"num:\" << num << \"\\n\";\n num = (LL)mp(10, (LL)len * r) * num % mod;\n //cout << \"num:\" << num << \"\\n\";\n num = (LL)(num + tmp) % mod;\n str += num2str(num);\n }\n else{\n str += num2str(tmp);\n }\n }\n }\n }\n //cout << str << \"\\n\";\n //cout << pro(str,0) << \"\\n\";\n }\n \n cout << pro(str,0) << \"\\n\";\n\n return 0;\n}\n/*\n5\n900 5+3*11-3*3+55\n1 45+45-33+100\n44 04+40\n9 9*9*9*10\n8 01340\n205143968\n\n4\n999 100+\n9999 010\n99999 *100\n999999 00200\n389822449\n*/","accuracy":0.3877551020408163,"time_ms":10,"memory_kb":4396,"score_of_the_acc":-0.0637,"final_rank":17},{"submission_id":"aoj_2789_3661571","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nint N;\nchar buf[11];\n\ntypedef vector<ll> V;\ntypedef vector<V> MATRIX;\n\nint SIZE = 2;\nll MOD_POW[11];\n\n\nll mod_pow(ll x,ll n, ll mod){\n\n\tif(n == 0)return 1;\n\tll ret = mod_pow(x*x%mod,n/2,mod);\n\tif(n%2 == 1)ret = ret*x%mod;\n\treturn ret;\n}\n\n\nMATRIX calc(MATRIX left,MATRIX right){\n\n\tMATRIX ret(SIZE,V(SIZE));\n\n\tfor(int i = 0; i < SIZE; i++){\n\t\tfor(int k = 0; k < SIZE; k++)ret[i][k] = 0;\n\t}\n\n\tfor(int row = 0; row < SIZE; row++){\n\t\tfor(int col = 0; col < SIZE; col++){\n\t\t\tfor(int a = 0; a < SIZE; a++){\n\t\t\t\tret[row][col] += left[row][a]*right[a][col]%MOD;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ret;\n\n}\n\n//MULTのT乗を計算する\nMATRIX POW(MATRIX MULT,int count){\n\n\tMATRIX ret(SIZE,V(SIZE));\n\n\tfor(int row = 0; row < SIZE; row++){\n\t\tfor(int col = 0; col < SIZE; col++){\n\t\t\tif(row == col)ret[row][col] = 1;\n\t\t\telse{\n\t\t\t\tret[row][col] = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\twhile(count > 0){\n\t\tif(count%2 == 1)ret = calc(ret,MULT);\n\t\tMULT = calc(MULT,MULT);\n\t\tcount /= 2;\n\t}\n\n\treturn ret;\n}\n\nint main(){\n\n\tMOD_POW[0] = 1;\n\n\tfor(int i = 1; i <= 10; i++){\n\n\t\tMOD_POW[i] = (MOD_POW[i-1]*10)%MOD;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tqueue<ll> NUM,MULT;\n\tqueue<char> OP;\n\n\tNUM.push(0);\n\tOP.push('+');\n\n\tint rep_num;\n\tll last_num = 0,length;\n\tbool is_last_num = false;\n\tchar last_op = '+';\n\n\tbool is_op,is_plus_minus;\n\n\tfor(int loop = 0; loop < N; loop++){\n\n\t\tscanf(\"%d %s\",&rep_num,buf);\n\n\t\tis_op = false;\n\t\tis_plus_minus = false;\n\n\t\tfor(length = 0; buf[length] != '\\0'; length++){\n\n\t\t\tswitch(buf[length]){\n\t\t\tcase '+':\n\t\t\tcase '-':\n\t\t\t\tis_op = true;\n\t\t\t\tis_plus_minus = true;\n\t\t\t\tbreak;\n\t\t\tcase '*':\n\t\t\t\tis_op = true;\n\t\t\t\tbreak;\n\t\t\tdefault: //数字\n\t\t\t\t//Do nothing\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(!is_op){ //数字のみの場合\n\n\t\t\tll num = 0;\n\n\t\t\tfor(int i = 0; i < length; i++){\n\n\t\t\t\tnum = 10*num+(buf[i]-'0');\n\t\t\t\tnum %= MOD;\n\t\t\t}\n\n\t\t\tMATRIX first(2,V(1));\n\n\t\t\tif(is_last_num){ //文字列の最後が数字の場合\n\n\t\t\t\tfirst[0][0] = last_num;\n\n\t\t\t}else{ //文字列の最後が演算子の場合\n\n\t\t\t\tfirst[0][0] = 0;\n\t\t\t}\n\n\t\t\tfirst[0][1] = 1;\n\n\t\t\tMATRIX A(SIZE,V(SIZE));\n\t\t\tA[0][0] = MOD_POW[length];\n\t\t\tA[0][1] = num;\n\n\t\t\tA[1][0] = 0;\n\t\t\tA[1][1] = 1;\n\n\t\t\tA = POW(A,rep_num);\n\n\t\t\tlast_num = (A[0][0]*first[0][0]+A[0][1])%MOD;\n\n\t\t\tis_last_num = true;\n\n\t\t}else{\n\n\t\t\tif(!is_plus_minus){ //*のみの場合\n\n\t\t\t\tint first_loc;\n\n\t\t\t\tfor(int i = 0; i < length; i++){\n\n\t\t\t\t\tif(buf[i] == '*'){\n\n\t\t\t\t\t\tfirst_loc = i;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tll L;\n\n\t\t\t\tif(first_loc > 0){ //最初の*の左の数字\n\n\t\t\t\t\tll tmp = 0;\n\t\t\t\t\tfor(int i = 0; i < first_loc; i++){\n\n\t\t\t\t\t\ttmp = 10*tmp + (buf[i]-'0');\n\t\t\t\t\t\ttmp %= MOD;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(is_last_num){\n\n\t\t\t\t\t\ttmp = last_num*MOD_POW[first_loc]+tmp; //左にシフトさせて足す\n\t\t\t\t\t\ttmp %= MOD;\n\n\t\t\t\t\t\tL = tmp;\n\n\t\t\t\t\t}else{ //前の文字列の最後が演算子\n\n\t\t\t\t\t\tif(last_op == '*'){ //数字確定\n\n\t\t\t\t\t\t\tMULT.push(tmp);\n\t\t\t\t\t\t\tL = 1;\n\n\t\t\t\t\t\t}else{ //★注意★\n\n\t\t\t\t\t\t\tL = tmp;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t}else{ //first_loc == 0\n\n\t\t\t\t\tL = last_num; //必ずis_last_num == trueであるはず\n\t\t\t\t}\n\n\t\t\t\tll tmp = 0;\n\t\t\t\tstack<ll> tmp_MULT;\n\n\t\t\t\tif(rep_num == 1){\n\n\t\t\t\t\tMULT.push(L);\n\n\t\t\t\t\tll work = 0;\n\n\t\t\t\t\tint last_loc;\n\t\t\t\t\tfor(int i = length-1; i >= 0; i--){\n\t\t\t\t\t\tif(buf[i] == '*'){\n\t\t\t\t\t\t\tlast_loc = i;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tfor(int i = first_loc+1; i < last_loc; i++){\n\n\t\t\t\t\t\tif(buf[i] == '*'){\n\t\t\t\t\t\t\tMULT.push(work);\n\t\t\t\t\t\t\twork = 0;\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\twork = 10*work+(buf[i]-'0');\n\t\t\t\t\t\t\twork %= MOD;\n\n\t\t\t\t\t\t\tif(i+1 == last_loc){\n\n\t\t\t\t\t\t\t\tMULT.push(work);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tlast_num = 0;\n\t\t\t\t\tfor(int i = last_loc+1; i < length; i++){\n\n\t\t\t\t\t\tlast_num = 10*last_num+(buf[i]-'0');\n\t\t\t\t\t\tlast_num %= MOD;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(last_loc == length-1){\n\n\t\t\t\t\t\tis_last_num = false;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tis_last_num = true;\n\t\t\t\t\t}\n\n\t\t\t\t\tlast_op = '*';\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = first_loc+1; i < length; i++){\n\n\t\t\t\t\tif(buf[i] == '*'){\n\n\t\t\t\t\t\ttmp_MULT.push(tmp);\n\t\t\t\t\t\ttmp = 0;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\ttmp = 10*tmp+(buf[i]-'0');\n\t\t\t\t\t\ttmp %= MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_loc; i++){\n\n\t\t\t\t\ttmp = 10*tmp+(buf[i]-'0');\n\t\t\t\t\ttmp %= MOD;\n\t\t\t\t}\n\t\t\t\ttmp_MULT.push(tmp);\n\n\t\t\t\tll A = 1;\n\n\t\t\t\twhile(!tmp_MULT.empty()){\n\n\t\t\t\t\tA *= tmp_MULT.top();\n\t\t\t\t\tA %= MOD;\n\t\t\t\t\ttmp_MULT.pop();\n\t\t\t\t}\n\n\t\t\t\tif(rep_num > 1){\n\n\t\t\t\t\tA = mod_pow(A,rep_num-1,MOD);\n\t\t\t\t\tA *= L;\n\t\t\t\t\tA %= MOD;\n\t\t\t\t\tMULT.push(A); //最後のopは'*'なので\n\t\t\t\t}\n\n\t\t\t\t//★first_loc+1からlengthまでに*があるか調べる\n\t\t\t\tint last_loc;\n\t\t\t\tfor(int i = length-1; i >= 0; i--){\n\t\t\t\t\tif(buf[i] == '*'){\n\n\t\t\t\t\t\tlast_loc = i;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(last_loc == first_loc){\n\n\t\t\t\t\tif(buf[length-1] == '*'){ //first_loc==last_loc == length-1\n\n\t\t\t\t\t\tlast_num = A;\n\t\t\t\t\t\tis_last_num = false;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tlast_num = 0;\n\t\t\t\t\t\tfor(int i = last_loc+1; i < length; i++){\n\n\t\t\t\t\t\t\tlast_num = 10*last_num+(buf[i]-'0');\n\t\t\t\t\t\t\tlast_num %= MOD;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tis_last_num = true;\n\t\t\t\t\t}\n\n\t\t\t\t}else{ //last_loc != first_loc\n\n\t\t\t\t\tll work = 0;\n\t\t\t\t\tstack<ll> work_num;\n\n\t\t\t\t\tfor(int i = first_loc+1; i < last_loc; i++){\n\n\t\t\t\t\t\tif(buf[i] == '*'){\n\n\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t\twork = 0;\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\twork = 10*work+(buf[i]-'0');\n\t\t\t\t\t\t\twork %= MOD;\n\t\t\t\t\t\t\tif(i+1 == last_loc){\n\n\t\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tll D = work_num.top();\n\t\t\t\t\twork_num.pop();\n\n\t\t\t\t\twhile(!work_num.empty()){\n\n\t\t\t\t\t\tD *= work_num.top();\n\t\t\t\t\t\tD %= MOD;\n\t\t\t\t\t\twork_num.pop();\n\t\t\t\t\t}\n\n\t\t\t\t\tMULT.push(D);\n\n\t\t\t\t\tlast_num = 0;\n\n\t\t\t\t\tfor(int i = last_loc+1; i < length; i++){\n\n\t\t\t\t\t\tlast_num = 10*last_num+(buf[i]-'0');\n\t\t\t\t\t\tlast_num %= MOD;\n\t\t\t\t\t}\n\n\t\t\t\t\tif('0' <= buf[length-1] && '9' >= buf[length-1]){\n\n\t\t\t\t\t\tis_last_num = true;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tis_last_num = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tlast_op = '*';\n\n\t\t\t}else{ //+か-が出現する場合\n\n\t\t\t\tint first_loc;\n\n\t\t\t\tfor(int i = 0; i < length; i++){\n\n\t\t\t\t\tif(buf[i] == '+' || buf[i] == '-'){\n\n\t\t\t\t\t\tfirst_loc = i;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t//★★*が混ざっている可能性あり★★\n\t\t\t\tll L,work = 0;\n\t\t\t\tstack<ll> work_num;\n\n\t\t\t\tfor(int i = 0; i < first_loc; i++){\n\n\t\t\t\t\tif(buf[i] == '*'){\n\n\t\t\t\t\t\tif(work_num.empty()){ //初めての'*'\n\n\t\t\t\t\t\t\tif(is_last_num){ //数字が前から続いている場合\n\n\t\t\t\t\t\t\t\twork = last_num*MOD_POW[i]+work;\n\t\t\t\t\t\t\t\twork %= MOD;\n\t\t\t\t\t\t\t\twork_num.push(work);\n\n\t\t\t\t\t\t\t}else{ //前の文字列が演算子で終了している場合\n\n\t\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}else{ //2つめ以降の'*';\n\n\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\twork = 0;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\t//first_locの左は必ず数字であるはず\n\t\t\t\t\t\twork = 10*work+(buf[i]-'0');\n\t\t\t\t\t\twork %= MOD;\n\n\t\t\t\t\t\tif(i+1 == first_loc){\n\n\t\t\t\t\t\t\tif(work_num.empty()){ //★★\n\n\t\t\t\t\t\t\t\tif(is_last_num){ //数字が前から続いている場合\n\n\t\t\t\t\t\t\t\t\twork = last_num*MOD_POW[i+1]+work;\n\t\t\t\t\t\t\t\t\twork %= MOD;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\twhile(!work_num.empty()){\n\n\t\t\t\t\twork *= work_num.top();\n\t\t\t\t\twork %= MOD;\n\t\t\t\t\twork_num.pop();\n\t\t\t\t}\n\n\t\t\t\tif(first_loc == 0){\n\n\t\t\t\t\twork = last_num; //★★\n\t\t\t\t}\n\n\t\t\t\tif(last_op == '*'){ //数字を連結させる\n\n\t\t\t\t\tMULT.push(work);\n\n\t\t\t\t\tll tmp = 1;\n\n\t\t\t\t\twhile(!MULT.empty()){\n\n\t\t\t\t\t\ttmp *= MULT.front();\n\t\t\t\t\t\ttmp %= MOD;\n\t\t\t\t\t\tMULT.pop();\n\t\t\t\t\t}\n\n\t\t\t\t\tNUM.push(tmp);\n\n\t\t\t\t}else{ //プラスかマイナス\n\n\t\t\t\t\tNUM.push(work);\n\t\t\t\t}\n\n\t\t\t\tif(rep_num > 1){\n\n\t\t\t\t\tOP.push('+'); //★★掛け算の準備★★\n\t\t\t\t}else{\n\n\t\t\t\t\tint last_loc;\n\t\t\t\t\tfor(int i = length-1; i >= 0; i--){\n\t\t\t\t\t\tif(buf[i] == '+' || buf[i] == '-'){\n\t\t\t\t\t\t\tlast_loc = i;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(last_loc == first_loc){\n\n\t\t\t\t\t\tOP.push(buf[first_loc]);\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tOP.push('+'); //追いかけの数字は'-'を反映させる\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t//first_loc間の計算値を求め、掛け算に持ち込む\n\n\t\t\t\tchar work_buf[11];\n\t\t\t\tint work_index = 0;\n\n\t\t\t\tstack<char> work_op;\n\t\t\t\tstack<ll> calc_num;\n\t\t\t\tstack<char> calc_op;\n\n\t\t\t\tint last_loc;\n\n\t\t\t\tfor(int i = length-1; i >= 0; i--){\n\n\t\t\t\t\tif(buf[i] == '+' || buf[i] == '-'){\n\t\t\t\t\t\tlast_loc = i;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(rep_num > 1){\n\n\t\t\t\t\tfor(int i = first_loc+1; i < length; i++){\n\n\t\t\t\t\t\twork_buf[work_index++] = buf[i];\n\t\t\t\t\t}\n\t\t\t\t\tfor(int i = 0; i < first_loc; i++){\n\n\t\t\t\t\t\twork_buf[work_index++] = buf[i];\n\t\t\t\t\t}\n\n\t\t\t\t\twork_num.push(0);\n\t\t\t\t\twork_op.push(buf[first_loc]);\n\n\t\t\t\t\twork = 0;\n\n\t\t\t\t\tfor(int i = 0; i < work_index; i++){\n\n\t\t\t\t\t\tif(work_buf[i] == '*' || work_buf[i] == '+' || work_buf[i] == '-'){\n\n\t\t\t\t\t\t\tif(work_op.empty() == false && work_op.top() == '*'){\n\n\t\t\t\t\t\t\t\twork *= work_num.top();\n\t\t\t\t\t\t\t\twork %= MOD;\n\t\t\t\t\t\t\t\twork_num.pop();\n\t\t\t\t\t\t\t\twork_op.pop();\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t\twork_op.push(work_buf[i]);\n\t\t\t\t\t\t\twork = 0;\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\twork = 10*work+(work_buf[i]-'0');\n\t\t\t\t\t\t\twork %= MOD;\n\n\t\t\t\t\t\t\tif(i+1 == work_index){\n\n\t\t\t\t\t\t\t\tif(work_op.empty() == false && work_op.top() == '*'){\n\n\t\t\t\t\t\t\t\t\twork *= work_num.top();\n\t\t\t\t\t\t\t\t\twork %= MOD;\n\t\t\t\t\t\t\t\t\twork_num.pop();\n\t\t\t\t\t\t\t\t\twork_op.pop();\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t//このままだと右結合になってしまうので左結合にする\n\n\t\t\t\t\twhile(!work_num.empty()){\n\n\t\t\t\t\t\tcalc_num.push(work_num.top());\n\t\t\t\t\t\twork_num.pop();\n\t\t\t\t\t}\n\n\t\t\t\t\twhile(!work_op.empty()){\n\n\t\t\t\t\t\tcalc_op.push(work_op.top());\n\t\t\t\t\t\twork_op.pop();\n\t\t\t\t\t}\n\n\t\t\t\t\tll A = calc_num.top();\n\t\t\t\t\tcalc_num.pop();\n\n\t\t\t\t\twhile(!calc_op.empty()){\n\t\t\t\t\t\tif(calc_op.top() == '+'){\n\n\t\t\t\t\t\t\tA += calc_num.top();\n\t\t\t\t\t\t\tA %= MOD;\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tA -= calc_num.top();\n\t\t\t\t\t\t\tif(A < 0)A += MOD;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcalc_op.pop();\n\t\t\t\t\t\tcalc_num.pop();\n\t\t\t\t\t}\n\n\t\t\t\t\tA *= rep_num-1;\n\t\t\t\t\tA %= MOD;\n\n\t\t\t\t\tNUM.push(A);\n\n\t\t\t\t\tif(last_loc != first_loc){\n\t\t\t\t\t\tOP.push('+'); //★★注意→追いかけで突っ込む数字はマイナスを反映させる★★\n\t\t\t\t\t}else{\n\t\t\t\t\t\tOP.push(buf[first_loc]);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(first_loc < last_loc){ //途中の数式を積む\n\n\t\t\t\t\twork = 0;\n\n\t\t\t\t\twork_num.push(0);\n\t\t\t\t\twork_op.push(buf[first_loc]);\n\n\t\t\t\t\tif(buf[first_loc] == '-'){\n\n\n\t\t\t\t\t}\n\n\t\t\t\t\tfor(int i = first_loc+1; i < last_loc; i++){\n\n\t\t\t\t\t\tif(buf[i] == '*' || buf[i] == '+' || buf[i] == '-'){\n\n\t\t\t\t\t\t\tif(work_op.empty() == false && work_op.top() == '*'){\n\n\t\t\t\t\t\t\t\twork *= work_num.top();\n\t\t\t\t\t\t\t\twork %= MOD;\n\t\t\t\t\t\t\t\twork_num.pop();\n\t\t\t\t\t\t\t\twork_op.pop();\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t\twork_op.push(buf[i]);\n\t\t\t\t\t\t\twork = 0;\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\twork = 10*work+(buf[i]-'0');\n\t\t\t\t\t\t\twork %= MOD;\n\n\t\t\t\t\t\t\tif(i+1 == last_loc){\n\n\t\t\t\t\t\t\t\tif(work_op.empty() == false && work_op.top() == '*'){\n\n\t\t\t\t\t\t\t\t\twork *= work_num.top();\n\t\t\t\t\t\t\t\t\twork %= MOD;\n\t\t\t\t\t\t\t\t\twork_num.pop();\n\t\t\t\t\t\t\t\t\twork_op.pop();\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t//このままだと右結合になってしまうので左結合にする\n\t\t\t\t\twhile(!work_num.empty()){\n\n\t\t\t\t\t\tcalc_num.push(work_num.top());\n\t\t\t\t\t\twork_num.pop();\n\t\t\t\t\t}\n\n\t\t\t\t\twhile(!work_op.empty()){\n\n\t\t\t\t\t\tcalc_op.push(work_op.top());\n\t\t\t\t\t\twork_op.pop();\n\t\t\t\t\t}\n\n\t\t\t\t\tll A;\n\n\t\t\t\t\tA = calc_num.top();\n\t\t\t\t\tcalc_num.pop();\n\n\t\t\t\t\twhile(!calc_op.empty()){\n\t\t\t\t\t\tif(calc_op.top() == '+'){\n\n\t\t\t\t\t\t\tA += calc_num.top();\n\t\t\t\t\t\t\tA %= MOD;\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tA -= calc_num.top();\n\t\t\t\t\t\t\tif(A < 0)A += MOD;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcalc_op.pop();\n\t\t\t\t\t\tcalc_num.pop();\n\t\t\t\t\t}\n\n\t\t\t\t\tNUM.push(A);\n\t\t\t\t}\n\n\t\t\t\tif(first_loc < last_loc){\n\n\t\t\t\t\tOP.push(buf[last_loc]);\n\t\t\t\t}\n\n\t\t\t\tif(last_loc == length-1){\n\n\t\t\t\t\tlast_num = 0; //次の文字列と結合することはない\n\t\t\t\t\tis_last_num = false;\n\n\t\t\t\t}else{ //last_numを求める★★次に数字が連結する場合あり★★\n\n\t\t\t\t\twork = 0;\n\n\t\t\t\t\t//★★*が混ざっているか調べる★★\n\t\t\t\t\tint last_mult = -1;\n\t\t\t\t\tfor(int i = length -1; i > last_loc; i--){\n\n\t\t\t\t\t\tif(buf[i] == '*'){\n\n\t\t\t\t\t\t\tlast_mult = i;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(last_mult == -1 || last_mult < last_loc){ //最後の±から末尾までに*がない\n\n\t\t\t\t\t\tlast_num = 0;\n\n\t\t\t\t\t\tfor(int i = last_loc+1; i < length; i++){\n\n\t\t\t\t\t\t\tlast_num = 10*last_num+(buf[i]-'0');\n\t\t\t\t\t\t\tlast_num %= MOD;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(last_loc == length-1){\n\n\t\t\t\t\t\t\tis_last_num = false;\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tis_last_num = true;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{ //last_loc+1～last_multまでをMULTに突っ込む\n\n\t\t\t\t\t\twork = 0;\n\t\t\t\t\t\tlast_op = '*';\n\n\t\t\t\t\t\tfor(int i = last_loc+1; i < last_mult; i++){\n\n\t\t\t\t\t\t\tif(buf[i] == '*'){\n\n\t\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t\t\twork = 0;\n\n\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\twork = 10*work+(buf[i]-'0');\n\t\t\t\t\t\t\t\twork %= MOD;\n\n\t\t\t\t\t\t\t\tif(i+1 == last_mult){\n\n\t\t\t\t\t\t\t\t\twork_num.push(work);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tll tmp = 1;\n\n\t\t\t\t\t\twhile(!work_num.empty()){\n\n\t\t\t\t\t\t\ttmp *= work_num.top();\n\t\t\t\t\t\t\ttmp %= MOD;\n\t\t\t\t\t\t\twork_num.pop();\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tMULT.push(tmp);\n\t\t\t\t\t\tlast_num = 0;\n\n\t\t\t\t\t\tfor(int i = last_mult+1; i < length; i++){\n\n\t\t\t\t\t\t\tlast_num = 10*last_num+(buf[i]-'0');\n\t\t\t\t\t\t\tlast_num %= MOD;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(last_mult == length-1){\n\n\t\t\t\t\t\t\tis_last_num = false;\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tis_last_num = true;\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}\n\t}\n\n\t//last_numが残っていたら処理\n\tif(last_op == '*'){\n\n\t\twhile(!MULT.empty()){\n\t\t\tlast_num *= MULT.front();\n\t\t\tlast_num %= MOD;\n\t\t\tMULT.pop();\n\t\t}\n\t\tNUM.push(last_num);\n\n\t}else{\n\n\t\tNUM.push(last_num);\n\t}\n\n\tll ans = NUM.front();\n\tNUM.pop();\n\n\twhile(!OP.empty()){\n\n\t\tif(OP.front() == '+'){\n\n\t\t\tans += NUM.front();\n\t\t\tans %= MOD;\n\t\t\tNUM.pop();\n\n\t\t}else{\n\n\t\t\tans -= NUM.front();\n\t\t\tif(ans < 0)ans += MOD;\n\t\t\tans %= MOD;\n\t\t\tNUM.pop();\n\t\t}\n\t\tOP.pop();\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3440,"score_of_the_acc":-0.0352,"final_rank":3},{"submission_id":"aoj_2789_3191910","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_popcount\n\n#define INF 1e16\n#define mod 1000000007LL\n\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nmat operator*(const mat& a,const mat& b){\n mat res(4,vec(4,0));\n const ll modl=8*mod*mod;\n rep(i,4){\n rep(k,4){\n rep(j,4){\n res[i][j]+=a[i][k]*b[k][j];\n if(res[i][j]>=modl)res[i][j]-=modl;\n }\n }\n rep(j,4)res[i][j]%=mod;\n }\n return res;\n}\n\nmat mpow(mat a,ll n){\n mat res(4,vec(4,0));\n rep(i,4)res[i][i]=1;\n while(n>0){\n if(n&1)res=res*a;\n a=a*a;\n n>>=1;\n }\n return res;\n}\n\nll pls[4][4]={\n {1, 0, 1, 0},\n {0, 0, 0, 1},\n {0, 0, 0, 0},\n {0, 0, 0, 1},\n};\n\nll mns[4][4]={\n {1, 0, 1, 0},\n {0, 0, 0, mod-1},\n {0, 0, 0, 0},\n {0, 0, 0, 1},\n};\n\nll mul[4][4]={\n {1, 0, 0, 0},\n {0, 0, 1, 0},\n {0, 0, 0, 0},\n {0, 0, 0, 1},\n};\n\nll num[4][4]={\n {1, 0, 0, 0},\n {0, 1, 0, 0},\n {0, 0, 10, 0},\n {0, 0, 0, 1},\n};\n\nint N;\n\nint main(){\n scanf(\"%d\",&N);\n vector<int> ps(N);\n vector<string> rs(N);\n rep(i,N){\n cin>>ps[i]>>rs[i];\n }\n ps.push_back(1); rs.push_back(\"+\"); N++;\n mat crt(4,vec(4,0));\n rep(i,4)crt[i][i]=1;\n\n rep(i,N){\n mat m(4,vec(4,0));\n rep(j,4)m[j][j]=1;\n rep(j,rs[i].size()){\n mat op(4,vec(4,0));\n if(rs[i][j]=='+'){\n rep(k,4)rep(l,4)op[k][l]=pls[k][l];\n }\n if(rs[i][j]=='-'){\n rep(k,4)rep(l,4)op[k][l]=mns[k][l];\n }\n if(rs[i][j]=='*'){\n rep(k,4)rep(l,4)op[k][l]=mul[k][l];\n }\n if(isdigit(rs[i][j])){\n rep(k,4)rep(l,4)op[k][l]=num[k][l];\n op[2][1]=rs[i][j]-'0';\n }\n m=op*m;\n }\n m=mpow(m,ps[i]);\n crt=m*crt;\n }\n\n cout<<(crt[0][1]+crt[0][3])%mod<<endl;\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":3952,"score_of_the_acc":-0.449,"final_rank":13},{"submission_id":"aoj_2789_3185239","code_snippet":"#include <bits/stdc++.h>\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\n\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nmat mul(mat &A,mat &B){\n\tmat C(A.size(),vec(B[0].size()));\n\tfor(int i=0;i<A.size();i++){\n\t\tfor(int k=0;k<B.size();k++){\n\t\t\tfor(int j=0;j<B[0].size();j++){\n\t\t\t\tC[i][j]=(C[i][j]+(A[i][k]*B[k][j]%MOD))%MOD;\n\t\t\t}\n\t\t}\n\t}\n\treturn C;\n}\n\nmat pow(mat A,ll n){\n\tmat B(A.size(),vec(A.size()));\n\tfor(int i=0;i<A.size();i++){\n\t\tB[i][i]=1;\n\t}\n\twhile(n>0){\n\t\tif(n&1)B=mul(B,A);\n\t\tA=mul(A,A);\n\t\tn>>=1;\n\t}\n\treturn B;\n}\n\nll matpow(ll x,ll n){\n\tll ret=1;\n\twhile(n>0){\n\t\tif(n&1)ret=ret*x%MOD;\n\t\tx=x*x%MOD;\n\t\tn/=2LL;\n\t}\n\treturn ret;\n}\n\nbool isnumber(string s){\n\tfor(int i=0;i<s.size();i++){\n\t\tif(!isdigit(s[i]))return false;\n\t}\n\treturn true;\n}\n\nll getnum(string s){\n\tll res=0;\n\tfor(int i=0;i<s.size();i++){\n\t\tres*=10LL;\n\t\tres+=(s[i]-'0');\n\t\tres%=MOD;\n\t}\n\treturn res;\n}\n\ntypedef string::const_iterator State;\nll number(State &begin){\n\tll ret=0;\n\twhile(isdigit(*begin)){\n\t\tret*=10;\n\t\tret+=(*begin-'0');\n\t\tbegin++;\n\t}\n\tret%=MOD;\n\treturn ret;\n}\n\nll term(State &begin){\n\tll ret=number(begin);\n\twhile(1){\n\t\tif(*begin=='*'){\n\t\t\tbegin++;\n\t\t\tret*=number(begin);\n\t\t\tret%=MOD;\n\t\t}else{\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn ret;\n}\nll expression(State &begin){\n\tll ret=term(begin);\n\twhile(1){\n\t\tif(*begin=='+'){\n\t\t\tbegin++;\n\t\t\tret+=term(begin);\n\t\t\tret%=MOD;\n\t\t}else{\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn ret;\n}\n\nll getval(string s,int f){\n\tstring ss=s.substr(f);\n\tif(f!=0)ss+=s.substr(0,f-1);\n\telse{\n\t\tss=s.substr(0,s.size()-1);\n\t}\n\tState st=ss.begin();\n\treturn expression(st);\n}\n\nstring replace_str(string s){\n\tstring res=\"\";\n\tfor(int i=0;i<s.size();i++){\n\t\tif(s[i]=='-'){\n\t\t\tres+=\"+1000000006*\";\n\t\t}else{\n\t\t\tres+=s[i];\n\t\t}\n\t}\n\treturn res;\n}\n\nint n;\nint r[10005];\nll tp[15];\n\nint main(void){\n\tscanf(\"%d%*c\",&n);\n\ttp[0]=1;\n\tfor(int i=0;i<14;i++){\n\t\ttp[i+1]=tp[i]*10LL%MOD;\n\t}\n\tll ans=0;\n\tll pv=1;\n\tll nowv=0;\n\tfor(int i=0;i<n;i++){\n\t\tstring s;\n\t\tcin >> r[i] >> s;\n\t\tll val=0;\n\t\tif(isnumber(s)){\n\t\t\tmat A(2,vec(2));\n\t\t\tA={{tp[s.size()],getnum(s)},{0,1}};\n\t\t\tA=pow(A,r[i]);\n\t\t\tnowv=((nowv*A[0][0])%MOD+A[0][1])%MOD;\n\t\t\tcontinue;\n\t\t}\n\t\tbool flag=false;\n\t\tfor(int j=0;j<s.size();j++){\n\t\t\tif(s[j]=='+' || s[j]=='-'){\n\t\t\t\tflag=true;\n\t\t\t}\n\t\t}\n\t\tif(!flag){\n\t\t\tint mi=0;\n\t\t\tfor(mi=0;mi<s.size();mi++){\n\t\t\t\tif(s[mi]=='*' || s[mi]=='+' || s[mi]=='-')break;\n\t\t\t}\n\t\t\tfor(int j=0;j<mi;j++){\n\t\t\t\tnowv*=10LL;\n\t\t\t\tnowv+=(s[j]-'0');\n\t\t\t\tnowv%=MOD;\n\t\t\t}\n\t\t\tpv=nowv*pv%MOD;\n\t\t\tif(r[i]>1){\n\t\t\t\tnowv=getval(s,(mi+1)%s.size());\n\t\t\t\tnowv=matpow(nowv,r[i]-1);\n\t\t\t\tpv=nowv*pv%MOD;\n\t\t\t}\n\t\t\tnowv=0;\n\t\t\tfor(int j=mi+1;j<s.size();j++){\n\t\t\t\tif(s[j]=='*'){\n\t\t\t\t\tpv=pv*nowv%MOD;\n\t\t\t\t\tnowv=0;\n\t\t\t\t}else{\n\t\t\t\t\tnowv*=10LL;\n\t\t\t\t\tnowv+=(s[j]-'0');\n\t\t\t\t\tnowv%=MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\ts=replace_str(s);\n\t\t\tint mi=0;\n\t\t\tfor(mi=0;mi<s.size();mi++){\n\t\t\t\tif(s[mi]=='+')break;\n\t\t\t}\n\t\t\tfor(int j=0;j<mi;j++){\n\t\t\t\tif(s[j]=='*'){\n\t\t\t\t\tpv=pv*nowv%MOD;\n\t\t\t\t\tnowv=0;\n\t\t\t\t}else{\n\t\t\t\t\tnowv*=10LL;\n\t\t\t\t\tnowv+=s[j]-'0';\n\t\t\t\t\tnowv%=MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans+=nowv*pv%MOD;\n\t\t\tans%=MOD;\n\t\t\tif(r[i]>1){\n\t\t\t\tnowv=getval(s,(mi+1)%s.size());\n\t\t\t\tnowv*=r[i]-1;\n\t\t\t\tans+=nowv%MOD;\n\t\t\t\tans%=MOD;\n\t\t\t}\n\t\t\tpv=1;\n\t\t\tnowv=0;\n\t\t\tfor(int j=mi+1;j<s.size();j++){\n\t\t\t\tif(s[j]=='*'){\n\t\t\t\t\tpv=pv*nowv%MOD;\n\t\t\t\t\tnowv=0;\n\t\t\t\t}else if(s[j]=='+'){\n\t\t\t\t\tans+=nowv*pv%MOD;\n\t\t\t\t\tans%=MOD;\n\t\t\t\t\tpv=1;\n\t\t\t\t\tnowv=0;\n\t\t\t\t}else{\n\t\t\t\t\tnowv*=10LL;\n\t\t\t\t\tnowv+=s[j]-'0';\n\t\t\t\t\tnowv%=MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tans+=nowv*pv%MOD;\n\tans%=MOD;\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3360,"score_of_the_acc":-0.0309,"final_rank":2},{"submission_id":"aoj_2789_3005956","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\nconst int MOD = 1e9 + 7;\nstruct dt\n{\n\tLL v, ev;\n\tdt(LL v = 0, LL ev = 0) : v(v % MOD), ev(ev % MOD) {}\n\tdt followed(const dt &o) const\n\t{\n\t\tdt ret;\n\t\tret.v = (v * o.ev % MOD + o.v) % MOD;\n\t\tret.ev = ev * o.ev % MOD;\n\t\treturn ret;\n\t}\n};\nLL modExp(LL x, LL y)\n{\n\tif (y == 0) return 1;\n\tif (y == 1) return x % MOD;\n\tLL ret = modExp(x, y / 2);\n\tret = ret * ret % MOD;\n\tif (y & 1) ret = ret * x % MOD;\n\treturn ret;\n}\ndt connect(dt x, LL y)\n{\n\tif (y == 0) return dt(0, 1);\n\tif (y == 1) return dt(x.v % MOD, x.ev % MOD);\n\tdt ret = connect(x, y / 2);\n\tret = ret.followed(ret);\n\tif (y % 2) ret = ret.followed(x);\n\treturn ret;\n}\ntypedef vector<dt> EXP;\nLL calc(const EXP &e)\n{\n\tEXP o;\n\tfor (int i = 0; i < e.size(); ++i) {\n\t\tif (e[i].v == -3) {\n\t\t\tdt t = dt(o.back().v * e[i + 1].v % MOD);\n\t\t\to.pop_back();\n\t\t\to.push_back(t);\n\t\t\t++i;\n\t\t}\n\t\telse o.push_back(e[i]);\n\t}\n\tLL ret = o[0].v;\n\tfor (int i = 1; i < o.size(); i += 2) {\n\t\tif (o[i].v == -1) ret = (ret + o[i + 1].v) % MOD;\n\t\telse ret = (ret + MOD - o[i + 1].v) % MOD;\n\t}\n\treturn ret;\n}\nEXP compress(char *s, int r)\n{\n\tEXP se;\n\tLL v = -4, len;\n\tfor (int i = 0; s[i]; ++i) {\n\t\tif (isdigit(s[i])) {\n\t\t\tif (v == -4) v = 0, len = 1;\n\t\t\tv *= 10, v += s[i] - '0';\n\t\t\tlen *= 10;\n\t\t\tv %= MOD, len %= MOD;\n\t\t}\n\t\telse {\n\t\t\tif (v != -4) se.push_back(dt(v, len));\n\t\t\tv = -4;\n\t\t\tif (s[i] == '+') se.push_back(dt(-1));\n\t\t\telse if (s[i] == '-') se.push_back(dt(-2));\n\t\t\telse se.push_back(dt(-3));\n\t\t}\n\t}\n\tif (v != -4) se.push_back(dt(v, len));\n\tif (r == 1) return se;\n\tint p = -1;\n\tfor (int i = 0; i < se.size(); ++i) {\n\t\tif (se[i].v >= 0) continue;\n\t\tif (p == -1) p = i;\n\t\telse if (se[p].v < se[i].v) p = i;\n\t}\n\tEXP ret;\n\tif (p == -1) {\n\t\tret.push_back(connect(se[0], r));\n\t\treturn ret;\n\t}\n\tEXP re;\n\tfor (int i = p + 1; i < se.size() + p; ++i) {\n\t\tif (!re.empty()) {\n\t\t\tif (re.back().v >= 0 && se[i % se.size()].v >= 0) {\n\t\t\t\tdt t = re.back().followed(se[i % se.size()]);\n\t\t\t\tre.pop_back();\n\t\t\t\tre.push_back(t);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\tre.push_back(se[i % se.size()]);\n\t}\n\tif (se[p].v == -2) {\n\t\tfor (int i = 0; i < re.size(); ++i) {\n\t\t\tif (re[i].v == -1) re[i].v = -2;\n\t\t\telse if (re[i].v == -2) re[i].v = -1;\n\t\t}\n\t}\n\tLL val = calc(re);\n\tif (se[p].v == -3) val = modExp(val, r - 1);\n\telse val = val * (r - 1) % MOD;\n\tfor (int i = 0; i <= p; ++i) ret.push_back(se[i]);\n\tret.push_back(dt(val));\n\tfor (int i = p; i < se.size(); ++i) ret.push_back(se[i]);\n\treturn ret;\n}\nint main()\n{\n\tint n; EXP e;\n\tscanf(\"%d\", &n);\n\tfor (int i = 0; i < n; ++i) {\n\t\tint r;\n\t\tchar s[200];\n\t\tscanf(\"%d%s\", &r, s);\n\t\tEXP se = compress(s, r);\n\t\tfor (int i = 0; i < se.size(); ++i) {\n\t\t\tif (!e.empty()) {\n\t\t\t\tif (e.back().v >= 0 && se[i].v >= 0) {\n\t\t\t\t\tdt t = e.back().followed(se[i]);\n\t\t\t\t\te.pop_back();\n\t\t\t\t\te.push_back(t);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\te.push_back(se[i]);\n\t\t}\n\t}\n\tprintf(\"%lld\\n\", calc(e));\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5920,"score_of_the_acc":-0.1455,"final_rank":10},{"submission_id":"aoj_2789_3005727","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int MOD = 1e9+7;\n\nstring origine;\n\nint modExp(long long a, long long b, int p) {\n\tint ret = 1;\n\tfor (a = (a%p+p)%p; b; b >>= 1, a = a*a%p) if (b&1) ret = ret*a%p;\n\treturn ret;\n}\n\nbool isDig(char c) {\n\treturn '0' <= c && c <= '9';\n}\n\nlong long calcExp(string exp) {\n\tif (!exp.size()) return 0;\n\tint cur = 0;\n\tif (exp[0] == '-' || exp[0] == '+') cur++;\n\tlong long ret = 0;\n\twhile (cur < exp.size()) {\n\t\tint sig = 1;\n\t\tif (cur && exp[cur - 1] == '-') sig = -1;\n\t\tlong long val = 1, now = 0;\n\t\twhile (cur < exp.size()) {\n\t\t\tif (exp[cur] == '*') {\n\t\t\t\tval = val * now % MOD;\n\t\t\t\tnow = 0;\n\t\t\t}\n\t\t\tif (isDig(exp[cur])) now = (now * 10 + exp[cur] - '0') % MOD;\n\t\t\tif (exp[cur] == '+' || exp[cur] == '-') {\n\t\t\t\t++cur;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++cur;\n\t\t}\n\t\tval = val * now % MOD;\n\t\tret = (ret + val * sig) % MOD;\n\t}\n\tret = (ret % MOD + MOD) % MOD;\n\treturn ret;\n}\n\nstring toStr(long long val) {\n\tstring ret;\n\tif (!val) {\n\t\tret.push_back('0');\n\t\treturn ret;\n\t}\n\tint flg = 0;\n\tif (val < 0) flg = 1, val *= -1;\n\twhile (val) {\n\t\tret.push_back('0' + val % 10);\n\t\tval /= 10;\n\t}\n\tif (flg) ret.push_back('-');\n\treverse(ret.begin(), ret.end());\n\treturn ret;\n}\n\nlong long getVal(string str) {\n\tlong long ret = 0, pw = 1;\n\twhile (str.size()) {\n\t\tret = (ret + pw * (str.back() - '0')) % MOD;\n\t\tstr.pop_back();\n\t\tpw = pw * 10 % MOD;\n\t}\n\treturn ret;\n}\n\nstring convert(string exp, int times) {\n\tif (times == 1) return exp;\n\tint sz = exp.size();\n\tint pos = -1;\n\tstring head, tail;\n\tfor (int i = 0; i < sz; i++) {\n\t\tif (exp[i] == '+' || exp[i] == '-') {\n\t\t\tpos = i;\n\t\t\tbreak;\n\t\t}\n\t\thead.push_back(exp[i]);\n\t}\n\tif (pos >= 0) {\n\t\tfor (int i = pos; i < sz; i++) tail.push_back(exp[i]);\n\t\tlong long val = calcExp(tail + head);\n\t\tval = (val * (times - 1)) % MOD;\n\t\treturn head + \"+\" + toStr(val) + tail;\n\t}\n\tpos = -1;\n\thead.clear();\n\tfor (int i = 0; i < sz; i++) {\n\t\tif (exp[i] == '*') {\n\t\t\tpos = i;\n\t\t\tbreak;\n\t\t}\n\t\thead.push_back(exp[i]);\n\t}\n\tif (pos >= 0) {\n\t\tfor (int i = pos + 1; i < sz; i++) tail.push_back(exp[i]);\n\t\tlong long val = calcExp(tail + head);\n\t\tval = modExp(val, (times - 1), MOD);\n\t\treturn head + \"*\" + toStr(val) + \"*\" + tail;\n\t}\n\tstring empty;\n\treturn empty;\n}\n\nvoid append(string str, int times) {\n\tstring res = convert(str, times);\n\tif (res.size()) {\n\t\torigine += res;\n\t\treturn;\n\t}\n\tstring tail;\n\twhile (origine.size() && isDig(origine.back())) tail.push_back(origine.back()), origine.pop_back();\n\treverse(tail.begin(), tail.end());\n\tlong long head = getVal(tail);\n\tlong long val = getVal(str);\n\tint l = str.size();\n\tlong long inst = head * modExp(10, 1LL * l * times, MOD) % MOD + val * (modExp(10, 1LL * l * times, MOD) - 1) % MOD * modExp((modExp(10, 1LL * l, MOD) - 1) % MOD, MOD - 2, MOD) % MOD;\n\tinst = ((inst % MOD) + MOD) % MOD;\n\torigine += toStr(inst);\n}\n\nint main() {\n\tios_base::sync_with_stdio(0);\n\tint n; cin >> n;\n\twhile (n--) {\n\t\tint times; string tmp; \n\t\tcin >> times >> tmp;\n\t\tappend(tmp, times);\n\t}\n\tcout << calcExp(origine) << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3492,"score_of_the_acc":-0.0152,"final_rank":1},{"submission_id":"aoj_2789_2574432","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconstexpr int N = 10001, MOD = 1e9+7;\n\nint n, r;\nchar s[N];\n\nstruct Vec {\n LL a[4];\n Vec() { memset(a, 0, sizeof(a)); }\n LL& operator [] (const int &i) { return a[i]; }\n const LL& operator [] (const int &i) const { return a[i]; }\n void print() {\n for(int i = 0; i < 4; ++i)\n fprintf(stderr, \"%lld%c\", a[i], \"\\t\\n\"[i==3]);\n }\n};\nstruct Mat {\n Vec a[4];\n Vec& operator [] (const int &i) { return a[i]; }\n const Vec& operator [] (const int &i) const { return a[i]; }\n Mat operator * (const Mat &b) {\n Mat rtn;\n for(int i = 0; i < 4; ++i)\n for(int j = 0; j < 4; ++j)\n for(int k = 0; k < 4; ++k)\n rtn[i][j] = (MOD + rtn[i][j] + a[i][k] * b[k][j]) % MOD;\n return rtn;\n }\n Vec operator * (const Vec &v) {\n Vec rtn;\n for(int i = 0; i < 4; ++i)\n for(int j = 0; j < 4; ++j)\n rtn[i] = (MOD + rtn[i] + a[i][j] * v[j]) % MOD;\n return rtn;\n }\n void print() {\n cerr << string(30, '-') << endl;\n for(int i = 0; i < 4; ++i)\n a[i].print();\n }\n};\n\nint main() {\n Mat eye, mul, pos, neg, dig;\n for(int i = 0; i < 4; ++i)\n eye[i][i] = 1;\n mul[0][0] = mul[1][2] = mul[3][3] = 1;\n pos[0][0] = pos[0][2] = pos[1][3] = pos[3][3] = 1;\n neg[0][0] = neg[0][2] = neg[3][3] = 1;\n neg[1][3] = -1;\n dig[0][0] = dig[1][1] = dig[3][3] = 1;\n dig[2][2] = 10;\n Vec v;\n v[1] = v[3] = 1;\n scanf(\"%d\", &n);\n for(int i = 0; i < n; ++i) {\n scanf(\"%d %s\", &r, s);\n Mat t = eye;\n for(int j = 0; s[j]; ++j) {\n if(s[j] == '*')\n t = mul * t;\n else if(s[j] == '+')\n t = pos * t;\n else if(s[j] == '-')\n t = neg * t;\n else {\n dig[2][1] = (s[j] - '0');\n t = dig * t;\n }\n }\n Mat cur = eye;\n while(r) {\n if(r & 1)\n cur = t * cur;\n r >>= 1;\n t = t * t;\n }\n v = cur * v;\n }\n printf(\"%lld\\n\", (MOD + v[0] + v[2]) % MOD);\n}","accuracy":1,"time_ms":70,"memory_kb":3208,"score_of_the_acc":-0.1364,"final_rank":9},{"submission_id":"aoj_2789_2570001","code_snippet":"#include <bits/stdc++.h>\n\nconst int MOD = 1E9 + 7;\n\nconst int NMAT[7][7] = {\n\t{1, 0, 0, 0, 0, 0, 0},\n\t{0, 1, 0, 0, 0, 0, 0},\n\t{0, 0, 1, -1, 0, 0, 0},\n\t{0, 0, 0, 10, 0, 0, 0},\n\t{0, 0, 0, 0, 1, -1, 0},\n\t{0, 0, 0, 0, 0, 10, 0},\n\t{0, 0, 0, 0, 0, 0, 1}\n};\n\nconst int MMAT[7][7] = {\n\t{1, 0, 0, 0, 0, 0, 0},\n\t{0, 0, 0, 0, 1, 0, 0},\n\t{0, 0, 0, 0, 0, 0, 0},\n\t{0, 0, 0, 0, 0, 0, 1},\n\t{0, 0, 0, 0, 0, 0, 0},\n\t{0, 0, 0, 0, 1, 0, 0},\n\t{0, 0, 0, 0, 0, 0, 1},\n};\n\nconst int AMAT[7][7] = {\n\t{1, 0, 0, 0, -1, 0, 0},\n\t{0, 0, 0, 0, 0, 0, 1},\n\t{0, 0, 0, 0, 0, 0, 0},\n\t{0, 0, 0, 0, 0, 0, 1},\n\t{0, 0, 0, 0, 0, 0, 0},\n\t{0, 0, 0, 0, 0, 0, 1},\n\t{0, 0, 0, 0, 0, 0, 1}\n};\n\nstruct mat {\n\tint d[7][7];\n\tmat () { for (int i = 0; i < 7; ++i) for (int j = 0; j < 7; ++j) d[i][j] = 0; }\n\tint *operator [] (int x) { return d[x]; }\n\tint const *operator [] (int x) const { return d[x]; }\n};\n\nmat operator * (const mat &a, const mat &b) {\n\tmat res;\n\tfor (int i = 0; i < 7; ++i)\n\t\tfor (int j = 0; j < 7; ++j)\n\t\t\tfor (int k = 0; k < 7; ++k)\n\t\t\t\tres[i][j] = (res[i][j] + 1ll * a[i][k] * b[k][j]) % MOD;\n\treturn res;\n}\n\nmat id () {\n\tmat res;\n\tfor (int i = 0; i < 7; ++i)\n\t\tres[i][i] = 1;\n\treturn res;\n}\n\nmat nmat[10], mmat, amat, smat;\n\nvoid init () {\n\tfor (int digit = 0; digit < 10; ++digit)\n\t\tfor (int i = 0; i < 7; ++i)\n\t\t\tfor (int j = 0; j < 7; ++j)\n\t\t\t\tnmat[digit][i][j] = (NMAT[i][j] < 0) ? digit : NMAT[i][j];\n\tfor (int i = 0; i < 7; ++i)\n\t\tfor (int j = 0; j < 7; ++j)\n\t\t\tmmat[i][j] = MMAT[i][j];\n\tfor (int i = 0; i < 7; ++i)\n\t\tfor (int j = 0; j < 7; ++j)\n\t\t\tamat[i][j] = (AMAT[i][j] < 0) ? 1 : AMAT[i][j];\n\tfor (int i = 0; i < 7; ++i)\n\t\tfor (int j = 0; j < 7; ++j)\n\t\t\tsmat[i][j] = (AMAT[i][j] < 0) ? MOD - 1 : AMAT[i][j];\n}\n\nint N;\nint R[11000];\nchar S[11000][20];\n\nint ans[7] = {0, 1, 0, 1, 0, 1, 1}, tmp[7];\n\nint main () {\n\tinit ();\n\tscanf (\"%d\", &N);\n\tfor (int i = 0; i < N; ++i)\n\t\tscanf (\"%d %s\", &R[i], S[i]);\n\tfor (int i = N - 1; i >= 0; --i) {\n\t\tmat mul = id (), ter = id ();\n\t\tfor (int j = strlen (S[i]) - 1; j >= 0; --j) {\n\t\t\tif (S[i][j] >= '0' && S[i][j] <= '9') mul = nmat[S[i][j] - '0'] * mul;\n\t\t\telse if (S[i][j] == '*') mul = mmat * mul;\n\t\t\telse if (S[i][j] == '+') mul = amat * mul;\n\t\t\telse mul = smat * mul;\n\t\t}\n\t\twhile (R[i]) {\n\t\t\tif (R[i] & 1) ter = mul * ter;\n\t\t\tmul = mul * mul;\n\t\t\tR[i] >>= 1;\n\t\t}\n\t\tfor (int i = 0; i < 7; ++i) {\n\t\t\ttmp[i] = 0;\n\t\t\tfor (int j = 0; j < 7; ++j)\n\t\t\t\ttmp[i] = (tmp[i] + 1ll * ans[j] * ter[i][j]) % MOD;\n\t\t}\n\t\tfor (int i = 0; i < 7; ++i) ans[i] = tmp[i];\n\t}\n\tfor (int i = 0; i < 7; ++i) {\n\t\ttmp[i] = 0;\n\t\tfor (int j = 0; j < 7; ++j)\n\t\t\ttmp[i] = (tmp[i] + 1ll * ans[j] * amat[i][j]) % MOD;\n\t}\n\tfor (int i = 0; i < 7; ++i) ans[i] = tmp[i];\n\tprintf (\"%d\\n\", ans[0]);\n}","accuracy":1,"time_ms":450,"memory_kb":3452,"score_of_the_acc":-1.0131,"final_rank":14},{"submission_id":"aoj_2789_2270607","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nconst ll mod = 1e9+7;\n\nll mod_pow(ll x, ll p){\n ll res = 1;\n\n while(p){\n if(p&1LL) res = res * x % mod;\n x = x * x % mod;\n p >>= 1;\n }\n\n return res;\n}\n\nmat mat_prod(mat A, mat B){\n size_t h = A.size(), w = B.size();\n mat res(h, vec(w,0));\n for(size_t i=0;i<h;i++){\n for(size_t j=0;j<w;j++){\n for(size_t k=0;k<A[i].size();k++){\n\tres[i][j] += A[i][k] * B[k][j] % mod;\n\tres[i][j] %= mod;\n }\n }\n }\n return res;\n}\t \n\nmat mat_pow(mat A, ll p){\n int n = A.size();\n mat res(n, vec(n,0));\n for(int i=0;i<n;i++) res[i][i] = 1;\n\n while(p){\n if(p&1LL) res = mat_prod(res, A);\n A = mat_prod(A,A);\n p >>= 1;\n }\n\n return res;\n}\n\ninline ll calc(const string s, ll &prod, ll &rem){\n ll res = 0;\n for(char c : s){\n if(c == '*'){\n prod *= rem;\n prod %= mod;\n rem = 0;\n }else if(c == '+'){\n res += (prod * rem) % mod;\n res %= mod;\n prod = 1; rem = 0;\n }else if(c == '-'){\n res += (prod * rem) % mod;\n res %= mod;\n prod = mod-1; rem = 0;\n }else{\n rem = rem*10 + (ll)(c-'0');\n rem %= mod;\n }\n }\n\n return res;\n}\n\nint main(){\n ll n;\n cin >> n;\n\n //temporary result can be represented as \"add + prod * rem\"\n ll add=0, prod=1, rem=0;\n\n //tuple<ll,ll> : <times, add before par, prod before par>\n stack< tuple<ll,ll,ll> > open;\n\n while(n--){\n ll r; string s;\n cin >> r >> s;\n\n if(s.find(\"(\") != string::npos){\n size_t p = s.find(\"(\");\n string pre = s.substr(0,p), suf = s.substr(p+1);\n add += calc(pre, prod, rem) % mod;\n add %= mod;\n \n open.push( make_tuple(1LL, add, prod) );\n add = 0, prod = 1;\n\n if(r-1>0){\n\tadd += calc(suf + pre, prod, rem) % mod;\n\tadd %= mod;\n\t\n\topen.push( make_tuple(r-1, add, prod) );\n\tadd = 0, prod = 1;\n }\n\n add += calc(suf, prod, rem) % mod;\n add %= mod;\n }else if(s.find(\")\") != string::npos){\n size_t p = s.find(\")\");\n string pre = s.substr(0,p), suf = s.substr(p+1);\n\n add += calc(pre, prod, rem) % mod;\n add %= mod;\n\n ll x = (add + (prod*rem%mod)) % mod, t;\n\n if(r-1>0){\n\tr--;\n\tstring m = suf + pre;\n\tsize_t k = 0;\n\tll cp = 1;\n\twhile(k<m.size() && m[k] == '*'){\n\t ll tmp = 0;\n\t k++;\n\t while(k<m.size() && isdigit(m[k])){\n\t tmp = tmp*10 + (ll)(m[k]-'0');\n\t tmp %= mod;\n\t k++;\n\t }\n\t cp *= tmp;\n\t}\n\t\n\tll ca = 0, tp = 1, trem = 0;\n\tca += calc(m.substr(k), tp, trem) % mod;\n\tca %= mod;\n\t\n\tca = (ca + (tp*trem%mod)) % mod;\n\t\n\twhile(r){\n\t assert( !open.empty() );\n\t ll oa,op;\n\t tie(t,oa,op) = open.top(); open.pop();\n\t \n\t if(t > r) open.push( make_tuple(t-r, oa, op) );\n\t \n\t t = min(t, r);\n\t r -= t;\n\t \n\t //calc f^t(x), where f(x) = cp*op*x + ca+oa\n\t (op *= cp) %= mod;\n\t (oa += ca) %= mod;\n\t \n\t mat A = { {op, oa}, {0,1} };\n\t A = mat_pow(A, t);\n\t x = A[0][0] * x + A[0][1];\n\t x %= mod;\n\t} \t\n }\n\n tie(t,add,prod) = open.top(); open.pop();\n if(t-1>0) open.push( make_tuple(t-1, add, prod) );\n rem = x;\n \n add += calc(suf, prod, rem) % mod;\n add %= mod;\n }else if(s.find(\"+\") != string::npos || s.find(\"-\") != string::npos ){\n size_t p = min( s.find(\"+\"), s.find(\"-\") );\n string pre = s.substr(0,p+1), suf = s.substr(p+1);\n add += calc(pre, prod, rem) % mod;\n add %= mod;\n\n add += (r-1) * calc(suf + pre, prod, rem) % mod;\n add %= mod;\n\n add += calc(suf, prod, rem) % mod;\n add %= mod;\n }else if(s.find(\"*\") != string::npos){\n size_t p = s.find(\"*\");\n string pre = s.substr(0,p+1), suf = s.substr(p+1);\n calc(pre, prod, rem);\n \n ll x = 1;\n calc(suf + pre, x, rem);\n prod *= mod_pow(x, r-1);\n prod %= mod;\n \n calc(suf, prod, rem);\n }else{\n ll x = 0, dummy = 1;\n calc(s, dummy, x);\n\n mat A = { {mod_pow(10, s.size()), x}, {0,1} };\n A = mat_pow(A, r);\n rem = A[0][0] * rem + A[0][1];\n rem %= mod;\n }\n }\n\n assert(open.empty());\n\n add += calc(\"+0\", prod, rem) % mod;\n add %= mod;\n cout << add << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3232,"score_of_the_acc":-0.0467,"final_rank":4},{"submission_id":"aoj_2789_2075736","code_snippet":"/**************************************************************************************************************\n * Md. Abdulla Al Mamun (Nayon)\n * ID: 1306001\n * Session: 2013-2014\n * Department of Computer Science and Engineering\n * Begum Rokeya University, Rangpur (BRUR)\n***************************************************************************************************************/\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define PI acos(-1.0)\n#define EPS 1e-9\n#define INF 1 << 28\n#define sq(a) ((a) * (a))\n#define toRad(a) ((a)*(PI)/180)\n#define toDeg(a) ((a)*180/(PI))\n#define all(x) (x).begin(), (x).end()\n#define pb(x) push_back(x)\n#define mp(a, b) make_pair((a), (b))\n#define endl '\\n'\n#define MAX 100000\n#define MOD 1000000007\n#define what_is(x) cerr << #x << \" is \" << x << endl;\n#define mset(array, value) memset(array, value, sizeof(array))\n\ninline bool isEq(double a, double b){return (abs(a-b) < EPS);}\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ninline ll negModHandler(ll a, ll d){return ((a%d)<0)?d+(a%d):(a%d);}\n\n//#define isValid(a, b) ((a >= 0 && a < b) ? 1 : 0)\n//int dr[] = {0, -1, -1, -1, 0, 1, 1, 1};\n//int dc[] = {1, 1, 0, -1, -1, -1, 0, 1};\n\nstring strMod(string s)\n{\n\tll n = 0, len = s.length();\n\tfor(int i = 0; i < len; i++){\n\t\tn = (n*10 + s[i]-'0')%MOD;\n\t}\n\tstringstream ss;\n\tss << n;\n\tss >> s;\n\treturn s;\n}\n\nint main()\n{\n\t//freopen(\"in.txt\", \"r\", stdin);\n\t//freopen(\"out.txt\", \"w\", stdout);\n\tios_base::sync_with_stdio(false); cin.tie(NULL);\n\tint n, r, i;\n\tstring str, all;\n\tstringstream ss, ss2;\n\tcin >> n;\n\tall = \"\";\n\twhile(n--){\n\t\tcin >> r >> str;\n\t\tfor(i = 0; i < r; i++){\n\t\t\tall += str;\n\t\t}\n\t}\n\t//cout << \"# \" << all << endl;\n\tint ln = all.length();\n\tstring all2 = \"\";\n\tstr = \"\";\n\tfor(i = 0; i < ln; i++){\n\t\twhile(i < ln && isdigit(all[i])){\n\t\t\tstr += all[i];\n\t\t\ti++;\n\t\t}\n\t\twhile(i < ln && all[i] == '*'){\n\t\t\tstring str2 = \"\";\n\t\t\ti++;\n\t\t\twhile(isdigit(all[i])){\n\t\t\t\tstr2 += all[i];\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tss.clear();\n\t\t\tss2.clear();\n\t\t\tss << strMod(str);\n\t\t\tss2 << strMod(str2);\n\t\t\tll n1, n2;\n\t\t\tss >> n1;\n\t\t\tss2 >> n2;\n\t\t\tn1 = (n1 %MOD * n2%MOD)%MOD;\n\t\t\tss.clear();\n\t\t\tss << n1;\n\t\t\tss >> str;\n\t\t}\n\t\tif(all[i] == '-' || all[i] == '+'){\n\t\t\tstr+=all[i];\n\t\t}\n\t\tall2 += str;\n\t\tstr = \"\";\n\t}\n\t//cout << \"# \" << all2 << endl;\n\tln = all2.length();\n\tll ans = 0;\n\tstr = \"\";\n\ti = 0;\n\twhile(i < ln && isdigit(all2[i])){\n\t\tstr += all2[i];\n\t\ti++;\n\t}\n\tss.clear();\n\tss << strMod(str);\n\tss >> ans;\n\tif(i < ln){\n\t\tchar sign = all2[i];\n\t\tfor(i++; i < ln; i++){\n\t\t\tstr = \"\";\n\t\t\twhile(i < ln && isdigit(all2[i])){\n\t\t\t\tstr += all2[i];\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tll n1;\n\t\t\tss.clear();\n\t\t\tss << strMod(str);\n\t\t\tss >> n1;\n\t\t\tif(sign == '+'){\n\t\t\t\tans = negModHandler(ans+n1, MOD);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tans = negModHandler(ans-n1, MOD);\n\t\t\t}\n\t\t\tif(i < ln)\n\t\t\t\tsign = all2[i];\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.3877551020408163,"time_ms":30,"memory_kb":3776,"score_of_the_acc":-0.0759,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_2789_10865828\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll INF = 1ll << 60;\\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\\ntemplate <class T> using V = vector<T>;\\ntemplate <class A, class B>\\nbool chmax(A &a, B b) { return a < b && (a=b, true); }\\ntemplate <class A, class B>\\nbool chmin(A &a, B b) { return b < a && (a=b, true); }\\n\\ntemplate <int MD, int g = 3>\\nstruct ModInt {\\n using M = ModInt;\\n const static inline M G = g;\\n unsigned int v;\\n ModInt() : v(0) {}\\n ModInt(ll w) : v(w % MD + MD) {\\n if(v >= MD) v -= MD;\\n }\\n static M raw(unsigned int v) {\\n M res;\\n res.v = (v < MD) ? v : v - MD;\\n return res;\\n }\\n explicit operator bool() const {\\n return v != 0;\\n }\\n M operator-() const {\\n return M() - *this;\\n }\\n M operator+(M r) const {\\n return raw(v + r.v);\\n }\\n M operator-(M r) const {\\n return raw(v + MD - r.v);\\n }\\n M operator*(M r) const {\\n return raw(ll(v) * r.v % MD);\\n }\\n M operator/(M r) const {\\n return *this * r.inv();\\n }\\n M& operator+=(M r) {\\n return *this = *this + r;\\n }\\n M& operator-=(M r) {\\n return *this = *this - r;\\n }\\n M& operator*=(M r) {\\n return *this = *this * r;\\n }\\n M& operator/=(M r) {\\n return *this = *this / r;\\n }\\n bool operator==(M r) const {\\n return v == r.v;\\n }\\n M pow(ll n) const {\\n M 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 M inv() const {\\n return pow(MD - 2);\\n }\\n friend ostream& operator<<(ostream& os, M r) {\\n return os << r.v;\\n }\\n};\\nusing Mint = ModInt<1000000007>;\\n\\nconst int Z = 4;\\nusing Node = array<array<Mint, Z>, Z>;\\nNode mul(Node l, Node r){\\n Node res;\\n REP(i,Z) REP(j,Z) REP(k,Z) res[i][k] += l[i][j] * r[j][k];\\n return res;\\n}\\nNode pow(Node a, ll i){\\n if(i == 0){\\n Node res;\\n REP(i,Z) res[i][i] = 1;\\n return res;\\n }\\n auto b = pow(mul(a,a), i/2);\\n if(i%2 == 1) b = mul(b, a);\\n return b;\\n}\\n\\nvoid testcase(){\\n ll N; cin >> N;\\n Node res;\\n res[0][3] = 1;\\n res[0][0] = 1;\\n REP(i,N){\\n ll t; cin >> t;\\n string s; cin >> s;\\n Node x = pow(Node(), 0);\\n for(auto c : s){\\n Node y;\\n if('0' <= c && c <= '9'){\\n y[0][0] = 1;\\n y[0][1] = c - '0';\\n y[1][1] = 10;\\n y[2][2] = 1;\\n y[3][3] = 1;\\n } else if(c == '*'){\\n y[1][0] = 1;\\n y[2][2] = 1;\\n y[3][3] = 1;\\n } else if(c == '+' || c == '-') {\\n Mint co = (c == '-' ? -1 : 1);\\n y[3][0] = co;\\n y[1][2] = 1;\\n y[2][2] = 1;\\n y[3][3] = 1;\\n }\\n x = mul(x, y);\\n }\\n res = mul(res, pow(x, t));\\n }\\n Mint ans = res[0][1] + res[0][2];\\n cout << ans.v << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n cin.tie(nullptr)->sync_with_stdio(false);\\n testcase();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.1036,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2789_10852778\",\n \"code_snippet\": \"#include <bits/stdtr1c++.h>\\n\\n#define MOD 1000000007\\n#define clr(ar) memset(ar, 0, sizeof(ar))\\n\\nusing namespace std;\\n\\nstruct Matrix{\\n int row, col, ar[5][5];\\n\\n Matrix(){}\\n Matrix(int n, int m, int diagonal = 0){\\n clr(ar);\\n row = n, col = m;\\n for (int i = min(n, m) - 1; i >= 0; i--) ar[i][i] = diagonal;\\n }\\n\\n Matrix operator* (const Matrix& other) const{\\n int i, j, k;\\n\\t\\tMatrix res(row, other.col);\\n\\n\\t\\tfor(i = 0; i < row; i++){\\n\\t\\t\\tfor(j = 0; j < other.col; j++){\\n long long x = 0;\\n\\t\\t\\t\\tfor(k = 0; k < col; k++){\\n\\t\\t\\t\\t\\tx += ((long long)ar[i][k] * other.ar[k][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tres.ar[i][j] = x % MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\n\\tMatrix operator^ (long long n) const{\\n\\t Matrix x = *this, res = Matrix(row, col, 1);\\n\\t\\twhile (n){\\n\\t\\t\\tif (n & 1) res = res * x;\\n\\t\\t\\tn = n >> 1, x = x * x;\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n} add, sub, mul, res;\\n\\nconst int n = 4;\\nchar str[10010];\\n\\nvoid generate(){\\n add = Matrix(n, n, 1);\\n for (int i = 0; i < 2; i++){\\n swap(add.ar[i + 1][i + 1], add.ar[i][i + 2]);\\n }\\n\\n sub = add;\\n sub.ar[1][3] = MOD - 1;\\n\\n mul = sub;\\n mul.ar[1][3] = 0;\\n swap(mul.ar[0][2], mul.ar[1][2]);\\n\\n res = Matrix(n, n);\\n res.ar[1][0] = res.ar[3][0] = 1;\\n}\\n\\nvoid run(int k, const char* str){\\n int i, j;\\n Matrix x = Matrix(n, n, 1);\\n\\n for (i = 0; str[i]; i++){\\n if (str[i] == '+') x = add * x;\\n else if (str[i] == '-') x = sub * x;\\n else if (str[i] == '*') x = mul * x;\\n else{\\n Matrix y = Matrix(n, n, 1);\\n y.ar[2][1] = str[i] - 48, y.ar[2][2] *= 10;\\n x = y * x;\\n }\\n }\\n\\n x = x ^ k;\\n res = x * res;\\n}\\n\\nint main(){\\n generate();\\n int q, i, j, k, l, x, y, z;\\n\\n scanf(\\\"%d\\\", &q);\\n while (q--){\\n scanf(\\\"%d %s\\\", &k, str);\\n run(k, str);\\n }\\n\\n res = add * res;\\n printf(\\\"%d\\\\n\\\", res.ar[0][0]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -0.0658,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2789_8525882\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// 04:00\\n\\nconstexpr long long mod = 1000000007;\\n\\nlong long mod_pow(long long base, long long exp) {\\n long long res = 1;\\n while (exp > 0) {\\n if (exp & 1) {\\n res *= base;\\n res %= mod;\\n }\\n base *= base;\\n base %= mod;\\n exp >>= 1;\\n }\\n return res;\\n}\\n\\n// sum (k ^ i) (0 <= i < n)\\nlong long sum_mul(long long k, long long n) {\\n if (k == 0) return 0;\\n if (k == 1) return n;\\n long long res = (mod_pow(k, n) - 1 + mod) % mod;\\n res *= mod_pow(k - 1, mod - 2);\\n res %= mod;\\n return res;\\n}\\n\\nstruct SimpleParser {\\n using CopyIter = std::string::const_iterator;\\n using Iter = CopyIter&;\\n std::string line;\\n\\n SimpleParser(std::string s): line(s) {}\\n\\n void skip(Iter it, char c) {\\n assert(*it == c);\\n ++it;\\n }\\n\\n long long parse() {\\n // std::cerr << \\\"start\\\" << std::endl;\\n auto it = line.cbegin();\\n auto res = expr(it);\\n // std::cerr << \\\"finish\\\" << std::endl;\\n return res;\\n }\\n\\n long long expr(Iter it) {\\n auto res = term(it);\\n while (it != line.end() && (*it == '+' || *it == '-')) {\\n auto op = *it;\\n if (op == '+') {\\n skip(it, '+');\\n res = (res + term(it)) % mod;\\n } else {\\n skip(it, '-');\\n res = (res - term(it) + mod) % mod;\\n }\\n }\\n return res;\\n }\\n\\n long long term(Iter it) {\\n auto res = factor(it);\\n while (it != line.end() && (*it == '*')) {\\n skip(it, '*');\\n res = res * factor(it) % mod;\\n }\\n return res;\\n }\\n\\n long long factor(Iter it) {\\n bool minus = false;\\n if (*it == '+') {\\n skip(it, '+');\\n } else if (*it == '-') {\\n skip(it, '-');\\n minus = true;\\n }\\n auto res = number(it);\\n if (minus) {\\n res = (2 * mod - res) % mod;\\n }\\n return res;\\n }\\n\\n long long number(Iter it) {\\n long long res = 0;\\n while (it != line.end() && std::isdigit(*it)) {\\n char c = *it;\\n skip(it, c);\\n res = 10 * res + c - '0';\\n res %= mod;\\n }\\n return res;\\n }\\n};\\n\\n// + - *\\nstd::pair<long long, std::string> to_A(const std::pair<long long, std::string>& line) {\\n auto [r, s] = line;\\n size_t pos = 0;\\n\\n if (s.find('+') != std::string::npos) {\\n pos = std::max(pos, s.find_last_of('+'));\\n }\\n if (s.find('-') != std::string::npos) {\\n pos = std::max(pos, s.find_last_of('-'));\\n }\\n\\n std::string lhs = s.substr(0, pos);\\n std::string rhs = s.substr(pos);\\n assert(rhs.front() == '+' || rhs.front() == '-');\\n SimpleParser parser(rhs + lhs);\\n auto val = parser.parse();\\n val = (r - 1) * val % mod;\\n\\n std::string res = (lhs + '+' + std::to_string(val) + rhs);\\n return {1, res};\\n}\\n\\n// *\\nstd::pair<long long, std::string> to_B(const std::pair<long long, std::string>& line) {\\n auto [r, s] = line;\\n assert(s.find('*') != std::string::npos);\\n size_t pos = s.find('*');\\n\\n std::string lhs = s.substr(0, pos);\\n std::string rhs = s.substr(pos);\\n assert(rhs.front() == '*');\\n\\n std::string temp = rhs + lhs;\\n temp.erase(temp.begin());\\n SimpleParser parser(temp);\\n auto val = parser.parse();\\n val = mod_pow(val, r - 1);\\n std::string res = (lhs + \\\"*\\\" + std::to_string(val) + rhs);\\n return {1, res};\\n}\\n\\n// + -\\nstd::pair<long long, std::string> to_C(const std::pair<long long, std::string>& line) {\\n auto [r, s] = line;\\n size_t pos = 0;\\n\\n if (s.find('+') != std::string::npos) {\\n pos = std::max(pos, s.find_last_of('+'));\\n }\\n if (s.find('-') != std::string::npos) {\\n pos = std::max(pos, s.find_last_of('-'));\\n }\\n\\n std::string lhs = s.substr(0, pos);\\n std::string rhs = s.substr(pos);\\n assert(rhs.front() == '+' || rhs.front() == '-');\\n SimpleParser parser(rhs + lhs);\\n auto val = parser.parse();\\n val = (r - 1) * val % mod;\\n\\n std::string res = (lhs + '+' + std::to_string(val) + rhs);\\n return {1, res};\\n}\\n\\nstd::pair<long long, std::string> to_D(const std::pair<long long, std::string>& line) {\\n return line;\\n}\\n\\nstd::pair<long long, std::string> preprocess(const std::pair<long long, std::string>& line) {\\n auto [r, s] = line;\\n bool has_plus_or_minus = (s.find('+') != std::string::npos) || (s.find('-') != std::string::npos);\\n bool has_mul = (s.find('*') != std::string::npos);\\n\\n if (has_plus_or_minus && has_mul) {\\n return to_A(line);\\n } else if (has_mul) {\\n return to_B(line);\\n } else if (has_plus_or_minus) {\\n return to_C(line);\\n } else {\\n return to_D(line);\\n }\\n}\\n\\nstd::string concat(const std::vector<std::pair<long long, std::string>>& formulas) {\\n // std::cerr << \\\"start concat\\\" << std::endl;\\n std::string res;\\n long long val = 0;\\n for (int i = 0; i < (int)formulas.size(); i++) {\\n // std::cerr << \\\"concat roop \\\" << i << std::endl;\\n auto [r, s] = formulas[i];\\n if (r != 1) {\\n // std::cerr << \\\"ASDASDASDASD\\\" << std::endl;\\n assert(std::all_of(s.begin(), s.end(), [](char c) { return std::isdigit(c); }));\\n val *= mod_pow(10, s.size() * r);\\n val %= mod;\\n\\n long long k = mod_pow(10, s.size());\\n SimpleParser parser(s);\\n auto s_val = parser.parse();\\n val += s_val * sum_mul(k, r) % mod;\\n val %= mod;\\n } else {\\n // std::cerr << \\\"ASDASD\\\" << std::endl;\\n for (int j = 0; j < (int)s.size(); j++) {\\n if (std::isdigit(s[j])) {\\n val = (10 * val + s[j] - '0') % mod;\\n } else {\\n res += std::to_string(val);\\n val = 0;\\n res.push_back(s[j]);\\n }\\n }\\n }\\n\\n if (i + 1 == (int)formulas.size()) {\\n res += std::to_string(val);\\n val = 0;\\n }\\n }\\n // std::cerr << \\\"end concat\\\" << std::endl;\\n return res; \\n}\\n\\nint main() {\\n int n;\\n std::cin >> n;\\n std::vector<std::pair<long long, std::string>> formulas;\\n for (int i = 0; i < n; i++) {\\n long long r;\\n std::string s;\\n std::cin >> r >> s;\\n formulas.push_back(preprocess({r, s}));\\n }\\n\\n // std::cerr << \\\"------------ \\\" << std::endl;\\n // std::cerr << \\\"after preprocess \\\" << std::endl;\\n // for (auto [r, s]: formulas) {\\n // std::cerr << r << ' ' << s << std::endl;\\n // }\\n std::string line = concat(formulas);\\n // std::cerr << \\\"------------ \\\" << std::endl;\\n // std::cerr << \\\"after concat \\\" << std::endl;\\n // std::cerr << line << std::endl;\\n\\n SimpleParser parser(line);\\n std::cout << parser.parse() << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4444,\n \"score_of_the_acc\": -0.0663,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2789_8403939\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 最初 * がないと思って誤読した．痛すぎる．\\nconst long long mod = 1000000007;\\n\\nlong long modpow(long long a, long long b, long long m) {\\n long long p = 1, q = a;\\n for (int i = 0; i < 60; i++) {\\n if ((b >> i) & 1) { p *= q; p %= m; }\\n q *= q; q %= m;\\n }\\n return p;\\n}\\n\\nlong long Division(long long a, long long b, long long m) {\\n return (a * modpow(b, m - 2, m)) % m;\\n}\\n\\n// ================================================ Solve Function ================================================\\nlong long StoiMod(string str) {\\n long long eval = 0;\\n for (int i = 0; i < (int)str.size(); i++) {\\n eval *= 10LL;\\n eval += (long long)(str[i] - '0');\\n eval %= mod;\\n }\\n return eval;\\n}\\n\\nlong long Repeat(string str, long long rep) {\\n long long val1 = modpow(10, (long long)str.size(), mod);\\n long long val2 = modpow(val1, rep, mod);\\n long long val3 = Division((val2 + mod - 1) % mod, (val1 + mod - 1) % mod, mod);\\n long long base = StoiMod(str);\\n return val3 * base % mod;\\n}\\n\\nlong long Solve(vector<pair<string, long long>> Vec) {\\n long long Answer1 = 1;\\n long long Answer2 = 1;\\n vector<vector<string>> List(Vec.size(), vector<string>{});\\n /*cout << \\\"Solve:\\\" << endl;\\n for (int i = 0; i < Vec.size(); i++) cout << \\\" - \\\" << Vec[i].first << \\\" \\\" << Vec[i].second << endl;*/\\n\\n // Decompression\\n for (int i = 0; i < (int)Vec.size(); i++) {\\n string str = \\\"\\\";\\n for (int j = 0; j < (int)Vec[i].first.size(); j++) {\\n if (Vec[i].first[j] == '*') {\\n List[i].push_back(str);\\n str = \\\"\\\";\\n }\\n else str += Vec[i].first[j];\\n }\\n List[i].push_back(str);\\n }\\n\\n // Pattern 1\\n for (int i = 0; i < (int)Vec.size(); i++) {\\n if (List[i].size() == 1) continue;\\n for (int j = 1; j < (int)List[i].size() - 1; j++) {\\n long long val = StoiMod(List[i][j]);\\n Answer1 *= modpow(val, Vec[i].second, mod);\\n Answer1 %= mod;\\n }\\n string str = \\\"\\\";\\n str += List[i][List[i].size() - 1];\\n str += List[i][0];\\n long long val = StoiMod(str);\\n Answer1 *= modpow(val, Vec[i].second - 1, mod);\\n Answer1 %= mod;\\n }\\n\\n // Pattern 2\\n int cx = 0;\\n while (cx < (int)Vec.size()) {\\n int Fin = cx;\\n bool Flag = false;\\n long long Current = 0;\\n if (List[cx].size() == 1) Current = Repeat(List[cx][List[cx].size() - 1], Vec[cx].second);\\n if (List[cx].size() >= 2) Current = Repeat(List[cx][List[cx].size() - 1], 1);\\n\\n // Going Forward\\n for (int i = cx + 1; i < (int)Vec.size(); i++) {\\n long long Len = List[i][0].size();\\n long long Tim = Vec[i].second; if (List[i].size() >= 2) Tim = 1;\\n Current *= modpow(10LL, Len * Tim, mod);\\n Current %= mod;\\n Fin = i;\\n Current += Repeat(List[i][0], Tim);\\n Current %= mod;\\n if (List[i].size() >= 2) break;\\n if (i == (int)Vec.size() - 1) Flag = true;\\n }\\n\\n // Terminal\\n Answer2 *= Current;\\n Answer2 %= mod;\\n if (Flag == true || cx == (int)Vec.size() - 1) break;\\n cx = Fin;\\n }\\n if (List[0].size() >= 2) {\\n Answer2 *= Repeat(List[0][0], 1);\\n Answer2 %= mod;\\n }\\n\\n // Return\\n /*cout << \\\" - Return = \\\" << Answer1 * Answer2 % mod << \\\" (\\\" << Answer1 << \\\",\\\" << Answer2 << \\\")\\\" << endl;\\n cout << endl;*/\\n return Answer1 * Answer2 % mod;\\n}\\n\\n// ================================================ Main Function ================================================\\nlong long N;\\nlong long R[1 << 19];\\nstring S[1 << 19];\\n\\nint main() {\\n // Step 1. Input\\n cin >> N;\\n for (int i = 0; i < N; i++) cin >> R[i] >> S[i];\\n vector<pair<string, long long>> Current;\\n char CurrentFugo = '+';\\n long long Answer = 0;\\n\\n // Step 2. Get Answer (Part 1)\\n for (int i = 0; i < N; i++) {\\n string str = \\\"\\\";\\n for (int j = 0; j < (int)S[i].size(); j++) {\\n if (S[i][j] == '+' || S[i][j] == '-') {\\n Current.push_back(make_pair(str, 1));\\n long long eval = Solve(Current);\\n if (CurrentFugo == '+') Answer = (Answer + eval + mod) % mod;\\n if (CurrentFugo == '-') Answer = (Answer - eval + mod) % mod;\\n str = \\\"\\\";\\n CurrentFugo = S[i][j];\\n Current.clear();\\n }\\n else str += S[i][j];\\n }\\n if (str.size() == S[i].size()) Current.push_back(make_pair(str, R[i]));\\n if (str.size() != S[i].size()) Current.push_back(make_pair(str, 1LL));\\n if (i == N - 1) {\\n long long eval = Solve(Current);\\n if (CurrentFugo == '+') Answer = (Answer + eval + mod) % mod;\\n if (CurrentFugo == '-') Answer = (Answer - eval + mod) % mod;\\n }\\n }\\n\\n // Step 3. Get Answer (Part 2)\\n for (int i = 0; i < N; i++) {\\n string str = \\\"\\\";\\n char Fugo = '.';\\n for (int j = 0; j < (int)S[i].size() * 2; j++) {\\n if (S[i][j % S[i].size()] == '+' || S[i][j % S[i].size()] == '-') {\\n if (Fugo != '.') {\\n long long eval = Solve(vector<pair<string, long long>>{make_pair(str, 1LL)});\\n long long tm = R[i] - 1;\\n eval = (eval * tm) % mod;\\n if (Fugo == '+') Answer = (Answer + eval + mod) % mod;\\n if (Fugo == '-') Answer = (Answer - eval + mod) % mod;\\n }\\n Fugo = S[i][j];\\n str = \\\"\\\";\\n if (j >= S[i].size()) break;\\n }\\n else str += S[i][j % S[i].size()];\\n }\\n }\\n\\n // Step 3. Output\\n cout << Answer << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 21852,\n \"score_of_the_acc\": -1.0682,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2789_8334831\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int MOD = 1000000007;\\n\\nclass modint {\\nprivate:\\n\\tint x;\\npublic:\\n\\tmodint() : x(0) {}\\n\\tmodint(long long n) : x(n >= 0 ? n % MOD : (n - (-n) % MOD) % MOD) {}\\n\\tint get() const { return x; }\\n\\tmodint& operator+=(const modint& m) { x = (x + m.x) % MOD; return *this; }\\n\\tmodint& operator*=(const modint& m) { x = 1LL * x * m.x % MOD; return *this; }\\n\\tmodint operator+(const modint& m) const { return modint(*this) += m; }\\n\\tmodint operator*(const modint& m) const { return modint(*this) *= m; }\\n\\tmodint pow(long long b) const {\\n\\t\\tmodint a(*this);\\n\\t\\tmodint res(1);\\n\\t\\twhile (b >= 1) {\\n\\t\\t\\tif (b % 2 == 1) {\\n\\t\\t\\t\\tres *= a;\\n\\t\\t\\t}\\n\\t\\t\\ta *= a;\\n\\t\\t\\tb /= 2;\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n};\\n\\nclass value {\\npublic:\\n\\tmodint m; long long digits;\\n\\tvalue() : m(modint()), digits(0) {}\\n\\tvalue(const modint& m_, long long digits_) : m(m_), digits(digits_) {}\\n\\tstring to_string() const {\\n\\t\\treturn \\\"(\\\" + std::to_string(m.get()) + \\\",\\\" + std::to_string(digits) + \\\")\\\";\\n\\t}\\n};\\n\\n// state type 0: l\\n// state type 1: l] * [a] * [r\\n// state type 2: l] * [a] + [b] + [c] * [r\\n\\nclass expression {\\npublic:\\n\\tint tp;\\n\\tvalue l, r;\\n\\tmodint a, b, c;\\n\\texpression() : tp(-1), l(value()), r(value()), a(modint()), b(modint()), c(modint()) {}\\n\\texpression(const value& l_) : tp(1), l(l_), r(value()), a(modint()), b(modint()), c(modint()) {}\\n\\texpression(const value& l_, const modint& a_, const value& r_) : tp(2), l(l_), r(r_), a(a_), b(modint()), c(modint()) {}\\n\\texpression(const value& l_, const modint& a_, const modint& b_, const modint& c_, const value& r_) : tp(3), l(l_), r(r_), a(a_), b(b_), c(c_) {}\\n\\tstring to_string() const {\\n\\t\\tif (tp == 1) {\\n\\t\\t\\treturn \\\"?\\\" + l.to_string() + \\\"?\\\";\\n\\t\\t}\\n\\t\\tif (tp == 2) {\\n\\t\\t\\treturn \\\"?\\\" + l.to_string() + \\\"*\\\" + std::to_string(a.get()) + \\\"*\\\" + r.to_string() + \\\"?\\\";\\n\\t\\t}\\n\\t\\tif (tp == 3) {\\n\\t\\t\\treturn \\\"?\\\" + l.to_string() + \\\"*\\\" + std::to_string(a.get()) + \\\"+\\\" + std::to_string(b.get()) + \\\"+\\\" + std::to_string(c.get()) + \\\"*\\\" + r.to_string() + \\\"?\\\";\\n\\t\\t}\\n\\t\\treturn string();\\n\\t}\\n};\\n\\nvalue merge(const value& v1, const value& v2) {\\n\\treturn value(v1.m * modint(10).pow(v2.digits) + v2.m, v1.digits + v2.digits);\\n}\\n\\nexpression merge(const expression& e1, const expression& e2) {\\n\\tif (e1.tp == 1 && e2.tp == 1) {\\n\\t\\treturn expression(merge(e1.l, e2.l));\\n\\t}\\n\\tif (e1.tp == 1 && e2.tp == 2) {\\n\\t\\treturn expression(merge(e1.l, e2.l), e2.a, e2.r);\\n\\t}\\n\\tif (e1.tp == 1 && e2.tp == 3) {\\n\\t\\treturn expression(merge(e1.l, e2.l), e2.a, e2.b, e2.c, e2.r);\\n\\t}\\n\\tif (e1.tp == 2 && e2.tp == 1) {\\n\\t\\treturn expression(e1.l, e1.a, merge(e1.r, e2.l));\\n\\t}\\n\\tif (e1.tp == 2 && e2.tp == 2) {\\n\\t\\treturn expression(e1.l, e1.a * merge(e1.r, e2.l).m * e2.a, e2.r);\\n\\t}\\n\\t// state type 0: l\\n\\t// state type 1: l] * [a] * [r\\n\\t// state type 2: l] * [a] + [b] + [c] * [r\\n\\tif (e1.tp == 2 && e2.tp == 3) {\\n\\t\\treturn expression(e1.l, e1.a * merge(e1.r, e2.l).m * e2.a, e2.b, e2.c, e2.r);\\n\\t}\\n\\tif (e1.tp == 3 && e2.tp == 1) {\\n\\t\\treturn expression(e1.l, e1.a, e1.b, e1.c, merge(e1.r, e2.l));\\n\\t}\\n\\tif (e1.tp == 3 && e2.tp == 2) {\\n\\t\\treturn expression(e1.l, e1.a, e1.b, e1.c * merge(e1.r, e2.l).m * e2.a, e2.r);\\n\\t}\\n\\tif (e1.tp == 3 && e2.tp == 3) {\\n\\t\\treturn expression(e1.l, e1.a, e1.b + e1.c * merge(e1.r, e2.l).m * e2.a + e2.b, e2.c, e2.r);\\n\\t}\\n\\treturn expression();\\n}\\n\\nstring transform(string S) {\\n\\tstring res;\\n\\tfor (char c : S) {\\n\\t\\tif (c != '-') {\\n\\t\\t\\tres += c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tres += \\\"+\\\" + to_string(MOD - 1) + \\\"*\\\";\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\nexpression level0(const string& S) {\\n\\tmodint x;\\n\\tfor (char c : S) {\\n\\t\\tx = x * 10 + int(c - '0');\\n\\t}\\n\\treturn expression(value(x, S.size()));\\n}\\n\\nexpression level1(const string& S) {\\n\\tfor (int i = int(S.size()) - 1; i >= 0; i--) {\\n\\t\\tif (S[i] == '*') {\\n\\t\\t\\texpression lc = level1(S.substr(0, i));\\n\\t\\t\\texpression rc = level0(S.substr(i + 1));\\n\\t\\t\\texpression mc(value(), modint(1), value());\\n\\t\\t\\treturn merge(merge(lc, mc), rc);\\n\\t\\t}\\n\\t}\\n\\treturn level0(S);\\n}\\n\\nexpression level2(const string& S) {\\n\\tfor (int i = int(S.size()) - 1; i >= 0; i--) {\\n\\t\\tif (S[i] == '+') {\\n\\t\\t\\texpression lc = level2(S.substr(0, i));\\n\\t\\t\\texpression rc = level1(S.substr(i + 1));\\n\\t\\t\\texpression mc(value(), modint(1), modint(0), modint(1), value());\\n\\t\\t\\treturn merge(merge(lc, mc), rc);\\n\\t\\t}\\n\\t}\\n\\treturn level1(S);\\n}\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<int> R(N);\\n\\tvector<string> S(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> R[i] >> S[i];\\n\\t\\tS[i] = transform(S[i]);\\n\\t}\\n\\tvector<expression> E(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tE[i] = level2(S[i]);\\n\\t}\\n\\tvector<expression> F(N, expression(value()));\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\texpression e = E[i];\\n\\t\\tint b = R[i];\\n\\t\\twhile (b >= 1) {\\n\\t\\t\\tif (b % 2 == 1) {\\n\\t\\t\\t\\tF[i] = merge(F[i], e);\\n\\t\\t\\t}\\n\\t\\t\\te = merge(e, e);\\n\\t\\t\\tb /= 2;\\n\\t\\t}\\n\\t}\\n\\texpression result = expression(value());\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tresult = merge(result, F[i]);\\n\\t}\\n\\texpression aux(value(), modint(1), modint(0), modint(1), value());\\n\\texpression ans = merge(merge(aux, result), aux);\\n\\tmodint final_ans = ans.b;\\n\\tcout << final_ans.get() << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5032,\n \"score_of_the_acc\": -0.0978,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2789_7182433\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\nusing ll = long long;\\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;}\\nconst int INF = (1<<30)-1;\\n#define all(p) p.begin(),p.end()\\nconst int mod=1e9+7;\\n\\n/*\\n前から見る\\nA = 今の答え\\nB = 今の積\\nC = 一個前までのやつ\\n\\nnum\\nB' <- B * 10 + C * num\\n\\n+\\nA' <- A + B\\nB' <- 1\\nC' <- 1\\n\\n-\\nA' <- A + B\\nB' <- -1\\nC' <- -1\\n\\n*\\nB' <- 0\\nC' <- B\\n\\n*/\\n\\nint main(){\\n\\tauto e=[&]()->vector<vector<ll>>{\\n\\t\\tvector<vector<ll>> p(4,vector<ll>(4));\\n\\t\\trep(i,0,4) p[i][i]=1;\\n\\t\\treturn p;\\n\\t};\\n\\tauto f=[&](vector<vector<ll>> l,vector<vector<ll>> r)->vector<vector<ll>>{\\n\\t\\tvector<vector<ll>> p(4,vector<ll>(4));\\n\\t\\trep(i,0,4) rep(j,0,4) rep(k,0,4){\\n\\t\\t\\tp[i][k]=(p[i][k]+l[i][j]*r[j][k])%mod;\\n\\t\\t}\\n\\t\\treturn p;\\n\\t};\\n\\tauto pow_f=[&](vector<vector<ll>> l,int x)->vector<vector<ll>>{\\n\\t\\tauto p=e();\\n\\t\\twhile(x){\\n\\t\\t\\tif(x&1) p=f(p,l);\\n\\t\\t\\tx/=2;\\n\\t\\t\\tl=f(l,l);\\n\\t\\t}\\n\\t\\treturn p;\\n\\t};\\n\\tauto ans=e();\\n\\tint N;\\n\\tcin>>N;\\n\\trep(i,0,N+1){\\n\\t\\tint x;\\n\\t\\tstring S;\\n\\t\\tif(i==N) x=1,S='+';\\n\\t\\telse cin>>x>>S;\\n\\t\\tauto tmp=e();\\n\\t\\tauto val=e();\\n\\t\\tfor(auto c:S){\\n\\t\\t\\tif(c=='+'){\\n\\t\\t\\t\\tval={\\n\\t\\t\\t\\t\\t{1,0,0,0},\\n\\t\\t\\t\\t\\t{1,0,0,0},\\n\\t\\t\\t\\t\\t{0,0,0,0},\\n\\t\\t\\t\\t\\t{0,0,1,1}\\n\\t\\t\\t\\t};\\n\\t\\t\\t}else if(c=='-'){\\n\\t\\t\\t\\tval={\\n\\t\\t\\t\\t\\t{1,0,0,0},\\n\\t\\t\\t\\t\\t{1,0,0,0},\\n\\t\\t\\t\\t\\t{0,0,0,0},\\n\\t\\t\\t\\t\\t{0,0,-1,1}\\n\\t\\t\\t\\t};\\n\\t\\t\\t}else if(c=='*'){\\n\\t\\t\\t\\tval={\\n\\t\\t\\t\\t\\t{1,0,0,0},\\n\\t\\t\\t\\t\\t{0,0,1,0},\\n\\t\\t\\t\\t\\t{0,0,0,0},\\n\\t\\t\\t\\t\\t{0,0,0,1}\\n\\t\\t\\t\\t};\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tval={\\n\\t\\t\\t\\t\\t{1,0,0,0},\\n\\t\\t\\t\\t\\t{0,10,0,0},\\n\\t\\t\\t\\t\\t{0,c-'0',1,0},\\n\\t\\t\\t\\t\\t{0,0,0,1}\\n\\t\\t\\t\\t};\\n\\t\\t\\t}\\n\\t\\t\\ttmp=f(tmp,val);\\n\\t\\t}\\n\\t\\ttmp=pow_f(tmp,x);\\n\\t\\tans=f(ans,tmp);\\n\\t}\\n\\tcout<<(ans[2][0]+ans[3][0]+mod+mod)%mod<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.3772,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2789_6012592\",\n \"code_snippet\": \"//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n#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<unordered_set>\\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 = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\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 = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)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}\\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)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 2;\\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}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nstruct num {\\n\\tmodint val;\\n\\tmodint coef;\\n};\\n\\nstruct Data {\\n\\tvector<num> vn;\\n\\tvector<char> vc;\\n};\\n\\nnum merge(num a, num b) {\\n\\treturn { a.val * b.coef + b.val,a.coef * b.coef };\\n}\\n\\nmodint calc(vector<num> vn, vector<char> vc) {\\n\\tmodint res = 0;\\n\\tmodint cur = vn[0].val;\\n\\trep(i, vc.size()) {\\n\\t\\tif (vc[i] == '*') {\\n\\t\\t\\tcur*= vn[i + 1].val;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tres += cur;\\n\\t\\t\\tcur = vn[i + 1].val;\\n\\t\\t\\tif (vc[i] == '-')cur *= -1;\\n\\t\\t}\\n\\t}\\n\\tres += cur;\\n\\treturn res;\\n}\\nData merge(Data a, Data b) {\\n\\tvector<num> vn;\\n\\tvector<char> vc;\\n\\trep(i, a.vn.size())vn.push_back(a.vn[i]);\\n\\tvn.back() = merge(vn.back(), b.vn[0]);\\n\\tfor (int i = 1; i < b.vn.size(); i++)vn.push_back(b.vn[i]);\\n\\trep(i, a.vc.size())vc.push_back(a.vc[i]);\\n\\trep(i, b.vc.size())vc.push_back(b.vc[i]);\\n\\tint cnt = 0;\\n\\trep(i, vc.size()) {\\n\\t\\tif (vc[i] == '+' || vc[i] == '-')cnt++;\\n\\t}\\n\\tif (cnt == 0) {\\n\\t\\tif (vc.size() >= 3) {\\n\\t\\t\\tvector<num> nvn;\\n\\t\\t\\tvector<char> nvc;\\n\\t\\t\\tnvc = { '*','*' };\\n\\t\\t\\tnvn.push_back(vn[0]);\\n\\t\\t\\tmodint pro = 1;\\n\\t\\t\\tfor (int i = 1; i < vn.size() - 1; i++) {\\n\\t\\t\\t\\tpro *= vn[i].val;\\n\\t\\t\\t}\\n\\t\\t\\tnvn.push_back({ pro,1 });\\n\\t\\t\\tnvn.push_back(vn.back());\\n\\t\\t\\tswap(vn, nvn);\\n\\t\\t\\tswap(vc, nvc);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\t//\\n\\t\\t}\\n\\t}\\n\\telse if (cnt == 1) {\\n\\t\\twhile (vc.size() >= 2 && vc[0]=='*'&&vc[1] == '*') {\\n\\t\\t\\tmodint pro = vn[1].val * vn[2].val;\\n\\t\\t\\tvn.erase(vn.begin() + 2);\\n\\t\\t\\tvn[1] = { pro,1 };\\n\\t\\t\\tvc.erase(vc.begin() + 1);\\n\\t\\t}\\n\\t\\twhile (vc.size() >= 2 && vc[vc.size() - 2] == '*' && vc[vc.size() - 1] == '*') {\\n\\t\\t\\tmodint pro = vn[vn.size() - 3].val * vn[vn.size() - 2].val;\\n\\t\\t\\tvn[vn.size() - 2] = { pro,1 };\\n\\t\\t\\tvn.erase(vn.begin() + (vn.size() - 3));\\n\\t\\t\\tvc.erase(vc.begin() + (vc.size() - 2));\\n\\t\\t}\\n\\t\\t/*rep(i, vc.size())if (vc[i] != '*') {\\n\\t\\t\\tif (i >= 2) {\\n\\t\\t\\t\\tmodint pro = 1;\\n\\t\\t\\t\\tfor (int j = 1; j <= i; j++) {\\n\\t\\t\\t\\t\\tpro *= vn[j].val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tvn[1] = { pro,1 };\\n\\t\\t\\t\\tvn.erase(vn.begin() + 2, vn.begin() + i + 1);\\n\\t\\t\\t\\tvc.erase(vc.begin() + 2, vc.begin() + i);\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}*/\\n\\t\\t/*per(i, vc.size())if (vc[i] != '*') {\\n\\t\\t\\tif (vc.size() - i >= 3) {\\n\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}*/\\n\\t}\\n\\telse {\\n\\t\\twhile (vc.size() >= 2 && vc[0] == '*' && vc[1] == '*') {\\n\\t\\t\\tmodint pro = vn[1].val * vn[2].val;\\n\\t\\t\\tvn.erase(vn.begin() + 2);\\n\\t\\t\\tvn[1] = { pro,1 };\\n\\t\\t\\tvc.erase(vc.begin() + 1);\\n\\t\\t}\\n\\t\\twhile (vc.size() >= 2 && vc[vc.size() - 2] == '*' && vc[vc.size() - 1] == '*') {\\n\\t\\t\\tmodint pro = vn[vn.size() - 3].val * vn[vn.size() - 2].val;\\n\\t\\t\\tvn[vn.size() - 2] = { pro,1 };\\n\\t\\t\\tvn.erase(vn.begin() + (vn.size() - 3));\\n\\t\\t\\tvc.erase(vc.begin() + (vc.size() - 2));\\n\\t\\t}\\n\\t\\tint cl, cr;\\n\\t\\trep(i, vc.size())if (vc[i] != '*') {\\n\\t\\t\\tcl = i; break;\\n\\t\\t}\\n\\t\\tper(i, vc.size())if (vc[i] != '*') {\\n\\t\\t\\tcr = i; break;\\n\\t\\t}\\n\\t\\t//vn...[cl+1,cr]\\n\\t\\t//vc...[cl+1,cr-1]\\n\\t\\tif (vc[cl] == '-') {\\n\\t\\t\\tvc[cl] = '+';\\n\\t\\t\\tvn[cl + 1].val *= -1;\\n\\t\\t}\\n\\t\\tvector<num> subn;\\n\\t\\tvector<char> subc;\\n\\t\\tRep1(j, cl + 1, cr)subn.push_back(vn[j]);\\n\\t\\tRep1(j, cl + 1, cr - 1) subc.push_back(vc[j]);\\n\\t\\tmodint val = calc(subn,subc);\\n\\t\\tvn.erase(vn.begin() + cl + 1, vn.begin()+cr+1);\\n\\t\\tvn.insert(vn.begin() + cl + 1, { val,1 });\\n\\t\\tvc.erase(vc.begin() + cl + 1, vc.begin() + cr);\\n\\t}\\n\\treturn { vn,vc };\\n}\\n\\nData trans(char c) {\\n\\tvector<num> vn;\\n\\tvector<char> vc;\\n\\tif (c == '*'||c=='+'||c=='-') {\\n\\t\\tvn.push_back({ 0,1 });\\n\\t\\tvn.push_back({ 0,1 });\\n\\t\\tvc.push_back(c);\\n\\t}\\n\\telse {\\n\\t\\tvn.push_back({ c - '0',10 });\\n\\t}\\n\\treturn { vn,vc };\\n}\\nvoid solve() {\\n\\tint n; cin >> n;\\n\\tData e;\\n\\te.vn.push_back({ 0,1 });\\n\\tData cur = e;\\n\\trep(i, n) {\\n\\t\\tint r; cin >> r;\\n\\t\\tstring s; cin >> s;\\n\\t\\tData nw = e;\\n\\t\\tfor (char c : s) {\\n\\t\\t\\tData nex = trans(c);\\n\\t\\t\\tnw = merge(nw, nex);\\n\\t\\t}\\n\\t\\tData x = e;\\n\\t\\trep(t, 30) {\\n\\t\\t\\tif (r & (1 << t))x = merge(x, nw);\\n\\t\\t\\tnw = merge(nw, nw);\\n\\t\\t}\\n\\t\\tcur = merge(cur, x);\\n\\t}\\n\\tmodint ans = calc(cur.vn,cur.vc);\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(8);\\n\\t//init_f();\\n\\t//init();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.3343,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2789_5177701\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define LL long long\\n#define PII pair<int,int>\\n#define _for(i,j,k) for(int i=j;i<=k;i++)\\n#define for_(i,j,k) for(int i=j;i>=k;i--)\\n#define lowbit(x) (x&-x)\\n#define ls(x) x<<1\\n#define rs(x) x<<1|1\\n#define inf 0x3f3f3f3f\\n#define localtest freopen(\\\"E:/ACM/2020/input.txt\\\",\\\"r\\\",stdin);\\nconst int maxn = 1e4 + 5;\\nconst LL mod = 1e9 + 7;\\nint n;\\nmap<char, LL> pmap;\\nLL mp(LL x,LL y){\\n x %= mod;\\n LL ret = 1ll;\\n for (; y;y>>=1,x=(LL)x*x%mod)\\n if(y&1)\\n ret = (LL)ret * x % mod;\\n return ret % mod;\\n}\\nLL inv(LL x){\\n return mp(x, mod - 2);\\n}\\nstring num2str(LL num){\\n string s=\\\"\\\";\\n while(num){\\n s += (num % 10 + '0');\\n num /= 10;\\n }\\n reverse(s.begin(),s.end());\\n return s;\\n}\\nLL str2num(string& s){\\n LL num = 0;\\n int len = s.length();\\n for (int i = 0; i < len;i++){\\n num = 10ll * num % mod + (s[i] - '0');\\n num %= mod;\\n }\\n return num;\\n}\\nLL pro(string& s,bool fg){\\n vector<LL> v;\\n v.clear();\\n //if(s.length()<=0)\\n // return 0;\\n v.push_back(s[0] - '0');\\n int len = s.length(), p = 0;\\n for (int i = 1; i < len;i++){\\n if(isdigit(s[i])){\\n if(v[p]>=0){\\n v[p] = 10ll * v[p] % mod + (s[i] - '0');\\n v[p] %= mod;\\n }\\n else{\\n ++p;\\n v.push_back(s[i] - '0');\\n }\\n }\\n else{\\n ++p;\\n v.push_back(pmap[s[i]]);\\n }\\n }\\n if(fg)\\n v[0] = (LL)(mod - v[0]) % mod;\\n vector<LL> u;\\n u.push_back(v[0]);\\n int cnt = 0;\\n for (int i = 1; i <= p;i++){\\n if(u[cnt]==-1){\\n u.pop_back();\\n cnt--;\\n LL tmp = u[cnt];\\n u.pop_back();\\n cnt--;\\n tmp = (LL)tmp * v[i] % mod;\\n u.push_back(tmp);\\n cnt++;\\n }\\n else{\\n u.push_back(v[i]);\\n cnt++;\\n }\\n }\\n LL f = 1;\\n LL ret = u[0];\\n for (int i = 1; i <= cnt;i+=2){\\n if(u[i]==-2){\\n ret = (LL)(ret + f*u[i + 1]) % mod;\\n ret = (LL)(ret + mod) % mod;\\n }\\n else{\\n ret = (LL)(ret - f*u[i + 1]) % mod;\\n ret = (LL)(ret + mod) % mod;\\n }\\n }\\n return ret;\\n}\\nint main(){\\n //localtest\\n ios::sync_with_stdio(false);\\n cin.tie(0);cout.tie(0);\\n pmap['*'] = -1;\\n pmap['+'] = -2;\\n pmap['-'] = -3;\\n cin >> n;\\n string str=\\\"\\\", s;\\n LL r = 0;\\n _for(i,1,n){\\n cin >> r >> s;\\n if(r==1){\\n str += s;\\n }\\n else{\\n //_for(j, 1, r) str += s;\\n int len = s.length(),pos=-1;\\n _for(j,0,len-1){\\n if(s[j]=='+'){\\n pos = j;\\n break;\\n }\\n }\\n if(pos!=-1){\\n string ss = \\\"\\\";\\n _for(j,pos+1,len-1){\\n ss += s[j];\\n }\\n _for(j,0,pos-1){\\n ss += s[j];\\n }\\n LL tmp = pro(ss,0);\\n tmp = (LL)(r - 1) % mod * tmp % mod;\\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\\n _for(j,0,pos){\\n str += s[j];\\n }\\n str += num2str(tmp);\\n _for(j,pos,len-1){\\n str += s[j];\\n }\\n }\\n else{\\n _for(j,0,len-1){\\n if(s[j]=='-'){\\n pos = j;\\n break;\\n }\\n }\\n if(pos!=-1){\\n string ss = \\\"\\\";\\n _for(j,pos+1,len-1){\\n ss += s[j];\\n }\\n _for(j,0,pos-1){\\n ss += s[j];\\n }\\n LL tmp = pro(ss,1);\\n tmp = (LL)(r - 1) % mod * tmp % mod;\\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\\n _for(j,0,pos-1){\\n str += s[j];\\n }\\n str += '+';\\n str += num2str(tmp);\\n _for(j,pos,len-1){\\n str += s[j];\\n }\\n }\\n else{\\n _for(j,0,len-1){\\n if(s[j]=='*'){\\n pos = j;\\n break;\\n }\\n }\\n if(pos!=-1){\\n string ss = \\\"\\\";\\n _for(j,pos+1,len-1){\\n ss += s[j];\\n }\\n _for(j,0,pos-1){\\n ss += s[j];\\n }\\n LL tmp = pro(ss,0);\\n tmp = mp(tmp, r - 1);\\n _for(j,0,pos){\\n str += s[j];\\n }\\n str += num2str(tmp);\\n _for(j,pos,len-1){\\n str += s[j];\\n }\\n }\\n else{\\n LL tmp = str2num(s);\\n tmp = (LL)(mp(10, (LL)len * r) - 1 + mod) % mod * tmp % mod;\\n tmp = (LL)tmp * inv((mp(10, len) - 1 + mod) % mod) % mod;\\n int l = str.length() - 1;\\n string tmps = \\\"\\\";\\n if(isdigit(str[l])){\\n while(isdigit(str[l])){\\n tmps += str[l];\\n str.erase(l);\\n l--;\\n }\\n reverse(tmps.begin(), tmps.end());\\n //cout << \\\"tmps:\\\" << tmps << \\\"\\\\n\\\";\\n //cout << \\\"tmp:\\\" << tmp << \\\"\\\\n\\\";\\n LL num = str2num(tmps);\\n //cout << \\\"num:\\\" << num << \\\"\\\\n\\\";\\n num = (LL)mp(10, (LL)len * r) * num % mod;\\n //cout << \\\"num:\\\" << num << \\\"\\\\n\\\";\\n num = (LL)(num + tmp) % mod;\\n str += num2str(num);\\n }\\n else{\\n str += num2str(tmp);\\n }\\n }\\n }\\n }\\n }\\n //cout << str << \\\"\\\\n\\\";\\n //cout << pro(str,0) << \\\"\\\\n\\\";\\n }\\n \\n cout << pro(str,0) << \\\"\\\\n\\\";\\n\\n return 0;\\n}\\n/*\\n5\\n900 5+3*11-3*3+55\\n1 45+45-33+100\\n44 04+40\\n9 9*9*9*10\\n8 01340\\n205143968\\n\\n4\\n999 100+\\n9999 010\\n99999 *100\\n999999 00200\\n389822449\\n*/\",\n \"accuracy\": 0.3877551020408163,\n \"time_ms\": 10,\n \"memory_kb\": 4384,\n \"score_of_the_acc\": -0.0631,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2789_5177680\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define LL long long\\n#define PII pair<int,int>\\n#define _for(i,j,k) for(int i=j;i<=k;i++)\\n#define for_(i,j,k) for(int i=j;i>=k;i--)\\n#define lowbit(x) (x&-x)\\n#define ls(x) x<<1\\n#define rs(x) x<<1|1\\n#define inf 0x3f3f3f3f\\n#define localtest freopen(\\\"E:/ACM/2020/input.txt\\\",\\\"r\\\",stdin);\\nconst int maxn = 1e4 + 5;\\nconst LL mod = 1e9 + 7;\\nint n;\\nmap<char, LL> pmap;\\nLL mp(LL x,LL y){\\n x %= mod;\\n LL ret = 1ll;\\n for (; y;y>>=1,x=(LL)x*x%mod)\\n if(y&1)\\n ret = (LL)ret * x % mod;\\n return ret % mod;\\n}\\nLL inv(LL x){\\n return mp(x, mod - 2);\\n}\\nstring num2str(LL num){\\n string s=\\\"\\\";\\n while(num){\\n s += (num % 10 + '0');\\n num /= 10;\\n }\\n reverse(s.begin(),s.end());\\n return s;\\n}\\nLL str2num(string& s){\\n LL num = 0;\\n int len = s.length();\\n for (int i = 0; i < len;i++){\\n num = 10ll * num % mod + (s[i] - '0');\\n num %= mod;\\n }\\n return num;\\n}\\nLL pro(string& s,bool fg){\\n vector<LL> v;\\n v.clear();\\n //if(s.length()<=0)\\n // return 0;\\n v.push_back(s[0] - '0');\\n int len = s.length(), p = 0;\\n for (int i = 1; i < len;i++){\\n if(isdigit(s[i])){\\n if(v[p]>=0){\\n v[p] = 10ll * v[p] % mod + (s[i] - '0');\\n v[p] %= mod;\\n }\\n else{\\n ++p;\\n v.push_back(s[i] - '0');\\n }\\n }\\n else{\\n ++p;\\n v.push_back(pmap[s[i]]);\\n }\\n }\\n vector<LL> u;\\n u.push_back(v[0]);\\n int cnt = 0;\\n for (int i = 1; i <= p;i++){\\n if(u[cnt]==-1){\\n u.pop_back();\\n cnt--;\\n LL tmp = u[cnt];\\n u.pop_back();\\n cnt--;\\n tmp = (LL)tmp * v[i] % mod;\\n u.push_back(tmp);\\n cnt++;\\n }\\n else{\\n u.push_back(v[i]);\\n cnt++;\\n }\\n }\\n LL f = fg ? -1 : 1;\\n LL ret = u[0];\\n for (int i = 1; i <= cnt;i+=2){\\n if(u[i]==-2){\\n ret = (LL)(ret + f*u[i + 1]) % mod;\\n ret = (LL)(ret + mod) % mod;\\n }\\n else{\\n ret = (LL)(ret - f*u[i + 1]) % mod;\\n ret = (LL)(ret + mod) % mod;\\n }\\n }\\n return ret;\\n}\\nint main(){\\n //localtest\\n ios::sync_with_stdio(false);\\n cin.tie(0);cout.tie(0);\\n pmap['*'] = -1;\\n pmap['+'] = -2;\\n pmap['-'] = -3;\\n cin >> n;\\n string str=\\\"\\\", s;\\n LL r = 0;\\n _for(i,1,n){\\n cin >> r >> s;\\n if(r==1){\\n str += s;\\n }\\n else{\\n //_for(j, 1, r) str += s;\\n int len = s.length(),pos=-1;\\n _for(j,0,len-1){\\n if(s[j]=='+'){\\n pos = j;\\n break;\\n }\\n }\\n if(pos!=-1){\\n string ss = \\\"\\\";\\n _for(j,pos+1,len-1){\\n ss += s[j];\\n }\\n _for(j,0,pos-1){\\n ss += s[j];\\n }\\n LL tmp = pro(ss,0);\\n tmp = (LL)(r - 1) % mod * tmp % mod;\\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\\n _for(j,0,pos){\\n str += s[j];\\n }\\n str += num2str(tmp);\\n _for(j,pos,len-1){\\n str += s[j];\\n }\\n }\\n else{\\n _for(j,0,len-1){\\n if(s[j]=='-'){\\n pos = j;\\n break;\\n }\\n }\\n if(pos!=-1){\\n string ss = \\\"\\\";\\n _for(j,pos+1,len-1){\\n ss += s[j];\\n }\\n _for(j,0,pos-1){\\n ss += s[j];\\n }\\n LL tmp = pro(ss,1);\\n tmp = (LL)(r - 1) % mod * tmp % mod;\\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\\n _for(j,0,pos){\\n str += s[j];\\n }\\n str += num2str(tmp);\\n _for(j,pos,len-1){\\n str += s[j];\\n }\\n }\\n else{\\n _for(j,0,len-1){\\n if(s[j]=='*'){\\n pos = j;\\n break;\\n }\\n }\\n if(pos!=-1){\\n string ss = \\\"\\\";\\n _for(j,pos+1,len-1){\\n ss += s[j];\\n }\\n _for(j,0,pos-1){\\n ss += s[j];\\n }\\n LL tmp = pro(ss,0);\\n tmp = mp(tmp, r - 1);\\n _for(j,0,pos){\\n str += s[j];\\n }\\n str += num2str(tmp);\\n _for(j,pos,len-1){\\n str += s[j];\\n }\\n }\\n else{\\n LL tmp = str2num(s);\\n tmp = (LL)(mp(10, (LL)len * r) - 1 + mod) % mod * tmp % mod;\\n tmp = (LL)tmp * inv((mp(10, len) - 1 + mod) % mod) % mod;\\n int l = str.length() - 1;\\n string tmps = \\\"\\\";\\n if(isdigit(str[l])){\\n while(isdigit(str[l])){\\n tmps += str[l];\\n str.erase(l);\\n l--;\\n }\\n reverse(tmps.begin(), tmps.end());\\n //cout << \\\"tmps:\\\" << tmps << \\\"\\\\n\\\";\\n //cout << \\\"tmp:\\\" << tmp << \\\"\\\\n\\\";\\n LL num = str2num(tmps);\\n //cout << \\\"num:\\\" << num << \\\"\\\\n\\\";\\n num = (LL)mp(10, (LL)len * r) * num % mod;\\n //cout << \\\"num:\\\" << num << \\\"\\\\n\\\";\\n num = (LL)(num + tmp) % mod;\\n str += num2str(num);\\n }\\n else{\\n str += num2str(tmp);\\n }\\n }\\n }\\n }\\n }\\n //cout << str << \\\"\\\\n\\\";\\n //cout << pro(str,0) << \\\"\\\\n\\\";\\n }\\n \\n cout << pro(str,0) << \\\"\\\\n\\\";\\n\\n return 0;\\n}\\n/*\\n5\\n900 5+3*11-3*3+55\\n1 45+45-33+100\\n44 04+40\\n9 9*9*9*10\\n8 01340\\n205143968\\n\\n4\\n999 100+\\n9999 010\\n99999 *100\\n999999 00200\\n389822449\\n*/\",\n \"accuracy\": 0.3877551020408163,\n \"time_ms\": 10,\n \"memory_kb\": 4564,\n \"score_of_the_acc\": -0.0727,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2789_5177512\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define LL long long\\n#define PII pair<int,int>\\n#define _for(i,j,k) for(int i=j;i<=k;i++)\\n#define for_(i,j,k) for(int i=j;i>=k;i--)\\n#define lowbit(x) (x&-x)\\n#define ls(x) x<<1\\n#define rs(x) x<<1|1\\n#define inf 0x3f3f3f3f\\nconst int maxn = 1e4 + 5;\\nconst LL mod = 1e9 + 7;\\nint n;\\nmap<char, LL> pmap;\\nLL mp(LL x,LL y){\\n x %= mod;\\n LL ret = 1ll;\\n for (; y;y>>=1,x=(LL)x*x%mod)\\n if(y&1)\\n ret = (LL)ret * x % mod;\\n return ret % mod;\\n}\\nLL inv(LL x){\\n return mp(x, mod - 2);\\n}\\nstring num2str(LL num){\\n string s=\\\"\\\";\\n while(num){\\n s += (num % 10 + '0');\\n num /= 10;\\n }\\n reverse(s.begin(),s.end());\\n return s;\\n}\\nLL str2num(string& s){\\n LL num = 0;\\n int len = s.length();\\n for (int i = 0; i < len;i++){\\n num = 10ll * num % mod + (s[i] - '0');\\n num %= mod;\\n }\\n return num;\\n}\\nLL pro(string& s,bool fg){\\n vector<LL> v;\\n v.clear();\\n //if(s.length()<=0)\\n // return 0;\\n v.push_back(s[0] - '0');\\n int len = s.length(), p = 0;\\n for (int i = 1; i < len;i++){\\n if(isdigit(s[i])){\\n if(v[p]>=0){\\n v[p] = 10ll * v[p] % mod + (s[i] - '0');\\n v[p] %= mod;\\n }\\n else{\\n ++p;\\n v.push_back(s[i] - '0');\\n }\\n }\\n else{\\n ++p;\\n v.push_back(pmap[s[i]]);\\n }\\n }\\n vector<LL> u;\\n u.push_back(v[0]);\\n int cnt = 0;\\n for (int i = 1; i <= p;i++){\\n if(u[cnt]==-1){\\n u.pop_back();\\n cnt--;\\n LL tmp = u[cnt];\\n u.pop_back();\\n cnt--;\\n tmp = (LL)tmp * v[i] % mod;\\n u.push_back(tmp);\\n cnt++;\\n }\\n else{\\n u.push_back(v[i]);\\n cnt++;\\n }\\n }\\n LL f = fg ? -1 : 1;\\n LL ret = u[0];\\n for (int i = 1; i <= cnt;i+=2){\\n if(u[i]==-2){\\n ret = (LL)(ret + f*u[i + 1]) % mod;\\n ret = (LL)(ret + mod) % mod;\\n }\\n else{\\n ret = (LL)(ret - f*u[i + 1]) % mod;\\n ret = (LL)(ret + mod) % mod;\\n }\\n }\\n return ret;\\n}\\nint main(){\\n //localtest\\n ios::sync_with_stdio(false);\\n cin.tie(0);cout.tie(0);\\n pmap['*'] = -1;\\n pmap['+'] = -2;\\n pmap['-'] = -3;\\n cin >> n;\\n string str=\\\"\\\", s;\\n LL r = 0;\\n _for(i,1,n){\\n cin >> r >> s;\\n if(r==1){\\n str += s;\\n }\\n else{\\n //_for(j, 1, r) str += s;\\n int len = s.length(),pos=-1;\\n _for(j,0,len-1){\\n if(s[j]=='+'||s[j]=='-'){\\n pos = j;\\n break;\\n }\\n }\\n if(pos!=-1){\\n string ss = \\\"\\\";\\n _for(j,pos+1,len-1){\\n ss += s[j];\\n }\\n _for(j,0,pos-1){\\n ss += s[j];\\n }\\n LL tmp = pro(ss,s[pos]=='-');\\n tmp = (LL)(r - 1) % mod * tmp % mod;\\n //if(s[pos]=='-') tmp = (LL)(mod - tmp) % mod;\\n _for(j,0,pos){\\n str += s[j];\\n }\\n str += num2str(tmp);\\n _for(j,pos,len-1){\\n str += s[j];\\n }\\n }\\n else{\\n _for(j,0,len-1){\\n if(s[j]=='*'){\\n pos = j;\\n break;\\n }\\n }\\n if(pos!=-1){\\n string ss = \\\"\\\";\\n _for(j,pos+1,len-1){\\n ss += s[j];\\n }\\n _for(j,0,pos-1){\\n ss += s[j];\\n }\\n LL tmp = pro(ss,0);\\n tmp = mp(tmp, r - 1);\\n _for(j,0,pos){\\n str += s[j];\\n }\\n str += num2str(tmp);\\n _for(j,pos,len-1){\\n str += s[j];\\n }\\n }\\n else{\\n LL tmp = str2num(s);\\n tmp = (LL)(mp(10, (LL)len * r) - 1 + mod) % mod * tmp % mod;\\n tmp = (LL)tmp * inv((mp(10, len) - 1 + mod) % mod) % mod;\\n int l = str.length() - 1;\\n string tmps = \\\"\\\";\\n if(isdigit(str[l])){\\n while(isdigit(str[l])){\\n tmps += str[l];\\n str.erase(l);\\n l--;\\n }\\n reverse(tmps.begin(), tmps.end());\\n //cout << \\\"tmps:\\\" << tmps << \\\"\\\\n\\\";\\n //cout << \\\"tmp:\\\" << tmp << \\\"\\\\n\\\";\\n LL num = str2num(tmps);\\n //cout << \\\"num:\\\" << num << \\\"\\\\n\\\";\\n num = (LL)mp(10, (LL)len * r) * num % mod;\\n //cout << \\\"num:\\\" << num << \\\"\\\\n\\\";\\n num = (LL)(num + tmp) % mod;\\n str += num2str(num);\\n }\\n else{\\n str += num2str(tmp);\\n }\\n }\\n }\\n }\\n //cout << str << \\\"\\\\n\\\";\\n //cout << pro(str,0) << \\\"\\\\n\\\";\\n }\\n \\n cout << pro(str,0) << \\\"\\\\n\\\";\\n\\n return 0;\\n}\\n/*\\n5\\n900 5+3*11-3*3+55\\n1 45+45-33+100\\n44 04+40\\n9 9*9*9*10\\n8 01340\\n205143968\\n\\n4\\n999 100+\\n9999 010\\n99999 *100\\n999999 00200\\n389822449\\n*/\",\n \"accuracy\": 0.3877551020408163,\n \"time_ms\": 10,\n \"memory_kb\": 4396,\n \"score_of_the_acc\": -0.0637,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2789_3661571\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\nint N;\\nchar buf[11];\\n\\ntypedef vector<ll> V;\\ntypedef vector<V> MATRIX;\\n\\nint SIZE = 2;\\nll MOD_POW[11];\\n\\n\\nll mod_pow(ll x,ll n, ll mod){\\n\\n\\tif(n == 0)return 1;\\n\\tll ret = mod_pow(x*x%mod,n/2,mod);\\n\\tif(n%2 == 1)ret = ret*x%mod;\\n\\treturn ret;\\n}\\n\\n\\nMATRIX calc(MATRIX left,MATRIX right){\\n\\n\\tMATRIX ret(SIZE,V(SIZE));\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\t\\tfor(int k = 0; k < SIZE; k++)ret[i][k] = 0;\\n\\t}\\n\\n\\tfor(int row = 0; row < SIZE; row++){\\n\\t\\tfor(int col = 0; col < SIZE; col++){\\n\\t\\t\\tfor(int a = 0; a < SIZE; a++){\\n\\t\\t\\t\\tret[row][col] += left[row][a]*right[a][col]%MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n\\n}\\n\\n//MULTのT乗を計算する\\nMATRIX POW(MATRIX MULT,int count){\\n\\n\\tMATRIX ret(SIZE,V(SIZE));\\n\\n\\tfor(int row = 0; row < SIZE; row++){\\n\\t\\tfor(int col = 0; col < SIZE; col++){\\n\\t\\t\\tif(row == col)ret[row][col] = 1;\\n\\t\\t\\telse{\\n\\t\\t\\t\\tret[row][col] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\twhile(count > 0){\\n\\t\\tif(count%2 == 1)ret = calc(ret,MULT);\\n\\t\\tMULT = calc(MULT,MULT);\\n\\t\\tcount /= 2;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nint main(){\\n\\n\\tMOD_POW[0] = 1;\\n\\n\\tfor(int i = 1; i <= 10; i++){\\n\\n\\t\\tMOD_POW[i] = (MOD_POW[i-1]*10)%MOD;\\n\\t}\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tqueue<ll> NUM,MULT;\\n\\tqueue<char> OP;\\n\\n\\tNUM.push(0);\\n\\tOP.push('+');\\n\\n\\tint rep_num;\\n\\tll last_num = 0,length;\\n\\tbool is_last_num = false;\\n\\tchar last_op = '+';\\n\\n\\tbool is_op,is_plus_minus;\\n\\n\\tfor(int loop = 0; loop < N; loop++){\\n\\n\\t\\tscanf(\\\"%d %s\\\",&rep_num,buf);\\n\\n\\t\\tis_op = false;\\n\\t\\tis_plus_minus = false;\\n\\n\\t\\tfor(length = 0; buf[length] != '\\\\0'; length++){\\n\\n\\t\\t\\tswitch(buf[length]){\\n\\t\\t\\tcase '+':\\n\\t\\t\\tcase '-':\\n\\t\\t\\t\\tis_op = true;\\n\\t\\t\\t\\tis_plus_minus = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '*':\\n\\t\\t\\t\\tis_op = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tdefault: //数字\\n\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(!is_op){ //数字のみの場合\\n\\n\\t\\t\\tll num = 0;\\n\\n\\t\\t\\tfor(int i = 0; i < length; i++){\\n\\n\\t\\t\\t\\tnum = 10*num+(buf[i]-'0');\\n\\t\\t\\t\\tnum %= MOD;\\n\\t\\t\\t}\\n\\n\\t\\t\\tMATRIX first(2,V(1));\\n\\n\\t\\t\\tif(is_last_num){ //文字列の最後が数字の場合\\n\\n\\t\\t\\t\\tfirst[0][0] = last_num;\\n\\n\\t\\t\\t}else{ //文字列の最後が演算子の場合\\n\\n\\t\\t\\t\\tfirst[0][0] = 0;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfirst[0][1] = 1;\\n\\n\\t\\t\\tMATRIX A(SIZE,V(SIZE));\\n\\t\\t\\tA[0][0] = MOD_POW[length];\\n\\t\\t\\tA[0][1] = num;\\n\\n\\t\\t\\tA[1][0] = 0;\\n\\t\\t\\tA[1][1] = 1;\\n\\n\\t\\t\\tA = POW(A,rep_num);\\n\\n\\t\\t\\tlast_num = (A[0][0]*first[0][0]+A[0][1])%MOD;\\n\\n\\t\\t\\tis_last_num = true;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tif(!is_plus_minus){ //*のみの場合\\n\\n\\t\\t\\t\\tint first_loc;\\n\\n\\t\\t\\t\\tfor(int i = 0; i < length; i++){\\n\\n\\t\\t\\t\\t\\tif(buf[i] == '*'){\\n\\n\\t\\t\\t\\t\\t\\tfirst_loc = i;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tll L;\\n\\n\\t\\t\\t\\tif(first_loc > 0){ //最初の*の左の数字\\n\\n\\t\\t\\t\\t\\tll tmp = 0;\\n\\t\\t\\t\\t\\tfor(int i = 0; i < first_loc; i++){\\n\\n\\t\\t\\t\\t\\t\\ttmp = 10*tmp + (buf[i]-'0');\\n\\t\\t\\t\\t\\t\\ttmp %= MOD;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(is_last_num){\\n\\n\\t\\t\\t\\t\\t\\ttmp = last_num*MOD_POW[first_loc]+tmp; //左にシフトさせて足す\\n\\t\\t\\t\\t\\t\\ttmp %= MOD;\\n\\n\\t\\t\\t\\t\\t\\tL = tmp;\\n\\n\\t\\t\\t\\t\\t}else{ //前の文字列の最後が演算子\\n\\n\\t\\t\\t\\t\\t\\tif(last_op == '*'){ //数字確定\\n\\n\\t\\t\\t\\t\\t\\t\\tMULT.push(tmp);\\n\\t\\t\\t\\t\\t\\t\\tL = 1;\\n\\n\\t\\t\\t\\t\\t\\t}else{ //★注意★\\n\\n\\t\\t\\t\\t\\t\\t\\tL = tmp;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}else{ //first_loc == 0\\n\\n\\t\\t\\t\\t\\tL = last_num; //必ずis_last_num == trueであるはず\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tll tmp = 0;\\n\\t\\t\\t\\tstack<ll> tmp_MULT;\\n\\n\\t\\t\\t\\tif(rep_num == 1){\\n\\n\\t\\t\\t\\t\\tMULT.push(L);\\n\\n\\t\\t\\t\\t\\tll work = 0;\\n\\n\\t\\t\\t\\t\\tint last_loc;\\n\\t\\t\\t\\t\\tfor(int i = length-1; i >= 0; i--){\\n\\t\\t\\t\\t\\t\\tif(buf[i] == '*'){\\n\\t\\t\\t\\t\\t\\t\\tlast_loc = i;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tfor(int i = first_loc+1; i < last_loc; i++){\\n\\n\\t\\t\\t\\t\\t\\tif(buf[i] == '*'){\\n\\t\\t\\t\\t\\t\\t\\tMULT.push(work);\\n\\t\\t\\t\\t\\t\\t\\twork = 0;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\twork = 10*work+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\n\\t\\t\\t\\t\\t\\t\\tif(i+1 == last_loc){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tMULT.push(work);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tlast_num = 0;\\n\\t\\t\\t\\t\\tfor(int i = last_loc+1; i < length; i++){\\n\\n\\t\\t\\t\\t\\t\\tlast_num = 10*last_num+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\tlast_num %= MOD;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(last_loc == length-1){\\n\\n\\t\\t\\t\\t\\t\\tis_last_num = false;\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tis_last_num = true;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tlast_op = '*';\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tfor(int i = first_loc+1; i < length; i++){\\n\\n\\t\\t\\t\\t\\tif(buf[i] == '*'){\\n\\n\\t\\t\\t\\t\\t\\ttmp_MULT.push(tmp);\\n\\t\\t\\t\\t\\t\\ttmp = 0;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\ttmp = 10*tmp+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\ttmp %= MOD;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tfor(int i = 0; i < first_loc; i++){\\n\\n\\t\\t\\t\\t\\ttmp = 10*tmp+(buf[i]-'0');\\n\\t\\t\\t\\t\\ttmp %= MOD;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttmp_MULT.push(tmp);\\n\\n\\t\\t\\t\\tll A = 1;\\n\\n\\t\\t\\t\\twhile(!tmp_MULT.empty()){\\n\\n\\t\\t\\t\\t\\tA *= tmp_MULT.top();\\n\\t\\t\\t\\t\\tA %= MOD;\\n\\t\\t\\t\\t\\ttmp_MULT.pop();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(rep_num > 1){\\n\\n\\t\\t\\t\\t\\tA = mod_pow(A,rep_num-1,MOD);\\n\\t\\t\\t\\t\\tA *= L;\\n\\t\\t\\t\\t\\tA %= MOD;\\n\\t\\t\\t\\t\\tMULT.push(A); //最後のopは'*'なので\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//★first_loc+1からlengthまでに*があるか調べる\\n\\t\\t\\t\\tint last_loc;\\n\\t\\t\\t\\tfor(int i = length-1; i >= 0; i--){\\n\\t\\t\\t\\t\\tif(buf[i] == '*'){\\n\\n\\t\\t\\t\\t\\t\\tlast_loc = i;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(last_loc == first_loc){\\n\\n\\t\\t\\t\\t\\tif(buf[length-1] == '*'){ //first_loc==last_loc == length-1\\n\\n\\t\\t\\t\\t\\t\\tlast_num = A;\\n\\t\\t\\t\\t\\t\\tis_last_num = false;\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tlast_num = 0;\\n\\t\\t\\t\\t\\t\\tfor(int i = last_loc+1; i < length; i++){\\n\\n\\t\\t\\t\\t\\t\\t\\tlast_num = 10*last_num+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\t\\tlast_num %= MOD;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tis_last_num = true;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}else{ //last_loc != first_loc\\n\\n\\t\\t\\t\\t\\tll work = 0;\\n\\t\\t\\t\\t\\tstack<ll> work_num;\\n\\n\\t\\t\\t\\t\\tfor(int i = first_loc+1; i < last_loc; i++){\\n\\n\\t\\t\\t\\t\\t\\tif(buf[i] == '*'){\\n\\n\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t\\twork = 0;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\twork = 10*work+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\t\\t\\t\\t\\t\\t\\tif(i+1 == last_loc){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tll D = work_num.top();\\n\\t\\t\\t\\t\\twork_num.pop();\\n\\n\\t\\t\\t\\t\\twhile(!work_num.empty()){\\n\\n\\t\\t\\t\\t\\t\\tD *= work_num.top();\\n\\t\\t\\t\\t\\t\\tD %= MOD;\\n\\t\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tMULT.push(D);\\n\\n\\t\\t\\t\\t\\tlast_num = 0;\\n\\n\\t\\t\\t\\t\\tfor(int i = last_loc+1; i < length; i++){\\n\\n\\t\\t\\t\\t\\t\\tlast_num = 10*last_num+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\tlast_num %= MOD;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif('0' <= buf[length-1] && '9' >= buf[length-1]){\\n\\n\\t\\t\\t\\t\\t\\tis_last_num = true;\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tis_last_num = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tlast_op = '*';\\n\\n\\t\\t\\t}else{ //+か-が出現する場合\\n\\n\\t\\t\\t\\tint first_loc;\\n\\n\\t\\t\\t\\tfor(int i = 0; i < length; i++){\\n\\n\\t\\t\\t\\t\\tif(buf[i] == '+' || buf[i] == '-'){\\n\\n\\t\\t\\t\\t\\t\\tfirst_loc = i;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//★★*が混ざっている可能性あり★★\\n\\t\\t\\t\\tll L,work = 0;\\n\\t\\t\\t\\tstack<ll> work_num;\\n\\n\\t\\t\\t\\tfor(int i = 0; i < first_loc; i++){\\n\\n\\t\\t\\t\\t\\tif(buf[i] == '*'){\\n\\n\\t\\t\\t\\t\\t\\tif(work_num.empty()){ //初めての'*'\\n\\n\\t\\t\\t\\t\\t\\t\\tif(is_last_num){ //数字が前から続いている場合\\n\\n\\t\\t\\t\\t\\t\\t\\t\\twork = last_num*MOD_POW[i]+work;\\n\\t\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\t\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{ //前の文字列が演算子で終了している場合\\n\\n\\t\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t}else{ //2つめ以降の'*';\\n\\n\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\twork = 0;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t//first_locの左は必ず数字であるはず\\n\\t\\t\\t\\t\\t\\twork = 10*work+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\n\\t\\t\\t\\t\\t\\tif(i+1 == first_loc){\\n\\n\\t\\t\\t\\t\\t\\t\\tif(work_num.empty()){ //★★\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(is_last_num){ //数字が前から続いている場合\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork = last_num*MOD_POW[i+1]+work;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\twhile(!work_num.empty()){\\n\\n\\t\\t\\t\\t\\twork *= work_num.top();\\n\\t\\t\\t\\t\\twork %= MOD;\\n\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(first_loc == 0){\\n\\n\\t\\t\\t\\t\\twork = last_num; //★★\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(last_op == '*'){ //数字を連結させる\\n\\n\\t\\t\\t\\t\\tMULT.push(work);\\n\\n\\t\\t\\t\\t\\tll tmp = 1;\\n\\n\\t\\t\\t\\t\\twhile(!MULT.empty()){\\n\\n\\t\\t\\t\\t\\t\\ttmp *= MULT.front();\\n\\t\\t\\t\\t\\t\\ttmp %= MOD;\\n\\t\\t\\t\\t\\t\\tMULT.pop();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tNUM.push(tmp);\\n\\n\\t\\t\\t\\t}else{ //プラスかマイナス\\n\\n\\t\\t\\t\\t\\tNUM.push(work);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(rep_num > 1){\\n\\n\\t\\t\\t\\t\\tOP.push('+'); //★★掛け算の準備★★\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tint last_loc;\\n\\t\\t\\t\\t\\tfor(int i = length-1; i >= 0; i--){\\n\\t\\t\\t\\t\\t\\tif(buf[i] == '+' || buf[i] == '-'){\\n\\t\\t\\t\\t\\t\\t\\tlast_loc = i;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(last_loc == first_loc){\\n\\n\\t\\t\\t\\t\\t\\tOP.push(buf[first_loc]);\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tOP.push('+'); //追いかけの数字は'-'を反映させる\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//first_loc間の計算値を求め、掛け算に持ち込む\\n\\n\\t\\t\\t\\tchar work_buf[11];\\n\\t\\t\\t\\tint work_index = 0;\\n\\n\\t\\t\\t\\tstack<char> work_op;\\n\\t\\t\\t\\tstack<ll> calc_num;\\n\\t\\t\\t\\tstack<char> calc_op;\\n\\n\\t\\t\\t\\tint last_loc;\\n\\n\\t\\t\\t\\tfor(int i = length-1; i >= 0; i--){\\n\\n\\t\\t\\t\\t\\tif(buf[i] == '+' || buf[i] == '-'){\\n\\t\\t\\t\\t\\t\\tlast_loc = i;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(rep_num > 1){\\n\\n\\t\\t\\t\\t\\tfor(int i = first_loc+1; i < length; i++){\\n\\n\\t\\t\\t\\t\\t\\twork_buf[work_index++] = buf[i];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tfor(int i = 0; i < first_loc; i++){\\n\\n\\t\\t\\t\\t\\t\\twork_buf[work_index++] = buf[i];\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\twork_num.push(0);\\n\\t\\t\\t\\t\\twork_op.push(buf[first_loc]);\\n\\n\\t\\t\\t\\t\\twork = 0;\\n\\n\\t\\t\\t\\t\\tfor(int i = 0; i < work_index; i++){\\n\\n\\t\\t\\t\\t\\t\\tif(work_buf[i] == '*' || work_buf[i] == '+' || work_buf[i] == '-'){\\n\\n\\t\\t\\t\\t\\t\\t\\tif(work_op.empty() == false && work_op.top() == '*'){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\twork *= work_num.top();\\n\\t\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\t\\t\\t\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t\\t\\t\\t\\twork_op.pop();\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t\\twork_op.push(work_buf[i]);\\n\\t\\t\\t\\t\\t\\t\\twork = 0;\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\twork = 10*work+(work_buf[i]-'0');\\n\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\n\\t\\t\\t\\t\\t\\t\\tif(i+1 == work_index){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(work_op.empty() == false && work_op.top() == '*'){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork *= work_num.top();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork_op.pop();\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//このままだと右結合になってしまうので左結合にする\\n\\n\\t\\t\\t\\t\\twhile(!work_num.empty()){\\n\\n\\t\\t\\t\\t\\t\\tcalc_num.push(work_num.top());\\n\\t\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\twhile(!work_op.empty()){\\n\\n\\t\\t\\t\\t\\t\\tcalc_op.push(work_op.top());\\n\\t\\t\\t\\t\\t\\twork_op.pop();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tll A = calc_num.top();\\n\\t\\t\\t\\t\\tcalc_num.pop();\\n\\n\\t\\t\\t\\t\\twhile(!calc_op.empty()){\\n\\t\\t\\t\\t\\t\\tif(calc_op.top() == '+'){\\n\\n\\t\\t\\t\\t\\t\\t\\tA += calc_num.top();\\n\\t\\t\\t\\t\\t\\t\\tA %= MOD;\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tA -= calc_num.top();\\n\\t\\t\\t\\t\\t\\t\\tif(A < 0)A += MOD;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcalc_op.pop();\\n\\t\\t\\t\\t\\t\\tcalc_num.pop();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tA *= rep_num-1;\\n\\t\\t\\t\\t\\tA %= MOD;\\n\\n\\t\\t\\t\\t\\tNUM.push(A);\\n\\n\\t\\t\\t\\t\\tif(last_loc != first_loc){\\n\\t\\t\\t\\t\\t\\tOP.push('+'); //★★注意→追いかけで突っ込む数字はマイナスを反映させる★★\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tOP.push(buf[first_loc]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(first_loc < last_loc){ //途中の数式を積む\\n\\n\\t\\t\\t\\t\\twork = 0;\\n\\n\\t\\t\\t\\t\\twork_num.push(0);\\n\\t\\t\\t\\t\\twork_op.push(buf[first_loc]);\\n\\n\\t\\t\\t\\t\\tif(buf[first_loc] == '-'){\\n\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tfor(int i = first_loc+1; i < last_loc; i++){\\n\\n\\t\\t\\t\\t\\t\\tif(buf[i] == '*' || buf[i] == '+' || buf[i] == '-'){\\n\\n\\t\\t\\t\\t\\t\\t\\tif(work_op.empty() == false && work_op.top() == '*'){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\twork *= work_num.top();\\n\\t\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\t\\t\\t\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t\\t\\t\\t\\twork_op.pop();\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t\\twork_op.push(buf[i]);\\n\\t\\t\\t\\t\\t\\t\\twork = 0;\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\twork = 10*work+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\n\\t\\t\\t\\t\\t\\t\\tif(i+1 == last_loc){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(work_op.empty() == false && work_op.top() == '*'){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork *= work_num.top();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork_op.pop();\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t//このままだと右結合になってしまうので左結合にする\\n\\t\\t\\t\\t\\twhile(!work_num.empty()){\\n\\n\\t\\t\\t\\t\\t\\tcalc_num.push(work_num.top());\\n\\t\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\twhile(!work_op.empty()){\\n\\n\\t\\t\\t\\t\\t\\tcalc_op.push(work_op.top());\\n\\t\\t\\t\\t\\t\\twork_op.pop();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tll A;\\n\\n\\t\\t\\t\\t\\tA = calc_num.top();\\n\\t\\t\\t\\t\\tcalc_num.pop();\\n\\n\\t\\t\\t\\t\\twhile(!calc_op.empty()){\\n\\t\\t\\t\\t\\t\\tif(calc_op.top() == '+'){\\n\\n\\t\\t\\t\\t\\t\\t\\tA += calc_num.top();\\n\\t\\t\\t\\t\\t\\t\\tA %= MOD;\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tA -= calc_num.top();\\n\\t\\t\\t\\t\\t\\t\\tif(A < 0)A += MOD;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcalc_op.pop();\\n\\t\\t\\t\\t\\t\\tcalc_num.pop();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tNUM.push(A);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(first_loc < last_loc){\\n\\n\\t\\t\\t\\t\\tOP.push(buf[last_loc]);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(last_loc == length-1){\\n\\n\\t\\t\\t\\t\\tlast_num = 0; //次の文字列と結合することはない\\n\\t\\t\\t\\t\\tis_last_num = false;\\n\\n\\t\\t\\t\\t}else{ //last_numを求める★★次に数字が連結する場合あり★★\\n\\n\\t\\t\\t\\t\\twork = 0;\\n\\n\\t\\t\\t\\t\\t//★★*が混ざっているか調べる★★\\n\\t\\t\\t\\t\\tint last_mult = -1;\\n\\t\\t\\t\\t\\tfor(int i = length -1; i > last_loc; i--){\\n\\n\\t\\t\\t\\t\\t\\tif(buf[i] == '*'){\\n\\n\\t\\t\\t\\t\\t\\t\\tlast_mult = i;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(last_mult == -1 || last_mult < last_loc){ //最後の±から末尾までに*がない\\n\\n\\t\\t\\t\\t\\t\\tlast_num = 0;\\n\\n\\t\\t\\t\\t\\t\\tfor(int i = last_loc+1; i < length; i++){\\n\\n\\t\\t\\t\\t\\t\\t\\tlast_num = 10*last_num+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\t\\tlast_num %= MOD;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(last_loc == length-1){\\n\\n\\t\\t\\t\\t\\t\\t\\tis_last_num = false;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tis_last_num = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else{ //last_loc+1～last_multまでをMULTに突っ込む\\n\\n\\t\\t\\t\\t\\t\\twork = 0;\\n\\t\\t\\t\\t\\t\\tlast_op = '*';\\n\\n\\t\\t\\t\\t\\t\\tfor(int i = last_loc+1; i < last_mult; i++){\\n\\n\\t\\t\\t\\t\\t\\t\\tif(buf[i] == '*'){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t\\t\\twork = 0;\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\t\\twork = 10*work+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\t\\t\\twork %= MOD;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(i+1 == last_mult){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tll tmp = 1;\\n\\n\\t\\t\\t\\t\\t\\twhile(!work_num.empty()){\\n\\n\\t\\t\\t\\t\\t\\t\\ttmp *= work_num.top();\\n\\t\\t\\t\\t\\t\\t\\ttmp %= MOD;\\n\\t\\t\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tMULT.push(tmp);\\n\\t\\t\\t\\t\\t\\tlast_num = 0;\\n\\n\\t\\t\\t\\t\\t\\tfor(int i = last_mult+1; i < length; i++){\\n\\n\\t\\t\\t\\t\\t\\t\\tlast_num = 10*last_num+(buf[i]-'0');\\n\\t\\t\\t\\t\\t\\t\\tlast_num %= MOD;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(last_mult == length-1){\\n\\n\\t\\t\\t\\t\\t\\t\\tis_last_num = false;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tis_last_num = true;\\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}\\n\\t}\\n\\n\\t//last_numが残っていたら処理\\n\\tif(last_op == '*'){\\n\\n\\t\\twhile(!MULT.empty()){\\n\\t\\t\\tlast_num *= MULT.front();\\n\\t\\t\\tlast_num %= MOD;\\n\\t\\t\\tMULT.pop();\\n\\t\\t}\\n\\t\\tNUM.push(last_num);\\n\\n\\t}else{\\n\\n\\t\\tNUM.push(last_num);\\n\\t}\\n\\n\\tll ans = NUM.front();\\n\\tNUM.pop();\\n\\n\\twhile(!OP.empty()){\\n\\n\\t\\tif(OP.front() == '+'){\\n\\n\\t\\t\\tans += NUM.front();\\n\\t\\t\\tans %= MOD;\\n\\t\\t\\tNUM.pop();\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tans -= NUM.front();\\n\\t\\t\\tif(ans < 0)ans += MOD;\\n\\t\\t\\tans %= MOD;\\n\\t\\t\\tNUM.pop();\\n\\t\\t}\\n\\t\\tOP.pop();\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0352,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2789_3191910\",\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_popcount\\n\\n#define INF 1e16\\n#define mod 1000000007LL\\n\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nmat operator*(const mat& a,const mat& b){\\n mat res(4,vec(4,0));\\n const ll modl=8*mod*mod;\\n rep(i,4){\\n rep(k,4){\\n rep(j,4){\\n res[i][j]+=a[i][k]*b[k][j];\\n if(res[i][j]>=modl)res[i][j]-=modl;\\n }\\n }\\n rep(j,4)res[i][j]%=mod;\\n }\\n return res;\\n}\\n\\nmat mpow(mat a,ll n){\\n mat res(4,vec(4,0));\\n rep(i,4)res[i][i]=1;\\n while(n>0){\\n if(n&1)res=res*a;\\n a=a*a;\\n n>>=1;\\n }\\n return res;\\n}\\n\\nll pls[4][4]={\\n {1, 0, 1, 0},\\n {0, 0, 0, 1},\\n {0, 0, 0, 0},\\n {0, 0, 0, 1},\\n};\\n\\nll mns[4][4]={\\n {1, 0, 1, 0},\\n {0, 0, 0, mod-1},\\n {0, 0, 0, 0},\\n {0, 0, 0, 1},\\n};\\n\\nll mul[4][4]={\\n {1, 0, 0, 0},\\n {0, 0, 1, 0},\\n {0, 0, 0, 0},\\n {0, 0, 0, 1},\\n};\\n\\nll num[4][4]={\\n {1, 0, 0, 0},\\n {0, 1, 0, 0},\\n {0, 0, 10, 0},\\n {0, 0, 0, 1},\\n};\\n\\nint N;\\n\\nint main(){\\n scanf(\\\"%d\\\",&N);\\n vector<int> ps(N);\\n vector<string> rs(N);\\n rep(i,N){\\n cin>>ps[i]>>rs[i];\\n }\\n ps.push_back(1); rs.push_back(\\\"+\\\"); N++;\\n mat crt(4,vec(4,0));\\n rep(i,4)crt[i][i]=1;\\n\\n rep(i,N){\\n mat m(4,vec(4,0));\\n rep(j,4)m[j][j]=1;\\n rep(j,rs[i].size()){\\n mat op(4,vec(4,0));\\n if(rs[i][j]=='+'){\\n rep(k,4)rep(l,4)op[k][l]=pls[k][l];\\n }\\n if(rs[i][j]=='-'){\\n rep(k,4)rep(l,4)op[k][l]=mns[k][l];\\n }\\n if(rs[i][j]=='*'){\\n rep(k,4)rep(l,4)op[k][l]=mul[k][l];\\n }\\n if(isdigit(rs[i][j])){\\n rep(k,4)rep(l,4)op[k][l]=num[k][l];\\n op[2][1]=rs[i][j]-'0';\\n }\\n m=op*m;\\n }\\n m=mpow(m,ps[i]);\\n crt=m*crt;\\n }\\n\\n cout<<(crt[0][1]+crt[0][3])%mod<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3952,\n \"score_of_the_acc\": -0.449,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2789_3185239\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define MOD 1000000007LL\\nusing namespace std;\\ntypedef long long ll;\\n\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nmat mul(mat &A,mat &B){\\n\\tmat C(A.size(),vec(B[0].size()));\\n\\tfor(int i=0;i<A.size();i++){\\n\\t\\tfor(int k=0;k<B.size();k++){\\n\\t\\t\\tfor(int j=0;j<B[0].size();j++){\\n\\t\\t\\t\\tC[i][j]=(C[i][j]+(A[i][k]*B[k][j]%MOD))%MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn C;\\n}\\n\\nmat pow(mat A,ll n){\\n\\tmat B(A.size(),vec(A.size()));\\n\\tfor(int i=0;i<A.size();i++){\\n\\t\\tB[i][i]=1;\\n\\t}\\n\\twhile(n>0){\\n\\t\\tif(n&1)B=mul(B,A);\\n\\t\\tA=mul(A,A);\\n\\t\\tn>>=1;\\n\\t}\\n\\treturn B;\\n}\\n\\nll matpow(ll x,ll n){\\n\\tll ret=1;\\n\\twhile(n>0){\\n\\t\\tif(n&1)ret=ret*x%MOD;\\n\\t\\tx=x*x%MOD;\\n\\t\\tn/=2LL;\\n\\t}\\n\\treturn ret;\\n}\\n\\nbool isnumber(string s){\\n\\tfor(int i=0;i<s.size();i++){\\n\\t\\tif(!isdigit(s[i]))return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nll getnum(string s){\\n\\tll res=0;\\n\\tfor(int i=0;i<s.size();i++){\\n\\t\\tres*=10LL;\\n\\t\\tres+=(s[i]-'0');\\n\\t\\tres%=MOD;\\n\\t}\\n\\treturn res;\\n}\\n\\ntypedef string::const_iterator State;\\nll number(State &begin){\\n\\tll ret=0;\\n\\twhile(isdigit(*begin)){\\n\\t\\tret*=10;\\n\\t\\tret+=(*begin-'0');\\n\\t\\tbegin++;\\n\\t}\\n\\tret%=MOD;\\n\\treturn ret;\\n}\\n\\nll term(State &begin){\\n\\tll ret=number(begin);\\n\\twhile(1){\\n\\t\\tif(*begin=='*'){\\n\\t\\t\\tbegin++;\\n\\t\\t\\tret*=number(begin);\\n\\t\\t\\tret%=MOD;\\n\\t\\t}else{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nll expression(State &begin){\\n\\tll ret=term(begin);\\n\\twhile(1){\\n\\t\\tif(*begin=='+'){\\n\\t\\t\\tbegin++;\\n\\t\\t\\tret+=term(begin);\\n\\t\\t\\tret%=MOD;\\n\\t\\t}else{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nll getval(string s,int f){\\n\\tstring ss=s.substr(f);\\n\\tif(f!=0)ss+=s.substr(0,f-1);\\n\\telse{\\n\\t\\tss=s.substr(0,s.size()-1);\\n\\t}\\n\\tState st=ss.begin();\\n\\treturn expression(st);\\n}\\n\\nstring replace_str(string s){\\n\\tstring res=\\\"\\\";\\n\\tfor(int i=0;i<s.size();i++){\\n\\t\\tif(s[i]=='-'){\\n\\t\\t\\tres+=\\\"+1000000006*\\\";\\n\\t\\t}else{\\n\\t\\t\\tres+=s[i];\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\nint n;\\nint r[10005];\\nll tp[15];\\n\\nint main(void){\\n\\tscanf(\\\"%d%*c\\\",&n);\\n\\ttp[0]=1;\\n\\tfor(int i=0;i<14;i++){\\n\\t\\ttp[i+1]=tp[i]*10LL%MOD;\\n\\t}\\n\\tll ans=0;\\n\\tll pv=1;\\n\\tll nowv=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tstring s;\\n\\t\\tcin >> r[i] >> s;\\n\\t\\tll val=0;\\n\\t\\tif(isnumber(s)){\\n\\t\\t\\tmat A(2,vec(2));\\n\\t\\t\\tA={{tp[s.size()],getnum(s)},{0,1}};\\n\\t\\t\\tA=pow(A,r[i]);\\n\\t\\t\\tnowv=((nowv*A[0][0])%MOD+A[0][1])%MOD;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tbool flag=false;\\n\\t\\tfor(int j=0;j<s.size();j++){\\n\\t\\t\\tif(s[j]=='+' || s[j]=='-'){\\n\\t\\t\\t\\tflag=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!flag){\\n\\t\\t\\tint mi=0;\\n\\t\\t\\tfor(mi=0;mi<s.size();mi++){\\n\\t\\t\\t\\tif(s[mi]=='*' || s[mi]=='+' || s[mi]=='-')break;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<mi;j++){\\n\\t\\t\\t\\tnowv*=10LL;\\n\\t\\t\\t\\tnowv+=(s[j]-'0');\\n\\t\\t\\t\\tnowv%=MOD;\\n\\t\\t\\t}\\n\\t\\t\\tpv=nowv*pv%MOD;\\n\\t\\t\\tif(r[i]>1){\\n\\t\\t\\t\\tnowv=getval(s,(mi+1)%s.size());\\n\\t\\t\\t\\tnowv=matpow(nowv,r[i]-1);\\n\\t\\t\\t\\tpv=nowv*pv%MOD;\\n\\t\\t\\t}\\n\\t\\t\\tnowv=0;\\n\\t\\t\\tfor(int j=mi+1;j<s.size();j++){\\n\\t\\t\\t\\tif(s[j]=='*'){\\n\\t\\t\\t\\t\\tpv=pv*nowv%MOD;\\n\\t\\t\\t\\t\\tnowv=0;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tnowv*=10LL;\\n\\t\\t\\t\\t\\tnowv+=(s[j]-'0');\\n\\t\\t\\t\\t\\tnowv%=MOD;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\ts=replace_str(s);\\n\\t\\t\\tint mi=0;\\n\\t\\t\\tfor(mi=0;mi<s.size();mi++){\\n\\t\\t\\t\\tif(s[mi]=='+')break;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<mi;j++){\\n\\t\\t\\t\\tif(s[j]=='*'){\\n\\t\\t\\t\\t\\tpv=pv*nowv%MOD;\\n\\t\\t\\t\\t\\tnowv=0;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tnowv*=10LL;\\n\\t\\t\\t\\t\\tnowv+=s[j]-'0';\\n\\t\\t\\t\\t\\tnowv%=MOD;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans+=nowv*pv%MOD;\\n\\t\\t\\tans%=MOD;\\n\\t\\t\\tif(r[i]>1){\\n\\t\\t\\t\\tnowv=getval(s,(mi+1)%s.size());\\n\\t\\t\\t\\tnowv*=r[i]-1;\\n\\t\\t\\t\\tans+=nowv%MOD;\\n\\t\\t\\t\\tans%=MOD;\\n\\t\\t\\t}\\n\\t\\t\\tpv=1;\\n\\t\\t\\tnowv=0;\\n\\t\\t\\tfor(int j=mi+1;j<s.size();j++){\\n\\t\\t\\t\\tif(s[j]=='*'){\\n\\t\\t\\t\\t\\tpv=pv*nowv%MOD;\\n\\t\\t\\t\\t\\tnowv=0;\\n\\t\\t\\t\\t}else if(s[j]=='+'){\\n\\t\\t\\t\\t\\tans+=nowv*pv%MOD;\\n\\t\\t\\t\\t\\tans%=MOD;\\n\\t\\t\\t\\t\\tpv=1;\\n\\t\\t\\t\\t\\tnowv=0;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tnowv*=10LL;\\n\\t\\t\\t\\t\\tnowv+=s[j]-'0';\\n\\t\\t\\t\\t\\tnowv%=MOD;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tans+=nowv*pv%MOD;\\n\\tans%=MOD;\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.0309,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2789_3005956\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long LL;\\nconst int MOD = 1e9 + 7;\\nstruct dt\\n{\\n\\tLL v, ev;\\n\\tdt(LL v = 0, LL ev = 0) : v(v % MOD), ev(ev % MOD) {}\\n\\tdt followed(const dt &o) const\\n\\t{\\n\\t\\tdt ret;\\n\\t\\tret.v = (v * o.ev % MOD + o.v) % MOD;\\n\\t\\tret.ev = ev * o.ev % MOD;\\n\\t\\treturn ret;\\n\\t}\\n};\\nLL modExp(LL x, LL y)\\n{\\n\\tif (y == 0) return 1;\\n\\tif (y == 1) return x % MOD;\\n\\tLL ret = modExp(x, y / 2);\\n\\tret = ret * ret % MOD;\\n\\tif (y & 1) ret = ret * x % MOD;\\n\\treturn ret;\\n}\\ndt connect(dt x, LL y)\\n{\\n\\tif (y == 0) return dt(0, 1);\\n\\tif (y == 1) return dt(x.v % MOD, x.ev % MOD);\\n\\tdt ret = connect(x, y / 2);\\n\\tret = ret.followed(ret);\\n\\tif (y % 2) ret = ret.followed(x);\\n\\treturn ret;\\n}\\ntypedef vector<dt> EXP;\\nLL calc(const EXP &e)\\n{\\n\\tEXP o;\\n\\tfor (int i = 0; i < e.size(); ++i) {\\n\\t\\tif (e[i].v == -3) {\\n\\t\\t\\tdt t = dt(o.back().v * e[i + 1].v % MOD);\\n\\t\\t\\to.pop_back();\\n\\t\\t\\to.push_back(t);\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\t\\telse o.push_back(e[i]);\\n\\t}\\n\\tLL ret = o[0].v;\\n\\tfor (int i = 1; i < o.size(); i += 2) {\\n\\t\\tif (o[i].v == -1) ret = (ret + o[i + 1].v) % MOD;\\n\\t\\telse ret = (ret + MOD - o[i + 1].v) % MOD;\\n\\t}\\n\\treturn ret;\\n}\\nEXP compress(char *s, int r)\\n{\\n\\tEXP se;\\n\\tLL v = -4, len;\\n\\tfor (int i = 0; s[i]; ++i) {\\n\\t\\tif (isdigit(s[i])) {\\n\\t\\t\\tif (v == -4) v = 0, len = 1;\\n\\t\\t\\tv *= 10, v += s[i] - '0';\\n\\t\\t\\tlen *= 10;\\n\\t\\t\\tv %= MOD, len %= MOD;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (v != -4) se.push_back(dt(v, len));\\n\\t\\t\\tv = -4;\\n\\t\\t\\tif (s[i] == '+') se.push_back(dt(-1));\\n\\t\\t\\telse if (s[i] == '-') se.push_back(dt(-2));\\n\\t\\t\\telse se.push_back(dt(-3));\\n\\t\\t}\\n\\t}\\n\\tif (v != -4) se.push_back(dt(v, len));\\n\\tif (r == 1) return se;\\n\\tint p = -1;\\n\\tfor (int i = 0; i < se.size(); ++i) {\\n\\t\\tif (se[i].v >= 0) continue;\\n\\t\\tif (p == -1) p = i;\\n\\t\\telse if (se[p].v < se[i].v) p = i;\\n\\t}\\n\\tEXP ret;\\n\\tif (p == -1) {\\n\\t\\tret.push_back(connect(se[0], r));\\n\\t\\treturn ret;\\n\\t}\\n\\tEXP re;\\n\\tfor (int i = p + 1; i < se.size() + p; ++i) {\\n\\t\\tif (!re.empty()) {\\n\\t\\t\\tif (re.back().v >= 0 && se[i % se.size()].v >= 0) {\\n\\t\\t\\t\\tdt t = re.back().followed(se[i % se.size()]);\\n\\t\\t\\t\\tre.pop_back();\\n\\t\\t\\t\\tre.push_back(t);\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tre.push_back(se[i % se.size()]);\\n\\t}\\n\\tif (se[p].v == -2) {\\n\\t\\tfor (int i = 0; i < re.size(); ++i) {\\n\\t\\t\\tif (re[i].v == -1) re[i].v = -2;\\n\\t\\t\\telse if (re[i].v == -2) re[i].v = -1;\\n\\t\\t}\\n\\t}\\n\\tLL val = calc(re);\\n\\tif (se[p].v == -3) val = modExp(val, r - 1);\\n\\telse val = val * (r - 1) % MOD;\\n\\tfor (int i = 0; i <= p; ++i) ret.push_back(se[i]);\\n\\tret.push_back(dt(val));\\n\\tfor (int i = p; i < se.size(); ++i) ret.push_back(se[i]);\\n\\treturn ret;\\n}\\nint main()\\n{\\n\\tint n; EXP e;\\n\\tscanf(\\\"%d\\\", &n);\\n\\tfor (int i = 0; i < n; ++i) {\\n\\t\\tint r;\\n\\t\\tchar s[200];\\n\\t\\tscanf(\\\"%d%s\\\", &r, s);\\n\\t\\tEXP se = compress(s, r);\\n\\t\\tfor (int i = 0; i < se.size(); ++i) {\\n\\t\\t\\tif (!e.empty()) {\\n\\t\\t\\t\\tif (e.back().v >= 0 && se[i].v >= 0) {\\n\\t\\t\\t\\t\\tdt t = e.back().followed(se[i]);\\n\\t\\t\\t\\t\\te.pop_back();\\n\\t\\t\\t\\t\\te.push_back(t);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\te.push_back(se[i]);\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%lld\\\\n\\\", calc(e));\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5920,\n \"score_of_the_acc\": -0.1455,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2789_3005727\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int MOD = 1e9+7;\\n\\nstring origine;\\n\\nint modExp(long long a, long long b, int p) {\\n\\tint ret = 1;\\n\\tfor (a = (a%p+p)%p; b; b >>= 1, a = a*a%p) if (b&1) ret = ret*a%p;\\n\\treturn ret;\\n}\\n\\nbool isDig(char c) {\\n\\treturn '0' <= c && c <= '9';\\n}\\n\\nlong long calcExp(string exp) {\\n\\tif (!exp.size()) return 0;\\n\\tint cur = 0;\\n\\tif (exp[0] == '-' || exp[0] == '+') cur++;\\n\\tlong long ret = 0;\\n\\twhile (cur < exp.size()) {\\n\\t\\tint sig = 1;\\n\\t\\tif (cur && exp[cur - 1] == '-') sig = -1;\\n\\t\\tlong long val = 1, now = 0;\\n\\t\\twhile (cur < exp.size()) {\\n\\t\\t\\tif (exp[cur] == '*') {\\n\\t\\t\\t\\tval = val * now % MOD;\\n\\t\\t\\t\\tnow = 0;\\n\\t\\t\\t}\\n\\t\\t\\tif (isDig(exp[cur])) now = (now * 10 + exp[cur] - '0') % MOD;\\n\\t\\t\\tif (exp[cur] == '+' || exp[cur] == '-') {\\n\\t\\t\\t\\t++cur;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t++cur;\\n\\t\\t}\\n\\t\\tval = val * now % MOD;\\n\\t\\tret = (ret + val * sig) % MOD;\\n\\t}\\n\\tret = (ret % MOD + MOD) % MOD;\\n\\treturn ret;\\n}\\n\\nstring toStr(long long val) {\\n\\tstring ret;\\n\\tif (!val) {\\n\\t\\tret.push_back('0');\\n\\t\\treturn ret;\\n\\t}\\n\\tint flg = 0;\\n\\tif (val < 0) flg = 1, val *= -1;\\n\\twhile (val) {\\n\\t\\tret.push_back('0' + val % 10);\\n\\t\\tval /= 10;\\n\\t}\\n\\tif (flg) ret.push_back('-');\\n\\treverse(ret.begin(), ret.end());\\n\\treturn ret;\\n}\\n\\nlong long getVal(string str) {\\n\\tlong long ret = 0, pw = 1;\\n\\twhile (str.size()) {\\n\\t\\tret = (ret + pw * (str.back() - '0')) % MOD;\\n\\t\\tstr.pop_back();\\n\\t\\tpw = pw * 10 % MOD;\\n\\t}\\n\\treturn ret;\\n}\\n\\nstring convert(string exp, int times) {\\n\\tif (times == 1) return exp;\\n\\tint sz = exp.size();\\n\\tint pos = -1;\\n\\tstring head, tail;\\n\\tfor (int i = 0; i < sz; i++) {\\n\\t\\tif (exp[i] == '+' || exp[i] == '-') {\\n\\t\\t\\tpos = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\thead.push_back(exp[i]);\\n\\t}\\n\\tif (pos >= 0) {\\n\\t\\tfor (int i = pos; i < sz; i++) tail.push_back(exp[i]);\\n\\t\\tlong long val = calcExp(tail + head);\\n\\t\\tval = (val * (times - 1)) % MOD;\\n\\t\\treturn head + \\\"+\\\" + toStr(val) + tail;\\n\\t}\\n\\tpos = -1;\\n\\thead.clear();\\n\\tfor (int i = 0; i < sz; i++) {\\n\\t\\tif (exp[i] == '*') {\\n\\t\\t\\tpos = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\thead.push_back(exp[i]);\\n\\t}\\n\\tif (pos >= 0) {\\n\\t\\tfor (int i = pos + 1; i < sz; i++) tail.push_back(exp[i]);\\n\\t\\tlong long val = calcExp(tail + head);\\n\\t\\tval = modExp(val, (times - 1), MOD);\\n\\t\\treturn head + \\\"*\\\" + toStr(val) + \\\"*\\\" + tail;\\n\\t}\\n\\tstring empty;\\n\\treturn empty;\\n}\\n\\nvoid append(string str, int times) {\\n\\tstring res = convert(str, times);\\n\\tif (res.size()) {\\n\\t\\torigine += res;\\n\\t\\treturn;\\n\\t}\\n\\tstring tail;\\n\\twhile (origine.size() && isDig(origine.back())) tail.push_back(origine.back()), origine.pop_back();\\n\\treverse(tail.begin(), tail.end());\\n\\tlong long head = getVal(tail);\\n\\tlong long val = getVal(str);\\n\\tint l = str.size();\\n\\tlong long inst = head * modExp(10, 1LL * l * times, MOD) % MOD + val * (modExp(10, 1LL * l * times, MOD) - 1) % MOD * modExp((modExp(10, 1LL * l, MOD) - 1) % MOD, MOD - 2, MOD) % MOD;\\n\\tinst = ((inst % MOD) + MOD) % MOD;\\n\\torigine += toStr(inst);\\n}\\n\\nint main() {\\n\\tios_base::sync_with_stdio(0);\\n\\tint n; cin >> n;\\n\\twhile (n--) {\\n\\t\\tint times; string tmp; \\n\\t\\tcin >> times >> tmp;\\n\\t\\tappend(tmp, times);\\n\\t}\\n\\tcout << calcExp(origine) << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.0152,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2789_2574432\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long LL;\\n\\nconstexpr int N = 10001, MOD = 1e9+7;\\n\\nint n, r;\\nchar s[N];\\n\\nstruct Vec {\\n LL a[4];\\n Vec() { memset(a, 0, sizeof(a)); }\\n LL& operator [] (const int &i) { return a[i]; }\\n const LL& operator [] (const int &i) const { return a[i]; }\\n void print() {\\n for(int i = 0; i < 4; ++i)\\n fprintf(stderr, \\\"%lld%c\\\", a[i], \\\"\\\\t\\\\n\\\"[i==3]);\\n }\\n};\\nstruct Mat {\\n Vec a[4];\\n Vec& operator [] (const int &i) { return a[i]; }\\n const Vec& operator [] (const int &i) const { return a[i]; }\\n Mat operator * (const Mat &b) {\\n Mat rtn;\\n for(int i = 0; i < 4; ++i)\\n for(int j = 0; j < 4; ++j)\\n for(int k = 0; k < 4; ++k)\\n rtn[i][j] = (MOD + rtn[i][j] + a[i][k] * b[k][j]) % MOD;\\n return rtn;\\n }\\n Vec operator * (const Vec &v) {\\n Vec rtn;\\n for(int i = 0; i < 4; ++i)\\n for(int j = 0; j < 4; ++j)\\n rtn[i] = (MOD + rtn[i] + a[i][j] * v[j]) % MOD;\\n return rtn;\\n }\\n void print() {\\n cerr << string(30, '-') << endl;\\n for(int i = 0; i < 4; ++i)\\n a[i].print();\\n }\\n};\\n\\nint main() {\\n Mat eye, mul, pos, neg, dig;\\n for(int i = 0; i < 4; ++i)\\n eye[i][i] = 1;\\n mul[0][0] = mul[1][2] = mul[3][3] = 1;\\n pos[0][0] = pos[0][2] = pos[1][3] = pos[3][3] = 1;\\n neg[0][0] = neg[0][2] = neg[3][3] = 1;\\n neg[1][3] = -1;\\n dig[0][0] = dig[1][1] = dig[3][3] = 1;\\n dig[2][2] = 10;\\n Vec v;\\n v[1] = v[3] = 1;\\n scanf(\\\"%d\\\", &n);\\n for(int i = 0; i < n; ++i) {\\n scanf(\\\"%d %s\\\", &r, s);\\n Mat t = eye;\\n for(int j = 0; s[j]; ++j) {\\n if(s[j] == '*')\\n t = mul * t;\\n else if(s[j] == '+')\\n t = pos * t;\\n else if(s[j] == '-')\\n t = neg * t;\\n else {\\n dig[2][1] = (s[j] - '0');\\n t = dig * t;\\n }\\n }\\n Mat cur = eye;\\n while(r) {\\n if(r & 1)\\n cur = t * cur;\\n r >>= 1;\\n t = t * t;\\n }\\n v = cur * v;\\n }\\n printf(\\\"%lld\\\\n\\\", (MOD + v[0] + v[2]) % MOD);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -0.1364,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2789_2570001\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconst int MOD = 1E9 + 7;\\n\\nconst int NMAT[7][7] = {\\n\\t{1, 0, 0, 0, 0, 0, 0},\\n\\t{0, 1, 0, 0, 0, 0, 0},\\n\\t{0, 0, 1, -1, 0, 0, 0},\\n\\t{0, 0, 0, 10, 0, 0, 0},\\n\\t{0, 0, 0, 0, 1, -1, 0},\\n\\t{0, 0, 0, 0, 0, 10, 0},\\n\\t{0, 0, 0, 0, 0, 0, 1}\\n};\\n\\nconst int MMAT[7][7] = {\\n\\t{1, 0, 0, 0, 0, 0, 0},\\n\\t{0, 0, 0, 0, 1, 0, 0},\\n\\t{0, 0, 0, 0, 0, 0, 0},\\n\\t{0, 0, 0, 0, 0, 0, 1},\\n\\t{0, 0, 0, 0, 0, 0, 0},\\n\\t{0, 0, 0, 0, 1, 0, 0},\\n\\t{0, 0, 0, 0, 0, 0, 1},\\n};\\n\\nconst int AMAT[7][7] = {\\n\\t{1, 0, 0, 0, -1, 0, 0},\\n\\t{0, 0, 0, 0, 0, 0, 1},\\n\\t{0, 0, 0, 0, 0, 0, 0},\\n\\t{0, 0, 0, 0, 0, 0, 1},\\n\\t{0, 0, 0, 0, 0, 0, 0},\\n\\t{0, 0, 0, 0, 0, 0, 1},\\n\\t{0, 0, 0, 0, 0, 0, 1}\\n};\\n\\nstruct mat {\\n\\tint d[7][7];\\n\\tmat () { for (int i = 0; i < 7; ++i) for (int j = 0; j < 7; ++j) d[i][j] = 0; }\\n\\tint *operator [] (int x) { return d[x]; }\\n\\tint const *operator [] (int x) const { return d[x]; }\\n};\\n\\nmat operator * (const mat &a, const mat &b) {\\n\\tmat res;\\n\\tfor (int i = 0; i < 7; ++i)\\n\\t\\tfor (int j = 0; j < 7; ++j)\\n\\t\\t\\tfor (int k = 0; k < 7; ++k)\\n\\t\\t\\t\\tres[i][j] = (res[i][j] + 1ll * a[i][k] * b[k][j]) % MOD;\\n\\treturn res;\\n}\\n\\nmat id () {\\n\\tmat res;\\n\\tfor (int i = 0; i < 7; ++i)\\n\\t\\tres[i][i] = 1;\\n\\treturn res;\\n}\\n\\nmat nmat[10], mmat, amat, smat;\\n\\nvoid init () {\\n\\tfor (int digit = 0; digit < 10; ++digit)\\n\\t\\tfor (int i = 0; i < 7; ++i)\\n\\t\\t\\tfor (int j = 0; j < 7; ++j)\\n\\t\\t\\t\\tnmat[digit][i][j] = (NMAT[i][j] < 0) ? digit : NMAT[i][j];\\n\\tfor (int i = 0; i < 7; ++i)\\n\\t\\tfor (int j = 0; j < 7; ++j)\\n\\t\\t\\tmmat[i][j] = MMAT[i][j];\\n\\tfor (int i = 0; i < 7; ++i)\\n\\t\\tfor (int j = 0; j < 7; ++j)\\n\\t\\t\\tamat[i][j] = (AMAT[i][j] < 0) ? 1 : AMAT[i][j];\\n\\tfor (int i = 0; i < 7; ++i)\\n\\t\\tfor (int j = 0; j < 7; ++j)\\n\\t\\t\\tsmat[i][j] = (AMAT[i][j] < 0) ? MOD - 1 : AMAT[i][j];\\n}\\n\\nint N;\\nint R[11000];\\nchar S[11000][20];\\n\\nint ans[7] = {0, 1, 0, 1, 0, 1, 1}, tmp[7];\\n\\nint main () {\\n\\tinit ();\\n\\tscanf (\\\"%d\\\", &N);\\n\\tfor (int i = 0; i < N; ++i)\\n\\t\\tscanf (\\\"%d %s\\\", &R[i], S[i]);\\n\\tfor (int i = N - 1; i >= 0; --i) {\\n\\t\\tmat mul = id (), ter = id ();\\n\\t\\tfor (int j = strlen (S[i]) - 1; j >= 0; --j) {\\n\\t\\t\\tif (S[i][j] >= '0' && S[i][j] <= '9') mul = nmat[S[i][j] - '0'] * mul;\\n\\t\\t\\telse if (S[i][j] == '*') mul = mmat * mul;\\n\\t\\t\\telse if (S[i][j] == '+') mul = amat * mul;\\n\\t\\t\\telse mul = smat * mul;\\n\\t\\t}\\n\\t\\twhile (R[i]) {\\n\\t\\t\\tif (R[i] & 1) ter = mul * ter;\\n\\t\\t\\tmul = mul * mul;\\n\\t\\t\\tR[i] >>= 1;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 7; ++i) {\\n\\t\\t\\ttmp[i] = 0;\\n\\t\\t\\tfor (int j = 0; j < 7; ++j)\\n\\t\\t\\t\\ttmp[i] = (tmp[i] + 1ll * ans[j] * ter[i][j]) % MOD;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 7; ++i) ans[i] = tmp[i];\\n\\t}\\n\\tfor (int i = 0; i < 7; ++i) {\\n\\t\\ttmp[i] = 0;\\n\\t\\tfor (int j = 0; j < 7; ++j)\\n\\t\\t\\ttmp[i] = (tmp[i] + 1ll * ans[j] * amat[i][j]) % MOD;\\n\\t}\\n\\tfor (int i = 0; i < 7; ++i) ans[i] = tmp[i];\\n\\tprintf (\\\"%d\\\\n\\\", ans[0]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -1.0131,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2789_2270607\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nconst ll mod = 1e9+7;\\n\\nll mod_pow(ll x, ll p){\\n ll res = 1;\\n\\n while(p){\\n if(p&1LL) res = res * x % mod;\\n x = x * x % mod;\\n p >>= 1;\\n }\\n\\n return res;\\n}\\n\\nmat mat_prod(mat A, mat B){\\n size_t h = A.size(), w = B.size();\\n mat res(h, vec(w,0));\\n for(size_t i=0;i<h;i++){\\n for(size_t j=0;j<w;j++){\\n for(size_t k=0;k<A[i].size();k++){\\n\\tres[i][j] += A[i][k] * B[k][j] % mod;\\n\\tres[i][j] %= mod;\\n }\\n }\\n }\\n return res;\\n}\\t \\n\\nmat mat_pow(mat A, ll p){\\n int n = A.size();\\n mat res(n, vec(n,0));\\n for(int i=0;i<n;i++) res[i][i] = 1;\\n\\n while(p){\\n if(p&1LL) res = mat_prod(res, A);\\n A = mat_prod(A,A);\\n p >>= 1;\\n }\\n\\n return res;\\n}\\n\\ninline ll calc(const string s, ll &prod, ll &rem){\\n ll res = 0;\\n for(char c : s){\\n if(c == '*'){\\n prod *= rem;\\n prod %= mod;\\n rem = 0;\\n }else if(c == '+'){\\n res += (prod * rem) % mod;\\n res %= mod;\\n prod = 1; rem = 0;\\n }else if(c == '-'){\\n res += (prod * rem) % mod;\\n res %= mod;\\n prod = mod-1; rem = 0;\\n }else{\\n rem = rem*10 + (ll)(c-'0');\\n rem %= mod;\\n }\\n }\\n\\n return res;\\n}\\n\\nint main(){\\n ll n;\\n cin >> n;\\n\\n //temporary result can be represented as \\\"add + prod * rem\\\"\\n ll add=0, prod=1, rem=0;\\n\\n //tuple<ll,ll> : <times, add before par, prod before par>\\n stack< tuple<ll,ll,ll> > open;\\n\\n while(n--){\\n ll r; string s;\\n cin >> r >> s;\\n\\n if(s.find(\\\"(\\\") != string::npos){\\n size_t p = s.find(\\\"(\\\");\\n string pre = s.substr(0,p), suf = s.substr(p+1);\\n add += calc(pre, prod, rem) % mod;\\n add %= mod;\\n \\n open.push( make_tuple(1LL, add, prod) );\\n add = 0, prod = 1;\\n\\n if(r-1>0){\\n\\tadd += calc(suf + pre, prod, rem) % mod;\\n\\tadd %= mod;\\n\\t\\n\\topen.push( make_tuple(r-1, add, prod) );\\n\\tadd = 0, prod = 1;\\n }\\n\\n add += calc(suf, prod, rem) % mod;\\n add %= mod;\\n }else if(s.find(\\\")\\\") != string::npos){\\n size_t p = s.find(\\\")\\\");\\n string pre = s.substr(0,p), suf = s.substr(p+1);\\n\\n add += calc(pre, prod, rem) % mod;\\n add %= mod;\\n\\n ll x = (add + (prod*rem%mod)) % mod, t;\\n\\n if(r-1>0){\\n\\tr--;\\n\\tstring m = suf + pre;\\n\\tsize_t k = 0;\\n\\tll cp = 1;\\n\\twhile(k<m.size() && m[k] == '*'){\\n\\t ll tmp = 0;\\n\\t k++;\\n\\t while(k<m.size() && isdigit(m[k])){\\n\\t tmp = tmp*10 + (ll)(m[k]-'0');\\n\\t tmp %= mod;\\n\\t k++;\\n\\t }\\n\\t cp *= tmp;\\n\\t}\\n\\t\\n\\tll ca = 0, tp = 1, trem = 0;\\n\\tca += calc(m.substr(k), tp, trem) % mod;\\n\\tca %= mod;\\n\\t\\n\\tca = (ca + (tp*trem%mod)) % mod;\\n\\t\\n\\twhile(r){\\n\\t assert( !open.empty() );\\n\\t ll oa,op;\\n\\t tie(t,oa,op) = open.top(); open.pop();\\n\\t \\n\\t if(t > r) open.push( make_tuple(t-r, oa, op) );\\n\\t \\n\\t t = min(t, r);\\n\\t r -= t;\\n\\t \\n\\t //calc f^t(x), where f(x) = cp*op*x + ca+oa\\n\\t (op *= cp) %= mod;\\n\\t (oa += ca) %= mod;\\n\\t \\n\\t mat A = { {op, oa}, {0,1} };\\n\\t A = mat_pow(A, t);\\n\\t x = A[0][0] * x + A[0][1];\\n\\t x %= mod;\\n\\t} \\t\\n }\\n\\n tie(t,add,prod) = open.top(); open.pop();\\n if(t-1>0) open.push( make_tuple(t-1, add, prod) );\\n rem = x;\\n \\n add += calc(suf, prod, rem) % mod;\\n add %= mod;\\n }else if(s.find(\\\"+\\\") != string::npos || s.find(\\\"-\\\") != string::npos ){\\n size_t p = min( s.find(\\\"+\\\"), s.find(\\\"-\\\") );\\n string pre = s.substr(0,p+1), suf = s.substr(p+1);\\n add += calc(pre, prod, rem) % mod;\\n add %= mod;\\n\\n add += (r-1) * calc(suf + pre, prod, rem) % mod;\\n add %= mod;\\n\\n add += calc(suf, prod, rem) % mod;\\n add %= mod;\\n }else if(s.find(\\\"*\\\") != string::npos){\\n size_t p = s.find(\\\"*\\\");\\n string pre = s.substr(0,p+1), suf = s.substr(p+1);\\n calc(pre, prod, rem);\\n \\n ll x = 1;\\n calc(suf + pre, x, rem);\\n prod *= mod_pow(x, r-1);\\n prod %= mod;\\n \\n calc(suf, prod, rem);\\n }else{\\n ll x = 0, dummy = 1;\\n calc(s, dummy, x);\\n\\n mat A = { {mod_pow(10, s.size()), x}, {0,1} };\\n A = mat_pow(A, r);\\n rem = A[0][0] * rem + A[0][1];\\n rem %= mod;\\n }\\n }\\n\\n assert(open.empty());\\n\\n add += calc(\\\"+0\\\", prod, rem) % mod;\\n add %= mod;\\n cout << add << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3232,\n \"score_of_the_acc\": -0.0467,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2789_2075736\",\n \"code_snippet\": \"/**************************************************************************************************************\\n * Md. Abdulla Al Mamun (Nayon)\\n * ID: 1306001\\n * Session: 2013-2014\\n * Department of Computer Science and Engineering\\n * Begum Rokeya University, Rangpur (BRUR)\\n***************************************************************************************************************/\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define PI acos(-1.0)\\n#define EPS 1e-9\\n#define INF 1 << 28\\n#define sq(a) ((a) * (a))\\n#define toRad(a) ((a)*(PI)/180)\\n#define toDeg(a) ((a)*180/(PI))\\n#define all(x) (x).begin(), (x).end()\\n#define pb(x) push_back(x)\\n#define mp(a, b) make_pair((a), (b))\\n#define endl '\\\\n'\\n#define MAX 100000\\n#define MOD 1000000007\\n#define what_is(x) cerr << #x << \\\" is \\\" << x << endl;\\n#define mset(array, value) memset(array, value, sizeof(array))\\n\\ninline bool isEq(double a, double b){return (abs(a-b) < EPS);}\\n\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ninline ll negModHandler(ll a, ll d){return ((a%d)<0)?d+(a%d):(a%d);}\\n\\n//#define isValid(a, b) ((a >= 0 && a < b) ? 1 : 0)\\n//int dr[] = {0, -1, -1, -1, 0, 1, 1, 1};\\n//int dc[] = {1, 1, 0, -1, -1, -1, 0, 1};\\n\\nstring strMod(string s)\\n{\\n\\tll n = 0, len = s.length();\\n\\tfor(int i = 0; i < len; i++){\\n\\t\\tn = (n*10 + s[i]-'0')%MOD;\\n\\t}\\n\\tstringstream ss;\\n\\tss << n;\\n\\tss >> s;\\n\\treturn s;\\n}\\n\\nint main()\\n{\\n\\t//freopen(\\\"in.txt\\\", \\\"r\\\", stdin);\\n\\t//freopen(\\\"out.txt\\\", \\\"w\\\", stdout);\\n\\tios_base::sync_with_stdio(false); cin.tie(NULL);\\n\\tint n, r, i;\\n\\tstring str, all;\\n\\tstringstream ss, ss2;\\n\\tcin >> n;\\n\\tall = \\\"\\\";\\n\\twhile(n--){\\n\\t\\tcin >> r >> str;\\n\\t\\tfor(i = 0; i < r; i++){\\n\\t\\t\\tall += str;\\n\\t\\t}\\n\\t}\\n\\t//cout << \\\"# \\\" << all << endl;\\n\\tint ln = all.length();\\n\\tstring all2 = \\\"\\\";\\n\\tstr = \\\"\\\";\\n\\tfor(i = 0; i < ln; i++){\\n\\t\\twhile(i < ln && isdigit(all[i])){\\n\\t\\t\\tstr += all[i];\\n\\t\\t\\ti++;\\n\\t\\t}\\n\\t\\twhile(i < ln && all[i] == '*'){\\n\\t\\t\\tstring str2 = \\\"\\\";\\n\\t\\t\\ti++;\\n\\t\\t\\twhile(isdigit(all[i])){\\n\\t\\t\\t\\tstr2 += all[i];\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\t\\t\\tss.clear();\\n\\t\\t\\tss2.clear();\\n\\t\\t\\tss << strMod(str);\\n\\t\\t\\tss2 << strMod(str2);\\n\\t\\t\\tll n1, n2;\\n\\t\\t\\tss >> n1;\\n\\t\\t\\tss2 >> n2;\\n\\t\\t\\tn1 = (n1 %MOD * n2%MOD)%MOD;\\n\\t\\t\\tss.clear();\\n\\t\\t\\tss << n1;\\n\\t\\t\\tss >> str;\\n\\t\\t}\\n\\t\\tif(all[i] == '-' || all[i] == '+'){\\n\\t\\t\\tstr+=all[i];\\n\\t\\t}\\n\\t\\tall2 += str;\\n\\t\\tstr = \\\"\\\";\\n\\t}\\n\\t//cout << \\\"# \\\" << all2 << endl;\\n\\tln = all2.length();\\n\\tll ans = 0;\\n\\tstr = \\\"\\\";\\n\\ti = 0;\\n\\twhile(i < ln && isdigit(all2[i])){\\n\\t\\tstr += all2[i];\\n\\t\\ti++;\\n\\t}\\n\\tss.clear();\\n\\tss << strMod(str);\\n\\tss >> ans;\\n\\tif(i < ln){\\n\\t\\tchar sign = all2[i];\\n\\t\\tfor(i++; i < ln; i++){\\n\\t\\t\\tstr = \\\"\\\";\\n\\t\\t\\twhile(i < ln && isdigit(all2[i])){\\n\\t\\t\\t\\tstr += all2[i];\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\t\\t\\tll n1;\\n\\t\\t\\tss.clear();\\n\\t\\t\\tss << strMod(str);\\n\\t\\t\\tss >> n1;\\n\\t\\t\\tif(sign == '+'){\\n\\t\\t\\t\\tans = negModHandler(ans+n1, MOD);\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tans = negModHandler(ans-n1, MOD);\\n\\t\\t\\t}\\n\\t\\t\\tif(i < ln)\\n\\t\\t\\t\\tsign = all2[i];\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.3877551020408163,\n \"time_ms\": 30,\n \"memory_kb\": 3776,\n \"score_of_the_acc\": -0.0759,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":1682,"cells":{"group_id":{"kind":"string","value":"aoj_2795_cpp"},"problem_description":{"kind":"string","value":"E: 札 / Fuda\nこの問題はリアクティブ問題です。\nサーバー側に用意されたプログラムと対話的に応答することで正答を導くプログラムを作成する必要があります。\n問題文\n湖に浮かぶ $N$ 個の小島からなるビワコという村がある。\n各小島には $0$ から $N-1$ まで番号が振られている。\n村には島と島の間に架かる橋が $M$ 本あり、$0$ から $M-1$ まで番号が振られている。\n橋は双方向に移動可能である。\nここで言う橋とは単に島と島の間の通り道ということであり、取り除くと互いに到達不可能な島の組が増える意味ではない。\n最近、橋の両端に掲示板を設置し、その橋を渡った先の島から橋を $1$ 本だけ使って移動できる島 (今いる島を含まない) の番号の書かれた札を貼ることで、\nスムーズな移動を実現する計画が持ち上がった。\n一枚の札には一つの移動先しか書くことが出来ないため、移動できる島の数だけ札が必要になる。\nこの札の作成を命じられたあなたは、札は全部で何枚必要かを調べることにした。\n村には、かつて全ての橋を架けた橋職人がいる。\nまた、各島にはその島に住んでいる村人がいる。\n村は広大で全ての掲示板を見て回るのは骨が折れるため、本部から電話で彼らに質問をすることで必要な札の枚数を求めることにした。\n橋職人への質問では、まず、何番の橋の情報が知りたいかを橋職人に伝える。\nすると、どの島とどの島の間に該当する橋を架けたかを確実に教えてくれる (edgクエリ)。\n住人への質問では、まず聞きたい島の番号$i$を伝える。\nすると、島 $i$ にかかる橋の数とその橋がどこにかかっているかを教えてくれる (lst クエリ)。\nしかし、貧弱な通信網を使用しているため、各橋に対して、80% の確率で情報が抜け落ちてしまう。\n札の発注まで時間がないので全体で多くても $3N$ 回しか質問ができない。\n以上の条件のもとで、必要な札の数を求めるプログラムを書きなさい。\n入出力仕様\n以降では、あなたが提出したプログラムを「解答」、ジャッジ側が用意したプログラムを「ジャッジ」と呼ぶ。\n入出力の詳細な仕様を以下に示すが、先にサンプルを見ると速い。\n島と橋の数\nジャッジは、まず島の数 $N$ と橋の数の合計 $M$ を $1$ 行に出力する。\nN M\n続いて、解答は edg, lst クエリを最大 $3N$ 回、 ans をちょうど 1 回ジャッジに対して送ることができる。\nedg クエリ\n解答の edg クエリに対し、ジャッジは橋$i$の両端の島の番号を答える。解答は次の形式で出力せよ。\nedg i\nこれに対して、ジャッジは次の形式で応答する。\na b\n$a$, $b$ は橋 $i$ が結ぶ島の番号である。\nlst クエリ\n解答の lst クエリに対し、ジャッジは小島 $i$ にかかる橋の本数と、それぞれの橋の行き先の島の番号を答える。解答は次の形式で出力せよ。\nlst i\nこれに対して、ジャッジは次の形式で応答する。\nk v1 v2 v3 … vk\n$k$ は島 $i$ にかかる橋の数である。\n続く $v_1 \\cdots v_k$ は頂点$i$から橋を一度だけ使って移動可能な頂点の番号のリストである。\n各橋の行き先 $v_j$ に対し、$v_j \\ge 0$ の場合はその情報がしっかり伝わったことを表す。$v_j = -1$ の場合は情報が抜け落ちていることを表す。\n$-1$ かどうかは乱数で決められ、80% の確率で $-1$ となる。したがって、同じ $i$ に対して複数回このクエリを実行すると、結果は変わりうる。また、順番も不定である。\nans クエリ\n解答の ans クエリによって、答えを出力できる。このクエリは 1 度しか行うことが出来ず、結果が正しくない場合は直ちに誤答となる。\nこのクエリの実行後に、解答は直ちに正常終了せよ。 $X$ を答えとして出力したい場合の形式は以下の通りである。\nans X\n制約と注意\n$1 \\le N \\le 100$\n$0 \\le M \\le N(N-1)/2$\n橋は異なる 2 つの島の間に架かっている。\n異なる橋が、同じ 2 つの島を結ぶことはない。\nans 以外のクエリは高々 $3N$ 回しか投げられない。\nジャッジプログラムの出力は全て $1$ 行かつスペース区切りの整数からなる。\n仕様に従わない出力の結果は不定である。\n解答はジャッジの応答をすぐに標準入力で受け取らなければならない。\n解答はクエリを出力した直後にバッファを空にせよ。最小の解答プログラム例を下に示す。C、C++以外の言語は各自で調べてほしい。\nC\n#include <stdio.h>\nint main(){\n int n,m;\n scanf(\"%d %d\", & n, &m);\n printf(\"ans 100\\n\"); // 答えをジャッジに提出\n fflush(stdout); // フラッシュ\n return 0;\n}\nC++\n#include <iostream>\nusing namespace std;\nint main(){\n int n,m;\n cin >> n >> m;\n cout << \"ans 100\" << endl; // 改行直後にフラッシュ\n // cout << \"ans 100\\n\" << flush; // 上と同じ\n}\nサンプル\n解答プログラムとジャッジプログラムの入出力例を以下に示す。\n問題文の図中の村に対する答えを求めている。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2795_2258530","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\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\n#define INF 21474836\n\nint main(){\n int n,m;\n cin>>n>>m;\n\n vector<vector<int>> vec(n, vector<int>(n,0));\n\n if(3*n >=m){\n rep(i,m){\n cout << \"edg \" << i << endl;\n int u,v;\n cin>>u>>v;\n vec[u][v]=1;\n vec[v][u]=1;\n }\n }\n else {\n vector<int> k(n);\n vector<int> hoge(n,0); // ?????\\????????°\n\n rep(i,n){\n cout << \"lst \" << i << endl;\n cin>>k[i];\n rep(_,k[i]){\n int d; cin>>d;\n if(d==-1) hoge[i]++;\n else {\n vec[i][d]=1;\n }\n }\n }\n\n rep(i,n)rep(j,i) if(vec[i][j] != vec[j][i]){\n if(vec[i][j]==0){\n vec[i][j] = 1;\n hoge[i]--;\n } else {\n vec[j][i] = 1;\n hoge[j]--;\n }\n }\n\n int cnt = 2*n;\n\n priority_queue<pair<int,int>> pq;\n\n rep(i,n) if(hoge[i]>0) pq.push(mp(hoge[i], i));\n\n while(!pq.empty() || cnt>0){\n int i = pq.top().se; pq.pop();\n if(hoge[i]==0) continue;\n \n cout << \"lst \" << i << endl;\n cin>>k[i];\n rep(__,k[i]){\n int d; cin>>d;\n if(d==-1) continue;\n else {\n if(vec[i][d]==0) hoge[i]--;\n vec[i][d]=1;\n if(vec[d][i]==0) hoge[d]--;\n vec[d][i]=1;\n }\n }\n cnt--;\n if(hoge[i]>0) pq.push(mp(hoge[i], i));\n }\n }\n\n vector<vector<int>> &d = vec;\n rep(i,n) rep(j,n) if(i!=j && d[i][j]==0) d[i][j] = INF;\n rep(i,n) d[i][i]=0;\n\n rep(kk,n)rep(i,n)rep(j,n) d[i][j] = min(d[i][j], d[i][kk] + d[kk][j]);\n\n int ans =0;\n rep(i,n) rep(j,n) if(d[i][j]==2) ans++;\n\n cout << \"ans \" << ans << endl;\n\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":3040,"score_of_the_acc":-0.8822,"final_rank":8},{"submission_id":"aoj_2795_2258528","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\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\n#define INF 21474836\n\nint main(){\n int n,m;\n cin>>n>>m;\n\n vector<vector<int>> vec(n, vector<int>(n,0));\n vector<int> k(n);\n vector<int> hoge(n,0); // ?????\\????????°\n\n if(3*n >=m){\n rep(i,m){\n cout << \"edg \" << i << endl;\n int u,v;\n cin>>u>>v;\n if(vec[u][v]==0){\n vec[u][v]=1;\n vec[v][u]=1;\n hoge[u]--;\n hoge[v]--;\n }\n }\n }\n else {\n rep(i,n){\n cout << \"lst \" << i << endl;\n cin>>k[i];\n rep(_,k[i]){\n int d; cin>>d;\n if(d==-1)hoge[i]++;\n else {\n vec[i][d]=1;\n }\n }\n }\n\n rep(i,n)rep(j,i) if(vec[i][j] != vec[j][i]){\n if(vec[i][j]==0){\n vec[i][j] = 1;\n hoge[i]--;\n } else {\n vec[j][i] = 1;\n hoge[j]--;\n }\n }\n\n int cnt = 2*n;\n\n priority_queue<pair<int,int>> pq;\n\n rep(i,n) if(hoge[i]>0) pq.push(mp(hoge[i], i));\n\n while(!pq.empty() || cnt>0){\n int i = pq.top().se; pq.pop();\n cout << \"lst \" << i << endl;\n cin>>k[i];\n rep(__,k[i]){\n int d; cin>>d;\n if(d==-1) continue;\n else {\n if(vec[i][d]==0) hoge[i]--;\n vec[i][d]=1;\n if(vec[d][i]==0) hoge[d]--;\n vec[d][i]=1;\n }\n }\n cnt--;\n if(hoge[i]>0) pq.push(mp(hoge[i], i));\n }\n }\n\n vector<vector<int>> &d = vec;\n rep(i,n) rep(j,n) if(i!=j && d[i][j]==0) d[i][j] = INF;\n rep(i,n) d[i][i]=0;\n\n rep(kk,n)rep(i,n)rep(j,n) d[i][j] = min(d[i][j], d[i][kk] + d[kk][j]);\n\n int ans =0;\n rep(i,n) rep(j,n) if(d[i][j]==2) ans++;\n\n cout << \"ans \" << ans << endl;\n\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":3072,"score_of_the_acc":-0.8982,"final_rank":9},{"submission_id":"aoj_2795_2258496","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\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\n#define INF 21474836\n\nint main(){\n int n,m;\n cin>>n>>m;\n\n vector<vector<int>> vec(n, vector<int>(n,0));\n vector<int> k(n);\n vector<int> hoge(n,0); // ?????\\????????°\n\n rep(i,n){\n cout << \"lst \" << i << endl;\n cin>>k[i];\n rep(_,k[i]){\n int d; cin>>d;\n if(d==-1)hoge[i]++;\n else {\n vec[i][d]=1;\n }\n }\n }\n\n rep(i,n)rep(j,i) if(vec[i][j] != vec[j][i]){\n if(vec[i][j]==0){\n vec[i][j] = 1;\n hoge[i]--;\n } else {\n vec[j][i] = 1;\n hoge[j]--;\n }\n }\n\n int cnt = 2*n;\n\n rep(_,100){\n rep(i,n) if(cnt>0 && hoge[i]>0){\n cout << \"lst \" << i << endl;\n cin>>k[i];\n rep(__,k[i]){\n int d; cin>>d;\n if(d==-1) continue;\n else {\n if(vec[i][d]==0) hoge[i]--;\n vec[i][d]=1;\n if(vec[d][i]==0) hoge[d]--;\n vec[d][i]=1;\n }\n }\n cnt--;\n }\n }\n\n vector<vector<int>> &d = vec;\n rep(i,n) rep(j,n) if(i!=j && d[i][j]==0) d[i][j] = INF;\n rep(i,n) d[i][i]=0;\n\n rep(kk,n)rep(i,n)rep(j,n) d[i][j] = min(d[i][j], d[i][kk] + d[kk][j]);\n\n int ans =0;\n rep(i,n) rep(j,n) if(d[i][j]==2) ans++;\n\n cout << \"ans \" << ans << endl;\n\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":3140,"score_of_the_acc":-0.9321,"final_rank":13},{"submission_id":"aoj_2795_2001350","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n,m,i,j,k,c=0,d=0,ans=0;\n cin>>n>>m;\n int s=0,t=2*n+1;\n\n for(i=0;i<n;i++){\n cout << \"lst \" << i << endl;\n cin >> k;\n ans+=k*(k-1);\n for(j=0;j<k;j++) cin >> c;\n }\n\n cout << \"ans \"<< ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1280,"score_of_the_acc":-0.004,"final_rank":2},{"submission_id":"aoj_2795_2001261","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n,m,k;\n int ans = 0;\n cin >> n >> m;\n for(int i = 0;i<n;i++){\n cout << \"lst \" << i << endl;\n cin >> k;\n for(int j =0;j<k;j++) cin >> m;\n ans += k*(k-1);\n }\n cout << \"ans \" << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1280,"score_of_the_acc":-0.004,"final_rank":2},{"submission_id":"aoj_2795_2001238","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_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 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\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntemplate<class T> using vv=vector<vector<T>>;\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"{\"; rep(i,t.size()) {os<<t[i]<<\",\";} os<<\"}\"<<endl; return os;}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\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;}\nconst ll MOD=1e9+7;\n\nint d[112][112];\n\nint main(){\n ios_base::sync_with_stdio(false);\n cout<<fixed<<setprecision(0);\n int n,m;\n cin>>n>>m;\n vv<int> g(n);\n if(m>3*n){\n rep(i,n){\n cout<<\"lst \"<<i<<endl;\n int t;\n cin>>t;\n unordered_set<int> st;\n int hoge=0;\n while(st.size()<t){\n\tif(hoge){ cout<<\"lst \"<<i<<endl;\ncin>>hoge;\n\t}\n\thoge=1;\n\trep(j,t){\n\t int x;\n\t cin>>x;\n\t if(x>=0)\n\t st.insert(x);\n\t}\n }\n for(int x:st) g[i].pb(x);\n }\n assert(0);\n }else{\n rep(i,m){\n cout<<\"edg \"<<i<<endl;\n int x,y;\n cin>>x>>y;\n g[x].pb(y);\n g[y].pb(x);\n }\n }\n //cout<<g;\n ll re=0;\n rep(i,n) for(int v:g[i]) re+=g[v].size()-1;\n cout<<\"ans \"<<re<<endl;\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":3080,"score_of_the_acc":-0.9022,"final_rank":10},{"submission_id":"aoj_2795_2001235","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_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 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\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntemplate<class T> using vv=vector<vector<T>>;\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"{\"; rep(i,t.size()) {os<<t[i]<<\",\";} os<<\"}\"<<endl; return os;}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\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;}\nconst ll MOD=1e9+7;\n\nint d[112][112];\n\nint main(){\n ios_base::sync_with_stdio(false);\n cout<<fixed<<setprecision(0);\n int n,m;\n cin>>n>>m;\n vv<int> g(n);\n if(m>3*n){\n rep(i,n){\n cout<<\"lst \"<<i<<endl;\n int t;\n cin>>t;\n unordered_set<int> st;\n int hoge=0;\n while(st.size()<t){\n\tif(hoge){ cout<<\"lst \"<<i<<endl;\ncin>>hoge;\n\t}\n\thoge=1;\n\trep(j,t){\n\t int x;\n\t cin>>x;\n\t if(x>=0)\n\t st.insert(x);\n\t}\n }\n for(int x:st) g[i].pb(x);\n }\n }else{\n rep(i,m){\n cout<<\"edg \"<<i<<endl;\n int x,y;\n cin>>x>>y;\n g[x].pb(y);\n g[y].pb(x);\n }\n }\n //cout<<g;\n ll re=0;\n rep(i,n) for(int v:g[i]) re+=g[v].size()-1;\n cout<<\"ans \"<<re<<endl;\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":3172,"score_of_the_acc":-0.9481,"final_rank":14},{"submission_id":"aoj_2795_2001229","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_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 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\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntemplate<class T> using vv=vector<vector<T>>;\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"{\"; rep(i,t.size()) {os<<t[i]<<\",\";} os<<\"}\"<<endl; return os;}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\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;}\nconst ll MOD=1e9+7;\n\nint d[112][112];\n\nint main(){\n ios_base::sync_with_stdio(false);\n cout<<fixed<<setprecision(0);\n int n,m;\n cin>>n>>m;\n vv<int> g(n);\n if(m>3*n){\n rep(i,n){\n cout<<\"lst \"<<i<<endl;\n int t;\n cin>>t;\n unordered_set<int> st;\n int hoge=0;\n while(st.size()<t){\n\tif(hoge){ cout<<\"lst \"<<i<<endl;\ncin>>hoge;\n\t}\n\thoge=1;\n\trep(j,t){\n\t int x;\n\t cin>>x;\n\t st.insert(x);\n\t}\n }\n for(int x:st) g[i].pb(x);\n }\n }else{\n rep(i,m){\n cout<<\"edg \"<<i<<endl;\n int x,y;\n cin>>x>>y;\n g[x].pb(y);\n g[y].pb(x);\n }\n }\n //cout<<g;\n ll re=0;\n rep(i,n) for(int v:g[i]) re+=g[v].size()-1;\n cout<<\"ans \"<<re<<endl;\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":3100,"score_of_the_acc":-0.9122,"final_rank":11},{"submission_id":"aoj_2795_2001220","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_V 110\nint INF = 1 << 28;\nstruct edge{int to,cap,rev;};\nvector<edge> G[MAX_V*2+2];\nbool used[MAX_V*2+2];\nvoid add_edge(int from,int to,int cap){\n G[from].push_back((edge){to,cap,G[to].size()});\n G[to].push_back((edge){from,0,G[from].size()-1});\n}\n\nint dfs(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(e.to,t,min(f,e.cap));\n if(d>0){\n\te.cap-=d;\n\tG[e.to][e.rev].cap+=d;\n\treturn d;\n }\n } \n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow=0;\n for(;;){\n memset(used,0,sizeof(used));\n int f=dfs(s,t,INF);\n if(f==0) return flow;\n flow+=f;\n }\n}\n\nint x[MAX_V][MAX_V];\nint ans=0;\n\nvoid dfs2(int c,int v,int d){\n if(used[v]) return;\n used[v]=true;\n if(d==2){ \n if(c!=v) ans++;\n }else{\n for(int i=0;i<MAX_V;i++){\n if(x[v][i]) dfs2(c,i,d+1);\n }\n }\n}\n\nint main(){\n int n,m,i,j,k,c=0,d=0;\n cin>>n>>m;\n int s=0,t=2*n+1;\n\n for(i=1;i<=n;i++){\n for(j=n+1;j<=n*2;j++){\n if(j-i==n) continue;\n add_edge(i,j,1);\n } \n }\n\n for(i=0;i<n;i++){\n cout << \"lst \" << i << endl;\n cin >> k;\n add_edge(s,i+1,k);\n add_edge(n+i+1,t,k);\n for(j=0;j<k;j++) cin >> c;\n }\n\n for(i=1;i<=n;i++){\n for(j=n+1;j<=n*2;j++){\n if(j-i==n) continue;\n add_edge(i,j,1);\n } \n }\n int e=max_flow(s,t);\n \n memset(x,0,sizeof(x));\n for(i=0;i<n;i++){\n for(j=0;j<G[i+1].size();j++){\n if(G[i+1][j].cap==0) x[G[i+1][j].to-n-1][i]=1;\n }\n }\n for(i=0;i<n;i++) memset(used,0,sizeof(used)),dfs2(i,i,0);\n cout << \"ans \"<< ans << endl;\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":80,"memory_kb":1796,"score_of_the_acc":-1.2615,"final_rank":17},{"submission_id":"aoj_2795_2001208","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<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 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\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntemplate<class T> using vv=vector<vector<T>>;\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"{\"; rep(i,t.size()) {os<<t[i]<<\",\";} os<<\"}\"<<endl; return os;}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\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;}\nconst ll MOD=1e9+7;\n\nint d[112][112];\n\nint main(){\n ios_base::sync_with_stdio(false);\n cout<<fixed<<setprecision(0);\n int n,m;\n cin>>n>>m;\n vv<int> g(n);\n if(m>3*n){\n rep(i,n){\n cout<<\"lst \"<<i<<endl;\n int t;\n cin>>t;\n vector<int> a(t,-1);\n rep(j,t){\n\tint x;\n\tcin>>x;\n\tif(x>=0) a[j]=x;\n }\n int f=0;\n rep(j,t) if(a[j]<0) f=1;\n while(f){\n\tcout<<\"lst \"<<i<<endl;\n\tcin>>f;\n\tf=0;\n\trep(j,t){\n\t int x;\n\t cin>>x;\n\t if(x>=0) a[j]=x;\n\t}\n\trep(j,t) if(a[j]<0) f=1;\n }\n g[i]=a;\n }\n }else{\n rep(i,m){\n cout<<\"edg \"<<i<<endl;\n int x,y;\n cin>>x>>y;\n g[x].pb(y);\n g[y].pb(x);\n }\n }\n //cout<<g;\n ll re=0;\n rep(i,n) for(int v:g[i]) re+=g[v].size()-1;\n cout<<\"ans \"<<re<<endl;\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":3104,"score_of_the_acc":-0.9142,"final_rank":12},{"submission_id":"aoj_2795_2001164","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_V 110\nint INF = 1 << 28;\nstruct edge{int to,cap,rev;};\nvector<edge> G[MAX_V*2+2];\nbool used[MAX_V*2+2];\nvoid add_edge(int from,int to,int cap){\n G[from].push_back((edge){to,cap,G[to].size()});\n G[to].push_back((edge){from,0,G[from].size()-1});\n}\n\nint dfs(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(e.to,t,min(f,e.cap));\n if(d>0){\n\te.cap-=d;\n\tG[e.to][e.rev].cap+=d;\n\treturn d;\n }\n } \n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow=0;\n for(;;){\n memset(used,0,sizeof(used));\n int f=dfs(s,t,INF);\n if(f==0) return flow;\n flow+=f;\n }\n}\n\nint x[MAX_V][MAX_V];\nint ans=0;\n\nvoid dfs2(int c,int v,int d){\n if(d==2){ \n if(c!=v) ans++;\n }else{\n for(int i=0;i<MAX_V;i++){\n if(x[v][i]) dfs2(c,i,d+1);\n }\n }\n}\n\nint main(){\n int n,m,i,j,k,c=0,d=0;\n cin>>n>>m;\n int s=0,t=2*n+1;\n for(i=0;i<n;i++){\n cout << \"lst \" << i << endl;\n cin >> k;\n add_edge(s,i+1,k);\n add_edge(n+i+1,t,k);\n for(j=0;j<k;j++) cin >> c;\n }\n for(i=1;i<=n;i++){\n for(j=n+1;j<=n*2;j++){\n if(j-i==n) continue;\n add_edge(i,j,1);\n } \n }\n int e=max_flow(s,t);\n \n memset(x,0,sizeof(x));\n for(i=0;i<n;i++){\n for(j=0;j<G[i+1].size();j++){\n if(G[i+1][j].cap==0) x[G[i+1][j].to-n-1][i]=1;\n }\n }\n for(i=0;i<n;i++) dfs2(i,i,0);\n cout << \"ans \"<< ans << endl;\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":20,"memory_kb":1592,"score_of_the_acc":-0.3025,"final_rank":7},{"submission_id":"aoj_2795_2001161","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n,m;\n cin>>n>>m;\n \n int ans=0;\n\n for(int i=0;i<n;i++){\n cout <<\"lst \"<<i<<endl;\n int a,b;\n cin>>a;\n for(int i=0;i<a;i++) cin>>b;\n ans+=a*(a-1);\n }\n cout <<\"ans \"<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1272,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2795_2001104","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef int _loop_int;\n#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)\n#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)\n#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define CHMIN(a,b) a=min((a),(b))\n#define CHMAX(a,b) a=max((a),(b))\n\n// mod\nconst ll MOD = 1000000007ll;\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\n// floating\ntypedef double Real;\nconst Real EPS = 1e-11;\n#define EQ0(x) (abs(x)<EPS)\n#define EQ(a,b) (abs(a-b)<EPS)\ntypedef complex<Real> P;\n\nint deg[125];\nint unko[125];\nint g[125][125];\n\nint main(){\n int n,m;\n cin>>n>>m;\n int cnt = 0;\n // first check\n REP(i,n){\n ++cnt;\n cout<<\"lst \"<<i<<endl;\n int k;\n cin>>k;\n deg[i] = k;\n unko[i] += k;\n REP(j,k){\n int to;\n cin>>to;\n if(to!=-1){\n if(g[i][to]==0){\n g[i][to] = 1;\n unko[i] -= 1;\n }\n if(g[to][i]==0){\n g[to][i] = 1;\n unko[to] -= 1;\n }\n }\n }\n }\n while(cnt < 3*n){\n int mx = 0;\n REP(i,n)if(unko[mx]<unko[i])mx=i;\n if(unko[mx]==0)break;\n ++cnt;\n cout<<\"lst \"<<mx<<endl;\n int k;\n cin>>k;\n REP(j,k){\n int to;\n cin>>to;\n if(to!=-1){\n if(g[mx][to]==0){\n g[mx][to] = 1;\n unko[mx] -= 1;\n }\n if(g[to][mx]==0){\n g[to][mx] = 1;\n unko[to] -= 1;\n }\n }\n }\n }\n int ans = 0;\n REP(i,n){\n REP(j,n)if(g[i][j])ans += deg[j]-1;\n }\n cout<<\"ans \"<<ans<<endl;\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":1280,"score_of_the_acc":-0.004,"final_rank":5},{"submission_id":"aoj_2795_2001061","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef int _loop_int;\n#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)\n#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)\n#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define CHMIN(a,b) a=min((a),(b))\n#define CHMAX(a,b) a=max((a),(b))\n\n// mod\nconst ll MOD = 1000000007ll;\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\n// floating\ntypedef double Real;\nconst Real EPS = 1e-11;\n#define EQ0(x) (abs(x)<EPS)\n#define EQ(a,b) (abs(a-b)<EPS)\ntypedef complex<Real> P;\n\nint deg[125];\nint known[125];\nvi unko;\nint g[125][125];\n\nint main(){\n int n,m;\n cin>>n>>m;\n REP(i,n)unko.push_back(i);\n bool first = true;\n while(true){\n // query\n REP(i,unko.size()){\n int x = unko[i];\n if(!first && known[x]==0)continue;\n cout<<\"lst \"<<x<<endl;\n int k;\n cin>>k;\n if(first){\n deg[x] = k;\n known[x] += k;\n }\n REP(j,k){\n int to;\n cin>>to;\n if(to>=0){\n if(g[x][to]==0){\n g[x][to] = 1;\n known[x] -= 1;\n }\n if(g[to][x]==0){\n g[to][x] = 1;\n known[to] -= 1;\n }\n }\n }\n }\n first = false;\n bool flag = true;\n vi nxt;\n REP(i,unko.size()){\n int x = unko[i];\n if(known[x]>0){\n nxt.push_back(x);\n flag = false;\n }\n }\n if(flag)break;\n unko = nxt;\n }\n int ans = 0;\n REP(i,n){\n REP(j,n)if(g[i][j])ans += deg[j]-1;\n }\n cout<<\"ans \"<<ans<<endl;\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":30,"memory_kb":1280,"score_of_the_acc":-0.2897,"final_rank":6},{"submission_id":"aoj_2795_2001050","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int N, M;\n int sz[100] = {};\n set< int > graph[100];\n set< pair< int, int > > sa;\n\n cin >> N >> M;\n\n if(N * 3 >= M) {\n for(int i = 0; i < M; i++) {\n cout << \"edg \" << i << endl;\n int a, b;\n cin >> a >> b;\n graph[a].insert(b);\n graph[b].insert(a);\n }\n } else {\n\n for(int i = 0; i < N; i++) {\n int k;\n cout << \"lst \" << i << endl;\n cin >> k;\n sz[i] = k;\n for(int j = 0; j < k; j++) {\n int v;\n cin >> v;\n if(~v) {\n graph[v].insert(i);\n graph[i].insert(v);\n }\n }\n }\n\n for(int i = 0; i < N; i++) {\n sa.emplace(sz[i] - graph[i].size(), i);\n }\n\n for(int _ = 0; _ * 2 < N; _++) {\n auto obj = *--sa.end();\n int i = obj.second;\n sa.erase(obj);\n if(graph[i].size() != sz[i]) {\n cout << \"lst \" << i << endl;\n int k;\n cin >> k;\n sz[i] = k;\n for(int j = 0; j < k; j++) {\n int v;\n cin >> v;\n if(~v) {\n graph[v].insert(i);\n graph[i].insert(v);\n }\n }\n }\n sa.emplace(sz[i] - graph[i].size(), i);\n }\n }\n\n int ret = 0;\n for(int i = 0; i < N; i++) {\n for(auto j : graph[i]) {\n set< int > gg;\n for(auto k : graph[j]) {\n if(i != k) gg.insert(k);\n }\n ret += gg.size();\n }\n }\n\n cout << \"ans \" << ret << endl;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":3276,"score_of_the_acc":-1,"final_rank":16},{"submission_id":"aoj_2795_2001031","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int N, M;\n int sz[100] = {};\n set< int > graph[100];\n set< pair< int, int > > sa;\n\n cin >> N >> M;\n\n for(int i = 0; i < N; i++) {\n int k;\n cout << \"lst \" << i << endl;\n cin >> k;\n sz[i] = k;\n for(int j = 0; j < k; j++) {\n int v;\n cin >> v;\n if(~v) {\n graph[v].insert(i);\n graph[i].insert(v);\n }\n }\n }\n\n for(int i = 0; i < N; i++) {\n sa.emplace(sz[i] - graph[i].size(), i);\n }\n\n for(int _ = 0; _ * 2 < N; _++) {\n auto obj = *--sa.end();\n int i = obj.second;\n sa.erase(obj);\n if(graph[i].size() != sz[i]) {\n cout << \"lst \" << i << endl;\n int k;\n cin >> k;\n sz[i] = k;\n for(int j = 0; j < k; j++) {\n int v;\n cin >> v;\n if(~v) {\n graph[v].insert(i);\n graph[i].insert(v);\n }\n }\n }\n sa.emplace(sz[i] - graph[i].size(), i);\n }\n\n int ret = 0;\n for(int i = 0; i < N; i++) {\n for(auto j : graph[i]) {\n set< int > gg;\n for(auto k : graph[j]) {\n if(i != k) gg.insert(k);\n }\n ret += gg.size();\n }\n }\n\n cout << \"ans \" << ret << endl;\n}","accuracy":0.024390243902439025,"time_ms":10,"memory_kb":3272,"score_of_the_acc":-0.998,"final_rank":15},{"submission_id":"aoj_2795_2000925","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define rrep(i,n) for(int i=(n)-1; i>=0; i--)\n\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n\tint N, M, c;\n\tll a[105], ans=0;\n\t\n\tcin >> N >> M;\n\n\trep(i,N){\n\t\tcout << \"lst \" << i << endl;\n\t\tcin >> a[i];\n\t\trep(j,a[i]) cin >> c;\n\t\tans += a[i] * (a[i]-1);\n\t}\n\n\tcout << \"ans \" << ans << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3108,"score_of_the_acc":-0.9162,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2795_2258530\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\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\\n#define INF 21474836\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n\\n vector<vector<int>> vec(n, vector<int>(n,0));\\n\\n if(3*n >=m){\\n rep(i,m){\\n cout << \\\"edg \\\" << i << endl;\\n int u,v;\\n cin>>u>>v;\\n vec[u][v]=1;\\n vec[v][u]=1;\\n }\\n }\\n else {\\n vector<int> k(n);\\n vector<int> hoge(n,0); // ?????\\\\????????°\\n\\n rep(i,n){\\n cout << \\\"lst \\\" << i << endl;\\n cin>>k[i];\\n rep(_,k[i]){\\n int d; cin>>d;\\n if(d==-1) hoge[i]++;\\n else {\\n vec[i][d]=1;\\n }\\n }\\n }\\n\\n rep(i,n)rep(j,i) if(vec[i][j] != vec[j][i]){\\n if(vec[i][j]==0){\\n vec[i][j] = 1;\\n hoge[i]--;\\n } else {\\n vec[j][i] = 1;\\n hoge[j]--;\\n }\\n }\\n\\n int cnt = 2*n;\\n\\n priority_queue<pair<int,int>> pq;\\n\\n rep(i,n) if(hoge[i]>0) pq.push(mp(hoge[i], i));\\n\\n while(!pq.empty() || cnt>0){\\n int i = pq.top().se; pq.pop();\\n if(hoge[i]==0) continue;\\n \\n cout << \\\"lst \\\" << i << endl;\\n cin>>k[i];\\n rep(__,k[i]){\\n int d; cin>>d;\\n if(d==-1) continue;\\n else {\\n if(vec[i][d]==0) hoge[i]--;\\n vec[i][d]=1;\\n if(vec[d][i]==0) hoge[d]--;\\n vec[d][i]=1;\\n }\\n }\\n cnt--;\\n if(hoge[i]>0) pq.push(mp(hoge[i], i));\\n }\\n }\\n\\n vector<vector<int>> &d = vec;\\n rep(i,n) rep(j,n) if(i!=j && d[i][j]==0) d[i][j] = INF;\\n rep(i,n) d[i][i]=0;\\n\\n rep(kk,n)rep(i,n)rep(j,n) d[i][j] = min(d[i][j], d[i][kk] + d[kk][j]);\\n\\n int ans =0;\\n rep(i,n) rep(j,n) if(d[i][j]==2) ans++;\\n\\n cout << \\\"ans \\\" << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 3040,\n \"score_of_the_acc\": -0.8822,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2795_2258528\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\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\\n#define INF 21474836\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n\\n vector<vector<int>> vec(n, vector<int>(n,0));\\n vector<int> k(n);\\n vector<int> hoge(n,0); // ?????\\\\????????°\\n\\n if(3*n >=m){\\n rep(i,m){\\n cout << \\\"edg \\\" << i << endl;\\n int u,v;\\n cin>>u>>v;\\n if(vec[u][v]==0){\\n vec[u][v]=1;\\n vec[v][u]=1;\\n hoge[u]--;\\n hoge[v]--;\\n }\\n }\\n }\\n else {\\n rep(i,n){\\n cout << \\\"lst \\\" << i << endl;\\n cin>>k[i];\\n rep(_,k[i]){\\n int d; cin>>d;\\n if(d==-1)hoge[i]++;\\n else {\\n vec[i][d]=1;\\n }\\n }\\n }\\n\\n rep(i,n)rep(j,i) if(vec[i][j] != vec[j][i]){\\n if(vec[i][j]==0){\\n vec[i][j] = 1;\\n hoge[i]--;\\n } else {\\n vec[j][i] = 1;\\n hoge[j]--;\\n }\\n }\\n\\n int cnt = 2*n;\\n\\n priority_queue<pair<int,int>> pq;\\n\\n rep(i,n) if(hoge[i]>0) pq.push(mp(hoge[i], i));\\n\\n while(!pq.empty() || cnt>0){\\n int i = pq.top().se; pq.pop();\\n cout << \\\"lst \\\" << i << endl;\\n cin>>k[i];\\n rep(__,k[i]){\\n int d; cin>>d;\\n if(d==-1) continue;\\n else {\\n if(vec[i][d]==0) hoge[i]--;\\n vec[i][d]=1;\\n if(vec[d][i]==0) hoge[d]--;\\n vec[d][i]=1;\\n }\\n }\\n cnt--;\\n if(hoge[i]>0) pq.push(mp(hoge[i], i));\\n }\\n }\\n\\n vector<vector<int>> &d = vec;\\n rep(i,n) rep(j,n) if(i!=j && d[i][j]==0) d[i][j] = INF;\\n rep(i,n) d[i][i]=0;\\n\\n rep(kk,n)rep(i,n)rep(j,n) d[i][j] = min(d[i][j], d[i][kk] + d[kk][j]);\\n\\n int ans =0;\\n rep(i,n) rep(j,n) if(d[i][j]==2) ans++;\\n\\n cout << \\\"ans \\\" << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 3072,\n \"score_of_the_acc\": -0.8982,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2795_2258496\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\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\\n#define INF 21474836\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n\\n vector<vector<int>> vec(n, vector<int>(n,0));\\n vector<int> k(n);\\n vector<int> hoge(n,0); // ?????\\\\????????°\\n\\n rep(i,n){\\n cout << \\\"lst \\\" << i << endl;\\n cin>>k[i];\\n rep(_,k[i]){\\n int d; cin>>d;\\n if(d==-1)hoge[i]++;\\n else {\\n vec[i][d]=1;\\n }\\n }\\n }\\n\\n rep(i,n)rep(j,i) if(vec[i][j] != vec[j][i]){\\n if(vec[i][j]==0){\\n vec[i][j] = 1;\\n hoge[i]--;\\n } else {\\n vec[j][i] = 1;\\n hoge[j]--;\\n }\\n }\\n\\n int cnt = 2*n;\\n\\n rep(_,100){\\n rep(i,n) if(cnt>0 && hoge[i]>0){\\n cout << \\\"lst \\\" << i << endl;\\n cin>>k[i];\\n rep(__,k[i]){\\n int d; cin>>d;\\n if(d==-1) continue;\\n else {\\n if(vec[i][d]==0) hoge[i]--;\\n vec[i][d]=1;\\n if(vec[d][i]==0) hoge[d]--;\\n vec[d][i]=1;\\n }\\n }\\n cnt--;\\n }\\n }\\n\\n vector<vector<int>> &d = vec;\\n rep(i,n) rep(j,n) if(i!=j && d[i][j]==0) d[i][j] = INF;\\n rep(i,n) d[i][i]=0;\\n\\n rep(kk,n)rep(i,n)rep(j,n) d[i][j] = min(d[i][j], d[i][kk] + d[kk][j]);\\n\\n int ans =0;\\n rep(i,n) rep(j,n) if(d[i][j]==2) ans++;\\n\\n cout << \\\"ans \\\" << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.9321,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2795_2001350\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int n,m,i,j,k,c=0,d=0,ans=0;\\n cin>>n>>m;\\n int s=0,t=2*n+1;\\n\\n for(i=0;i<n;i++){\\n cout << \\\"lst \\\" << i << endl;\\n cin >> k;\\n ans+=k*(k-1);\\n for(j=0;j<k;j++) cin >> c;\\n }\\n\\n cout << \\\"ans \\\"<< ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.004,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2795_2001261\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n int n,m,k;\\n int ans = 0;\\n cin >> n >> m;\\n for(int i = 0;i<n;i++){\\n cout << \\\"lst \\\" << i << endl;\\n cin >> k;\\n for(int j =0;j<k;j++) cin >> m;\\n ans += k*(k-1);\\n }\\n cout << \\\"ans \\\" << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.004,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2795_2001238\",\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_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 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\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\ntemplate<class T> using vv=vector<vector<T>>;\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"{\\\"; rep(i,t.size()) {os<<t[i]<<\\\",\\\";} os<<\\\"}\\\"<<endl; return os;}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\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;}\\nconst ll MOD=1e9+7;\\n\\nint d[112][112];\\n\\nint main(){\\n ios_base::sync_with_stdio(false);\\n cout<<fixed<<setprecision(0);\\n int n,m;\\n cin>>n>>m;\\n vv<int> g(n);\\n if(m>3*n){\\n rep(i,n){\\n cout<<\\\"lst \\\"<<i<<endl;\\n int t;\\n cin>>t;\\n unordered_set<int> st;\\n int hoge=0;\\n while(st.size()<t){\\n\\tif(hoge){ cout<<\\\"lst \\\"<<i<<endl;\\ncin>>hoge;\\n\\t}\\n\\thoge=1;\\n\\trep(j,t){\\n\\t int x;\\n\\t cin>>x;\\n\\t if(x>=0)\\n\\t st.insert(x);\\n\\t}\\n }\\n for(int x:st) g[i].pb(x);\\n }\\n assert(0);\\n }else{\\n rep(i,m){\\n cout<<\\\"edg \\\"<<i<<endl;\\n int x,y;\\n cin>>x>>y;\\n g[x].pb(y);\\n g[y].pb(x);\\n }\\n }\\n //cout<<g;\\n ll re=0;\\n rep(i,n) for(int v:g[i]) re+=g[v].size()-1;\\n cout<<\\\"ans \\\"<<re<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.9022,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2795_2001235\",\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_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 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\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\ntemplate<class T> using vv=vector<vector<T>>;\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"{\\\"; rep(i,t.size()) {os<<t[i]<<\\\",\\\";} os<<\\\"}\\\"<<endl; return os;}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\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;}\\nconst ll MOD=1e9+7;\\n\\nint d[112][112];\\n\\nint main(){\\n ios_base::sync_with_stdio(false);\\n cout<<fixed<<setprecision(0);\\n int n,m;\\n cin>>n>>m;\\n vv<int> g(n);\\n if(m>3*n){\\n rep(i,n){\\n cout<<\\\"lst \\\"<<i<<endl;\\n int t;\\n cin>>t;\\n unordered_set<int> st;\\n int hoge=0;\\n while(st.size()<t){\\n\\tif(hoge){ cout<<\\\"lst \\\"<<i<<endl;\\ncin>>hoge;\\n\\t}\\n\\thoge=1;\\n\\trep(j,t){\\n\\t int x;\\n\\t cin>>x;\\n\\t if(x>=0)\\n\\t st.insert(x);\\n\\t}\\n }\\n for(int x:st) g[i].pb(x);\\n }\\n }else{\\n rep(i,m){\\n cout<<\\\"edg \\\"<<i<<endl;\\n int x,y;\\n cin>>x>>y;\\n g[x].pb(y);\\n g[y].pb(x);\\n }\\n }\\n //cout<<g;\\n ll re=0;\\n rep(i,n) for(int v:g[i]) re+=g[v].size()-1;\\n cout<<\\\"ans \\\"<<re<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.9481,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2795_2001229\",\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_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 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\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\ntemplate<class T> using vv=vector<vector<T>>;\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"{\\\"; rep(i,t.size()) {os<<t[i]<<\\\",\\\";} os<<\\\"}\\\"<<endl; return os;}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\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;}\\nconst ll MOD=1e9+7;\\n\\nint d[112][112];\\n\\nint main(){\\n ios_base::sync_with_stdio(false);\\n cout<<fixed<<setprecision(0);\\n int n,m;\\n cin>>n>>m;\\n vv<int> g(n);\\n if(m>3*n){\\n rep(i,n){\\n cout<<\\\"lst \\\"<<i<<endl;\\n int t;\\n cin>>t;\\n unordered_set<int> st;\\n int hoge=0;\\n while(st.size()<t){\\n\\tif(hoge){ cout<<\\\"lst \\\"<<i<<endl;\\ncin>>hoge;\\n\\t}\\n\\thoge=1;\\n\\trep(j,t){\\n\\t int x;\\n\\t cin>>x;\\n\\t st.insert(x);\\n\\t}\\n }\\n for(int x:st) g[i].pb(x);\\n }\\n }else{\\n rep(i,m){\\n cout<<\\\"edg \\\"<<i<<endl;\\n int x,y;\\n cin>>x>>y;\\n g[x].pb(y);\\n g[y].pb(x);\\n }\\n }\\n //cout<<g;\\n ll re=0;\\n rep(i,n) for(int v:g[i]) re+=g[v].size()-1;\\n cout<<\\\"ans \\\"<<re<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.9122,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2795_2001220\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_V 110\\nint INF = 1 << 28;\\nstruct edge{int to,cap,rev;};\\nvector<edge> G[MAX_V*2+2];\\nbool used[MAX_V*2+2];\\nvoid add_edge(int from,int to,int cap){\\n G[from].push_back((edge){to,cap,G[to].size()});\\n G[to].push_back((edge){from,0,G[from].size()-1});\\n}\\n\\nint dfs(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(e.to,t,min(f,e.cap));\\n if(d>0){\\n\\te.cap-=d;\\n\\tG[e.to][e.rev].cap+=d;\\n\\treturn d;\\n }\\n } \\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow=0;\\n for(;;){\\n memset(used,0,sizeof(used));\\n int f=dfs(s,t,INF);\\n if(f==0) return flow;\\n flow+=f;\\n }\\n}\\n\\nint x[MAX_V][MAX_V];\\nint ans=0;\\n\\nvoid dfs2(int c,int v,int d){\\n if(used[v]) return;\\n used[v]=true;\\n if(d==2){ \\n if(c!=v) ans++;\\n }else{\\n for(int i=0;i<MAX_V;i++){\\n if(x[v][i]) dfs2(c,i,d+1);\\n }\\n }\\n}\\n\\nint main(){\\n int n,m,i,j,k,c=0,d=0;\\n cin>>n>>m;\\n int s=0,t=2*n+1;\\n\\n for(i=1;i<=n;i++){\\n for(j=n+1;j<=n*2;j++){\\n if(j-i==n) continue;\\n add_edge(i,j,1);\\n } \\n }\\n\\n for(i=0;i<n;i++){\\n cout << \\\"lst \\\" << i << endl;\\n cin >> k;\\n add_edge(s,i+1,k);\\n add_edge(n+i+1,t,k);\\n for(j=0;j<k;j++) cin >> c;\\n }\\n\\n for(i=1;i<=n;i++){\\n for(j=n+1;j<=n*2;j++){\\n if(j-i==n) continue;\\n add_edge(i,j,1);\\n } \\n }\\n int e=max_flow(s,t);\\n \\n memset(x,0,sizeof(x));\\n for(i=0;i<n;i++){\\n for(j=0;j<G[i+1].size();j++){\\n if(G[i+1][j].cap==0) x[G[i+1][j].to-n-1][i]=1;\\n }\\n }\\n for(i=0;i<n;i++) memset(used,0,sizeof(used)),dfs2(i,i,0);\\n cout << \\\"ans \\\"<< ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 80,\n \"memory_kb\": 1796,\n \"score_of_the_acc\": -1.2615,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2795_2001208\",\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<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 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\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\ntemplate<class T> using vv=vector<vector<T>>;\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"{\\\"; rep(i,t.size()) {os<<t[i]<<\\\",\\\";} os<<\\\"}\\\"<<endl; return os;}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\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;}\\nconst ll MOD=1e9+7;\\n\\nint d[112][112];\\n\\nint main(){\\n ios_base::sync_with_stdio(false);\\n cout<<fixed<<setprecision(0);\\n int n,m;\\n cin>>n>>m;\\n vv<int> g(n);\\n if(m>3*n){\\n rep(i,n){\\n cout<<\\\"lst \\\"<<i<<endl;\\n int t;\\n cin>>t;\\n vector<int> a(t,-1);\\n rep(j,t){\\n\\tint x;\\n\\tcin>>x;\\n\\tif(x>=0) a[j]=x;\\n }\\n int f=0;\\n rep(j,t) if(a[j]<0) f=1;\\n while(f){\\n\\tcout<<\\\"lst \\\"<<i<<endl;\\n\\tcin>>f;\\n\\tf=0;\\n\\trep(j,t){\\n\\t int x;\\n\\t cin>>x;\\n\\t if(x>=0) a[j]=x;\\n\\t}\\n\\trep(j,t) if(a[j]<0) f=1;\\n }\\n g[i]=a;\\n }\\n }else{\\n rep(i,m){\\n cout<<\\\"edg \\\"<<i<<endl;\\n int x,y;\\n cin>>x>>y;\\n g[x].pb(y);\\n g[y].pb(x);\\n }\\n }\\n //cout<<g;\\n ll re=0;\\n rep(i,n) for(int v:g[i]) re+=g[v].size()-1;\\n cout<<\\\"ans \\\"<<re<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.9142,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2795_2001164\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX_V 110\\nint INF = 1 << 28;\\nstruct edge{int to,cap,rev;};\\nvector<edge> G[MAX_V*2+2];\\nbool used[MAX_V*2+2];\\nvoid add_edge(int from,int to,int cap){\\n G[from].push_back((edge){to,cap,G[to].size()});\\n G[to].push_back((edge){from,0,G[from].size()-1});\\n}\\n\\nint dfs(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(e.to,t,min(f,e.cap));\\n if(d>0){\\n\\te.cap-=d;\\n\\tG[e.to][e.rev].cap+=d;\\n\\treturn d;\\n }\\n } \\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow=0;\\n for(;;){\\n memset(used,0,sizeof(used));\\n int f=dfs(s,t,INF);\\n if(f==0) return flow;\\n flow+=f;\\n }\\n}\\n\\nint x[MAX_V][MAX_V];\\nint ans=0;\\n\\nvoid dfs2(int c,int v,int d){\\n if(d==2){ \\n if(c!=v) ans++;\\n }else{\\n for(int i=0;i<MAX_V;i++){\\n if(x[v][i]) dfs2(c,i,d+1);\\n }\\n }\\n}\\n\\nint main(){\\n int n,m,i,j,k,c=0,d=0;\\n cin>>n>>m;\\n int s=0,t=2*n+1;\\n for(i=0;i<n;i++){\\n cout << \\\"lst \\\" << i << endl;\\n cin >> k;\\n add_edge(s,i+1,k);\\n add_edge(n+i+1,t,k);\\n for(j=0;j<k;j++) cin >> c;\\n }\\n for(i=1;i<=n;i++){\\n for(j=n+1;j<=n*2;j++){\\n if(j-i==n) continue;\\n add_edge(i,j,1);\\n } \\n }\\n int e=max_flow(s,t);\\n \\n memset(x,0,sizeof(x));\\n for(i=0;i<n;i++){\\n for(j=0;j<G[i+1].size();j++){\\n if(G[i+1][j].cap==0) x[G[i+1][j].to-n-1][i]=1;\\n }\\n }\\n for(i=0;i<n;i++) dfs2(i,i,0);\\n cout << \\\"ans \\\"<< ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 20,\n \"memory_kb\": 1592,\n \"score_of_the_acc\": -0.3025,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2795_2001161\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n \\n int ans=0;\\n\\n for(int i=0;i<n;i++){\\n cout <<\\\"lst \\\"<<i<<endl;\\n int a,b;\\n cin>>a;\\n for(int i=0;i<a;i++) cin>>b;\\n ans+=a*(a-1);\\n }\\n cout <<\\\"ans \\\"<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1272,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2795_2001104\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\ntypedef int _loop_int;\\n#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)\\n#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)\\n#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)\\n\\n#define DEBUG(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define DEBUG_VEC(v) cout<<#v<<\\\":\\\";REP(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl\\n#define ALL(a) (a).begin(),(a).end()\\n\\n#define CHMIN(a,b) a=min((a),(b))\\n#define CHMAX(a,b) a=max((a),(b))\\n\\n// mod\\nconst ll MOD = 1000000007ll;\\n#define FIX(a) ((a)%MOD+MOD)%MOD\\n\\n// floating\\ntypedef double Real;\\nconst Real EPS = 1e-11;\\n#define EQ0(x) (abs(x)<EPS)\\n#define EQ(a,b) (abs(a-b)<EPS)\\ntypedef complex<Real> P;\\n\\nint deg[125];\\nint unko[125];\\nint g[125][125];\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n int cnt = 0;\\n // first check\\n REP(i,n){\\n ++cnt;\\n cout<<\\\"lst \\\"<<i<<endl;\\n int k;\\n cin>>k;\\n deg[i] = k;\\n unko[i] += k;\\n REP(j,k){\\n int to;\\n cin>>to;\\n if(to!=-1){\\n if(g[i][to]==0){\\n g[i][to] = 1;\\n unko[i] -= 1;\\n }\\n if(g[to][i]==0){\\n g[to][i] = 1;\\n unko[to] -= 1;\\n }\\n }\\n }\\n }\\n while(cnt < 3*n){\\n int mx = 0;\\n REP(i,n)if(unko[mx]<unko[i])mx=i;\\n if(unko[mx]==0)break;\\n ++cnt;\\n cout<<\\\"lst \\\"<<mx<<endl;\\n int k;\\n cin>>k;\\n REP(j,k){\\n int to;\\n cin>>to;\\n if(to!=-1){\\n if(g[mx][to]==0){\\n g[mx][to] = 1;\\n unko[mx] -= 1;\\n }\\n if(g[to][mx]==0){\\n g[to][mx] = 1;\\n unko[to] -= 1;\\n }\\n }\\n }\\n }\\n int ans = 0;\\n REP(i,n){\\n REP(j,n)if(g[i][j])ans += deg[j]-1;\\n }\\n cout<<\\\"ans \\\"<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.004,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2795_2001061\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\ntypedef int _loop_int;\\n#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)\\n#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)\\n#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)\\n\\n#define DEBUG(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define DEBUG_VEC(v) cout<<#v<<\\\":\\\";REP(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl\\n#define ALL(a) (a).begin(),(a).end()\\n\\n#define CHMIN(a,b) a=min((a),(b))\\n#define CHMAX(a,b) a=max((a),(b))\\n\\n// mod\\nconst ll MOD = 1000000007ll;\\n#define FIX(a) ((a)%MOD+MOD)%MOD\\n\\n// floating\\ntypedef double Real;\\nconst Real EPS = 1e-11;\\n#define EQ0(x) (abs(x)<EPS)\\n#define EQ(a,b) (abs(a-b)<EPS)\\ntypedef complex<Real> P;\\n\\nint deg[125];\\nint known[125];\\nvi unko;\\nint g[125][125];\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n REP(i,n)unko.push_back(i);\\n bool first = true;\\n while(true){\\n // query\\n REP(i,unko.size()){\\n int x = unko[i];\\n if(!first && known[x]==0)continue;\\n cout<<\\\"lst \\\"<<x<<endl;\\n int k;\\n cin>>k;\\n if(first){\\n deg[x] = k;\\n known[x] += k;\\n }\\n REP(j,k){\\n int to;\\n cin>>to;\\n if(to>=0){\\n if(g[x][to]==0){\\n g[x][to] = 1;\\n known[x] -= 1;\\n }\\n if(g[to][x]==0){\\n g[to][x] = 1;\\n known[to] -= 1;\\n }\\n }\\n }\\n }\\n first = false;\\n bool flag = true;\\n vi nxt;\\n REP(i,unko.size()){\\n int x = unko[i];\\n if(known[x]>0){\\n nxt.push_back(x);\\n flag = false;\\n }\\n }\\n if(flag)break;\\n unko = nxt;\\n }\\n int ans = 0;\\n REP(i,n){\\n REP(j,n)if(g[i][j])ans += deg[j]-1;\\n }\\n cout<<\\\"ans \\\"<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 30,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.2897,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2795_2001050\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n int N, M;\\n int sz[100] = {};\\n set< int > graph[100];\\n set< pair< int, int > > sa;\\n\\n cin >> N >> M;\\n\\n if(N * 3 >= M) {\\n for(int i = 0; i < M; i++) {\\n cout << \\\"edg \\\" << i << endl;\\n int a, b;\\n cin >> a >> b;\\n graph[a].insert(b);\\n graph[b].insert(a);\\n }\\n } else {\\n\\n for(int i = 0; i < N; i++) {\\n int k;\\n cout << \\\"lst \\\" << i << endl;\\n cin >> k;\\n sz[i] = k;\\n for(int j = 0; j < k; j++) {\\n int v;\\n cin >> v;\\n if(~v) {\\n graph[v].insert(i);\\n graph[i].insert(v);\\n }\\n }\\n }\\n\\n for(int i = 0; i < N; i++) {\\n sa.emplace(sz[i] - graph[i].size(), i);\\n }\\n\\n for(int _ = 0; _ * 2 < N; _++) {\\n auto obj = *--sa.end();\\n int i = obj.second;\\n sa.erase(obj);\\n if(graph[i].size() != sz[i]) {\\n cout << \\\"lst \\\" << i << endl;\\n int k;\\n cin >> k;\\n sz[i] = k;\\n for(int j = 0; j < k; j++) {\\n int v;\\n cin >> v;\\n if(~v) {\\n graph[v].insert(i);\\n graph[i].insert(v);\\n }\\n }\\n }\\n sa.emplace(sz[i] - graph[i].size(), i);\\n }\\n }\\n\\n int ret = 0;\\n for(int i = 0; i < N; i++) {\\n for(auto j : graph[i]) {\\n set< int > gg;\\n for(auto k : graph[j]) {\\n if(i != k) gg.insert(k);\\n }\\n ret += gg.size();\\n }\\n }\\n\\n cout << \\\"ans \\\" << ret << endl;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 3276,\n \"score_of_the_acc\": -1,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2795_2001031\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n int N, M;\\n int sz[100] = {};\\n set< int > graph[100];\\n set< pair< int, int > > sa;\\n\\n cin >> N >> M;\\n\\n for(int i = 0; i < N; i++) {\\n int k;\\n cout << \\\"lst \\\" << i << endl;\\n cin >> k;\\n sz[i] = k;\\n for(int j = 0; j < k; j++) {\\n int v;\\n cin >> v;\\n if(~v) {\\n graph[v].insert(i);\\n graph[i].insert(v);\\n }\\n }\\n }\\n\\n for(int i = 0; i < N; i++) {\\n sa.emplace(sz[i] - graph[i].size(), i);\\n }\\n\\n for(int _ = 0; _ * 2 < N; _++) {\\n auto obj = *--sa.end();\\n int i = obj.second;\\n sa.erase(obj);\\n if(graph[i].size() != sz[i]) {\\n cout << \\\"lst \\\" << i << endl;\\n int k;\\n cin >> k;\\n sz[i] = k;\\n for(int j = 0; j < k; j++) {\\n int v;\\n cin >> v;\\n if(~v) {\\n graph[v].insert(i);\\n graph[i].insert(v);\\n }\\n }\\n }\\n sa.emplace(sz[i] - graph[i].size(), i);\\n }\\n\\n int ret = 0;\\n for(int i = 0; i < N; i++) {\\n for(auto j : graph[i]) {\\n set< int > gg;\\n for(auto k : graph[j]) {\\n if(i != k) gg.insert(k);\\n }\\n ret += gg.size();\\n }\\n }\\n\\n cout << \\\"ans \\\" << ret << endl;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 10,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -0.998,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2795_2000925\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define rrep(i,n) for(int i=(n)-1; i>=0; i--)\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\nint main(){\\n\\tint N, M, c;\\n\\tll a[105], ans=0;\\n\\t\\n\\tcin >> N >> M;\\n\\n\\trep(i,N){\\n\\t\\tcout << \\\"lst \\\" << i << endl;\\n\\t\\tcin >> a[i];\\n\\t\\trep(j,a[i]) cin >> c;\\n\\t\\tans += a[i] * (a[i]-1);\\n\\t}\\n\\n\\tcout << \\\"ans \\\" << ans << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3108,\n \"score_of_the_acc\": -0.9162,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1683,"cells":{"group_id":{"kind":"string","value":"aoj_2790_cpp"},"problem_description":{"kind":"string","value":"Non-redundant Drive\nThe people of JAG kingdom hate redundancy. For example, the N cities in JAG kingdom are connected with just $N - 1$ bidirectional roads such that any city is reachable from any city through some roads. Under the condition, the number of paths from a city to another city is exactly one for all pairs of the cities. This is a non-redundant road network :)\nOne day, you, a citizen of JAG kingdom, decided to travel as many cities in the kingdom as possible with a car. The car that you will use has an infinitely large tank, but initially the tank is empty. The fuel consumption of your car is 1 liter per 1 km, i.e. it consumes 1 liter of gasoline to move 1 km.\nEach city has exactly one gas station, and you can supply $g_x$ liters of gasoline to your car at the gas station of the city $x$. Of course, you have a choice not to visit some of the gas stations in your travel. But you will not supply gasoline twice or more at the same gas station, because it is redundant. Each road in the kingdom has a distance between two cities: the distance of $i$-th road is $d_i$ km. You will not pass the same city or the same road twice or more, of course, because it is redundant.\nIf a quantity of stored gasoline becomes zero, the car cannot move, and hence your travel will end there. But then, you may concern about an initially empty tank. Don't worry. You can start at any gas station of the cities in the kingdom. Furthermore, each road directly connects the gas stations of the its two ends (because the spirit of non-redundancy avoids redundant moves in a city), you therefore can supply gasoline to your car even if your car tank becomes empty just when you arrive the city.\nYour task is to write a program computing the maximum number of cities so that you can travel under your non-redundancy policy.\nInput\nThe input consists of a single test case.\n$N$\n$g_1$ $g_2$ ... $g_N$\n$a_1$ $b_1$ $d_1$\n$a_2$ $b_2$ $d_2$\n...\n$a_{N-1}$ $b_{N-1}$ $d_{N-1}$\nThe first line contains an integer $N$ ($1 \\leq N \\leq 100,000$), which is the number of cities in JAG kingdom. The second line contains $N$ integers: the $i$-th of them is $g_i$ ($1 \\leq g_i \\leq 10,000$), the amount of gasoline can be supplied at the gas station of the city $i$. The following $N - 1$ lines give information of roads: the $j$-th line of them contains $a_j$ and $b_j$ , which indicates that the $j$-th road bidirectionally connects the cities $a_j$ and $b_j$ ($1 \\leq a_j, b_j \\leq N, a_j \\ne b_j$) with distance $d_j$ ($1 \\leq d_j \\leq 10,000$). You can assume that all cities in the kingdom are connected by the roads.\nOutput\nPrint the maximum number of cities you can travel from any city under the constraint such that you can supply gasoline at most once per a gas station.\nSample Input 1\n5\n5 8 1 3 5\n1 2 4\n2 3 3\n2 4 3\n1 5 7\nOutput for the Sample Input 1\n4\nSample Input 2\n2\n10 1\n1 2 10\nOutput for the Sample Input 2\n2\nSample Input 3\n5\n1 3 5 1 1\n1 2 5\n2 3 3\n2 4 3\n1 5 5\nOutput for the Sample Input 3\n3"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2790_10907762","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i,n) for(ll i=0; i<ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B> void chmax(A& l, const B& r){ if(l < r) l = r; }\ntemplate <class A, class B> void chmin(A& l, const B& r){ if(r < l) l = r; }\n\n\nvoid testcase(){\n ll N; cin >> N;\n V<ll> G(N); REP(i,N) cin >> G[i];\n V<V<pair<ll,ll>>> adj(N);\n REP(i,N-1){\n ll a,b,d; cin >> a >> b >> d; a--; b--;\n adj[a].push_back({b,d});\n adj[b].push_back({a,d});\n }\n \n V<ll> par(N, -1);\n V<ll> sz(N, 1);\n {\n auto dfs = [&](auto& dfs, ll v, ll p) -> void {\n for(auto [w,d] : adj[v]) if(w != p){\n par[w] = v; dfs(dfs, w, v); sz[v] += sz[w];\n }\n }; dfs(dfs, 0, -1);\n }\n auto findCentroid = [&](ll& v) -> void {\n while(1){\n ll nx = -1;\n for(auto [w,d] : adj[v]) if(sz[w] * 2 > sz[v]) nx = w;\n if(nx < 0) break;\n ll w = nx;\n par[v] = w; par[w] = -1;\n sz[v] -= sz[w]; sz[w] += sz[v];\n v = w;\n }\n };\n ll ans = 1;\n V<ll> req(N+2, INF);\n req[0] = -INF;\n auto update_req = [&](auto& dfs, ll v, ll minpt, ll pt, ll dist) -> void {\n chmin(minpt, pt);\n chmin(req[dist], -minpt);\n for(auto [w,d] : adj[v]) if(sz[w] && w != par[v]){\n dfs(dfs, w, minpt, pt+G[v]-d, dist+1);\n }\n };\n auto update_ans = [&](auto& dfs, ll v, ll bottom, ll pt, ll dist)-> void {\n if(0 <= bottom) chmax(ans, dist + ll(upper_bound(req.begin(), req.end(), pt) - req.begin()));\n for(auto [w,d] : adj[v]) if(sz[w] && w != par[v]){\n dfs(dfs, w, min<ll>(0, bottom + G[w] - d), pt+G[w]-d, dist+1);\n }\n };\n auto dfs = [&](auto& dfs, ll v) -> void {\n findCentroid(v);\n REP(tt,2){\n REP(i,sz[v]+1) req[i+1] = INF;\n for(auto [w,d] : adj[v]) if(sz[w]){\n update_ans(update_ans, w, min<ll>(0, G[w] - d), G[w]-d, 1);\n update_req(update_req, w, 0, G[v]-d, 1);\n }\n chmax(ans, ll(upper_bound(req.begin(), req.end(), 0) - req.begin()));\n reverse(adj[v].begin(), adj[v].end());\n }\n sz[v] = 0;\n for(auto [w,d] : adj[v]) if(sz[w]) { par[w] = -1; dfs(dfs, w); }\n };\n dfs(dfs, 0);\n cout << ans << \"\\n\";\n}\n\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n testcase();\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":18204,"score_of_the_acc":-0.3982,"final_rank":1},{"submission_id":"aoj_2790_10865776","code_snippet":"#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<vector>\nusing namespace std;\nstruct bian{\n\tint next,point,w;\n}b[210000];\nint p[110000],n,len,g[110000],pd[110000],size[110000],where,now,bo[110000],ans;\nstruct atom{\n\tint where,w;\n\tlong long f;\n};\nvector<atom>A,B;\nvoid ade(int k1,int k2,int k3){\n\tb[++len]=(bian){p[k1],k2,k3}; p[k1]=len;\n}\nvoid add(int k1,int k2,int k3){\n\tade(k1,k2,k3); ade(k2,k1,k3);\n}\nint dfs1(int k1,int k2){\n\tsize[k1]=1;\n\tfor (int i=p[k1];i;i=b[i].next){\n\t\tint j=b[i].point;\n\t\tif (pd[j]==0&&j!=k2) size[k1]+=dfs1(j,k1);\n\t}\n\treturn size[k1];\n}\nvoid dfs2(int k1,int k2){\n\tint num=n-size[k1];\n\tfor (int i=p[k1];i;i=b[i].next){\n\t\tint j=b[i].point;\n\t\tif (pd[j]==0&&j!=k2){\n\t\t\tnum=max(num,size[j]); dfs2(j,k1);\n\t\t}\n\t}\n\tif (now>num){\n\t\tnow=num; where=k1;\n\t}\n}\nvoid dfs3(int k1,int k2,long long dis,long long mi,int size,int w){\n\tdis+=g[k1]; mi+=g[k1]; mi=min(mi,0ll);\n//\tcout<<k1<<\" \"<<k2<<\" \"<<dis<<\" \"<<mi<<\" \"<<size<<\" \"<<w<<endl;\n\tif (mi>=0)\n\t\tA.push_back((atom){w,size,dis});\n\tfor (int i=p[k1];i;i=b[i].next){\n\t\tint j=b[i].point;\n\t\tif (j!=k2&&pd[j]==0)\n\t\t\tdfs3(j,k1,dis-b[i].w,mi-b[i].w,size+1,w);\n\t}\n}\nvoid dfs4(int k1,int k2,long long dis,long long mi,int size,int w){\n\tmi=min(mi,dis); dis+=g[k1];\n\tB.push_back((atom){w,size,mi});\n\tfor (int i=p[k1];i;i=b[i].next){\n\t\tint j=b[i].point;\n\t\tif (j!=k2&&pd[j]==0) dfs4(j,k1,dis-b[i].w,mi,size+1,w);\n\t}\n}\nint compare(atom k1,atom k2){\n\treturn k1.f<k2.f;\n}\nvoid solve(int k1){\n\tn=dfs1(k1,0); now=n+1; where=0; dfs2(k1,0); int k=where;\n\tbo[k]=k; pd[k]=1; A.clear(); B.clear(); //cout<<\"solve \"<<k<<endl;\n\tA.push_back((atom){k,1,g[k]});\n\tB.push_back((atom){k,0,0});\n\tfor (int i=p[k];i;i=b[i].next){\n\t\tint j=b[i].point;\n\t\tif (pd[j]==0){\n\t\t\tdfs3(j,k,g[k]-b[i].w,-b[i].w,2,j);\n\t\t\tdfs4(j,k,-b[i].w,-b[i].w,1,j);\n\t\t}\n\t}\n\tsort(A.begin(),A.end(),compare);\n\tsort(B.begin(),B.end(),compare);\n/*\tcout<<\"A\"<<endl;\n\tfor (int i=0;i<A.size();i++) cout<<A[i].where<<\" \"<<A[i].w<<\" \"<<A[i].f<<endl;\n\tcout<<\"B\"<<endl;\n\tfor (int i=0;i<B.size();i++) cout<<B[i].where<<\" \"<<B[i].w<<\" \"<<B[i].f<<endl;*/\n\tint now=A.size()-1,where=0,f=-1e9,g=-1e9;\n\tfor (int i=0;i<B.size();i++){\n\t\twhile (now>=0&&A[now].f+B[i].f>=0){\n\t\t\tint k1=A[now].where;\n\t\t\tif (k1==where) f=max(f,A[now].w);\n\t\t\telse if (A[now].w>f){\n\t\t\t\twhere=A[now].where; g=f; f=A[now].w;\n\t\t\t} else g=max(g,A[now].w);\n\t\t\tnow--;\n\t\t}\n\t\tif (B[i].where==where) ans=max(ans,g+B[i].w); else ans=max(ans,f+B[i].w);\n\t}\n\tfor (int i=p[k];i;i=b[i].next){\n\t\tint j=b[i].point;\n\t\tif (pd[j]==0) solve(j);\n\t}\n}\nint main(){\n\tscanf(\"%d\",&n);\n\tfor (int i=1;i<=n;i++) scanf(\"%d\",&g[i]);\n\tfor (int i=1;i<n;i++){\n\t\tint k1,k2,k3; scanf(\"%d%d%d\",&k1,&k2,&k3); add(k1,k2,k3);\n\t}\n\tans=1;\n\tsolve(1);\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}","accuracy":1,"time_ms":140,"memory_kb":15412,"score_of_the_acc":-0.4636,"final_rank":2},{"submission_id":"aoj_2790_8324178","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1012345678;\n\nstruct edge_base {\n\tint va, vb, cost;\n};\n\nstruct edge {\n\tint to, cost;\n};\n\nstruct state {\n\tint depth, current, bottom;\n};\n\nstring to_string(const vector<int>& arr) {\n\tstring res = \"[\";\n\tfor (int i = 0; i < arr.size(); i++) {\n\t\tif (i != 0) {\n\t\t\tres += \", \";\n\t\t}\n\t\tres += to_string(arr[i]);\n\t}\n\tres += \"]\";\n\treturn res;\n}\n\nint solve(int N, const vector<int>& A, const vector<edge_base>& E) {\n\t// step #1. make graph\n\tvector<vector<edge> > G(N);\n\tfor (edge_base e : E) {\n\t\tG[e.va].push_back(edge{e.vb, e.cost});\n\t\tG[e.vb].push_back(edge{e.va, e.cost});\n\t}\n\n\t// step #2. find centroid\n\tint root = -1;\n\tvector<int> subsize(N, 1);\n\tauto find_centroid = [&](auto& self, int pos, int pre) -> void {\n\t\tbool flag = true;\n\t\tfor (edge e : G[pos]) {\n\t\t\tif (e.to != pre) {\n\t\t\t\tself(self, e.to, pos);\n\t\t\t\tsubsize[pos] += subsize[e.to];\n\t\t\t\tif (subsize[e.to] * 2 > N) {\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (flag && subsize[pos] * 2 >= N) {\n\t\t\troot = pos;\n\t\t}\n\t};\n\tfind_centroid(find_centroid, 0, -1);\n\n\t// step #3. build tree\n\tvector<int> comp(N, -1);\n\tvector<vector<edge> > child(N);\n\tauto build_tree = [&](auto& self, int pos, int pre) -> void {\n\t\tfor (edge e : G[pos]) {\n\t\t\tif (e.to != pre) {\n\t\t\t\tcomp[e.to] = comp[pos];\n\t\t\t\tchild[pos].push_back(e);\n\t\t\t\tself(self, e.to, pos);\n\t\t\t}\n\t\t}\n\t};\n\tint K = G[root].size();\n\tchild[root] = G[root];\n\tfor (int i = 0; i < K; i++) {\n\t\tcomp[G[root][i].to] = i;\n\t\tbuild_tree(build_tree, G[root][i].to, root);\n\t}\n\n\t// step #4. dynamic programming\n\tvector<state> dp1(N), dp2(N);\n\tauto dfs = [&](auto& self, int pos) -> void {\n\t\tfor (edge e : child[pos]) {\n\t\t\tstate u1 = dp1[pos];\n\t\t\tu1.depth += 1;\n\t\t\tu1.current += A[e.to] - e.cost;\n\t\t\tu1.bottom += A[e.to] - e.cost;\n\t\t\tu1.bottom = min(u1.bottom, 0);\n\t\t\tstate u2 = dp2[pos];\n\t\t\tu2.depth += 1;\n\t\t\tu2.current += A[pos] - e.cost;\n\t\t\tu2.bottom = min(u2.bottom, u2.current);\n\t\t\tdp1[e.to] = u1;\n\t\t\tdp2[e.to] = u2;\n\t\t\tself(self, e.to);\n\t\t}\n\t};\n\tdp1[root] = state{0, 0, 0};\n\tdp2[root] = state{0, 0, 0};\n\tdfs(dfs, root);\n\n\t// step #5. calculate answer passing root\n\tint subanswer1 = -INF;\n\tvector<array<int, 3> > qs;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (dp1[i].bottom >= 0) {\n\t\t\tqs.push_back({dp1[i].current, 1, i});\n\t\t}\n\t\tqs.push_back({-dp2[i].bottom, 0, i});\n\t}\n\tsort(qs.begin(), qs.end());\n\tset<pair<int, int> > s;\n\tvector<int> compmax(K, -1);\n\tfor (array<int, 3> v : qs) {\n\t\tif (v[1] == 0) {\n\t\t\tif (comp[v[2]] == -1 || compmax[comp[v[2]]] < dp2[v[2]].depth) {\n\t\t\t\ts.insert(make_pair(dp2[v[2]].depth, comp[v[2]]));\n\t\t\t\tif (comp[v[2]] != -1) {\n\t\t\t\t\ts.erase(make_pair(compmax[comp[v[2]]], comp[v[2]]));\n\t\t\t\t\tcompmax[comp[v[2]]] = dp2[v[2]].depth;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tset<pair<int, int> >::iterator it = s.end();\n\t\t\tif (it != s.begin()) {\n\t\t\t\t--it;\n\t\t\t\tif (it->second == -1 || it->second != comp[v[2]]) {\n\t\t\t\t\tsubanswer1 = max(subanswer1, it->first + dp1[v[2]].depth + 1);\n\t\t\t\t}\n\t\t\t\telse if (it != s.begin()) {\n\t\t\t\t\t--it;\n\t\t\t\t\tsubanswer1 = max(subanswer1, it->first + dp1[v[2]].depth + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// step #6. divide into subproblems\n\tvector<vector<int> > subcomp(K);\n\tfor (int i = 0; i < N; i++) {\n\t\tif (i != root) {\n\t\t\tsubcomp[comp[i]].push_back(i);\n\t\t}\n\t}\n\tvector<vector<int> > suba(K);\n\tvector<vector<edge_base> > sube(K);\n\tfor (int i = 0; i < K; i++) {\n\t\tsuba[i].resize(subcomp[i].size());\n\t\tfor (int j = 0; j < subcomp[i].size(); j++) {\n\t\t\tsuba[i][j] = A[subcomp[i][j]];\n\t\t}\n\t}\n\tfor (int i = 0; i < N - 1; i++) {\n\t\tif (comp[E[i].va] == comp[E[i].vb]) {\n\t\t\tint id = comp[E[i].va];\n\t\t\tint nva = lower_bound(subcomp[id].begin(), subcomp[id].end(), E[i].va) - subcomp[id].begin();\n\t\t\tint nvb = lower_bound(subcomp[id].begin(), subcomp[id].end(), E[i].vb) - subcomp[id].begin();\n\t\t\tsube[id].push_back(edge_base{nva, nvb, E[i].cost});\n\t\t}\n\t}\n\tint subanswer2 = -INF;\n\tfor (int i = 0; i < K; i++) {\n\t\tint res = solve(subcomp[i].size(), suba[i], sube[i]);\n\t\tsubanswer2 = max(subanswer2, res);\n\t}\n\n\treturn max(subanswer1, subanswer2);\n}\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<int> A(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n\tvector<edge_base> E(N - 1);\n\tfor (int i = 0; i < N - 1; i++) {\n\t\tcin >> E[i].va >> E[i].vb >> E[i].cost;\n\t\tE[i].va -= 1;\n\t\tE[i].vb -= 1;\n\t}\n\tint ans = solve(N, A, E);\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":490,"memory_kb":52592,"score_of_the_acc":-1.9863,"final_rank":8},{"submission_id":"aoj_2790_6668720","code_snippet":"#line 1 \"e.cpp\"\n#line 1 \"e.cpp\"\n/*\tauthor: Kite_kuma\n\tcreated: 2022.05.30 15:48:54 */\n\n#line 2 \"SPJ-Library/graph/graph.hpp\"\n#include <algorithm>\n#include <cassert>\n#include <deque>\n#include <iostream>\n#include <queue>\n#include <tuple>\n#include <vector>\n\n#pragma region graph\n\ntemplate <class cost_type = long long>\nclass graph {\n public:\n\tstruct edge {\n\t public:\n\t\tint from, to;\n\t\tcost_type cost;\n\t\tint id;\n\t\tedge() = default;\n\t\tedge(int from_, int to_, cost_type cost_ = 1, int id_ = -1) : from(from_), to(to_), cost(cost_), id(id_) {}\n\t\tbool operator<(const edge &a) const { return cost < a.cost; }\n\t\tbool operator>(const edge &a) const { return cost > a.cost; }\n\t\tfriend std::ostream &operator<<(std::ostream &s, const edge &a) {\n\t\t\ts << '(' << a.from << \" -> \" << a.to << \"), cost: \" << a.cost << \", id: \" << a.id;\n\t\t\treturn s;\n\t\t}\n\t};\n\n private:\n\tstd::vector<std::vector<edge>> edges;\n\tint next_edge_id = 0;\n\n public:\n\tinline const std::vector<edge> &operator[](int k) const { return edges[k]; }\n\tinline std::vector<edge> &operator[](int k) { return edges[k]; }\n\n\tint size() const { return int(edges.size()); }\n\tvoid resize(const int n) { edges.resize(n); }\n\tint edge_count() const { return next_edge_id; }\n\n\tfriend std::ostream &operator<<(std::ostream &s, const graph<cost_type> &g) {\n\t\tfor(const auto &adj : g.edges)\n\t\t\tfor(const auto &ed : adj) s << ed << '\\n';\n\t\treturn s;\n\t}\n\n\tgraph() = default;\n\tgraph(int n) : edges(n) {}\n\tgraph(int n, int e, bool weight = 0, bool directed = 0, int idx = 1) : edges(n) { input(e, weight, directed, idx); }\n\tconst cost_type INF = std::numeric_limits<cost_type>::max() / 3;\n\n\tvoid input(int e = -1, bool weight = false, bool directed = false, int idx = 1) {\n\t\tif(e == -1) e = size() - 1;\n\t\twhile(e--) {\n\t\t\tint u, v;\n\t\t\tstd::cin >> u >> v;\n\t\t\tcost_type cost = 1;\n\t\t\tif(weight) std::cin >> cost;\n\t\t\tadd_edge(u, v, cost, directed, idx);\n\t\t}\n\t}\n\n\tinline int add_edge(int u, int v, cost_type cost = 1, bool directed = false, int idx = 0) {\n\t\tu -= idx, v -= idx;\n\t\tedges[u].emplace_back(u, v, cost, next_edge_id);\n\t\tif(!directed && u != v) edges[v].emplace_back(v, u, cost, next_edge_id);\n\t\treturn next_edge_id++;\n\t}\n\n\t// Ο(V+E)\n\tstd::vector<cost_type> bfs(int s) const {\n\t\tstd::vector<cost_type> dist(size(), INF);\n\t\tstd::queue<int> que;\n\t\tdist[s] = 0;\n\t\tque.push(s);\n\t\twhile(!que.empty()) {\n\t\t\tint v = que.front();\n\t\t\tque.pop();\n\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\tif(dist[e.to] != INF) continue;\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tque.push(e.to);\n\t\t\t}\n\t\t}\n\t\treturn dist;\n\t}\n\n\t// Ο(V+E)\n\t// constraint: cost of each edge is zero or x (>= 0)\n\tstd::vector<cost_type> zero_one_bfs(int s) const {\n\t\tstd::vector<cost_type> dist(size(), INF);\n\t\tstd::deque<int> deq;\n\t\tdist[s] = 0;\n\t\tdeq.push_back(s);\n\t\twhile(!deq.empty()) {\n\t\t\tint v = deq.front();\n\t\t\tdeq.pop_front();\n\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\tif(dist[e.to] > dist[v] + e.cost) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\te.cost ? deq.push_back(e.to) : deq.push_front(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dist;\n\t}\n\n\t// Ο((E+V) lg E)\n\t// unreachable: INF\n\tstd::vector<cost_type> dijkstra(int s) const {\n\t\tstd::vector<cost_type> dist(size(), INF);\n\t\tconst auto compare = [](const std::pair<cost_type, int> &a, const std::pair<cost_type, int> &b) { return a.first > b.first; };\n\t\tstd::priority_queue<std::pair<cost_type, int>, std::vector<std::pair<cost_type, int>>, decltype(compare)> que{compare};\n\t\tdist[s] = 0;\n\t\tque.emplace(0, s);\n\t\twhile(!que.empty()) {\n\t\t\tstd::pair<cost_type, int> p = que.top();\n\t\t\tque.pop();\n\t\t\tint v = p.second;\n\t\t\tif(dist[v] < p.first) continue;\n\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\tif(dist[e.to] > dist[v] + e.cost) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\tque.emplace(dist[e.to], e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dist;\n\t}\n\n\t// Ο(VE)\n\t// unreachable: INF\n\t// reachable via negative cycle: -INF\n\tstd::vector<cost_type> bellman_ford(int s) const {\n\t\tint n = size();\n\t\tstd::vector<cost_type> res(n, INF);\n\t\tres[s] = 0;\n\t\tfor(int loop = 0; loop < n - 1; loop++) {\n\t\t\tfor(int v = 0; v < n; v++) {\n\t\t\t\tif(res[v] == INF) continue;\n\t\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\t\tres[e.to] = std::min(res[e.to], res[v] + e.cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstd::queue<int> que;\n\t\tstd::vector<int> chk(n);\n\t\tfor(int v = 0; v < n; v++) {\n\t\t\tif(res[v] == INF) continue;\n\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\tif(res[e.to] > res[v] + e.cost and !chk[e.to]) {\n\t\t\t\t\tque.push(e.to);\n\t\t\t\t\tchk[e.to] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile(!que.empty()) {\n\t\t\tint now = que.front();\n\t\t\tque.pop();\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(!chk[e.to]) {\n\t\t\t\t\tchk[e.to] = 1;\n\t\t\t\t\tque.push(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tif(chk[i]) res[i] = -INF;\n\t\treturn res;\n\t}\n\n\t// Ο(V^3)\n\tstd::vector<std::vector<cost_type>> warshall_floyd() const {\n\t\tconst int n = size();\n\t\tstd::vector<std::vector<cost_type>> dist(n, std::vector<cost_type>(n, INF));\n\t\tfor(int i = 0; i < n; i++) dist[i][i] = 0;\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(auto &e : edges[i]) dist[i][e.to] = std::min(dist[i][e.to], e.cost);\n\t\tfor(int k = 0; k < n; k++)\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tif(dist[i][k] == INF) continue;\n\t\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\t\tif(dist[k][j] == INF) continue;\n\t\t\t\t\tdist[i][j] = std::min(dist[i][j], dist[i][k] + dist[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\treturn dist;\n\t}\n\n\t// Ο(V) (using DFS)\n\t// if a cycle exists, return {}\n\tstd::vector<int> topological_sort() const {\n\t\tstd::vector<int> res;\n\t\tstd::vector<int> used(size(), 0);\n\t\tbool not_DAG = false;\n\t\tauto dfs = [&](auto self, int k) -> void {\n\t\t\tif(not_DAG) return;\n\t\t\tif(used[k]) {\n\t\t\t\tif(used[k] == 1) not_DAG = true;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tused[k] = 1;\n\t\t\tfor(auto &e : edges[k]) self(self, e.to);\n\t\t\tused[k] = 2;\n\t\t\tres.push_back(k);\n\t\t};\n\t\tfor(int i = 0; i < size(); i++) dfs(dfs, i);\n\t\tif(not_DAG) return std::vector<int>{};\n\t\tstd::reverse(res.begin(), res.end());\n\t\treturn res;\n\t}\n\n\tbool is_dag() const { return !topological_sort().empty(); }\n\n\t// Ο(V)\n\t// array of the distance to the most distant vertex\n\t// constraint: the graph is a tree\n\tstd::vector<cost_type> height() const {\n\t\tauto vec1 = bfs(0);\n\t\tint v1 = -1, v2 = -1;\n\t\tcost_type dia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec1[i]) dia = vec1[i], v1 = i;\n\t\tvec1 = bfs(v1);\n\t\tdia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec1[i]) dia = vec1[i], v2 = i;\n\t\tauto vec2 = bfs(v2);\n\t\tfor(int i = 0; i < int(size()); i++) {\n\t\t\tif(vec1[i] < vec2[i]) vec1[i] = vec2[i];\n\t\t}\n\t\treturn vec1;\n\t}\n\n\t// O(V+E)\n\t// vector<(int)(0 or 1)>\n\t// if it is not bipartite, return {}\n\tstd::vector<int> bipartite_grouping() const {\n\t\tstd::vector<int> colors(size(), -1);\n\t\tauto dfs = [&](auto self, int now, int col) -> bool {\n\t\t\tcolors[now] = col;\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(col == colors[e.to]) return false;\n\t\t\t\tif(colors[e.to] == -1 and !self(self, e.to, !col)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(!colors[i] and !dfs(dfs, i, 0)) return std::vector<int>{};\n\t\treturn colors;\n\t}\n\n\tbool is_bipartite() const { return !bipartite_grouping().empty(); }\n\n\t// Ο(V+E)\n\t// (v1, v2, diameter)\n\tstd::tuple<int, int, cost_type> diameter() {\n\t\tstd::vector<cost_type> dist = bfs(0);\n\t\tauto it = std::max_element(dist.begin(), dist.end());\n\t\tconst int v = it - dist.begin();\n\t\tdist = bfs(v);\n\t\tit = std::max_element(dist.begin(), dist.end());\n\t\treturn std::make_tuple(v, int(it - dist.begin()), *it);\n\t}\n\n\t// Ο(V+E)\n\tstd::vector<int> subtree_size(const int root) {\n\t\tconst int n = size();\n\t\tstd::vector<int> ret(n, 1);\n\t\tauto dfs = [&](auto self, int now, int p = -1) -> void {\n\t\t\tfor(const auto &e : (*this)[now]) {\n\t\t\t\tif(e.to == p) continue;\n\t\t\t\tself(self, e.to, now);\n\t\t\t\tret[now] += ret[e.to];\n\t\t\t}\n\t\t};\n\t\tdfs(dfs, root);\n\t\treturn ret;\n\t}\n\n\t// Ο(ElgE)\n\tcost_type prim() const {\n\t\tcost_type res = 0;\n\t\tstd::priority_queue<edge, std::vector<edge>, std::greater<edge>> que;\n\t\tfor(auto &e : edges[0]) que.push(e);\n\t\tstd::vector<int> chk(size());\n\t\tchk[0] = 1;\n\t\tint cnt = 1;\n\t\twhile(cnt < size()) {\n\t\t\tauto e = que.top();\n\t\t\tque.pop();\n\t\t\tif(chk[e.to]) continue;\n\t\t\tcnt++;\n\t\t\tres += e.cost;\n\t\t\tchk[e.to] = 1;\n\t\t\tfor(auto &e2 : edges[e.to]) que.push(e2);\n\t\t}\n\t\treturn res;\n\t}\n\n\t// Ο(ElgE)\n\tcost_type kruskal() const {\n\t\tstd::vector<std::tuple<int, int, cost_type>> eds;\n\t\tfor(const auto &adj : edges)\n\t\t\tfor(const auto &ed : adj) eds.emplace_back(ed.from, ed.to, ed.cost);\n\t\tstd::sort(eds.begin(), eds.end(), [](const std::tuple<int, int, cost_type> &a, const std::tuple<int, int, cost_type> &b) {\n\t\t\treturn std::get<2>(a) < std::get<2>(b);\n\t\t});\n\t\tstd::vector<int> uf_data(size(), -1);\n\t\tauto root = [&uf_data](auto self, int x) -> int {\n\t\t\tif(uf_data[x] < 0) return x;\n\t\t\treturn uf_data[x] = self(self, uf_data[x]);\n\t\t};\n\t\tauto unite = [&uf_data, &root](int u, int v) -> bool {\n\t\t\tu = root(root, u), v = root(root, v);\n\t\t\tif(u == v) return false;\n\t\t\tif(uf_data[u] > uf_data[v]) std::swap(u, v);\n\t\t\tuf_data[u] += uf_data[v];\n\t\t\tuf_data[v] = u;\n\t\t\treturn true;\n\t\t};\n\t\tcost_type ret = 0;\n\t\tfor(auto &e : eds)\n\t\t\tif(unite(std::get<0>(e), std::get<1>(e))) ret += std::get<2>(e);\n\t\treturn ret;\n\t}\n\n\t// O(V)\n\tstd::vector<int> centroid() const {\n\t\tstd::vector<int> centroid, sz(size());\n\t\tauto dfs = [&](auto self, int now, int per) -> void {\n\t\t\tsz[now] = 1;\n\t\t\tbool is_centroid = true;\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(e.to != per) {\n\t\t\t\t\tself(self, e.to, now);\n\t\t\t\t\tsz[now] += sz[e.to];\n\t\t\t\t\tif(sz[e.to] > size() / 2) is_centroid = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(size() - sz[now] > size() / 2) is_centroid = false;\n\t\t\tif(is_centroid) centroid.push_back(now);\n\t\t};\n\t\tdfs(dfs, 0, -1);\n\t\treturn centroid;\n\t}\n\n\t// O(V+E)\n\t// bridge: (s, t) (s < t);\n\tstd::pair<std::vector<std::pair<int, int>>, std::vector<int>> bridges_and_articulations() const {\n\t\tstd::vector<int> order(size(), -1), low(size()), articulation;\n\t\tint order_next = 0;\n\t\tstd::vector<std::pair<int, int>> bridge;\n\t\tauto dfs = [&](auto self, int now, int par = -1) -> void {\n\t\t\tlow[now] = order[now] = order_next++;\n\t\t\tbool is_articulation = false;\n\t\t\tint cnt = 0;\n\t\t\tfor(auto &ed : edges[now]) {\n\t\t\t\tint &nxt = ed.to;\n\t\t\t\tif(nxt == par) continue;\n\t\t\t\tif(order[nxt] == -1) {\n\t\t\t\t\tcnt++;\n\t\t\t\t\tself(self, nxt, now);\n\t\t\t\t\tif(order[now] < low[nxt]) bridge.push_back(std::minmax(now, nxt));\n\t\t\t\t\tif(order[now] <= low[nxt]) is_articulation = true;\n\t\t\t\t\tlow[now] = std::min(low[now], low[nxt]);\n\t\t\t\t} else if(order[now] > order[nxt]) {\n\t\t\t\t\tlow[now] = std::min(low[now], order[nxt]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(par == -1 and cnt < 2) is_articulation = false;\n\t\t\tif(is_articulation) articulation.push_back(now);\n\t\t\treturn;\n\t\t};\n\t\tfor(int i = 0; i < (int)size(); i++)\n\t\t\tif(order[i] == -1) dfs(dfs, i);\n\t\treturn std::make_pair(bridge, articulation);\n\t}\n\n\t// Ο(V+E)\n\t// directed graph from root to leaf\n\tgraph root_to_leaf(int root = 0) const {\n\t\tgraph res(size());\n\t\tstd::vector<int> chk(size(), 0);\n\t\tchk[root] = 1;\n\t\tauto dfs = [&](auto self, int now) -> void {\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(chk[e.to] == 1) continue;\n\t\t\t\tchk[e.to] = 1;\n\t\t\t\tres.add_edge(now, e.to, e.cost, 1, 0);\n\t\t\t\tself(self, e.to);\n\t\t\t}\n\t\t};\n\t\tdfs(dfs, root);\n\t\treturn res;\n\t}\n\n\t// Ο(V+E)\n\t// directed graph from leaf to root\n\tgraph leaf_to_root(int root = 0) const {\n\t\tgraph res(size());\n\t\tstd::vector<int> chk(size(), 0);\n\t\tchk[root] = 1;\n\t\tauto dfs = [&](auto self, int now) -> void {\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(chk[e.to] == 1) continue;\n\t\t\t\tchk[e.to] = 1;\n\t\t\t\tres.add_edge(e.to, now, e.cost, 1, 0);\n\t\t\t\tself(self, e.to);\n\t\t\t}\n\t\t};\n\t\tdfs(dfs, root);\n\t\treturn res;\n\t}\n\n\t// cost_type Chu_Liu_Edmonds(int root = 0) {}\n};\n#pragma endregion\n#line 2 \"SPJ-Library/graph/centroid_decomposition.hpp\"\n\n#include <functional>\n\n// process(int root, const vector<int>& used_as_centroid) -> void\n// used_as_centroid[vertex] := 1 if 'vertex' has been removed else 0\ntemplate <class edge_type>\nvoid centroid_decomposition(const graph<edge_type> &g, const std::function<void(int, const std::vector<int> &)> &process) {\n\tstd::vector<int> weight(g.size(), 0), used_as_centroid(g.size(), 0);\n\n\tauto calc_weight = [&](auto self, int now, int par) -> void {\n\t\tint &weight_now = (weight[now] = 1);\n\t\tfor(const auto &ed : g[now]) {\n\t\t\tif(ed.to == par || used_as_centroid[ed.to]) continue;\n\t\t\tself(self, ed.to, now);\n\t\t\tweight_now += weight[ed.to];\n\t\t}\n\t\treturn;\n\t};\n\n\tauto find_centroid = [&g, &calc_weight, &weight, &used_as_centroid](int now) -> int {\n\t\tcalc_weight(calc_weight, now, -1);\n\t\tconst int order_half = weight[now] >> 1;\n\t\tint par = -1;\n\t\tbool changed = true;\n\t\twhile(std::exchange(changed, false)) {\n\t\t\tfor(const auto &ed : g[now]) {\n\t\t\t\tif(ed.to != par && !used_as_centroid[ed.to] && weight[ed.to] > order_half) {\n\t\t\t\t\tpar = now;\n\t\t\t\t\tnow = ed.to;\n\t\t\t\t\tchanged = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn now;\n\t};\n\n\tauto decomposite = [&g, &find_centroid, &used_as_centroid, &process](auto self, int now) -> void {\n\t\tnow = find_centroid(now);\n\t\tprocess(now, used_as_centroid);\n\t\tused_as_centroid[now] = 1;\n\t\tfor(const auto &ed : g[now])\n\t\t\tif(!used_as_centroid[ed.to]) self(self, ed.to);\n\t\treturn;\n\t};\n\n\tfor(int i = 0; i < g.size(); i++)\n\t\tif(!used_as_centroid[i]) decomposite(decomposite, i);\n\treturn;\n}\n#line 5 \"e.cpp\"\n\n#line 2 \"SPJ-Library/template/kuma.hpp\"\n\n#line 2 \"SPJ-Library/template/basic_func.hpp\"\n\n#line 7 \"SPJ-Library/template/basic_func.hpp\"\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 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 flag = true) { std::cout << (flag ? \"Yes\" : \"No\") << '\\n'; }\nvoid YES(bool flag = true) { std::cout << (flag ? \"YES\" : \"NO\") << '\\n'; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(const T &x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(const Head &H, const Tail &... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T value) {\n\tfor(auto &a : v) a += value;\n\treturn;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\n// ceil(a / b);\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b);\n\tif(b < 0) {\n\t\ta *= -1;\n\t\tb *= -1;\n\t}\n\treturn least_upper_multiple(a, b) / b;\n}\n\nlong long pow_ll(long long a, long long n) {\n\tassert(n >= 0LL);\n\tif(n == 0) return 1LL;\n\tif(a == 0) return 0LL;\n\tif(a == 1) return 1LL;\n\tif(a == -1) return (n & 1LL) ? -1LL : 1LL;\n\tlong long res = 1;\n\twhile(n > 1LL) {\n\t\tif(n & 1LL) res *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn res * a;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\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 < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, const 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\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn (int)std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn (int)std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(const std::vector<T> &a) {\n\tstd::vector<T> vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(const auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n#line 1 \"SPJ-Library/template/header.hpp\"\n#include <bits/stdc++.h>\n#line 2 \"SPJ-Library/template/io.hpp\"\n\n#line 4 \"SPJ-Library/template/io.hpp\"\n\n#line 8 \"SPJ-Library/template/debug.hpp\"\n\n#line 3 \"SPJ-Library/template/constants.hpp\"\n\nconstexpr int inf = 1000'000'000;\nconstexpr long long INF = 1'000'000'000'000'000'000LL;\nconstexpr int mod_1000000007 = 1000000007;\nconstexpr int mod_998244353 = 998244353;\nconst long double pi = acosl(-1.);\nconstexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconstexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n#line 10 \"SPJ-Library/template/debug.hpp\"\n\nnamespace viewer {\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p);\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p);\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p);\n\nvoid view(const long long &e);\n\nvoid view(const int &e);\n\ntemplate <typename T>\nvoid view(const T &e);\n\ntemplate <typename T>\nvoid view(const std::set<T> &s);\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s);\n\ntemplate <typename T>\nvoid view(const std::multiset<T> &s);\n\ntemplate <typename T>\nvoid view(const std::unordered_multiset<T> &s);\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v);\n\ntemplate <typename T, std::size_t ary_size>\nvoid view(const std::array<T, ary_size> &v);\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv);\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v);\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v);\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v);\n\ntemplate <typename map_type>\nvoid view_map_container(const map_type &m);\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m);\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m);\n\ntemplate <typename container_type>\nvoid view_container(const container_type &c, bool vertically = false) {\n\ttypename container_type::const_iterator begin = c.begin();\n\tconst typename container_type::const_iterator end = c.end();\n\tif(vertically) {\n\t\tstd::cerr << \"{\\n\";\n\t\twhile(begin != end) {\n\t\t\tstd::cerr << '\\t';\n\t\t\tview(*(begin++));\n\t\t\tif(begin != end) std::cerr << ',';\n\t\t\tstd::cerr << '\\n';\n\t\t}\n\t\tstd::cerr << '}';\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\twhile(begin != end) {\n\t\tview(*(begin++));\n\t\tif(begin != end) std::cerr << ',';\n\t\tstd::cerr << ' ';\n\t}\n\tstd::cerr << '}';\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << '(';\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << ')';\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << '(';\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << ')';\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << '(';\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << ')';\n}\n\nvoid view(const long long &e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int &e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T &e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::multiset<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_multiset<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tview_container(v);\n}\n\ntemplate <typename T, std::size_t ary_size>\nvoid view(const std::array<T, ary_size> &v) {\n\tview_container(v);\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tview_container(vv, true);\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tview_container(v, true);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tview_container(v, true);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tview_container(v, true);\n}\n\ntemplate <typename map_type>\nvoid view_map_container(const map_type &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(typename map_type::const_iterator it = m.begin(); it != m.end(); it++) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(it->first);\n\t\tstd::cerr << \"] : \";\n\t\tview(it->second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tview_map_container(m);\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tview_map_container(m);\n}\n\n} // namespace viewer\n\n// when compiling : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename T>\nvoid debug_out(const T &x) {\n\tviewer::view(x);\n}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(const Head &H, const Tail &... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"]\\n\"; \\\n\t} while(0)\n#else\n#define debug(...) (void(0))\n#endif\n#line 2 \"SPJ-Library/template/scanner.hpp\"\n\n#line 6 \"SPJ-Library/template/scanner.hpp\"\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#line 7 \"SPJ-Library/template/io.hpp\"\n\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << ' ' << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(typename std::vector<T>::const_iterator it = v.begin(); it != v.end(); it++) {\n\t\tif(it != v.begin()) std::cerr << ' ';\n\t\tos << *it;\n\t}\n\treturn os;\n}\n\nstruct fast_io {\n\tfast_io() {\n\t\tstd::ios::sync_with_stdio(false);\n\t\tstd::cin.tie(nullptr);\n\t\tstd::cout << std::fixed << std::setprecision(15);\n\t\tsrand((unsigned)time(NULL));\n\t}\n} fast_io_;\n#line 2 \"SPJ-Library/template/macros.hpp\"\n\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 pcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n#line 7 \"SPJ-Library/template/kuma.hpp\"\n\nusing namespace std;\n#line 478 \"e.cpp\"\n\nll solve(int n) {\n\tVEC(ll, stand, n);\n\tgraph<ll> g(n, -1, true, 0, 1);\n\n\tint ans = 1;\n\n\tvector<ll> up_tmp, dn_tmp;\n\n\tauto dfs = [&](int dist, int now, const vector<int> &used, auto self, int par, ll sum, ll minvalue, ll maxvalue) -> void {\n\t\tchmin(minvalue, sum);\n\t\tchmax(maxvalue, sum);\n\t\tsum += stand[now];\n\t\tchmax(maxvalue, sum);\n\t\tdebug(dist, now, used, sum, minvalue, maxvalue);\n\t\tif((int)dn_tmp.size() <= dist) dn_tmp.resize(dist + 1, -INF);\n\t\tchmax(dn_tmp[dist], minvalue);\n\t\tif(sum - maxvalue >= 0 && sum >= 0LL) {\n\t\t\tif(int(up_tmp.size() <= dist)) up_tmp.resize(dist + 1, -INF);\n\t\t\tchmax(up_tmp[dist], sum);\n\t\t}\n\t\tfoa(e, g[now]) {\n\t\t\tif(e.to == par || used[e.to]) continue;\n\t\t\tself(dist + 1, e.to, used, self, now, sum - e.cost, minvalue, maxvalue);\n\t\t}\n\t\tdebug('f');\n\t\treturn;\n\t};\n\n\tauto merge = [&](vll &a, vll &b, ll root) -> void {\n\t\tint as = int(a.size());\n\t\tint bs = int(b.size());\n\t\tint j = 0;\n\t\tdrep(i, as) while(j < bs && b[j] + a[i] + root >= 0) {\n\t\t\tchmax(ans, i + j + 1);\n\t\t\tj++;\n\t\t}\n\t\treturn;\n\t};\n\n\tauto process = [&](int root, const vector<int> &used) -> void {\n\t\tvll up(1, 0LL), dn(1, 0LL);\n\t\tfoa(e, g[root]) {\n\t\t\tif(used[e.to]) continue;\n\t\t\tup_tmp.resize(1, 0LL);\n\t\t\tdn_tmp.resize(1, 0LL);\n\t\t\tdfs(1, e.to, used, dfs, root, -e.cost, INF, -INF);\n\t\t\tdrep(i, int(up_tmp.size()) - 1) { chmax(up_tmp[i], up_tmp[i + 1]); }\n\t\t\tdrep(i, int(dn_tmp.size()) - 1) { chmax(dn_tmp[i], dn_tmp[i + 1]); }\n\n\t\t\tmerge(up, dn_tmp, stand[root]);\n\t\t\tmerge(up_tmp, dn, stand[root]);\n\n\t\t\tdebug(root, e.to);\n\t\t\tdebug(up);\n\t\t\tdebug(dn);\n\t\t\tdebug(up_tmp);\n\t\t\tdebug(dn_tmp);\n\t\t\tdebug(stand[root]);\n\t\t\t// exit(0);\n\t\t\tif(ans == 2) {\n\t\t\t}\n\n\t\t\tif(up_tmp.size() > up.size()) up.resize(up_tmp.size(), -INF);\n\t\t\tif(dn_tmp.size() > dn.size()) dn.resize(dn_tmp.size(), -INF);\n\t\t\trep(i, int(up_tmp.size())) { chmax(up[i], up_tmp[i]); }\n\t\t\trep(i, int(dn_tmp.size())) { chmax(dn[i], dn_tmp[i]); }\n\n\t\t\tup_tmp.clear();\n\t\t\tdn_tmp.clear();\n\t\t}\n\t\treturn;\n\t};\n\n\tcentroid_decomposition(g, process);\n\treturn (ans);\n}\n\nint main() {\n\tint n;\n\twhile(cin >> n && n) {\n\t\tcout << solve(n) << '\\n';\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":24712,"score_of_the_acc":-0.5371,"final_rank":3},{"submission_id":"aoj_2790_6172831","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#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<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\n#include<chrono>\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\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;\n\ntemplate<typename T>\nvoid chmin(T& a, T b) {\n\ta = min(a, b);\n}\ntemplate<typename T>\nvoid chmax(T& a, T b) {\n\ta = max(a, b);\n}\ntemplate<typename T>\nvoid cinarray(vector<T>& v) {\n\trep(i, v.size())cin >> v[i];\n}\ntemplate<typename T>\nvoid coutarray(vector<T>& v) {\n\trep(i, v.size()) {\n\t\tif (i > 0)cout << \" \"; cout << v[i];\n\t}\n\tcout << \"\\n\";\n}\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tif (x == 0)return 0;\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\tint n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) {\n\t\tif (m < 0 || mod <= m) {\n\t\t\tm %= mod; if (m < 0)m += mod;\n\t\t}\n\t\tn = m;\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)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 20;\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}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nll gcd(ll a, ll b) {\n\ta = abs(a); b = abs(b);\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tll r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n\nusing mP = pair<modint, modint>;\n//-----------------------------------\n\nstruct edge {\n\tint to, cost;\n};\nconst int mn = 1 << 17;\nvector<edge> G[mn];\nint a[mn];\nqueue<vector<int>> q;\nbool exi[mn];\nint ans = 1;\nvoid yaru(vector<int> v) {\n\tif (v.empty())return;\n\t//初期化\n\tfor (int id : v)exi[id] = true;\n\tint g; int sz = v.size();\n\n\tfunction<int(int, int)> s_root = [&](int id, int fr)->int {\n\t\tint res = 1;\n\t\tint ma = 0;\n\t\tfor (edge e: G[id]) {\n\t\t\tif (e.to == fr)continue;\n\t\t\tif (!exi[e.to])continue;\n\t\t\tint nex = s_root(e.to, id);\n\t\t\tma = max(ma, nex);\n\t\t\tres += nex;\n\t\t}\n\t\tif (ma <= sz / 2 && sz - res <= sz / 2)g = id;\n\t\treturn res;\n\t};\n\ts_root(v[0], -1);\n\t//ここまで初期化\n\n\t////重心を根としてなんかやる\n\t//function<void(int, int)> dfs = [&](int id, int fr) {\n\t//\tif (!exi[id])return;\n\t//\tfor (int to : G[id]) {\n\t//\t\tif (to == fr)continue;\n\t//\t\tdfs(to, id);\n\t//\t}\n\t//};\n\t//for (int to : G[g])dfs(to, g);\n\n\n\n\n\t//ここまで\n\n\tvector<vector<int>> chs;\n\tvector<int> nexs;\n\tfunction<void(int, int)> search_next = [&](int id, int fr) {\n\t\tif (!exi[id])return;\n\t\tnexs.push_back(id);\n\t\tfor (edge e : G[id]) {\n\t\t\tif (e.to == fr)continue;\n\t\t\tsearch_next(e.to,id);\n\t\t}\n\t};\n\t//子を列挙する\n\tfor (edge e : G[g]) {\n\t\tsearch_next(e.to, g);\n\t\tif (nexs.empty())continue;\n\t\tq.push(nexs);\n\t\tchs.push_back(nexs);\n\t\tnexs.clear();\n\t}\n\n\t//子達についてなんかやる\n\tvector<int> vd;\n\t\n\tfunction<void(int, int,int,int,int)> dfsto = [&](int id, int fr,int cur,int mi,int depth) {\n\t\t//cout << \"? \" << id <<\" \"<<fr<< \"\\n\";\n\t\tif (mi >= 0)chmax(ans, depth + 1);\n\t\twhile (vd.size() <= depth) {\n\t\t\tvd.push_back(2 * mod);\n\t\t}\n\t\tchmin(vd[depth], -mi);\n\t\tfor (edge e : G[id]) {\n\t\t\tif (e.to == fr || !exi[e.to])continue;\n\t\t\tdfsto(e.to, id, cur + a[id] - e.cost, min(mi, cur + a[id] - e.cost), depth + 1);\n\t\t}\n\t};\n\tfunction<void(int, int, int, int, int)> dfsfrom = [&](int id, int fr, int cur, int mi, int depth) {\n\t\tif (mi >= 0)chmax(ans, depth + 1);\n\t\tif (mi >= 0) {\n\t\t\tint loc = upper_bound(all(vd), cur) - vd.begin();\n\t\t\tchmax(ans, loc + depth);\n\t\t}\n\t\tfor (edge e : G[id]) {\n\t\t\tif (e.to == fr || !exi[e.to])continue;\n\t\t\tdfsfrom(e.to, id, cur + a[e.to] - e.cost, min(0, mi + a[e.to] - e.cost), depth + 1);\n\t\t}\n\t};\n\tvd = { 0 };\n\tfor (edge e : G[g]) {\n\t\tif (exi[e.to]) {\n\t\t\tdfsfrom(e.to, g, a[e.to]-e.cost, min(0,a[e.to]-e.cost), 1);\n\t\t\tdfsto(e.to, g, a[g] - e.cost, min(0, a[g] - e.cost), 1);\n\t\t}\n\t}\n\tvd = { 0 };\n\tper(i, G[g].size()) {\n\t\tedge e = G[g][i];\n\t\tif (exi[e.to]) {\n\t\t\tdfsfrom(e.to, g, a[e.to] - e.cost, min(0, a[e.to] - e.cost), 1);\n\t\t\tdfsto(e.to, g, a[g] - e.cost, min(0, a[g] - e.cost), 1);\n\t\t}\n\t}\n\n\tfor (int id : v)exi[id] = false;\n}\n\nvoid uoo(int n) {\n\tvector<int> ori(n); rep(i, n)ori[i] = i;\n\tq.push(ori);\n\twhile (!q.empty()) {\n\t\tvector<int> v = q.front(); q.pop();\n\t\tyaru(v);\n\t}\n}\n\nvoid solve() {\n\tint n; cin >> n;\n\trep(i, n)cin >> a[i];\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 });\n\t\tG[b].push_back({ a,c });\n\t}\n\tuoo(n);\n\tcout << ans << \"\\n\";\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//init_f();\n\t//init();\n\t//while(true)\n\t//expr();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":31444,"score_of_the_acc":-0.7641,"final_rank":6},{"submission_id":"aoj_2790_5177687","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\nconst int maxn=1e6+10;\nint n,g[maxn],st[maxn],to[maxn],nt[maxn],topt,w[maxn],ans,ma[maxn],cima[maxn],dp[maxn],a[maxn],p;\nbool f[maxn];\nvoid add(int x,int y,int z){to[++topt]=y; nt[topt]=st[x]; st[x]=topt; w[topt]=z;}\nvoid dfs1(int x,int fa)\n{\n\tdp[x]=0; int p=st[x];\n\twhile (p)\n\t{\n\t\tif (to[p]!=fa) \n\t\t{\n\t\t\tdfs1(to[p],x);\n\t\t\tif (ma[to[p]]>=ma[x])\n\t\t\t{\n\t\t\t\tcima[x]=ma[x];\n\t\t\t\tma[x]=ma[to[p]];\n\t\t\t}\n\t\t\telse if (ma[to[p]]>cima[x]) cima[x]=ma[to[p]];\n\t\t}\n\t\tp=nt[p];\n\t}\n\tma[x]++; cima[x]++;\n}\nvoid dfs2(int x,int fa,int d)\n{\n\tdp[x]=max(d,ma[x]);\n\tint p=st[x];\n\twhile (p)\n\t{\n\t\tif (to[p]!=fa)\n\t\t{\n\t\t\tint now=d+1;\n\t\t\tif (ma[x]==ma[to[p]]+1) now=max(now,cima[x]+1);\n\t\t\telse now=max(now,ma[x]+1);\n\t\t\tdfs2(to[p],x,now);\n\t\t}\n\t\tp=nt[p];\n\t}\n\n}\nvoid dfs3(int x,int fa,int now,long long G)\n{\n\tif (G<0) return;\n\tG+=g[x]; ans=max(ans,now);\n\tint p=st[x];\n\twhile (p)\n\t{\n\t\tif (to[p]!=fa) dfs3(to[p],x,now+1,G-w[p]);\n\t\tp=nt[p];\n\t}\n}\nvoid solve(int x)\n{\n\tif (dp[a[x]]<=ans) return;\n\tdfs3(a[x],0,1,0);\n\tswap(a[x],a[p]); p--;\n}\nvoid solve1(int x)\n{\n\tif (dp[x]<=ans) return;\n\tdfs3(x,0,1,0);\n}\nint main()\n{\n\tscanf(\"%d\",&n);\n\tfor (int i=1;i<=n;i++) scanf(\"%d\",&g[i]);\n\tfor (int i=1;i<n;i++)\n\t{\n\t\tint x,y,z; scanf(\"%d%d%d\",&x,&y,&z);\n\t\tadd(x,y,z); add(y,x,z);\n\t}\n\tdfs1(1,0); dfs2(1,0,0);\n\tif (n<=10000)\n\t{\n\t\tfor (int i=1;i<=n;i++) solve1(i);\n\t}\n\telse\n\t{\n\t\tfor (int i=1;i<=n;i++) a[p++]=i;\n\t\tp--;\n\t\twhile (clock()<1850 && p>-1) solve(rng()%(p+1));\n\t}\n\tprintf(\"%d\\n\",ans);\nreturn 0;\n}","accuracy":0.13924050632911392,"time_ms":10,"memory_kb":6424,"score_of_the_acc":-0.0009,"final_rank":20},{"submission_id":"aoj_2790_5177682","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\nconst int maxn=1e6+10;\nint n,g[maxn],st[maxn],to[maxn],nt[maxn],topt,w[maxn],ans,ma[maxn],cima[maxn],dp[maxn],a[maxn],p;\nbool f[maxn];\nvoid add(int x,int y,int z){to[++topt]=y; nt[topt]=st[x]; st[x]=topt; w[topt]=z;}\nvoid dfs1(int x,int fa)\n{\n\tdp[x]=0; int p=st[x];\n\twhile (p)\n\t{\n\t\tif (to[p]!=fa) \n\t\t{\n\t\t\tdfs1(to[p],x);\n\t\t\tif (ma[to[p]]>=ma[x])\n\t\t\t{\n\t\t\t\tcima[x]=ma[x];\n\t\t\t\tma[x]=ma[to[p]];\n\t\t\t}\n\t\t\telse if (ma[to[p]]>cima[x]) cima[x]=ma[to[p]];\n\t\t}\n\t\tp=nt[p];\n\t}\n\tma[x]++; cima[x]++;\n}\nvoid dfs2(int x,int fa,int d)\n{\n\tdp[x]=max(d,ma[x]);\n\tint p=st[x];\n\twhile (p)\n\t{\n\t\tif (to[p]!=fa)\n\t\t{\n\t\t\tint now=d+1;\n\t\t\tif (ma[x]==ma[to[p]]+1) now=max(now,cima[x]+1);\n\t\t\telse now=max(now,ma[x]+1);\n\t\t\tdfs2(to[p],x,now);\n\t\t}\n\t\tp=nt[p];\n\t}\n\n}\nvoid dfs3(int x,int fa,int now,long long G)\n{\n\tif (G<0) return;\n\tG+=g[x]; ans=max(ans,now);\n\tint p=st[x];\n\twhile (p)\n\t{\n\t\tif (to[p]!=fa) dfs3(to[p],x,now+1,G-w[p]);\n\t\tp=nt[p];\n\t}\n}\nvoid solve(int x)\n{\n\tif (dp[a[x]]<=ans) return;\n\tdfs3(a[x],0,1,0);\n\tswap(a[x],a[p]); p--;\n}\nvoid solve1(int x)\n{\n\tif (dp[x]<=ans) return;\n\tdfs3(x,0,1,0);\n}\nint main()\n{\n\tscanf(\"%d\",&n);\n\tfor (int i=1;i<=n;i++) scanf(\"%d\",&g[i]);\n\tfor (int i=1;i<n;i++)\n\t{\n\t\tint x,y,z; scanf(\"%d%d%d\",&x,&y,&z);\n\t\tadd(x,y,z); add(y,x,z);\n\t}\n\tdfs1(1,0); dfs2(1,0,0);\n\tif (n<=1000)\n\t{\n\t\tfor (int i=1;i<=n;i++) solve1(i);\n\t}\n\telse\n\t{\n\t\tfor (int i=1;i<=n;i++) a[p++]=i;\n\t\tp--;\n\t\twhile (clock()<1850 && p>-1) solve(rng()%(p+1));\n\t}\n\tprintf(\"%d\\n\",ans);\nreturn 0;\n}","accuracy":0.13924050632911392,"time_ms":10,"memory_kb":6380,"score_of_the_acc":0,"final_rank":19},{"submission_id":"aoj_2790_5176515","code_snippet":"#include <bits/stdc++.h>\n#define LL long long\nusing namespace std;\nconst int INF=2e9;\nconst int N=1e5+10;\nint read(){\n int x=0,f=1;char ch=getchar();\n while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}\n while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}\n return x*f;\n}\nvoid print(LL x){\n if(x>9) print(x/10);\n putchar(x%10+'0');\n}\nint n,ans;\nstruct edge{\n\tint r,v;\n};\nvector<edge> E[N];\nint g[N];\nvoid insert(int u,int v,int w){\n\tE[u].push_back(edge{v,w});\n}\nint mx,rt;\nint sz[N];\nbool vis[N];\nvoid getrt(int x,int S,int fa){\n\t//cout<<x<<\" \"<<S<<\" \"<<fa<<endl;\n sz[x]=1;int son=0,y;\n for(int i=0;i<E[x].size();++i){\n \ty=E[x][i].r;\n \tif(vis[y]==0&&y!=fa){\n getrt(y,S,x);\n sz[x]+=sz[y];\n son=max(son,sz[y]);\n }\n\t}\n son=max(son,S-sz[x]);\n if(son<=mx){\n rt=x;\n mx=son;\n }\n}\nint dep[N],mxd[N];\nint dis[N],oil[N];\nvoid getdep(int x,int fa){\n\tint y;\n\tsz[x]=1;\n\tmxd[x]=dep[x];oil[x]=oil[fa]+g[x];\n\tfor(int i=0;i<E[x].size();++i){\n \ty=E[x][i].r;\n \tif(vis[y]==0&&y!=fa){\n \t\tdis[y]=dis[x]+E[x][i].v;\n dep[y]=dep[x]+1;\n getdep(y,x);\n sz[x]+=sz[y];\n mxd[x]=max(mxd[x],mxd[y]);\n }\n\t}\n}\nedge q[N];\nbool cmp(edge x,edge y){\n\treturn mxd[x.r]<mxd[y.r];\n}\nint pre[N],suf[N];\nint PRE[N],SUF[N];\nint wws[N],ned[N];\nvoid cal(int x,int fa){\n\tint y;\n\tSUF[dep[x]]=min(SUF[dep[x]],wws[x]);\n\tif(ned[x]==0) PRE[dep[x]]=max(PRE[dep[x]],oil[x]-dis[x]);\n\tfor(int i=0;i<E[x].size();++i){\n \ty=E[x][i].r;\n \tif(vis[y]==0&&y!=fa){\n \t\twws[y]=wws[x]+max(0,E[x][i].v-g[x]);\n \t\tif(g[E[x][i].r]-E[x][i].v>=ned[x]) ned[E[x][i].r]=0;\n \t\telse ned[E[x][i].r]=ned[x]+E[x][i].v-g[E[x][i].r];\n \t\tcal(y,x);\n }\n\t}\n}\nvoid sol(int x,int S){\n\tmx=1e9;\n\tgetrt(x,S,0);\n\t//cout<<rt<<endl;\n\tx=rt;\n\tdep[x]=0;dis[x]=0;\n\tgetdep(x,0);\n\tint r=0;\n\t//cout<<rt<<endl;\n\tfor(int i=0;i<E[x].size();++i){\n\t\tif(vis[E[x][i].r]==0) q[++r]=E[x][i];\n\t}\n if(r==0) return;\n // cout<<rt<<endl;\n sort(q+1,q+1+r,cmp);\n for(int i=0;i<=mxd[x];++i){\n \tpre[i]=-INF;\n \tsuf[i]=INF;\n\t}\n\tpre[0]=g[x];\n\tsuf[0]=0;\n\tfor(int i=1;i<=r;++i){\n\t\tfor(int j=0;j<=mxd[q[i].r];++j){\n\t\t\tPRE[j]=-INF;\n\t\t\tSUF[j]=INF;\n\t\t}\n\t\tned[q[i].r]=max(0,q[i].v-g[q[i].r]);\n\t\twws[q[i].r]=q[i].v;\n\t\t//if(q[i].v<=g[q[i].r]) PRE[1]=g[x]+g[q[i].r]-q[i].v;\n\t\tcal(q[i].r,x);\n\t\tfor(int j=mxd[q[i].r];j>1;--j){\n\t\t\tSUF[j-1]=min(SUF[j],SUF[j-1]);\n\t\t\tPRE[j-1]=max(PRE[j],PRE[j-1]);\n\t\t}\n\t\tfor(int j=1,k=mxd[q[i].r];j<=mxd[q[i].r];++j){\n\t\t\twhile(k>0&&suf[k]>PRE[j]) --k;\n\t\t\tif(suf[k]<=PRE[j]) ans=max(ans,j+k+1);\n\t\t}\n\t\tfor(int j=1,k=mxd[q[i].r];j<=mxd[q[i].r];++j){\n\t\t\twhile(k>0&&pre[k]<SUF[j]) --k;\n\t\t\tif(SUF[j]<=pre[k]) ans=max(ans,j+k+1);\n\t\t}\n\t\tfor(int j=mxd[q[i].r];j>=0;--j){\n\t\t\tsuf[j]=min(suf[j],SUF[j]);\n\t\t\tpre[j]=max(pre[j],PRE[j]);\n\t\t}\n\t\tfor(int j=mxd[q[i].r];j>=1;--j){\n\t\t\tsuf[j-1]=min(suf[j],suf[j-1]);\n\t\t\tpre[j-1]=max(pre[j],pre[j-1]);\n\t\t}\n\t\tpre[0]=max(pre[1],pre[0]);\n\t}\n\t//cout<<ans<<endl;\n\tvis[x]=1;\n\tfor(int i=0;i<E[x].size();++i){\n\t\tif(vis[E[x][i].r]==0) sol(E[x][i].r,sz[E[x][i].r]);\n\t}\n}\nint main(){\n\tscanf(\"%d\",&n);ans=1;oil[0]=0;\n\tfor(int i=1;i<=n;++i) scanf(\"%d\",&g[i]);\n\tint u,v,w;\n\tfor(int i=1;i<n;++i){\n\t\tscanf(\"%d%d%d\",&u,&v,&w);\n\t\tinsert(u,v,w);\n\t\tinsert(v,u,w);\n\t}\n\tsol(1,n);\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}","accuracy":0.4050632911392405,"time_ms":50,"memory_kb":16172,"score_of_the_acc":-0.2923,"final_rank":15},{"submission_id":"aoj_2790_5176438","code_snippet":"#include <bits/stdc++.h>\n#define LL long long\nusing namespace std;\nconst int INF=1e9+10;\nconst int N=3e5+10;\nint read(){\n int x=0,f=1;char ch=getchar();\n while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}\n while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}\n return x*f;\n}\nvoid print(LL x){\n if(x>9) print(x/10);\n putchar(x%10+'0');\n}\nint n,ans;\nstruct edge{\n\tint r,v;\n};\nvector<edge> E[N];\nint g[N];\nvoid insert(int u,int v,int w){\n\tE[u].push_back(edge{v,w});\n}\nint mx,rt;\nint sz[N];\nbool vis[N];\nvoid getrt(int x,int S,int fa){\n\t//cout<<x<<\" \"<<S<<\" \"<<fa<<endl;\n sz[x]=1;int son=0,y;\n for(int i=0;i<E[x].size();++i){\n \ty=E[x][i].r;\n \tif(vis[y]==0&&y!=fa){\n getrt(y,S,x);\n sz[x]+=sz[y];\n son=max(son,sz[y]);\n }\n\t}\n son=max(son,S-sz[x]);\n if(son<=mx){\n rt=x;\n mx=son;\n }\n}\nint dep[N],mxd[N];\nint dis[N],oil[N];\nvoid getdep(int x,int fa){\n\tint y;\n\tsz[x]=1;\n\tmxd[x]=dep[x];oil[x]=oil[fa]+g[x];\n\tfor(int i=0;i<E[x].size();++i){\n \ty=E[x][i].r;\n \tif(vis[y]==0&&y!=fa){\n \t\tdis[y]=dis[x]+E[x][i].v;\n dep[y]=dep[x]+1;\n getdep(y,x);\n sz[x]+=sz[y];\n mxd[x]=max(mxd[x],mxd[y]);\n }\n\t}\n}\nedge q[N];\nbool cmp(edge x,edge y){\n\treturn mxd[x.r]<mxd[y.r];\n}\nint pre[N],suf[N];\nint PRE[N],SUF[N];\nint wws[N],ned[N];\nvoid cal(int x,int fa){\n\tint y;\n\tSUF[dep[x]]=min(SUF[dep[x]],wws[x]);\n\tif(ned[x]==0) PRE[dep[x]]=max(PRE[dep[x]],oil[x]-dis[x]);\n\tfor(int i=0;i<E[x].size();++i){\n \ty=E[x][i].r;\n \tif(vis[y]==0&&y!=fa){\n \t\twws[y]=wws[x]+max(0,E[x][i].v-g[x]);\n \t\tif(g[E[x][i].r]-E[x][i].v>=ned[x]) ned[E[x][i].r]=0;\n \t\telse ned[E[x][i].r]=ned[x]+E[x][i].v-g[E[x][i].r];\n \t\tcal(y,x);\n }\n\t}\n}\nvoid sol(int x,int S){\n\tmx=1e9;\n\tgetrt(x,S,0);\n\t//cout<<rt<<endl;\n\tx=rt;\n\tdep[x]=0;dis[x]=0;\n\tgetdep(x,0);\n\tint r=0;\n\t//cout<<rt<<endl;\n\tfor(int i=0;i<E[x].size();++i){\n\t\tif(vis[E[x][i].r]==0) q[++r]=E[x][i];\n\t}\n if(r==0) return;\n // cout<<rt<<endl;\n sort(q+1,q+1+r,cmp);\n for(int i=0;i<=mxd[x];++i){\n \tpre[i]=-INF;\n \tsuf[i]=INF;\n\t}\n\tpre[0]=g[x];\n\tsuf[0]=0;\n\tfor(int i=1;i<=r;++i){\n\t\tfor(int j=0;j<=mxd[q[i].r];++j){\n\t\t\tPRE[j]=-INF;\n\t\t\tSUF[j]=INF;\n\t\t}\n\t\tned[q[i].r]=max(0,q[i].v-g[q[i].r]);\n\t\twws[q[i].r]=q[i].v;\n\t\t//if(q[i].v<=g[q[i].r]) PRE[1]=g[x]+g[q[i].r]-q[i].v;\n\t\tcal(q[i].r,x);\n\t\tfor(int j=mxd[q[i].r];j>1;--j){\n\t\t\tSUF[j-1]=min(SUF[j],SUF[j-1]);\n\t\t\tPRE[j-1]=max(PRE[j],PRE[j-1]);\n\t\t}\n\t\tfor(int j=1,k=mxd[q[i].r];j<=mxd[q[i].r];++j){\n\t\t\twhile(k>0&&suf[k]>PRE[j]) --k;\n\t\t\tif(suf[k]<=PRE[j]) ans=max(ans,j+k+1);\n\t\t}\n\t\tfor(int j=1,k=mxd[q[i].r];j<=mxd[q[i].r];++j){\n\t\t\twhile(k>0&&pre[k]<SUF[j]) --k;\n\t\t\tif(SUF[j]<=pre[k]) ans=max(ans,j+k+1);\n\t\t}\n\t\tfor(int j=mxd[q[i].r];j>=0;--j){\n\t\t\tsuf[j]=min(suf[j],SUF[j]);\n\t\t\tpre[j]=max(pre[j],PRE[j]);\n\t\t}\n\t\tpre[0]=max(pre[1],pre[0]);\n\t}\n\t//cout<<ans<<endl;\n\tvis[x]=1;\n\tfor(int i=0;i<E[x].size();++i){\n\t\tif(vis[E[x][i].r]==0) sol(E[x][i].r,sz[E[x][i].r]);\n\t}\n}\nint main(){\n\tscanf(\"%d\",&n);ans=1;oil[0]=0;\n\tfor(int i=1;i<=n;++i) scanf(\"%d\",&g[i]);\n\tint u,v,w;\n\tfor(int i=1;i<n;++i){\n\t\tscanf(\"%d%d%d\",&u,&v,&w);\n\t\tinsert(u,v,w);\n\t\tinsert(v,u,w);\n\t}\n\tsol(1,n);\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}","accuracy":0.4050632911392405,"time_ms":50,"memory_kb":20776,"score_of_the_acc":-0.3906,"final_rank":16},{"submission_id":"aoj_2790_4054159","code_snippet":"#include <algorithm>\n#include <set>\n#include <limits>\n#include <utility>\n#include <iostream>\n#include <type_traits>\n#include <vector>\n#include <cstdint>\n#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2790\"\n\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};\ntemplate<typename F>\nstruct fixpoint : F\n{\n fixpoint(F&& f) : F(std::forward<F>(f)) {}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }\n};\n// template<typename F>\n// inline decltype(auto) mfp(F&& f) { return fixpoint<F>{std::forward<F>(f)}; }\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\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>\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>()...}; }\n\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 std::cout << \"\\n\", 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>\nvoid outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\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\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>>;\ntemplate<typename Edge = edge<>>\nclass centroid\n{\npublic:\n centroid(const base_tree<Edge>& tree) : cs(tree.size())\n {\n const std::size_t sz = tree.size();\n std::vector<std::size_t> sub(sz, 1);\n std::vector<bool> used(sz, false);\n auto size = [&, sz](auto&& self, const std::size_t s, const std::size_t p) -> std::size_t {\n sub[s] = 1;\n for (const auto& e : tree[s]) {\n const std::size_t to = e.to();\n if (to == p or used[to]) { continue; }\n sub[s] += self(self, to, s);\n }\n return sub[s];\n };\n auto search = [&, sz](auto&& self, const std::size_t s, const std::size_t p, const std::size_t tot) -> std::size_t {\n for (const auto& e : tree[s]) {\n const std::size_t to = e.to();\n if (p == to or used[to]) { continue; }\n if (sub[to] * 2 > tot) { return self(self, to, s, tot); }\n }\n return s;\n };\n auto build = [&, sz](auto&& self, const std::size_t s, const std::size_t pc) -> std::size_t {\n const std::size_t tot = size(size, s, sz), c = search(search, s, sz, tot);\n used[c] = true;\n if (pc != sz) { cs.add_edge(pc, c); }\n for (const auto& e : tree[c]) {\n const std::size_t to = e.to();\n if (not used[to]) { self(self, to, c); }\n }\n return c;\n };\n build(build, 0, sz);\n }\n const tree& centros() const { return cs; }\n\nprivate:\n tree cs;\n};\nint main()\n{\n auto N = in<usize>();\n auto gas = in_v<ll>({N});\n cost_graph<ll> g(N);\n for (usize i = 0; i < N - 1; i++) {\n const auto a = in<usize>() - 1;\n const auto b = in<usize>() - 1;\n const auto d = in<ll>();\n g.add_edge(a, b, d, true);\n }\n const auto cg = centroid<edge<ll>>{g}.centros();\n usize centor = 0;\n for (; centor < N; centor++) {\n if (cg.to(centor).empty()) { break; }\n }\n usize ans = 1;\n std::vector<bool> used(N, false);\n mfp([&](auto&& dfs, usize c) -> void {\n used[c] = true;\n const usize cn = g[c].size();\n std::vector<std::vector<ll>> sub_ups(cn);\n std::vector<std::vector<ll>> sub_downs(cn);\n for (usize i = 0; i < cn; i++) {\n const auto& e = g[c][i];\n usize to = e.to();\n if (used[to]) { continue; }\n ll cost = e.cost();\n sub_downs[i].push_back(0LL);\n sub_ups[i].push_back(0LL);\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\n if (sub_downs[i].size() <= d) { sub_downs[i].push_back(-inf_v<ll>); }\n chmax(sub_downs[i][d], min);\n for (const auto& e : g[s]) {\n const usize to = e.to();\n if (to == p or used[to]) { continue; }\n const ll cost = e.cost();\n dfs(dfs, to, s, d + 1, c - cost + gas[s], std::min(min, c - cost + gas[s]));\n }\n })(to, c, 1, gas[c] - cost, std::min(gas[c] - cost, 0LL));\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\n if (sub_ups[i].size() <= d) { sub_ups[i].push_back(-inf_v<ll>); }\n if (min == 0) { chmax(sub_ups[i][d], c); }\n for (const auto& e : g[s]) {\n const usize to = e.to();\n if (to == p or used[to]) { continue; }\n const ll cost = e.cost();\n const ll nmin = std::min(0LL, min - (cost - gas[to]));\n dfs(dfs, to, s, d + 1, c - cost + gas[to], nmin);\n }\n })(to, c, 1, -cost + gas[to], std::min(0LL, -cost + gas[to]));\n }\n usize dmax = 0;\n for (usize i = 0; i < cn; i++) { chmax(dmax, sub_downs[i].size()); }\n for (usize i = 0; i < cn; i++) {\n for (usize d = 1; d < sub_downs[i].size(); d++) {\n if (sub_downs[i][d] >= 0) { chmax(ans, d + 1); }\n }\n for (usize d = 1; d < sub_ups[i].size(); d++) {\n if (sub_ups[i][d] >= 0) { chmax(ans, d + 1); }\n }\n }\n for (usize i = 0; i < cn; i++) {\n for (int d = (int)sub_downs[i].size() - 1; d >= 1; d--) { chmax(sub_downs[i][d - 1], sub_downs[i][d]); }\n }\n std::vector<std::multiset<ll, std::greater<ll>>> sd(dmax);\n for (usize i = 0; i < cn; i++) {\n for (usize d = 0; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\n }\n for (usize i = 0; i < cn; i++) {\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].erase(sd[d].find(sub_downs[i][d])); }\n for (usize d = 1; d < sub_ups[i].size(); d++) {\n const ll up = sub_ups[i][d];\n usize inf = 0, sup = dmax;\n while (sup - inf > 1) {\n const usize mid = (inf + sup) / 2;\n const ll down = (sd[mid].empty() ? -inf_v<ll> : *sd[mid].begin());\n (up + down >= 0 and not sd[mid].empty() ? inf : sup) = mid;\n }\n if (inf > 0) { chmax(ans, d + inf + 1); }\n }\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\n }\n for (const usize nc : cg[c]) { dfs(dfs, nc); }\n })(centor);\n outln(ans);\n return 0;\n}","accuracy":1,"time_ms":380,"memory_kb":53232,"score_of_the_acc":-1.7708,"final_rank":7},{"submission_id":"aoj_2790_4054158","code_snippet":"#include <algorithm>\n#include <set>\n#include <limits>\n#include <utility>\n#include <iostream>\n#include <type_traits>\n#include <vector>\n#include <cstdint>\n#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2790\"\n\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};\ntemplate<typename F>\nstruct fixpoint : F\n{\n fixpoint(F&& f) : F(std::forward<F>(f)) {}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }\n};\n// template<typename F>\n// inline decltype(auto) mfp(F&& f) { return fixpoint<F>{std::forward<F>(f)}; }\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\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>\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>()...}; }\n\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 std::cout << \"\\n\", 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>\nvoid outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\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\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>>;\ntemplate<typename Edge = edge<>>\nclass centroid\n{\npublic:\n centroid(const base_tree<Edge>& tree) : cs(tree.size())\n {\n const std::size_t sz = tree.size();\n std::vector<std::size_t> sub(sz, 1);\n std::vector<bool> used(sz, false);\n auto size = [&, sz](auto&& self, const std::size_t s, const std::size_t p) -> std::size_t {\n sub[s] = 1;\n for (const auto& e : tree[s]) {\n const std::size_t to = e.to();\n if (to == p or used[to]) { continue; }\n sub[s] += self(self, to, s);\n }\n return sub[s];\n };\n auto search = [&, sz](auto&& self, const std::size_t s, const std::size_t p, const std::size_t tot) -> std::size_t {\n for (const auto& e : tree[s]) {\n const std::size_t to = e.to();\n if (p == to or used[to]) { continue; }\n if (sub[to] * 2 > tot) { return self(self, to, s, tot); }\n }\n return s;\n };\n auto build = [&, sz](auto&& self, const std::size_t s, const std::size_t pc) -> std::size_t {\n const std::size_t tot = size(size, s, sz), c = search(search, s, sz, tot);\n used[c] = true;\n if (pc != sz) { cs.add_edge(pc, c); }\n for (const auto& e : tree[c]) {\n const std::size_t to = e.to();\n if (not used[to]) { self(self, to, c); }\n }\n return c;\n };\n build(build, 0, sz);\n }\n const tree& centros() const { return cs; }\n\nprivate:\n tree cs;\n};\nint main()\n{\n auto N = in<usize>();\n auto gas = in_v<ll>({N});\n cost_graph<ll> g(N);\n for (usize i = 0; i < N - 1; i++) {\n const auto a = in<usize>() - 1;\n const auto b = in<usize>() - 1;\n const auto d = in<ll>();\n g.add_edge(a, b, d, true);\n }\n const auto cg = centroid<edge<ll>>{g}.centros();\n usize centor = 0;\n for (; centor < N; centor++) {\n if (cg.to(centor).empty()) { break; }\n }\n usize ans = 1;\n std::vector<bool> used(N, false);\n mfp([&](auto&& dfs, usize c) -> void {\n used[c] = true;\n const usize cn = g[c].size();\n std::vector<std::vector<ll>> sub_ups(cn);\n std::vector<std::vector<ll>> sub_downs(cn);\n for (usize i = 0; i < cn; i++) {\n const auto& e = g[c][i];\n usize to = e.to();\n if (used[to]) { continue; }\n ll cost = e.cost();\n sub_downs[i].push_back(0LL);\n sub_ups[i].push_back(0LL);\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\n if (sub_downs[i].size() <= d) { sub_downs[i].push_back(-inf_v<ll>); }\n chmax(sub_downs[i][d], min);\n for (const auto& e : g[s]) {\n const usize to = e.to();\n if (to == p or used[to]) { continue; }\n const ll cost = e.cost();\n chmin(min, c - cost + gas[s]);\n dfs(dfs, to, s, d + 1, c - cost + gas[s], min);\n }\n })(to, c, 1, gas[c] - cost, std::min(gas[c] - cost, 0LL));\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\n if (sub_ups[i].size() <= d) { sub_ups[i].push_back(-inf_v<ll>); }\n if (min == 0) { chmax(sub_ups[i][d], c); }\n for (const auto& e : g[s]) {\n const usize to = e.to();\n if (to == p or used[to]) { continue; }\n const ll cost = e.cost();\n min = std::min(0LL, min - (cost - gas[to]));\n dfs(dfs, to, s, d + 1, c - cost + gas[to], min);\n }\n })(to, c, 1, -cost + gas[to], std::min(0LL, -cost + gas[to]));\n }\n usize dmax = 0;\n for (usize i = 0; i < cn; i++) { chmax(dmax, sub_downs[i].size()); }\n for (usize i = 0; i < cn; i++) {\n for (usize d = 1; d < sub_downs[i].size(); d++) {\n if (sub_downs[i][d] >= 0) { chmax(ans, d + 1); }\n }\n for (usize d = 1; d < sub_ups[i].size(); d++) {\n if (sub_ups[i][d] >= 0) { chmax(ans, d + 1); }\n }\n }\n for (usize i = 0; i < cn; i++) {\n for (int d = (int)sub_downs[i].size() - 1; d >= 1; d--) { chmax(sub_downs[i][d - 1], sub_downs[i][d]); }\n }\n std::vector<std::multiset<ll, std::greater<ll>>> sd(dmax);\n for (usize i = 0; i < cn; i++) {\n for (usize d = 0; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\n }\n for (usize i = 0; i < cn; i++) {\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].erase(sd[d].find(sub_downs[i][d])); }\n for (usize d = 1; d < sub_ups[i].size(); d++) {\n const ll up = sub_ups[i][d];\n usize inf = 0, sup = dmax;\n while (sup - inf > 1) {\n const usize mid = (inf + sup) / 2;\n const ll down = (sd[mid].empty() ? -inf_v<ll> : *sd[mid].begin());\n (up + down >= 0 and not sd[mid].empty() ? inf : sup) = mid;\n }\n if (inf > 0) { chmax(ans, d + inf + 1); }\n }\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\n }\n for (const usize nc : cg[c]) { dfs(dfs, nc); }\n })(centor);\n outln(ans);\n return 0;\n}","accuracy":0.6075949367088608,"time_ms":380,"memory_kb":53204,"score_of_the_acc":-1.7702,"final_rank":9},{"submission_id":"aoj_2790_4054157","code_snippet":"#include <algorithm>\n#include <set>\n#include <limits>\n#include <utility>\n#include <iostream>\n#include <type_traits>\n#include <vector>\n#include <cstdint>\n#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2790\"\n\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};\ntemplate<typename F>\nstruct fixpoint : F\n{\n fixpoint(F&& f) : F(std::forward<F>(f)) {}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }\n};\n// template<typename F>\n// inline decltype(auto) mfp(F&& f) { return fixpoint<F>{std::forward<F>(f)}; }\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\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>\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>()...}; }\n\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 std::cout << \"\\n\", 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>\nvoid outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\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\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>>;\ntemplate<typename Edge = edge<>>\nclass centroid\n{\npublic:\n centroid(const base_tree<Edge>& tree) : cs(tree.size())\n {\n const std::size_t sz = tree.size();\n std::vector<std::size_t> sub(sz, 1);\n std::vector<bool> used(sz, false);\n auto size = [&, sz](auto&& self, const std::size_t s, const std::size_t p) -> std::size_t {\n sub[s] = 1;\n for (const auto& e : tree[s]) {\n const std::size_t to = e.to();\n if (to == p or used[to]) { continue; }\n sub[s] += self(self, to, s);\n }\n return sub[s];\n };\n auto search = [&, sz](auto&& self, const std::size_t s, const std::size_t p, const std::size_t tot) -> std::size_t {\n for (const auto& e : tree[s]) {\n const std::size_t to = e.to();\n if (p == to or used[to]) { continue; }\n if (sub[to] * 2 > tot) { return self(self, to, s, tot); }\n }\n return s;\n };\n auto build = [&, sz](auto&& self, const std::size_t s, const std::size_t pc) -> std::size_t {\n const std::size_t tot = size(size, s, sz), c = search(search, s, sz, tot);\n used[c] = true;\n if (pc != sz) { cs.add_edge(pc, c); }\n for (const auto& e : tree[c]) {\n const std::size_t to = e.to();\n if (not used[to]) { self(self, to, c); }\n }\n return c;\n };\n build(build, 0, sz);\n }\n const tree& centros() const { return cs; }\n\nprivate:\n tree cs;\n};\nint main()\n{\n auto N = in<usize>();\n auto gas = in_v<ll>({N});\n cost_graph<ll> g(N);\n for (usize i = 0; i < N - 1; i++) {\n const auto a = in<usize>() - 1;\n const auto b = in<usize>() - 1;\n const auto d = in<ll>();\n g.add_edge(a, b, d, true);\n }\n const auto cg = centroid<edge<ll>>{g}.centros();\n usize centor = 0;\n for (; centor < N; centor++) {\n if (cg.to(centor).empty()) { break; }\n }\n usize ans = 1;\n std::vector<bool> used(N, false);\n mfp([&](auto&& dfs, usize c) -> void {\n used[c] = true;\n const usize cn = g[c].size();\n std::vector<std::vector<ll>> sub_ups(cn);\n std::vector<std::vector<ll>> sub_downs(cn);\n for (usize i = 0; i < cn; i++) {\n const auto& e = g[c][i];\n usize to = e.to();\n if (used[to]) { continue; }\n ll cost = e.cost();\n sub_downs[i].push_back(0LL);\n sub_ups[i].push_back(0LL);\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\n if (sub_downs[i].size() <= d) { sub_downs[i].push_back(c); }\n chmax(sub_downs[i][d], min);\n for (const auto& e : g[s]) {\n const usize to = e.to();\n if (to == p or used[to]) { continue; }\n const ll cost = e.cost();\n chmin(min, c - cost + gas[s]);\n dfs(dfs, to, s, d + 1, c - cost + gas[s], min);\n }\n })(to, c, 1, gas[c] - cost, std::min(gas[c] - cost, 0LL));\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\n if (sub_ups[i].size() <= d) { sub_ups[i].push_back(c); }\n if (min == 0) { chmax(sub_ups[i][d], c); }\n for (const auto& e : g[s]) {\n const usize to = e.to();\n if (to == p or used[to]) { continue; }\n const ll cost = e.cost();\n chmin(min, std::min(0LL, min) - (cost - gas[to]));\n dfs(dfs, to, s, d + 1, c - cost + gas[to], min);\n }\n })(to, c, 1, -cost + gas[to], std::min(0LL, -cost + gas[to]));\n }\n usize dmax = 0;\n for (usize i = 0; i < cn; i++) { chmax(dmax, sub_downs[i].size()); }\n for (usize i = 0; i < cn; i++) {\n for (usize d = 1; d < sub_downs[i].size(); d++) {\n if (sub_downs[i][d] >= 0) { chmax(ans, d + 1); }\n }\n for (usize d = 1; d < sub_ups[i].size(); d++) {\n if (sub_ups[i][d] >= 0) { chmax(ans, d + 1); }\n }\n }\n for (usize i = 0; i < cn; i++) {\n for (int d = (int)sub_downs[i].size() - 1; d >= 1; d--) { chmax(sub_downs[i][d - 1], sub_downs[i][d]); }\n }\n std::vector<std::multiset<ll, std::greater<ll>>> sd(dmax);\n for (usize i = 0; i < cn; i++) {\n for (usize d = 0; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\n }\n for (usize i = 0; i < cn; i++) {\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].erase(sd[d].find(sub_downs[i][d])); }\n for (usize d = 1; d < sub_ups[i].size(); d++) {\n const ll up = sub_ups[i][d];\n usize inf = 0, sup = dmax;\n while (sup - inf > 1) {\n const usize mid = (inf + sup) / 2;\n const ll down = (sd[mid].empty() ? -inf_v<ll> : *sd[mid].begin());\n (up + down >= 0 and not sd[mid].empty() ? inf : sup) = mid;\n }\n if (inf > 0) { chmax(ans, d + inf + 1); }\n }\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\n }\n for (const usize nc : cg[c]) { dfs(dfs, nc); }\n })(centor);\n outln(ans);\n return 0;\n}","accuracy":0.4050632911392405,"time_ms":260,"memory_kb":49828,"score_of_the_acc":-1.4482,"final_rank":18},{"submission_id":"aoj_2790_4054153","code_snippet":"#include <algorithm>\n#include <set>\n#include <limits>\n#include <utility>\n#include <iostream>\n#include <type_traits>\n#include <vector>\n#include <cstdint>\n#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2790\"\n\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};\ntemplate<typename F>\nstruct fixpoint : F\n{\n fixpoint(F&& f) : F(std::forward<F>(f)) {}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }\n};\n// template<typename F>\n// inline decltype(auto) mfp(F&& f) { return fixpoint<F>{std::forward<F>(f)}; }\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\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>\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>()...}; }\n\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 std::cout << \"\\n\", 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>\nvoid outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\n# define SHOW(...) static_cast<void>(0)\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\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>>;\ntemplate<typename Edge = edge<>>\nclass centroid\n{\npublic:\n centroid(const base_tree<Edge>& tree) : cs(tree.size())\n {\n const std::size_t sz = tree.size();\n std::vector<std::size_t> sub(sz, 1);\n std::vector<bool> used(sz, false);\n auto size = [&, sz](auto&& self, const std::size_t s, const std::size_t p) -> std::size_t {\n sub[s] = 1;\n for (const auto& e : tree[s]) {\n const std::size_t to = e.to();\n if (to == p or used[to]) { continue; }\n sub[s] += self(self, to, s);\n }\n return sub[s];\n };\n auto search = [&, sz](auto&& self, const std::size_t s, const std::size_t p, const std::size_t tot) -> std::size_t {\n for (const auto& e : tree[s]) {\n const std::size_t to = e.to();\n if (p == to or used[to]) { continue; }\n if (sub[to] * 2 > tot) { return self(self, to, s, tot); }\n }\n return s;\n };\n auto build = [&, sz](auto&& self, const std::size_t s, const std::size_t pc) -> std::size_t {\n const std::size_t tot = size(size, s, sz), c = search(search, s, sz, tot);\n used[c] = true;\n if (pc != sz) { cs.add_edge(pc, c); }\n for (const auto& e : tree[c]) {\n const std::size_t to = e.to();\n if (not used[to]) { self(self, to, c); }\n }\n return c;\n };\n build(build, 0, sz);\n }\n const tree& centros() const { return cs; }\n\nprivate:\n tree cs;\n};\nint main()\n{\n auto N = in<usize>();\n auto gas = in_v<ll>({N});\n cost_graph<ll> g(N);\n for (usize i = 0; i < N - 1; i++) {\n const auto a = in<usize>() - 1;\n const auto b = in<usize>() - 1;\n const auto d = in<ll>();\n g.add_edge(a, b, d, true);\n }\n const auto cg = centroid<edge<ll>>{g}.centros();\n usize centor = 0;\n for (; centor < N; centor++) {\n if (cg.to(centor).empty()) { break; }\n }\n usize ans = 1;\n std::vector<bool> used(N, false);\n mfp([&](auto&& dfs, usize c) -> void {\n used[c] = true;\n const usize cn = g[c].size();\n std::vector<std::vector<ll>> sub_ups(cn);\n std::vector<std::vector<ll>> sub_downs(cn);\n for (usize i = 0; i < cn; i++) {\n const auto& e = g[c][i];\n usize to = e.to();\n if (used[to]) { continue; }\n ll cost = e.cost();\n sub_downs[i].push_back(0LL);\n sub_ups[i].push_back(0LL);\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c) -> void {\n if (sub_downs[i].size() <= d) { sub_downs[i].push_back(c); }\n chmax(sub_downs[i][d], c);\n for (const auto& e : g[s]) {\n const usize to = e.to();\n if (to == p or used[to]) { continue; }\n const ll cost = e.cost();\n dfs(dfs, to, s, d + 1, c - cost + gas[s]);\n }\n })(to, c, 1, gas[c] - cost);\n for (int d = (int)sub_downs[i].size() - 1; d >= 1; d--) { chmax(sub_downs[i][d - 1], sub_downs[i][d]); }\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c) -> void {\n if (sub_ups[i].size() <= d) { sub_ups[i].push_back(c); }\n chmax(sub_ups[i][d], c);\n for (const auto& e : g[s]) {\n const usize to = e.to();\n if (to == p or used[to]) { continue; }\n const ll cost = e.cost();\n dfs(dfs, to, s, d + 1, c - cost + gas[to]);\n }\n })(to, c, 1, -cost + gas[to]);\n for (int d = (int)sub_ups[i].size() - 1; d >= 1; d--) { chmax(sub_ups[i][d - 1], sub_ups[i][d]); }\n }\n SHOW(c, sub_downs, sub_ups);\n usize dmax = 0;\n for (usize i = 0; i < cn; i++) { chmax(dmax, sub_downs[i].size()); }\n SHOW(dmax);\n std::vector<std::multiset<ll, std::greater<ll>>> sd(dmax);\n for (usize i = 0; i < cn; i++) {\n for (usize d = 0; d < sub_downs[i].size(); d++) {\n if (sub_downs[i][d] >= 0) { chmax(ans, d + 1); }\n }\n for (usize d = 0; d < sub_ups[i].size(); d++) {\n if (sub_ups[i][d] >= 0) { chmax(ans, d + 1); }\n }\n }\n for (usize i = 0; i < cn; i++) {\n for (usize d = 0; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\n }\n for (usize i = 0; i < cn; i++) {\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].erase(sd[d].find(sub_downs[i][d])); }\n SHOW(i, sd);\n for (usize d = 1; d < sub_downs[i].size(); d++) {\n const ll up = sub_ups[i][d];\n usize inf = 0, sup = dmax;\n while (sup - inf > 1) {\n const usize mid = (inf + sup) / 2;\n const ll down = (sd[mid].empty() ? -inf_v<ll> : *sd[mid].begin());\n (up + down >= 0 ? inf : sup) = mid;\n }\n SHOW(i, d, inf, sup);\n if (inf > 0) { chmax(ans, d + inf + 1); }\n }\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\n }\n for (const usize nc : cg[c]) { dfs(dfs, nc); }\n })(centor);\n outln(ans);\n return 0;\n}","accuracy":0.4050632911392405,"time_ms":230,"memory_kb":49876,"score_of_the_acc":-1.3867,"final_rank":17},{"submission_id":"aoj_2790_3702483","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100050\n\nstruct Edge{\n Edge(int arg_to,int arg_value,int arg_rev_value){\n to = arg_to;\n value = arg_value;\n rev_value = arg_rev_value;\n }\n int to,value,rev_value;\n};\n\nstruct Info{\n\n int node_id,max_rest_size;\n};\n\n\nint *subtree_size;\nbool *centroid;\nvector<Edge> G[NUM];\n\nvoid compute_subtree_size(int node_id,int parent){\n\n subtree_size[node_id] = 1;\n\n for(int i = 0; i < G[node_id].size(); i++){\n\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\n\n compute_subtree_size(G[node_id][i].to,node_id);\n\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\n }\n}\n\n\nInfo search_centroid(int node_id,int parent,int total_size){\n\n Info ret,tmp;\n ret.max_rest_size = BIG_NUM;\n ret.node_id = -1;\n\n int sum = 1,maximum = 0;\n int next_node;\n\n for(int i = 0; i < G[node_id].size(); i++){\n\n next_node = G[node_id][i].to;\n if(centroid[next_node] == true || next_node == parent)continue;\n\n tmp = search_centroid(next_node,node_id,total_size);\n\n if(ret.max_rest_size > tmp.max_rest_size){\n\n ret.max_rest_size = tmp.max_rest_size;\n ret.node_id = tmp.node_id;\n }\n\n maximum = max(maximum,subtree_size[next_node]);\n sum += subtree_size[next_node];\n }\n maximum = max(maximum,total_size-sum);\n\n if(ret.max_rest_size > maximum){\n ret.max_rest_size = maximum;\n ret.node_id = node_id;\n }\n\n return ret;\n}\n\n\nint *DOWN;\nint max_depth_DOWN;\n\nvoid calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\n\n\tDOWN[depth] = max(DOWN[depth],minimum);\n\tmax_depth_DOWN = max(max_depth_DOWN,depth);\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tint next_sum = sum + G[node_id][i].value;\n\t\tint next_minimum = min(minimum,next_sum);\n\n\t\tcalc_DOWN(next_node,node_id,depth+1,next_minimum,next_sum);\n\t}\n}\n\n\nint ans;\n\nvoid calc_UP(int node_id,int parent,int depth,int add,int sum,int maximum){\n\n\tint next_sum = sum+add;\n\n\tif(next_sum >= maximum){\n\n\t\tint L,R,mid;\n\n\t\tans = max(ans,depth+1);\n\n\t\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\n\n\t\twhile(L <= R){\n\n\t\t\tif(next_sum+DOWN[mid] >= 0){\n\n\t\t\t\tans = max(ans,depth+mid+1);\n\t\t\t\tL = mid+1;\n\n\t\t\t}else{\n\n\t\t\t\tR = mid-1;\n\t\t\t}\n\t\t\tmid = (L+R)/2;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(centroid[next_node] == true || next_node == parent)continue;\n\n\t\tcalc_UP(next_node,node_id,depth+1,G[node_id][i].rev_value,next_sum,max(maximum,next_sum));\n\t}\n}\n\n\nvoid solve_subproblem(int node_id){\n\n compute_subtree_size(node_id,-1);\n int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\n int size = subtree_size[node_id];\n\n centroid[center] = true;\n\n int next_node;\n\n for(int i = 0; i < G[center].size(); i++){\n\n next_node = G[center][i].to;\n\n if(centroid[next_node] == true)continue;\n\n solve_subproblem(next_node);\n }\n\n centroid[center] = false;\n\n for(int loop = 0; loop < 2; loop++){\n\n DOWN[0] = 0;\n for(int i = 1; i < size; i++){\n\n DOWN[i] = -BIG_NUM;\n }\n max_depth_DOWN = 0;\n\n for(int i = 0; i < G[center].size(); i++){\n\n next_node = G[center][i].to;\n\n if(centroid[next_node])continue;\n\n calc_UP(next_node,center,1,G[center][i].rev_value,0,0);\n calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value);\n }\n reverse(G[center].begin(),G[center].end());\n }\n}\n\nint main(){\n\n\tint V;\n\n scanf(\"%d\",&V);\n\n int gasoline[V+5];\n\tsubtree_size = new int[V+5];\n\tDOWN = new int[V+5];\n\tcentroid = new bool[V+5];\n\n for(int i = 0; i < V; i++){\n\n scanf(\"%d\",&gasoline[i]);\n }\n\n int from,to,dist;\n\n for(int i = 0; i < V-1; i++){\n\n scanf(\"%d %d %d\",&from,&to,&dist);\n from--;\n to--;\n\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\n }\n\n\n for(int i = 0; i < V; i++){\n\n centroid[i] = false;\n }\n\n ans = 0;\n\n solve_subproblem(0);\n\n printf(\"%d\\n\",max(1,ans));\n\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":20908,"score_of_the_acc":-0.5601,"final_rank":5},{"submission_id":"aoj_2790_3702475","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100050\n\nstruct Edge{\n Edge(int arg_to,int arg_value,int arg_rev_value){\n to = arg_to;\n value = arg_value;\n rev_value = arg_rev_value;\n }\n int to,value,rev_value;\n};\n\nstruct Info{\n\n int node_id,max_rest_size;\n};\n\n\nint *subtree_size;\nbool *centroid; //その頂点が既に分割に用いられているか\nvector<Edge> G[NUM];\n\nvoid compute_subtree_size(int node_id,int parent){\n\n subtree_size[node_id] = 1;\n\n for(int i = 0; i < G[node_id].size(); i++){\n\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\n\n compute_subtree_size(G[node_id][i].to,node_id);\n\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\n }\n}\n\n\nInfo search_centroid(int node_id,int parent,int total_size){\n\n Info ret,tmp;\n ret.max_rest_size = BIG_NUM;\n ret.node_id = -1;\n\n int sum = 1,maximum = 0;\n int next_node;\n\n for(int i = 0; i < G[node_id].size(); i++){ //子を走査\n\n next_node = G[node_id][i].to;\n if(centroid[next_node] == true || next_node == parent)continue;\n\n tmp = search_centroid(next_node,node_id,total_size);\n\n if(ret.max_rest_size > tmp.max_rest_size){\n\n ret.max_rest_size = tmp.max_rest_size;\n ret.node_id = tmp.node_id;\n }\n\n maximum = max(maximum,subtree_size[next_node]);\n sum += subtree_size[next_node];\n }\n maximum = max(maximum,total_size-sum);\n\n if(ret.max_rest_size > maximum){\n ret.max_rest_size = maximum;\n ret.node_id = node_id;\n }\n\n return ret;\n}\n\n\nint *DOWN;\nint max_depth_DOWN;\n\nvoid calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\n\n\tDOWN[depth] = max(DOWN[depth],minimum);\n\tmax_depth_DOWN = max(max_depth_DOWN,depth);\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tint next_sum = sum + G[node_id][i].value;\n\t\tint next_minimum = min(minimum,next_sum);\n\n\t\tcalc_DOWN(next_node,node_id,depth+1,next_minimum,next_sum);\n\t}\n}\n\n\nint ans;\n\n//node_id以下の出発点で、最後にparentに辿り着く際の、最大のガソリン残量(★途中で負になる場合に注意★)\nvoid calc_UP(int node_id,int parent,int depth,int add,int sum,int maximum){\n\n\tint next_sum = sum+add;\n\n\tif(next_sum >= maximum){\n\n\t\tint L,R,mid;\n\n\t\tans = max(ans,depth+1); //上りのみの場合\n\n\t\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\n\n\t\twhile(L <= R){\n\n\t\t\tif(next_sum+DOWN[mid] >= 0){\n\n\t\t\t\tans = max(ans,depth+mid+1);\n\t\t\t\tL = mid+1;\n\n\t\t\t}else{\n\n\t\t\t\tR = mid-1;\n\t\t\t}\n\t\t\tmid = (L+R)/2;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(centroid[next_node] == true || next_node == parent)continue;\n\n\t\tcalc_UP(next_node,node_id,depth+1,G[node_id][i].rev_value,next_sum,max(maximum,next_sum));\n\t}\n}\n\n\nvoid solve_subproblem(int node_id){\n\n //重心となる頂点centerを探す\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\n int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\n int size = subtree_size[node_id]; //★再帰している間に値が書き換わるので退避★\n\n //printf(\"node_id:%d center:%d size[node]:%d\\n\",node_id,center,subtree_size[node_id]);\n\n centroid[center] = true;\n\n int next_node;\n\n //子の部分木を先に処理する\n for(int i = 0; i < G[center].size(); i++){\n\n next_node = G[center][i].to;\n\n if(centroid[next_node] == true)continue;\n\n solve_subproblem(next_node);\n }\n\n centroid[center] = false;\n\n //printf(\"subtree_size[%d]:%d\\n\",node_id,subtree_size[node_id]);\n\n for(int loop = 0; loop < 2; loop++){\n\n DOWN[0] = 0;\n for(int i = 1; i < size; i++){ //★サイズに注意★\n\n DOWN[i] = -BIG_NUM;\n }\n max_depth_DOWN = 0;\n\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\n\n next_node = G[center][i].to;\n\n if(centroid[next_node])continue;\n\n //右端の上りを計算\n calc_UP(next_node,center,1,G[center][i].rev_value,0,0);\n //右端の下りを計算\n calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value);\n }\n reverse(G[center].begin(),G[center].end());\n }\n}\n\nint main(){\n\n\tint V;\n\n scanf(\"%d\",&V);\n\n int gasoline[V+5];\n\tsubtree_size = new int[V+5];\n\tDOWN = new int[V+5];\n\tcentroid = new bool[V+5];\n\n for(int i = 0; i < V; i++){\n\n scanf(\"%d\",&gasoline[i]);\n }\n\n int from,to,dist;\n\n for(int i = 0; i < V-1; i++){\\\n\n scanf(\"%d %d %d\",&from,&to,&dist);\n from--;\n to--;\n\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\n }\n\n\n for(int i = 0; i < V; i++){\n\n centroid[i] = false;\n }\n\n ans = 0;\n\n solve_subproblem(0);\n\n printf(\"%d\\n\",max(1,ans));\n\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":20872,"score_of_the_acc":-0.5593,"final_rank":4},{"submission_id":"aoj_2790_3701506","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100020\n\nstruct Edge{\n Edge(int arg_to,int arg_value,int arg_rev_value){\n to = arg_to;\n value = arg_value;\n rev_value = arg_rev_value;\n }\n int to,value,rev_value;\n};\n\n\nstatic int gasoline[NUM],subtree_size[NUM];\nstatic bool centroid[NUM]; //その頂点が既に分割に用いられているか\nstatic vector<Edge> G[NUM];\n\nstatic void compute_subtree_size(int node_id,int parent){\n\n subtree_size[node_id] = 1;\n\n for(int i = 0; i < G[node_id].size(); i++){\n\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\n\n compute_subtree_size(G[node_id][i].to,node_id);\n\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\n }\n}\n\nvector<int> CENTROID;\n\nstatic void search_centroid(int node_id,int parent,int total_size){\n\n\tbool FLG = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\t\tsearch_centroid(next_node,node_id,total_size);\n\n\t\tif(subtree_size[next_node] > total_size/2){\n\t\t\tFLG = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(total_size-subtree_size[node_id] > total_size/2)return;\n\tif(FLG)CENTROID.push_back(node_id);\n}\n\n\nstatic int max_depth_DOWN,max_depth_UP;\nstatic int DOWN[NUM];\n\nstatic int V;\nstatic int root,ans;\n\nstatic int calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\n\n\tDOWN[depth] = max(DOWN[depth],minimum);\n\tmax_depth_DOWN = max(max_depth_DOWN,depth);\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tint next_sum = sum + G[node_id][i].value;\n\t\tint next_minimum = min(minimum,next_sum);\n\n\t\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\n\t}\n\treturn DOWN[depth];\n}\n\n\nstatic void calc_UP(int node_id,int parent,int depth,int sum,int maximum){\n\n\t//sum += add; //親方向へのコストを足す\n\t//int next_sum = sum+add;\n\tint next_sum = sum;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tif(G[node_id][i].to == parent){\n\t\t\tnext_sum += G[node_id][i].value;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\n\tif(next_sum >= maximum){\n\n\t\tmax_depth_UP = max(max_depth_UP,depth);\n\n\t\tint L,R,mid;\n\n\t\t //最大値を計算\n\t\tans = max(ans,depth+1); //上りだけの場合\n\n\t\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\n\n\t\twhile(L <= R){\n\n\t\t\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\n\n\t\t\t\tans = max(ans,depth+mid+1);\n\t\t\t\tL = mid+1;\n\n\t\t\t}else{\n\n\t\t\t\tR = mid-1;\n\t\t\t}\n\t\t\tmid = (L+R)/2;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\n\t}\n}\n\nstatic void solve_subproblem(int node_id){\n\n //重心となる頂点centerを探す\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\n CENTROID.clear();\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\n\tsearch_centroid(node_id,-1,subtree_size[node_id]);\n int center = CENTROID[0];\n\n centroid[center] = true;\n\n int next_node;\n\n //子の部分木を先に処理する\n for(int i = 0; i < G[center].size(); i++){\n\n next_node = G[center][i].to;\n\n if(centroid[next_node] == true)continue;\n\n solve_subproblem(next_node);\n }\n\n centroid[center] = false;\n\n for(int loop = 0; loop < 2; loop++){\n\n DOWN[0] = 0;\n for(int i = 1; i <= subtree_size[node_id]+5; i++){ //★サイズに注意★\n\n DOWN[i] = -BIG_NUM;\n }\n max_depth_DOWN = 0;\n\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\n\n next_node = G[center][i].to;\n\n if(centroid[next_node])continue;\n\n calc_UP(next_node,center,1,0,0);\n\n //右端の下りを計算\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\n }\n\n reverse(G[center].begin(),G[center].end());\n }\n\n}\n\nint main(){\n\n scanf(\"%d\",&V);\n\n for(int i = 0; i < V; i++){\n\n scanf(\"%d\",&gasoline[i]);\n }\n\n int from,to,dist;\n\n for(int i = 0; i < V-1; i++){\n\n scanf(\"%d %d %d\",&from,&to,&dist);\n from--;\n to--;\n\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\n }\n\n\n root = 0;\n\n for(int i = 0; i < V; i++){\n\n centroid[i] = false;\n }\n\n ans = 0;\n\n solve_subproblem(root);\n\n printf(\"%d\\n\",max(1,ans));\n\n return 0;\n}","accuracy":0.4430379746835443,"time_ms":70,"memory_kb":13984,"score_of_the_acc":-0.2873,"final_rank":10},{"submission_id":"aoj_2790_3701501","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100020\n\nstruct Edge{\n Edge(int arg_to,int arg_value,int arg_rev_value){\n to = arg_to;\n value = arg_value;\n rev_value = arg_rev_value;\n }\n int to,value,rev_value;\n};\n\n\nstatic int gasoline[NUM],subtree_size[NUM];\nstatic bool centroid[NUM]; //その頂点が既に分割に用いられているか\nstatic vector<Edge> G[NUM];\n\nvoid compute_subtree_size(int node_id,int parent){\n\n subtree_size[node_id] = 1;\n\n for(int i = 0; i < G[node_id].size(); i++){\n\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\n\n compute_subtree_size(G[node_id][i].to,node_id);\n\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\n }\n}\n\nvector<int> CENTROID;\n\nvoid search_centroid(int node_id,int parent,int total_size){\n\n\tbool FLG = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\t\tsearch_centroid(next_node,node_id,total_size);\n\n\t\tif(subtree_size[next_node] > total_size/2){\n\t\t\tFLG = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(total_size-subtree_size[node_id] > total_size/2)return;\n\tif(FLG)CENTROID.push_back(node_id);\n}\n\n\nstatic int max_depth_DOWN,max_depth_UP;\nstatic int DOWN[NUM];\n\nstatic int V;\nstatic int root,ans;\n\nint calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\n\n\tDOWN[depth] = max(DOWN[depth],minimum);\n\tmax_depth_DOWN = max(max_depth_DOWN,depth);\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tint next_sum = sum + G[node_id][i].value;\n\t\tint next_minimum = min(minimum,next_sum);\n\n\t\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\n\t}\n\treturn DOWN[depth];\n}\n\n\nvoid calc_UP(int node_id,int parent,int depth,int sum,int maximum){\n\n\t//sum += add; //親方向へのコストを足す\n\t//int next_sum = sum+add;\n\tint next_sum = sum;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tif(G[node_id][i].to == parent){\n\t\t\tnext_sum += G[node_id][i].value;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\n\tif(next_sum >= maximum){\n\n\t\tmax_depth_UP = max(max_depth_UP,depth);\n\n\t\tint L,R,mid;\n\n\t\t //最大値を計算\n\t\tans = max(ans,depth+1); //上りだけの場合\n\n\t\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\n\n\t\twhile(L <= R){\n\n\t\t\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\n\n\t\t\t\tans = max(ans,depth+mid+1);\n\t\t\t\tL = mid+1;\n\n\t\t\t}else{\n\n\t\t\t\tR = mid-1;\n\t\t\t}\n\t\t\tmid = (L+R)/2;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\n\t}\n}\n\nvoid solve_subproblem(int node_id){\n\n //重心となる頂点centerを探す\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\n CENTROID.clear();\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\n\tsearch_centroid(node_id,-1,subtree_size[node_id]);\n int center = CENTROID[0];\n\n centroid[center] = true;\n\n int next_node;\n\n //子の部分木を先に処理する\n for(int i = 0; i < G[center].size(); i++){\n\n next_node = G[center][i].to;\n\n if(centroid[next_node] == true)continue;\n\n solve_subproblem(next_node);\n }\n\n centroid[center] = false;\n\n for(int loop = 0; loop < 2; loop++){\n\n DOWN[0] = 0;\n for(int i = 1; i <= subtree_size[node_id]+5; i++){ //★サイズに注意★\n\n DOWN[i] = -BIG_NUM;\n }\n max_depth_DOWN = 0;\n\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\n\n next_node = G[center][i].to;\n\n if(centroid[next_node])continue;\n\n calc_UP(next_node,center,1,0,0);\n\n //右端の下りを計算\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\n }\n\n reverse(G[center].begin(),G[center].end());\n }\n\n}\n\nint main(){\n\n scanf(\"%d\",&V);\n\n for(int i = 0; i < V; i++){\n\n scanf(\"%d\",&gasoline[i]);\n }\n\n int from,to,dist;\n\n for(int i = 0; i < V-1; i++){\n\n scanf(\"%d %d %d\",&from,&to,&dist);\n from--;\n to--;\n\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\n }\n\n\n root = 0;\n\n for(int i = 0; i < V; i++){\n\n centroid[i] = false;\n }\n\n ans = 0;\n\n solve_subproblem(root);\n\n printf(\"%d\\n\",max(1,ans));\n\n return 0;\n}","accuracy":0.4430379746835443,"time_ms":70,"memory_kb":13992,"score_of_the_acc":-0.2875,"final_rank":11},{"submission_id":"aoj_2790_3701500","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100020\n\nstruct Edge{\n Edge(int arg_to,int arg_value,int arg_rev_value){\n to = arg_to;\n value = arg_value;\n rev_value = arg_rev_value;\n }\n int to,value,rev_value;\n};\n\n\nint gasoline[NUM],subtree_size[NUM];\nbool centroid[NUM]; //その頂点が既に分割に用いられているか\nvector<Edge> G[NUM];\n\nvoid compute_subtree_size(int node_id,int parent){\n\n subtree_size[node_id] = 1;\n\n for(int i = 0; i < G[node_id].size(); i++){\n\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\n\n compute_subtree_size(G[node_id][i].to,node_id);\n\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\n }\n}\n\nvector<int> CENTROID;\n\nvoid search_centroid(int node_id,int parent,int total_size){\n\n\tbool FLG = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\t\tsearch_centroid(next_node,node_id,total_size);\n\n\t\tif(subtree_size[next_node] > total_size/2){\n\t\t\tFLG = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(total_size-subtree_size[node_id] > total_size/2)return;\n\tif(FLG)CENTROID.push_back(node_id);\n}\n\n\nint max_depth_DOWN,max_depth_UP;\nint DOWN[NUM];\n\nint V;\nint root,ans;\n\nint calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\n\n\tDOWN[depth] = max(DOWN[depth],minimum);\n\tmax_depth_DOWN = max(max_depth_DOWN,depth);\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tint next_sum = sum + G[node_id][i].value;\n\t\tint next_minimum = min(minimum,next_sum);\n\n\t\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\n\t}\n\treturn DOWN[depth];\n}\n\n\nvoid calc_UP(int node_id,int parent,int depth,int sum,int maximum){\n\n\t//sum += add; //親方向へのコストを足す\n\t//int next_sum = sum+add;\n\tint next_sum = sum;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tif(G[node_id][i].to == parent){\n\t\t\tnext_sum += G[node_id][i].value;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\n\tif(next_sum >= maximum){\n\n\t\tmax_depth_UP = max(max_depth_UP,depth);\n\n\t\tint L,R,mid;\n\n\t\t //最大値を計算\n\t\tans = max(ans,depth+1); //上りだけの場合\n\n\t\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\n\n\t\twhile(L <= R){\n\n\t\t\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\n\n\t\t\t\tans = max(ans,depth+mid+1);\n\t\t\t\tL = mid+1;\n\n\t\t\t}else{\n\n\t\t\t\tR = mid-1;\n\t\t\t}\n\t\t\tmid = (L+R)/2;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\n\t}\n}\n\nvoid solve_subproblem(int node_id){\n\n //重心となる頂点centerを探す\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\n CENTROID.clear();\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\n\tsearch_centroid(node_id,-1,subtree_size[node_id]);\n int center = CENTROID[0];\n\n centroid[center] = true;\n\n int next_node;\n\n //子の部分木を先に処理する\n for(int i = 0; i < G[center].size(); i++){\n\n next_node = G[center][i].to;\n\n if(centroid[next_node] == true)continue;\n\n solve_subproblem(next_node);\n }\n\n centroid[center] = false;\n\n for(int loop = 0; loop < 2; loop++){\n\n DOWN[0] = 0;\n for(int i = 1; i <= subtree_size[node_id]+5; i++){ //★サイズに注意★\n\n DOWN[i] = -BIG_NUM;\n }\n max_depth_DOWN = 0;\n\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\n\n next_node = G[center][i].to;\n\n if(centroid[next_node])continue;\n\n calc_UP(next_node,center,1,0,0);\n\n //右端の下りを計算\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\n }\n\n reverse(G[center].begin(),G[center].end());\n }\n\n}\n\nint main(){\n\n scanf(\"%d\",&V);\n\n for(int i = 0; i < V; i++){\n\n scanf(\"%d\",&gasoline[i]);\n }\n\n int from,to,dist;\n\n for(int i = 0; i < V-1; i++){\n\n scanf(\"%d %d %d\",&from,&to,&dist);\n from--;\n to--;\n\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\n }\n\n\n root = 0;\n\n for(int i = 0; i < V; i++){\n\n centroid[i] = false;\n }\n\n ans = 0;\n\n solve_subproblem(root);\n\n printf(\"%d\\n\",max(1,ans));\n\n return 0;\n}","accuracy":0.4430379746835443,"time_ms":70,"memory_kb":14028,"score_of_the_acc":-0.2882,"final_rank":12},{"submission_id":"aoj_2790_3701461","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100020\n\nstruct Edge{\n Edge(int arg_to,int arg_value,int arg_rev_value){\n to = arg_to;\n value = arg_value;\n rev_value = arg_rev_value;\n }\n int to,value,rev_value;\n};\n\nint subtree_size[NUM];\nbool centroid[NUM]; //その頂点が既に分割に用いられているか\nvector<Edge> G[NUM];\n\nvoid compute_subtree_size(int node_id,int parent){\n\n subtree_size[node_id] = 1;\n\n for(int i = 0; i < G[node_id].size(); i++){\n\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\n\n compute_subtree_size(G[node_id][i].to,node_id);\n\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\n }\n}\n\n\nvector<int> CENTROID;\nvoid search_centroid(int node_id,int parent,int total_size){\n\n\tbool FLG = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\t\tsearch_centroid(next_node,node_id,total_size);\n\n\t\tif(subtree_size[next_node] > total_size/2){\n\t\t\tFLG = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(total_size-subtree_size[node_id] > total_size/2)return;\n\tif(FLG)CENTROID.push_back(node_id);\n}\n\nint ans = 0;\nint gasoline[NUM];\n\n\nint DOWN[NUM];\nint max_depth_DOWN,max_depth_UP;\n\n\nint calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\n\n\tDOWN[depth] = max(DOWN[depth],minimum);\n\tmax_depth_DOWN = max(max_depth_DOWN,depth);\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tint next_sum = sum + G[node_id][i].value;\n\t\tint next_minimum = min(minimum,next_sum);\n\n\t\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\n\t}\n\treturn DOWN[depth];\n}\n\n\nvoid calc_UP(int node_id,int parent,int depth,int sum,int maximum){\n\n\t//sum += add; //親方向へのコストを足す\n\t//int next_sum = sum+add;\n\tint next_sum = sum;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tif(G[node_id][i].to == parent){\n\t\t\tnext_sum += G[node_id][i].value;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\n\tif(next_sum >= maximum){\n\n\t\tmax_depth_UP = max(max_depth_UP,depth);\n\n\t\tint L,R,mid;\n\n\t\t //最大値を計算\n\t\tans = max(ans,depth+1); //上りだけの場合\n\n\t\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\n\n\t\twhile(L <= R){\n\n\t\t\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\n\n\t\t\t\tans = max(ans,depth+mid+1);\n\t\t\t\tL = mid+1;\n\n\t\t\t}else{\n\n\t\t\t\tR = mid-1;\n\t\t\t}\n\t\t\tmid = (L+R)/2;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\n\t}\n}\n\nvoid solve_subproblem(int node_id){\n\n //重心となる頂点centerを探す\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\n CENTROID.clear();\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\n\tsearch_centroid(node_id,-1,subtree_size[node_id]);\n int center = CENTROID[0];\n\n centroid[center] = true;\n\n int next_node;\n\n //子の部分木を先に処理する\n for(int i = 0; i < G[center].size(); i++){\n\n next_node = G[center][i].to;\n\n if(centroid[next_node] == true)continue;\n\n solve_subproblem(next_node);\n }\n\n centroid[center] = false;\n\n for(int loop = 0; loop < 2; loop++){\n\n DOWN[0] = 0;\n for(int i = 1; i <= subtree_size[node_id]+5; i++){ //★サイズに注意★\n\n DOWN[i] = -BIG_NUM;\n }\n max_depth_DOWN = 0;\n\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\n\n next_node = G[center][i].to;\n\n if(centroid[next_node])continue;\n\n calc_UP(next_node,center,1,0,0);\n\n //右端の下りを計算\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\n }\n\n reverse(G[center].begin(),G[center].end());\n }\n\n}\n\nint main(){\n\n\tint N;\n\n scanf(\"%d\",&N);\n\n for(int i = 0; i < N; i++){\n\n scanf(\"%d\",&gasoline[i]);\n }\n\n int from,to,dist;\n\n for(int i = 0; i < N-1; i++){\n\n scanf(\"%d %d %d\",&from,&to,&dist);\n from--;\n to--;\n\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\n }\n\n\n solve_subproblem(0);\n\n printf(\"%d\\n\",max(1,ans));\n\n return 0;\n}","accuracy":0.4430379746835443,"time_ms":70,"memory_kb":14056,"score_of_the_acc":-0.2888,"final_rank":13},{"submission_id":"aoj_2790_3701448","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 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100020\n\nstruct Edge{\n Edge(int arg_to,int arg_value){\n to = arg_to;\n value = arg_value;\n }\n int to,value;\n};\n\nint subtree_size[NUM];\nbool centroid[NUM]; //その頂点が既に分割に用いられているか\nvector<Edge> G[NUM];\nvector<int> CENTROID;\n\nvoid compute_subtree_size(int node_id,int parent){\n\n subtree_size[node_id] = 1;\n\n for(int i = 0; i < G[node_id].size(); i++){\n\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\n\n compute_subtree_size(G[node_id][i].to,node_id);\n\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\n }\n}\n\n\nvoid search_centroid(int node_id,int parent,int total_size){\n\n\tbool FLG = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\t\tsearch_centroid(next_node,node_id,total_size);\n\n\t\tif(subtree_size[next_node] > total_size/2){\n\t\t\tFLG = false;\n\t\t}\n\t}\n\tif(total_size-subtree_size[node_id] > total_size/2)FLG = false;\n\tif(FLG)CENTROID.push_back(node_id);\n}\n\n\nvector<int> DOWN;\nint ans = 0;\n\nint calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\n\n\tDOWN[depth] = max(DOWN[depth],minimum);\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tint next_sum = sum + G[node_id][i].value;\n\t\tint next_minimum = min(minimum,next_sum);\n\n\t\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\n\t}\n\treturn DOWN[depth];\n}\n\n\nvoid calc_UP(int node_id,int parent,int depth,int sum,int maximum){\n\n\t//sum += add; //親方向へのコストを足す\n\t//int next_sum = sum+add;\n\tint next_sum = sum;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tif(G[node_id][i].to == parent){\n\t\t\tnext_sum += G[node_id][i].value;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\n\tif(next_sum >= maximum){\n\n\t\tint L,R;\n\n\t\t //最大値を計算\n\t\tans = max(ans,depth); //上りだけの場合\n\n\t\tL = 0,R = DOWN.size();\n\n\t\twhile(L+1 < R){\n\t\t\tint mid = (L+R)/2;\n\t\t\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\n\n\t\t\t\tL = mid;\n\n\t\t\t}else{\n\n\t\t\t\tR = mid;\n\t\t\t};\n\t\t}\n\t\tans = max(ans,L+depth);\n\t}\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next_node = G[node_id][i].to;\n\n\t\tif(next_node == parent || centroid[next_node] == true)continue;\n\n\t\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\n\t}\n}\n\nvoid solve_subproblem(int node_id){\n\n //重心となる頂点centerを探す\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\n CENTROID.clear();\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\n\tsearch_centroid(node_id,-1,subtree_size[node_id]);\n int center = CENTROID[0];\n int size = subtree_size[node_id];\n\n centroid[center] = true;\n\n int next_node;\n\n //子の部分木を先に処理する\n for(int i = 0; i < G[center].size(); i++){\n\n next_node = G[center][i].to;\n\n if(centroid[next_node] == true)continue;\n\n solve_subproblem(next_node);\n }\n\n centroid[center] = false;\n\n for(int loop = 0; loop < 2; loop++){\n\n \t DOWN.resize(size);\n\n \t for(int i = 0; i < size; i++){\n \t\t DOWN[i] = -(INT_MAX/3);\n \t }\n\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\n\n next_node = G[center][i].to;\n\n if(centroid[next_node] == true)continue;\n\n calc_UP(next_node,center,1,0,0);\n\n //右端の下りを計算\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\n }\n\n reverse(G[center].begin(),G[center].end());\n }\n\n}\n\n//WAになる原因が分らなかったので、DAyamaさんのコードを参考にさせてもらいました(ほぼ完全な写経)\n\nint main(){\n\n\tint N;\n\n scanf(\"%d\",&N);\n\n int gasoline[NUM];\n\n for(int i = 0; i < N; i++){\n\n scanf(\"%d\",&gasoline[i]);\n }\n\n int from,to,dist;\n\n for(int i = 0; i < N-1; i++){\n\n scanf(\"%d %d %d\",&from,&to,&dist);\n from--;\n to--;\n\n G[from].push_back(Edge(to,gasoline[from]-dist));\n G[to].push_back(Edge(from,gasoline[to]-dist));\n }\n\n solve_subproblem(0);\n\n printf(\"%d\\n\",ans+1);\n\n return 0;\n}","accuracy":0.4050632911392405,"time_ms":70,"memory_kb":14172,"score_of_the_acc":-0.2913,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_2790_10907762\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll INF = 1ll << 60;\\n#define REP(i,n) for(ll i=0; i<ll(n); i++)\\ntemplate <class T> using V = vector<T>;\\ntemplate <class A, class B> void chmax(A& l, const B& r){ if(l < r) l = r; }\\ntemplate <class A, class B> void chmin(A& l, const B& r){ if(r < l) l = r; }\\n\\n\\nvoid testcase(){\\n ll N; cin >> N;\\n V<ll> G(N); REP(i,N) cin >> G[i];\\n V<V<pair<ll,ll>>> adj(N);\\n REP(i,N-1){\\n ll a,b,d; cin >> a >> b >> d; a--; b--;\\n adj[a].push_back({b,d});\\n adj[b].push_back({a,d});\\n }\\n \\n V<ll> par(N, -1);\\n V<ll> sz(N, 1);\\n {\\n auto dfs = [&](auto& dfs, ll v, ll p) -> void {\\n for(auto [w,d] : adj[v]) if(w != p){\\n par[w] = v; dfs(dfs, w, v); sz[v] += sz[w];\\n }\\n }; dfs(dfs, 0, -1);\\n }\\n auto findCentroid = [&](ll& v) -> void {\\n while(1){\\n ll nx = -1;\\n for(auto [w,d] : adj[v]) if(sz[w] * 2 > sz[v]) nx = w;\\n if(nx < 0) break;\\n ll w = nx;\\n par[v] = w; par[w] = -1;\\n sz[v] -= sz[w]; sz[w] += sz[v];\\n v = w;\\n }\\n };\\n ll ans = 1;\\n V<ll> req(N+2, INF);\\n req[0] = -INF;\\n auto update_req = [&](auto& dfs, ll v, ll minpt, ll pt, ll dist) -> void {\\n chmin(minpt, pt);\\n chmin(req[dist], -minpt);\\n for(auto [w,d] : adj[v]) if(sz[w] && w != par[v]){\\n dfs(dfs, w, minpt, pt+G[v]-d, dist+1);\\n }\\n };\\n auto update_ans = [&](auto& dfs, ll v, ll bottom, ll pt, ll dist)-> void {\\n if(0 <= bottom) chmax(ans, dist + ll(upper_bound(req.begin(), req.end(), pt) - req.begin()));\\n for(auto [w,d] : adj[v]) if(sz[w] && w != par[v]){\\n dfs(dfs, w, min<ll>(0, bottom + G[w] - d), pt+G[w]-d, dist+1);\\n }\\n };\\n auto dfs = [&](auto& dfs, ll v) -> void {\\n findCentroid(v);\\n REP(tt,2){\\n REP(i,sz[v]+1) req[i+1] = INF;\\n for(auto [w,d] : adj[v]) if(sz[w]){\\n update_ans(update_ans, w, min<ll>(0, G[w] - d), G[w]-d, 1);\\n update_req(update_req, w, 0, G[v]-d, 1);\\n }\\n chmax(ans, ll(upper_bound(req.begin(), req.end(), 0) - req.begin()));\\n reverse(adj[v].begin(), adj[v].end());\\n }\\n sz[v] = 0;\\n for(auto [w,d] : adj[v]) if(sz[w]) { par[w] = -1; dfs(dfs, w); }\\n };\\n dfs(dfs, 0);\\n cout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main(){\\n cin.tie(0)->sync_with_stdio(0);\\n testcase();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 18204,\n \"score_of_the_acc\": -0.3982,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2790_10865776\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<cstdio>\\n#include<algorithm>\\n#include<cstring>\\n#include<vector>\\nusing namespace std;\\nstruct bian{\\n\\tint next,point,w;\\n}b[210000];\\nint p[110000],n,len,g[110000],pd[110000],size[110000],where,now,bo[110000],ans;\\nstruct atom{\\n\\tint where,w;\\n\\tlong long f;\\n};\\nvector<atom>A,B;\\nvoid ade(int k1,int k2,int k3){\\n\\tb[++len]=(bian){p[k1],k2,k3}; p[k1]=len;\\n}\\nvoid add(int k1,int k2,int k3){\\n\\tade(k1,k2,k3); ade(k2,k1,k3);\\n}\\nint dfs1(int k1,int k2){\\n\\tsize[k1]=1;\\n\\tfor (int i=p[k1];i;i=b[i].next){\\n\\t\\tint j=b[i].point;\\n\\t\\tif (pd[j]==0&&j!=k2) size[k1]+=dfs1(j,k1);\\n\\t}\\n\\treturn size[k1];\\n}\\nvoid dfs2(int k1,int k2){\\n\\tint num=n-size[k1];\\n\\tfor (int i=p[k1];i;i=b[i].next){\\n\\t\\tint j=b[i].point;\\n\\t\\tif (pd[j]==0&&j!=k2){\\n\\t\\t\\tnum=max(num,size[j]); dfs2(j,k1);\\n\\t\\t}\\n\\t}\\n\\tif (now>num){\\n\\t\\tnow=num; where=k1;\\n\\t}\\n}\\nvoid dfs3(int k1,int k2,long long dis,long long mi,int size,int w){\\n\\tdis+=g[k1]; mi+=g[k1]; mi=min(mi,0ll);\\n//\\tcout<<k1<<\\\" \\\"<<k2<<\\\" \\\"<<dis<<\\\" \\\"<<mi<<\\\" \\\"<<size<<\\\" \\\"<<w<<endl;\\n\\tif (mi>=0)\\n\\t\\tA.push_back((atom){w,size,dis});\\n\\tfor (int i=p[k1];i;i=b[i].next){\\n\\t\\tint j=b[i].point;\\n\\t\\tif (j!=k2&&pd[j]==0)\\n\\t\\t\\tdfs3(j,k1,dis-b[i].w,mi-b[i].w,size+1,w);\\n\\t}\\n}\\nvoid dfs4(int k1,int k2,long long dis,long long mi,int size,int w){\\n\\tmi=min(mi,dis); dis+=g[k1];\\n\\tB.push_back((atom){w,size,mi});\\n\\tfor (int i=p[k1];i;i=b[i].next){\\n\\t\\tint j=b[i].point;\\n\\t\\tif (j!=k2&&pd[j]==0) dfs4(j,k1,dis-b[i].w,mi,size+1,w);\\n\\t}\\n}\\nint compare(atom k1,atom k2){\\n\\treturn k1.f<k2.f;\\n}\\nvoid solve(int k1){\\n\\tn=dfs1(k1,0); now=n+1; where=0; dfs2(k1,0); int k=where;\\n\\tbo[k]=k; pd[k]=1; A.clear(); B.clear(); //cout<<\\\"solve \\\"<<k<<endl;\\n\\tA.push_back((atom){k,1,g[k]});\\n\\tB.push_back((atom){k,0,0});\\n\\tfor (int i=p[k];i;i=b[i].next){\\n\\t\\tint j=b[i].point;\\n\\t\\tif (pd[j]==0){\\n\\t\\t\\tdfs3(j,k,g[k]-b[i].w,-b[i].w,2,j);\\n\\t\\t\\tdfs4(j,k,-b[i].w,-b[i].w,1,j);\\n\\t\\t}\\n\\t}\\n\\tsort(A.begin(),A.end(),compare);\\n\\tsort(B.begin(),B.end(),compare);\\n/*\\tcout<<\\\"A\\\"<<endl;\\n\\tfor (int i=0;i<A.size();i++) cout<<A[i].where<<\\\" \\\"<<A[i].w<<\\\" \\\"<<A[i].f<<endl;\\n\\tcout<<\\\"B\\\"<<endl;\\n\\tfor (int i=0;i<B.size();i++) cout<<B[i].where<<\\\" \\\"<<B[i].w<<\\\" \\\"<<B[i].f<<endl;*/\\n\\tint now=A.size()-1,where=0,f=-1e9,g=-1e9;\\n\\tfor (int i=0;i<B.size();i++){\\n\\t\\twhile (now>=0&&A[now].f+B[i].f>=0){\\n\\t\\t\\tint k1=A[now].where;\\n\\t\\t\\tif (k1==where) f=max(f,A[now].w);\\n\\t\\t\\telse if (A[now].w>f){\\n\\t\\t\\t\\twhere=A[now].where; g=f; f=A[now].w;\\n\\t\\t\\t} else g=max(g,A[now].w);\\n\\t\\t\\tnow--;\\n\\t\\t}\\n\\t\\tif (B[i].where==where) ans=max(ans,g+B[i].w); else ans=max(ans,f+B[i].w);\\n\\t}\\n\\tfor (int i=p[k];i;i=b[i].next){\\n\\t\\tint j=b[i].point;\\n\\t\\tif (pd[j]==0) solve(j);\\n\\t}\\n}\\nint main(){\\n\\tscanf(\\\"%d\\\",&n);\\n\\tfor (int i=1;i<=n;i++) scanf(\\\"%d\\\",&g[i]);\\n\\tfor (int i=1;i<n;i++){\\n\\t\\tint k1,k2,k3; scanf(\\\"%d%d%d\\\",&k1,&k2,&k3); add(k1,k2,k3);\\n\\t}\\n\\tans=1;\\n\\tsolve(1);\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 15412,\n \"score_of_the_acc\": -0.4636,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2790_8324178\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int INF = 1012345678;\\n\\nstruct edge_base {\\n\\tint va, vb, cost;\\n};\\n\\nstruct edge {\\n\\tint to, cost;\\n};\\n\\nstruct state {\\n\\tint depth, current, bottom;\\n};\\n\\nstring to_string(const vector<int>& arr) {\\n\\tstring res = \\\"[\\\";\\n\\tfor (int i = 0; i < arr.size(); i++) {\\n\\t\\tif (i != 0) {\\n\\t\\t\\tres += \\\", \\\";\\n\\t\\t}\\n\\t\\tres += to_string(arr[i]);\\n\\t}\\n\\tres += \\\"]\\\";\\n\\treturn res;\\n}\\n\\nint solve(int N, const vector<int>& A, const vector<edge_base>& E) {\\n\\t// step #1. make graph\\n\\tvector<vector<edge> > G(N);\\n\\tfor (edge_base e : E) {\\n\\t\\tG[e.va].push_back(edge{e.vb, e.cost});\\n\\t\\tG[e.vb].push_back(edge{e.va, e.cost});\\n\\t}\\n\\n\\t// step #2. find centroid\\n\\tint root = -1;\\n\\tvector<int> subsize(N, 1);\\n\\tauto find_centroid = [&](auto& self, int pos, int pre) -> void {\\n\\t\\tbool flag = true;\\n\\t\\tfor (edge e : G[pos]) {\\n\\t\\t\\tif (e.to != pre) {\\n\\t\\t\\t\\tself(self, e.to, pos);\\n\\t\\t\\t\\tsubsize[pos] += subsize[e.to];\\n\\t\\t\\t\\tif (subsize[e.to] * 2 > N) {\\n\\t\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (flag && subsize[pos] * 2 >= N) {\\n\\t\\t\\troot = pos;\\n\\t\\t}\\n\\t};\\n\\tfind_centroid(find_centroid, 0, -1);\\n\\n\\t// step #3. build tree\\n\\tvector<int> comp(N, -1);\\n\\tvector<vector<edge> > child(N);\\n\\tauto build_tree = [&](auto& self, int pos, int pre) -> void {\\n\\t\\tfor (edge e : G[pos]) {\\n\\t\\t\\tif (e.to != pre) {\\n\\t\\t\\t\\tcomp[e.to] = comp[pos];\\n\\t\\t\\t\\tchild[pos].push_back(e);\\n\\t\\t\\t\\tself(self, e.to, pos);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t};\\n\\tint K = G[root].size();\\n\\tchild[root] = G[root];\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tcomp[G[root][i].to] = i;\\n\\t\\tbuild_tree(build_tree, G[root][i].to, root);\\n\\t}\\n\\n\\t// step #4. dynamic programming\\n\\tvector<state> dp1(N), dp2(N);\\n\\tauto dfs = [&](auto& self, int pos) -> void {\\n\\t\\tfor (edge e : child[pos]) {\\n\\t\\t\\tstate u1 = dp1[pos];\\n\\t\\t\\tu1.depth += 1;\\n\\t\\t\\tu1.current += A[e.to] - e.cost;\\n\\t\\t\\tu1.bottom += A[e.to] - e.cost;\\n\\t\\t\\tu1.bottom = min(u1.bottom, 0);\\n\\t\\t\\tstate u2 = dp2[pos];\\n\\t\\t\\tu2.depth += 1;\\n\\t\\t\\tu2.current += A[pos] - e.cost;\\n\\t\\t\\tu2.bottom = min(u2.bottom, u2.current);\\n\\t\\t\\tdp1[e.to] = u1;\\n\\t\\t\\tdp2[e.to] = u2;\\n\\t\\t\\tself(self, e.to);\\n\\t\\t}\\n\\t};\\n\\tdp1[root] = state{0, 0, 0};\\n\\tdp2[root] = state{0, 0, 0};\\n\\tdfs(dfs, root);\\n\\n\\t// step #5. calculate answer passing root\\n\\tint subanswer1 = -INF;\\n\\tvector<array<int, 3> > qs;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (dp1[i].bottom >= 0) {\\n\\t\\t\\tqs.push_back({dp1[i].current, 1, i});\\n\\t\\t}\\n\\t\\tqs.push_back({-dp2[i].bottom, 0, i});\\n\\t}\\n\\tsort(qs.begin(), qs.end());\\n\\tset<pair<int, int> > s;\\n\\tvector<int> compmax(K, -1);\\n\\tfor (array<int, 3> v : qs) {\\n\\t\\tif (v[1] == 0) {\\n\\t\\t\\tif (comp[v[2]] == -1 || compmax[comp[v[2]]] < dp2[v[2]].depth) {\\n\\t\\t\\t\\ts.insert(make_pair(dp2[v[2]].depth, comp[v[2]]));\\n\\t\\t\\t\\tif (comp[v[2]] != -1) {\\n\\t\\t\\t\\t\\ts.erase(make_pair(compmax[comp[v[2]]], comp[v[2]]));\\n\\t\\t\\t\\t\\tcompmax[comp[v[2]]] = dp2[v[2]].depth;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tset<pair<int, int> >::iterator it = s.end();\\n\\t\\t\\tif (it != s.begin()) {\\n\\t\\t\\t\\t--it;\\n\\t\\t\\t\\tif (it->second == -1 || it->second != comp[v[2]]) {\\n\\t\\t\\t\\t\\tsubanswer1 = max(subanswer1, it->first + dp1[v[2]].depth + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (it != s.begin()) {\\n\\t\\t\\t\\t\\t--it;\\n\\t\\t\\t\\t\\tsubanswer1 = max(subanswer1, it->first + dp1[v[2]].depth + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// step #6. divide into subproblems\\n\\tvector<vector<int> > subcomp(K);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (i != root) {\\n\\t\\t\\tsubcomp[comp[i]].push_back(i);\\n\\t\\t}\\n\\t}\\n\\tvector<vector<int> > suba(K);\\n\\tvector<vector<edge_base> > sube(K);\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tsuba[i].resize(subcomp[i].size());\\n\\t\\tfor (int j = 0; j < subcomp[i].size(); j++) {\\n\\t\\t\\tsuba[i][j] = A[subcomp[i][j]];\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < N - 1; i++) {\\n\\t\\tif (comp[E[i].va] == comp[E[i].vb]) {\\n\\t\\t\\tint id = comp[E[i].va];\\n\\t\\t\\tint nva = lower_bound(subcomp[id].begin(), subcomp[id].end(), E[i].va) - subcomp[id].begin();\\n\\t\\t\\tint nvb = lower_bound(subcomp[id].begin(), subcomp[id].end(), E[i].vb) - subcomp[id].begin();\\n\\t\\t\\tsube[id].push_back(edge_base{nva, nvb, E[i].cost});\\n\\t\\t}\\n\\t}\\n\\tint subanswer2 = -INF;\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tint res = solve(subcomp[i].size(), suba[i], sube[i]);\\n\\t\\tsubanswer2 = max(subanswer2, res);\\n\\t}\\n\\n\\treturn max(subanswer1, subanswer2);\\n}\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<int> A(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> A[i];\\n\\t}\\n\\tvector<edge_base> E(N - 1);\\n\\tfor (int i = 0; i < N - 1; i++) {\\n\\t\\tcin >> E[i].va >> E[i].vb >> E[i].cost;\\n\\t\\tE[i].va -= 1;\\n\\t\\tE[i].vb -= 1;\\n\\t}\\n\\tint ans = solve(N, A, E);\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 52592,\n \"score_of_the_acc\": -1.9863,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2790_6668720\",\n \"code_snippet\": \"#line 1 \\\"e.cpp\\\"\\n#line 1 \\\"e.cpp\\\"\\n/*\\tauthor: Kite_kuma\\n\\tcreated: 2022.05.30 15:48:54 */\\n\\n#line 2 \\\"SPJ-Library/graph/graph.hpp\\\"\\n#include <algorithm>\\n#include <cassert>\\n#include <deque>\\n#include <iostream>\\n#include <queue>\\n#include <tuple>\\n#include <vector>\\n\\n#pragma region graph\\n\\ntemplate <class cost_type = long long>\\nclass graph {\\n public:\\n\\tstruct edge {\\n\\t public:\\n\\t\\tint from, to;\\n\\t\\tcost_type cost;\\n\\t\\tint id;\\n\\t\\tedge() = default;\\n\\t\\tedge(int from_, int to_, cost_type cost_ = 1, int id_ = -1) : from(from_), to(to_), cost(cost_), id(id_) {}\\n\\t\\tbool operator<(const edge &a) const { return cost < a.cost; }\\n\\t\\tbool operator>(const edge &a) const { return cost > a.cost; }\\n\\t\\tfriend std::ostream &operator<<(std::ostream &s, const edge &a) {\\n\\t\\t\\ts << '(' << a.from << \\\" -> \\\" << a.to << \\\"), cost: \\\" << a.cost << \\\", id: \\\" << a.id;\\n\\t\\t\\treturn s;\\n\\t\\t}\\n\\t};\\n\\n private:\\n\\tstd::vector<std::vector<edge>> edges;\\n\\tint next_edge_id = 0;\\n\\n public:\\n\\tinline const std::vector<edge> &operator[](int k) const { return edges[k]; }\\n\\tinline std::vector<edge> &operator[](int k) { return edges[k]; }\\n\\n\\tint size() const { return int(edges.size()); }\\n\\tvoid resize(const int n) { edges.resize(n); }\\n\\tint edge_count() const { return next_edge_id; }\\n\\n\\tfriend std::ostream &operator<<(std::ostream &s, const graph<cost_type> &g) {\\n\\t\\tfor(const auto &adj : g.edges)\\n\\t\\t\\tfor(const auto &ed : adj) s << ed << '\\\\n';\\n\\t\\treturn s;\\n\\t}\\n\\n\\tgraph() = default;\\n\\tgraph(int n) : edges(n) {}\\n\\tgraph(int n, int e, bool weight = 0, bool directed = 0, int idx = 1) : edges(n) { input(e, weight, directed, idx); }\\n\\tconst cost_type INF = std::numeric_limits<cost_type>::max() / 3;\\n\\n\\tvoid input(int e = -1, bool weight = false, bool directed = false, int idx = 1) {\\n\\t\\tif(e == -1) e = size() - 1;\\n\\t\\twhile(e--) {\\n\\t\\t\\tint u, v;\\n\\t\\t\\tstd::cin >> u >> v;\\n\\t\\t\\tcost_type cost = 1;\\n\\t\\t\\tif(weight) std::cin >> cost;\\n\\t\\t\\tadd_edge(u, v, cost, directed, idx);\\n\\t\\t}\\n\\t}\\n\\n\\tinline int add_edge(int u, int v, cost_type cost = 1, bool directed = false, int idx = 0) {\\n\\t\\tu -= idx, v -= idx;\\n\\t\\tedges[u].emplace_back(u, v, cost, next_edge_id);\\n\\t\\tif(!directed && u != v) edges[v].emplace_back(v, u, cost, next_edge_id);\\n\\t\\treturn next_edge_id++;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\tstd::vector<cost_type> bfs(int s) const {\\n\\t\\tstd::vector<cost_type> dist(size(), INF);\\n\\t\\tstd::queue<int> que;\\n\\t\\tdist[s] = 0;\\n\\t\\tque.push(s);\\n\\t\\twhile(!que.empty()) {\\n\\t\\t\\tint v = que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\tif(dist[e.to] != INF) continue;\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn dist;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// constraint: cost of each edge is zero or x (>= 0)\\n\\tstd::vector<cost_type> zero_one_bfs(int s) const {\\n\\t\\tstd::vector<cost_type> dist(size(), INF);\\n\\t\\tstd::deque<int> deq;\\n\\t\\tdist[s] = 0;\\n\\t\\tdeq.push_back(s);\\n\\t\\twhile(!deq.empty()) {\\n\\t\\t\\tint v = deq.front();\\n\\t\\t\\tdeq.pop_front();\\n\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\tif(dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\t\\te.cost ? deq.push_back(e.to) : deq.push_front(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn dist;\\n\\t}\\n\\n\\t// Ο((E+V) lg E)\\n\\t// unreachable: INF\\n\\tstd::vector<cost_type> dijkstra(int s) const {\\n\\t\\tstd::vector<cost_type> dist(size(), INF);\\n\\t\\tconst auto compare = [](const std::pair<cost_type, int> &a, const std::pair<cost_type, int> &b) { return a.first > b.first; };\\n\\t\\tstd::priority_queue<std::pair<cost_type, int>, std::vector<std::pair<cost_type, int>>, decltype(compare)> que{compare};\\n\\t\\tdist[s] = 0;\\n\\t\\tque.emplace(0, s);\\n\\t\\twhile(!que.empty()) {\\n\\t\\t\\tstd::pair<cost_type, int> p = que.top();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tint v = p.second;\\n\\t\\t\\tif(dist[v] < p.first) continue;\\n\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\tif(dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\t\\tque.emplace(dist[e.to], e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn dist;\\n\\t}\\n\\n\\t// Ο(VE)\\n\\t// unreachable: INF\\n\\t// reachable via negative cycle: -INF\\n\\tstd::vector<cost_type> bellman_ford(int s) const {\\n\\t\\tint n = size();\\n\\t\\tstd::vector<cost_type> res(n, INF);\\n\\t\\tres[s] = 0;\\n\\t\\tfor(int loop = 0; loop < n - 1; loop++) {\\n\\t\\t\\tfor(int v = 0; v < n; v++) {\\n\\t\\t\\t\\tif(res[v] == INF) continue;\\n\\t\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\t\\tres[e.to] = std::min(res[e.to], res[v] + e.cost);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::queue<int> que;\\n\\t\\tstd::vector<int> chk(n);\\n\\t\\tfor(int v = 0; v < n; v++) {\\n\\t\\t\\tif(res[v] == INF) continue;\\n\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\tif(res[e.to] > res[v] + e.cost and !chk[e.to]) {\\n\\t\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile(!que.empty()) {\\n\\t\\t\\tint now = que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(!chk[e.to]) {\\n\\t\\t\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tif(chk[i]) res[i] = -INF;\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// Ο(V^3)\\n\\tstd::vector<std::vector<cost_type>> warshall_floyd() const {\\n\\t\\tconst int n = size();\\n\\t\\tstd::vector<std::vector<cost_type>> dist(n, std::vector<cost_type>(n, INF));\\n\\t\\tfor(int i = 0; i < n; i++) dist[i][i] = 0;\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(auto &e : edges[i]) dist[i][e.to] = std::min(dist[i][e.to], e.cost);\\n\\t\\tfor(int k = 0; k < n; k++)\\n\\t\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\t\\tif(dist[i][k] == INF) continue;\\n\\t\\t\\t\\tfor(int j = 0; j < n; j++) {\\n\\t\\t\\t\\t\\tif(dist[k][j] == INF) continue;\\n\\t\\t\\t\\t\\tdist[i][j] = std::min(dist[i][j], dist[i][k] + dist[k][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\treturn dist;\\n\\t}\\n\\n\\t// Ο(V) (using DFS)\\n\\t// if a cycle exists, return {}\\n\\tstd::vector<int> topological_sort() const {\\n\\t\\tstd::vector<int> res;\\n\\t\\tstd::vector<int> used(size(), 0);\\n\\t\\tbool not_DAG = false;\\n\\t\\tauto dfs = [&](auto self, int k) -> void {\\n\\t\\t\\tif(not_DAG) return;\\n\\t\\t\\tif(used[k]) {\\n\\t\\t\\t\\tif(used[k] == 1) not_DAG = true;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tused[k] = 1;\\n\\t\\t\\tfor(auto &e : edges[k]) self(self, e.to);\\n\\t\\t\\tused[k] = 2;\\n\\t\\t\\tres.push_back(k);\\n\\t\\t};\\n\\t\\tfor(int i = 0; i < size(); i++) dfs(dfs, i);\\n\\t\\tif(not_DAG) return std::vector<int>{};\\n\\t\\tstd::reverse(res.begin(), res.end());\\n\\t\\treturn res;\\n\\t}\\n\\n\\tbool is_dag() const { return !topological_sort().empty(); }\\n\\n\\t// Ο(V)\\n\\t// array of the distance to the most distant vertex\\n\\t// constraint: the graph is a tree\\n\\tstd::vector<cost_type> height() const {\\n\\t\\tauto vec1 = bfs(0);\\n\\t\\tint v1 = -1, v2 = -1;\\n\\t\\tcost_type dia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec1[i]) dia = vec1[i], v1 = i;\\n\\t\\tvec1 = bfs(v1);\\n\\t\\tdia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec1[i]) dia = vec1[i], v2 = i;\\n\\t\\tauto vec2 = bfs(v2);\\n\\t\\tfor(int i = 0; i < int(size()); i++) {\\n\\t\\t\\tif(vec1[i] < vec2[i]) vec1[i] = vec2[i];\\n\\t\\t}\\n\\t\\treturn vec1;\\n\\t}\\n\\n\\t// O(V+E)\\n\\t// vector<(int)(0 or 1)>\\n\\t// if it is not bipartite, return {}\\n\\tstd::vector<int> bipartite_grouping() const {\\n\\t\\tstd::vector<int> colors(size(), -1);\\n\\t\\tauto dfs = [&](auto self, int now, int col) -> bool {\\n\\t\\t\\tcolors[now] = col;\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(col == colors[e.to]) return false;\\n\\t\\t\\t\\tif(colors[e.to] == -1 and !self(self, e.to, !col)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(!colors[i] and !dfs(dfs, i, 0)) return std::vector<int>{};\\n\\t\\treturn colors;\\n\\t}\\n\\n\\tbool is_bipartite() const { return !bipartite_grouping().empty(); }\\n\\n\\t// Ο(V+E)\\n\\t// (v1, v2, diameter)\\n\\tstd::tuple<int, int, cost_type> diameter() {\\n\\t\\tstd::vector<cost_type> dist = bfs(0);\\n\\t\\tauto it = std::max_element(dist.begin(), dist.end());\\n\\t\\tconst int v = it - dist.begin();\\n\\t\\tdist = bfs(v);\\n\\t\\tit = std::max_element(dist.begin(), dist.end());\\n\\t\\treturn std::make_tuple(v, int(it - dist.begin()), *it);\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\tstd::vector<int> subtree_size(const int root) {\\n\\t\\tconst int n = size();\\n\\t\\tstd::vector<int> ret(n, 1);\\n\\t\\tauto dfs = [&](auto self, int now, int p = -1) -> void {\\n\\t\\t\\tfor(const auto &e : (*this)[now]) {\\n\\t\\t\\t\\tif(e.to == p) continue;\\n\\t\\t\\t\\tself(self, e.to, now);\\n\\t\\t\\t\\tret[now] += ret[e.to];\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tdfs(dfs, root);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\t// Ο(ElgE)\\n\\tcost_type prim() const {\\n\\t\\tcost_type res = 0;\\n\\t\\tstd::priority_queue<edge, std::vector<edge>, std::greater<edge>> que;\\n\\t\\tfor(auto &e : edges[0]) que.push(e);\\n\\t\\tstd::vector<int> chk(size());\\n\\t\\tchk[0] = 1;\\n\\t\\tint cnt = 1;\\n\\t\\twhile(cnt < size()) {\\n\\t\\t\\tauto e = que.top();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tif(chk[e.to]) continue;\\n\\t\\t\\tcnt++;\\n\\t\\t\\tres += e.cost;\\n\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\tfor(auto &e2 : edges[e.to]) que.push(e2);\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// Ο(ElgE)\\n\\tcost_type kruskal() const {\\n\\t\\tstd::vector<std::tuple<int, int, cost_type>> eds;\\n\\t\\tfor(const auto &adj : edges)\\n\\t\\t\\tfor(const auto &ed : adj) eds.emplace_back(ed.from, ed.to, ed.cost);\\n\\t\\tstd::sort(eds.begin(), eds.end(), [](const std::tuple<int, int, cost_type> &a, const std::tuple<int, int, cost_type> &b) {\\n\\t\\t\\treturn std::get<2>(a) < std::get<2>(b);\\n\\t\\t});\\n\\t\\tstd::vector<int> uf_data(size(), -1);\\n\\t\\tauto root = [&uf_data](auto self, int x) -> int {\\n\\t\\t\\tif(uf_data[x] < 0) return x;\\n\\t\\t\\treturn uf_data[x] = self(self, uf_data[x]);\\n\\t\\t};\\n\\t\\tauto unite = [&uf_data, &root](int u, int v) -> bool {\\n\\t\\t\\tu = root(root, u), v = root(root, v);\\n\\t\\t\\tif(u == v) return false;\\n\\t\\t\\tif(uf_data[u] > uf_data[v]) std::swap(u, v);\\n\\t\\t\\tuf_data[u] += uf_data[v];\\n\\t\\t\\tuf_data[v] = u;\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\t\\tcost_type ret = 0;\\n\\t\\tfor(auto &e : eds)\\n\\t\\t\\tif(unite(std::get<0>(e), std::get<1>(e))) ret += std::get<2>(e);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\t// O(V)\\n\\tstd::vector<int> centroid() const {\\n\\t\\tstd::vector<int> centroid, sz(size());\\n\\t\\tauto dfs = [&](auto self, int now, int per) -> void {\\n\\t\\t\\tsz[now] = 1;\\n\\t\\t\\tbool is_centroid = true;\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(e.to != per) {\\n\\t\\t\\t\\t\\tself(self, e.to, now);\\n\\t\\t\\t\\t\\tsz[now] += sz[e.to];\\n\\t\\t\\t\\t\\tif(sz[e.to] > size() / 2) is_centroid = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(size() - sz[now] > size() / 2) is_centroid = false;\\n\\t\\t\\tif(is_centroid) centroid.push_back(now);\\n\\t\\t};\\n\\t\\tdfs(dfs, 0, -1);\\n\\t\\treturn centroid;\\n\\t}\\n\\n\\t// O(V+E)\\n\\t// bridge: (s, t) (s < t);\\n\\tstd::pair<std::vector<std::pair<int, int>>, std::vector<int>> bridges_and_articulations() const {\\n\\t\\tstd::vector<int> order(size(), -1), low(size()), articulation;\\n\\t\\tint order_next = 0;\\n\\t\\tstd::vector<std::pair<int, int>> bridge;\\n\\t\\tauto dfs = [&](auto self, int now, int par = -1) -> void {\\n\\t\\t\\tlow[now] = order[now] = order_next++;\\n\\t\\t\\tbool is_articulation = false;\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\tfor(auto &ed : edges[now]) {\\n\\t\\t\\t\\tint &nxt = ed.to;\\n\\t\\t\\t\\tif(nxt == par) continue;\\n\\t\\t\\t\\tif(order[nxt] == -1) {\\n\\t\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\t\\tself(self, nxt, now);\\n\\t\\t\\t\\t\\tif(order[now] < low[nxt]) bridge.push_back(std::minmax(now, nxt));\\n\\t\\t\\t\\t\\tif(order[now] <= low[nxt]) is_articulation = true;\\n\\t\\t\\t\\t\\tlow[now] = std::min(low[now], low[nxt]);\\n\\t\\t\\t\\t} else if(order[now] > order[nxt]) {\\n\\t\\t\\t\\t\\tlow[now] = std::min(low[now], order[nxt]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(par == -1 and cnt < 2) is_articulation = false;\\n\\t\\t\\tif(is_articulation) articulation.push_back(now);\\n\\t\\t\\treturn;\\n\\t\\t};\\n\\t\\tfor(int i = 0; i < (int)size(); i++)\\n\\t\\t\\tif(order[i] == -1) dfs(dfs, i);\\n\\t\\treturn std::make_pair(bridge, articulation);\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// directed graph from root to leaf\\n\\tgraph root_to_leaf(int root = 0) const {\\n\\t\\tgraph res(size());\\n\\t\\tstd::vector<int> chk(size(), 0);\\n\\t\\tchk[root] = 1;\\n\\t\\tauto dfs = [&](auto self, int now) -> void {\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(chk[e.to] == 1) continue;\\n\\t\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\t\\tres.add_edge(now, e.to, e.cost, 1, 0);\\n\\t\\t\\t\\tself(self, e.to);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tdfs(dfs, root);\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// directed graph from leaf to root\\n\\tgraph leaf_to_root(int root = 0) const {\\n\\t\\tgraph res(size());\\n\\t\\tstd::vector<int> chk(size(), 0);\\n\\t\\tchk[root] = 1;\\n\\t\\tauto dfs = [&](auto self, int now) -> void {\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(chk[e.to] == 1) continue;\\n\\t\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\t\\tres.add_edge(e.to, now, e.cost, 1, 0);\\n\\t\\t\\t\\tself(self, e.to);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tdfs(dfs, root);\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// cost_type Chu_Liu_Edmonds(int root = 0) {}\\n};\\n#pragma endregion\\n#line 2 \\\"SPJ-Library/graph/centroid_decomposition.hpp\\\"\\n\\n#include <functional>\\n\\n// process(int root, const vector<int>& used_as_centroid) -> void\\n// used_as_centroid[vertex] := 1 if 'vertex' has been removed else 0\\ntemplate <class edge_type>\\nvoid centroid_decomposition(const graph<edge_type> &g, const std::function<void(int, const std::vector<int> &)> &process) {\\n\\tstd::vector<int> weight(g.size(), 0), used_as_centroid(g.size(), 0);\\n\\n\\tauto calc_weight = [&](auto self, int now, int par) -> void {\\n\\t\\tint &weight_now = (weight[now] = 1);\\n\\t\\tfor(const auto &ed : g[now]) {\\n\\t\\t\\tif(ed.to == par || used_as_centroid[ed.to]) continue;\\n\\t\\t\\tself(self, ed.to, now);\\n\\t\\t\\tweight_now += weight[ed.to];\\n\\t\\t}\\n\\t\\treturn;\\n\\t};\\n\\n\\tauto find_centroid = [&g, &calc_weight, &weight, &used_as_centroid](int now) -> int {\\n\\t\\tcalc_weight(calc_weight, now, -1);\\n\\t\\tconst int order_half = weight[now] >> 1;\\n\\t\\tint par = -1;\\n\\t\\tbool changed = true;\\n\\t\\twhile(std::exchange(changed, false)) {\\n\\t\\t\\tfor(const auto &ed : g[now]) {\\n\\t\\t\\t\\tif(ed.to != par && !used_as_centroid[ed.to] && weight[ed.to] > order_half) {\\n\\t\\t\\t\\t\\tpar = now;\\n\\t\\t\\t\\t\\tnow = ed.to;\\n\\t\\t\\t\\t\\tchanged = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn now;\\n\\t};\\n\\n\\tauto decomposite = [&g, &find_centroid, &used_as_centroid, &process](auto self, int now) -> void {\\n\\t\\tnow = find_centroid(now);\\n\\t\\tprocess(now, used_as_centroid);\\n\\t\\tused_as_centroid[now] = 1;\\n\\t\\tfor(const auto &ed : g[now])\\n\\t\\t\\tif(!used_as_centroid[ed.to]) self(self, ed.to);\\n\\t\\treturn;\\n\\t};\\n\\n\\tfor(int i = 0; i < g.size(); i++)\\n\\t\\tif(!used_as_centroid[i]) decomposite(decomposite, i);\\n\\treturn;\\n}\\n#line 5 \\\"e.cpp\\\"\\n\\n#line 2 \\\"SPJ-Library/template/kuma.hpp\\\"\\n\\n#line 2 \\\"SPJ-Library/template/basic_func.hpp\\\"\\n\\n#line 7 \\\"SPJ-Library/template/basic_func.hpp\\\"\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 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 flag = true) { std::cout << (flag ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid YES(bool flag = true) { std::cout << (flag ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(const T &x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(const Head &H, const Tail &... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T value) {\\n\\tfor(auto &a : v) a += value;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\n// ceil(a / b);\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b);\\n\\tif(b < 0) {\\n\\t\\ta *= -1;\\n\\t\\tb *= -1;\\n\\t}\\n\\treturn least_upper_multiple(a, b) / b;\\n}\\n\\nlong long pow_ll(long long a, long long n) {\\n\\tassert(n >= 0LL);\\n\\tif(n == 0) return 1LL;\\n\\tif(a == 0) return 0LL;\\n\\tif(a == 1) return 1LL;\\n\\tif(a == -1) return (n & 1LL) ? -1LL : 1LL;\\n\\tlong long res = 1;\\n\\twhile(n > 1LL) {\\n\\t\\tif(n & 1LL) res *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res * a;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\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 < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, const 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\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn (int)std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn (int)std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(const std::vector<T> &a) {\\n\\tstd::vector<T> vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(const auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n#line 1 \\\"SPJ-Library/template/header.hpp\\\"\\n#include <bits/stdc++.h>\\n#line 2 \\\"SPJ-Library/template/io.hpp\\\"\\n\\n#line 4 \\\"SPJ-Library/template/io.hpp\\\"\\n\\n#line 8 \\\"SPJ-Library/template/debug.hpp\\\"\\n\\n#line 3 \\\"SPJ-Library/template/constants.hpp\\\"\\n\\nconstexpr int inf = 1000'000'000;\\nconstexpr long long INF = 1'000'000'000'000'000'000LL;\\nconstexpr int mod_1000000007 = 1000000007;\\nconstexpr int mod_998244353 = 998244353;\\nconst long double pi = acosl(-1.);\\nconstexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nconstexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n#line 10 \\\"SPJ-Library/template/debug.hpp\\\"\\n\\nnamespace viewer {\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p);\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p);\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p);\\n\\nvoid view(const long long &e);\\n\\nvoid view(const int &e);\\n\\ntemplate <typename T>\\nvoid view(const T &e);\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::multiset<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_multiset<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v);\\n\\ntemplate <typename T, std::size_t ary_size>\\nvoid view(const std::array<T, ary_size> &v);\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv);\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v);\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v);\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v);\\n\\ntemplate <typename map_type>\\nvoid view_map_container(const map_type &m);\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m);\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m);\\n\\ntemplate <typename container_type>\\nvoid view_container(const container_type &c, bool vertically = false) {\\n\\ttypename container_type::const_iterator begin = c.begin();\\n\\tconst typename container_type::const_iterator end = c.end();\\n\\tif(vertically) {\\n\\t\\tstd::cerr << \\\"{\\\\n\\\";\\n\\t\\twhile(begin != end) {\\n\\t\\t\\tstd::cerr << '\\\\t';\\n\\t\\t\\tview(*(begin++));\\n\\t\\t\\tif(begin != end) std::cerr << ',';\\n\\t\\t\\tstd::cerr << '\\\\n';\\n\\t\\t}\\n\\t\\tstd::cerr << '}';\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\twhile(begin != end) {\\n\\t\\tview(*(begin++));\\n\\t\\tif(begin != end) std::cerr << ',';\\n\\t\\tstd::cerr << ' ';\\n\\t}\\n\\tstd::cerr << '}';\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << '(';\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << ')';\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << '(';\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << ')';\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << '(';\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << ')';\\n}\\n\\nvoid view(const long long &e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int &e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T &e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::multiset<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_multiset<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tview_container(v);\\n}\\n\\ntemplate <typename T, std::size_t ary_size>\\nvoid view(const std::array<T, ary_size> &v) {\\n\\tview_container(v);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tview_container(vv, true);\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tview_container(v, true);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tview_container(v, true);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tview_container(v, true);\\n}\\n\\ntemplate <typename map_type>\\nvoid view_map_container(const map_type &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(typename map_type::const_iterator it = m.begin(); it != m.end(); it++) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(it->first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(it->second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tview_map_container(m);\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tview_map_container(m);\\n}\\n\\n} // namespace viewer\\n\\n// when compiling : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename T>\\nvoid debug_out(const T &x) {\\n\\tviewer::view(x);\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(const Head &H, const Tail &... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n#line 2 \\\"SPJ-Library/template/scanner.hpp\\\"\\n\\n#line 6 \\\"SPJ-Library/template/scanner.hpp\\\"\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#line 7 \\\"SPJ-Library/template/io.hpp\\\"\\n\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << ' ' << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(typename std::vector<T>::const_iterator it = v.begin(); it != v.end(); it++) {\\n\\t\\tif(it != v.begin()) std::cerr << ' ';\\n\\t\\tos << *it;\\n\\t}\\n\\treturn os;\\n}\\n\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tstd::ios::sync_with_stdio(false);\\n\\t\\tstd::cin.tie(nullptr);\\n\\t\\tstd::cout << std::fixed << std::setprecision(15);\\n\\t\\tsrand((unsigned)time(NULL));\\n\\t}\\n} fast_io_;\\n#line 2 \\\"SPJ-Library/template/macros.hpp\\\"\\n\\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 pcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n#line 7 \\\"SPJ-Library/template/kuma.hpp\\\"\\n\\nusing namespace std;\\n#line 478 \\\"e.cpp\\\"\\n\\nll solve(int n) {\\n\\tVEC(ll, stand, n);\\n\\tgraph<ll> g(n, -1, true, 0, 1);\\n\\n\\tint ans = 1;\\n\\n\\tvector<ll> up_tmp, dn_tmp;\\n\\n\\tauto dfs = [&](int dist, int now, const vector<int> &used, auto self, int par, ll sum, ll minvalue, ll maxvalue) -> void {\\n\\t\\tchmin(minvalue, sum);\\n\\t\\tchmax(maxvalue, sum);\\n\\t\\tsum += stand[now];\\n\\t\\tchmax(maxvalue, sum);\\n\\t\\tdebug(dist, now, used, sum, minvalue, maxvalue);\\n\\t\\tif((int)dn_tmp.size() <= dist) dn_tmp.resize(dist + 1, -INF);\\n\\t\\tchmax(dn_tmp[dist], minvalue);\\n\\t\\tif(sum - maxvalue >= 0 && sum >= 0LL) {\\n\\t\\t\\tif(int(up_tmp.size() <= dist)) up_tmp.resize(dist + 1, -INF);\\n\\t\\t\\tchmax(up_tmp[dist], sum);\\n\\t\\t}\\n\\t\\tfoa(e, g[now]) {\\n\\t\\t\\tif(e.to == par || used[e.to]) continue;\\n\\t\\t\\tself(dist + 1, e.to, used, self, now, sum - e.cost, minvalue, maxvalue);\\n\\t\\t}\\n\\t\\tdebug('f');\\n\\t\\treturn;\\n\\t};\\n\\n\\tauto merge = [&](vll &a, vll &b, ll root) -> void {\\n\\t\\tint as = int(a.size());\\n\\t\\tint bs = int(b.size());\\n\\t\\tint j = 0;\\n\\t\\tdrep(i, as) while(j < bs && b[j] + a[i] + root >= 0) {\\n\\t\\t\\tchmax(ans, i + j + 1);\\n\\t\\t\\tj++;\\n\\t\\t}\\n\\t\\treturn;\\n\\t};\\n\\n\\tauto process = [&](int root, const vector<int> &used) -> void {\\n\\t\\tvll up(1, 0LL), dn(1, 0LL);\\n\\t\\tfoa(e, g[root]) {\\n\\t\\t\\tif(used[e.to]) continue;\\n\\t\\t\\tup_tmp.resize(1, 0LL);\\n\\t\\t\\tdn_tmp.resize(1, 0LL);\\n\\t\\t\\tdfs(1, e.to, used, dfs, root, -e.cost, INF, -INF);\\n\\t\\t\\tdrep(i, int(up_tmp.size()) - 1) { chmax(up_tmp[i], up_tmp[i + 1]); }\\n\\t\\t\\tdrep(i, int(dn_tmp.size()) - 1) { chmax(dn_tmp[i], dn_tmp[i + 1]); }\\n\\n\\t\\t\\tmerge(up, dn_tmp, stand[root]);\\n\\t\\t\\tmerge(up_tmp, dn, stand[root]);\\n\\n\\t\\t\\tdebug(root, e.to);\\n\\t\\t\\tdebug(up);\\n\\t\\t\\tdebug(dn);\\n\\t\\t\\tdebug(up_tmp);\\n\\t\\t\\tdebug(dn_tmp);\\n\\t\\t\\tdebug(stand[root]);\\n\\t\\t\\t// exit(0);\\n\\t\\t\\tif(ans == 2) {\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(up_tmp.size() > up.size()) up.resize(up_tmp.size(), -INF);\\n\\t\\t\\tif(dn_tmp.size() > dn.size()) dn.resize(dn_tmp.size(), -INF);\\n\\t\\t\\trep(i, int(up_tmp.size())) { chmax(up[i], up_tmp[i]); }\\n\\t\\t\\trep(i, int(dn_tmp.size())) { chmax(dn[i], dn_tmp[i]); }\\n\\n\\t\\t\\tup_tmp.clear();\\n\\t\\t\\tdn_tmp.clear();\\n\\t\\t}\\n\\t\\treturn;\\n\\t};\\n\\n\\tcentroid_decomposition(g, process);\\n\\treturn (ans);\\n}\\n\\nint main() {\\n\\tint n;\\n\\twhile(cin >> n && n) {\\n\\t\\tcout << solve(n) << '\\\\n';\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 24712,\n \"score_of_the_acc\": -0.5371,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2790_6172831\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#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<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\n#include<chrono>\\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\\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;\\n\\ntemplate<typename T>\\nvoid chmin(T& a, T b) {\\n\\ta = min(a, b);\\n}\\ntemplate<typename T>\\nvoid chmax(T& a, T b) {\\n\\ta = max(a, b);\\n}\\ntemplate<typename T>\\nvoid cinarray(vector<T>& v) {\\n\\trep(i, v.size())cin >> v[i];\\n}\\ntemplate<typename T>\\nvoid coutarray(vector<T>& v) {\\n\\trep(i, v.size()) {\\n\\t\\tif (i > 0)cout << \\\" \\\"; cout << v[i];\\n\\t}\\n\\tcout << \\\"\\\\n\\\";\\n}\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tif (x == 0)return 0;\\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\\tint n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) {\\n\\t\\tif (m < 0 || mod <= m) {\\n\\t\\t\\tm %= mod; if (m < 0)m += mod;\\n\\t\\t}\\n\\t\\tn = m;\\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)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 20;\\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}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nll gcd(ll a, ll b) {\\n\\ta = abs(a); b = abs(b);\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tll r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n\\nusing mP = pair<modint, modint>;\\n//-----------------------------------\\n\\nstruct edge {\\n\\tint to, cost;\\n};\\nconst int mn = 1 << 17;\\nvector<edge> G[mn];\\nint a[mn];\\nqueue<vector<int>> q;\\nbool exi[mn];\\nint ans = 1;\\nvoid yaru(vector<int> v) {\\n\\tif (v.empty())return;\\n\\t//初期化\\n\\tfor (int id : v)exi[id] = true;\\n\\tint g; int sz = v.size();\\n\\n\\tfunction<int(int, int)> s_root = [&](int id, int fr)->int {\\n\\t\\tint res = 1;\\n\\t\\tint ma = 0;\\n\\t\\tfor (edge e: G[id]) {\\n\\t\\t\\tif (e.to == fr)continue;\\n\\t\\t\\tif (!exi[e.to])continue;\\n\\t\\t\\tint nex = s_root(e.to, id);\\n\\t\\t\\tma = max(ma, nex);\\n\\t\\t\\tres += nex;\\n\\t\\t}\\n\\t\\tif (ma <= sz / 2 && sz - res <= sz / 2)g = id;\\n\\t\\treturn res;\\n\\t};\\n\\ts_root(v[0], -1);\\n\\t//ここまで初期化\\n\\n\\t////重心を根としてなんかやる\\n\\t//function<void(int, int)> dfs = [&](int id, int fr) {\\n\\t//\\tif (!exi[id])return;\\n\\t//\\tfor (int to : G[id]) {\\n\\t//\\t\\tif (to == fr)continue;\\n\\t//\\t\\tdfs(to, id);\\n\\t//\\t}\\n\\t//};\\n\\t//for (int to : G[g])dfs(to, g);\\n\\n\\n\\n\\n\\t//ここまで\\n\\n\\tvector<vector<int>> chs;\\n\\tvector<int> nexs;\\n\\tfunction<void(int, int)> search_next = [&](int id, int fr) {\\n\\t\\tif (!exi[id])return;\\n\\t\\tnexs.push_back(id);\\n\\t\\tfor (edge e : G[id]) {\\n\\t\\t\\tif (e.to == fr)continue;\\n\\t\\t\\tsearch_next(e.to,id);\\n\\t\\t}\\n\\t};\\n\\t//子を列挙する\\n\\tfor (edge e : G[g]) {\\n\\t\\tsearch_next(e.to, g);\\n\\t\\tif (nexs.empty())continue;\\n\\t\\tq.push(nexs);\\n\\t\\tchs.push_back(nexs);\\n\\t\\tnexs.clear();\\n\\t}\\n\\n\\t//子達についてなんかやる\\n\\tvector<int> vd;\\n\\t\\n\\tfunction<void(int, int,int,int,int)> dfsto = [&](int id, int fr,int cur,int mi,int depth) {\\n\\t\\t//cout << \\\"? \\\" << id <<\\\" \\\"<<fr<< \\\"\\\\n\\\";\\n\\t\\tif (mi >= 0)chmax(ans, depth + 1);\\n\\t\\twhile (vd.size() <= depth) {\\n\\t\\t\\tvd.push_back(2 * mod);\\n\\t\\t}\\n\\t\\tchmin(vd[depth], -mi);\\n\\t\\tfor (edge e : G[id]) {\\n\\t\\t\\tif (e.to == fr || !exi[e.to])continue;\\n\\t\\t\\tdfsto(e.to, id, cur + a[id] - e.cost, min(mi, cur + a[id] - e.cost), depth + 1);\\n\\t\\t}\\n\\t};\\n\\tfunction<void(int, int, int, int, int)> dfsfrom = [&](int id, int fr, int cur, int mi, int depth) {\\n\\t\\tif (mi >= 0)chmax(ans, depth + 1);\\n\\t\\tif (mi >= 0) {\\n\\t\\t\\tint loc = upper_bound(all(vd), cur) - vd.begin();\\n\\t\\t\\tchmax(ans, loc + depth);\\n\\t\\t}\\n\\t\\tfor (edge e : G[id]) {\\n\\t\\t\\tif (e.to == fr || !exi[e.to])continue;\\n\\t\\t\\tdfsfrom(e.to, id, cur + a[e.to] - e.cost, min(0, mi + a[e.to] - e.cost), depth + 1);\\n\\t\\t}\\n\\t};\\n\\tvd = { 0 };\\n\\tfor (edge e : G[g]) {\\n\\t\\tif (exi[e.to]) {\\n\\t\\t\\tdfsfrom(e.to, g, a[e.to]-e.cost, min(0,a[e.to]-e.cost), 1);\\n\\t\\t\\tdfsto(e.to, g, a[g] - e.cost, min(0, a[g] - e.cost), 1);\\n\\t\\t}\\n\\t}\\n\\tvd = { 0 };\\n\\tper(i, G[g].size()) {\\n\\t\\tedge e = G[g][i];\\n\\t\\tif (exi[e.to]) {\\n\\t\\t\\tdfsfrom(e.to, g, a[e.to] - e.cost, min(0, a[e.to] - e.cost), 1);\\n\\t\\t\\tdfsto(e.to, g, a[g] - e.cost, min(0, a[g] - e.cost), 1);\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int id : v)exi[id] = false;\\n}\\n\\nvoid uoo(int n) {\\n\\tvector<int> ori(n); rep(i, n)ori[i] = i;\\n\\tq.push(ori);\\n\\twhile (!q.empty()) {\\n\\t\\tvector<int> v = q.front(); q.pop();\\n\\t\\tyaru(v);\\n\\t}\\n}\\n\\nvoid solve() {\\n\\tint n; cin >> n;\\n\\trep(i, n)cin >> a[i];\\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 });\\n\\t\\tG[b].push_back({ a,c });\\n\\t}\\n\\tuoo(n);\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//init_f();\\n\\t//init();\\n\\t//while(true)\\n\\t//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 31444,\n \"score_of_the_acc\": -0.7641,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2790_5177687\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\nconst int maxn=1e6+10;\\nint n,g[maxn],st[maxn],to[maxn],nt[maxn],topt,w[maxn],ans,ma[maxn],cima[maxn],dp[maxn],a[maxn],p;\\nbool f[maxn];\\nvoid add(int x,int y,int z){to[++topt]=y; nt[topt]=st[x]; st[x]=topt; w[topt]=z;}\\nvoid dfs1(int x,int fa)\\n{\\n\\tdp[x]=0; int p=st[x];\\n\\twhile (p)\\n\\t{\\n\\t\\tif (to[p]!=fa) \\n\\t\\t{\\n\\t\\t\\tdfs1(to[p],x);\\n\\t\\t\\tif (ma[to[p]]>=ma[x])\\n\\t\\t\\t{\\n\\t\\t\\t\\tcima[x]=ma[x];\\n\\t\\t\\t\\tma[x]=ma[to[p]];\\n\\t\\t\\t}\\n\\t\\t\\telse if (ma[to[p]]>cima[x]) cima[x]=ma[to[p]];\\n\\t\\t}\\n\\t\\tp=nt[p];\\n\\t}\\n\\tma[x]++; cima[x]++;\\n}\\nvoid dfs2(int x,int fa,int d)\\n{\\n\\tdp[x]=max(d,ma[x]);\\n\\tint p=st[x];\\n\\twhile (p)\\n\\t{\\n\\t\\tif (to[p]!=fa)\\n\\t\\t{\\n\\t\\t\\tint now=d+1;\\n\\t\\t\\tif (ma[x]==ma[to[p]]+1) now=max(now,cima[x]+1);\\n\\t\\t\\telse now=max(now,ma[x]+1);\\n\\t\\t\\tdfs2(to[p],x,now);\\n\\t\\t}\\n\\t\\tp=nt[p];\\n\\t}\\n\\n}\\nvoid dfs3(int x,int fa,int now,long long G)\\n{\\n\\tif (G<0) return;\\n\\tG+=g[x]; ans=max(ans,now);\\n\\tint p=st[x];\\n\\twhile (p)\\n\\t{\\n\\t\\tif (to[p]!=fa) dfs3(to[p],x,now+1,G-w[p]);\\n\\t\\tp=nt[p];\\n\\t}\\n}\\nvoid solve(int x)\\n{\\n\\tif (dp[a[x]]<=ans) return;\\n\\tdfs3(a[x],0,1,0);\\n\\tswap(a[x],a[p]); p--;\\n}\\nvoid solve1(int x)\\n{\\n\\tif (dp[x]<=ans) return;\\n\\tdfs3(x,0,1,0);\\n}\\nint main()\\n{\\n\\tscanf(\\\"%d\\\",&n);\\n\\tfor (int i=1;i<=n;i++) scanf(\\\"%d\\\",&g[i]);\\n\\tfor (int i=1;i<n;i++)\\n\\t{\\n\\t\\tint x,y,z; scanf(\\\"%d%d%d\\\",&x,&y,&z);\\n\\t\\tadd(x,y,z); add(y,x,z);\\n\\t}\\n\\tdfs1(1,0); dfs2(1,0,0);\\n\\tif (n<=10000)\\n\\t{\\n\\t\\tfor (int i=1;i<=n;i++) solve1(i);\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tfor (int i=1;i<=n;i++) a[p++]=i;\\n\\t\\tp--;\\n\\t\\twhile (clock()<1850 && p>-1) solve(rng()%(p+1));\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\nreturn 0;\\n}\",\n \"accuracy\": 0.13924050632911392,\n \"time_ms\": 10,\n \"memory_kb\": 6424,\n \"score_of_the_acc\": -0.0009,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2790_5177682\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\nconst int maxn=1e6+10;\\nint n,g[maxn],st[maxn],to[maxn],nt[maxn],topt,w[maxn],ans,ma[maxn],cima[maxn],dp[maxn],a[maxn],p;\\nbool f[maxn];\\nvoid add(int x,int y,int z){to[++topt]=y; nt[topt]=st[x]; st[x]=topt; w[topt]=z;}\\nvoid dfs1(int x,int fa)\\n{\\n\\tdp[x]=0; int p=st[x];\\n\\twhile (p)\\n\\t{\\n\\t\\tif (to[p]!=fa) \\n\\t\\t{\\n\\t\\t\\tdfs1(to[p],x);\\n\\t\\t\\tif (ma[to[p]]>=ma[x])\\n\\t\\t\\t{\\n\\t\\t\\t\\tcima[x]=ma[x];\\n\\t\\t\\t\\tma[x]=ma[to[p]];\\n\\t\\t\\t}\\n\\t\\t\\telse if (ma[to[p]]>cima[x]) cima[x]=ma[to[p]];\\n\\t\\t}\\n\\t\\tp=nt[p];\\n\\t}\\n\\tma[x]++; cima[x]++;\\n}\\nvoid dfs2(int x,int fa,int d)\\n{\\n\\tdp[x]=max(d,ma[x]);\\n\\tint p=st[x];\\n\\twhile (p)\\n\\t{\\n\\t\\tif (to[p]!=fa)\\n\\t\\t{\\n\\t\\t\\tint now=d+1;\\n\\t\\t\\tif (ma[x]==ma[to[p]]+1) now=max(now,cima[x]+1);\\n\\t\\t\\telse now=max(now,ma[x]+1);\\n\\t\\t\\tdfs2(to[p],x,now);\\n\\t\\t}\\n\\t\\tp=nt[p];\\n\\t}\\n\\n}\\nvoid dfs3(int x,int fa,int now,long long G)\\n{\\n\\tif (G<0) return;\\n\\tG+=g[x]; ans=max(ans,now);\\n\\tint p=st[x];\\n\\twhile (p)\\n\\t{\\n\\t\\tif (to[p]!=fa) dfs3(to[p],x,now+1,G-w[p]);\\n\\t\\tp=nt[p];\\n\\t}\\n}\\nvoid solve(int x)\\n{\\n\\tif (dp[a[x]]<=ans) return;\\n\\tdfs3(a[x],0,1,0);\\n\\tswap(a[x],a[p]); p--;\\n}\\nvoid solve1(int x)\\n{\\n\\tif (dp[x]<=ans) return;\\n\\tdfs3(x,0,1,0);\\n}\\nint main()\\n{\\n\\tscanf(\\\"%d\\\",&n);\\n\\tfor (int i=1;i<=n;i++) scanf(\\\"%d\\\",&g[i]);\\n\\tfor (int i=1;i<n;i++)\\n\\t{\\n\\t\\tint x,y,z; scanf(\\\"%d%d%d\\\",&x,&y,&z);\\n\\t\\tadd(x,y,z); add(y,x,z);\\n\\t}\\n\\tdfs1(1,0); dfs2(1,0,0);\\n\\tif (n<=1000)\\n\\t{\\n\\t\\tfor (int i=1;i<=n;i++) solve1(i);\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tfor (int i=1;i<=n;i++) a[p++]=i;\\n\\t\\tp--;\\n\\t\\twhile (clock()<1850 && p>-1) solve(rng()%(p+1));\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\nreturn 0;\\n}\",\n \"accuracy\": 0.13924050632911392,\n \"time_ms\": 10,\n \"memory_kb\": 6380,\n \"score_of_the_acc\": 0,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2790_5176515\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define LL long long\\nusing namespace std;\\nconst int INF=2e9;\\nconst int N=1e5+10;\\nint read(){\\n int x=0,f=1;char ch=getchar();\\n while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}\\n while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}\\n return x*f;\\n}\\nvoid print(LL x){\\n if(x>9) print(x/10);\\n putchar(x%10+'0');\\n}\\nint n,ans;\\nstruct edge{\\n\\tint r,v;\\n};\\nvector<edge> E[N];\\nint g[N];\\nvoid insert(int u,int v,int w){\\n\\tE[u].push_back(edge{v,w});\\n}\\nint mx,rt;\\nint sz[N];\\nbool vis[N];\\nvoid getrt(int x,int S,int fa){\\n\\t//cout<<x<<\\\" \\\"<<S<<\\\" \\\"<<fa<<endl;\\n sz[x]=1;int son=0,y;\\n for(int i=0;i<E[x].size();++i){\\n \\ty=E[x][i].r;\\n \\tif(vis[y]==0&&y!=fa){\\n getrt(y,S,x);\\n sz[x]+=sz[y];\\n son=max(son,sz[y]);\\n }\\n\\t}\\n son=max(son,S-sz[x]);\\n if(son<=mx){\\n rt=x;\\n mx=son;\\n }\\n}\\nint dep[N],mxd[N];\\nint dis[N],oil[N];\\nvoid getdep(int x,int fa){\\n\\tint y;\\n\\tsz[x]=1;\\n\\tmxd[x]=dep[x];oil[x]=oil[fa]+g[x];\\n\\tfor(int i=0;i<E[x].size();++i){\\n \\ty=E[x][i].r;\\n \\tif(vis[y]==0&&y!=fa){\\n \\t\\tdis[y]=dis[x]+E[x][i].v;\\n dep[y]=dep[x]+1;\\n getdep(y,x);\\n sz[x]+=sz[y];\\n mxd[x]=max(mxd[x],mxd[y]);\\n }\\n\\t}\\n}\\nedge q[N];\\nbool cmp(edge x,edge y){\\n\\treturn mxd[x.r]<mxd[y.r];\\n}\\nint pre[N],suf[N];\\nint PRE[N],SUF[N];\\nint wws[N],ned[N];\\nvoid cal(int x,int fa){\\n\\tint y;\\n\\tSUF[dep[x]]=min(SUF[dep[x]],wws[x]);\\n\\tif(ned[x]==0) PRE[dep[x]]=max(PRE[dep[x]],oil[x]-dis[x]);\\n\\tfor(int i=0;i<E[x].size();++i){\\n \\ty=E[x][i].r;\\n \\tif(vis[y]==0&&y!=fa){\\n \\t\\twws[y]=wws[x]+max(0,E[x][i].v-g[x]);\\n \\t\\tif(g[E[x][i].r]-E[x][i].v>=ned[x]) ned[E[x][i].r]=0;\\n \\t\\telse ned[E[x][i].r]=ned[x]+E[x][i].v-g[E[x][i].r];\\n \\t\\tcal(y,x);\\n }\\n\\t}\\n}\\nvoid sol(int x,int S){\\n\\tmx=1e9;\\n\\tgetrt(x,S,0);\\n\\t//cout<<rt<<endl;\\n\\tx=rt;\\n\\tdep[x]=0;dis[x]=0;\\n\\tgetdep(x,0);\\n\\tint r=0;\\n\\t//cout<<rt<<endl;\\n\\tfor(int i=0;i<E[x].size();++i){\\n\\t\\tif(vis[E[x][i].r]==0) q[++r]=E[x][i];\\n\\t}\\n if(r==0) return;\\n // cout<<rt<<endl;\\n sort(q+1,q+1+r,cmp);\\n for(int i=0;i<=mxd[x];++i){\\n \\tpre[i]=-INF;\\n \\tsuf[i]=INF;\\n\\t}\\n\\tpre[0]=g[x];\\n\\tsuf[0]=0;\\n\\tfor(int i=1;i<=r;++i){\\n\\t\\tfor(int j=0;j<=mxd[q[i].r];++j){\\n\\t\\t\\tPRE[j]=-INF;\\n\\t\\t\\tSUF[j]=INF;\\n\\t\\t}\\n\\t\\tned[q[i].r]=max(0,q[i].v-g[q[i].r]);\\n\\t\\twws[q[i].r]=q[i].v;\\n\\t\\t//if(q[i].v<=g[q[i].r]) PRE[1]=g[x]+g[q[i].r]-q[i].v;\\n\\t\\tcal(q[i].r,x);\\n\\t\\tfor(int j=mxd[q[i].r];j>1;--j){\\n\\t\\t\\tSUF[j-1]=min(SUF[j],SUF[j-1]);\\n\\t\\t\\tPRE[j-1]=max(PRE[j],PRE[j-1]);\\n\\t\\t}\\n\\t\\tfor(int j=1,k=mxd[q[i].r];j<=mxd[q[i].r];++j){\\n\\t\\t\\twhile(k>0&&suf[k]>PRE[j]) --k;\\n\\t\\t\\tif(suf[k]<=PRE[j]) ans=max(ans,j+k+1);\\n\\t\\t}\\n\\t\\tfor(int j=1,k=mxd[q[i].r];j<=mxd[q[i].r];++j){\\n\\t\\t\\twhile(k>0&&pre[k]<SUF[j]) --k;\\n\\t\\t\\tif(SUF[j]<=pre[k]) ans=max(ans,j+k+1);\\n\\t\\t}\\n\\t\\tfor(int j=mxd[q[i].r];j>=0;--j){\\n\\t\\t\\tsuf[j]=min(suf[j],SUF[j]);\\n\\t\\t\\tpre[j]=max(pre[j],PRE[j]);\\n\\t\\t}\\n\\t\\tfor(int j=mxd[q[i].r];j>=1;--j){\\n\\t\\t\\tsuf[j-1]=min(suf[j],suf[j-1]);\\n\\t\\t\\tpre[j-1]=max(pre[j],pre[j-1]);\\n\\t\\t}\\n\\t\\tpre[0]=max(pre[1],pre[0]);\\n\\t}\\n\\t//cout<<ans<<endl;\\n\\tvis[x]=1;\\n\\tfor(int i=0;i<E[x].size();++i){\\n\\t\\tif(vis[E[x][i].r]==0) sol(E[x][i].r,sz[E[x][i].r]);\\n\\t}\\n}\\nint main(){\\n\\tscanf(\\\"%d\\\",&n);ans=1;oil[0]=0;\\n\\tfor(int i=1;i<=n;++i) scanf(\\\"%d\\\",&g[i]);\\n\\tint u,v,w;\\n\\tfor(int i=1;i<n;++i){\\n\\t\\tscanf(\\\"%d%d%d\\\",&u,&v,&w);\\n\\t\\tinsert(u,v,w);\\n\\t\\tinsert(v,u,w);\\n\\t}\\n\\tsol(1,n);\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4050632911392405,\n \"time_ms\": 50,\n \"memory_kb\": 16172,\n \"score_of_the_acc\": -0.2923,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2790_5176438\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define LL long long\\nusing namespace std;\\nconst int INF=1e9+10;\\nconst int N=3e5+10;\\nint read(){\\n int x=0,f=1;char ch=getchar();\\n while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}\\n while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}\\n return x*f;\\n}\\nvoid print(LL x){\\n if(x>9) print(x/10);\\n putchar(x%10+'0');\\n}\\nint n,ans;\\nstruct edge{\\n\\tint r,v;\\n};\\nvector<edge> E[N];\\nint g[N];\\nvoid insert(int u,int v,int w){\\n\\tE[u].push_back(edge{v,w});\\n}\\nint mx,rt;\\nint sz[N];\\nbool vis[N];\\nvoid getrt(int x,int S,int fa){\\n\\t//cout<<x<<\\\" \\\"<<S<<\\\" \\\"<<fa<<endl;\\n sz[x]=1;int son=0,y;\\n for(int i=0;i<E[x].size();++i){\\n \\ty=E[x][i].r;\\n \\tif(vis[y]==0&&y!=fa){\\n getrt(y,S,x);\\n sz[x]+=sz[y];\\n son=max(son,sz[y]);\\n }\\n\\t}\\n son=max(son,S-sz[x]);\\n if(son<=mx){\\n rt=x;\\n mx=son;\\n }\\n}\\nint dep[N],mxd[N];\\nint dis[N],oil[N];\\nvoid getdep(int x,int fa){\\n\\tint y;\\n\\tsz[x]=1;\\n\\tmxd[x]=dep[x];oil[x]=oil[fa]+g[x];\\n\\tfor(int i=0;i<E[x].size();++i){\\n \\ty=E[x][i].r;\\n \\tif(vis[y]==0&&y!=fa){\\n \\t\\tdis[y]=dis[x]+E[x][i].v;\\n dep[y]=dep[x]+1;\\n getdep(y,x);\\n sz[x]+=sz[y];\\n mxd[x]=max(mxd[x],mxd[y]);\\n }\\n\\t}\\n}\\nedge q[N];\\nbool cmp(edge x,edge y){\\n\\treturn mxd[x.r]<mxd[y.r];\\n}\\nint pre[N],suf[N];\\nint PRE[N],SUF[N];\\nint wws[N],ned[N];\\nvoid cal(int x,int fa){\\n\\tint y;\\n\\tSUF[dep[x]]=min(SUF[dep[x]],wws[x]);\\n\\tif(ned[x]==0) PRE[dep[x]]=max(PRE[dep[x]],oil[x]-dis[x]);\\n\\tfor(int i=0;i<E[x].size();++i){\\n \\ty=E[x][i].r;\\n \\tif(vis[y]==0&&y!=fa){\\n \\t\\twws[y]=wws[x]+max(0,E[x][i].v-g[x]);\\n \\t\\tif(g[E[x][i].r]-E[x][i].v>=ned[x]) ned[E[x][i].r]=0;\\n \\t\\telse ned[E[x][i].r]=ned[x]+E[x][i].v-g[E[x][i].r];\\n \\t\\tcal(y,x);\\n }\\n\\t}\\n}\\nvoid sol(int x,int S){\\n\\tmx=1e9;\\n\\tgetrt(x,S,0);\\n\\t//cout<<rt<<endl;\\n\\tx=rt;\\n\\tdep[x]=0;dis[x]=0;\\n\\tgetdep(x,0);\\n\\tint r=0;\\n\\t//cout<<rt<<endl;\\n\\tfor(int i=0;i<E[x].size();++i){\\n\\t\\tif(vis[E[x][i].r]==0) q[++r]=E[x][i];\\n\\t}\\n if(r==0) return;\\n // cout<<rt<<endl;\\n sort(q+1,q+1+r,cmp);\\n for(int i=0;i<=mxd[x];++i){\\n \\tpre[i]=-INF;\\n \\tsuf[i]=INF;\\n\\t}\\n\\tpre[0]=g[x];\\n\\tsuf[0]=0;\\n\\tfor(int i=1;i<=r;++i){\\n\\t\\tfor(int j=0;j<=mxd[q[i].r];++j){\\n\\t\\t\\tPRE[j]=-INF;\\n\\t\\t\\tSUF[j]=INF;\\n\\t\\t}\\n\\t\\tned[q[i].r]=max(0,q[i].v-g[q[i].r]);\\n\\t\\twws[q[i].r]=q[i].v;\\n\\t\\t//if(q[i].v<=g[q[i].r]) PRE[1]=g[x]+g[q[i].r]-q[i].v;\\n\\t\\tcal(q[i].r,x);\\n\\t\\tfor(int j=mxd[q[i].r];j>1;--j){\\n\\t\\t\\tSUF[j-1]=min(SUF[j],SUF[j-1]);\\n\\t\\t\\tPRE[j-1]=max(PRE[j],PRE[j-1]);\\n\\t\\t}\\n\\t\\tfor(int j=1,k=mxd[q[i].r];j<=mxd[q[i].r];++j){\\n\\t\\t\\twhile(k>0&&suf[k]>PRE[j]) --k;\\n\\t\\t\\tif(suf[k]<=PRE[j]) ans=max(ans,j+k+1);\\n\\t\\t}\\n\\t\\tfor(int j=1,k=mxd[q[i].r];j<=mxd[q[i].r];++j){\\n\\t\\t\\twhile(k>0&&pre[k]<SUF[j]) --k;\\n\\t\\t\\tif(SUF[j]<=pre[k]) ans=max(ans,j+k+1);\\n\\t\\t}\\n\\t\\tfor(int j=mxd[q[i].r];j>=0;--j){\\n\\t\\t\\tsuf[j]=min(suf[j],SUF[j]);\\n\\t\\t\\tpre[j]=max(pre[j],PRE[j]);\\n\\t\\t}\\n\\t\\tpre[0]=max(pre[1],pre[0]);\\n\\t}\\n\\t//cout<<ans<<endl;\\n\\tvis[x]=1;\\n\\tfor(int i=0;i<E[x].size();++i){\\n\\t\\tif(vis[E[x][i].r]==0) sol(E[x][i].r,sz[E[x][i].r]);\\n\\t}\\n}\\nint main(){\\n\\tscanf(\\\"%d\\\",&n);ans=1;oil[0]=0;\\n\\tfor(int i=1;i<=n;++i) scanf(\\\"%d\\\",&g[i]);\\n\\tint u,v,w;\\n\\tfor(int i=1;i<n;++i){\\n\\t\\tscanf(\\\"%d%d%d\\\",&u,&v,&w);\\n\\t\\tinsert(u,v,w);\\n\\t\\tinsert(v,u,w);\\n\\t}\\n\\tsol(1,n);\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4050632911392405,\n \"time_ms\": 50,\n \"memory_kb\": 20776,\n \"score_of_the_acc\": -0.3906,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2790_4054159\",\n \"code_snippet\": \"#include <algorithm>\\n#include <set>\\n#include <limits>\\n#include <utility>\\n#include <iostream>\\n#include <type_traits>\\n#include <vector>\\n#include <cstdint>\\n#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2790\\\"\\n\\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};\\ntemplate<typename F>\\nstruct fixpoint : F\\n{\\n fixpoint(F&& f) : F(std::forward<F>(f)) {}\\n template<typename... Args>\\n decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }\\n};\\n// template<typename F>\\n// inline decltype(auto) mfp(F&& f) { return fixpoint<F>{std::forward<F>(f)}; }\\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\\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>\\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>()...}; }\\n\\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 std::cout << \\\"\\\\n\\\", 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>\\nvoid outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\\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\\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>>;\\ntemplate<typename Edge = edge<>>\\nclass centroid\\n{\\npublic:\\n centroid(const base_tree<Edge>& tree) : cs(tree.size())\\n {\\n const std::size_t sz = tree.size();\\n std::vector<std::size_t> sub(sz, 1);\\n std::vector<bool> used(sz, false);\\n auto size = [&, sz](auto&& self, const std::size_t s, const std::size_t p) -> std::size_t {\\n sub[s] = 1;\\n for (const auto& e : tree[s]) {\\n const std::size_t to = e.to();\\n if (to == p or used[to]) { continue; }\\n sub[s] += self(self, to, s);\\n }\\n return sub[s];\\n };\\n auto search = [&, sz](auto&& self, const std::size_t s, const std::size_t p, const std::size_t tot) -> std::size_t {\\n for (const auto& e : tree[s]) {\\n const std::size_t to = e.to();\\n if (p == to or used[to]) { continue; }\\n if (sub[to] * 2 > tot) { return self(self, to, s, tot); }\\n }\\n return s;\\n };\\n auto build = [&, sz](auto&& self, const std::size_t s, const std::size_t pc) -> std::size_t {\\n const std::size_t tot = size(size, s, sz), c = search(search, s, sz, tot);\\n used[c] = true;\\n if (pc != sz) { cs.add_edge(pc, c); }\\n for (const auto& e : tree[c]) {\\n const std::size_t to = e.to();\\n if (not used[to]) { self(self, to, c); }\\n }\\n return c;\\n };\\n build(build, 0, sz);\\n }\\n const tree& centros() const { return cs; }\\n\\nprivate:\\n tree cs;\\n};\\nint main()\\n{\\n auto N = in<usize>();\\n auto gas = in_v<ll>({N});\\n cost_graph<ll> g(N);\\n for (usize i = 0; i < N - 1; i++) {\\n const auto a = in<usize>() - 1;\\n const auto b = in<usize>() - 1;\\n const auto d = in<ll>();\\n g.add_edge(a, b, d, true);\\n }\\n const auto cg = centroid<edge<ll>>{g}.centros();\\n usize centor = 0;\\n for (; centor < N; centor++) {\\n if (cg.to(centor).empty()) { break; }\\n }\\n usize ans = 1;\\n std::vector<bool> used(N, false);\\n mfp([&](auto&& dfs, usize c) -> void {\\n used[c] = true;\\n const usize cn = g[c].size();\\n std::vector<std::vector<ll>> sub_ups(cn);\\n std::vector<std::vector<ll>> sub_downs(cn);\\n for (usize i = 0; i < cn; i++) {\\n const auto& e = g[c][i];\\n usize to = e.to();\\n if (used[to]) { continue; }\\n ll cost = e.cost();\\n sub_downs[i].push_back(0LL);\\n sub_ups[i].push_back(0LL);\\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\\n if (sub_downs[i].size() <= d) { sub_downs[i].push_back(-inf_v<ll>); }\\n chmax(sub_downs[i][d], min);\\n for (const auto& e : g[s]) {\\n const usize to = e.to();\\n if (to == p or used[to]) { continue; }\\n const ll cost = e.cost();\\n dfs(dfs, to, s, d + 1, c - cost + gas[s], std::min(min, c - cost + gas[s]));\\n }\\n })(to, c, 1, gas[c] - cost, std::min(gas[c] - cost, 0LL));\\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\\n if (sub_ups[i].size() <= d) { sub_ups[i].push_back(-inf_v<ll>); }\\n if (min == 0) { chmax(sub_ups[i][d], c); }\\n for (const auto& e : g[s]) {\\n const usize to = e.to();\\n if (to == p or used[to]) { continue; }\\n const ll cost = e.cost();\\n const ll nmin = std::min(0LL, min - (cost - gas[to]));\\n dfs(dfs, to, s, d + 1, c - cost + gas[to], nmin);\\n }\\n })(to, c, 1, -cost + gas[to], std::min(0LL, -cost + gas[to]));\\n }\\n usize dmax = 0;\\n for (usize i = 0; i < cn; i++) { chmax(dmax, sub_downs[i].size()); }\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 1; d < sub_downs[i].size(); d++) {\\n if (sub_downs[i][d] >= 0) { chmax(ans, d + 1); }\\n }\\n for (usize d = 1; d < sub_ups[i].size(); d++) {\\n if (sub_ups[i][d] >= 0) { chmax(ans, d + 1); }\\n }\\n }\\n for (usize i = 0; i < cn; i++) {\\n for (int d = (int)sub_downs[i].size() - 1; d >= 1; d--) { chmax(sub_downs[i][d - 1], sub_downs[i][d]); }\\n }\\n std::vector<std::multiset<ll, std::greater<ll>>> sd(dmax);\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 0; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\\n }\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].erase(sd[d].find(sub_downs[i][d])); }\\n for (usize d = 1; d < sub_ups[i].size(); d++) {\\n const ll up = sub_ups[i][d];\\n usize inf = 0, sup = dmax;\\n while (sup - inf > 1) {\\n const usize mid = (inf + sup) / 2;\\n const ll down = (sd[mid].empty() ? -inf_v<ll> : *sd[mid].begin());\\n (up + down >= 0 and not sd[mid].empty() ? inf : sup) = mid;\\n }\\n if (inf > 0) { chmax(ans, d + inf + 1); }\\n }\\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\\n }\\n for (const usize nc : cg[c]) { dfs(dfs, nc); }\\n })(centor);\\n outln(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 53232,\n \"score_of_the_acc\": -1.7708,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2790_4054158\",\n \"code_snippet\": \"#include <algorithm>\\n#include <set>\\n#include <limits>\\n#include <utility>\\n#include <iostream>\\n#include <type_traits>\\n#include <vector>\\n#include <cstdint>\\n#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2790\\\"\\n\\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};\\ntemplate<typename F>\\nstruct fixpoint : F\\n{\\n fixpoint(F&& f) : F(std::forward<F>(f)) {}\\n template<typename... Args>\\n decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }\\n};\\n// template<typename F>\\n// inline decltype(auto) mfp(F&& f) { return fixpoint<F>{std::forward<F>(f)}; }\\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\\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>\\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>()...}; }\\n\\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 std::cout << \\\"\\\\n\\\", 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>\\nvoid outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\\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\\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>>;\\ntemplate<typename Edge = edge<>>\\nclass centroid\\n{\\npublic:\\n centroid(const base_tree<Edge>& tree) : cs(tree.size())\\n {\\n const std::size_t sz = tree.size();\\n std::vector<std::size_t> sub(sz, 1);\\n std::vector<bool> used(sz, false);\\n auto size = [&, sz](auto&& self, const std::size_t s, const std::size_t p) -> std::size_t {\\n sub[s] = 1;\\n for (const auto& e : tree[s]) {\\n const std::size_t to = e.to();\\n if (to == p or used[to]) { continue; }\\n sub[s] += self(self, to, s);\\n }\\n return sub[s];\\n };\\n auto search = [&, sz](auto&& self, const std::size_t s, const std::size_t p, const std::size_t tot) -> std::size_t {\\n for (const auto& e : tree[s]) {\\n const std::size_t to = e.to();\\n if (p == to or used[to]) { continue; }\\n if (sub[to] * 2 > tot) { return self(self, to, s, tot); }\\n }\\n return s;\\n };\\n auto build = [&, sz](auto&& self, const std::size_t s, const std::size_t pc) -> std::size_t {\\n const std::size_t tot = size(size, s, sz), c = search(search, s, sz, tot);\\n used[c] = true;\\n if (pc != sz) { cs.add_edge(pc, c); }\\n for (const auto& e : tree[c]) {\\n const std::size_t to = e.to();\\n if (not used[to]) { self(self, to, c); }\\n }\\n return c;\\n };\\n build(build, 0, sz);\\n }\\n const tree& centros() const { return cs; }\\n\\nprivate:\\n tree cs;\\n};\\nint main()\\n{\\n auto N = in<usize>();\\n auto gas = in_v<ll>({N});\\n cost_graph<ll> g(N);\\n for (usize i = 0; i < N - 1; i++) {\\n const auto a = in<usize>() - 1;\\n const auto b = in<usize>() - 1;\\n const auto d = in<ll>();\\n g.add_edge(a, b, d, true);\\n }\\n const auto cg = centroid<edge<ll>>{g}.centros();\\n usize centor = 0;\\n for (; centor < N; centor++) {\\n if (cg.to(centor).empty()) { break; }\\n }\\n usize ans = 1;\\n std::vector<bool> used(N, false);\\n mfp([&](auto&& dfs, usize c) -> void {\\n used[c] = true;\\n const usize cn = g[c].size();\\n std::vector<std::vector<ll>> sub_ups(cn);\\n std::vector<std::vector<ll>> sub_downs(cn);\\n for (usize i = 0; i < cn; i++) {\\n const auto& e = g[c][i];\\n usize to = e.to();\\n if (used[to]) { continue; }\\n ll cost = e.cost();\\n sub_downs[i].push_back(0LL);\\n sub_ups[i].push_back(0LL);\\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\\n if (sub_downs[i].size() <= d) { sub_downs[i].push_back(-inf_v<ll>); }\\n chmax(sub_downs[i][d], min);\\n for (const auto& e : g[s]) {\\n const usize to = e.to();\\n if (to == p or used[to]) { continue; }\\n const ll cost = e.cost();\\n chmin(min, c - cost + gas[s]);\\n dfs(dfs, to, s, d + 1, c - cost + gas[s], min);\\n }\\n })(to, c, 1, gas[c] - cost, std::min(gas[c] - cost, 0LL));\\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\\n if (sub_ups[i].size() <= d) { sub_ups[i].push_back(-inf_v<ll>); }\\n if (min == 0) { chmax(sub_ups[i][d], c); }\\n for (const auto& e : g[s]) {\\n const usize to = e.to();\\n if (to == p or used[to]) { continue; }\\n const ll cost = e.cost();\\n min = std::min(0LL, min - (cost - gas[to]));\\n dfs(dfs, to, s, d + 1, c - cost + gas[to], min);\\n }\\n })(to, c, 1, -cost + gas[to], std::min(0LL, -cost + gas[to]));\\n }\\n usize dmax = 0;\\n for (usize i = 0; i < cn; i++) { chmax(dmax, sub_downs[i].size()); }\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 1; d < sub_downs[i].size(); d++) {\\n if (sub_downs[i][d] >= 0) { chmax(ans, d + 1); }\\n }\\n for (usize d = 1; d < sub_ups[i].size(); d++) {\\n if (sub_ups[i][d] >= 0) { chmax(ans, d + 1); }\\n }\\n }\\n for (usize i = 0; i < cn; i++) {\\n for (int d = (int)sub_downs[i].size() - 1; d >= 1; d--) { chmax(sub_downs[i][d - 1], sub_downs[i][d]); }\\n }\\n std::vector<std::multiset<ll, std::greater<ll>>> sd(dmax);\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 0; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\\n }\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].erase(sd[d].find(sub_downs[i][d])); }\\n for (usize d = 1; d < sub_ups[i].size(); d++) {\\n const ll up = sub_ups[i][d];\\n usize inf = 0, sup = dmax;\\n while (sup - inf > 1) {\\n const usize mid = (inf + sup) / 2;\\n const ll down = (sd[mid].empty() ? -inf_v<ll> : *sd[mid].begin());\\n (up + down >= 0 and not sd[mid].empty() ? inf : sup) = mid;\\n }\\n if (inf > 0) { chmax(ans, d + inf + 1); }\\n }\\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\\n }\\n for (const usize nc : cg[c]) { dfs(dfs, nc); }\\n })(centor);\\n outln(ans);\\n return 0;\\n}\",\n \"accuracy\": 0.6075949367088608,\n \"time_ms\": 380,\n \"memory_kb\": 53204,\n \"score_of_the_acc\": -1.7702,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2790_4054157\",\n \"code_snippet\": \"#include <algorithm>\\n#include <set>\\n#include <limits>\\n#include <utility>\\n#include <iostream>\\n#include <type_traits>\\n#include <vector>\\n#include <cstdint>\\n#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2790\\\"\\n\\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};\\ntemplate<typename F>\\nstruct fixpoint : F\\n{\\n fixpoint(F&& f) : F(std::forward<F>(f)) {}\\n template<typename... Args>\\n decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }\\n};\\n// template<typename F>\\n// inline decltype(auto) mfp(F&& f) { return fixpoint<F>{std::forward<F>(f)}; }\\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\\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>\\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>()...}; }\\n\\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 std::cout << \\\"\\\\n\\\", 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>\\nvoid outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\\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\\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>>;\\ntemplate<typename Edge = edge<>>\\nclass centroid\\n{\\npublic:\\n centroid(const base_tree<Edge>& tree) : cs(tree.size())\\n {\\n const std::size_t sz = tree.size();\\n std::vector<std::size_t> sub(sz, 1);\\n std::vector<bool> used(sz, false);\\n auto size = [&, sz](auto&& self, const std::size_t s, const std::size_t p) -> std::size_t {\\n sub[s] = 1;\\n for (const auto& e : tree[s]) {\\n const std::size_t to = e.to();\\n if (to == p or used[to]) { continue; }\\n sub[s] += self(self, to, s);\\n }\\n return sub[s];\\n };\\n auto search = [&, sz](auto&& self, const std::size_t s, const std::size_t p, const std::size_t tot) -> std::size_t {\\n for (const auto& e : tree[s]) {\\n const std::size_t to = e.to();\\n if (p == to or used[to]) { continue; }\\n if (sub[to] * 2 > tot) { return self(self, to, s, tot); }\\n }\\n return s;\\n };\\n auto build = [&, sz](auto&& self, const std::size_t s, const std::size_t pc) -> std::size_t {\\n const std::size_t tot = size(size, s, sz), c = search(search, s, sz, tot);\\n used[c] = true;\\n if (pc != sz) { cs.add_edge(pc, c); }\\n for (const auto& e : tree[c]) {\\n const std::size_t to = e.to();\\n if (not used[to]) { self(self, to, c); }\\n }\\n return c;\\n };\\n build(build, 0, sz);\\n }\\n const tree& centros() const { return cs; }\\n\\nprivate:\\n tree cs;\\n};\\nint main()\\n{\\n auto N = in<usize>();\\n auto gas = in_v<ll>({N});\\n cost_graph<ll> g(N);\\n for (usize i = 0; i < N - 1; i++) {\\n const auto a = in<usize>() - 1;\\n const auto b = in<usize>() - 1;\\n const auto d = in<ll>();\\n g.add_edge(a, b, d, true);\\n }\\n const auto cg = centroid<edge<ll>>{g}.centros();\\n usize centor = 0;\\n for (; centor < N; centor++) {\\n if (cg.to(centor).empty()) { break; }\\n }\\n usize ans = 1;\\n std::vector<bool> used(N, false);\\n mfp([&](auto&& dfs, usize c) -> void {\\n used[c] = true;\\n const usize cn = g[c].size();\\n std::vector<std::vector<ll>> sub_ups(cn);\\n std::vector<std::vector<ll>> sub_downs(cn);\\n for (usize i = 0; i < cn; i++) {\\n const auto& e = g[c][i];\\n usize to = e.to();\\n if (used[to]) { continue; }\\n ll cost = e.cost();\\n sub_downs[i].push_back(0LL);\\n sub_ups[i].push_back(0LL);\\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\\n if (sub_downs[i].size() <= d) { sub_downs[i].push_back(c); }\\n chmax(sub_downs[i][d], min);\\n for (const auto& e : g[s]) {\\n const usize to = e.to();\\n if (to == p or used[to]) { continue; }\\n const ll cost = e.cost();\\n chmin(min, c - cost + gas[s]);\\n dfs(dfs, to, s, d + 1, c - cost + gas[s], min);\\n }\\n })(to, c, 1, gas[c] - cost, std::min(gas[c] - cost, 0LL));\\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c, ll min) -> void {\\n if (sub_ups[i].size() <= d) { sub_ups[i].push_back(c); }\\n if (min == 0) { chmax(sub_ups[i][d], c); }\\n for (const auto& e : g[s]) {\\n const usize to = e.to();\\n if (to == p or used[to]) { continue; }\\n const ll cost = e.cost();\\n chmin(min, std::min(0LL, min) - (cost - gas[to]));\\n dfs(dfs, to, s, d + 1, c - cost + gas[to], min);\\n }\\n })(to, c, 1, -cost + gas[to], std::min(0LL, -cost + gas[to]));\\n }\\n usize dmax = 0;\\n for (usize i = 0; i < cn; i++) { chmax(dmax, sub_downs[i].size()); }\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 1; d < sub_downs[i].size(); d++) {\\n if (sub_downs[i][d] >= 0) { chmax(ans, d + 1); }\\n }\\n for (usize d = 1; d < sub_ups[i].size(); d++) {\\n if (sub_ups[i][d] >= 0) { chmax(ans, d + 1); }\\n }\\n }\\n for (usize i = 0; i < cn; i++) {\\n for (int d = (int)sub_downs[i].size() - 1; d >= 1; d--) { chmax(sub_downs[i][d - 1], sub_downs[i][d]); }\\n }\\n std::vector<std::multiset<ll, std::greater<ll>>> sd(dmax);\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 0; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\\n }\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].erase(sd[d].find(sub_downs[i][d])); }\\n for (usize d = 1; d < sub_ups[i].size(); d++) {\\n const ll up = sub_ups[i][d];\\n usize inf = 0, sup = dmax;\\n while (sup - inf > 1) {\\n const usize mid = (inf + sup) / 2;\\n const ll down = (sd[mid].empty() ? -inf_v<ll> : *sd[mid].begin());\\n (up + down >= 0 and not sd[mid].empty() ? inf : sup) = mid;\\n }\\n if (inf > 0) { chmax(ans, d + inf + 1); }\\n }\\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\\n }\\n for (const usize nc : cg[c]) { dfs(dfs, nc); }\\n })(centor);\\n outln(ans);\\n return 0;\\n}\",\n \"accuracy\": 0.4050632911392405,\n \"time_ms\": 260,\n \"memory_kb\": 49828,\n \"score_of_the_acc\": -1.4482,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2790_4054153\",\n \"code_snippet\": \"#include <algorithm>\\n#include <set>\\n#include <limits>\\n#include <utility>\\n#include <iostream>\\n#include <type_traits>\\n#include <vector>\\n#include <cstdint>\\n#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2790\\\"\\n\\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};\\ntemplate<typename F>\\nstruct fixpoint : F\\n{\\n fixpoint(F&& f) : F(std::forward<F>(f)) {}\\n template<typename... Args>\\n decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }\\n};\\n// template<typename F>\\n// inline decltype(auto) mfp(F&& f) { return fixpoint<F>{std::forward<F>(f)}; }\\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\\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>\\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>()...}; }\\n\\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 std::cout << \\\"\\\\n\\\", 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>\\nvoid outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\\n# define SHOW(...) static_cast<void>(0)\\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\\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>>;\\ntemplate<typename Edge = edge<>>\\nclass centroid\\n{\\npublic:\\n centroid(const base_tree<Edge>& tree) : cs(tree.size())\\n {\\n const std::size_t sz = tree.size();\\n std::vector<std::size_t> sub(sz, 1);\\n std::vector<bool> used(sz, false);\\n auto size = [&, sz](auto&& self, const std::size_t s, const std::size_t p) -> std::size_t {\\n sub[s] = 1;\\n for (const auto& e : tree[s]) {\\n const std::size_t to = e.to();\\n if (to == p or used[to]) { continue; }\\n sub[s] += self(self, to, s);\\n }\\n return sub[s];\\n };\\n auto search = [&, sz](auto&& self, const std::size_t s, const std::size_t p, const std::size_t tot) -> std::size_t {\\n for (const auto& e : tree[s]) {\\n const std::size_t to = e.to();\\n if (p == to or used[to]) { continue; }\\n if (sub[to] * 2 > tot) { return self(self, to, s, tot); }\\n }\\n return s;\\n };\\n auto build = [&, sz](auto&& self, const std::size_t s, const std::size_t pc) -> std::size_t {\\n const std::size_t tot = size(size, s, sz), c = search(search, s, sz, tot);\\n used[c] = true;\\n if (pc != sz) { cs.add_edge(pc, c); }\\n for (const auto& e : tree[c]) {\\n const std::size_t to = e.to();\\n if (not used[to]) { self(self, to, c); }\\n }\\n return c;\\n };\\n build(build, 0, sz);\\n }\\n const tree& centros() const { return cs; }\\n\\nprivate:\\n tree cs;\\n};\\nint main()\\n{\\n auto N = in<usize>();\\n auto gas = in_v<ll>({N});\\n cost_graph<ll> g(N);\\n for (usize i = 0; i < N - 1; i++) {\\n const auto a = in<usize>() - 1;\\n const auto b = in<usize>() - 1;\\n const auto d = in<ll>();\\n g.add_edge(a, b, d, true);\\n }\\n const auto cg = centroid<edge<ll>>{g}.centros();\\n usize centor = 0;\\n for (; centor < N; centor++) {\\n if (cg.to(centor).empty()) { break; }\\n }\\n usize ans = 1;\\n std::vector<bool> used(N, false);\\n mfp([&](auto&& dfs, usize c) -> void {\\n used[c] = true;\\n const usize cn = g[c].size();\\n std::vector<std::vector<ll>> sub_ups(cn);\\n std::vector<std::vector<ll>> sub_downs(cn);\\n for (usize i = 0; i < cn; i++) {\\n const auto& e = g[c][i];\\n usize to = e.to();\\n if (used[to]) { continue; }\\n ll cost = e.cost();\\n sub_downs[i].push_back(0LL);\\n sub_ups[i].push_back(0LL);\\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c) -> void {\\n if (sub_downs[i].size() <= d) { sub_downs[i].push_back(c); }\\n chmax(sub_downs[i][d], c);\\n for (const auto& e : g[s]) {\\n const usize to = e.to();\\n if (to == p or used[to]) { continue; }\\n const ll cost = e.cost();\\n dfs(dfs, to, s, d + 1, c - cost + gas[s]);\\n }\\n })(to, c, 1, gas[c] - cost);\\n for (int d = (int)sub_downs[i].size() - 1; d >= 1; d--) { chmax(sub_downs[i][d - 1], sub_downs[i][d]); }\\n mfp([&](auto&& dfs, usize s, usize p, usize d, ll c) -> void {\\n if (sub_ups[i].size() <= d) { sub_ups[i].push_back(c); }\\n chmax(sub_ups[i][d], c);\\n for (const auto& e : g[s]) {\\n const usize to = e.to();\\n if (to == p or used[to]) { continue; }\\n const ll cost = e.cost();\\n dfs(dfs, to, s, d + 1, c - cost + gas[to]);\\n }\\n })(to, c, 1, -cost + gas[to]);\\n for (int d = (int)sub_ups[i].size() - 1; d >= 1; d--) { chmax(sub_ups[i][d - 1], sub_ups[i][d]); }\\n }\\n SHOW(c, sub_downs, sub_ups);\\n usize dmax = 0;\\n for (usize i = 0; i < cn; i++) { chmax(dmax, sub_downs[i].size()); }\\n SHOW(dmax);\\n std::vector<std::multiset<ll, std::greater<ll>>> sd(dmax);\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 0; d < sub_downs[i].size(); d++) {\\n if (sub_downs[i][d] >= 0) { chmax(ans, d + 1); }\\n }\\n for (usize d = 0; d < sub_ups[i].size(); d++) {\\n if (sub_ups[i][d] >= 0) { chmax(ans, d + 1); }\\n }\\n }\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 0; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\\n }\\n for (usize i = 0; i < cn; i++) {\\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].erase(sd[d].find(sub_downs[i][d])); }\\n SHOW(i, sd);\\n for (usize d = 1; d < sub_downs[i].size(); d++) {\\n const ll up = sub_ups[i][d];\\n usize inf = 0, sup = dmax;\\n while (sup - inf > 1) {\\n const usize mid = (inf + sup) / 2;\\n const ll down = (sd[mid].empty() ? -inf_v<ll> : *sd[mid].begin());\\n (up + down >= 0 ? inf : sup) = mid;\\n }\\n SHOW(i, d, inf, sup);\\n if (inf > 0) { chmax(ans, d + inf + 1); }\\n }\\n for (usize d = 1; d < sub_downs[i].size(); d++) { sd[d].insert(sub_downs[i][d]); }\\n }\\n for (const usize nc : cg[c]) { dfs(dfs, nc); }\\n })(centor);\\n outln(ans);\\n return 0;\\n}\",\n \"accuracy\": 0.4050632911392405,\n \"time_ms\": 230,\n \"memory_kb\": 49876,\n \"score_of_the_acc\": -1.3867,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2790_3702483\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100050\\n\\nstruct Edge{\\n Edge(int arg_to,int arg_value,int arg_rev_value){\\n to = arg_to;\\n value = arg_value;\\n rev_value = arg_rev_value;\\n }\\n int to,value,rev_value;\\n};\\n\\nstruct Info{\\n\\n int node_id,max_rest_size;\\n};\\n\\n\\nint *subtree_size;\\nbool *centroid;\\nvector<Edge> G[NUM];\\n\\nvoid compute_subtree_size(int node_id,int parent){\\n\\n subtree_size[node_id] = 1;\\n\\n for(int i = 0; i < G[node_id].size(); i++){\\n\\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\\n\\n compute_subtree_size(G[node_id][i].to,node_id);\\n\\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\\n }\\n}\\n\\n\\nInfo search_centroid(int node_id,int parent,int total_size){\\n\\n Info ret,tmp;\\n ret.max_rest_size = BIG_NUM;\\n ret.node_id = -1;\\n\\n int sum = 1,maximum = 0;\\n int next_node;\\n\\n for(int i = 0; i < G[node_id].size(); i++){\\n\\n next_node = G[node_id][i].to;\\n if(centroid[next_node] == true || next_node == parent)continue;\\n\\n tmp = search_centroid(next_node,node_id,total_size);\\n\\n if(ret.max_rest_size > tmp.max_rest_size){\\n\\n ret.max_rest_size = tmp.max_rest_size;\\n ret.node_id = tmp.node_id;\\n }\\n\\n maximum = max(maximum,subtree_size[next_node]);\\n sum += subtree_size[next_node];\\n }\\n maximum = max(maximum,total_size-sum);\\n\\n if(ret.max_rest_size > maximum){\\n ret.max_rest_size = maximum;\\n ret.node_id = node_id;\\n }\\n\\n return ret;\\n}\\n\\n\\nint *DOWN;\\nint max_depth_DOWN;\\n\\nvoid calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\\n\\n\\tDOWN[depth] = max(DOWN[depth],minimum);\\n\\tmax_depth_DOWN = max(max_depth_DOWN,depth);\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tint next_sum = sum + G[node_id][i].value;\\n\\t\\tint next_minimum = min(minimum,next_sum);\\n\\n\\t\\tcalc_DOWN(next_node,node_id,depth+1,next_minimum,next_sum);\\n\\t}\\n}\\n\\n\\nint ans;\\n\\nvoid calc_UP(int node_id,int parent,int depth,int add,int sum,int maximum){\\n\\n\\tint next_sum = sum+add;\\n\\n\\tif(next_sum >= maximum){\\n\\n\\t\\tint L,R,mid;\\n\\n\\t\\tans = max(ans,depth+1);\\n\\n\\t\\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\\n\\n\\t\\twhile(L <= R){\\n\\n\\t\\t\\tif(next_sum+DOWN[mid] >= 0){\\n\\n\\t\\t\\t\\tans = max(ans,depth+mid+1);\\n\\t\\t\\t\\tL = mid+1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tR = mid-1;\\n\\t\\t\\t}\\n\\t\\t\\tmid = (L+R)/2;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(centroid[next_node] == true || next_node == parent)continue;\\n\\n\\t\\tcalc_UP(next_node,node_id,depth+1,G[node_id][i].rev_value,next_sum,max(maximum,next_sum));\\n\\t}\\n}\\n\\n\\nvoid solve_subproblem(int node_id){\\n\\n compute_subtree_size(node_id,-1);\\n int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\\n int size = subtree_size[node_id];\\n\\n centroid[center] = true;\\n\\n int next_node;\\n\\n for(int i = 0; i < G[center].size(); i++){\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node] == true)continue;\\n\\n solve_subproblem(next_node);\\n }\\n\\n centroid[center] = false;\\n\\n for(int loop = 0; loop < 2; loop++){\\n\\n DOWN[0] = 0;\\n for(int i = 1; i < size; i++){\\n\\n DOWN[i] = -BIG_NUM;\\n }\\n max_depth_DOWN = 0;\\n\\n for(int i = 0; i < G[center].size(); i++){\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node])continue;\\n\\n calc_UP(next_node,center,1,G[center][i].rev_value,0,0);\\n calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value);\\n }\\n reverse(G[center].begin(),G[center].end());\\n }\\n}\\n\\nint main(){\\n\\n\\tint V;\\n\\n scanf(\\\"%d\\\",&V);\\n\\n int gasoline[V+5];\\n\\tsubtree_size = new int[V+5];\\n\\tDOWN = new int[V+5];\\n\\tcentroid = new bool[V+5];\\n\\n for(int i = 0; i < V; i++){\\n\\n scanf(\\\"%d\\\",&gasoline[i]);\\n }\\n\\n int from,to,dist;\\n\\n for(int i = 0; i < V-1; i++){\\n\\n scanf(\\\"%d %d %d\\\",&from,&to,&dist);\\n from--;\\n to--;\\n\\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\\n }\\n\\n\\n for(int i = 0; i < V; i++){\\n\\n centroid[i] = false;\\n }\\n\\n ans = 0;\\n\\n solve_subproblem(0);\\n\\n printf(\\\"%d\\\\n\\\",max(1,ans));\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 20908,\n \"score_of_the_acc\": -0.5601,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2790_3702475\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100050\\n\\nstruct Edge{\\n Edge(int arg_to,int arg_value,int arg_rev_value){\\n to = arg_to;\\n value = arg_value;\\n rev_value = arg_rev_value;\\n }\\n int to,value,rev_value;\\n};\\n\\nstruct Info{\\n\\n int node_id,max_rest_size;\\n};\\n\\n\\nint *subtree_size;\\nbool *centroid; //その頂点が既に分割に用いられているか\\nvector<Edge> G[NUM];\\n\\nvoid compute_subtree_size(int node_id,int parent){\\n\\n subtree_size[node_id] = 1;\\n\\n for(int i = 0; i < G[node_id].size(); i++){\\n\\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\\n\\n compute_subtree_size(G[node_id][i].to,node_id);\\n\\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\\n }\\n}\\n\\n\\nInfo search_centroid(int node_id,int parent,int total_size){\\n\\n Info ret,tmp;\\n ret.max_rest_size = BIG_NUM;\\n ret.node_id = -1;\\n\\n int sum = 1,maximum = 0;\\n int next_node;\\n\\n for(int i = 0; i < G[node_id].size(); i++){ //子を走査\\n\\n next_node = G[node_id][i].to;\\n if(centroid[next_node] == true || next_node == parent)continue;\\n\\n tmp = search_centroid(next_node,node_id,total_size);\\n\\n if(ret.max_rest_size > tmp.max_rest_size){\\n\\n ret.max_rest_size = tmp.max_rest_size;\\n ret.node_id = tmp.node_id;\\n }\\n\\n maximum = max(maximum,subtree_size[next_node]);\\n sum += subtree_size[next_node];\\n }\\n maximum = max(maximum,total_size-sum);\\n\\n if(ret.max_rest_size > maximum){\\n ret.max_rest_size = maximum;\\n ret.node_id = node_id;\\n }\\n\\n return ret;\\n}\\n\\n\\nint *DOWN;\\nint max_depth_DOWN;\\n\\nvoid calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\\n\\n\\tDOWN[depth] = max(DOWN[depth],minimum);\\n\\tmax_depth_DOWN = max(max_depth_DOWN,depth);\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tint next_sum = sum + G[node_id][i].value;\\n\\t\\tint next_minimum = min(minimum,next_sum);\\n\\n\\t\\tcalc_DOWN(next_node,node_id,depth+1,next_minimum,next_sum);\\n\\t}\\n}\\n\\n\\nint ans;\\n\\n//node_id以下の出発点で、最後にparentに辿り着く際の、最大のガソリン残量(★途中で負になる場合に注意★)\\nvoid calc_UP(int node_id,int parent,int depth,int add,int sum,int maximum){\\n\\n\\tint next_sum = sum+add;\\n\\n\\tif(next_sum >= maximum){\\n\\n\\t\\tint L,R,mid;\\n\\n\\t\\tans = max(ans,depth+1); //上りのみの場合\\n\\n\\t\\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\\n\\n\\t\\twhile(L <= R){\\n\\n\\t\\t\\tif(next_sum+DOWN[mid] >= 0){\\n\\n\\t\\t\\t\\tans = max(ans,depth+mid+1);\\n\\t\\t\\t\\tL = mid+1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tR = mid-1;\\n\\t\\t\\t}\\n\\t\\t\\tmid = (L+R)/2;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(centroid[next_node] == true || next_node == parent)continue;\\n\\n\\t\\tcalc_UP(next_node,node_id,depth+1,G[node_id][i].rev_value,next_sum,max(maximum,next_sum));\\n\\t}\\n}\\n\\n\\nvoid solve_subproblem(int node_id){\\n\\n //重心となる頂点centerを探す\\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\\n int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\\n int size = subtree_size[node_id]; //★再帰している間に値が書き換わるので退避★\\n\\n //printf(\\\"node_id:%d center:%d size[node]:%d\\\\n\\\",node_id,center,subtree_size[node_id]);\\n\\n centroid[center] = true;\\n\\n int next_node;\\n\\n //子の部分木を先に処理する\\n for(int i = 0; i < G[center].size(); i++){\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node] == true)continue;\\n\\n solve_subproblem(next_node);\\n }\\n\\n centroid[center] = false;\\n\\n //printf(\\\"subtree_size[%d]:%d\\\\n\\\",node_id,subtree_size[node_id]);\\n\\n for(int loop = 0; loop < 2; loop++){\\n\\n DOWN[0] = 0;\\n for(int i = 1; i < size; i++){ //★サイズに注意★\\n\\n DOWN[i] = -BIG_NUM;\\n }\\n max_depth_DOWN = 0;\\n\\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node])continue;\\n\\n //右端の上りを計算\\n calc_UP(next_node,center,1,G[center][i].rev_value,0,0);\\n //右端の下りを計算\\n calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value);\\n }\\n reverse(G[center].begin(),G[center].end());\\n }\\n}\\n\\nint main(){\\n\\n\\tint V;\\n\\n scanf(\\\"%d\\\",&V);\\n\\n int gasoline[V+5];\\n\\tsubtree_size = new int[V+5];\\n\\tDOWN = new int[V+5];\\n\\tcentroid = new bool[V+5];\\n\\n for(int i = 0; i < V; i++){\\n\\n scanf(\\\"%d\\\",&gasoline[i]);\\n }\\n\\n int from,to,dist;\\n\\n for(int i = 0; i < V-1; i++){\\\\\\n\\n scanf(\\\"%d %d %d\\\",&from,&to,&dist);\\n from--;\\n to--;\\n\\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\\n }\\n\\n\\n for(int i = 0; i < V; i++){\\n\\n centroid[i] = false;\\n }\\n\\n ans = 0;\\n\\n solve_subproblem(0);\\n\\n printf(\\\"%d\\\\n\\\",max(1,ans));\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 20872,\n \"score_of_the_acc\": -0.5593,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2790_3701506\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100020\\n\\nstruct Edge{\\n Edge(int arg_to,int arg_value,int arg_rev_value){\\n to = arg_to;\\n value = arg_value;\\n rev_value = arg_rev_value;\\n }\\n int to,value,rev_value;\\n};\\n\\n\\nstatic int gasoline[NUM],subtree_size[NUM];\\nstatic bool centroid[NUM]; //その頂点が既に分割に用いられているか\\nstatic vector<Edge> G[NUM];\\n\\nstatic void compute_subtree_size(int node_id,int parent){\\n\\n subtree_size[node_id] = 1;\\n\\n for(int i = 0; i < G[node_id].size(); i++){\\n\\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\\n\\n compute_subtree_size(G[node_id][i].to,node_id);\\n\\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\\n }\\n}\\n\\nvector<int> CENTROID;\\n\\nstatic void search_centroid(int node_id,int parent,int total_size){\\n\\n\\tbool FLG = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\t\\tsearch_centroid(next_node,node_id,total_size);\\n\\n\\t\\tif(subtree_size[next_node] > total_size/2){\\n\\t\\t\\tFLG = false;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tif(total_size-subtree_size[node_id] > total_size/2)return;\\n\\tif(FLG)CENTROID.push_back(node_id);\\n}\\n\\n\\nstatic int max_depth_DOWN,max_depth_UP;\\nstatic int DOWN[NUM];\\n\\nstatic int V;\\nstatic int root,ans;\\n\\nstatic int calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\\n\\n\\tDOWN[depth] = max(DOWN[depth],minimum);\\n\\tmax_depth_DOWN = max(max_depth_DOWN,depth);\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tint next_sum = sum + G[node_id][i].value;\\n\\t\\tint next_minimum = min(minimum,next_sum);\\n\\n\\t\\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\\n\\t}\\n\\treturn DOWN[depth];\\n}\\n\\n\\nstatic void calc_UP(int node_id,int parent,int depth,int sum,int maximum){\\n\\n\\t//sum += add; //親方向へのコストを足す\\n\\t//int next_sum = sum+add;\\n\\tint next_sum = sum;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tif(G[node_id][i].to == parent){\\n\\t\\t\\tnext_sum += G[node_id][i].value;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\\n\\tif(next_sum >= maximum){\\n\\n\\t\\tmax_depth_UP = max(max_depth_UP,depth);\\n\\n\\t\\tint L,R,mid;\\n\\n\\t\\t //最大値を計算\\n\\t\\tans = max(ans,depth+1); //上りだけの場合\\n\\n\\t\\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\\n\\n\\t\\twhile(L <= R){\\n\\n\\t\\t\\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\\n\\n\\t\\t\\t\\tans = max(ans,depth+mid+1);\\n\\t\\t\\t\\tL = mid+1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tR = mid-1;\\n\\t\\t\\t}\\n\\t\\t\\tmid = (L+R)/2;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\\n\\t}\\n}\\n\\nstatic void solve_subproblem(int node_id){\\n\\n //重心となる頂点centerを探す\\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\\n CENTROID.clear();\\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\\n\\tsearch_centroid(node_id,-1,subtree_size[node_id]);\\n int center = CENTROID[0];\\n\\n centroid[center] = true;\\n\\n int next_node;\\n\\n //子の部分木を先に処理する\\n for(int i = 0; i < G[center].size(); i++){\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node] == true)continue;\\n\\n solve_subproblem(next_node);\\n }\\n\\n centroid[center] = false;\\n\\n for(int loop = 0; loop < 2; loop++){\\n\\n DOWN[0] = 0;\\n for(int i = 1; i <= subtree_size[node_id]+5; i++){ //★サイズに注意★\\n\\n DOWN[i] = -BIG_NUM;\\n }\\n max_depth_DOWN = 0;\\n\\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node])continue;\\n\\n calc_UP(next_node,center,1,0,0);\\n\\n //右端の下りを計算\\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\\n }\\n\\n reverse(G[center].begin(),G[center].end());\\n }\\n\\n}\\n\\nint main(){\\n\\n scanf(\\\"%d\\\",&V);\\n\\n for(int i = 0; i < V; i++){\\n\\n scanf(\\\"%d\\\",&gasoline[i]);\\n }\\n\\n int from,to,dist;\\n\\n for(int i = 0; i < V-1; i++){\\n\\n scanf(\\\"%d %d %d\\\",&from,&to,&dist);\\n from--;\\n to--;\\n\\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\\n }\\n\\n\\n root = 0;\\n\\n for(int i = 0; i < V; i++){\\n\\n centroid[i] = false;\\n }\\n\\n ans = 0;\\n\\n solve_subproblem(root);\\n\\n printf(\\\"%d\\\\n\\\",max(1,ans));\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4430379746835443,\n \"time_ms\": 70,\n \"memory_kb\": 13984,\n \"score_of_the_acc\": -0.2873,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2790_3701501\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100020\\n\\nstruct Edge{\\n Edge(int arg_to,int arg_value,int arg_rev_value){\\n to = arg_to;\\n value = arg_value;\\n rev_value = arg_rev_value;\\n }\\n int to,value,rev_value;\\n};\\n\\n\\nstatic int gasoline[NUM],subtree_size[NUM];\\nstatic bool centroid[NUM]; //その頂点が既に分割に用いられているか\\nstatic vector<Edge> G[NUM];\\n\\nvoid compute_subtree_size(int node_id,int parent){\\n\\n subtree_size[node_id] = 1;\\n\\n for(int i = 0; i < G[node_id].size(); i++){\\n\\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\\n\\n compute_subtree_size(G[node_id][i].to,node_id);\\n\\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\\n }\\n}\\n\\nvector<int> CENTROID;\\n\\nvoid search_centroid(int node_id,int parent,int total_size){\\n\\n\\tbool FLG = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\t\\tsearch_centroid(next_node,node_id,total_size);\\n\\n\\t\\tif(subtree_size[next_node] > total_size/2){\\n\\t\\t\\tFLG = false;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tif(total_size-subtree_size[node_id] > total_size/2)return;\\n\\tif(FLG)CENTROID.push_back(node_id);\\n}\\n\\n\\nstatic int max_depth_DOWN,max_depth_UP;\\nstatic int DOWN[NUM];\\n\\nstatic int V;\\nstatic int root,ans;\\n\\nint calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\\n\\n\\tDOWN[depth] = max(DOWN[depth],minimum);\\n\\tmax_depth_DOWN = max(max_depth_DOWN,depth);\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tint next_sum = sum + G[node_id][i].value;\\n\\t\\tint next_minimum = min(minimum,next_sum);\\n\\n\\t\\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\\n\\t}\\n\\treturn DOWN[depth];\\n}\\n\\n\\nvoid calc_UP(int node_id,int parent,int depth,int sum,int maximum){\\n\\n\\t//sum += add; //親方向へのコストを足す\\n\\t//int next_sum = sum+add;\\n\\tint next_sum = sum;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tif(G[node_id][i].to == parent){\\n\\t\\t\\tnext_sum += G[node_id][i].value;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\\n\\tif(next_sum >= maximum){\\n\\n\\t\\tmax_depth_UP = max(max_depth_UP,depth);\\n\\n\\t\\tint L,R,mid;\\n\\n\\t\\t //最大値を計算\\n\\t\\tans = max(ans,depth+1); //上りだけの場合\\n\\n\\t\\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\\n\\n\\t\\twhile(L <= R){\\n\\n\\t\\t\\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\\n\\n\\t\\t\\t\\tans = max(ans,depth+mid+1);\\n\\t\\t\\t\\tL = mid+1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tR = mid-1;\\n\\t\\t\\t}\\n\\t\\t\\tmid = (L+R)/2;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\\n\\t}\\n}\\n\\nvoid solve_subproblem(int node_id){\\n\\n //重心となる頂点centerを探す\\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\\n CENTROID.clear();\\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\\n\\tsearch_centroid(node_id,-1,subtree_size[node_id]);\\n int center = CENTROID[0];\\n\\n centroid[center] = true;\\n\\n int next_node;\\n\\n //子の部分木を先に処理する\\n for(int i = 0; i < G[center].size(); i++){\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node] == true)continue;\\n\\n solve_subproblem(next_node);\\n }\\n\\n centroid[center] = false;\\n\\n for(int loop = 0; loop < 2; loop++){\\n\\n DOWN[0] = 0;\\n for(int i = 1; i <= subtree_size[node_id]+5; i++){ //★サイズに注意★\\n\\n DOWN[i] = -BIG_NUM;\\n }\\n max_depth_DOWN = 0;\\n\\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node])continue;\\n\\n calc_UP(next_node,center,1,0,0);\\n\\n //右端の下りを計算\\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\\n }\\n\\n reverse(G[center].begin(),G[center].end());\\n }\\n\\n}\\n\\nint main(){\\n\\n scanf(\\\"%d\\\",&V);\\n\\n for(int i = 0; i < V; i++){\\n\\n scanf(\\\"%d\\\",&gasoline[i]);\\n }\\n\\n int from,to,dist;\\n\\n for(int i = 0; i < V-1; i++){\\n\\n scanf(\\\"%d %d %d\\\",&from,&to,&dist);\\n from--;\\n to--;\\n\\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\\n }\\n\\n\\n root = 0;\\n\\n for(int i = 0; i < V; i++){\\n\\n centroid[i] = false;\\n }\\n\\n ans = 0;\\n\\n solve_subproblem(root);\\n\\n printf(\\\"%d\\\\n\\\",max(1,ans));\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4430379746835443,\n \"time_ms\": 70,\n \"memory_kb\": 13992,\n \"score_of_the_acc\": -0.2875,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2790_3701500\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100020\\n\\nstruct Edge{\\n Edge(int arg_to,int arg_value,int arg_rev_value){\\n to = arg_to;\\n value = arg_value;\\n rev_value = arg_rev_value;\\n }\\n int to,value,rev_value;\\n};\\n\\n\\nint gasoline[NUM],subtree_size[NUM];\\nbool centroid[NUM]; //その頂点が既に分割に用いられているか\\nvector<Edge> G[NUM];\\n\\nvoid compute_subtree_size(int node_id,int parent){\\n\\n subtree_size[node_id] = 1;\\n\\n for(int i = 0; i < G[node_id].size(); i++){\\n\\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\\n\\n compute_subtree_size(G[node_id][i].to,node_id);\\n\\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\\n }\\n}\\n\\nvector<int> CENTROID;\\n\\nvoid search_centroid(int node_id,int parent,int total_size){\\n\\n\\tbool FLG = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\t\\tsearch_centroid(next_node,node_id,total_size);\\n\\n\\t\\tif(subtree_size[next_node] > total_size/2){\\n\\t\\t\\tFLG = false;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tif(total_size-subtree_size[node_id] > total_size/2)return;\\n\\tif(FLG)CENTROID.push_back(node_id);\\n}\\n\\n\\nint max_depth_DOWN,max_depth_UP;\\nint DOWN[NUM];\\n\\nint V;\\nint root,ans;\\n\\nint calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\\n\\n\\tDOWN[depth] = max(DOWN[depth],minimum);\\n\\tmax_depth_DOWN = max(max_depth_DOWN,depth);\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tint next_sum = sum + G[node_id][i].value;\\n\\t\\tint next_minimum = min(minimum,next_sum);\\n\\n\\t\\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\\n\\t}\\n\\treturn DOWN[depth];\\n}\\n\\n\\nvoid calc_UP(int node_id,int parent,int depth,int sum,int maximum){\\n\\n\\t//sum += add; //親方向へのコストを足す\\n\\t//int next_sum = sum+add;\\n\\tint next_sum = sum;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tif(G[node_id][i].to == parent){\\n\\t\\t\\tnext_sum += G[node_id][i].value;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\\n\\tif(next_sum >= maximum){\\n\\n\\t\\tmax_depth_UP = max(max_depth_UP,depth);\\n\\n\\t\\tint L,R,mid;\\n\\n\\t\\t //最大値を計算\\n\\t\\tans = max(ans,depth+1); //上りだけの場合\\n\\n\\t\\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\\n\\n\\t\\twhile(L <= R){\\n\\n\\t\\t\\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\\n\\n\\t\\t\\t\\tans = max(ans,depth+mid+1);\\n\\t\\t\\t\\tL = mid+1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tR = mid-1;\\n\\t\\t\\t}\\n\\t\\t\\tmid = (L+R)/2;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\\n\\t}\\n}\\n\\nvoid solve_subproblem(int node_id){\\n\\n //重心となる頂点centerを探す\\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\\n CENTROID.clear();\\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\\n\\tsearch_centroid(node_id,-1,subtree_size[node_id]);\\n int center = CENTROID[0];\\n\\n centroid[center] = true;\\n\\n int next_node;\\n\\n //子の部分木を先に処理する\\n for(int i = 0; i < G[center].size(); i++){\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node] == true)continue;\\n\\n solve_subproblem(next_node);\\n }\\n\\n centroid[center] = false;\\n\\n for(int loop = 0; loop < 2; loop++){\\n\\n DOWN[0] = 0;\\n for(int i = 1; i <= subtree_size[node_id]+5; i++){ //★サイズに注意★\\n\\n DOWN[i] = -BIG_NUM;\\n }\\n max_depth_DOWN = 0;\\n\\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node])continue;\\n\\n calc_UP(next_node,center,1,0,0);\\n\\n //右端の下りを計算\\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\\n }\\n\\n reverse(G[center].begin(),G[center].end());\\n }\\n\\n}\\n\\nint main(){\\n\\n scanf(\\\"%d\\\",&V);\\n\\n for(int i = 0; i < V; i++){\\n\\n scanf(\\\"%d\\\",&gasoline[i]);\\n }\\n\\n int from,to,dist;\\n\\n for(int i = 0; i < V-1; i++){\\n\\n scanf(\\\"%d %d %d\\\",&from,&to,&dist);\\n from--;\\n to--;\\n\\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\\n }\\n\\n\\n root = 0;\\n\\n for(int i = 0; i < V; i++){\\n\\n centroid[i] = false;\\n }\\n\\n ans = 0;\\n\\n solve_subproblem(root);\\n\\n printf(\\\"%d\\\\n\\\",max(1,ans));\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4430379746835443,\n \"time_ms\": 70,\n \"memory_kb\": 14028,\n \"score_of_the_acc\": -0.2882,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2790_3701461\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100020\\n\\nstruct Edge{\\n Edge(int arg_to,int arg_value,int arg_rev_value){\\n to = arg_to;\\n value = arg_value;\\n rev_value = arg_rev_value;\\n }\\n int to,value,rev_value;\\n};\\n\\nint subtree_size[NUM];\\nbool centroid[NUM]; //その頂点が既に分割に用いられているか\\nvector<Edge> G[NUM];\\n\\nvoid compute_subtree_size(int node_id,int parent){\\n\\n subtree_size[node_id] = 1;\\n\\n for(int i = 0; i < G[node_id].size(); i++){\\n\\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\\n\\n compute_subtree_size(G[node_id][i].to,node_id);\\n\\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\\n }\\n}\\n\\n\\nvector<int> CENTROID;\\nvoid search_centroid(int node_id,int parent,int total_size){\\n\\n\\tbool FLG = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\t\\tsearch_centroid(next_node,node_id,total_size);\\n\\n\\t\\tif(subtree_size[next_node] > total_size/2){\\n\\t\\t\\tFLG = false;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tif(total_size-subtree_size[node_id] > total_size/2)return;\\n\\tif(FLG)CENTROID.push_back(node_id);\\n}\\n\\nint ans = 0;\\nint gasoline[NUM];\\n\\n\\nint DOWN[NUM];\\nint max_depth_DOWN,max_depth_UP;\\n\\n\\nint calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\\n\\n\\tDOWN[depth] = max(DOWN[depth],minimum);\\n\\tmax_depth_DOWN = max(max_depth_DOWN,depth);\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tint next_sum = sum + G[node_id][i].value;\\n\\t\\tint next_minimum = min(minimum,next_sum);\\n\\n\\t\\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\\n\\t}\\n\\treturn DOWN[depth];\\n}\\n\\n\\nvoid calc_UP(int node_id,int parent,int depth,int sum,int maximum){\\n\\n\\t//sum += add; //親方向へのコストを足す\\n\\t//int next_sum = sum+add;\\n\\tint next_sum = sum;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tif(G[node_id][i].to == parent){\\n\\t\\t\\tnext_sum += G[node_id][i].value;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\\n\\tif(next_sum >= maximum){\\n\\n\\t\\tmax_depth_UP = max(max_depth_UP,depth);\\n\\n\\t\\tint L,R,mid;\\n\\n\\t\\t //最大値を計算\\n\\t\\tans = max(ans,depth+1); //上りだけの場合\\n\\n\\t\\tL = 1,R = max_depth_DOWN,mid = (L+R)/2;\\n\\n\\t\\twhile(L <= R){\\n\\n\\t\\t\\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\\n\\n\\t\\t\\t\\tans = max(ans,depth+mid+1);\\n\\t\\t\\t\\tL = mid+1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tR = mid-1;\\n\\t\\t\\t}\\n\\t\\t\\tmid = (L+R)/2;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\\n\\t}\\n}\\n\\nvoid solve_subproblem(int node_id){\\n\\n //重心となる頂点centerを探す\\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\\n CENTROID.clear();\\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\\n\\tsearch_centroid(node_id,-1,subtree_size[node_id]);\\n int center = CENTROID[0];\\n\\n centroid[center] = true;\\n\\n int next_node;\\n\\n //子の部分木を先に処理する\\n for(int i = 0; i < G[center].size(); i++){\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node] == true)continue;\\n\\n solve_subproblem(next_node);\\n }\\n\\n centroid[center] = false;\\n\\n for(int loop = 0; loop < 2; loop++){\\n\\n DOWN[0] = 0;\\n for(int i = 1; i <= subtree_size[node_id]+5; i++){ //★サイズに注意★\\n\\n DOWN[i] = -BIG_NUM;\\n }\\n max_depth_DOWN = 0;\\n\\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node])continue;\\n\\n calc_UP(next_node,center,1,0,0);\\n\\n //右端の下りを計算\\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\\n }\\n\\n reverse(G[center].begin(),G[center].end());\\n }\\n\\n}\\n\\nint main(){\\n\\n\\tint N;\\n\\n scanf(\\\"%d\\\",&N);\\n\\n for(int i = 0; i < N; i++){\\n\\n scanf(\\\"%d\\\",&gasoline[i]);\\n }\\n\\n int from,to,dist;\\n\\n for(int i = 0; i < N-1; i++){\\n\\n scanf(\\\"%d %d %d\\\",&from,&to,&dist);\\n from--;\\n to--;\\n\\n G[from].push_back(Edge(to,gasoline[from]-dist,gasoline[to]-dist));\\n G[to].push_back(Edge(from,gasoline[to]-dist,gasoline[from]-dist));\\n }\\n\\n\\n solve_subproblem(0);\\n\\n printf(\\\"%d\\\\n\\\",max(1,ans));\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4430379746835443,\n \"time_ms\": 70,\n \"memory_kb\": 14056,\n \"score_of_the_acc\": -0.2888,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2790_3701448\",\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 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100020\\n\\nstruct Edge{\\n Edge(int arg_to,int arg_value){\\n to = arg_to;\\n value = arg_value;\\n }\\n int to,value;\\n};\\n\\nint subtree_size[NUM];\\nbool centroid[NUM]; //その頂点が既に分割に用いられているか\\nvector<Edge> G[NUM];\\nvector<int> CENTROID;\\n\\nvoid compute_subtree_size(int node_id,int parent){\\n\\n subtree_size[node_id] = 1;\\n\\n for(int i = 0; i < G[node_id].size(); i++){\\n\\n if(centroid[G[node_id][i].to] == true || G[node_id][i].to == parent)continue;\\n\\n compute_subtree_size(G[node_id][i].to,node_id);\\n\\n subtree_size[node_id] += subtree_size[G[node_id][i].to];\\n }\\n}\\n\\n\\nvoid search_centroid(int node_id,int parent,int total_size){\\n\\n\\tbool FLG = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\t\\tsearch_centroid(next_node,node_id,total_size);\\n\\n\\t\\tif(subtree_size[next_node] > total_size/2){\\n\\t\\t\\tFLG = false;\\n\\t\\t}\\n\\t}\\n\\tif(total_size-subtree_size[node_id] > total_size/2)FLG = false;\\n\\tif(FLG)CENTROID.push_back(node_id);\\n}\\n\\n\\nvector<int> DOWN;\\nint ans = 0;\\n\\nint calc_DOWN(int node_id,int parent,int depth,int minimum,int sum){\\n\\n\\tDOWN[depth] = max(DOWN[depth],minimum);\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tint next_sum = sum + G[node_id][i].value;\\n\\t\\tint next_minimum = min(minimum,next_sum);\\n\\n\\t\\tDOWN[depth] = max(DOWN[depth],calc_DOWN(next_node,node_id,depth+1,next_sum,next_minimum));\\n\\t}\\n\\treturn DOWN[depth];\\n}\\n\\n\\nvoid calc_UP(int node_id,int parent,int depth,int sum,int maximum){\\n\\n\\t//sum += add; //親方向へのコストを足す\\n\\t//int next_sum = sum+add;\\n\\tint next_sum = sum;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tif(G[node_id][i].to == parent){\\n\\t\\t\\tnext_sum += G[node_id][i].value;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t//総和の最大値を更新した場合[★これで途中で負になる区間があるかわかる。総和が減るなら、逆方向から歩けば負になる区間があるはず★]\\n\\tif(next_sum >= maximum){\\n\\n\\t\\tint L,R;\\n\\n\\t\\t //最大値を計算\\n\\t\\tans = max(ans,depth); //上りだけの場合\\n\\n\\t\\tL = 0,R = DOWN.size();\\n\\n\\t\\twhile(L+1 < R){\\n\\t\\t\\tint mid = (L+R)/2;\\n\\t\\t\\tif(next_sum+DOWN[mid] >= 0){ //ガソリンを空にせずにk+midだけ走れる\\n\\n\\t\\t\\t\\tL = mid;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tR = mid;\\n\\t\\t\\t};\\n\\t\\t}\\n\\t\\tans = max(ans,L+depth);\\n\\t}\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next_node = G[node_id][i].to;\\n\\n\\t\\tif(next_node == parent || centroid[next_node] == true)continue;\\n\\n\\t\\tcalc_UP(next_node,node_id,depth+1,next_sum,max(maximum,next_sum));\\n\\t}\\n}\\n\\nvoid solve_subproblem(int node_id){\\n\\n //重心となる頂点centerを探す\\n compute_subtree_size(node_id,-1); //部分木のサイズを計算するとともに、最大の深さを計算する\\n CENTROID.clear();\\n //int center = search_centroid(node_id,-1,subtree_size[node_id]).node_id;\\n\\tsearch_centroid(node_id,-1,subtree_size[node_id]);\\n int center = CENTROID[0];\\n int size = subtree_size[node_id];\\n\\n centroid[center] = true;\\n\\n int next_node;\\n\\n //子の部分木を先に処理する\\n for(int i = 0; i < G[center].size(); i++){\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node] == true)continue;\\n\\n solve_subproblem(next_node);\\n }\\n\\n centroid[center] = false;\\n\\n for(int loop = 0; loop < 2; loop++){\\n\\n \\t DOWN.resize(size);\\n\\n \\t for(int i = 0; i < size; i++){\\n \\t\\t DOWN[i] = -(INT_MAX/3);\\n \\t }\\n\\n for(int i = 0; i < G[center].size(); i++){ //右端を上りとして固定し、最長のパスを求める\\n\\n next_node = G[center][i].to;\\n\\n if(centroid[next_node] == true)continue;\\n\\n calc_UP(next_node,center,1,0,0);\\n\\n //右端の下りを計算\\n DOWN[0] = max(DOWN[0],calc_DOWN(next_node,center,1,G[center][i].value,G[center][i].value));\\n }\\n\\n reverse(G[center].begin(),G[center].end());\\n }\\n\\n}\\n\\n//WAになる原因が分らなかったので、DAyamaさんのコードを参考にさせてもらいました(ほぼ完全な写経)\\n\\nint main(){\\n\\n\\tint N;\\n\\n scanf(\\\"%d\\\",&N);\\n\\n int gasoline[NUM];\\n\\n for(int i = 0; i < N; i++){\\n\\n scanf(\\\"%d\\\",&gasoline[i]);\\n }\\n\\n int from,to,dist;\\n\\n for(int i = 0; i < N-1; i++){\\n\\n scanf(\\\"%d %d %d\\\",&from,&to,&dist);\\n from--;\\n to--;\\n\\n G[from].push_back(Edge(to,gasoline[from]-dist));\\n G[to].push_back(Edge(from,gasoline[to]-dist));\\n }\\n\\n solve_subproblem(0);\\n\\n printf(\\\"%d\\\\n\\\",ans+1);\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4050632911392405,\n \"time_ms\": 70,\n \"memory_kb\": 14172,\n \"score_of_the_acc\": -0.2913,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1684,"cells":{"group_id":{"kind":"string","value":"aoj_2800_cpp"},"problem_description":{"kind":"string","value":"C : Mod!Mod!\n物語\nじゃん！探してますよ目撃証言！\n会津に怪盗が現れた！みんなのウマウマ棒が盗まれた！犯人は誰だ！？\n解きあかせ！Mod!Mod!\n問題文\n\"アイズ\"...それは選ばれし者の心に膨らむ奇跡のつぼみ...。特殊能力\"アイズ\"を使えばどんなものだって盗むことができる。\n会津一の大怪盗、あいずまるは世界を謎で満たすために\nn\n人の探偵から「ウマウマ棒」を盗むことにした。ウマウマ棒とはあいずまるが大好きなただのお菓子であり、\nn\n人の探偵はそれぞれ数本のウマウマ棒を持っている。また、あいずまるは強欲なためそれぞれの探偵からウマウマ棒を盗むとき、その探偵が所持する全てのウマウマ棒を盗む。\nウマウマ棒の3本同時食いにハマっているあいずまるは、3本以上のウマウマ棒が手元にあるとき、誘惑に負けて手持ちのウマウマ棒が3本未満になるまで、3本ずつウマウマ棒を食べてしまう。しかし、あいずまるは手元にウマウマ棒がないとショックでアイズを失ってしまい、それ以上ウマウマ棒を盗むことができなくなってしまう。つまり、ウマウマ棒を盗むためには手持ちのウマウマ棒の本数を1本以上にしておく必要があり、0本になるとそれ以上ウマウマ棒を盗むことができなくなる。\n少しでも多くの探偵からウマウマ棒を盗みたいあいずまるは、どの探偵から順にウマウマ棒を盗むかによって何人の探偵からウマウマ棒を盗めるのかが変わることに気づいた。しかし、あいずまるには難しいことは分からない。「ハテー？」あいずまるの優秀な部下であるあなたは、あいずまるの代わりに最大で何人の探偵からウマウマ棒を盗むことができるのかを求めるプログラムを書いてあげることにした。\n探偵の人数\nn\nと、\nn\n人の探偵からそれぞれ何本のウマウマ棒を盗むのかが与えられるので、最適な順番で探偵からウマウマ棒を盗んだとき、最大で何人の探偵からウマウマ棒を盗むことができるかを出力するプログラムを作成せよ。ただし、はじめの手持ちのウマウマ棒の本数は0であるが、最初に限り手持ちが0本でもウマウマ棒を盗むことができるとする。\n入力形式\n入力は2行からなり、以下の形式で与えられる。\nn\na_1\na_2\n…\na_n\n1行目には、ウマウマ棒を盗む探偵の数である整数\nn\nが与えられる。\n2行目には、各探偵から盗むウマウマ棒の本数\nn\n個が空白区切りで与えられる。\n制約\n1 ≤ n ≤ 500{,}000\n1 ≤ a_i ≤ 9\n(\n1 ≤ i ≤ n\n)\n出力形式\n最適な順番で探偵からウマウマ棒を盗んだとき、最大で何人の探偵からウマウマ棒を盗むことができるか一行に出力せよ。\n入力例1\n6\n2 5 2 5 2 1\n出力例1\n5\n2 5 1 2 5の順で盗むと5人から盗むことができる。どのような順序で盗んでも6人から盗むことはできない。\n入力例2\n3\n3 6 9\n出力例2\n1\nどの1人から盗んでも手持ちのウマウマ棒の本数は0になってしまい、アイズを失ってしまう。\n入力例3\n6\n1 2 3 4 5 6\n出力例3\n6"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2800_8322213","code_snippet":"#include <iostream>\nusing namespace std;\n\nlong long N;\nlong long A[1 << 19];\nlong long C[3];\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\tfor (int i = 1; i <= N; i++) C[A[i] % 3] += 1;\n\n\t// Step 2. First Case\n\tif (C[1] + C[2] == 0) {\n\t\tcout << min(1LL, C[0]) << endl;\n\t\treturn 0;\n\t}\n\t\n\t// Step 3. Second Case\n\tC[1] = min(C[1], C[2] + 3);\n\tC[2] = min(C[2], C[1] + 3);\n\tcout << C[0] + C[1] + C[2] << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":7512,"score_of_the_acc":-1.0526,"final_rank":15},{"submission_id":"aoj_2800_8322212","code_snippet":"#include <iostream>\nusing namespace std;\n\nlong long N;\nlong long A[1 << 18];\nlong long C[3];\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\tfor (int i = 1; i <= N; i++) C[A[i] % 3] += 1;\n\n\t// Step 2. First Case\n\tif (C[1] + C[2] == 0) {\n\t\tcout << min(1LL, C[0]) << endl;\n\t\treturn 0;\n\t}\n\t\n\t// Step 3. Second Case\n\tC[1] = min(C[1], C[2] + 3);\n\tC[2] = min(C[2], C[1] + 3);\n\tcout << C[0] + C[1] + C[2] << endl;\n\treturn 0;\n}","accuracy":0.11392405063291139,"time_ms":20,"memory_kb":5392,"score_of_the_acc":-0.4349,"final_rank":20},{"submission_id":"aoj_2800_6964395","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nll v[3];\nint main(void){\n ll n,ans=0;\n cin>>n;\n vector<ll> a(n);\n for(ll i=0;i<n;i++){\n cin>>a[i];\n v[a[i]%3]++;\n }\n ll MIN=min(v[1],v[2]),MAX=max(v[1],v[2]);\n ans=MIN+min(MAX,MIN+3);\n ans+=v[0];\n if(v[1]==0 && v[2]==0){\n cout<<1<<endl;\n }else{\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":7044,"score_of_the_acc":-0.8045,"final_rank":12},{"submission_id":"aoj_2800_6963981","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=2167167167167167167;\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\";}\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\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;\n\tcin>>N;\n\tvector<int> p(3);\n\trep(i,N){\n\t\tint a;\n\t\tcin>>a;\n\t\tp[a%3]++;\n\t}\n\tif(p[0]==N) cout<<\"1\\n\";\n\telse{\n\t\tif(p[1]<p[2]) swap(p[1],p[2]);\n\t\tint ans=p[0]+1;\n\t\tp[1]--;\n\t\tint x=0;\n\t\twhile(true){\n\t\t\tif(p[x+1]==0) break;\n\t\t\tp[x+1]--;\n\t\t\tans++;\n\t\t\tx^=1;\n\t\t}\n\t\tif(ans!=N) ans++;\n\t\tcout<<ans<<\"\\n\";\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3440,"score_of_the_acc":-0.0345,"final_rank":2},{"submission_id":"aoj_2800_6713598","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n\n#define all(x) (x).begin(),(x).end()\n#define print(x) cout << (x) << '\\n'\ntypedef long long ll;\ntypedef long double ld;\nusing P = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing Graph = vector<vector<int>>;\n\n//using mint = atcoder :: modint998244353;\n//const ll MOD = 1000000007;\n//const ll MOD = 998244353;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {return a < b ? a = b, true : false;}\ntemplate <typename T> inline bool chmin(T &a, T b) {return a > b ? a = b, true : false;}\n\ntemplate <typename T>\nvoid vin(vector<T> &v) {\n int l = v.size();\n for(int i = 0; i < l; i++) cin >> v[i];\n}\n\ntemplate <typename T>\nvoid vout(vector<T> &v) {\n int l = v.size();\n for(int i = 0; i < l; i++) cout << v[i] << \" \\n\"[i == l - 1];\n}\n\nint main() {\n cin.tie(0); cout.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(18);\n\n int n; cin >> n;\n vector<int> c(3, 0);\n for(int i = 0; i < n; i++) {\n int a; cin >> a;\n c[a % 3]++;\n }\n if(c[1] + c[2] == 0) {\n print(1);\n } else {\n int ans = 0;\n for(int t = 1; t <= 2; t++) {\n int cnt = c[0];\n vector<int> d = {c[1], c[2]};\n int now = -1;\n if(d[t - 1] > 0) {\n d[t - 1]--;\n now = t;\n cnt++;\n }\n for(int i = 0; i < n - c[0]; i++) {\n if(now == 1) {\n if(d[0] == 0) break;\n else {\n d[0]--;\n now = 2;\n cnt++;\n }\n } else if(now == 2) {\n if(d[1] == 0) break;\n else {\n d[1]--;\n now = 1;\n cnt++;\n }\n }\n }\n if(d[0] + d[1] > 0) cnt++;\n chmax(ans, cnt);\n }\n print(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3440,"score_of_the_acc":-0.0345,"final_rank":2},{"submission_id":"aoj_2800_6007927","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< 998244353 >;\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 cnt[3];\nint dfs(int v) {\n int res = 0;\n if(v == 1) {\n if(cnt[1]) {\n cnt[1]--;\n res = max(res, dfs(2) + 1);\n cnt[1]++;\n }\n if(cnt[2]) res = max(res,1);\n \n }else if(v == 2) {\n if(cnt[2]) {\n cnt[2]--;\n res = max(res, dfs(1) + 1);\n cnt[2]++;\n }\n if(cnt[1]) res = max(res, 1);\n }\n return res;\n}\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n int n; cin >> n;\n vector<int> a(n);\n \n REP(i,n) {\n cin >> a[i];\n cnt[a[i]%3]++;\n }\n int ans = cnt[0];\n int f1=0, f2=0;\n if(cnt[1]) {\n cnt[1]--;\n f1 = dfs(1) + 1;\n cnt[1]++;\n }\n if(cnt[2]) {\n cnt[2]--;\n f2 = dfs(2) + 1;\n cnt[2]++;\n }\n if(cnt[1]==0&&cnt[2]==0)ans=1;\n cout << ans + max(f1, f2) << endl; \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":12844,"score_of_the_acc":-1.2,"final_rank":17},{"submission_id":"aoj_2800_5301582","code_snippet":"#include<bits/stdc++.h>\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 namespace std;\nusing ll = long long;\nll mod = 1e9+7;\nconst int dx[8] = {-1,0,1,0,-1,-1,1,1};\nconst int dy[8] = {0,1,0,-1,1,-1,1,-1};\n\nint main(){\n int n;\n cin >> n;\n vector<int> cnt(3,0);\n for(int i=0;i<n;++i) {\n int a;\n cin >> a;\n cnt[a%3]++;\n }\n\n int ans1=0, ans2=0;\n vector<int> c1(n), c2(n);\n copy(cnt.begin(), cnt.end(), c1.begin());\n copy(cnt.begin(), cnt.end(), c2.begin());\n if (cnt[1]) {\n ans1 = c1[0]+1;\n c1[1]--;\n while(true){\n if (c1[1]==0) break;\n ans1++;\n c1[1]--;\n if (c1[2]==0) break;\n ans1++;\n c1[2]--;\n }\n ans1 += min(1, c1[1]+c1[2]);\n }\n if (cnt[2]) {\n ans2=c2[0]+1;\n c2[2]--;\n while(true){\n if(c2[2]==0) break;\n c2[2]--;\n ans2++;\n if(c2[1]==0) break;\n c2[1]--;\n ans2++;\n }\n ans2 += min(1, c2[1]+c2[2]);\n }\n int ans = 1;\n ans = max(ans, ans1);\n ans = max(ans, ans2);\n cout << ans << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":6788,"score_of_the_acc":-1.1782,"final_rank":16},{"submission_id":"aoj_2800_4759217","code_snippet":"#include <iostream>\nusing namespace std;\nint b[3];\nint c[3];\nint main() {\n\t// your code goes here\n\tint n,t;\n\tcin>>n;\n\tfor(int i=0;i<3;i++){\n\t\tb[i]=0;\n\t\tc[i]=0;\n\t}\n\tint ans=1;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>t;\n\t\tb[t%3]++;\n\t\tc[t%3]++;\n\t}\n\tint c1=0;\n\tif(b[1]>0){\n\t\tb[1]--;\n\t\tc1+=1;\n\t\tc1+=b[0];\n\t\tb[0]=0;\n\t\tint i=1;\n\t\twhile(b[i]>=0){\n\t\t\tif(i==1){\n\t\t\t\tif(ans<c1+1 && b[2]>0)ans=c1+1;\n\t\t\t}else{\n\t\t\t\tif(ans<c1+1 && b[1]>0)ans=c1+1;\n\t\t\t}\n\t\t\tif(b[i]==0)break;\n\t\t\tb[i]--;\n\t\t\tc1++;\n\t\t\tif(i==1){\n\t\t\t\ti=2;\n\t\t\t}else{\n\t\t\t\ti=1;\n\t\t\t}\n\t\t}\n\t}\n\tif(ans<c1)ans=c1;\n\t\n\tc1=0;\n\tif (c[2]>0){\n\t\tc[2]--;\n\t\tc1+=1;\n\t\tc1+=c[0];\n\t\tc[0]=0;\n\t\tint i=2;\n\t\twhile(c[i]>=0){\n\t\t\tif(i==1){\n\t\t\t\tif(ans<c1+1 && c[2]>0)ans=c1+1;\n\t\t\t}else{\n\t\t\t\tif(ans<c1+1 && c[1]>0)ans=c1+1;\n\t\t\t}\n\t\t\tif(c[i]==0)break;\n\t\t\tc[i]--;\n\t\t\tc1++;\n\t\t\tif(i==1){\n\t\t\t\ti=2;\n\t\t\t}else{\n\t\t\t\ti=1;\n\t\t\t}\n\t\t}\n\t\n\t}\n\tif(ans<c1)ans=c1;\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3132,"score_of_the_acc":-0.8029,"final_rank":11},{"submission_id":"aoj_2800_4526530","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;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000007LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\n/* do your best */\n\nint main() {\n \n int n; cin >> n;\n vector<int> a(n);\n vector<int> cnt(3, 0);\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n cnt[a[i] % 3]++;\n }\n\n if (cnt[0] == n) {\n cout << 1 << endl;\n return 0;\n }\n \n lint ans = cnt[0];\n if (cnt[1] > cnt[2]) {\n swap(cnt[1], cnt[2]);\n }\n \n ans += cnt[1] + min(cnt[1] + 3, cnt[2]);\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4672,"score_of_the_acc":-0.961,"final_rank":13},{"submission_id":"aoj_2800_4502335","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define FOR(i,x,n) for(int i=x; i<(n); i++)\n#define ALL(n) begin(n),end(n)\n#define MOD 1000000007\n \ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\nvoid print(int x){printf(\"%d\\n\", x);}\nvoid print(ll x){printf(\"%lld\\n\", x);}\nvoid printvec(vector<int>& a){\nrep(i, a.size()-1){\nprintf(\"%d \", a[i]);\n}\nprintf(\"%d\\n\", a[a.size()-1]);\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 \nint main()\n{\n int n;\n cin >> n;\n vector<int> md(3, 0);\n int r;\n rep(i, n){\n scanf(\"%d\", &r);\n md[r%3]++;\n }\n // printvec(md);\n if(md[1]==0 && md[2]==0){\n printf(\"1\\n\");\n return 0;\n }\n\n int ans=md[0];\n if(md[1]==md[2]){\n ans += 2*md[1];\n }else if(md[1]>md[2]){\n if(md[1]==1) {\n ans++;\n }else{\n md[1] -= 2;\n int m = min(md[1], md[2]);\n ans += 2*m + 2;\n md[1] -= m; md[2] -= m;\n if(md[2]==0){\n if(md[1]!=0) ans++;\n }else if(md[2]==1){\n ans++;\n }else{\n ans+=2;\n }\n }\n }else{\n if(md[2]==1) {\n ans++;\n }else{\n md[2] -= 2;\n int m = min(md[1], md[2]);\n ans += 2*m + 2;\n md[1] -= m; md[2] -= m;\n if(md[1]==0){\n if(md[2]!=0) ans++;\n }else if(md[1]==1){\n ans++;\n }else{\n ans+=2;\n }\n }\n }\n\n print(ans);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3228,"score_of_the_acc":-0.2127,"final_rank":6},{"submission_id":"aoj_2800_4502323","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define FOR(i,x,n) for(int i=x; i<(n); i++)\n#define ALL(n) begin(n),end(n)\n#define MOD 1000000007\n \ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\nvoid print(int x){printf(\"%d\\n\", x);}\nvoid print(ll x){printf(\"%lld\\n\", x);}\nvoid printvec(vector<int>& a){\nrep(i, a.size()-1){\nprintf(\"%d \", a[i]);\n}\nprintf(\"%d\\n\", a[a.size()-1]);\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 \nint main()\n{\n int n;\n cin >> n;\n vector<int> md(3, 0);\n int r;\n rep(i, n){\n scanf(\"%d\", &r);\n md[r%3]++;\n }\n // printvec(md);\n if(md[1]==0 && md[2]==0){\n printf(\"1\\n\");\n return 0;\n }\n\n int ans=md[0];\n if(md[1]==md[2]){\n ans += 2*md[1];\n }else if(md[1]>md[2]){\n if(md[1]==1) {\n ans++;\n }else{\n md[1] -= 2;\n int m = min(md[1], md[2]);\n ans += 2*m + 2;\n md[1] -= m; md[2] -= m;\n if(md[2]==0){\n if(md[1]!=0) ans++;\n }else{\n if(md[2]==1) ans++;\n else ans += 2;\n }\n }\n }else{\n if(md[2]==1) {\n ans++;\n }else{\n md[2] -= 2;\n int m = min(md[1], md[2]);\n ans += 2*m + 2;\n md[1] -= m; md[2] -= m;\n if(md[1]==0){\n if(md[2]!=0) ans++;\n }else{\n if(md[2]==1) ans++;\n else ans += 2;\n }\n }\n }\n\n print(ans);\n return 0;\n}","accuracy":0.7848101265822784,"time_ms":20,"memory_kb":3228,"score_of_the_acc":-0.2127,"final_rank":19},{"submission_id":"aoj_2800_4488826","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\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; }\n// ---------------------------------------------------------------------------\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i,n) cin >> a[i];\n vector<int> cnt(3,0);\n rep(i,n){\n cnt[a[i]%3]++;\n }\n if(cnt[1]==0 and cnt[2]==0){\n cout << 1 << \"\\n\";\n }else{\n int ans = cnt[0];\n ans += min(cnt[1],cnt[2]) * 2;\n ans += min(3,max(cnt[1],cnt[2])-min(cnt[1],cnt[2]));\n cout << ans << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4672,"score_of_the_acc":-0.361,"final_rank":7},{"submission_id":"aoj_2800_4488057","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(3, 0);\n for(int i=0; i<n; i++){\n int tmp;\n cin >> tmp;\n a[tmp%3]++;\n }\n\n int ans = 0;\n if(a[0] == n){\n ans = 1;\n }else if(a[1] < a[2]){\n ans = a[0]+a[1]+min(a[2], a[1]+3);\n }else{\n ans = a[0]+a[2]+min(a[1], a[2]+3);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3104,"score_of_the_acc":-0.8,"final_rank":8},{"submission_id":"aoj_2800_4488052","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int n;\n cin>>n;\n vector<int> uma(n);\n vector<int> ama(3,0);\n vector<vector<int>> hon(3);\n for(int i = 0;i < n;++i) {\n cin>>uma[i];\n ++ama[uma[i]%3];\n hon[uma[i]%3].emplace_back(uma[i]);\n }\n sort(hon[0].begin(),hon[0].end());\n sort(hon[1].begin(),hon[1].end());\n sort(hon[2].begin(),hon[2].end());\n\n int a=ama[0];\n int b=ama[1];\n int c=ama[2];\n\n int ans=0;\n if(b==0&&c==0) {\n cout<<1<<endl;\n }\n else if(b==c||b+1==c||c+1==b) {\n\n cout<<n<<endl;\n }\n else if(b+3<=c) {\n ans+=a;\n ans+=b;\n for(int i = 0;i < b+3;++i) {\n ans++;\n }\n cout<<ans<<endl;\n }\n else {\n ans+=a;\n ans+=c;\n for(int i = 0;i < min(b,c+3);++i) {\n ans++;\n }\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":7000,"score_of_the_acc":-1.4,"final_rank":18},{"submission_id":"aoj_2800_4488037","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<ll,ll> mp;\nll inf = 1e9;\n\n\nint main(){\n int n;\n cin>>n;\n vector<int> a(n);\n vector<int> cnt(3,0);\n for(int i=0;i<n;i++){\n cin>>a[i];\n cnt[ a[i]%3 ]++;\n }\n\n if( cnt[1] == 0 && cnt[2] == 0 ){\n cout<<1<<endl;\n return 0;\n }\n\n //cout<<cnt[1]<<' '<<cnt[2]<<endl;\n\n int ans = 0;\n for(int j=1;j<=2;j++){\n vector<int> tmp= cnt;\n if( tmp[j] != 0 ){\n int sum = 0;\n sum = tmp[0]+1;\n int now = j;\n tmp[j]--;\n\n //cout<<sum<<' '<<now<<' '<<tmp[1]<<' '<<tmp[2]<<endl;\n while( tmp[now] != 0 ){\n tmp[now]--;\n //cout<<now<<endl;\n now += now;\n now %= 3;\n sum++;\n //cout<<sum<<' '<<now<<' '<<tmp[1]<<' '<<tmp[2]<<endl;\n }\n if( tmp[1] || tmp[2] ) sum++;\n //cout<<j<<' '<<sum<<endl;\n ans = max(ans,sum);\n }\n\n }\n cout<<ans<<endl;\n\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4684,"score_of_the_acc":-0.9622,"final_rank":14},{"submission_id":"aoj_2800_4480969","code_snippet":"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n int n,a;\n int cnt[3]={};\n \n cin >> n;\n for(int i=0;i<n;i++){\n cin >> a;\n cnt[a%3]++;\n }\n \n int ans = 0;\n if(cnt[0] < n) ans += cnt[0];\n if(cnt[1] > cnt[2]){\n cnt[1]--;\n ans++;\n } else if(cnt[2] > 0){\n cnt[2]--;\n ans++;\n }\n ans += min(cnt[1],cnt[2])*2;\n if(cnt[1] != cnt[2]) ans++;\n if(ans < n) ans++;\n \n cout << ans << endl;\n \n return(0);\n}","accuracy":1,"time_ms":50,"memory_kb":3104,"score_of_the_acc":-0.8,"final_rank":8},{"submission_id":"aoj_2800_3992942","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nint N,M,K,L,R,H,W;\n//long long int N,M,K,L,R,H,W;\n\nconstexpr long long int MOD=1000000007;\n//constexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n//constexpr long long int MOD=998244353;\n\nconstexpr long double EPS=1e-8;\n\n\n\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t\n\tcin>>N;\n\tvector<int>w(N);\n\tfor(auto &i:w)cin>>i;\n\tvector<int>v(4);\n\tfor(auto i:w){\n\t\tv[i%3]++;\n\t}\n\tif(v[0]==N){\n\t\tcout<<1<<endl;\n\t\treturn 0;\n\t}\n\tif(v[1]==N){\n\t\tcout<<min(3,N)<<endl;\n\t\treturn 0;\n\t}\n\tif(v[2]==N){\n\t\tcout<<min(3,N)<<endl;\n\t\treturn 0;\n\t}\n\tint ans=1;\n\tif(v[1]>=2){\n\t\tans=max(ans,2+min(v[2],v[1]-2)*2+v[0]);\n\t}\n\tif(v[1]>=3){\n\t\tans=max(ans,3+min(v[2],v[1]-3)*2+v[0]);\n\t}\n\tif(v[2]>=2){\n\t\tans=max(ans,2+min(v[1],v[2]-2)*2+v[0]);\n\t}\n\tif(v[2]>=3){\n\t\tans=max(ans,3+min(v[1],v[2]-3)*2+v[0]);\n\t}\n\tif(v[1]&&v[2]){\n\t\tans=max(ans,2+min(v[1]-1,v[2]-1)*2+v[0]);\n\t}\n\tif(v[1]){\n\t\tans=max(ans,1+min(v[1]-1,v[2])*2+v[0]);\n\t}\n\tif(v[2]){\n\t\tans=max(ans,1+min(v[2]-1,v[1])*2+v[0]);\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4688,"score_of_the_acc":-0.1626,"final_rank":5},{"submission_id":"aoj_2800_3987357","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nint N,M,K,L,R,H,W;\n//long long int N,M,K,L,R,H,W;\n\nconstexpr long long int MOD=1000000007;\n//constexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n//constexpr long long int MOD=998244353;\n\nconstexpr long double EPS=1e-8;\n\n\n\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t\n\tcin>>N;\n\tvector<int>w(N);\n\tfor(auto &i:w)cin>>i;\n\tvector<int>v(4);\n\tfor(auto i:w){\n\t\tv[i%3]++;\n\t}\n\tif(v[0]==N){\n\t\tcout<<1<<endl;\n\t\treturn 0;\n\t}\n\tif(v[1]==N){\n\t\tcout<<min(3,N)<<endl;\n\t\treturn 0;\n\t}\n\tif(v[2]==N){\n\t\tcout<<min(3,N)<<endl;\n\t\treturn 0;\n\t}\n\tint ans=1;\n\tif(v[1]>=2){\n\t\tans=max(ans,2+min(v[2],v[1]-2)*2+v[0]);\n\t}\n\tif(v[1]>=3){\n\t\tans=max(ans,3+min(v[2],v[1]-3)*2+v[0]);\n\t}\n\tif(v[2]>=2){\n\t\tans=max(ans,2+min(v[1],v[2]-2)*2+v[0]);\n\t}\n\tif(v[2]>=3){\n\t\tans=max(ans,3+min(v[1],v[2]-3)*2+v[0]);\n\t}\n\tif(v[1]&&v[2]){\n\t\tans=max(ans,2+min(v[1]-1,v[2]-1)*2+v[0]);\n\t}\n\tif(v[1]){\n\t\tans=max(ans,1+min(v[1]-1,v[2])*2+v[0]);\n\t}\n\tif(v[2]){\n\t\tans=max(ans,1+min(v[2]-1,v[1])*2+v[0]);\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4684,"score_of_the_acc":-0.1622,"final_rank":4},{"submission_id":"aoj_2800_3897882","code_snippet":"#include<algorithm>\n#include<cassert>\n#include<cfloat>\n#include<climits>\n#include<cmath>\n#include<cstring>\n#include<deque>\n#include<functional>\n#include<iomanip>\n#include<iostream>\n#include<map>\n#include<queue>\n#include<set>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<vector>\n\nusing namespace std;\n\nusing lint = long long;\nusing P = pair<int, int>;\nusing LLP = pair<long long, long long>;\n\n#define REP(i, x, n) for(int i = (x), i##_len = int(n) ; i < i##_len ; ++i)\n#define rep(i, n) for(int i = 0, i##_len = int(n) ; i < i##_len ; ++i)\n#define reps(i, n) for(int i = 1, i##_len = int(n) ; i <= i##_len ; ++i)\n#define rrep(i, n) for(int i = int(n) - 1 ; i >= 0 ; --i)\n#define rreps(i, n) for(int i = int(n) ; i > 0 ; --i)\n#define SORT(x) sort((x).begin(), (x).end())\n#define SORT_INV(x) sort((x).rbegin(), (x).rend())\n#define TWINS(x) cout << ((x) ? \"Yay!\" : \":(\") << endl\n\nconstexpr int IINF = (1 << 30) - 1;\nconstexpr long long LLINF = 1LL << 61;\nconstexpr double EPS = 1e-8;\n\nconstexpr int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};\nconstexpr int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};\n\ntemplate<typename T>\nbool chmax(T& a, T b, bool equal = false){\n if(a < b || equal && a == b){\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<typename T>\nbool chmin(T& a, T b, bool equal = false){\n if(b < a || equal && a == b){\n a = b;\n return true;\n }\n return false;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n;\n cin >> n;\n\n vector<int> cnt(3);\n rep(i, n){\n int a;\n cin >> a;\n ++cnt[a % 3];\n }\n\n // cout << cnt[0] << \" \" << cnt[1] << \" \" << cnt[2] << endl;\n\n int ans = 1;\n if(cnt[1] >= 2){\n if(cnt[2] == cnt[1] - 2){\n ans = n;\n }else if(cnt[2] < cnt[1] - 2){\n chmax(ans, 2 + cnt[2] * 2 + cnt[0] + 1);\n }else{\n chmax(ans, 2 + (cnt[1] - 2) * 2 + cnt[0] + min(2, cnt[2] - cnt[1] + 2));\n }\n }\n if(cnt[2] >= 1){\n if(cnt[2] - 1 == cnt[1]){\n ans = n;\n }else if(cnt[2] - 1 < cnt[1]){\n chmax(ans, 1 + (cnt[2] - 1) * 2 + cnt[0] + 1);\n }else{\n chmax(ans, 1 + cnt[1] * 2 + cnt[0] + min(2, cnt[2] - 1 - cnt[1]));\n }\n }\n if(cnt[1] == 1){\n chmax(ans, 1 + cnt[0]);\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3196,"score_of_the_acc":-0.0094,"final_rank":1},{"submission_id":"aoj_2800_3662121","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\nconst long double PI = acos(-1);\nconstexpr long double EPS = 1e-15;\nconstexpr int inf = 2e9;\nconstexpr ll INF = 2e18;\nconstexpr ll MOD = 1e9+7;\nconstexpr ll MOD1 = 998244353;\ntypedef pair<ll,ll> P;\n\n//#define all(v) (v).begin(), (v).end()\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\n#define REP(i,n) rep(i,0,n)\n#define sz(s) (s).size()\n#define pb push_back\n#define fi first\n#define se second\n//#define mp make_pair\n\nint main(){\n int n;\n cin >> n;\n int cnt[3] = {};\n REP(i,n) {\n int tmp;\n cin >> tmp;\n cnt[tmp%3]++;\n }\n if (cnt[0] == n) {\n cout << 1 << endl;\n return 0;\n }\n int ans;\n if(cnt[1] < cnt[2] - 3){\n ans = cnt[1] * 2 + 3;\n }else if(cnt[1] <= cnt[2] + 3){\n ans = cnt[1] + cnt[2];\n }else{\n ans = cnt[2] * 2 + 3;\n }\n ans += cnt[0];\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3104,"score_of_the_acc":-0.8,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2800_8322213\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\n\\nlong long N;\\nlong long A[1 << 19];\\nlong long C[3];\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tfor (int i = 1; i <= N; i++) cin >> A[i];\\n\\tfor (int i = 1; i <= N; i++) C[A[i] % 3] += 1;\\n\\n\\t// Step 2. First Case\\n\\tif (C[1] + C[2] == 0) {\\n\\t\\tcout << min(1LL, C[0]) << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\t// Step 3. Second Case\\n\\tC[1] = min(C[1], C[2] + 3);\\n\\tC[2] = min(C[2], C[1] + 3);\\n\\tcout << C[0] + C[1] + C[2] << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7512,\n \"score_of_the_acc\": -1.0526,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2800_8322212\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\n\\nlong long N;\\nlong long A[1 << 18];\\nlong long C[3];\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tfor (int i = 1; i <= N; i++) cin >> A[i];\\n\\tfor (int i = 1; i <= N; i++) C[A[i] % 3] += 1;\\n\\n\\t// Step 2. First Case\\n\\tif (C[1] + C[2] == 0) {\\n\\t\\tcout << min(1LL, C[0]) << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\t// Step 3. Second Case\\n\\tC[1] = min(C[1], C[2] + 3);\\n\\tC[2] = min(C[2], C[1] + 3);\\n\\tcout << C[0] + C[1] + C[2] << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.11392405063291139,\n \"time_ms\": 20,\n \"memory_kb\": 5392,\n \"score_of_the_acc\": -0.4349,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2800_6964395\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nll v[3];\\nint main(void){\\n ll n,ans=0;\\n cin>>n;\\n vector<ll> a(n);\\n for(ll i=0;i<n;i++){\\n cin>>a[i];\\n v[a[i]%3]++;\\n }\\n ll MIN=min(v[1],v[2]),MAX=max(v[1],v[2]);\\n ans=MIN+min(MAX,MIN+3);\\n ans+=v[0];\\n if(v[1]==0 && v[2]==0){\\n cout<<1<<endl;\\n }else{\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7044,\n \"score_of_the_acc\": -0.8045,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2800_6963981\",\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=2167167167167167167;\\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\\\";}\\ntemplate<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\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;\\n\\tcin>>N;\\n\\tvector<int> p(3);\\n\\trep(i,N){\\n\\t\\tint a;\\n\\t\\tcin>>a;\\n\\t\\tp[a%3]++;\\n\\t}\\n\\tif(p[0]==N) cout<<\\\"1\\\\n\\\";\\n\\telse{\\n\\t\\tif(p[1]<p[2]) swap(p[1],p[2]);\\n\\t\\tint ans=p[0]+1;\\n\\t\\tp[1]--;\\n\\t\\tint x=0;\\n\\t\\twhile(true){\\n\\t\\t\\tif(p[x+1]==0) break;\\n\\t\\t\\tp[x+1]--;\\n\\t\\t\\tans++;\\n\\t\\t\\tx^=1;\\n\\t\\t}\\n\\t\\tif(ans!=N) ans++;\\n\\t\\tcout<<ans<<\\\"\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0345,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2800_6713598\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n\\n#define all(x) (x).begin(),(x).end()\\n#define print(x) cout << (x) << '\\\\n'\\ntypedef long long ll;\\ntypedef long double ld;\\nusing P = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing Graph = vector<vector<int>>;\\n\\n//using mint = atcoder :: modint998244353;\\n//const ll MOD = 1000000007;\\n//const ll MOD = 998244353;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {return a < b ? a = b, true : false;}\\ntemplate <typename T> inline bool chmin(T &a, T b) {return a > b ? a = b, true : false;}\\n\\ntemplate <typename T>\\nvoid vin(vector<T> &v) {\\n int l = v.size();\\n for(int i = 0; i < l; i++) cin >> v[i];\\n}\\n\\ntemplate <typename T>\\nvoid vout(vector<T> &v) {\\n int l = v.size();\\n for(int i = 0; i < l; i++) cout << v[i] << \\\" \\\\n\\\"[i == l - 1];\\n}\\n\\nint main() {\\n cin.tie(0); cout.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(18);\\n\\n int n; cin >> n;\\n vector<int> c(3, 0);\\n for(int i = 0; i < n; i++) {\\n int a; cin >> a;\\n c[a % 3]++;\\n }\\n if(c[1] + c[2] == 0) {\\n print(1);\\n } else {\\n int ans = 0;\\n for(int t = 1; t <= 2; t++) {\\n int cnt = c[0];\\n vector<int> d = {c[1], c[2]};\\n int now = -1;\\n if(d[t - 1] > 0) {\\n d[t - 1]--;\\n now = t;\\n cnt++;\\n }\\n for(int i = 0; i < n - c[0]; i++) {\\n if(now == 1) {\\n if(d[0] == 0) break;\\n else {\\n d[0]--;\\n now = 2;\\n cnt++;\\n }\\n } else if(now == 2) {\\n if(d[1] == 0) break;\\n else {\\n d[1]--;\\n now = 1;\\n cnt++;\\n }\\n }\\n }\\n if(d[0] + d[1] > 0) cnt++;\\n chmax(ans, cnt);\\n }\\n print(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0345,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2800_6007927\",\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< 998244353 >;\\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 cnt[3];\\nint dfs(int v) {\\n int res = 0;\\n if(v == 1) {\\n if(cnt[1]) {\\n cnt[1]--;\\n res = max(res, dfs(2) + 1);\\n cnt[1]++;\\n }\\n if(cnt[2]) res = max(res,1);\\n \\n }else if(v == 2) {\\n if(cnt[2]) {\\n cnt[2]--;\\n res = max(res, dfs(1) + 1);\\n cnt[2]++;\\n }\\n if(cnt[1]) res = max(res, 1);\\n }\\n return res;\\n}\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n\\n int n; cin >> n;\\n vector<int> a(n);\\n \\n REP(i,n) {\\n cin >> a[i];\\n cnt[a[i]%3]++;\\n }\\n int ans = cnt[0];\\n int f1=0, f2=0;\\n if(cnt[1]) {\\n cnt[1]--;\\n f1 = dfs(1) + 1;\\n cnt[1]++;\\n }\\n if(cnt[2]) {\\n cnt[2]--;\\n f2 = dfs(2) + 1;\\n cnt[2]++;\\n }\\n if(cnt[1]==0&&cnt[2]==0)ans=1;\\n cout << ans + max(f1, f2) << endl; \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 12844,\n \"score_of_the_acc\": -1.2,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2800_5301582\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\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 namespace std;\\nusing ll = long long;\\nll mod = 1e9+7;\\nconst int dx[8] = {-1,0,1,0,-1,-1,1,1};\\nconst int dy[8] = {0,1,0,-1,1,-1,1,-1};\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<int> cnt(3,0);\\n for(int i=0;i<n;++i) {\\n int a;\\n cin >> a;\\n cnt[a%3]++;\\n }\\n\\n int ans1=0, ans2=0;\\n vector<int> c1(n), c2(n);\\n copy(cnt.begin(), cnt.end(), c1.begin());\\n copy(cnt.begin(), cnt.end(), c2.begin());\\n if (cnt[1]) {\\n ans1 = c1[0]+1;\\n c1[1]--;\\n while(true){\\n if (c1[1]==0) break;\\n ans1++;\\n c1[1]--;\\n if (c1[2]==0) break;\\n ans1++;\\n c1[2]--;\\n }\\n ans1 += min(1, c1[1]+c1[2]);\\n }\\n if (cnt[2]) {\\n ans2=c2[0]+1;\\n c2[2]--;\\n while(true){\\n if(c2[2]==0) break;\\n c2[2]--;\\n ans2++;\\n if(c2[1]==0) break;\\n c2[1]--;\\n ans2++;\\n }\\n ans2 += min(1, c2[1]+c2[2]);\\n }\\n int ans = 1;\\n ans = max(ans, ans1);\\n ans = max(ans, ans2);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6788,\n \"score_of_the_acc\": -1.1782,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2800_4759217\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\nint b[3];\\nint c[3];\\nint main() {\\n\\t// your code goes here\\n\\tint n,t;\\n\\tcin>>n;\\n\\tfor(int i=0;i<3;i++){\\n\\t\\tb[i]=0;\\n\\t\\tc[i]=0;\\n\\t}\\n\\tint ans=1;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tcin>>t;\\n\\t\\tb[t%3]++;\\n\\t\\tc[t%3]++;\\n\\t}\\n\\tint c1=0;\\n\\tif(b[1]>0){\\n\\t\\tb[1]--;\\n\\t\\tc1+=1;\\n\\t\\tc1+=b[0];\\n\\t\\tb[0]=0;\\n\\t\\tint i=1;\\n\\t\\twhile(b[i]>=0){\\n\\t\\t\\tif(i==1){\\n\\t\\t\\t\\tif(ans<c1+1 && b[2]>0)ans=c1+1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(ans<c1+1 && b[1]>0)ans=c1+1;\\n\\t\\t\\t}\\n\\t\\t\\tif(b[i]==0)break;\\n\\t\\t\\tb[i]--;\\n\\t\\t\\tc1++;\\n\\t\\t\\tif(i==1){\\n\\t\\t\\t\\ti=2;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ti=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(ans<c1)ans=c1;\\n\\t\\n\\tc1=0;\\n\\tif (c[2]>0){\\n\\t\\tc[2]--;\\n\\t\\tc1+=1;\\n\\t\\tc1+=c[0];\\n\\t\\tc[0]=0;\\n\\t\\tint i=2;\\n\\t\\twhile(c[i]>=0){\\n\\t\\t\\tif(i==1){\\n\\t\\t\\t\\tif(ans<c1+1 && c[2]>0)ans=c1+1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(ans<c1+1 && c[1]>0)ans=c1+1;\\n\\t\\t\\t}\\n\\t\\t\\tif(c[i]==0)break;\\n\\t\\t\\tc[i]--;\\n\\t\\t\\tc1++;\\n\\t\\t\\tif(i==1){\\n\\t\\t\\t\\ti=2;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ti=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\n\\t}\\n\\tif(ans<c1)ans=c1;\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.8029,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2800_4526530\",\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;\\nusing lint = long long int;\\nlong long int INF = 1001001001001001LL;\\nint inf = 1000000007;\\nlong long int MOD = 1000000007LL;\\ndouble PI = 3.1415926535897932;\\n\\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\\n\\n#define ALL(a) a.begin(),a.end()\\n#define RALL(a) a.rbegin(),a.rend()\\n\\n/* do your best */\\n\\nint main() {\\n \\n int n; cin >> n;\\n vector<int> a(n);\\n vector<int> cnt(3, 0);\\n for (int i = 0; i < n; i++) {\\n cin >> a[i];\\n cnt[a[i] % 3]++;\\n }\\n\\n if (cnt[0] == n) {\\n cout << 1 << endl;\\n return 0;\\n }\\n \\n lint ans = cnt[0];\\n if (cnt[1] > cnt[2]) {\\n swap(cnt[1], cnt[2]);\\n }\\n \\n ans += cnt[1] + min(cnt[1] + 3, cnt[2]);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4672,\n \"score_of_the_acc\": -0.961,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2800_4502335\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define FOR(i,x,n) for(int i=x; i<(n); i++)\\n#define ALL(n) begin(n),end(n)\\n#define MOD 1000000007\\n \\ntypedef long long ll;\\ntypedef unsigned int ui;\\ntypedef unsigned long long ull;\\nvoid print(int x){printf(\\\"%d\\\\n\\\", x);}\\nvoid print(ll x){printf(\\\"%lld\\\\n\\\", x);}\\nvoid printvec(vector<int>& a){\\nrep(i, a.size()-1){\\nprintf(\\\"%d \\\", a[i]);\\n}\\nprintf(\\\"%d\\\\n\\\", a[a.size()-1]);\\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 \\nint main()\\n{\\n int n;\\n cin >> n;\\n vector<int> md(3, 0);\\n int r;\\n rep(i, n){\\n scanf(\\\"%d\\\", &r);\\n md[r%3]++;\\n }\\n // printvec(md);\\n if(md[1]==0 && md[2]==0){\\n printf(\\\"1\\\\n\\\");\\n return 0;\\n }\\n\\n int ans=md[0];\\n if(md[1]==md[2]){\\n ans += 2*md[1];\\n }else if(md[1]>md[2]){\\n if(md[1]==1) {\\n ans++;\\n }else{\\n md[1] -= 2;\\n int m = min(md[1], md[2]);\\n ans += 2*m + 2;\\n md[1] -= m; md[2] -= m;\\n if(md[2]==0){\\n if(md[1]!=0) ans++;\\n }else if(md[2]==1){\\n ans++;\\n }else{\\n ans+=2;\\n }\\n }\\n }else{\\n if(md[2]==1) {\\n ans++;\\n }else{\\n md[2] -= 2;\\n int m = min(md[1], md[2]);\\n ans += 2*m + 2;\\n md[1] -= m; md[2] -= m;\\n if(md[1]==0){\\n if(md[2]!=0) ans++;\\n }else if(md[1]==1){\\n ans++;\\n }else{\\n ans+=2;\\n }\\n }\\n }\\n\\n print(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.2127,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2800_4502323\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define FOR(i,x,n) for(int i=x; i<(n); i++)\\n#define ALL(n) begin(n),end(n)\\n#define MOD 1000000007\\n \\ntypedef long long ll;\\ntypedef unsigned int ui;\\ntypedef unsigned long long ull;\\nvoid print(int x){printf(\\\"%d\\\\n\\\", x);}\\nvoid print(ll x){printf(\\\"%lld\\\\n\\\", x);}\\nvoid printvec(vector<int>& a){\\nrep(i, a.size()-1){\\nprintf(\\\"%d \\\", a[i]);\\n}\\nprintf(\\\"%d\\\\n\\\", a[a.size()-1]);\\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 \\nint main()\\n{\\n int n;\\n cin >> n;\\n vector<int> md(3, 0);\\n int r;\\n rep(i, n){\\n scanf(\\\"%d\\\", &r);\\n md[r%3]++;\\n }\\n // printvec(md);\\n if(md[1]==0 && md[2]==0){\\n printf(\\\"1\\\\n\\\");\\n return 0;\\n }\\n\\n int ans=md[0];\\n if(md[1]==md[2]){\\n ans += 2*md[1];\\n }else if(md[1]>md[2]){\\n if(md[1]==1) {\\n ans++;\\n }else{\\n md[1] -= 2;\\n int m = min(md[1], md[2]);\\n ans += 2*m + 2;\\n md[1] -= m; md[2] -= m;\\n if(md[2]==0){\\n if(md[1]!=0) ans++;\\n }else{\\n if(md[2]==1) ans++;\\n else ans += 2;\\n }\\n }\\n }else{\\n if(md[2]==1) {\\n ans++;\\n }else{\\n md[2] -= 2;\\n int m = min(md[1], md[2]);\\n ans += 2*m + 2;\\n md[1] -= m; md[2] -= m;\\n if(md[1]==0){\\n if(md[2]!=0) ans++;\\n }else{\\n if(md[2]==1) ans++;\\n else ans += 2;\\n }\\n }\\n }\\n\\n print(ans);\\n return 0;\\n}\",\n \"accuracy\": 0.7848101265822784,\n \"time_ms\": 20,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.2127,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2800_4488826\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\n#define enld '\\\\n'\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll mod2 = 998244353;\\nconst double PI = 3.1415926535897932384626433832795028841971;\\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; }\\n// ---------------------------------------------------------------------------\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n rep(i,n) cin >> a[i];\\n vector<int> cnt(3,0);\\n rep(i,n){\\n cnt[a[i]%3]++;\\n }\\n if(cnt[1]==0 and cnt[2]==0){\\n cout << 1 << \\\"\\\\n\\\";\\n }else{\\n int ans = cnt[0];\\n ans += min(cnt[1],cnt[2]) * 2;\\n ans += min(3,max(cnt[1],cnt[2])-min(cnt[1],cnt[2]));\\n cout << ans << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4672,\n \"score_of_the_acc\": -0.361,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2800_4488057\",\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(3, 0);\\n for(int i=0; i<n; i++){\\n int tmp;\\n cin >> tmp;\\n a[tmp%3]++;\\n }\\n\\n int ans = 0;\\n if(a[0] == n){\\n ans = 1;\\n }else if(a[1] < a[2]){\\n ans = a[0]+a[1]+min(a[2], a[1]+3);\\n }else{\\n ans = a[0]+a[2]+min(a[1], a[2]+3);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.8,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2800_4488052\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n int n;\\n cin>>n;\\n vector<int> uma(n);\\n vector<int> ama(3,0);\\n vector<vector<int>> hon(3);\\n for(int i = 0;i < n;++i) {\\n cin>>uma[i];\\n ++ama[uma[i]%3];\\n hon[uma[i]%3].emplace_back(uma[i]);\\n }\\n sort(hon[0].begin(),hon[0].end());\\n sort(hon[1].begin(),hon[1].end());\\n sort(hon[2].begin(),hon[2].end());\\n\\n int a=ama[0];\\n int b=ama[1];\\n int c=ama[2];\\n\\n int ans=0;\\n if(b==0&&c==0) {\\n cout<<1<<endl;\\n }\\n else if(b==c||b+1==c||c+1==b) {\\n\\n cout<<n<<endl;\\n }\\n else if(b+3<=c) {\\n ans+=a;\\n ans+=b;\\n for(int i = 0;i < b+3;++i) {\\n ans++;\\n }\\n cout<<ans<<endl;\\n }\\n else {\\n ans+=a;\\n ans+=c;\\n for(int i = 0;i < min(b,c+3);++i) {\\n ans++;\\n }\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 7000,\n \"score_of_the_acc\": -1.4,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2800_4488037\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> mp;\\nll inf = 1e9;\\n\\n\\nint main(){\\n int n;\\n cin>>n;\\n vector<int> a(n);\\n vector<int> cnt(3,0);\\n for(int i=0;i<n;i++){\\n cin>>a[i];\\n cnt[ a[i]%3 ]++;\\n }\\n\\n if( cnt[1] == 0 && cnt[2] == 0 ){\\n cout<<1<<endl;\\n return 0;\\n }\\n\\n //cout<<cnt[1]<<' '<<cnt[2]<<endl;\\n\\n int ans = 0;\\n for(int j=1;j<=2;j++){\\n vector<int> tmp= cnt;\\n if( tmp[j] != 0 ){\\n int sum = 0;\\n sum = tmp[0]+1;\\n int now = j;\\n tmp[j]--;\\n\\n //cout<<sum<<' '<<now<<' '<<tmp[1]<<' '<<tmp[2]<<endl;\\n while( tmp[now] != 0 ){\\n tmp[now]--;\\n //cout<<now<<endl;\\n now += now;\\n now %= 3;\\n sum++;\\n //cout<<sum<<' '<<now<<' '<<tmp[1]<<' '<<tmp[2]<<endl;\\n }\\n if( tmp[1] || tmp[2] ) sum++;\\n //cout<<j<<' '<<sum<<endl;\\n ans = max(ans,sum);\\n }\\n\\n }\\n cout<<ans<<endl;\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4684,\n \"score_of_the_acc\": -0.9622,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2800_4480969\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\nusing namespace std;\\nint main()\\n{\\n int n,a;\\n int cnt[3]={};\\n \\n cin >> n;\\n for(int i=0;i<n;i++){\\n cin >> a;\\n cnt[a%3]++;\\n }\\n \\n int ans = 0;\\n if(cnt[0] < n) ans += cnt[0];\\n if(cnt[1] > cnt[2]){\\n cnt[1]--;\\n ans++;\\n } else if(cnt[2] > 0){\\n cnt[2]--;\\n ans++;\\n }\\n ans += min(cnt[1],cnt[2])*2;\\n if(cnt[1] != cnt[2]) ans++;\\n if(ans < n) ans++;\\n \\n cout << ans << endl;\\n \\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.8,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2800_3992942\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\nint N,M,K,L,R,H,W;\\n//long long int N,M,K,L,R,H,W;\\n\\nconstexpr long long int MOD=1000000007;\\n//constexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n//constexpr long long int MOD=998244353;\\n\\nconstexpr long double EPS=1e-8;\\n\\n\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t\\n\\tcin>>N;\\n\\tvector<int>w(N);\\n\\tfor(auto &i:w)cin>>i;\\n\\tvector<int>v(4);\\n\\tfor(auto i:w){\\n\\t\\tv[i%3]++;\\n\\t}\\n\\tif(v[0]==N){\\n\\t\\tcout<<1<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tif(v[1]==N){\\n\\t\\tcout<<min(3,N)<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tif(v[2]==N){\\n\\t\\tcout<<min(3,N)<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tint ans=1;\\n\\tif(v[1]>=2){\\n\\t\\tans=max(ans,2+min(v[2],v[1]-2)*2+v[0]);\\n\\t}\\n\\tif(v[1]>=3){\\n\\t\\tans=max(ans,3+min(v[2],v[1]-3)*2+v[0]);\\n\\t}\\n\\tif(v[2]>=2){\\n\\t\\tans=max(ans,2+min(v[1],v[2]-2)*2+v[0]);\\n\\t}\\n\\tif(v[2]>=3){\\n\\t\\tans=max(ans,3+min(v[1],v[2]-3)*2+v[0]);\\n\\t}\\n\\tif(v[1]&&v[2]){\\n\\t\\tans=max(ans,2+min(v[1]-1,v[2]-1)*2+v[0]);\\n\\t}\\n\\tif(v[1]){\\n\\t\\tans=max(ans,1+min(v[1]-1,v[2])*2+v[0]);\\n\\t}\\n\\tif(v[2]){\\n\\t\\tans=max(ans,1+min(v[2]-1,v[1])*2+v[0]);\\n\\t}\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4688,\n \"score_of_the_acc\": -0.1626,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2800_3987357\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\nint N,M,K,L,R,H,W;\\n//long long int N,M,K,L,R,H,W;\\n\\nconstexpr long long int MOD=1000000007;\\n//constexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n//constexpr long long int MOD=998244353;\\n\\nconstexpr long double EPS=1e-8;\\n\\n\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t\\n\\tcin>>N;\\n\\tvector<int>w(N);\\n\\tfor(auto &i:w)cin>>i;\\n\\tvector<int>v(4);\\n\\tfor(auto i:w){\\n\\t\\tv[i%3]++;\\n\\t}\\n\\tif(v[0]==N){\\n\\t\\tcout<<1<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tif(v[1]==N){\\n\\t\\tcout<<min(3,N)<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tif(v[2]==N){\\n\\t\\tcout<<min(3,N)<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tint ans=1;\\n\\tif(v[1]>=2){\\n\\t\\tans=max(ans,2+min(v[2],v[1]-2)*2+v[0]);\\n\\t}\\n\\tif(v[1]>=3){\\n\\t\\tans=max(ans,3+min(v[2],v[1]-3)*2+v[0]);\\n\\t}\\n\\tif(v[2]>=2){\\n\\t\\tans=max(ans,2+min(v[1],v[2]-2)*2+v[0]);\\n\\t}\\n\\tif(v[2]>=3){\\n\\t\\tans=max(ans,3+min(v[1],v[2]-3)*2+v[0]);\\n\\t}\\n\\tif(v[1]&&v[2]){\\n\\t\\tans=max(ans,2+min(v[1]-1,v[2]-1)*2+v[0]);\\n\\t}\\n\\tif(v[1]){\\n\\t\\tans=max(ans,1+min(v[1]-1,v[2])*2+v[0]);\\n\\t}\\n\\tif(v[2]){\\n\\t\\tans=max(ans,1+min(v[2]-1,v[1])*2+v[0]);\\n\\t}\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4684,\n \"score_of_the_acc\": -0.1622,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2800_3897882\",\n \"code_snippet\": \"#include<algorithm>\\n#include<cassert>\\n#include<cfloat>\\n#include<climits>\\n#include<cmath>\\n#include<cstring>\\n#include<deque>\\n#include<functional>\\n#include<iomanip>\\n#include<iostream>\\n#include<map>\\n#include<queue>\\n#include<set>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<vector>\\n\\nusing namespace std;\\n\\nusing lint = long long;\\nusing P = pair<int, int>;\\nusing LLP = pair<long long, long long>;\\n\\n#define REP(i, x, n) for(int i = (x), i##_len = int(n) ; i < i##_len ; ++i)\\n#define rep(i, n) for(int i = 0, i##_len = int(n) ; i < i##_len ; ++i)\\n#define reps(i, n) for(int i = 1, i##_len = int(n) ; i <= i##_len ; ++i)\\n#define rrep(i, n) for(int i = int(n) - 1 ; i >= 0 ; --i)\\n#define rreps(i, n) for(int i = int(n) ; i > 0 ; --i)\\n#define SORT(x) sort((x).begin(), (x).end())\\n#define SORT_INV(x) sort((x).rbegin(), (x).rend())\\n#define TWINS(x) cout << ((x) ? \\\"Yay!\\\" : \\\":(\\\") << endl\\n\\nconstexpr int IINF = (1 << 30) - 1;\\nconstexpr long long LLINF = 1LL << 61;\\nconstexpr double EPS = 1e-8;\\n\\nconstexpr int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};\\nconstexpr int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};\\n\\ntemplate<typename T>\\nbool chmax(T& a, T b, bool equal = false){\\n if(a < b || equal && a == b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<typename T>\\nbool chmin(T& a, T b, bool equal = false){\\n if(b < a || equal && a == b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int n;\\n cin >> n;\\n\\n vector<int> cnt(3);\\n rep(i, n){\\n int a;\\n cin >> a;\\n ++cnt[a % 3];\\n }\\n\\n // cout << cnt[0] << \\\" \\\" << cnt[1] << \\\" \\\" << cnt[2] << endl;\\n\\n int ans = 1;\\n if(cnt[1] >= 2){\\n if(cnt[2] == cnt[1] - 2){\\n ans = n;\\n }else if(cnt[2] < cnt[1] - 2){\\n chmax(ans, 2 + cnt[2] * 2 + cnt[0] + 1);\\n }else{\\n chmax(ans, 2 + (cnt[1] - 2) * 2 + cnt[0] + min(2, cnt[2] - cnt[1] + 2));\\n }\\n }\\n if(cnt[2] >= 1){\\n if(cnt[2] - 1 == cnt[1]){\\n ans = n;\\n }else if(cnt[2] - 1 < cnt[1]){\\n chmax(ans, 1 + (cnt[2] - 1) * 2 + cnt[0] + 1);\\n }else{\\n chmax(ans, 1 + cnt[1] * 2 + cnt[0] + min(2, cnt[2] - 1 - cnt[1]));\\n }\\n }\\n if(cnt[1] == 1){\\n chmax(ans, 1 + cnt[0]);\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.0094,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2800_3662121\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n\\nconst long double PI = acos(-1);\\nconstexpr long double EPS = 1e-15;\\nconstexpr int inf = 2e9;\\nconstexpr ll INF = 2e18;\\nconstexpr ll MOD = 1e9+7;\\nconstexpr ll MOD1 = 998244353;\\ntypedef pair<ll,ll> P;\\n\\n//#define all(v) (v).begin(), (v).end()\\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\\n#define REP(i,n) rep(i,0,n)\\n#define sz(s) (s).size()\\n#define pb push_back\\n#define fi first\\n#define se second\\n//#define mp make_pair\\n\\nint main(){\\n int n;\\n cin >> n;\\n int cnt[3] = {};\\n REP(i,n) {\\n int tmp;\\n cin >> tmp;\\n cnt[tmp%3]++;\\n }\\n if (cnt[0] == n) {\\n cout << 1 << endl;\\n return 0;\\n }\\n int ans;\\n if(cnt[1] < cnt[2] - 3){\\n ans = cnt[1] * 2 + 3;\\n }else if(cnt[1] <= cnt[2] + 3){\\n ans = cnt[1] + cnt[2];\\n }else{\\n ans = cnt[2] * 2 + 3;\\n }\\n ans += cnt[0];\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.8,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1685,"cells":{"group_id":{"kind":"string","value":"aoj_2801_cpp"},"problem_description":{"kind":"string","value":"D: 日焼け - Suntan -\n物語\nあいずにゃんは若ヶ松高校のプログラミングコンテスト部、通称ぷろこん部に所属する2年生である。天使のようにかわいい。\nあいずにゃんは今年の夏フェスに参加する予定なので、聴きに行くバンドのスケジュールを立てた。\nここで心配なのが日焼けだ。\nライブはすべて野外で行われるが、あいずにゃんは日焼けしやすい体質なので長時間野外で紫外線を浴びすぎるとすぐ日焼けしてしまう。\nライブがない間は屋内に避難することでできるだけ紫外線を回避するつもりだが、ライブ中はどうしても日に当たってしまう。\nそこであいずにゃんは日焼け止めを塗ることで紫外線対策をすることを考えた。\n問題\n日焼け止めを塗ると、塗った時間から\nT\n分間だけその効果を得ることができる。\n日焼け止めは1回しか塗ることができないため、効果的に使いたい。\nあいずにゃんは、ライブの開始時刻から終了時刻までは野外にいて、それ以外では屋内にいる。\nあいずにゃんが聴く予定のライブスケジュールが与えられるので、野外にいる間で日焼け止めの効果を得られる最大の時間の長さを求めよ。\n入力形式\n入力は次の形式で与えらえる。\nT\nN\ns_1\nt_1\n...\ns_N\nt_N\n1行目では日焼け止めの効果を得られる時間を表す整数\nT\nが与えられる。\n2行目ではあいずにゃんが聴くライブの数を表す整数\nN\nが与えられる。\n続く\nN\n行には、あいずにゃんが\ni\n番目に聴くライブの開始時刻を表す整数\ns_i\nと終了時刻を表す整数\nt_i\nが空白区切りで与えられる。\n制約\n1 ≤ T ≤ 10^{15}\n1 ≤ N ≤ 10^5\n0 ≤ s_i < t_i ≤ 10^{15}\n(\n1 ≤ i ≤ N\n)\n(i+1)\n番目のライブの開始時刻は\ni\n番目のライブの終了時刻と同じかそれよりも遅い。すなわち、\nt_i ≤ s_{i+1}\n(\n1 ≤ i < N\n)\n出力\n野外にいる間で日焼け止めの効果を得られる最大の時間の長さを1行で出力せよ。\n入力例1\n20\n1\n0 10\n出力例1\n10\n入力例2\n20\n1\n0 100\n出力例2\n20\n入力例3\n9\n3\n1 5\n9 11\n13 20\n出力例3\n7\n入力例4\n25\n5\n9 12\n15 20\n21 25\n28 40\n45 60\n出力例4\n21"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2801_10570469","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\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\nbool ispali(int n){\n string s = to_string(n);\n string t = s;\n reverse(all(t));\n return s == t;\n}\n\nconst int iinf = 1e9;\n\nvoid solve(){\n ll t; cin >> t;\n int n; cin >> n;\n vector<ll> a;\n rep(i,0,n){\n ll l, r; cin >> l >> r;\n a.push_back(l);\n a.push_back(r);\n }\n vector<ll> rui(n*2+1);\n rep(i,0,n*2){\n rui[i+1] = rui[i] + (i % 2 == 0 ? 0 : a[i] - a[i-1]);\n }\n rui.erase(rui.begin());\n rui.push_back(rui.back());\n ll ans = 0;\n rep(i,0,n*2){\n ll le = a[i];\n ll ri = le + t;\n int id = lower_bound(all(a),ri) - a.begin();\n if (id % 2 == 0){\n chmax(ans,rui[id]-rui[i]);\n }\n else {\n chmax(ans,rui[id-1]-rui[i] +ri-a[id-1]);\n }\n }\n cout << ans << endl;\n}\n\nint main(){\n solve();\n}","accuracy":1,"time_ms":50,"memory_kb":7120,"score_of_the_acc":-0.4143,"final_rank":10},{"submission_id":"aoj_2801_10570434","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main() {\n\tll t;cin>>t;\n\tll n;cin>>n;\n\tvector<ll>s(n),tt(n);\n\tvector<ll>v;\n\tfor (int i=0;i<n;i++){\n\t\tcin>>s[i]>>tt[i];\n\t\tv.push_back(s[i]);\n\t\tv.push_back(tt[i]);\n\t}\n\t\n\tv.push_back((ll)1e17);\n\t\n\tvector<ll> tar(2*n+1);\n\tfor (int i=0;i<n;i++) {\n\t\tif(i>0)tar[2*i]=tar[2*i-1]+tt[i-1]-s[i-1];\n\t\ttar[2*i+1]=tar[2*i];\n\t}\n\ttar[2*n]=tar[2*n-1]+tt[n-1]-s[n-1];\n\t\n\tll ans=0;\n\tfor(int i=0;i<n;i++) {\n\t\tint idx=int(upper_bound(v.begin(),v.end(),s[i]+t)-v.begin());\n\t\t//cout<<idx<<endl;\n\t\tif (idx%2==0){\n\t\t\t//ending\n\t\t\tans=max(ans,tar[idx]-tar[2*i]);\t\n\t\t\t//cout<<tar[idx]-tar[2*i]<<endl;\n\t\t}else{\n\t\t\t//starting\n\t\t\tans=max(ans,tar[idx]+s[i]+t-s[idx/2]-tar[2*i]);\n\t\t\t//cout<<tar[idx]+s[i]+t-s[idx/2]-tar[2*i]<<endl;\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\t\n\t\n}","accuracy":1,"time_ms":60,"memory_kb":7812,"score_of_the_acc":-0.5328,"final_rank":15},{"submission_id":"aoj_2801_9675324","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvoid fileIO(void) {\n#ifndef ONLINE_JUDGE\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n}\n\nvoid fastIO(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }\n# define int long long\n\nvector<int> s;\nvector<int> e;\nvector<int> val;\nint calc(int low, int high){\n int ans = 0;\n\n int low_st = lower_bound(s.begin(), s.end(), low) - s.begin();\n int low_en = lower_bound(e.begin(), e.end(), low) - e.begin();\n\n int high_st = lower_bound(s.begin(), s.end(), high) - s.begin();\n int high_en = lower_bound(e.begin(), e.end(), high) - e.begin();\n\n int l, r;\n\n if(low_st > low_en && low < e[low_en] /*handle edge*/ ) {\n l = low_st - 1;\n ans = s[l] - low;\n }\n else l = low_st;\n\n if(high_st > high_en && high <= e[high_en] ) {\n r = high_en;\n ans += high - e[r];\n }\n else r = high_en-1;\n\n ans += val[r+1] - val[l];\n\n return ans;\n}\n\nsigned main(){\n fastIO();\n\n int t, n;\n cin >> t >> n;\n val.push_back(0);\n for (int i = 0; i < n; ++i) {\n int l, r;\n cin >> l >> r;\n l++, r++;\n s.push_back(l);\n e.push_back(r);\n val.push_back(r-l + val.back());\n }\n int ans = 0;\n for (int i = 0; i < n; ++i) {\n ans = max(ans, calc(s[i], s[i]+t));\n ans = max(ans, calc(e[i], e[i]+t));\n ans = max(ans, calc(s[i]-t, s[i] ));\n ans = max(ans, calc(e[i]-t, e[i]));\n }\n cout << ans << endl;\n\n\n}","accuracy":1,"time_ms":50,"memory_kb":5712,"score_of_the_acc":-0.3088,"final_rank":7},{"submission_id":"aoj_2801_9675321","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvoid fileIO(void) {\n#ifndef ONLINE_JUDGE\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n}\n\nvoid fastIO(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }\n# define int long long\n\nvector<int> s;\nvector<int> e;\nvector<int> val;\nint calc(int low, int high){\n int ans = 0;\n\n if(low < 1)\n low = 1;\n\n int low_st = lower_bound(s.begin(), s.end(), low) - s.begin();\n int low_en = lower_bound(e.begin(), e.end(), low) - e.begin();\n\n int high_st = lower_bound(s.begin(), s.end(), high) - s.begin();\n int high_en = lower_bound(e.begin(), e.end(), high) - e.begin();\n\n int l, r;\n\n if(low_st > low_en && low < e[low_en] /*handle edge*/ ) {\n l = low_st - 1;\n ans = s[l] - low;\n }\n else l = low_st;\n\n if(high_st > high_en && high <= e[high_en] ) {\n r = high_en;\n ans += high - e[r];\n } \n else r = high_en-1;\n\n ans += val[r+1] - val[l];\n\n return ans;\n}\n\nsigned main(){\n fastIO();\n\n int t, n;\n cin >> t >> n;\n val.push_back(0);\n for (int i = 0; i < n; ++i) {\n int l, r;\n cin >> l >> r;\n l++, r++;\n s.push_back(l);\n e.push_back(r);\n val.push_back(r-l + val.back());\n }\n int ans = 0;\n for (int i = 0; i < n; ++i) {\n ans = max(ans, calc(s[i], s[i]+t));\n ans = max(ans, calc(e[i], e[i]+t));\n ans = max(ans, calc(s[i]-t, s[i] ));\n ans = max(ans, calc(e[i]-t, e[i]));\n\n }\n cout << ans << endl;\n\n\n}","accuracy":1,"time_ms":50,"memory_kb":5664,"score_of_the_acc":-0.3052,"final_rank":5},{"submission_id":"aoj_2801_9670795","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvoid fileIO(void) {\n#ifndef ONLINE_JUDGE\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n}\n\nvoid fastIO(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }\n# define int long long\n\nvector<int> s;\nvector<int> e;\nvector<int> val;\nint calc(int low, int high){\n int ans = 0;\n\n if(low < 1)\n low = 1;\n if(high < 1)\n high = 1;\n\n int low_st = lower_bound(s.begin(), s.end(), low) - s.begin();\n int low_en = lower_bound(e.begin(), e.end(), low) - e.begin();\n\n int high_st = lower_bound(s.begin(), s.end(), high) - s.begin();\n int high_en = lower_bound(e.begin(), e.end(), high) - e.begin();\n\n int l, r;\n\n if(low_st > low_en && low < e[low_en] /*handle edge*/ ) {\n l = low_st - 1;\n ans = s[l] - low;\n }\n else l = low_st;\n\n if(high_st > high_en && high <= e[high_en] ) {\n r = high_en;\n ans += high - e[r];\n }\n else r = high_en-1;\n\n ans += val[r+1] - val[l];\n\n return ans;\n}\n\nsigned main(){\n fastIO();\n\n int t, n;\n cin >> t >> n;\n val.push_back(0);\n for (int i = 0; i < n; ++i) {\n int l, r;\n cin >> l >> r;\n l++, r++;\n s.push_back(l);\n e.push_back(r);\n val.push_back(r-l + val.back());\n }\n int ans = 0;\n for (int i = 0; i < n; ++i) {\n ans = max(ans, calc(s[i], s[i]+t));\n ans = max(ans, calc(e[i], e[i]+t));\n ans = max(ans, calc(s[i], s[i]-t));\n ans = max(ans, calc(e[i], e[i]-t));\n\n }\n cout << ans << endl;\n\n\n}","accuracy":1,"time_ms":50,"memory_kb":5664,"score_of_the_acc":-0.3052,"final_rank":5},{"submission_id":"aoj_2801_8322238","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nlong long N, T;\nlong long A[1 << 18];\nlong long B[1 << 18];\nlong long C[1 << 18];\n\nint main() {\n\t// Step 1. Input\n\tcin >> T >> N;\n\tfor (int i = 1; i <= N; i++) cin >> A[i] >> B[i];\n\tfor (int i = 1; i <= N; i++) C[i] = B[i] - A[i];\n\tfor (int i = 1; i <= N; i++) C[i] += C[i - 1];\n\n\t// Step 2. Brute Force\n\tlong long Answer = 0;\n\tfor (int i = 1; i <= N; i++) {\n\t\tint pos1 = lower_bound(A + 1, A + N + 1, A[i] + T) - A;\n\t\tpos1 -= 1;\n\t\tlong long tm1 = C[pos1 - 1] - C[i - 1];\n\t\tlong long tm2 = max(0LL, min(A[i] + T, B[pos1]) - A[pos1]);\n\t\tAnswer = max(Answer, tm1 + tm2);\n\t}\n\tcout << Answer << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":8296,"score_of_the_acc":-0.569,"final_rank":17},{"submission_id":"aoj_2801_7099229","code_snippet":"#include <iostream>\n#include <map>\nusing namespace std;\n\nmap<long long int,long long int> ms;\nmap<long long int,int> top;\nlong long int sums[100003];\n\nint main() {\n\t// your code goes here\n\tlong long int s1=0,t1;\n\tint n1;\n\tcin>>t1;\n\tcin>>n1;\n\tfor(int i=0;i<n1;i++){\n\t\tlong long int s,e;\n\t\tcin>>s>>e;\n\t\tms[s]=e;\n\t\tsums[i]=s1;\n\t\ttop[s]=i;\n\t\ts1+=(e-s);\n\t}\n\tlong long int ans=0;\n\tmap<long long int,long long int>::iterator it1,it2;\n\tfor(it1=ms.begin();it1!=ms.end();it1++){\n\t\tlong long int s2,t2;\n\t\tt2=(*it1).first+t1;\n\t\tit2=ms.upper_bound(t2);\n\t\tif(it2!=ms.begin())it2--;\n\t\tlong long int te,ts,anst;\n\t\tte=(*it2).second;\n\t\tts=(*it2).first;\n\t\tanst=sums[top[ts]]-sums[top[(*it1).first]];\n\t\tte=(te>t2?t2:te);\n\t\tanst+=(te-ts);\n\t\tans=ans>anst?ans:anst;\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":170,"memory_kb":16384,"score_of_the_acc":-1.9083,"final_rank":20},{"submission_id":"aoj_2801_4495049","code_snippet":"#include<stdio.h>\nint main()\n{\n int n,i;\n long long hi,s[100010],t[100010];\n \n scanf(\"%lld %d\",&hi,&n);\n for(i=0;i<n;i++) scanf(\"%lld %lld\",&s[i],&t[i]);\n \n int m=0;\n long long head=s[0],sum=0,ans=0;\n for(i=0;i<n;i++){\n sum += t[i]-s[i];\n while(t[i]-head > hi){\n if(s[m] <= t[i]-hi && t[i]-hi < t[m]){\n head = t[i]-hi;\n sum -= head-s[m];\n } else {\n sum -= t[m]-head;\n m++;\n head = s[m];\n }\n }\n if(ans < sum) ans = sum;\n }\n printf(\"%lld\\n\",ans);\n \n return(0);\n}","accuracy":1,"time_ms":20,"memory_kb":4260,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2801_4495032","code_snippet":"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n int n;\n long long hi,s[100010],t[100010];\n \n cin >> hi >> n;\n for(int i=0;i<n;i++) cin >> s[i] >> t[i];\n \n int m=0;\n long long head=s[0],sum=0,ans=0;\n for(int i=0;i<n;i++){\n sum += t[i]-s[i];\n while(t[i]-head > hi){\n if(s[m] <= t[i]-hi && t[i]-hi < t[m]){\n head = t[i]-hi;\n sum -= head-s[m];\n } else {\n sum -= t[m]-head;\n m++;\n head = s[m];\n }\n }\n ans = max(ans,sum);\n }\n cout << ans << endl;\n \n return(0);\n}","accuracy":1,"time_ms":70,"memory_kb":4664,"score_of_the_acc":-0.3636,"final_rank":8},{"submission_id":"aoj_2801_4488309","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n// macro\n#define rep(i,n) for(i=0;i<n;i++)\n#define ll long long\n#define all(v) v.begin(), v.end()\n\n// code starts\nint main()\n{\n ll tl;cin>>tl;\n ll n;cin>>n;\n vector<ll> s(n);\n vector<ll> t(n);\n ll i;\n rep(i,n)cin>>s[i]>>t[i];\n vector<ll> sum(n+1,0);\n rep(i,n)\n {\n sum[i+1]=sum[i]+(t[i]-s[i]);\n }\n ll ans=0;\n map<ll,ll> m;\n rep(i,n)\n {\n m.insert({s[i],i});\n m.insert({t[i],i});\n }\n rep(i,n)\n {\n ll kans=0;\n ll kst=s[i];\n ll kend=kst+tl;\n auto it=m.lower_bound(kend);\n if(it==m.end())\n {\n ll low=max(i,(ll)0);\n kans=sum[n]-sum[low];\n }\n else\n {\n pair<ll,ll> p;\n p=*it;\n ll time,ind;\n time=p.first;\n ind=p.second;\n if(s[ind]==time)\n {\n kans=sum[ind]-sum[i];\n }\n else\n {\n kans=sum[ind]-sum[i];\n kans+=kend-s[ind];\n }\n }\n ans=max(ans,kans);\n }\n /*\n rep(i,n)\n {\n ll kans=0;\n ll kst=s[i];\n ll kend=s[i]+tl-1;\n ll inds=lower_bound(all(s),kend)-s.begin();\n ll indt=lower_bound(all(t),kend)-t.begin();\n inds--;\n indt--;\n if(s[inds]<=t[indt])\n {\n kans+=sum[indt+1]-sum[i];\n }\n else\n {\n kans+=sum[indt+1]-sum[i];\n kans+=kend-t[inds]+1;\n }\n ans=max(ans,kans);\n }*/\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":140,"memory_kb":17608,"score_of_the_acc":-1.8,"final_rank":19},{"submission_id":"aoj_2801_4488188","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\nusing namespace std;\ntypedef long long int lli;\ntypedef pair<lli, lli> pll;\n\nint main(){\n lli t,n;\n cin >> t >> n;\n\n vector<pair<lli, lli>> p(n);\n for(int i=0; i<n; i++){\n cin >> p[i].first >> p[i].second;\n }\n\n vector<lli> len(n+1, 0);\n for(int i=0; i<n; i++){\n len[i+1] = len[i] +p[i].second -p[i].first;\n }\n lli ans = 0;\n for(int i=0; i<n; i++){\n lli b = p[i].first;\n lli e = b+t;\n int idx = lower_bound(p.begin(), p.end(), pll(e, 0)) -p.begin() -1;\n lli sub = len[idx] -len[i];\n if(p[idx].first < e){\n sub += min(e-p[idx].first, p[idx].second-p[idx].first);\n }\n ans = max(ans, sub);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":5208,"score_of_the_acc":-0.471,"final_rank":13},{"submission_id":"aoj_2801_4488074","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define ll long long\n#define pp pair<ll,ll>\n#define ld long double\n#define all(a) (a).begin(),(a).end()\n#define mk make_pair\nll MOD=998244353;\nint inf=1000001000;\nll INF=1e18+5;\nll mod=INF;\n\n\nint main() {\n ll T;\n int n;\n cin >> T >> n;\n vector<ll> s(n),t(n);\n rep(i,n) cin >> s[i] >> t[i];\n s.push_back(INF);\n int r=1,m=0;\n ll u=0,ans=0;\n rep(i,n){\n while(true){\n if (r==1){\n if (s[i]+T<s[m]) break;\n u+=t[m]-s[m];\n m++;\n r=0;\n }\n else if (r==0){\n if (s[i]+T<t[m-1]) break;\n r=1;\n }\n }\n if (r==0) ans=max(ans,u-(t[m-1]-s[i]-T));\n else ans=max(ans,u);\n u-=t[i]-s[i];\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":5276,"score_of_the_acc":-0.4094,"final_rank":9},{"submission_id":"aoj_2801_4488036","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\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; }\nconst ll INF=1LL<<60;\nconst int inf=(1<<30)-1;\nconst int mod=1e9+7;\nint dx[8]={1,0,-1,0,-1,-1,1,1};\nint dy[8]={0,1,0,-1,-1,1,-1,1};\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n ll t;cin >> t;\n int n;cin >> n;\n vector<ll> s(n),e(n),sum(n+1);\n ll ans=0;\n for(int i=0;i<n;i++){\n cin >> s[i] >> e[i];\n sum[i+1]=sum[i]+e[i]-s[i];\n }\n for(int i=0;i<n;i++){\n int u=lower_bound(s.begin(),s.end(),s[i]+t)-s.begin();\n int v=lower_bound(e.begin(),e.end(),s[i]+t)-e.begin();\n if(u==v){\n chmax(ans,sum[u]-sum[i]);\n }\n else{\n chmax(ans,sum[v]-sum[i]+t+s[i]-s[v]);\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":5220,"score_of_the_acc":-0.0719,"final_rank":2},{"submission_id":"aoj_2801_3987470","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n\nsigned main(){\n ios::sync_with_stdio(false);\n\tcin.tie(0);\n cout << fixed << setprecision(20);\n\n int64_t R, n;\n cin >> R;\n cin >> n;\n vector<int64_t> S(n), T(n);\n\n for (int i = 0; i < n; i++)\n cin >> S[i] >> T[i];\n\n vector<int64_t> csum(n + 1);\n for (int i = 0; i < n - 1; i++){\n csum[i + 1] = csum[i] + S[i + 1] - T[i];\n }\n csum[n] = csum[n - 1];\n\n int64_t ma = 0;\n for (int i = 0; i < n; i++){\n int l = i - 1, r = n;\n while (r - l > 1){\n int mid = (l + r) / 2;\n if (S[i] + R > S[mid]){\n l = mid;\n } else {\n r = mid;\n }\n }\n\n if (l == i - 1)\n ma = R;\n else {\n ma = max(ma, R - (csum[l] - csum[i] + max(0L, S[i] + R - T[l]))); \n }\n }\n cout << ma << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":5256,"score_of_the_acc":-0.0746,"final_rank":3},{"submission_id":"aoj_2801_3858205","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < n; i++)\n#define else(x) if (!(x))\n\nint main() {\n ll T, N, res = 0;\n cin >> T >> N;\n ll A[N], B[N];\n ll S[N + 1];\n S[0] = 0;\n rep(i, N) cin >> A[i] >> B[i], S[i + 1] = S[i] + B[i] - A[i];\n\n rep(i, N) {\n ll l = -1, r = N;\n while (r - l > 1) {\n ll m = (l + r) / 2;\n if (A[m] < A[i] + T) {\n l = m;\n } else {\n r = m;\n }\n }\n ll time = S[l] - S[i] + min(B[l], A[i] + T) - A[l];\n res = max(res, time);\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":80,"memory_kb":5428,"score_of_the_acc":-0.4875,"final_rank":14},{"submission_id":"aoj_2801_3249635","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2801.cc: Suntan\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_M = MAX_N * 2;\n\n/* typedef */\n\ntypedef long long ll;\n\n/* global variables */\n\nll as[MAX_N], bs[MAX_N], ss[MAX_N + 1];\n\n/* subroutines */\n\n\n/* main */\n\nint main() {\n ll t;\n int n;\n scanf(\"%lld%d\", &t, &n);\n\n for (int i = 0; i < n; i++) {\n scanf(\"%lld%lld\", as + i, bs + i);\n ss[i + 1] = ss[i] + (bs[i] - as[i]);\n }\n\n ll maxl = 0;\n for (int i = 0; i < n; i++) {\n ll ti = as[i] + t;\n int k = upper_bound(bs, bs + n, ti) - bs;\n //printf(\"k=%d\\n\", k);\n\n ll l = ss[k] - ss[i];\n if (k < n && as[k] < ti) l += ti - as[k];\n if (maxl < l) maxl = l;\n }\n\n printf(\"%lld\\n\", maxl);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":5556,"score_of_the_acc":-0.0971,"final_rank":4},{"submission_id":"aoj_2801_2974528","code_snippet":"#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint main() {\n\tlong long int T, N, temp[10][100100], temp2 = 0, ans = 0, i, j = 0, tempT, temp3 = 0;\n\n\tcin >> T >> N;\n\n\tfor (i = 0; i < N; i++) {\n\t\tcin >> temp[0][i] >> temp[1][i];\n\t}\n\n\n\tfor (i = 0; i < N; i++) {\n\t\ttempT = temp[0][i] + T; \n\t\tif (i != 0) { ans -= temp[1][i - 1] - temp[0][i - 1] + temp3;}\n\n\t\twhile (j < N && temp[1][j] <= tempT) {\n\t\t\tans += temp[1][j] - temp[0][j];\n\t\t\tj++;\n\t\t}\n\t\tif (j < N && temp[0][j] <= tempT) {\n\t\t\ttemp3 = tempT - temp[0][j]; \n\t\t\tans += temp3;\n\t\t}\n\t\telse temp3 = 0;\n\t\ttemp2 = max(temp2, ans);\n\t}\n\tcout << temp2 << endl;\n\n\t//cin >> T;\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":4648,"score_of_the_acc":-0.5624,"final_rank":16},{"submission_id":"aoj_2801_2974038","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nsigned main(){\n int T,n;\n int s[100010],t[100010];\n cin>>T>>n;\n for(int i=0;i<n;i++){\n cin>>s[i]>>t[i];\n }\n int l=0,r=0;\n int sum=0;\n int ans=0;\n for(;l<n;l++){\n if(t[l]-s[l]>=T){\n ans=T;\n break;\n }\n for(;r<n;r++){\n if(t[r]>s[l]+T)break;\n sum+=t[r]-s[r];\n }\n if(t[r]>s[l]+T)ans=max(ans,sum+max(0LL,s[l]+T-s[r]));\n ans=max(ans,sum);\n sum-=t[l]-s[l];\n }\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":4660,"score_of_the_acc":-0.43,"final_rank":11},{"submission_id":"aoj_2801_2974028","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\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;}\n\n//INSERT ABOVE HERE\nsigned main(){\n Int t,n;\n cin>>t>>n;\n vector<Int> a(n),b(n);\n for(Int i=0;i<n;i++) cin>>a[i]>>b[i];\n vector<Int> s(n+1);\n for(Int i=0;i<n;i++) s[i+1]=s[i]+(b[i]-a[i]);\n\n Int ans=0;\n for(Int i=0;i<n;i++){\n Int k=lower_bound(b.begin(),b.end(),a[i]+t)-b.begin();\n Int res=s[k]-s[i];\n if(k<n) res+=max((Int)0,(a[i]+t)-a[k]);\n chmax(ans,res);\n //cout<<i<<\":\"<<k<<\":\"<<res<<endl; \n }\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":5200,"score_of_the_acc":-0.4704,"final_rank":12},{"submission_id":"aoj_2801_2914848","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n//namespace cent {\n//\n//\tstruct Edge {\n//\t\tint src;\n//\t\tint dst;\n//\t\tlong long int cost;\n//\t};\n//\tusing Graph = vector<vector<Edge>>;\n//\n//\tclass Centroid {\n//\tprivate:\n//\t\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tint sum = 1;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ch_nums[now] = sum;\n//\t\t}\n//\n//\t\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tfor (auto&& e : graph[pre_root]) {\n//\t\t\t\tif (e.dst == pre_from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\n//\t\t\t}\n//\t\t\treturn pre_root;\n//\t\t}\n//\n//\t\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\n//\t\t\tmp[make_pair(root,now)]=depth;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tdfs2(g,root,e.dst,e.src,oks,depth+1);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t};\n//\n//\n//\t\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\n//\t\t\tdfs(graph, root, from, ch_nums, oks);\n//\n//\t\t\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\n//\n//\n//\t\t\tdfs2(graph,cent_id,cent_id,-1,oks,0);\n//\t\t\tlens1[cent_id][make_pair(0,0)]--;\n//\t\t\tlens2[cent_id][0]--;\n//\n//\n//\t\t\toks[cent_id] = depth;\n//\n//\t\t\t//for (auto&& e : graph[cent_id]) {\n//\t\t\t//\tif (e.dst == from)continue;\n//\t\t\t//\tif (oks[e.dst] != -1)continue;\n//\n//\t\t\t//\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\n//\n//\t\t\t//\tfor (auto&& l1 : lens1[e.dst]) {\n//\t\t\t//\t\tint keta = l1.first.second;\n//\t\t\t//\t\tlong long int num = l1.first.first;\n//\n//\t\t\t//\t\tlong long int need = (mod - num) / mod_pow(10, keta);\n//\t\t\t//\t\tneed%=mod;\n//\t\t\t//\t\tauto it = lens2[e.dst].find(need);\n//\t\t\t//\t\tif (it != lens2[e.dst].end()) {\n//\t\t\t//\t\t\tans -= l1.second*it->second;\n//\t\t\t//\t\t}\n//\t\t\t//\t}\n//\t\t\t//\tlens1[e.dst].clear();\n//\t\t\t//\tlens2[e.dst].clear();\n//\t\t\t//}\n//\n//\t\t\tif (from != -1) {\n//\t\t\t\tcentroid_edges[from].push_back(cent_id);\n//\t\t\t}\n//\t\t\telse {\n//\t\t\t\tfst_centroid = cent_id;\n//\t\t\t}\n//\t\t\tfor (auto&& e : graph[cent_id]) {\n//\t\t\t\tif (e.dst == from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\n//\t\t\t}\n//\t\t}\n//\n//\tpublic:\n//\n//\t\tmap<pair<int,int>,int>mp;\n//\n//\t\tvector<map<pair<long long int,int>, long long int>>lens1;\n//\t\tvector<map<long long int, long long int>>lens2;\n//\t\tvector<vector<int>> centroid_graph;\n//\t\tvector<int>ts;\n//\t\tvector<int>parents;\n//\t\tvector<int>oks;\n//\t\tvector<int>anss;\n//\n//\t\t//fst:root snd:centroid_graph\n//\t\tvoid init(const Graph&g) {\n//\t\t\tlens1.resize(g.size());\n//\t\t\tlens2.resize(g.size());\n//\t\t\toks = vector<int>(g.size(), -1);\n//\t\t\tint root = -1;\n//\t\t\tcentroid_graph.resize(g.size());\n//\t\t\tparents = vector<int>(g.size(), -1);\n//\t\t\tts=vector<int>(g.size(),-1);\n//\t\t\tanss=vector<int>(g.size(),100000);\n//\n//\t\t\tvector<int>ch_nums(g.size());\n//\t\t\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\n//\n//\t\t\tfor (int i = 0; i < centroid_graph.size(); ++i) {\n//\t\t\t\tfor (auto&& e : centroid_graph[i]) {\n//\t\t\t\t\tparents[e] = i;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ;\n//\t\t}\n//\t}centroid;\n//\n//\n//\tvoid addEdge(Graph& g, int a, int b, long long int c) {\n//\t\tg[a].push_back(Edge{ a,b,c });\n//\t\tg[b].push_back(Edge{ b,a,c });\n//\t}\n//}\n\n\n//const int mod = 1000000007;\n//struct Mod {\n//public:\n//\tint num;\n//\tMod() : Mod(0) { ; }\n//\tMod(long long int n) : num((n % mod + mod) % mod) {\n//\t\tstatic_assert(mod<INT_MAX / 2, \"mod is too big, please make num 'long long int' from 'int'\");\n//\t}\n//\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\n//\toperator int() { return num; }\n//};\n//\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\n//Mod operator++(Mod &a) { return a + Mod(1); }\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\n//Mod operator--(Mod &a) { return a - Mod(1); }\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\n//Mod operator^(const Mod a, const int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = (a * a) ^ (n / 2);\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//Mod mod_pow(const Mod a, const long long int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = mod_pow((a * a), (n / 2));\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\n//Mod operator/(const Mod a, const Mod b) {\n//\tassert(b.num != 0);\n//\treturn a * inv(b);\n//}\n//Mod operator/(const long long int a, const Mod b) {\n//\treturn Mod(a) / b;\n//}\n//Mod operator/=(Mod &a, const Mod b) {\n//\treturn a = a / b;\n//}\n//\n//#define MAX_MOD_N 1024000\n//\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\n//void init(const int amax = MAX_MOD_N) {\n//\tfact[0] = Mod(1); factinv[0] = 1;\n//\tfor (int i = 0; i < amax - 1; ++i) {\n//\t\tfact[i + 1] = fact[i] * Mod(i + 1);\n//\t\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\n//\t}\n//}\n//Mod comb(const int a, const int b) {\n//\treturn fact[a] * factinv[b] * factinv[a - b];\n//}\n//\n//vector<int>primes;\n//void hurui(const int amax=3500) {\n//\tstatic bool flag = false;\n//\tif (flag)return;\n//\tvector<int>sos;\n//\tsos = vector<int>(amax + 1, true);\n//\tsos[0] = false; sos[1] = false;\n//\tfor (int i = 2; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\n//\t\t}\n//\t}\n//\tfor (int i = 0; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tprimes.push_back(i);\n//\t\t}\n//\t}\n//\tflag = true;\n//}\n//\n//\n//struct query {\n//\tint u;\n//\tint v;\n//\tmap<int,int>mp;\n//};\n//\n//map<int, int>mk_mp(const int a) {\n//\tint rest(a);\n//\tmap<int,int>as;\n//\tfor (auto pr : primes) {\n//\t\twhile (rest%pr == 0) {\n//\t\t\tas[pr]++;\n//\t\t\trest /= pr;\n//\t\t}\n//\t}\n//\tif (rest!=1)as[rest]++;\n//\treturn as;\n//}\n//\n//#define Seg_Max_N (1<<18) \n//\n//class Tree {\n//public:\n//\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\n//\t\tT.resize(V);\n//\t\tfor (int i = 0; i < MAXLOGV; i++) {\n//\t\t\tparent[i].resize(V);\n//\t\t}\n//\t\tdepth.resize(V);\n//\t}\n//\t// uとvをつなぐ\n//\t// lcaを求めることが主目的なので無向グラフとしている\n//\tvoid unite(int u, int v) {\n//\t\tT[u].push_back(v);\n//\t\tT[v].push_back(u);\n//\t}\n//\tvoid unite(vector<vector<int>>&e) {\n//\t\tT = e;\n//\t}\n//\t// initする\n//\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\n//\tvoid init() {\n//\t\tdfs(root, 0, 0);\n//\t\tint id = 0;\n//\t\tgetid(root, 0, id);\n//\t}\n//\t// uとvのlcaを求める\n//\tint lca(int u, int v) const {\n//\t\tif (depth[u] > depth[v]) swap(u, v);\n//\t\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\t// uとvの距離を求める\n//\t// edgeを定義しないといけない時はこれじゃダメ\n//\tint dist(int u, int v) const {\n//\t\tint p = lca(u, v);\n//\t\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\n//\t}\n//\tint dfs(int v, int p, int d) {\n//\t\tparent[0][v] = p;\n//\t\tdepth[v] = d;\n//\t\tcnum[v] = 0;\n//\t\tfor (int i = 1; i < MAXLOGV; i++) {\n//\t\t\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\n//\t\t}\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) cnum[v] += dfs(next, v, d + 1);\n//\t\t}\n//\t\treturn cnum[v] + 1;\n//\t}\n//\n//\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) dfs2(next, v, doubles, nums);\n//\t\t}\n//\t\tdoubles[0][v] = nums[v];\n//\t\tfor (int j = 1; j < MAXLOGV; ++j) {\n//\t\t\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\n//\t\t}\n//\t\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\n//\t\t\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\n//\t\t}\n//\t}\n//\t//ここでは親から距離2^iの部分木の最小値を求めている\n//\tvector<vector<int>>get_doubles(const vector<int>&nums) {\n//\t\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\n//\t\tdfs2(root, -1, doubles, nums);\n//\t\treturn doubles;\n//\t}\n//\n//\tvoid getid(const int v, const int p, int &nplace) {\n//\t\tplace[v] = nplace;\n//\t\tid[nplace] = v;\n//\t\tnplace++;\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) getid(next, v, nplace);\n//\t\t}\n//\t}\n//\tstatic const int MAXLOGV = 25;\n//\t// グラフの隣接リスト表現\n//\tvector<vector<int> > T;\n//\t// 頂点の数\n//\tint V;\n//\t// 根ノードの番号\n//\tint root;\n//\n//\t// 親ノード\n//\tvector<int> parent[MAXLOGV];\n//\t// 根からの深さ\n//\tvector<int> depth;\n//\n//\t//子の数\n//\tvector<int>cnum;\n//\n//\t//変換\n//\tvector<int>place;\n//\tvector<int>id;\n//\n//};\n//\n//vector<int>pas;\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\n//\ttos[now]=id;\n//\tlrs[tos[now]].first=id++;\n//\tfor (auto e : edges[now]) {\n//\t\tif (e == from) {\n//\t\t\tpas[now] = from;\n//\t\t\tcontinue;\n//\t\t}\n//\t\tadfs(lrs,tos,edges,e,now,id);\n//\t}\n//\tlrs[tos[now]].second=id;\n//}\n//\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\n//\tpas.resize(tos.size());pas[0]=-1;\n//\tvector<pair<int,int>>lrs(edges.size());\n//\tint id=0;\n//\tadfs(lrs,tos,edges,0,-1,id);\n//\treturn lrs;\n//}\n\n\nnamespace FastFourierTransform\n{\n\tusing C = complex< double >;\n\n\tvoid DiscreteFourierTransform(vector< C > &F, bool rev)\n\t{\n\t\tconst int N = (int)F.size();\n\t\tconst double PI = (rev ? -1 : 1) * acos(-1);\n\t\tfor (int i = 0, j = 1; j + 1 < N; j++) {\n\t\t\tfor (int k = N >> 1; k > (i ^= k); k >>= 1);\n\t\t\tif (i > j) swap(F[i], F[j]);\n\t\t}\n\t\tC w, s, t;\n\t\tfor (int i = 1; i < N; i <<= 1) {\n\t\t\tfor (int k = 0; k < i; k++) {\n\t\t\t\tw = polar(1.0, PI / i * k);\n\t\t\t\tfor (int j = 0; j < N; j += i * 2) {\n\t\t\t\t\ts = F[j + k];\n\t\t\t\t\tt = C(F[j + k + i].real() * w.real() - F[j + k + i].imag() * w.imag(),\n\t\t\t\t\t\tF[j + k + i].real() * w.imag() + F[j + k + i].imag() * w.real());\n\t\t\t\t\tF[j + k] = s + t, F[j + k + i] = s - t;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (rev) for (int i = 0; i < N; i++) F[i] /= N;\n\t}\n\n\tvector< int> Multiply(const vector< int > &A, const vector<int > &B)\n\t{\n\t\tint sz = 1;\n\t\twhile (sz <= A.size() + B.size()) sz <<= 1;\n\t\tvector< C > F(sz), G(sz);\n\t\tfor (int i = 0; i < A.size(); i++) F[i] = A[i];\n\t\tfor (int i = 0; i < B.size(); i++) G[i] = B[i];\n\t\tDiscreteFourierTransform(F, false);\n\t\tDiscreteFourierTransform(G, false);\n\t\tfor (int i = 0; i < sz; i++) F[i] *= G[i];\n\t\tDiscreteFourierTransform(F, true);\n\t\tvector< int > X(A.size() + B.size() - 1);\n\t\tfor (int i = 0; i < A.size() + B.size() - 1; i++) X[i] = F[i].real() + 0.5;\n\t\treturn (X);\n\t}\n};\n\n\n\nint main()\n{\n\tlong long int T;cin>>T;\n\tint N;cin>>N;\n\tvector<pair<long long int,long long int>>ps;\n\tvector<long long int>sums(N+1);\n\tsums[0]=0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tlong long int l,r;cin>>l>>r;\n\t\tps.emplace_back(l,r);\n\t\tsums[i+1]=sums[i]+r-l;\n\t}\n\tlong long int ans=0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tauto it=lower_bound(ps.begin(),ps.end(),make_pair(ps[i].first+T,0ll));\n\t\tint j=it-ps.begin()-1;\n\t\tauto p(ps[j]);\n\t\tif (p.second < ps[i].first + T) {\n\n\t\t\tlong long int nans = sums[j]-sums[i] + ps[j].second-ps[j].first;\n\t\t\tans=max(ans,nans);\n\t\t}\n\t\telse {\n\n\t\t\tlong long int nans = sums[j]-sums[i] + ps[i].first + T - ps[j].first;\n\t\t\tans=max(ans,nans);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":5708,"score_of_the_acc":-0.5751,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_2801_10570469\",\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\\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\\nbool ispali(int n){\\n string s = to_string(n);\\n string t = s;\\n reverse(all(t));\\n return s == t;\\n}\\n\\nconst int iinf = 1e9;\\n\\nvoid solve(){\\n ll t; cin >> t;\\n int n; cin >> n;\\n vector<ll> a;\\n rep(i,0,n){\\n ll l, r; cin >> l >> r;\\n a.push_back(l);\\n a.push_back(r);\\n }\\n vector<ll> rui(n*2+1);\\n rep(i,0,n*2){\\n rui[i+1] = rui[i] + (i % 2 == 0 ? 0 : a[i] - a[i-1]);\\n }\\n rui.erase(rui.begin());\\n rui.push_back(rui.back());\\n ll ans = 0;\\n rep(i,0,n*2){\\n ll le = a[i];\\n ll ri = le + t;\\n int id = lower_bound(all(a),ri) - a.begin();\\n if (id % 2 == 0){\\n chmax(ans,rui[id]-rui[i]);\\n }\\n else {\\n chmax(ans,rui[id-1]-rui[i] +ri-a[id-1]);\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nint main(){\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 7120,\n \"score_of_the_acc\": -0.4143,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2801_10570434\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint main() {\\n\\tll t;cin>>t;\\n\\tll n;cin>>n;\\n\\tvector<ll>s(n),tt(n);\\n\\tvector<ll>v;\\n\\tfor (int i=0;i<n;i++){\\n\\t\\tcin>>s[i]>>tt[i];\\n\\t\\tv.push_back(s[i]);\\n\\t\\tv.push_back(tt[i]);\\n\\t}\\n\\t\\n\\tv.push_back((ll)1e17);\\n\\t\\n\\tvector<ll> tar(2*n+1);\\n\\tfor (int i=0;i<n;i++) {\\n\\t\\tif(i>0)tar[2*i]=tar[2*i-1]+tt[i-1]-s[i-1];\\n\\t\\ttar[2*i+1]=tar[2*i];\\n\\t}\\n\\ttar[2*n]=tar[2*n-1]+tt[n-1]-s[n-1];\\n\\t\\n\\tll ans=0;\\n\\tfor(int i=0;i<n;i++) {\\n\\t\\tint idx=int(upper_bound(v.begin(),v.end(),s[i]+t)-v.begin());\\n\\t\\t//cout<<idx<<endl;\\n\\t\\tif (idx%2==0){\\n\\t\\t\\t//ending\\n\\t\\t\\tans=max(ans,tar[idx]-tar[2*i]);\\t\\n\\t\\t\\t//cout<<tar[idx]-tar[2*i]<<endl;\\n\\t\\t}else{\\n\\t\\t\\t//starting\\n\\t\\t\\tans=max(ans,tar[idx]+s[i]+t-s[idx/2]-tar[2*i]);\\n\\t\\t\\t//cout<<tar[idx]+s[i]+t-s[idx/2]-tar[2*i]<<endl;\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl;\\n\\t\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 7812,\n \"score_of_the_acc\": -0.5328,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2801_9675324\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvoid fileIO(void) {\\n#ifndef ONLINE_JUDGE\\n freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n freopen(\\\"output.txt\\\", \\\"w\\\", stdout);\\n#endif\\n}\\n\\nvoid fastIO(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }\\n# define int long long\\n\\nvector<int> s;\\nvector<int> e;\\nvector<int> val;\\nint calc(int low, int high){\\n int ans = 0;\\n\\n int low_st = lower_bound(s.begin(), s.end(), low) - s.begin();\\n int low_en = lower_bound(e.begin(), e.end(), low) - e.begin();\\n\\n int high_st = lower_bound(s.begin(), s.end(), high) - s.begin();\\n int high_en = lower_bound(e.begin(), e.end(), high) - e.begin();\\n\\n int l, r;\\n\\n if(low_st > low_en && low < e[low_en] /*handle edge*/ ) {\\n l = low_st - 1;\\n ans = s[l] - low;\\n }\\n else l = low_st;\\n\\n if(high_st > high_en && high <= e[high_en] ) {\\n r = high_en;\\n ans += high - e[r];\\n }\\n else r = high_en-1;\\n\\n ans += val[r+1] - val[l];\\n\\n return ans;\\n}\\n\\nsigned main(){\\n fastIO();\\n\\n int t, n;\\n cin >> t >> n;\\n val.push_back(0);\\n for (int i = 0; i < n; ++i) {\\n int l, r;\\n cin >> l >> r;\\n l++, r++;\\n s.push_back(l);\\n e.push_back(r);\\n val.push_back(r-l + val.back());\\n }\\n int ans = 0;\\n for (int i = 0; i < n; ++i) {\\n ans = max(ans, calc(s[i], s[i]+t));\\n ans = max(ans, calc(e[i], e[i]+t));\\n ans = max(ans, calc(s[i]-t, s[i] ));\\n ans = max(ans, calc(e[i]-t, e[i]));\\n }\\n cout << ans << endl;\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5712,\n \"score_of_the_acc\": -0.3088,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2801_9675321\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvoid fileIO(void) {\\n#ifndef ONLINE_JUDGE\\n freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n freopen(\\\"output.txt\\\", \\\"w\\\", stdout);\\n#endif\\n}\\n\\nvoid fastIO(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }\\n# define int long long\\n\\nvector<int> s;\\nvector<int> e;\\nvector<int> val;\\nint calc(int low, int high){\\n int ans = 0;\\n\\n if(low < 1)\\n low = 1;\\n\\n int low_st = lower_bound(s.begin(), s.end(), low) - s.begin();\\n int low_en = lower_bound(e.begin(), e.end(), low) - e.begin();\\n\\n int high_st = lower_bound(s.begin(), s.end(), high) - s.begin();\\n int high_en = lower_bound(e.begin(), e.end(), high) - e.begin();\\n\\n int l, r;\\n\\n if(low_st > low_en && low < e[low_en] /*handle edge*/ ) {\\n l = low_st - 1;\\n ans = s[l] - low;\\n }\\n else l = low_st;\\n\\n if(high_st > high_en && high <= e[high_en] ) {\\n r = high_en;\\n ans += high - e[r];\\n } \\n else r = high_en-1;\\n\\n ans += val[r+1] - val[l];\\n\\n return ans;\\n}\\n\\nsigned main(){\\n fastIO();\\n\\n int t, n;\\n cin >> t >> n;\\n val.push_back(0);\\n for (int i = 0; i < n; ++i) {\\n int l, r;\\n cin >> l >> r;\\n l++, r++;\\n s.push_back(l);\\n e.push_back(r);\\n val.push_back(r-l + val.back());\\n }\\n int ans = 0;\\n for (int i = 0; i < n; ++i) {\\n ans = max(ans, calc(s[i], s[i]+t));\\n ans = max(ans, calc(e[i], e[i]+t));\\n ans = max(ans, calc(s[i]-t, s[i] ));\\n ans = max(ans, calc(e[i]-t, e[i]));\\n\\n }\\n cout << ans << endl;\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5664,\n \"score_of_the_acc\": -0.3052,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2801_9670795\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvoid fileIO(void) {\\n#ifndef ONLINE_JUDGE\\n freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n freopen(\\\"output.txt\\\", \\\"w\\\", stdout);\\n#endif\\n}\\n\\nvoid fastIO(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }\\n# define int long long\\n\\nvector<int> s;\\nvector<int> e;\\nvector<int> val;\\nint calc(int low, int high){\\n int ans = 0;\\n\\n if(low < 1)\\n low = 1;\\n if(high < 1)\\n high = 1;\\n\\n int low_st = lower_bound(s.begin(), s.end(), low) - s.begin();\\n int low_en = lower_bound(e.begin(), e.end(), low) - e.begin();\\n\\n int high_st = lower_bound(s.begin(), s.end(), high) - s.begin();\\n int high_en = lower_bound(e.begin(), e.end(), high) - e.begin();\\n\\n int l, r;\\n\\n if(low_st > low_en && low < e[low_en] /*handle edge*/ ) {\\n l = low_st - 1;\\n ans = s[l] - low;\\n }\\n else l = low_st;\\n\\n if(high_st > high_en && high <= e[high_en] ) {\\n r = high_en;\\n ans += high - e[r];\\n }\\n else r = high_en-1;\\n\\n ans += val[r+1] - val[l];\\n\\n return ans;\\n}\\n\\nsigned main(){\\n fastIO();\\n\\n int t, n;\\n cin >> t >> n;\\n val.push_back(0);\\n for (int i = 0; i < n; ++i) {\\n int l, r;\\n cin >> l >> r;\\n l++, r++;\\n s.push_back(l);\\n e.push_back(r);\\n val.push_back(r-l + val.back());\\n }\\n int ans = 0;\\n for (int i = 0; i < n; ++i) {\\n ans = max(ans, calc(s[i], s[i]+t));\\n ans = max(ans, calc(e[i], e[i]+t));\\n ans = max(ans, calc(s[i], s[i]-t));\\n ans = max(ans, calc(e[i], e[i]-t));\\n\\n }\\n cout << ans << endl;\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5664,\n \"score_of_the_acc\": -0.3052,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2801_8322238\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nlong long N, T;\\nlong long A[1 << 18];\\nlong long B[1 << 18];\\nlong long C[1 << 18];\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> T >> N;\\n\\tfor (int i = 1; i <= N; i++) cin >> A[i] >> B[i];\\n\\tfor (int i = 1; i <= N; i++) C[i] = B[i] - A[i];\\n\\tfor (int i = 1; i <= N; i++) C[i] += C[i - 1];\\n\\n\\t// Step 2. Brute Force\\n\\tlong long Answer = 0;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tint pos1 = lower_bound(A + 1, A + N + 1, A[i] + T) - A;\\n\\t\\tpos1 -= 1;\\n\\t\\tlong long tm1 = C[pos1 - 1] - C[i - 1];\\n\\t\\tlong long tm2 = max(0LL, min(A[i] + T, B[pos1]) - A[pos1]);\\n\\t\\tAnswer = max(Answer, tm1 + tm2);\\n\\t}\\n\\tcout << Answer << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 8296,\n \"score_of_the_acc\": -0.569,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2801_7099229\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\nusing namespace std;\\n\\nmap<long long int,long long int> ms;\\nmap<long long int,int> top;\\nlong long int sums[100003];\\n\\nint main() {\\n\\t// your code goes here\\n\\tlong long int s1=0,t1;\\n\\tint n1;\\n\\tcin>>t1;\\n\\tcin>>n1;\\n\\tfor(int i=0;i<n1;i++){\\n\\t\\tlong long int s,e;\\n\\t\\tcin>>s>>e;\\n\\t\\tms[s]=e;\\n\\t\\tsums[i]=s1;\\n\\t\\ttop[s]=i;\\n\\t\\ts1+=(e-s);\\n\\t}\\n\\tlong long int ans=0;\\n\\tmap<long long int,long long int>::iterator it1,it2;\\n\\tfor(it1=ms.begin();it1!=ms.end();it1++){\\n\\t\\tlong long int s2,t2;\\n\\t\\tt2=(*it1).first+t1;\\n\\t\\tit2=ms.upper_bound(t2);\\n\\t\\tif(it2!=ms.begin())it2--;\\n\\t\\tlong long int te,ts,anst;\\n\\t\\tte=(*it2).second;\\n\\t\\tts=(*it2).first;\\n\\t\\tanst=sums[top[ts]]-sums[top[(*it1).first]];\\n\\t\\tte=(te>t2?t2:te);\\n\\t\\tanst+=(te-ts);\\n\\t\\tans=ans>anst?ans:anst;\\n\\t}\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 16384,\n \"score_of_the_acc\": -1.9083,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2801_4495049\",\n \"code_snippet\": \"#include<stdio.h>\\nint main()\\n{\\n int n,i;\\n long long hi,s[100010],t[100010];\\n \\n scanf(\\\"%lld %d\\\",&hi,&n);\\n for(i=0;i<n;i++) scanf(\\\"%lld %lld\\\",&s[i],&t[i]);\\n \\n int m=0;\\n long long head=s[0],sum=0,ans=0;\\n for(i=0;i<n;i++){\\n sum += t[i]-s[i];\\n while(t[i]-head > hi){\\n if(s[m] <= t[i]-hi && t[i]-hi < t[m]){\\n head = t[i]-hi;\\n sum -= head-s[m];\\n } else {\\n sum -= t[m]-head;\\n m++;\\n head = s[m];\\n }\\n }\\n if(ans < sum) ans = sum;\\n }\\n printf(\\\"%lld\\\\n\\\",ans);\\n \\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4260,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2801_4495032\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\nusing namespace std;\\nint main()\\n{\\n int n;\\n long long hi,s[100010],t[100010];\\n \\n cin >> hi >> n;\\n for(int i=0;i<n;i++) cin >> s[i] >> t[i];\\n \\n int m=0;\\n long long head=s[0],sum=0,ans=0;\\n for(int i=0;i<n;i++){\\n sum += t[i]-s[i];\\n while(t[i]-head > hi){\\n if(s[m] <= t[i]-hi && t[i]-hi < t[m]){\\n head = t[i]-hi;\\n sum -= head-s[m];\\n } else {\\n sum -= t[m]-head;\\n m++;\\n head = s[m];\\n }\\n }\\n ans = max(ans,sum);\\n }\\n cout << ans << endl;\\n \\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 4664,\n \"score_of_the_acc\": -0.3636,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2801_4488309\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n// macro\\n#define rep(i,n) for(i=0;i<n;i++)\\n#define ll long long\\n#define all(v) v.begin(), v.end()\\n\\n// code starts\\nint main()\\n{\\n ll tl;cin>>tl;\\n ll n;cin>>n;\\n vector<ll> s(n);\\n vector<ll> t(n);\\n ll i;\\n rep(i,n)cin>>s[i]>>t[i];\\n vector<ll> sum(n+1,0);\\n rep(i,n)\\n {\\n sum[i+1]=sum[i]+(t[i]-s[i]);\\n }\\n ll ans=0;\\n map<ll,ll> m;\\n rep(i,n)\\n {\\n m.insert({s[i],i});\\n m.insert({t[i],i});\\n }\\n rep(i,n)\\n {\\n ll kans=0;\\n ll kst=s[i];\\n ll kend=kst+tl;\\n auto it=m.lower_bound(kend);\\n if(it==m.end())\\n {\\n ll low=max(i,(ll)0);\\n kans=sum[n]-sum[low];\\n }\\n else\\n {\\n pair<ll,ll> p;\\n p=*it;\\n ll time,ind;\\n time=p.first;\\n ind=p.second;\\n if(s[ind]==time)\\n {\\n kans=sum[ind]-sum[i];\\n }\\n else\\n {\\n kans=sum[ind]-sum[i];\\n kans+=kend-s[ind];\\n }\\n }\\n ans=max(ans,kans);\\n }\\n /*\\n rep(i,n)\\n {\\n ll kans=0;\\n ll kst=s[i];\\n ll kend=s[i]+tl-1;\\n ll inds=lower_bound(all(s),kend)-s.begin();\\n ll indt=lower_bound(all(t),kend)-t.begin();\\n inds--;\\n indt--;\\n if(s[inds]<=t[indt])\\n {\\n kans+=sum[indt+1]-sum[i];\\n }\\n else\\n {\\n kans+=sum[indt+1]-sum[i];\\n kans+=kend-t[inds]+1;\\n }\\n ans=max(ans,kans);\\n }*/\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 17608,\n \"score_of_the_acc\": -1.8,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2801_4488188\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\nusing namespace std;\\ntypedef long long int lli;\\ntypedef pair<lli, lli> pll;\\n\\nint main(){\\n lli t,n;\\n cin >> t >> n;\\n\\n vector<pair<lli, lli>> p(n);\\n for(int i=0; i<n; i++){\\n cin >> p[i].first >> p[i].second;\\n }\\n\\n vector<lli> len(n+1, 0);\\n for(int i=0; i<n; i++){\\n len[i+1] = len[i] +p[i].second -p[i].first;\\n }\\n lli ans = 0;\\n for(int i=0; i<n; i++){\\n lli b = p[i].first;\\n lli e = b+t;\\n int idx = lower_bound(p.begin(), p.end(), pll(e, 0)) -p.begin() -1;\\n lli sub = len[idx] -len[i];\\n if(p[idx].first < e){\\n sub += min(e-p[idx].first, p[idx].second-p[idx].first);\\n }\\n ans = max(ans, sub);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 5208,\n \"score_of_the_acc\": -0.471,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2801_4488074\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\\n#define ll long long\\n#define pp pair<ll,ll>\\n#define ld long double\\n#define all(a) (a).begin(),(a).end()\\n#define mk make_pair\\nll MOD=998244353;\\nint inf=1000001000;\\nll INF=1e18+5;\\nll mod=INF;\\n\\n\\nint main() {\\n ll T;\\n int n;\\n cin >> T >> n;\\n vector<ll> s(n),t(n);\\n rep(i,n) cin >> s[i] >> t[i];\\n s.push_back(INF);\\n int r=1,m=0;\\n ll u=0,ans=0;\\n rep(i,n){\\n while(true){\\n if (r==1){\\n if (s[i]+T<s[m]) break;\\n u+=t[m]-s[m];\\n m++;\\n r=0;\\n }\\n else if (r==0){\\n if (s[i]+T<t[m-1]) break;\\n r=1;\\n }\\n }\\n if (r==0) ans=max(ans,u-(t[m-1]-s[i]-T));\\n else ans=max(ans,u);\\n u-=t[i]-s[i];\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 5276,\n \"score_of_the_acc\": -0.4094,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2801_4488036\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\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; }\\nconst ll INF=1LL<<60;\\nconst int inf=(1<<30)-1;\\nconst int mod=1e9+7;\\nint dx[8]={1,0,-1,0,-1,-1,1,1};\\nint dy[8]={0,1,0,-1,-1,1,-1,1};\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n ll t;cin >> t;\\n int n;cin >> n;\\n vector<ll> s(n),e(n),sum(n+1);\\n ll ans=0;\\n for(int i=0;i<n;i++){\\n cin >> s[i] >> e[i];\\n sum[i+1]=sum[i]+e[i]-s[i];\\n }\\n for(int i=0;i<n;i++){\\n int u=lower_bound(s.begin(),s.end(),s[i]+t)-s.begin();\\n int v=lower_bound(e.begin(),e.end(),s[i]+t)-e.begin();\\n if(u==v){\\n chmax(ans,sum[u]-sum[i]);\\n }\\n else{\\n chmax(ans,sum[v]-sum[i]+t+s[i]-s[v]);\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5220,\n \"score_of_the_acc\": -0.0719,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2801_3987470\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\n\\nsigned main(){\\n ios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n cout << fixed << setprecision(20);\\n\\n int64_t R, n;\\n cin >> R;\\n cin >> n;\\n vector<int64_t> S(n), T(n);\\n\\n for (int i = 0; i < n; i++)\\n cin >> S[i] >> T[i];\\n\\n vector<int64_t> csum(n + 1);\\n for (int i = 0; i < n - 1; i++){\\n csum[i + 1] = csum[i] + S[i + 1] - T[i];\\n }\\n csum[n] = csum[n - 1];\\n\\n int64_t ma = 0;\\n for (int i = 0; i < n; i++){\\n int l = i - 1, r = n;\\n while (r - l > 1){\\n int mid = (l + r) / 2;\\n if (S[i] + R > S[mid]){\\n l = mid;\\n } else {\\n r = mid;\\n }\\n }\\n\\n if (l == i - 1)\\n ma = R;\\n else {\\n ma = max(ma, R - (csum[l] - csum[i] + max(0L, S[i] + R - T[l]))); \\n }\\n }\\n cout << ma << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5256,\n \"score_of_the_acc\": -0.0746,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2801_3858205\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, n) for (ll i = 0; i < n; i++)\\n#define else(x) if (!(x))\\n\\nint main() {\\n ll T, N, res = 0;\\n cin >> T >> N;\\n ll A[N], B[N];\\n ll S[N + 1];\\n S[0] = 0;\\n rep(i, N) cin >> A[i] >> B[i], S[i + 1] = S[i] + B[i] - A[i];\\n\\n rep(i, N) {\\n ll l = -1, r = N;\\n while (r - l > 1) {\\n ll m = (l + r) / 2;\\n if (A[m] < A[i] + T) {\\n l = m;\\n } else {\\n r = m;\\n }\\n }\\n ll time = S[l] - S[i] + min(B[l], A[i] + T) - A[l];\\n res = max(res, time);\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 5428,\n \"score_of_the_acc\": -0.4875,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2801_3249635\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2801.cc: Suntan\\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\nconst int MAX_M = MAX_N * 2;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\n\\n/* global variables */\\n\\nll as[MAX_N], bs[MAX_N], ss[MAX_N + 1];\\n\\n/* subroutines */\\n\\n\\n/* main */\\n\\nint main() {\\n ll t;\\n int n;\\n scanf(\\\"%lld%d\\\", &t, &n);\\n\\n for (int i = 0; i < n; i++) {\\n scanf(\\\"%lld%lld\\\", as + i, bs + i);\\n ss[i + 1] = ss[i] + (bs[i] - as[i]);\\n }\\n\\n ll maxl = 0;\\n for (int i = 0; i < n; i++) {\\n ll ti = as[i] + t;\\n int k = upper_bound(bs, bs + n, ti) - bs;\\n //printf(\\\"k=%d\\\\n\\\", k);\\n\\n ll l = ss[k] - ss[i];\\n if (k < n && as[k] < ti) l += ti - as[k];\\n if (maxl < l) maxl = l;\\n }\\n\\n printf(\\\"%lld\\\\n\\\", maxl);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5556,\n \"score_of_the_acc\": -0.0971,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2801_2974528\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\nusing namespace std;\\n\\nint main() {\\n\\tlong long int T, N, temp[10][100100], temp2 = 0, ans = 0, i, j = 0, tempT, temp3 = 0;\\n\\n\\tcin >> T >> N;\\n\\n\\tfor (i = 0; i < N; i++) {\\n\\t\\tcin >> temp[0][i] >> temp[1][i];\\n\\t}\\n\\n\\n\\tfor (i = 0; i < N; i++) {\\n\\t\\ttempT = temp[0][i] + T; \\n\\t\\tif (i != 0) { ans -= temp[1][i - 1] - temp[0][i - 1] + temp3;}\\n\\n\\t\\twhile (j < N && temp[1][j] <= tempT) {\\n\\t\\t\\tans += temp[1][j] - temp[0][j];\\n\\t\\t\\tj++;\\n\\t\\t}\\n\\t\\tif (j < N && temp[0][j] <= tempT) {\\n\\t\\t\\ttemp3 = tempT - temp[0][j]; \\n\\t\\t\\tans += temp3;\\n\\t\\t}\\n\\t\\telse temp3 = 0;\\n\\t\\ttemp2 = max(temp2, ans);\\n\\t}\\n\\tcout << temp2 << endl;\\n\\n\\t//cin >> T;\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 4648,\n \"score_of_the_acc\": -0.5624,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2801_2974038\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nsigned main(){\\n int T,n;\\n int s[100010],t[100010];\\n cin>>T>>n;\\n for(int i=0;i<n;i++){\\n cin>>s[i]>>t[i];\\n }\\n int l=0,r=0;\\n int sum=0;\\n int ans=0;\\n for(;l<n;l++){\\n if(t[l]-s[l]>=T){\\n ans=T;\\n break;\\n }\\n for(;r<n;r++){\\n if(t[r]>s[l]+T)break;\\n sum+=t[r]-s[r];\\n }\\n if(t[r]>s[l]+T)ans=max(ans,sum+max(0LL,s[l]+T-s[r]));\\n ans=max(ans,sum);\\n sum-=t[l]-s[l];\\n }\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4660,\n \"score_of_the_acc\": -0.43,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2801_2974028\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\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;}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int t,n;\\n cin>>t>>n;\\n vector<Int> a(n),b(n);\\n for(Int i=0;i<n;i++) cin>>a[i]>>b[i];\\n vector<Int> s(n+1);\\n for(Int i=0;i<n;i++) s[i+1]=s[i]+(b[i]-a[i]);\\n\\n Int ans=0;\\n for(Int i=0;i<n;i++){\\n Int k=lower_bound(b.begin(),b.end(),a[i]+t)-b.begin();\\n Int res=s[k]-s[i];\\n if(k<n) res+=max((Int)0,(a[i]+t)-a[k]);\\n chmax(ans,res);\\n //cout<<i<<\\\":\\\"<<k<<\\\":\\\"<<res<<endl; \\n }\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 5200,\n \"score_of_the_acc\": -0.4704,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2801_2914848\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n//namespace cent {\\n//\\n//\\tstruct Edge {\\n//\\t\\tint src;\\n//\\t\\tint dst;\\n//\\t\\tlong long int cost;\\n//\\t};\\n//\\tusing Graph = vector<vector<Edge>>;\\n//\\n//\\tclass Centroid {\\n//\\tprivate:\\n//\\t\\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tint sum = 1;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ch_nums[now] = sum;\\n//\\t\\t}\\n//\\n//\\t\\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tfor (auto&& e : graph[pre_root]) {\\n//\\t\\t\\t\\tif (e.dst == pre_from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t}\\n//\\t\\t\\treturn pre_root;\\n//\\t\\t}\\n//\\n//\\t\\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\\n//\\t\\t\\tmp[make_pair(root,now)]=depth;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tdfs2(g,root,e.dst,e.src,oks,depth+1);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t};\\n//\\n//\\n//\\t\\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\\n//\\t\\t\\tdfs(graph, root, from, ch_nums, oks);\\n//\\n//\\t\\t\\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\\n//\\n//\\n//\\t\\t\\tdfs2(graph,cent_id,cent_id,-1,oks,0);\\n//\\t\\t\\tlens1[cent_id][make_pair(0,0)]--;\\n//\\t\\t\\tlens2[cent_id][0]--;\\n//\\n//\\n//\\t\\t\\toks[cent_id] = depth;\\n//\\n//\\t\\t\\t//for (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t//\\tif (e.dst == from)continue;\\n//\\t\\t\\t//\\tif (oks[e.dst] != -1)continue;\\n//\\n//\\t\\t\\t//\\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\\n//\\n//\\t\\t\\t//\\tfor (auto&& l1 : lens1[e.dst]) {\\n//\\t\\t\\t//\\t\\tint keta = l1.first.second;\\n//\\t\\t\\t//\\t\\tlong long int num = l1.first.first;\\n//\\n//\\t\\t\\t//\\t\\tlong long int need = (mod - num) / mod_pow(10, keta);\\n//\\t\\t\\t//\\t\\tneed%=mod;\\n//\\t\\t\\t//\\t\\tauto it = lens2[e.dst].find(need);\\n//\\t\\t\\t//\\t\\tif (it != lens2[e.dst].end()) {\\n//\\t\\t\\t//\\t\\t\\tans -= l1.second*it->second;\\n//\\t\\t\\t//\\t\\t}\\n//\\t\\t\\t//\\t}\\n//\\t\\t\\t//\\tlens1[e.dst].clear();\\n//\\t\\t\\t//\\tlens2[e.dst].clear();\\n//\\t\\t\\t//}\\n//\\n//\\t\\t\\tif (from != -1) {\\n//\\t\\t\\t\\tcentroid_edges[from].push_back(cent_id);\\n//\\t\\t\\t}\\n//\\t\\t\\telse {\\n//\\t\\t\\t\\tfst_centroid = cent_id;\\n//\\t\\t\\t}\\n//\\t\\t\\tfor (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t\\tif (e.dst == from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\n//\\tpublic:\\n//\\n//\\t\\tmap<pair<int,int>,int>mp;\\n//\\n//\\t\\tvector<map<pair<long long int,int>, long long int>>lens1;\\n//\\t\\tvector<map<long long int, long long int>>lens2;\\n//\\t\\tvector<vector<int>> centroid_graph;\\n//\\t\\tvector<int>ts;\\n//\\t\\tvector<int>parents;\\n//\\t\\tvector<int>oks;\\n//\\t\\tvector<int>anss;\\n//\\n//\\t\\t//fst:root snd:centroid_graph\\n//\\t\\tvoid init(const Graph&g) {\\n//\\t\\t\\tlens1.resize(g.size());\\n//\\t\\t\\tlens2.resize(g.size());\\n//\\t\\t\\toks = vector<int>(g.size(), -1);\\n//\\t\\t\\tint root = -1;\\n//\\t\\t\\tcentroid_graph.resize(g.size());\\n//\\t\\t\\tparents = vector<int>(g.size(), -1);\\n//\\t\\t\\tts=vector<int>(g.size(),-1);\\n//\\t\\t\\tanss=vector<int>(g.size(),100000);\\n//\\n//\\t\\t\\tvector<int>ch_nums(g.size());\\n//\\t\\t\\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\\n//\\n//\\t\\t\\tfor (int i = 0; i < centroid_graph.size(); ++i) {\\n//\\t\\t\\t\\tfor (auto&& e : centroid_graph[i]) {\\n//\\t\\t\\t\\t\\tparents[e] = i;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ;\\n//\\t\\t}\\n//\\t}centroid;\\n//\\n//\\n//\\tvoid addEdge(Graph& g, int a, int b, long long int c) {\\n//\\t\\tg[a].push_back(Edge{ a,b,c });\\n//\\t\\tg[b].push_back(Edge{ b,a,c });\\n//\\t}\\n//}\\n\\n\\n//const int mod = 1000000007;\\n//struct Mod {\\n//public:\\n//\\tint num;\\n//\\tMod() : Mod(0) { ; }\\n//\\tMod(long long int n) : num((n % mod + mod) % mod) {\\n//\\t\\tstatic_assert(mod<INT_MAX / 2, \\\"mod is too big, please make num 'long long int' from 'int'\\\");\\n//\\t}\\n//\\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\\n//\\toperator int() { return num; }\\n//};\\n//\\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\\n//Mod operator++(Mod &a) { return a + Mod(1); }\\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\\n//Mod operator--(Mod &a) { return a - Mod(1); }\\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\\n//Mod operator^(const Mod a, const int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = (a * a) ^ (n / 2);\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//Mod mod_pow(const Mod a, const long long int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = mod_pow((a * a), (n / 2));\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//\\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\\n//Mod operator/(const Mod a, const Mod b) {\\n//\\tassert(b.num != 0);\\n//\\treturn a * inv(b);\\n//}\\n//Mod operator/(const long long int a, const Mod b) {\\n//\\treturn Mod(a) / b;\\n//}\\n//Mod operator/=(Mod &a, const Mod b) {\\n//\\treturn a = a / b;\\n//}\\n//\\n//#define MAX_MOD_N 1024000\\n//\\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\\n//void init(const int amax = MAX_MOD_N) {\\n//\\tfact[0] = Mod(1); factinv[0] = 1;\\n//\\tfor (int i = 0; i < amax - 1; ++i) {\\n//\\t\\tfact[i + 1] = fact[i] * Mod(i + 1);\\n//\\t\\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\\n//\\t}\\n//}\\n//Mod comb(const int a, const int b) {\\n//\\treturn fact[a] * factinv[b] * factinv[a - b];\\n//}\\n//\\n//vector<int>primes;\\n//void hurui(const int amax=3500) {\\n//\\tstatic bool flag = false;\\n//\\tif (flag)return;\\n//\\tvector<int>sos;\\n//\\tsos = vector<int>(amax + 1, true);\\n//\\tsos[0] = false; sos[1] = false;\\n//\\tfor (int i = 2; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\\n//\\t\\t}\\n//\\t}\\n//\\tfor (int i = 0; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tprimes.push_back(i);\\n//\\t\\t}\\n//\\t}\\n//\\tflag = true;\\n//}\\n//\\n//\\n//struct query {\\n//\\tint u;\\n//\\tint v;\\n//\\tmap<int,int>mp;\\n//};\\n//\\n//map<int, int>mk_mp(const int a) {\\n//\\tint rest(a);\\n//\\tmap<int,int>as;\\n//\\tfor (auto pr : primes) {\\n//\\t\\twhile (rest%pr == 0) {\\n//\\t\\t\\tas[pr]++;\\n//\\t\\t\\trest /= pr;\\n//\\t\\t}\\n//\\t}\\n//\\tif (rest!=1)as[rest]++;\\n//\\treturn as;\\n//}\\n//\\n//#define Seg_Max_N (1<<18) \\n//\\n//class Tree {\\n//public:\\n//\\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\\n//\\t\\tT.resize(V);\\n//\\t\\tfor (int i = 0; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i].resize(V);\\n//\\t\\t}\\n//\\t\\tdepth.resize(V);\\n//\\t}\\n//\\t// uとvをつなぐ\\n//\\t// lcaを求めることが主目的なので無向グラフとしている\\n//\\tvoid unite(int u, int v) {\\n//\\t\\tT[u].push_back(v);\\n//\\t\\tT[v].push_back(u);\\n//\\t}\\n//\\tvoid unite(vector<vector<int>>&e) {\\n//\\t\\tT = e;\\n//\\t}\\n//\\t// initする\\n//\\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\\n//\\tvoid init() {\\n//\\t\\tdfs(root, 0, 0);\\n//\\t\\tint id = 0;\\n//\\t\\tgetid(root, 0, id);\\n//\\t}\\n//\\t// uとvのlcaを求める\\n//\\tint lca(int u, int v) const {\\n//\\t\\tif (depth[u] > depth[v]) swap(u, v);\\n//\\t\\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\\t// uとvの距離を求める\\n//\\t// edgeを定義しないといけない時はこれじゃダメ\\n//\\tint dist(int u, int v) const {\\n//\\t\\tint p = lca(u, v);\\n//\\t\\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\\n//\\t}\\n//\\tint dfs(int v, int p, int d) {\\n//\\t\\tparent[0][v] = p;\\n//\\t\\tdepth[v] = d;\\n//\\t\\tcnum[v] = 0;\\n//\\t\\tfor (int i = 1; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\\n//\\t\\t}\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) cnum[v] += dfs(next, v, d + 1);\\n//\\t\\t}\\n//\\t\\treturn cnum[v] + 1;\\n//\\t}\\n//\\n//\\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) dfs2(next, v, doubles, nums);\\n//\\t\\t}\\n//\\t\\tdoubles[0][v] = nums[v];\\n//\\t\\tfor (int j = 1; j < MAXLOGV; ++j) {\\n//\\t\\t\\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\\n//\\t\\t}\\n//\\t\\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\\n//\\t\\t\\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\\n//\\t\\t}\\n//\\t}\\n//\\t//ここでは親から距離2^iの部分木の最小値を求めている\\n//\\tvector<vector<int>>get_doubles(const vector<int>&nums) {\\n//\\t\\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\\n//\\t\\tdfs2(root, -1, doubles, nums);\\n//\\t\\treturn doubles;\\n//\\t}\\n//\\n//\\tvoid getid(const int v, const int p, int &nplace) {\\n//\\t\\tplace[v] = nplace;\\n//\\t\\tid[nplace] = v;\\n//\\t\\tnplace++;\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) getid(next, v, nplace);\\n//\\t\\t}\\n//\\t}\\n//\\tstatic const int MAXLOGV = 25;\\n//\\t// グラフの隣接リスト表現\\n//\\tvector<vector<int> > T;\\n//\\t// 頂点の数\\n//\\tint V;\\n//\\t// 根ノードの番号\\n//\\tint root;\\n//\\n//\\t// 親ノード\\n//\\tvector<int> parent[MAXLOGV];\\n//\\t// 根からの深さ\\n//\\tvector<int> depth;\\n//\\n//\\t//子の数\\n//\\tvector<int>cnum;\\n//\\n//\\t//変換\\n//\\tvector<int>place;\\n//\\tvector<int>id;\\n//\\n//};\\n//\\n//vector<int>pas;\\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\\n//\\ttos[now]=id;\\n//\\tlrs[tos[now]].first=id++;\\n//\\tfor (auto e : edges[now]) {\\n//\\t\\tif (e == from) {\\n//\\t\\t\\tpas[now] = from;\\n//\\t\\t\\tcontinue;\\n//\\t\\t}\\n//\\t\\tadfs(lrs,tos,edges,e,now,id);\\n//\\t}\\n//\\tlrs[tos[now]].second=id;\\n//}\\n//\\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\\n//\\tpas.resize(tos.size());pas[0]=-1;\\n//\\tvector<pair<int,int>>lrs(edges.size());\\n//\\tint id=0;\\n//\\tadfs(lrs,tos,edges,0,-1,id);\\n//\\treturn lrs;\\n//}\\n\\n\\nnamespace FastFourierTransform\\n{\\n\\tusing C = complex< double >;\\n\\n\\tvoid DiscreteFourierTransform(vector< C > &F, bool rev)\\n\\t{\\n\\t\\tconst int N = (int)F.size();\\n\\t\\tconst double PI = (rev ? -1 : 1) * acos(-1);\\n\\t\\tfor (int i = 0, j = 1; j + 1 < N; j++) {\\n\\t\\t\\tfor (int k = N >> 1; k > (i ^= k); k >>= 1);\\n\\t\\t\\tif (i > j) swap(F[i], F[j]);\\n\\t\\t}\\n\\t\\tC w, s, t;\\n\\t\\tfor (int i = 1; i < N; i <<= 1) {\\n\\t\\t\\tfor (int k = 0; k < i; k++) {\\n\\t\\t\\t\\tw = polar(1.0, PI / i * k);\\n\\t\\t\\t\\tfor (int j = 0; j < N; j += i * 2) {\\n\\t\\t\\t\\t\\ts = F[j + k];\\n\\t\\t\\t\\t\\tt = C(F[j + k + i].real() * w.real() - F[j + k + i].imag() * w.imag(),\\n\\t\\t\\t\\t\\t\\tF[j + k + i].real() * w.imag() + F[j + k + i].imag() * w.real());\\n\\t\\t\\t\\t\\tF[j + k] = s + t, F[j + k + i] = s - t;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (rev) for (int i = 0; i < N; i++) F[i] /= N;\\n\\t}\\n\\n\\tvector< int> Multiply(const vector< int > &A, const vector<int > &B)\\n\\t{\\n\\t\\tint sz = 1;\\n\\t\\twhile (sz <= A.size() + B.size()) sz <<= 1;\\n\\t\\tvector< C > F(sz), G(sz);\\n\\t\\tfor (int i = 0; i < A.size(); i++) F[i] = A[i];\\n\\t\\tfor (int i = 0; i < B.size(); i++) G[i] = B[i];\\n\\t\\tDiscreteFourierTransform(F, false);\\n\\t\\tDiscreteFourierTransform(G, false);\\n\\t\\tfor (int i = 0; i < sz; i++) F[i] *= G[i];\\n\\t\\tDiscreteFourierTransform(F, true);\\n\\t\\tvector< int > X(A.size() + B.size() - 1);\\n\\t\\tfor (int i = 0; i < A.size() + B.size() - 1; i++) X[i] = F[i].real() + 0.5;\\n\\t\\treturn (X);\\n\\t}\\n};\\n\\n\\n\\nint main()\\n{\\n\\tlong long int T;cin>>T;\\n\\tint N;cin>>N;\\n\\tvector<pair<long long int,long long int>>ps;\\n\\tvector<long long int>sums(N+1);\\n\\tsums[0]=0;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tlong long int l,r;cin>>l>>r;\\n\\t\\tps.emplace_back(l,r);\\n\\t\\tsums[i+1]=sums[i]+r-l;\\n\\t}\\n\\tlong long int ans=0;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tauto it=lower_bound(ps.begin(),ps.end(),make_pair(ps[i].first+T,0ll));\\n\\t\\tint j=it-ps.begin()-1;\\n\\t\\tauto p(ps[j]);\\n\\t\\tif (p.second < ps[i].first + T) {\\n\\n\\t\\t\\tlong long int nans = sums[j]-sums[i] + ps[j].second-ps[j].first;\\n\\t\\t\\tans=max(ans,nans);\\n\\t\\t}\\n\\t\\telse {\\n\\n\\t\\t\\tlong long int nans = sums[j]-sums[i] + ps[i].first + T - ps[j].first;\\n\\t\\t\\tans=max(ans,nans);\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 5708,\n \"score_of_the_acc\": -0.5751,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1686,"cells":{"group_id":{"kind":"string","value":"aoj_2806_cpp"},"problem_description":{"kind":"string","value":"B: 重さの範囲\n問題\n重さの異なる $N$ 色のボールがキューにたくさん入っています。キューには、先頭から\n$1,2,3, \\dots ,N-1,N,1,2,3, \\dots ,N-1,N,1,2,3, \\dots$ というふうに昇順にボールが並んでいて、\n色 $N$ のボールの後ろにはまた色 $1$ のボールから順に入っています。\n同じ色のボールはそれぞれ同じ重さであり、色 $i$ のボールの重さは $A_i$ です。\nこの状態から、キューの先頭からボールを $M$ 個取り出し、これを 1 つのグループとする作業を繰り返します。\nそして、キューから取り出した各色のボールの総数がすべて等しくなったときにグループを作る作業をやめます。\nなお、キューには十分な数のボールが入っており、グループを作る作業をやめるまでにキューの中身が空になることはありません。\nたとえば、\n$N=8, M=2$ のとき、{色1,色2}, {色3,色4}, {色5,色6}, {色7,色8} の 4 グループができます\n(このとき各色のボールは 1 つずつ存在する)。\n$N=4, M=3$ のとき、{色1,色2,色3}, {色4,色1,色2}, {色3,色4,色1}, {色2,色3,色4} の $4$\nグループができます (このとき各色のボールはそれぞれ3つずつ存在する)。\nこのとき、各グループにおいて、\n含まれるボールの重さの最大値と最小値の差をそのグループの\n重さの範囲\nと呼ぶことにします。\n各グループの重さの範囲の総和を出力してください。\n制約\n$1 \\le N \\le 1000$\n$1 \\le M \\le N$\n$0 \\le A_i \\le 100$\n入力は全て整数である\n入力形式\n入力は以下の形式で与えられます。\n$N \\ M$\n$A_1 \\cdots A_N$\n出力\n答えを 1 行で出力してください。また、末尾に改行も出力してください。\nサンプル\nサンプル入力 1\n8 2\n23 61 57 13 91 41 79 41\nサンプル出力 1\n170\n重さの範囲の総和は $38+44+50+38=170$ となります。\nサンプル入力 2\n4 3\n72 46 67 5\nサンプル出力 2\n222\n重さの範囲の総和は $26+67+67+62=222$ となります。\nサンプル入力 3\n4 2\n1 2 3 5\nサンプル出力 3\n3\n重さの範囲の総和は $1+2=3$ となります。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2806_3448657","code_snippet":"#include<iostream>\n#include<queue>\nusing namespace std;\n#define inRange(x,a,b) (a <= x && x < b)\n\nint main(){\n int n, m;\n cin >> n >> m;\n int a[n];\n for(int i = 0; i < n; i++) cin >> a[i];\n priority_queue<pair<int,int>> l, r;\n int ans = 0, cur = 0;\n do{\n for(int j = 0; j < m; j++) l.push({-a[cur%n], cur}), r.push({a[cur%n], cur}), cur++;\n while(!inRange(l.top().second, cur-m, cur)) l.pop();\n while(!inRange(r.top().second, cur-m, cur)) r.pop();\n ans += r.top().first+l.top().first;\n }while(cur%n);\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":17888,"score_of_the_acc":-1.5535,"final_rank":13},{"submission_id":"aoj_2806_2995994","code_snippet":"#include <bits/stdc++.h>\n #include<iostream>\n #include<cstdio>\n #include<vector>\n #include<queue>\n #include<map>\n #include<cstring>\n #include<string>\n #include <math.h>\n #include<algorithm>\n // #include <boost/multiprecision/cpp_int.hpp>\n #include<functional>\n #define int long long\n #define inf 1000000007\n #define pa pair<int,int>\n #define ll long long\n #define pal pair<double,double>\n #define ppap pair<pa,int>\n // #define PI 3.14159265358979323846\n #define paa pair<int,char>\n #define mp make_pair\n #define pb push_back\n #define EPS (1e-10)\n #define equals(a,b) (fabs((a)-(b))<EPS)\n int dx[4]={0,-1,0,1};\n int dy[4]={1,0,-1,0};\n using namespace std;\n \t\t\tclass pa3{\n \tpublic:\n \tint x,y,z;\n \tpa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}\n \tbool operator < (const pa3 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\t return z<p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \t\t\t\tbool operator > (const pa3 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\t return z>p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa3 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z;\n \t}\n \t\tbool operator != (const pa3 &p) const{\n \t\t\treturn !( x==p.x && y==p.y && z==p.z);\n \t}\n \n };\n \n class pa4{\n \tpublic:\n \tdouble x;\n \tint y,z,w;\n \tpa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}\n \tbool operator < (const pa4 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\tif(z!=p.z)return z<p.z;\n \t\treturn w<p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator > (const pa4 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\tif(z!=p.z)return z>p.z;\n \t\treturn w>p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa4 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z &&w==p.w;\n \t}\n \t\t\n \n };\n class pa2{\n \tpublic:\n \tint x,y;\n \tpa2(int x=0,int y=0):x(x),y(y) {}\n \tpa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}\n \tpa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}\n \tbool operator < (const pa2 &p) const{\n \t\treturn y != p.y ? y<p.y: x<p.x;\n \t}\n \tbool operator > (const pa2 &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa2 &p) const{\n \t\treturn abs(x-p.x)==0 && abs(y-p.y)==0;\n \t}\n \tbool operator != (const pa2 &p) const{\n \t\treturn !(abs(x-p.x)==0 && abs(y-p.y)==0);\n \t}\n \t\t\n \n };\n \n #define ppa pair<int,pas>\n class Point{\n \tpublic:\n \tdouble x,y;\n \tPoint(double x=0,double y=0):x(x),y(y) {}\n \tPoint operator + (Point p) {return Point(x+p.x,y+p.y);}\n \tPoint operator - (Point p) {return Point(x-p.x,y-p.y);}\n \tPoint operator * (double a) {return Point(x*a,y*a);}\n \tPoint operator / (double a) {return Point(x/a,y/a);}\n \tdouble absv() {return sqrt(norm());}\n \tdouble norm() {return x*x+y*y;}\n \tbool operator < (const Point &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const Point &p) const{\n \t\treturn fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\n \t}\n };\n typedef Point Vector;\n #define pl pair<int,pas>\n struct Segment{\n Point p1,p2;\n };\n double dot(Vector a,Vector b){\n \treturn a.x*b.x+a.y*b.y;\n }\n double cross(Vector a,Vector b){\n \treturn a.x*b.y-a.y*b.x;\n }\n \n bool parareru(Point a,Point b,Point c,Point d){\n //\tif(abs(cross(a-b,d-c))<EPS)cout<<\"dd \"<<cross(a-b,d-c)<<endl;\n \treturn abs(cross(a-b,d-c))<EPS;\n }\n double distance_ls_p(Point a, Point b, Point c) {\n if ( dot(b-a, c-a) < EPS ) return (c-a).absv();\n if ( dot(a-b, c-b) < EPS ) return (c-b).absv();\n return abs(cross(b-a, c-a)) / (b-a).absv();\n }\n bool is_intersected_ls(Segment a,Segment b) {\n \tif(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;\n \tif(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){\n //\t\tcout<<\"sss\"<<endl;\n \t\tif(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;\n \t\tif(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;\n \t\tif(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;\n \t\tif(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;\n \t\treturn false;\n \t}\n else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );\n }\n \n double segment_dis(Segment a,Segment b){\n \tif(is_intersected_ls(a,b))return 0;\n \tdouble r=distance_ls_p(a.p1, a.p2, b.p1);\n \tr=min(r,distance_ls_p(a.p1, a.p2, b.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p1));\n \treturn r;\n }\n Point intersection_ls(Segment a, Segment b) {\n Point ba = b.p2-b.p1;\n double d1 = abs(cross(ba, a.p1-b.p1));\n double d2 = abs(cross(ba, a.p2-b.p1));\n double t = d1 / (d1 + d2);\n \n return a.p1 + (a.p2-a.p1) * t;\n }\n \n string itos( int i ) {\n ostringstream s ;\n s << i ;\n return s.str() ;\n }\n \n int gcd(int v,int b){\n \tif(v>b) return gcd(b,v);\n \tif(v==b) return b;\n \tif(b%v==0) return v;\n \treturn gcd(v,b%v);\n }\n \n double distans(double x1,double y1,double x2,double y2){\n \tdouble rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);\n \treturn sqrt(rr);\n \t\n }\n int mod;\n // int pr[2000010];\n // int inv[2000010];\n \n int beki(int wa,int rr,int warukazu){\n \tif(rr==0) return 1%warukazu;\n \tif(rr==1) return wa%warukazu;\n \tif(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;\n \tint zx=beki(wa,rr/2,warukazu);\n \treturn (zx*zx)%warukazu;\n }\n /*\n double bekid(double w,int r){\n \tif(r==0) return 1.0;\n \tif(r==1) return w;\n \tif(r%2) return bekid(w,r-1)*w;\n \tdouble f=bekid(w,r/2);\n \treturn f*f;\n }\n \n \t\t\tint comb(int nn,int rr){\n \t\t\t\tint r=pr[nn]*inv[rr];\n \t\t\t\tr%=mod;\n \t\t\t\tr*=inv[nn-rr];\n \t\t\t\tr%=mod;\n \t\t\t\treturn r;\n \t\t\t}\n \n void gya(int ert){\n \tpr[0]=1;\n \tfor(int i=1;i<ert;i++){\n \t\tpr[i]=(pr[i-1]*i)%mod;\n \t}\n \tfor(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);\n \t\n }\n */\n // cin.tie(0);\n \t\t//\tios::sync_with_stdio(false);\n \t\t\t//priority_queue<pa3,vector<pa3>,greater<pa3>> pq; \n //sort(ve.begin(),ve.end(),greater<int>());\n //----------------kokomade tenpure------------\n //vector<double> ans(100000000),ans2(100000000)\nstring s;\nint n,m;\nint a[1003]={0};\nint b[3];\nvector<int> ve;\n signed main(){\n cin.tie(0);\n \t\tios::sync_with_stdio(false);\n \tchar e='A';\n \t\n \tint ans1=0,ans2=0;\n \tcin>>n>>m;\n \tint g=gcd(n,m);\n \tint l=n*m/g;\n \t\n \tfor(int i=0;i<n;i++)cin>>a[i];\n \t\n int ans=0; \n \tint c=0;\n \tfor(int j=0;;j=(j+m)%n){\n \t\tif(j==0 && c!=0) break;\n \t\tint mi=inf,ma=-inf;\n \t\tfor(int i=j;i<j+m;i++){\n \t\t\tmi=min(mi,a[i%n]);\n \t\t\tma=max(ma,a[i%n]);\n \t\t}\n \t\tans+=ma-mi;\n \t\tc++;\n \t}\n \tcout<<ans<<endl;\n \treturn 0;\n \t\n }","accuracy":1,"time_ms":10,"memory_kb":3236,"score_of_the_acc":-0.0178,"final_rank":7},{"submission_id":"aoj_2806_2749083","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n/*{{{*/ //template\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\nconstexpr int INF = numeric_limits<int>::max()/2;\nconstexpr long long LINF = numeric_limits<long long>::max()/3;\n#define mp make_pair\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\n#define sz(x) (int)(x).size()\n#define debug(x) cerr<<#x<<\":\"<<x<<endl\n#define debug2(x,y) cerr<<#x<<\",\"<<#y\":\"<<x<<\",\"<<y<<endl\n//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;\nstruct Double{ double d; explicit Double(double x) : d(x){} };\nostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << \"[\"; for(const auto& v : vec){ os << v << \",\"; } os << \"]\"; return os; }\ntemplate<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << \"(\" << p.first << \",\"<< p.second <<\")\"; return os; }\ntemplate<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<\"{\"; for(T v:st) os<<v<<\",\"; os <<\"}\"; return os; }\ntemplate<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }\ntemplate<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }\n//constexpr double eps = 1e-14; \nconstexpr double eps = 1e-10; \nconstexpr ll mod = 1e9+7;\nconst int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};\n/*}}}*/\n\nint main(){\n ll n,m;\n cin >> n >> m;\n vi a(n);\n rep(i,n) cin >> a[i];\n\n int lcm = n * m / gcd(n,m);\n\n vector<int> b(lcm);\n for(int i=0;i<lcm;i++) b[i] = a[i%n];\n\n int index = 0;\n ll ans = 0;\n while(index < lcm){\n ll max = numeric_limits<ll>::min();\n ll min = numeric_limits<ll>::max();\n for(int i=0;i<m;i++){\n chmax(max,b[index + i]);\n chmin(min,b[index + i]);\n }\n ans += max - min;\n index += m;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6520,"score_of_the_acc":-0.1379,"final_rank":8},{"submission_id":"aoj_2806_2585014","code_snippet":"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\n\nint N, M;\nint A[1000];\nint dp_max[2000][2000];\nint dp_min[2000][2000];\n\nint main()\n{\n\tscanf(\"%d %d\", &N, &M);\n\tfor(int i = 0; i < N; i++)\n\t{\n\t\tscanf(\"%d\", &A[i]);\n\t}\n\n\tdp_max[0][0] = A[0];\n\tdp_min[0][0] = A[0];\n\tfor(int i = 1; i < 2 * N; i++)\n\t{\n\t\tint w = A[i % N];\n\t\tdp_max[i][i] = w;\n\t\tdp_min[i][i] = w;\n\t\tfor(int j = 0; j < i; j++)\n\t\t{\n\t\t\tdp_max[j][i] = std::max(dp_max[j][i - 1], w);\n\t\t\tdp_min[j][i] = std::min(dp_min[j][i - 1], w);\n\t\t}\n\t}\n\n\tlong ans = 0;\n\tfor(int i = 0; ; i += M)\n\t{\n\t\tif(i != 0 && i % N == 0) break;\n\t\tint j = i % N;\n\t\tans += dp_max[j][j + M - 1] - dp_min[j][j + M - 1];\n\t}\n\tprintf(\"%d\\n\", ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":30100,"score_of_the_acc":-2,"final_rank":14},{"submission_id":"aoj_2806_2449444","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint main(){\n int n,m;\n cin>>n>>m;\n queue<int>q;\n int a[n],ans=0;\n r(i,n)cin>>a[i];\n int lcm=n*m/__gcd(n,m);\n r(i,lcm)q.push(a[i%n]);\n r(i,lcm){\n int l=1e9,r=0,p;\n for(int k=0;k<m;k++){\n p=q.front();q.pop();\n l=min(l,p);\n r=max(r,p);\n i++;\n }\n ans+=r-l;\n i--;\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":6748,"score_of_the_acc":-0.1462,"final_rank":9},{"submission_id":"aoj_2806_2434774","code_snippet":"#include<cstdio>\n#include<algorithm>\n#include<functional>\nusing namespace std;\nint main(void)\n{\n\tint i,j,p,n,m,a[1000],sum,mi,mx,p2;\n\tscanf(\"%d %d\",&n,&m);\n\tfor(i=0;i<n;i++)\tscanf(\"%d\",&a[i]);\n\tsum=0;\n\tp=0;\n\twhile(1)\t{\n\t\tmi=a[p];\tmx=a[p];\n\t\tp=(p+1)%n;\n\t\tfor(i=1;i<m;i++)\t{\n\t\t\tmi=min(mi,a[p]);\n\t\t\tmx=max(mx,a[p]);\n\t\t\tp=(p+1)%n;\n\t\t}\n\t\tsum+=mx-mi;\n\t\tif(p==0)\tbreak;\n\t}\n\tprintf(\"%d\\n\",sum);\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":2748,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2806_2330115","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)),end((a))\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort(ALL((c)))\n#define RSORT(c) sort(RALL((c)))\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\ntemplate<class S, class T>\nostream& operator<<(ostream& os, const pair<S,T>& p){\n return os << p.FF << \" \" << p.SS;\n}\ntemplate<class T>\nvoid maxi(T& x, T y){\n if(x < y) x = y;\n}\ntemplate<class T>\nvoid mini(T& x, T y){\n if(x > y) x = y;\n}\n\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst LL MOD = 1e9+7;\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n int N, M; cin >> N >> M;\n VL xs(N);\n REP(i,N) cin >> xs[i];\n\n int lcm = N * M / __gcd(N, M);\n LL ans = 0;\n set<int> q;\n for(int i=0;i<lcm;++i){\n\tq.insert(xs[i%N]);\n\tif((i+1)%M == 0){\n\t ans += *--end(q) - *begin(q);\n\t q.clear();\n\t}\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3200,"score_of_the_acc":-0.0165,"final_rank":6},{"submission_id":"aoj_2806_2329972","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <climits>\n\nint lcm(int a, int b)\n{\n return a / std::__gcd(a, b) * b;\n}\n\nint main()\n{\n int N, M;\n std::cin >> N >> M;\n \n std::vector<int> A(N);\n for (int i = 0; i < N; i++) {\n std::cin >> A[i];\n }\n \n int res = 0;\n int max = INT_MIN, min = INT_MAX;\n for (int i = 0, j = 0; i < lcm(N, M); i++, j++) {\n max = std::max(max, A[i % N]);\n min = std::min(min, A[i % N]);\n \n if (j + 1 == M) {\n res += max - min;\n j = -1;\n max = INT_MIN;\n min = INT_MAX;\n }\n }\n std::cout << res << std::endl; \n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3096,"score_of_the_acc":-0.6794,"final_rank":11},{"submission_id":"aoj_2806_2329968","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <climits>\n\nint lcm(int a, int b)\n{\n return a / std::__gcd(a, b) * b;\n}\n\nint main()\n{\n int N, M;\n std::cin >> N >> M;\n \n std::vector<int> A(N);\n for (int i = 0; i < N; i++) {\n std::cin >> A[i];\n }\n \n long long res = 0;\n int max = INT_MIN, min = INT_MAX;\n for (int i = 0, j = 0; i < lcm(N, M); i++, j++) {\n max = std::max(max, A[i % N]);\n min = std::min(min, A[i % N]);\n \n if (j + 1 == M) {\n res += max - min;\n j = -1;\n max = INT_MIN;\n min = INT_MAX;\n }\n }\n std::cout << res << std::endl; \n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3096,"score_of_the_acc":-0.6794,"final_rank":11},{"submission_id":"aoj_2806_2265401","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\n#define each(a,x) for(auto a : (x))\n#define all(a) (a).begin(),(a).end()\n#define chmin(a,b) ((a) = min((a),(b)))\n#define chmax(a,b) ((a) = max((a),(b)))\n#define in_range(x,l,r) ((l)<=(x) && (x)<(r))\n#define printvec(a) rep(i,a) cout << a[i] << \" \\n\"[i+1==(a).size()];\n#define fs first\n#define sc second\n#define em emplace\n#define eb emplace_back\n#define sz size()\n#define MP make_pair\nusing namespace std;\ntypedef long long ll;\ntypedef double D;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<string> vs;\n\nconst ll INF = 1e8;\nconst D EPS = 1e-8;\nconst ll MOD = 1e9+7;\n\nint main(){\n ll n,m;\n cin >> n >> m;\n vl a(n);\n rep(i,n) cin >> a[i];\n\n ll l = n/__gcd(n,m), cur = 0;\n ll sum = 0;\n rep(azu,l){\n ll min_v = a[cur], max_v = a[cur];\n rep(i,m){\n chmin(min_v, a[cur]);\n chmax(max_v, a[cur]);\n cur = (cur + 1) % n;\n }\n sum += max_v - min_v;\n }\n cout << sum << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3080,"score_of_the_acc":-0.0121,"final_rank":3},{"submission_id":"aoj_2806_2235406","code_snippet":"#include<algorithm>\n#include<iostream>\n#include<vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n\nint main(){\n int N,M;\n cin>>N>>M;\n vector<int> A(N);\n rep(i,N)cin>>A[i];\n \n vector<int> v(N); //v[i]: A[i]~A[i+M-1]?????§?????°????????????????????¨???????????°???????????????\n \n //v[i]????±?????????????( O(N M logM) )\n rep(i,N){\n vector<int> tmp;\n for(int j=i;j<i+M;j++) tmp.pb( A[j%N] );\n \n sort(all(tmp));\n int maxi = tmp[tmp.size()-1];\n int mini = tmp[0];\n \n v[i] = maxi - mini;\n }\n \n int ans = 0;\n int lcm = N*M/__gcd(N,M);\n \n rep(i,lcm/M){ //????\\???? LCM(N,M)/M ???????????????LCM(N,M)/M????????°??????????????§??????\n int index = (i*M)%N;\n ans+=v[index];\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3144,"score_of_the_acc":-0.0145,"final_rank":5},{"submission_id":"aoj_2806_2228924","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n \n#define rep(i, n) for (int i = 0; i < int(n); ++i)\ntypedef long long i64;\n \nint gcd(int x, int y) {\n\treturn y ? gcd(y, x % y) : x;\n}\n \nint a[1000];\n \nint main() {\n\t// your code goes here\n\tint n, m;\n\tcin >> n >> m;\n\trep(i, n) {\n\t\tcin >> a[i];\n\t}\n\t// Pick nm/gcd(n, m) = lcm(n, m) times.\n\ti64 tot = 0;\n\tint g = gcd(n, m);\n\trep(i, n / g) {\n\t\tvector<int> t;\n\t\trep(j, m) {\n\t\t\t// (i * m + j) % n -th is taken\n\t\t\tt.push_back(a[(i * m + j) % n]);\n\t\t}\n\t\tsort(t.begin(), t.end());\n\t\ttot += t[t.size() - 1] - t[0];\n\t}\n\tcout << tot << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3092,"score_of_the_acc":-0.0126,"final_rank":4},{"submission_id":"aoj_2806_2227918","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int inf = numeric_limits<int>::max();\n\nint gcd(int a,int b){\n if(b > a)swap(a,b);\n if(a % b == 0)return b;\n else return gcd(b,a%b);\n}\n\nint main(void){\n ll n,m;\n ll a[1100];\n cin >> n >> m;\n for(int i = 0;i < n;++i)cin >> a[i];\n int now = 0;\n ll res = 0;\n ll r = (n*m)/gcd(n,m);\n r /= m;\n for(int i = 0;i < r;++i){\n ll ma = 0;\n ll mi = inf;\n for(int j = 0;j < m;++j){\n ma = max(ma,a[now]);\n mi = min(mi,a[now]);\n ++now;\n now %= n;\n }\n res += ma - mi;\n }\n cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3048,"score_of_the_acc":-0.011,"final_rank":2},{"submission_id":"aoj_2806_2227890","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define ALL(A) A.begin(), A.end()\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nint main()\n{\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\tint N, M; cin >> N >> M;\n\tvector<int> a(N, 0);\n\trep (i, N) cin >> a[i];\n\n\tint g = __gcd(N, M);\n\tint L = N * M / g;\n\tint numGroup = L / M; \n\n\tvector<int> Group[numGroup];\n\trep (i, numGroup) Group[i].clear();\n\trep (i, L){\n\t\tGroup[i/M].push_back(a[i%N]);\n\t} // end rep\n\t\n\trep (i, numGroup){\n\t\tsort(ALL(Group[i]));\n//\t\tcerr << \"max: \" << Group[i][Group[i].size() - 1] << \" min: \" << Group[i][0] << endl; \n\t} // end rep\n\n\n\tint res = 0;\n\trep (i, numGroup){\n\t\tint range = Group[i][Group[i].size() - 1] - Group[i][0];\n\t\tres += range;\n\t} // end rep\n\n\tcout << res << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6900,"score_of_the_acc":-0.1518,"final_rank":10}],"string":"[\n {\n \"submission_id\": \"aoj_2806_3448657\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\nusing namespace std;\\n#define inRange(x,a,b) (a <= x && x < b)\\n\\nint main(){\\n int n, m;\\n cin >> n >> m;\\n int a[n];\\n for(int i = 0; i < n; i++) cin >> a[i];\\n priority_queue<pair<int,int>> l, r;\\n int ans = 0, cur = 0;\\n do{\\n for(int j = 0; j < m; j++) l.push({-a[cur%n], cur}), r.push({a[cur%n], cur}), cur++;\\n while(!inRange(l.top().second, cur-m, cur)) l.pop();\\n while(!inRange(r.top().second, cur-m, cur)) r.pop();\\n ans += r.top().first+l.top().first;\\n }while(cur%n);\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 17888,\n \"score_of_the_acc\": -1.5535,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2806_2995994\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n #include<iostream>\\n #include<cstdio>\\n #include<vector>\\n #include<queue>\\n #include<map>\\n #include<cstring>\\n #include<string>\\n #include <math.h>\\n #include<algorithm>\\n // #include <boost/multiprecision/cpp_int.hpp>\\n #include<functional>\\n #define int long long\\n #define inf 1000000007\\n #define pa pair<int,int>\\n #define ll long long\\n #define pal pair<double,double>\\n #define ppap pair<pa,int>\\n // #define PI 3.14159265358979323846\\n #define paa pair<int,char>\\n #define mp make_pair\\n #define pb push_back\\n #define EPS (1e-10)\\n #define equals(a,b) (fabs((a)-(b))<EPS)\\n int dx[4]={0,-1,0,1};\\n int dy[4]={1,0,-1,0};\\n using namespace std;\\n \\t\\t\\tclass pa3{\\n \\tpublic:\\n \\tint x,y,z;\\n \\tpa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}\\n \\tbool operator < (const pa3 &p) const{\\n \\t\\tif(x!=p.x) return x<p.x;\\n \\t\\tif(y!=p.y) return y<p.y;\\n \\t\\t return z<p.z;\\n \\t\\t//return x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\t\\t\\t\\tbool operator > (const pa3 &p) const{\\n \\t\\tif(x!=p.x) return x>p.x;\\n \\t\\tif(y!=p.y) return y>p.y;\\n \\t\\t return z>p.z;\\n \\t\\t//return x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator == (const pa3 &p) const{\\n \\t\\treturn x==p.x && y==p.y && z==p.z;\\n \\t}\\n \\t\\tbool operator != (const pa3 &p) const{\\n \\t\\t\\treturn !( x==p.x && y==p.y && z==p.z);\\n \\t}\\n \\n };\\n \\n class pa4{\\n \\tpublic:\\n \\tdouble x;\\n \\tint y,z,w;\\n \\tpa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}\\n \\tbool operator < (const pa4 &p) const{\\n \\t\\tif(x!=p.x) return x<p.x;\\n \\t\\tif(y!=p.y) return y<p.y;\\n \\t\\tif(z!=p.z)return z<p.z;\\n \\t\\treturn w<p.w;\\n \\t\\t//return x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator > (const pa4 &p) const{\\n \\t\\tif(x!=p.x) return x>p.x;\\n \\t\\tif(y!=p.y) return y>p.y;\\n \\t\\tif(z!=p.z)return z>p.z;\\n \\t\\treturn w>p.w;\\n \\t\\t//return x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator == (const pa4 &p) const{\\n \\t\\treturn x==p.x && y==p.y && z==p.z &&w==p.w;\\n \\t}\\n \\t\\t\\n \\n };\\n class pa2{\\n \\tpublic:\\n \\tint x,y;\\n \\tpa2(int x=0,int y=0):x(x),y(y) {}\\n \\tpa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}\\n \\tpa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}\\n \\tbool operator < (const pa2 &p) const{\\n \\t\\treturn y != p.y ? y<p.y: x<p.x;\\n \\t}\\n \\tbool operator > (const pa2 &p) const{\\n \\t\\treturn x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator == (const pa2 &p) const{\\n \\t\\treturn abs(x-p.x)==0 && abs(y-p.y)==0;\\n \\t}\\n \\tbool operator != (const pa2 &p) const{\\n \\t\\treturn !(abs(x-p.x)==0 && abs(y-p.y)==0);\\n \\t}\\n \\t\\t\\n \\n };\\n \\n #define ppa pair<int,pas>\\n class Point{\\n \\tpublic:\\n \\tdouble x,y;\\n \\tPoint(double x=0,double y=0):x(x),y(y) {}\\n \\tPoint operator + (Point p) {return Point(x+p.x,y+p.y);}\\n \\tPoint operator - (Point p) {return Point(x-p.x,y-p.y);}\\n \\tPoint operator * (double a) {return Point(x*a,y*a);}\\n \\tPoint operator / (double a) {return Point(x/a,y/a);}\\n \\tdouble absv() {return sqrt(norm());}\\n \\tdouble norm() {return x*x+y*y;}\\n \\tbool operator < (const Point &p) const{\\n \\t\\treturn x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator == (const Point &p) const{\\n \\t\\treturn fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\\n \\t}\\n };\\n typedef Point Vector;\\n #define pl pair<int,pas>\\n struct Segment{\\n Point p1,p2;\\n };\\n double dot(Vector a,Vector b){\\n \\treturn a.x*b.x+a.y*b.y;\\n }\\n double cross(Vector a,Vector b){\\n \\treturn a.x*b.y-a.y*b.x;\\n }\\n \\n bool parareru(Point a,Point b,Point c,Point d){\\n //\\tif(abs(cross(a-b,d-c))<EPS)cout<<\\\"dd \\\"<<cross(a-b,d-c)<<endl;\\n \\treturn abs(cross(a-b,d-c))<EPS;\\n }\\n double distance_ls_p(Point a, Point b, Point c) {\\n if ( dot(b-a, c-a) < EPS ) return (c-a).absv();\\n if ( dot(a-b, c-b) < EPS ) return (c-b).absv();\\n return abs(cross(b-a, c-a)) / (b-a).absv();\\n }\\n bool is_intersected_ls(Segment a,Segment b) {\\n \\tif(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;\\n \\tif(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){\\n //\\t\\tcout<<\\\"sss\\\"<<endl;\\n \\t\\tif(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;\\n \\t\\tif(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;\\n \\t\\tif(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;\\n \\t\\tif(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;\\n \\t\\treturn false;\\n \\t}\\n else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );\\n }\\n \\n double segment_dis(Segment a,Segment b){\\n \\tif(is_intersected_ls(a,b))return 0;\\n \\tdouble r=distance_ls_p(a.p1, a.p2, b.p1);\\n \\tr=min(r,distance_ls_p(a.p1, a.p2, b.p2));\\n \\tr=min(r,distance_ls_p(b.p1, b.p2, a.p2));\\n \\tr=min(r,distance_ls_p(b.p1, b.p2, a.p1));\\n \\treturn r;\\n }\\n Point intersection_ls(Segment a, Segment b) {\\n Point ba = b.p2-b.p1;\\n double d1 = abs(cross(ba, a.p1-b.p1));\\n double d2 = abs(cross(ba, a.p2-b.p1));\\n double t = d1 / (d1 + d2);\\n \\n return a.p1 + (a.p2-a.p1) * t;\\n }\\n \\n string itos( int i ) {\\n ostringstream s ;\\n s << i ;\\n return s.str() ;\\n }\\n \\n int gcd(int v,int b){\\n \\tif(v>b) return gcd(b,v);\\n \\tif(v==b) return b;\\n \\tif(b%v==0) return v;\\n \\treturn gcd(v,b%v);\\n }\\n \\n double distans(double x1,double y1,double x2,double y2){\\n \\tdouble rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);\\n \\treturn sqrt(rr);\\n \\t\\n }\\n int mod;\\n // int pr[2000010];\\n // int inv[2000010];\\n \\n int beki(int wa,int rr,int warukazu){\\n \\tif(rr==0) return 1%warukazu;\\n \\tif(rr==1) return wa%warukazu;\\n \\tif(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;\\n \\tint zx=beki(wa,rr/2,warukazu);\\n \\treturn (zx*zx)%warukazu;\\n }\\n /*\\n double bekid(double w,int r){\\n \\tif(r==0) return 1.0;\\n \\tif(r==1) return w;\\n \\tif(r%2) return bekid(w,r-1)*w;\\n \\tdouble f=bekid(w,r/2);\\n \\treturn f*f;\\n }\\n \\n \\t\\t\\tint comb(int nn,int rr){\\n \\t\\t\\t\\tint r=pr[nn]*inv[rr];\\n \\t\\t\\t\\tr%=mod;\\n \\t\\t\\t\\tr*=inv[nn-rr];\\n \\t\\t\\t\\tr%=mod;\\n \\t\\t\\t\\treturn r;\\n \\t\\t\\t}\\n \\n void gya(int ert){\\n \\tpr[0]=1;\\n \\tfor(int i=1;i<ert;i++){\\n \\t\\tpr[i]=(pr[i-1]*i)%mod;\\n \\t}\\n \\tfor(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);\\n \\t\\n }\\n */\\n // cin.tie(0);\\n \\t\\t//\\tios::sync_with_stdio(false);\\n \\t\\t\\t//priority_queue<pa3,vector<pa3>,greater<pa3>> pq; \\n //sort(ve.begin(),ve.end(),greater<int>());\\n //----------------kokomade tenpure------------\\n //vector<double> ans(100000000),ans2(100000000)\\nstring s;\\nint n,m;\\nint a[1003]={0};\\nint b[3];\\nvector<int> ve;\\n signed main(){\\n cin.tie(0);\\n \\t\\tios::sync_with_stdio(false);\\n \\tchar e='A';\\n \\t\\n \\tint ans1=0,ans2=0;\\n \\tcin>>n>>m;\\n \\tint g=gcd(n,m);\\n \\tint l=n*m/g;\\n \\t\\n \\tfor(int i=0;i<n;i++)cin>>a[i];\\n \\t\\n int ans=0; \\n \\tint c=0;\\n \\tfor(int j=0;;j=(j+m)%n){\\n \\t\\tif(j==0 && c!=0) break;\\n \\t\\tint mi=inf,ma=-inf;\\n \\t\\tfor(int i=j;i<j+m;i++){\\n \\t\\t\\tmi=min(mi,a[i%n]);\\n \\t\\t\\tma=max(ma,a[i%n]);\\n \\t\\t}\\n \\t\\tans+=ma-mi;\\n \\t\\tc++;\\n \\t}\\n \\tcout<<ans<<endl;\\n \\treturn 0;\\n \\t\\n }\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3236,\n \"score_of_the_acc\": -0.0178,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2806_2749083\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n/*{{{*/ //template\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\nconstexpr int INF = numeric_limits<int>::max()/2;\\nconstexpr long long LINF = numeric_limits<long long>::max()/3;\\n#define mp make_pair\\n#define pb push_back\\n#define eb emplace_back\\n#define fi first\\n#define se second\\n#define all(v) (v).begin(),(v).end()\\n#define sz(x) (int)(x).size()\\n#define debug(x) cerr<<#x<<\\\":\\\"<<x<<endl\\n#define debug2(x,y) cerr<<#x<<\\\",\\\"<<#y\\\":\\\"<<x<<\\\",\\\"<<y<<endl\\n//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;\\nstruct Double{ double d; explicit Double(double x) : d(x){} };\\nostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }\\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << \\\"[\\\"; for(const auto& v : vec){ os << v << \\\",\\\"; } os << \\\"]\\\"; return os; }\\ntemplate<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << \\\"(\\\" << p.first << \\\",\\\"<< p.second <<\\\")\\\"; return os; }\\ntemplate<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<\\\"{\\\"; for(T v:st) os<<v<<\\\",\\\"; os <<\\\"}\\\"; return os; }\\ntemplate<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }\\ntemplate<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\nll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }\\n//constexpr double eps = 1e-14; \\nconstexpr double eps = 1e-10; \\nconstexpr ll mod = 1e9+7;\\nconst int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};\\n/*}}}*/\\n\\nint main(){\\n ll n,m;\\n cin >> n >> m;\\n vi a(n);\\n rep(i,n) cin >> a[i];\\n\\n int lcm = n * m / gcd(n,m);\\n\\n vector<int> b(lcm);\\n for(int i=0;i<lcm;i++) b[i] = a[i%n];\\n\\n int index = 0;\\n ll ans = 0;\\n while(index < lcm){\\n ll max = numeric_limits<ll>::min();\\n ll min = numeric_limits<ll>::max();\\n for(int i=0;i<m;i++){\\n chmax(max,b[index + i]);\\n chmin(min,b[index + i]);\\n }\\n ans += max - min;\\n index += m;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6520,\n \"score_of_the_acc\": -0.1379,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2806_2585014\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nint N, M;\\nint A[1000];\\nint dp_max[2000][2000];\\nint dp_min[2000][2000];\\n\\nint main()\\n{\\n\\tscanf(\\\"%d %d\\\", &N, &M);\\n\\tfor(int i = 0; i < N; i++)\\n\\t{\\n\\t\\tscanf(\\\"%d\\\", &A[i]);\\n\\t}\\n\\n\\tdp_max[0][0] = A[0];\\n\\tdp_min[0][0] = A[0];\\n\\tfor(int i = 1; i < 2 * N; i++)\\n\\t{\\n\\t\\tint w = A[i % N];\\n\\t\\tdp_max[i][i] = w;\\n\\t\\tdp_min[i][i] = w;\\n\\t\\tfor(int j = 0; j < i; j++)\\n\\t\\t{\\n\\t\\t\\tdp_max[j][i] = std::max(dp_max[j][i - 1], w);\\n\\t\\t\\tdp_min[j][i] = std::min(dp_min[j][i - 1], w);\\n\\t\\t}\\n\\t}\\n\\n\\tlong ans = 0;\\n\\tfor(int i = 0; ; i += M)\\n\\t{\\n\\t\\tif(i != 0 && i % N == 0) break;\\n\\t\\tint j = i % N;\\n\\t\\tans += dp_max[j][j + M - 1] - dp_min[j][j + M - 1];\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 30100,\n \"score_of_the_acc\": -2,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2806_2449444\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n queue<int>q;\\n int a[n],ans=0;\\n r(i,n)cin>>a[i];\\n int lcm=n*m/__gcd(n,m);\\n r(i,lcm)q.push(a[i%n]);\\n r(i,lcm){\\n int l=1e9,r=0,p;\\n for(int k=0;k<m;k++){\\n p=q.front();q.pop();\\n l=min(l,p);\\n r=max(r,p);\\n i++;\\n }\\n ans+=r-l;\\n i--;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6748,\n \"score_of_the_acc\": -0.1462,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2806_2434774\",\n \"code_snippet\": \"#include<cstdio>\\n#include<algorithm>\\n#include<functional>\\nusing namespace std;\\nint main(void)\\n{\\n\\tint i,j,p,n,m,a[1000],sum,mi,mx,p2;\\n\\tscanf(\\\"%d %d\\\",&n,&m);\\n\\tfor(i=0;i<n;i++)\\tscanf(\\\"%d\\\",&a[i]);\\n\\tsum=0;\\n\\tp=0;\\n\\twhile(1)\\t{\\n\\t\\tmi=a[p];\\tmx=a[p];\\n\\t\\tp=(p+1)%n;\\n\\t\\tfor(i=1;i<m;i++)\\t{\\n\\t\\t\\tmi=min(mi,a[p]);\\n\\t\\t\\tmx=max(mx,a[p]);\\n\\t\\t\\tp=(p+1)%n;\\n\\t\\t}\\n\\t\\tsum+=mx-mi;\\n\\t\\tif(p==0)\\tbreak;\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\",sum);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2748,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2806_2330115\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, const pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n int N, M; cin >> N >> M;\\n VL xs(N);\\n REP(i,N) cin >> xs[i];\\n\\n int lcm = N * M / __gcd(N, M);\\n LL ans = 0;\\n set<int> q;\\n for(int i=0;i<lcm;++i){\\n\\tq.insert(xs[i%N]);\\n\\tif((i+1)%M == 0){\\n\\t ans += *--end(q) - *begin(q);\\n\\t q.clear();\\n\\t}\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.0165,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2806_2329972\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <climits>\\n\\nint lcm(int a, int b)\\n{\\n return a / std::__gcd(a, b) * b;\\n}\\n\\nint main()\\n{\\n int N, M;\\n std::cin >> N >> M;\\n \\n std::vector<int> A(N);\\n for (int i = 0; i < N; i++) {\\n std::cin >> A[i];\\n }\\n \\n int res = 0;\\n int max = INT_MIN, min = INT_MAX;\\n for (int i = 0, j = 0; i < lcm(N, M); i++, j++) {\\n max = std::max(max, A[i % N]);\\n min = std::min(min, A[i % N]);\\n \\n if (j + 1 == M) {\\n res += max - min;\\n j = -1;\\n max = INT_MIN;\\n min = INT_MAX;\\n }\\n }\\n std::cout << res << std::endl; \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -0.6794,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2806_2329968\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <climits>\\n\\nint lcm(int a, int b)\\n{\\n return a / std::__gcd(a, b) * b;\\n}\\n\\nint main()\\n{\\n int N, M;\\n std::cin >> N >> M;\\n \\n std::vector<int> A(N);\\n for (int i = 0; i < N; i++) {\\n std::cin >> A[i];\\n }\\n \\n long long res = 0;\\n int max = INT_MIN, min = INT_MAX;\\n for (int i = 0, j = 0; i < lcm(N, M); i++, j++) {\\n max = std::max(max, A[i % N]);\\n min = std::min(min, A[i % N]);\\n \\n if (j + 1 == M) {\\n res += max - min;\\n j = -1;\\n max = INT_MIN;\\n min = INT_MAX;\\n }\\n }\\n std::cout << res << std::endl; \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -0.6794,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2806_2265401\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\\n#define each(a,x) for(auto a : (x))\\n#define all(a) (a).begin(),(a).end()\\n#define chmin(a,b) ((a) = min((a),(b)))\\n#define chmax(a,b) ((a) = max((a),(b)))\\n#define in_range(x,l,r) ((l)<=(x) && (x)<(r))\\n#define printvec(a) rep(i,a) cout << a[i] << \\\" \\\\n\\\"[i+1==(a).size()];\\n#define fs first\\n#define sc second\\n#define em emplace\\n#define eb emplace_back\\n#define sz size()\\n#define MP make_pair\\nusing namespace std;\\ntypedef long long ll;\\ntypedef double D;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef vector<string> vs;\\n\\nconst ll INF = 1e8;\\nconst D EPS = 1e-8;\\nconst ll MOD = 1e9+7;\\n\\nint main(){\\n ll n,m;\\n cin >> n >> m;\\n vl a(n);\\n rep(i,n) cin >> a[i];\\n\\n ll l = n/__gcd(n,m), cur = 0;\\n ll sum = 0;\\n rep(azu,l){\\n ll min_v = a[cur], max_v = a[cur];\\n rep(i,m){\\n chmin(min_v, a[cur]);\\n chmax(max_v, a[cur]);\\n cur = (cur + 1) % n;\\n }\\n sum += max_v - min_v;\\n }\\n cout << sum << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.0121,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2806_2235406\",\n \"code_snippet\": \"#include<algorithm>\\n#include<iostream>\\n#include<vector>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n\\nint main(){\\n int N,M;\\n cin>>N>>M;\\n vector<int> A(N);\\n rep(i,N)cin>>A[i];\\n \\n vector<int> v(N); //v[i]: A[i]~A[i+M-1]?????§?????°????????????????????¨???????????°???????????????\\n \\n //v[i]????±?????????????( O(N M logM) )\\n rep(i,N){\\n vector<int> tmp;\\n for(int j=i;j<i+M;j++) tmp.pb( A[j%N] );\\n \\n sort(all(tmp));\\n int maxi = tmp[tmp.size()-1];\\n int mini = tmp[0];\\n \\n v[i] = maxi - mini;\\n }\\n \\n int ans = 0;\\n int lcm = N*M/__gcd(N,M);\\n \\n rep(i,lcm/M){ //????\\\\???? LCM(N,M)/M ???????????????LCM(N,M)/M????????°??????????????§??????\\n int index = (i*M)%N;\\n ans+=v[index];\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -0.0145,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2806_2228924\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\n \\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\\ntypedef long long i64;\\n \\nint gcd(int x, int y) {\\n\\treturn y ? gcd(y, x % y) : x;\\n}\\n \\nint a[1000];\\n \\nint main() {\\n\\t// your code goes here\\n\\tint n, m;\\n\\tcin >> n >> m;\\n\\trep(i, n) {\\n\\t\\tcin >> a[i];\\n\\t}\\n\\t// Pick nm/gcd(n, m) = lcm(n, m) times.\\n\\ti64 tot = 0;\\n\\tint g = gcd(n, m);\\n\\trep(i, n / g) {\\n\\t\\tvector<int> t;\\n\\t\\trep(j, m) {\\n\\t\\t\\t// (i * m + j) % n -th is taken\\n\\t\\t\\tt.push_back(a[(i * m + j) % n]);\\n\\t\\t}\\n\\t\\tsort(t.begin(), t.end());\\n\\t\\ttot += t[t.size() - 1] - t[0];\\n\\t}\\n\\tcout << tot << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3092,\n \"score_of_the_acc\": -0.0126,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2806_2227918\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nconst int inf = numeric_limits<int>::max();\\n\\nint gcd(int a,int b){\\n if(b > a)swap(a,b);\\n if(a % b == 0)return b;\\n else return gcd(b,a%b);\\n}\\n\\nint main(void){\\n ll n,m;\\n ll a[1100];\\n cin >> n >> m;\\n for(int i = 0;i < n;++i)cin >> a[i];\\n int now = 0;\\n ll res = 0;\\n ll r = (n*m)/gcd(n,m);\\n r /= m;\\n for(int i = 0;i < r;++i){\\n ll ma = 0;\\n ll mi = inf;\\n for(int j = 0;j < m;++j){\\n ma = max(ma,a[now]);\\n mi = min(mi,a[now]);\\n ++now;\\n now %= n;\\n }\\n res += ma - mi;\\n }\\n cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3048,\n \"score_of_the_acc\": -0.011,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2806_2227890\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define ALL(A) A.begin(), A.end()\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\n\\nint main()\\n{\\n\\tios_base::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\tint N, M; cin >> N >> M;\\n\\tvector<int> a(N, 0);\\n\\trep (i, N) cin >> a[i];\\n\\n\\tint g = __gcd(N, M);\\n\\tint L = N * M / g;\\n\\tint numGroup = L / M; \\n\\n\\tvector<int> Group[numGroup];\\n\\trep (i, numGroup) Group[i].clear();\\n\\trep (i, L){\\n\\t\\tGroup[i/M].push_back(a[i%N]);\\n\\t} // end rep\\n\\t\\n\\trep (i, numGroup){\\n\\t\\tsort(ALL(Group[i]));\\n//\\t\\tcerr << \\\"max: \\\" << Group[i][Group[i].size() - 1] << \\\" min: \\\" << Group[i][0] << endl; \\n\\t} // end rep\\n\\n\\n\\tint res = 0;\\n\\trep (i, numGroup){\\n\\t\\tint range = Group[i][Group[i].size() - 1] - Group[i][0];\\n\\t\\tres += range;\\n\\t} // end rep\\n\\n\\tcout << res << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6900,\n \"score_of_the_acc\": -0.1518,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":1687,"cells":{"group_id":{"kind":"string","value":"aoj_2807_cpp"},"problem_description":{"kind":"string","value":"C: Fractal Tree\n問題\nAORイカちゃんは、フラクタルな(自己相似的な)構造を持つ根付き木が好きである。\n$N$ 頂点から成る重み付き根付き木 $T$ を用いて、以下のようなフラクタル構造を持つ根付き木 $T'$ を表現することを考える。\n$T'$ は、$T$ の各頂点 $x$ に対して、$x$ を根として $T$ と同様の木構造 (コストも同じ) を持つ木を付け加えたものである。\n$T'$の根は $T$ のものと同じものである。\nこうして表現される木は例えば下図のようになる。\nAOR イカちゃんは、$T'$ に対して深さ優先探索をしようとしているが、全ての頂点を辿ると時間がとてもかかることに気づいた。\nそこで、深さ優先探索時の遷移の際に確率 $p$ で遷移し、確率 $1-p$ で遷移しない方針で深さ優先探索を行い、いくつかのノード訪問をサボることにした。\n$T$ と確率 $p$ が与えられるので、$T’$ に対して深さ優先探索を行う際に辿る全ての辺のコストの和の期待値を求めよ。\n$T$ の情報は頂点数 $N$ と $N-1$ 本の辺の情報で与えられ、頂点 $1$ が根である。\n各頂点は $1,2,\\dots,N$ とラベリングされており、 $i \\ (1 \\le i \\le N-1)$ 番目の辺は頂点 $x_i$ と $y_i$ をコスト $c_i$ で結んでいる。\n今回の問題で扱う、確率 $p$ で子に遷移する深さ優先探索の非決定的アルゴリズムは以下のように表現される。\n出力される $\\mathrm{answer}$ が辿る辺のコストの総和である。\n空のスタック $S$ を用意する。\n$\\mathrm{answer}=0$ とする\n$S$ に $T'$ の根頂点をプッシュする。\n$S$ の先頭の要素を取り出し、これを $x$ とする。\n$x$ の各子 $c$ に対し、それぞれ確率 $p$ で次の操作を行い、確率 $1-p$ で何もしない。\n$S$ に頂点 $c$ を追加する。そして $\\mathrm{answer}$ に $x$ から $c$ に繋がっている辺の重みを加える。\nSが空でなければ、3. に遷移する。\n$\\mathrm{answer}$ を出力する。\n制約\n$2 \\le N \\le 10^5$\n$0 \\le p \\le 1.0$ (小数点第 2 位まで与えられる。)\n$1 \\le x_i,y_i \\le N$\n$1 \\le c_i \\le 1000$\n$c_i$ は整数である\n与えられるグラフは $N$ 頂点の根付き木である。すなわち、頂点 $N$、辺数 $N-1$、連結という性質を持つグラフであり、頂点 $1$ が根である。\n入力形式\n入力は以下の形式で与えられる。\n$p$\n$N$\n$x_1 \\ y_1 \\ c_1$\n$\\vdots$\n$x_{N-1} \\ y_{N-1} \\ c_{N-1}$\n出力\n答えを 1 行で出力せよ。相対誤差または絶対誤差が $10^{-6}$ 以下なら AC となる。また、末尾に改行も出力せよ。\nサンプル\nサンプル入力1\n0.75\n4\n1 2 1\n2 3 3\n3 4 10\nサンプル出力1\n24.8569335938\nサンプル入力2\n0.75\n4\n1 2 1\n1 3 3\n3 4 10\nサンプル出力2\n35.0390625\n問題文の図の木を与える例である。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2807_9117947","code_snippet":"#include <bits/stdc++.h>\n#include <vector>\nusing namespace std;\nint inf=100000000;\nusing ll=long long;\nusing pint=pair<int,int>;\nusing pll=pair<ll,ll>;\nusing pque_int=priority_queue<int>;\n#define rep(i,n) for (int i=0; i < (int) n; i++)\n#define _GLIBCXX_DEBUG\ntemplate<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }\nint VecMax(vector<int> &v) {\n int output=-inf;\n rep(i,v.size()) chmax(output,v[i]);\n return output;\n}\nint VecMin(vector<ll> &v) {\n ll output=inf;\n rep(i,v.size()) chmin(output,v[i]);\n return output;\n}\nll VecSum(vector<int> &v) {\n ll output=0;\n rep(i,v.size()) output+=v[i];\n return output;\n}\nll pow(ll a,ll n) {\n ll output=1;\n while (n>0) output*=a;\n return output;\n}\nint dir(char c) {\n if (c=='L') return 3;\n else if (c=='R') return 1;\n else if (c=='U') return 2;\n else return 0;\n}\n\nint main() {\n double p;\n int N;\n cin >> p >> N;\n vector<int> x(N-1),y(N-1);\n map<pint,int> c;\n rep(i,N-1) {\n cin >> x[i] >> y[i];\n x[i]--; y[i]--;\n int in;\n cin >> in;\n c[make_pair(x[i],y[i])]=in;\n c[make_pair(y[i],x[i])]=in;\n }\n vector<double> power_p(N+1);\n double s=1;\n rep(i,N) {\n power_p[i]=s;\n s*=p;\n }\n power_p[N]=s;\n\n\n vector<vector<int>> graph(N);\n rep(i,N) {\n graph[x[i]].push_back(y[i]);\n graph[y[i]].push_back(x[i]);\n }\n deque<int> todo;\n todo.push_back(0);\n vector<int> seen(N,-1);\n vector<double> score(N,-1.0);\n seen[0]=0;\n score[0]=0.0;\n vector<int> end;\n while(!todo.empty()) {\n int x=todo.back();\n todo.pop_back();\n bool flag=true;\n for (auto nx:graph[x]) {\n if (seen[nx]<0) {\n seen[nx]=seen[x]+1;\n score[nx]= c[make_pair(x,nx)]*power_p[seen[nx]];\n todo.push_back(nx);\n flag=false;\n } \n }\n if (flag) {\n end.push_back(x);\n }\n }\n double endscore=0;\n rep(i,N) {\n endscore+=score[i];\n }\n\n double ans=0;\n rep(i,N) {\n ans+=power_p[seen[i]]*endscore+score[i];\n }\n cout << std::fixed << std::setprecision(9);\n cout << ans << endl;\n}","accuracy":1,"time_ms":130,"memory_kb":24316,"score_of_the_acc":-1.863,"final_rank":13},{"submission_id":"aoj_2807_9117670","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\n\ntemplate <typename T> bool chmin(T &a, const T &b) {\n\tif (a <= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> bool chmax(T &a, const T &b) {\n\tif (a >= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> T max(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T min(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T sum(vector<T> &a){\n\tT ret = 0;\n\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\n\treturn ret;\n}\n\nint main(){\n\tlong double p; cin >> p;\n\tint n; cin >> n;\n\n\tvector ikeru(n, vector<pair<int,double>>(0));\n\trep(i,0,n-1){\n\t\tint a, b; cin >> a >> b;\n\t\ta--; b--;\n\t\tlong double c; cin >> c;\n\t\tikeru[a].push_back(pair(b, c));\n\t\tikeru[b].push_back(pair(a, c));\n\n\n\t}\n\n\tvector<long double> dp1(n), dp2(n);\n\tauto dfs = [&](auto self, int i, int x, vector<long double> &dp, long double geta) -> void {\n\t\tdp[i] += geta;\n\t\tfor (auto [j, c]: ikeru[i]){\n\t\t\tif (j == x) continue;\n\t\t\tself(self, j, i, dp, geta);\n\t\t\tdp[i] += p * c;\n\t\t\tdp[i] += p * dp[j];\n\t\t}\n\t};\n\n\t\n\n\tdfs(dfs,0,-1,dp1,0);\n\tdfs(dfs,0,-1,dp2,dp1[0]);\n\n\tcout << fixed << setprecision(15);\n\tcout << dp2[0] << '\\n';\n}","accuracy":1,"time_ms":60,"memory_kb":27340,"score_of_the_acc":-1.3636,"final_rank":12},{"submission_id":"aoj_2807_9117597","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\n\nvoid solve(){\n ld p; in(p);\n int n; in(n);\n using pid = pair<int,ld>;\n vector<vector<pid>> g(n);\n rep(i,n-1){\n int u, v; in(u,v); u--, v--;\n ld c; in(c);\n g[u].emplace_back(v,c);\n g[v].emplace_back(u,c);\n }\n ld sum = 0;\n auto dfs = [&](auto sfs, int v, int f, ld pp) -> void {\n for (auto [u, c] : g[v]){\n if (u == f) continue;\n sum += pp*p * c;\n sfs(sfs,u,v,pp*p);\n }\n };\n dfs(dfs,0,-1,1);\n ld ans = sum;\n auto efs = [&](auto sfs, int v, int f, ld pp) -> void {\n ans += pp * sum;\n for (auto [u, c] : g[v]){\n if (u == f) continue;\n sfs(sfs,u,v,pp*p);\n }\n };\n efs(efs,0,-1,1);\n out(ans);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":1,"time_ms":40,"memory_kb":22676,"score_of_the_acc":-0.9706,"final_rank":8},{"submission_id":"aoj_2807_9117596","code_snippet":"#pragma region //comavius::competitive library\n\n#pragma region //inclusion and optimization\n#include <bits/stdc++.h>\n#ifdef IS_TEST\nstatic const bool IS_TEST_ENVIROMENT = true;\n#else\nstatic const bool IS_TEST_ENVIROMENT = false;\n#endif\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma endregion //inclusion and optimization\n\nnamespace comavius::competitive { //typedefs\n\n #pragma region //long long\n typedef long long ll;\n typedef std::vector<ll> vll;\n typedef std::vector<vll> vvll;\n typedef std::vector<vvll> vvvll;\n typedef std::map<ll, ll> mll;\n typedef std::map<ll, mll> mmll;\n typedef std::pair<ll, ll> pll;\n typedef std::vector<pll> vpll;\n #pragma endregion //long long\n\n #pragma region //long double\n typedef long double ld;\n typedef std::vector<ld> vld;\n typedef std::vector<vld> vvld;\n typedef std::vector<vvld> vvvld;\n #pragma endregion //long double\n\n #pragma region //std::string\n typedef std::string str;\n typedef std::vector<str> vstr;\n typedef std::vector<vstr> vvstr;\n typedef std::vector<vvstr> vvvstr;\n #pragma endregion //std::string\n\n #pragma region //bool\n typedef std::vector<bool> vb;\n typedef std::vector<vb> vvb;\n typedef std::vector<vvb> vvvb;\n #pragma endregion //bool\n\n #pragma region //char\n typedef std::vector<char> vc;\n typedef std::vector<vc> vvc;\n typedef std::vector<vvc> vvvc;\n #pragma endregion //char\n\n #pragma region //container of std\n #pragma region //std::vector\n template <typename T>\n using vec = std::vector<T>;\n template <typename T>\n using vec2 = std::vector<std::vector<T>>;\n template <typename T>\n using vec3 = std::vector<std::vector<std::vector<T>>>;\n template <typename T>\n using vec4 = std::vector<std::vector<std::vector<std::vector<T>>>>;\n template <typename T>\n using vec5 = std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>;\n template <typename T>\n using vec6 = std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>>;\n template <typename T>\n using vec7 = std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>>>;\n #pragma endregion //std::vector\n #pragma endregion //container of std\n\n} // namespace comavius::competitive typedefs\n\n\n#pragma region //Read macro\n #define GET_1_ARG(TYPE, ARG); TYPE ARG; std::cin >> ARG;\n #define GET_2_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_1_ARG(TYPE, __VA_ARGS__)\n #define GET_3_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_2_ARG(TYPE, __VA_ARGS__)\n #define GET_4_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_3_ARG(TYPE, __VA_ARGS__)\n #define GET_5_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_4_ARG(TYPE, __VA_ARGS__)\n #define GET_6_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_5_ARG(TYPE, __VA_ARGS__)\n #define GET_7_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_6_ARG(TYPE, __VA_ARGS__)\n #define GET_8_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_7_ARG(TYPE, __VA_ARGS__)\n #define GET_9_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_8_ARG(TYPE, __VA_ARGS__)\n #define GET_10_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_9_ARG(TYPE, __VA_ARGS__)\n\n #define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME\n #define read(TYPE, ...) GET_MACRO(__VA_ARGS__, GET_10_ARG, GET_9_ARG, GET_8_ARG, GET_7_ARG, GET_6_ARG, GET_5_ARG, GET_4_ARG, GET_3_ARG, GET_2_ARG, GET_1_ARG)(TYPE, __VA_ARGS__)\n\n #define readv(TYPE, NAME, SIZE) std::vector<TYPE> NAME(SIZE); for (long long i = 0; i < SIZE; i++) std::cin >> NAME[i];\n #define readvv(TYPE, NAME, H, W) std::vector<std::vector<TYPE>> NAME(H, std::vector<TYPE>(W)); for (long long i = 0; i < H; i++) for (long long j = 0; j < W; j++) std::cin >> NAME[i][j];\n#pragma endregion //Read macro\n\n#pragma region //Other macro\n #define rep(i, n) for (ll i = 0; i < n; i++)\n #define reps(i, start, goal, diff) for (ll i = start; i != goal; i += diff)\n #define all(a) a.begin(), a.end()\n// #define chmax(a, b) a = std::max(a, b)\n// #define chmin(a, b) a = std::min(a, b)\n#pragma endregion //Other macro\n\n#pragma region //namespace expansion\n using namespace std;\n using namespace comavius::competitive;\n#pragma endregion //namespace expansion\n\n#pragma endregion //comavius::competitive library\n\n\n\n#pragma region // fundamental structures\n\nusing vvpll = vector<vpll>;\n\nint main() {\n read(ld, p);\n read(ll, n);\n vvpll adj(n);\n rep(i, n-1) {\n read(ll,x,y,c);\n x--;y--;\n adj[x].push_back({y, c});\n adj[y].push_back({x, c});\n }\n vld reach_prob(n, 0);\n reach_prob[0] = 1;\n ld cost_sum = 0;\n queue<ll> q;\n q.push(0);\n vb visited(n, false);\n visited[0] = true;\n while(q.size()) {\n ll cur = q.front();\n q.pop();\n for (auto [next, cost] : adj[cur]) {\n if (visited[next]) continue;\n reach_prob[next] = reach_prob[cur] * p;\n cost_sum += ll(cost) * reach_prob[next];\n q.push(next);\n visited[next] = true;\n }\n }\n ld cost_fr = cost_sum;\n rep(i, n) {\n cost_fr += cost_sum * reach_prob[i];\n }\n cout << setprecision(15) << cost_fr << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":12144,"score_of_the_acc":-0.5845,"final_rank":4},{"submission_id":"aoj_2807_9117589","code_snippet":"//#include<atcoder/all>\n//using namespace atcoder;\n\n#include <bits/stdc++.h>\ntemplate<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}\ntemplate<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}\n#define ll long long\n#define double long double\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define REP(i,n) for(int i=1;i<=(n);i++)\n#define mod (ll)(1e9+7)\n#define inf (ll)(3e18+7)\n#define eps (double)(1e-9)\n#define pi (double) acos(-1)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\nusing namespace std;\n\nstruct edge{\n int to, cost;\n};\n\nusing Graph = vector<vector<edge>>;\n\ndouble P;\nvector<double> dp1(100010, -1);\nvector<double> dp2(100010, -1);\n\ndouble dfs1(const Graph &G, int v, int p){\n if(dp1[v] != -1)return dp1[v];\n\n double now = 0;\n for(auto nv : G[v]){\n if(nv.to == p)continue;\n now += P * (dfs1(G, nv.to, v) + nv.cost);\n }\n\n return dp1[v] = now;\n}\n\ndouble dfs2(const Graph &G, int v, int p){\n if(dp2[v] != -1)return dp2[v];\n \n double now = 0;\n for(auto nv : G[v]){\n if(nv.to == p)continue;\n now += P * (dfs2(G, nv.to, v) + nv.cost);\n }\n now += dp1[0];\n\n return dp2[v] = now;\n}\n\nint main(){\n int n;\n cin >> P >> n;\n Graph G(n);\n rep(i, n-1){\n int x, y, z;\n cin >> x >> y >> z;\n x--; y--;\n G[x].push_back({y, z});\n G[y].push_back({x, z});\n }\n\n dfs1(G, 0, -1);\n dfs2(G, 0, -1);\n\n cout << fixed << setprecision(15) << dp2[0] << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":21084,"score_of_the_acc":-1.0803,"final_rank":9},{"submission_id":"aoj_2807_9117546","code_snippet":"// #ifndef ONLINE_JUDGE\n#if __has_include(\"all.h\")\n\n#include \"all.h\"\n\n#else\n\n#include <bits/extc++.h>\n\n// #include <atcoder/all>\n\n#endif\n\nusing ll = long long int;\n\ntemplate <class T>\nbool chmin(T &x, const T val) {\n if (x > val) {\n x = val;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T>\nbool chmax(T &x, const T val) {\n if (x < val) {\n x = val;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class... T>\nstd::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) {\n std::apply([&](auto &&...args) { (is >> ... >> args); }, tpl);\n return is;\n}\n\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &x : v) is >> x;\n return is;\n}\n\n// template <class mint, atcoder::internal::is_static_modint_t<mint> * =\n// nullptr> std::ostream &operator<<(std::ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (int i = 0; i < v.size(); i++)\n os << v[i] << (i == v.size() - 1 ? \"\" : \" \");\n return os;\n}\n\nstruct Initialization {\n Initialization() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n} initialization;\n\nconstexpr std::pair<int, int> dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\n\ntemplate <typename T>\nusing infs = std::numeric_limits<T>;\n\ntemplate <typename T>\nclass factorials {\n public:\n static size_t n;\n static std::vector<T> fact, inv_fact;\n\n static void extend(size_t m) {\n if (m <= n) return;\n fact.resize(m + 1);\n inv_fact.resize(m + 1);\n for (size_t i = n + 1; i <= m; i++) fact[i] = fact[i - 1] * i;\n inv_fact[m] = fact[m].inv();\n for (size_t i = m; i > n + 1; i--) inv_fact[i - 1] = inv_fact[i] * i;\n n = m;\n }\n\n static T inv(int k) {\n extend(k);\n return inv_fact[k];\n }\n\n static T get(int k) {\n extend(k);\n return fact[k];\n }\n\n static T perm(int n, int k) {\n if (n < k) return 0;\n if (k < 0) return 0;\n extend(n);\n return fact[n] * inv_fact[n - k];\n }\n\n static T choose(int n, int k) {\n if (n < k) return 0;\n if (k < 0) return 0;\n extend(n);\n return fact[n] * inv_fact[n - k] * inv_fact[k];\n }\n};\n\ntemplate <typename T>\nsize_t factorials<T>::n = 0;\n\ntemplate <typename T>\nstd::vector<T> factorials<T>::fact = {1};\n\ntemplate <typename T>\nstd::vector<T> factorials<T>::inv_fact = {1};\n\n// template <typename T>\n// class fps {\n// std::vector<T> v;\n//\n// public:\n// using value_type = T;\n// using reference = T &;\n// using const_reference = const T &;\n// using iterator = typename std::vector<T>::iterator;\n// using const_iterator = typename std::vector<T>::const_iterator;\n//\n// size_t size() const { return v.size(); }\n//\n// const std::vector<T> &data() const { return v; }\n//\n// explicit fps(int n) : v(n) {}\n//\n// fps(const std::vector<T> &v) : v(v) {}\n// fps(std::vector<T> &&v) : v(v) {}\n//\n// template <class InputIterator>\n// fps(InputIterator first, InputIterator last) : v(first, last) {}\n//\n// void resize(int n) { v.resize(n); }\n//\n// T &operator[](int i) { return v[i]; }\n//\n// iterator begin() { return v.begin(); }\n//\n// iterator end() { return v.end(); }\n//\n// fps diff() {\n// std::vector<T> res(v.size() - 1);\n// for (int i = 0; i < res.size(); i++) res[i] = v[i + 1] * (i + 1);\n// return fps(res);\n// }\n//\n// fps integral() {\n// std::vector<T> res(v.size() + 1);\n// for (int i = 0; i < v.size(); i++) res[i + 1] = v[i] / (i + 1);\n// return fps(res);\n// }\n//\n// fps inv(int deg = -1) {\n// assert(v[0] != 0);\n//\n// if (deg == -1) deg = size();\n// std::vector<T> res(deg);\n//\n// res[0] = v[0].inv();\n//\n// for (int d = 1; d < deg; d <<= 1) {\n// std::vector<T> f(2 * d), g(2 * d);\n//\n// std::copy(v.begin(), v.begin() + std::min(2 * d, (int)v.size()),\n// std::back_inserter(f));\n// std::copy(res.begin(), res.begin() + d, std::back_inserter(g));\n//\n// atcoder::internal::butterfly(f);\n// atcoder::internal::butterfly(g);\n//\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\n//\n// atcoder::internal::butterfly_inv(f);\n//\n// for (int i = 0; i < d; i++) f[i] = 0;\n//\n// atcoder::internal::butterfly(f);\n//\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\n//\n// atcoder::internal::butterfly_inv(f);\n//\n// for (int i = d; i < std::min(2 * d, deg); i++) res[i] = -f[i];\n// }\n//\n// res.resize(deg);\n//\n// return res;\n// }\n//\n// fps shift(T c) {\n// std::vector<T> res(size()), ifacts(size());\n//\n// T x = 1;\n//\n// for (int i = 0; i < size(); i++) {\n// ifacts[i] = x * factorials<T>::inv(i);\n// x *= c;\n// }\n//\n// for (int i = 0; i < size(); i++) {\n// res[size() - 1 - i] = v[i] * factorials<T>::get(i);\n// }\n//\n// res = atcoder::convolution(res, ifacts);\n//\n// res.resize(size());\n//\n// std::ranges::reverse(res);\n//\n// for (int i = 0; i < size(); i++) {\n// res[i] *= factorials<T>::inv(i);\n// }\n//\n// return res;\n// }\n//\n// fps operator-() {\n// fps res(v.size());\n// for (int i = 0; i < v.size(); i++) res[i] = -v[i];\n// return res;\n// }\n//\n// fps &operator+=(const fps &rhs) {\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\n// for (int i = 0; i < rhs.v.size(); i++) v[i] += rhs.v[i];\n// return *this;\n// }\n//\n// fps &operator-=(const fps &rhs) {\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\n// for (int i = 0; i < rhs.v.size(); i++) v[i] -= rhs.v[i];\n// return *this;\n// }\n//\n// fps &operator*=(const fps &rhs) {\n// return *this = atcoder::convolution(v, rhs.v);\n// }\n//\n// fps &operator+=(const T &rhs) {\n// if (v.size() == 0) v.resize(1);\n// v[0] += rhs;\n// return *this;\n// }\n//\n// fps &operator-=(const T &rhs) {\n// if (v.size() == 0) v.resize(1);\n// v[0] -= rhs;\n// return *this;\n// }\n//\n// fps &operator*=(const T &rhs) {\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs;\n// return *this;\n// }\n//\n// fps &operator/=(const T &rhs) {\n// T rhs_inv = rhs.inv();\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs_inv;\n// return *this;\n// }\n//\n// friend fps operator+(const fps &lhs, const fps &rhs) {\n// return fps(lhs) += rhs;\n// }\n//\n// friend fps operator-(const fps &lhs, const fps &rhs) {\n// return fps(lhs) -= rhs;\n// }\n//\n// friend fps operator*(const fps &lhs, const fps &rhs) {\n// return fps(lhs) *= rhs;\n// }\n//\n// friend fps operator+(const fps &lhs, const T &rhs) { return fps(lhs) +=\n// rhs; }\n//\n// friend fps operator-(const fps &lhs, const T &rhs) { return fps(lhs) -=\n// rhs; }\n//\n// friend fps operator*(const fps &lhs, const T &rhs) { return fps(lhs) *=\n// rhs; }\n//\n// friend fps operator/(const fps &lhs, const T &rhs) { return fps(lhs) /=\n// rhs; }\n//\n// friend fps operator+(const T &lhs, const fps &rhs) { return fps(rhs) +=\n// lhs; }\n//\n// friend fps operator-(const T &lhs, const fps &rhs) {\n// return -(fps(rhs) -= lhs);\n// }\n//\n// friend fps operator*(const T &lhs, const fps &rhs) { return fps(rhs) *=\n// lhs; }\n// };\n\n// using mint = atcoder::modint998244353;\n// using mint = atcoder::modint1000000007;\n\n// using fs = factorials<mint>;\n\nint main() {\n double p;\n ll N;\n std::cin >> p >> N;\n\n std::vector graph(N, std::vector<std::pair<int, int>>());\n\n for (int i = 0; i < N - 1; i++) {\n int x, y, c;\n std::cin >> x >> y >> c;\n x--;\n y--;\n graph[x].emplace_back(y, c);\n graph[y].emplace_back(x, c);\n }\n\n auto rec1 = [&](auto self, int v, int par = -1) -> double {\n double result = 0;\n\n for (auto [w, c] : graph[v]) {\n if (par == w) continue;\n result += p * (c + self(self, w, v));\n }\n\n return result;\n };\n\n double orig = rec1(rec1, 0);\n\n auto rec2 = [&](auto self, int v, int par = -1) -> double {\n double result = orig;\n\n for (auto [w, c] : graph[v]) {\n if (par == w) continue;\n result += p * (c + self(self, w, v));\n }\n\n return result;\n };\n\n std::cout << std::fixed << std::setprecision(15) << rec2(rec2, 0)\n << std::endl;\n}","accuracy":1,"time_ms":20,"memory_kb":18012,"score_of_the_acc":-0.5775,"final_rank":3},{"submission_id":"aoj_2807_5968025","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< 998244353 >;\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};\nvector<vector<pair<int, int>>> g(101010);\nint depth[101010];\ndouble p; \ndouble dfs(int v, int par, int d) {\n double sum = 0.0;\n depth[v] = d;\n for(auto [u, c]: g[v]) {\n if(u == par) continue;\n sum += p * (c+dfs(u, v, d+1));\n }\n return sum;\n}\ndouble mypow[101010];\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n cin >> p;\n int n; cin >> n;\n REP(i,n-1) {\n int a, b, c; cin >> a >> b >> c;\n a--; b--;\n g[a].push_back({b, c});\n g[b].push_back({a, c});\n }\n double tmp = dfs(0, -1, 0);\n mypow[0] = 1;\n REP(i,100010) mypow[i+1] = mypow[i] * p;\n\n double sum = tmp;\n REP(i,n) sum += mypow[depth[i]] * tmp;\n cout << sum << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":15944,"score_of_the_acc":-0.4839,"final_rank":2},{"submission_id":"aoj_2807_5967058","code_snippet":"#include<bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n//#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"unroll-loops\")\nusing namespace std;\n//#include<boost/multiprecision/cpp_int.hpp>\n//#include<boost/multiprecision/cpp_dec_float.hpp>\n//namespace mp=boost::multiprecision;\n//#define mulint mp::cpp_int\n//#define mulfloat mp::cpp_dec_float_100\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n#define INF (1<<30)\n#define LINF (lint)(1LL<<56)\n#define endl \"\\n\"\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\n#define flc(x) __builtin_popcountll(x)\n#define pint pair<int,int>\n#define pdouble pair<double,double>\n#define plint pair<lint,lint>\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define vec vector<lint>\n#define nep(x) next_permutation(all(x))\ntypedef long long lint;\nint dx[8]={1,1,0,-1,-1,-1,0,1};\nint dy[8]={0,1,1,1,0,-1,-1,-1};\nconst int MAX_N=4e5+5;\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//vector<int> bucket[MAX_N/1000];\nconstexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n/*#include<atcoder/all>\nusing namespace atcoder;\ntypedef __int128_t llint;*/\n\nvector<pair<int,double>> edge[100050];\nbool reach[100050];\ndouble rec[100050];\nint dep[100050];\ndouble p;\n\ndouble dfs(int now,int depth,double par){\n if(reach[now]) return rec[now];\n reach[now]=true;\n dep[now]=depth;\n double ret=0;\n ret+=par*p;\n //cout << now << \" \" << ret << endl;\n rep(i,edge[now].size()){\n if(reach[edge[now][i].fi]) continue;\n ret+=dfs(edge[now][i].fi,depth+1,edge[now][i].se)*p;\n }\n return rec[now]=ret;\n}\n\nint main(void){\n cin >> p;\n int N;\n cin >> N;\n rep(i,N-1){\n int u,v;\n double c;\n cin >> u >> v >> c;\n u--,v--;\n edge[u].push_back({v,c});\n edge[v].push_back({u,c});\n }\n double res=dfs(0,1,0);\n double s=res;\n rep(i,N){\n res+=s*pow(p,dep[i]-1);\n }\n cout << res/p << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":18536,"score_of_the_acc":-0.6922,"final_rank":5},{"submission_id":"aoj_2807_4179050","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing ull = unsigned long long int;\nusing P = pair<int, int>;\n\ndouble p, z = 0;\nvector<vector<P> > g;\n\ndouble dfs(int now, int pre){\n double res = 0;\n for(auto e : g[now]){\n int nxt = e.first, c = e.second;\n if(nxt == pre) continue;\n res += p*(dfs(nxt,now)+c);\n }\n return res + z;\n}\n\nbool solve(){\n int n;\n cin >> p >> n;\n g.resize(n);\n for(int i=0;i<n-1;i++){\n int x, y, c;\n cin >> x >> y >> c;\n x--; y--;\n g[x].push_back(P(y,c));\n g[y].push_back(P(x,c));\n }\n z = dfs(0,-1);\n printf(\"%.9lf\\n\",dfs(0,-1));\n return true;\n}\n\nint main(){\n solve();\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":14500,"score_of_the_acc":-0.873,"final_rank":6},{"submission_id":"aoj_2807_3991442","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n\nint main() {\n\tdouble p;\n\tll n;\n\tcin >> p >> n;\n\tvector<vector<PII>> g(n);\n\tREP(i, n - 1) {\n\t\tll a, b, c;\n\t\tcin >> a >> b >> c;\n\t\ta--, b--;\n\t\tg[a].push_back({ b, c });\n\t\tg[b].push_back({ a, c });\n\t}\n\n\tdouble all = 0;\n\tfunction<void(ll, ll, double)> pre = [&](ll v, ll par, double prob) {\n\t\tfor (auto to : g[v]) {\n\t\t\tif (to.first == par) continue;\n\t\t\tall += prob * to.second;\n\t\t\tpre(to.first, v, prob * p);\n\t\t}\n\t};\n\tpre(0, -1, p);\n\n\tdouble ans = 0;\n\tfunction<void(ll, ll, double)> dfs = [&](ll v, ll par, double prob) {\n\t\tans += prob * all;\n\t\tfor (auto to : g[v]) {\n\t\t\tif (to.first == par) continue;\n\t\t\tans += prob * p * to.second;\n\t\t\tdfs(to.first, v, prob*p);\n\t\t}\n\t};\n\tdfs(0, -1, 1);\n\t\n\tcout << fixed << setprecision(9) << ans << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":19240,"score_of_the_acc":-1.0877,"final_rank":10},{"submission_id":"aoj_2807_3523392","code_snippet":"#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <cmath>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e9 + 7;\n\nvector<int> E[110000];\ndouble p;\ndouble prob[110000] = {};\nlong long int cost[110000] = {};\n\nvoid func(int pos, int pre, double pp){\n prob[pos] = pp;\n for(int i = 0; i < E[pos].size(); i++){\n if(E[pos][i] != pre){\n func(E[pos][i], pos, pp * p);\n }\n }\n}\n\nint main(){\n cin >> p;\n int N;\n cin >> N;\n for(int i = 0; i < N - 1; i++){\n int u1, u2, c;\n cin >> u1 >> u2 >> c;\n E[u1].push_back(u2);\n E[u2].push_back(u1);\n cost[u2] = c;\n }\n func(1, -1, 1);\n double ans = 0;\n double S = 0;\n for(int i = 1; i <= N; i++){\n ans += prob[i] * cost[i];\n S += prob[i];\n }\n ans += S * ans;\n printf(\"%.10f\\n\", ans);\n return 0;\n}","accuracy":0.15789473684210525,"time_ms":60,"memory_kb":16716,"score_of_the_acc":-0.8825,"final_rank":20},{"submission_id":"aoj_2807_3523381","code_snippet":"#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <cmath>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e9 + 7;\n\nvector<int> E[110000];\ndouble p;\ndouble prob[110000] = {};\nlong long int cost[110000] = {};\n\nvoid func(int pos, double pp){\n prob[pos] = pp;\n for(int i = 0; i < E[pos].size(); i++){\n func(E[pos][i], pp * p);\n }\n}\n\nint main(){\n cin >> p;\n int N;\n cin >> N;\n for(int i = 0; i < N - 1; i++){\n int u1, u2, c;\n cin >> u1 >> u2 >> c;\n E[u1].push_back(u2);\n cost[u2] = c;\n }\n func(1, 1);\n double ans = 0;\n double S = 0;\n for(int i = 1; i <= N; i++){\n ans += prob[i] * cost[i];\n S += prob[i];\n }\n ans += S * ans;\n printf(\"%.10f\\n\", ans);\n return 0;\n}","accuracy":0.15789473684210525,"time_ms":60,"memory_kb":15252,"score_of_the_acc":-0.8162,"final_rank":16},{"submission_id":"aoj_2807_3252038","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2807.cc: Fractal Tree\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\n\n/* typedef */\n\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\n\nstruct Stat {\n int i, prt;\n double p;\n Stat() {}\n Stat(int _i, int _prt, double _p): i(_i), prt(_prt), p(_p) {}\n};\n\n/* global variables */\n\nvpii nbrs[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n double p;\n int n;\n scanf(\"%lf%d\", &p, &n);\n\n for (int i = 1; i < n; i++) {\n int x, y, c;\n scanf(\"%d%d%d\", &x, &y, &c);\n x--, y--;\n nbrs[x].push_back(pii(y, c));\n nbrs[y].push_back(pii(x, c));\n }\n\n queue<Stat> q;\n q.push(Stat(0, -1, 1.0));\n double t = 0.0;\n\n while (! q.empty()) {\n Stat u = q.front(); q.pop();\n vpii nbru = nbrs[u.i];\n double vp = u.p * p;\n\n for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\n int &vi = vit->first, &vc = vit->second;\n if (vi != u.prt) {\n\tt += vc * vp;\n\tq.push(Stat(vi, u.i, vp));\n }\n }\n }\n //printf(\"t=%lf\\n\", t);\n\n q.push(Stat(0, -1, 1.0));\n double ans = t;\n \n while (! q.empty()) {\n Stat u = q.front(); q.pop();\n vpii nbru = nbrs[u.i];\n double vp = u.p * p;\n ans += t * u.p;\n\n for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\n int &vi = vit->first;\n if (vi != u.prt)\n\tq.push(Stat(vi, u.i, vp));\n }\n }\n printf(\"%.10lf\\n\", ans);\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":9268,"score_of_the_acc":-0.2724,"final_rank":1},{"submission_id":"aoj_2807_2977017","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nvector<pair<int,double> > G[100000];\ndouble p;\nint n;\nint deep=0;\ndouble ans=0;\ndouble ans2;\n\nvector<int> used(100000,0);\nvector<int> used1(100000,0);\n\nvoid dfs(int x){\n\n deep++;\n for(int i=0;i<G[x].size();i++){\n if(used[G[x][i].first]==0){\n used[G[x][i].first]=1;\n ans+=pow(p,deep)*G[x][i].second;\n dfs(G[x][i].first);\n }\n }\n deep--;\n}\n\nvoid dfs2(int x){\n deep++;\n for(int i=0;i<G[x].size();i++){\n if(used1[G[x][i].first]==0){\n used1[G[x][i].first]=1;\n ans2+=pow(p,deep)*(G[x][i].second+ans);\n dfs2(G[x][i].first);\n }\n }\n deep--;\n}\n\nint main(){\n cin>>p>>n;\n for(int i=0;i<n-1;i++){\n int a,b;\n double c;\n cin>>a>>b>>c;\n a--;\n b--;\n G[a].push_back(make_pair(b,c));\n G[b].push_back(make_pair(a,c));\n }\n used[0]=1;\n used1[0]=1;\n dfs(0);\n ans2=ans;\n deep=0;\n dfs2(0);\n\n cout<< fixed << setprecision(10) <<ans2<<endl;\n}","accuracy":1,"time_ms":110,"memory_kb":15592,"score_of_the_acc":-1.2861,"final_rank":11},{"submission_id":"aoj_2807_2976998","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing P = pair<int, int>;\n\nvector<bool> used;\nvector<vector<P>> g;\nvector<P> num;\n\nvoid dfs(int s, int dep) {\n for (auto&& p : g[s]) {\n int v, c; tie(v, c) = p;\n if (used[v]) continue;\n used[v] = true;\n num[v] = {dep + 1, c};\n dfs(v, dep + 1);\n }\n}\n\nint main() {\n double p; cin >> p;\n int N; cin >> N;\n g = vector<vector<P>>(N);\n for (int i = 0; i < N-1; ++i) {\n int x, y, c; cin >> x >> y >> c; --x; --y;\n g[x].push_back({y, c});\n g[y].push_back({x, c});\n }\n used = vector<bool>(N, false);\n num = vector<P>(N, {0, 0});\n used[0] = true;\n dfs(0, 0);\n\n double t = 0;\n for (int i = 1; i < N; ++i) t += pow(p, num[i].first) * num[i].second;\n double d = 0;\n for (int i = 0; i < N; ++i) d += pow(p, num[i].first);\n\n cout << fixed << setprecision(7) << t + t * d << endl; \n}","accuracy":1,"time_ms":90,"memory_kb":12364,"score_of_the_acc":-0.9581,"final_rank":7},{"submission_id":"aoj_2807_2976978","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nvector<pair<int,double> > G[100000];\ndouble p;\nint n;\nint deep=0;\ndouble ans=0;\ndouble ans2;\n\nvoid dfs(int x){\n deep++;\n for(int i=0;i<G[x].size();i++){\n ans+=pow(p,deep)*G[x][i].second;\n dfs(G[x][i].first);\n }\n deep--;\n}\n\nvoid dfs2(int x){\n deep++;\n for(int i=0;i<G[x].size();i++){\n ans2+=pow(p,deep)*(G[x][i].second+ans);\n dfs2(G[x][i].first);\n }\n deep--;\n}\n\nint main(){\n cin>>p>>n;\n for(int i=0;i<n-1;i++){\n int a,b;\n double c;\n cin>>a>>b>>c;\n a--;\n b--;\n if(a>b){\n int tmp=a;\n a=b;\n b=tmp;\n }\n G[a].push_back(make_pair(b,c));\n }\n dfs(0);\n ans2=ans;\n deep=0;\n dfs2(0);\n\n cout<< fixed << setprecision(10) <<ans2<<endl;\n\n}","accuracy":0.15789473684210525,"time_ms":80,"memory_kb":11968,"score_of_the_acc":-0.8493,"final_rank":18},{"submission_id":"aoj_2807_2976972","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nvector<pair<int,double> > G[100000];\ndouble p;\nint n;\nint deep=0;\ndouble ans=0;\ndouble ans2;\n\nvoid dfs(int x){\n deep++;\n for(int i=0;i<G[x].size();i++){\n ans+=pow(p,deep)*G[x][i].second;\n dfs(G[x][i].first);\n }\n deep--;\n}\n\nvoid dfs2(int x){\n deep++;\n for(int i=0;i<G[x].size();i++){\n ans2+=pow(p,deep)*(G[x][i].second+ans);\n dfs2(G[x][i].first);\n }\n deep--;\n}\n\nint main(){\n cin>>p>>n;\n for(int i=0;i<n-1;i++){\n int a,b;\n double c;\n cin>>a>>b>>c;\n a--;\n b--;\n int ma,mi;\n ma=max(a,b);\n mi=min(a,b);\n a=mi;\n b=ma;\n G[a].push_back(make_pair(b,c));\n }\n dfs(0);\n ans2=ans;\n deep=0;\n dfs2(0);\n\n cout<< fixed << setprecision(10) <<ans2<<endl;\n\n}","accuracy":0.15789473684210525,"time_ms":80,"memory_kb":11988,"score_of_the_acc":-0.8502,"final_rank":19},{"submission_id":"aoj_2807_2976965","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nvector<pair<int,int> > G[100000];\ndouble p;\nint n;\nint deep=0;\ndouble ans=0;\ndouble ans2;\n\nvoid dfs(int x){\n deep++;\n for(int i=0;i<G[x].size();i++){\n ans+=pow(p,deep)*G[x][i].second;\n dfs(G[x][i].first);\n }\n deep--;\n}\n\nvoid dfs2(int x){\n deep++;\n for(int i=0;i<G[x].size();i++){\n ans2+=pow(p,deep)*(G[x][i].second+ans);\n dfs2(G[x][i].first);\n }\n deep--;\n}\n\nint main(){\n cin>>p>>n;\n for(int i=0;i<n-1;i++){\n int a,b,c;\n cin>>a>>b>>c;\n a--;\n b--;\n int ma,mi;\n ma=max(a,b);\n mi=min(a,b);\n a=mi;\n b=ma;\n G[a].push_back(make_pair(b,c));\n }\n dfs(0);\n ans2=ans;\n deep=0;\n dfs2(0);\n\n cout<< fixed << setprecision(10) <<ans2<<endl;\n\n}","accuracy":0.15789473684210525,"time_ms":70,"memory_kb":12044,"score_of_the_acc":-0.7618,"final_rank":15},{"submission_id":"aoj_2807_2976956","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing P = pair<int, int>;\n\nint main() {\n double p; cin >> p;\n int N; cin >> N;\n auto xy = vector<P>(N-1);\n auto c = vector<int>(N-1);\n for (int i = 0; i < N-1; ++i) {\n cin >> xy[i].first >> xy[i].second >> c[i];\n --xy[i].first; --xy[i].second;\n }\n sort(begin(xy), end(xy));\n auto num = vector<P>(N, {0, 0});\n num[0] = {0, 0};\n for (int i = 0; i < N-1; ++i) {\n num[xy[i].second] = {num[xy[i].first].first + 1, c[i]};\n }\n double t = 0;\n for (int i = 1; i < N; ++i) t += pow(p, num[i].first) * num[i].second;\n double d = 0;\n for (int i = 0; i < N; ++i) d += pow(p, num[i].first);\n\n cout << fixed << setprecision(7) << t + t * d << endl; \n}","accuracy":0.15789473684210525,"time_ms":80,"memory_kb":5260,"score_of_the_acc":-0.5455,"final_rank":14},{"submission_id":"aoj_2807_2976946","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nvector<pair<int,int> > G[100000];\ndouble p;\nint n;\nint deep=0;\ndouble ans=0;\ndouble ans2;\n\nvoid dfs(int x){\n for(int i=0;i<G[x].size();i++){\n deep++;\n ans+=pow(p,deep)*G[x][i].second;\n dfs(G[x][i].first);\n deep--;\n }\n}\n\nvoid dfs2(int x){\n for(int i=0;i<G[x].size();i++){\n deep++;\n ans2+=pow(p,deep)*(G[x][i].second+ans);\n dfs2(G[x][i].first);\n deep--;\n }\n}\n\nint main(){\n cin>>p>>n;\n for(int i=0;i<n-1;i++){\n int a,b,c;\n cin>>a>>b>>c;\n a--;\n b--;\n int ma,mi;\n ma=max(a,b);\n mi=min(a,b);\n a=mi;\n b=ma;\n G[a].push_back(make_pair(b,c));\n }\n dfs(0);\n ans2=ans;\n deep=0;\n dfs2(0);\n\n cout<< fixed << setprecision(10) <<ans2<<endl;\n\n}","accuracy":0.15789473684210525,"time_ms":80,"memory_kb":11920,"score_of_the_acc":-0.8471,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_2807_9117947\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <vector>\\nusing namespace std;\\nint inf=100000000;\\nusing ll=long long;\\nusing pint=pair<int,int>;\\nusing pll=pair<ll,ll>;\\nusing pque_int=priority_queue<int>;\\n#define rep(i,n) for (int i=0; i < (int) n; i++)\\n#define _GLIBCXX_DEBUG\\ntemplate<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }\\ntemplate<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }\\nint VecMax(vector<int> &v) {\\n int output=-inf;\\n rep(i,v.size()) chmax(output,v[i]);\\n return output;\\n}\\nint VecMin(vector<ll> &v) {\\n ll output=inf;\\n rep(i,v.size()) chmin(output,v[i]);\\n return output;\\n}\\nll VecSum(vector<int> &v) {\\n ll output=0;\\n rep(i,v.size()) output+=v[i];\\n return output;\\n}\\nll pow(ll a,ll n) {\\n ll output=1;\\n while (n>0) output*=a;\\n return output;\\n}\\nint dir(char c) {\\n if (c=='L') return 3;\\n else if (c=='R') return 1;\\n else if (c=='U') return 2;\\n else return 0;\\n}\\n\\nint main() {\\n double p;\\n int N;\\n cin >> p >> N;\\n vector<int> x(N-1),y(N-1);\\n map<pint,int> c;\\n rep(i,N-1) {\\n cin >> x[i] >> y[i];\\n x[i]--; y[i]--;\\n int in;\\n cin >> in;\\n c[make_pair(x[i],y[i])]=in;\\n c[make_pair(y[i],x[i])]=in;\\n }\\n vector<double> power_p(N+1);\\n double s=1;\\n rep(i,N) {\\n power_p[i]=s;\\n s*=p;\\n }\\n power_p[N]=s;\\n\\n\\n vector<vector<int>> graph(N);\\n rep(i,N) {\\n graph[x[i]].push_back(y[i]);\\n graph[y[i]].push_back(x[i]);\\n }\\n deque<int> todo;\\n todo.push_back(0);\\n vector<int> seen(N,-1);\\n vector<double> score(N,-1.0);\\n seen[0]=0;\\n score[0]=0.0;\\n vector<int> end;\\n while(!todo.empty()) {\\n int x=todo.back();\\n todo.pop_back();\\n bool flag=true;\\n for (auto nx:graph[x]) {\\n if (seen[nx]<0) {\\n seen[nx]=seen[x]+1;\\n score[nx]= c[make_pair(x,nx)]*power_p[seen[nx]];\\n todo.push_back(nx);\\n flag=false;\\n } \\n }\\n if (flag) {\\n end.push_back(x);\\n }\\n }\\n double endscore=0;\\n rep(i,N) {\\n endscore+=score[i];\\n }\\n\\n double ans=0;\\n rep(i,N) {\\n ans+=power_p[seen[i]]*endscore+score[i];\\n }\\n cout << std::fixed << std::setprecision(9);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 24316,\n \"score_of_the_acc\": -1.863,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2807_9117670\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\\n\\ntemplate <typename T> bool chmin(T &a, const T &b) {\\n\\tif (a <= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> bool chmax(T &a, const T &b) {\\n\\tif (a >= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> T max(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T min(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T sum(vector<T> &a){\\n\\tT ret = 0;\\n\\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\\n\\treturn ret;\\n}\\n\\nint main(){\\n\\tlong double p; cin >> p;\\n\\tint n; cin >> n;\\n\\n\\tvector ikeru(n, vector<pair<int,double>>(0));\\n\\trep(i,0,n-1){\\n\\t\\tint a, b; cin >> a >> b;\\n\\t\\ta--; b--;\\n\\t\\tlong double c; cin >> c;\\n\\t\\tikeru[a].push_back(pair(b, c));\\n\\t\\tikeru[b].push_back(pair(a, c));\\n\\n\\n\\t}\\n\\n\\tvector<long double> dp1(n), dp2(n);\\n\\tauto dfs = [&](auto self, int i, int x, vector<long double> &dp, long double geta) -> void {\\n\\t\\tdp[i] += geta;\\n\\t\\tfor (auto [j, c]: ikeru[i]){\\n\\t\\t\\tif (j == x) continue;\\n\\t\\t\\tself(self, j, i, dp, geta);\\n\\t\\t\\tdp[i] += p * c;\\n\\t\\t\\tdp[i] += p * dp[j];\\n\\t\\t}\\n\\t};\\n\\n\\t\\n\\n\\tdfs(dfs,0,-1,dp1,0);\\n\\tdfs(dfs,0,-1,dp2,dp1[0]);\\n\\n\\tcout << fixed << setprecision(15);\\n\\tcout << dp2[0] << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 27340,\n \"score_of_the_acc\": -1.3636,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2807_9117597\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\n\\nvoid solve(){\\n ld p; in(p);\\n int n; in(n);\\n using pid = pair<int,ld>;\\n vector<vector<pid>> g(n);\\n rep(i,n-1){\\n int u, v; in(u,v); u--, v--;\\n ld c; in(c);\\n g[u].emplace_back(v,c);\\n g[v].emplace_back(u,c);\\n }\\n ld sum = 0;\\n auto dfs = [&](auto sfs, int v, int f, ld pp) -> void {\\n for (auto [u, c] : g[v]){\\n if (u == f) continue;\\n sum += pp*p * c;\\n sfs(sfs,u,v,pp*p);\\n }\\n };\\n dfs(dfs,0,-1,1);\\n ld ans = sum;\\n auto efs = [&](auto sfs, int v, int f, ld pp) -> void {\\n ans += pp * sum;\\n for (auto [u, c] : g[v]){\\n if (u == f) continue;\\n sfs(sfs,u,v,pp*p);\\n }\\n };\\n efs(efs,0,-1,1);\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 22676,\n \"score_of_the_acc\": -0.9706,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2807_9117596\",\n \"code_snippet\": \"#pragma region //comavius::competitive library\\n\\n#pragma region //inclusion and optimization\\n#include <bits/stdc++.h>\\n#ifdef IS_TEST\\nstatic const bool IS_TEST_ENVIROMENT = true;\\n#else\\nstatic const bool IS_TEST_ENVIROMENT = false;\\n#endif\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#pragma endregion //inclusion and optimization\\n\\nnamespace comavius::competitive { //typedefs\\n\\n #pragma region //long long\\n typedef long long ll;\\n typedef std::vector<ll> vll;\\n typedef std::vector<vll> vvll;\\n typedef std::vector<vvll> vvvll;\\n typedef std::map<ll, ll> mll;\\n typedef std::map<ll, mll> mmll;\\n typedef std::pair<ll, ll> pll;\\n typedef std::vector<pll> vpll;\\n #pragma endregion //long long\\n\\n #pragma region //long double\\n typedef long double ld;\\n typedef std::vector<ld> vld;\\n typedef std::vector<vld> vvld;\\n typedef std::vector<vvld> vvvld;\\n #pragma endregion //long double\\n\\n #pragma region //std::string\\n typedef std::string str;\\n typedef std::vector<str> vstr;\\n typedef std::vector<vstr> vvstr;\\n typedef std::vector<vvstr> vvvstr;\\n #pragma endregion //std::string\\n\\n #pragma region //bool\\n typedef std::vector<bool> vb;\\n typedef std::vector<vb> vvb;\\n typedef std::vector<vvb> vvvb;\\n #pragma endregion //bool\\n\\n #pragma region //char\\n typedef std::vector<char> vc;\\n typedef std::vector<vc> vvc;\\n typedef std::vector<vvc> vvvc;\\n #pragma endregion //char\\n\\n #pragma region //container of std\\n #pragma region //std::vector\\n template <typename T>\\n using vec = std::vector<T>;\\n template <typename T>\\n using vec2 = std::vector<std::vector<T>>;\\n template <typename T>\\n using vec3 = std::vector<std::vector<std::vector<T>>>;\\n template <typename T>\\n using vec4 = std::vector<std::vector<std::vector<std::vector<T>>>>;\\n template <typename T>\\n using vec5 = std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>;\\n template <typename T>\\n using vec6 = std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>>;\\n template <typename T>\\n using vec7 = std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>>>;\\n #pragma endregion //std::vector\\n #pragma endregion //container of std\\n\\n} // namespace comavius::competitive typedefs\\n\\n\\n#pragma region //Read macro\\n #define GET_1_ARG(TYPE, ARG); TYPE ARG; std::cin >> ARG;\\n #define GET_2_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_1_ARG(TYPE, __VA_ARGS__)\\n #define GET_3_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_2_ARG(TYPE, __VA_ARGS__)\\n #define GET_4_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_3_ARG(TYPE, __VA_ARGS__)\\n #define GET_5_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_4_ARG(TYPE, __VA_ARGS__)\\n #define GET_6_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_5_ARG(TYPE, __VA_ARGS__)\\n #define GET_7_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_6_ARG(TYPE, __VA_ARGS__)\\n #define GET_8_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_7_ARG(TYPE, __VA_ARGS__)\\n #define GET_9_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_8_ARG(TYPE, __VA_ARGS__)\\n #define GET_10_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_9_ARG(TYPE, __VA_ARGS__)\\n\\n #define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME\\n #define read(TYPE, ...) GET_MACRO(__VA_ARGS__, GET_10_ARG, GET_9_ARG, GET_8_ARG, GET_7_ARG, GET_6_ARG, GET_5_ARG, GET_4_ARG, GET_3_ARG, GET_2_ARG, GET_1_ARG)(TYPE, __VA_ARGS__)\\n\\n #define readv(TYPE, NAME, SIZE) std::vector<TYPE> NAME(SIZE); for (long long i = 0; i < SIZE; i++) std::cin >> NAME[i];\\n #define readvv(TYPE, NAME, H, W) std::vector<std::vector<TYPE>> NAME(H, std::vector<TYPE>(W)); for (long long i = 0; i < H; i++) for (long long j = 0; j < W; j++) std::cin >> NAME[i][j];\\n#pragma endregion //Read macro\\n\\n#pragma region //Other macro\\n #define rep(i, n) for (ll i = 0; i < n; i++)\\n #define reps(i, start, goal, diff) for (ll i = start; i != goal; i += diff)\\n #define all(a) a.begin(), a.end()\\n// #define chmax(a, b) a = std::max(a, b)\\n// #define chmin(a, b) a = std::min(a, b)\\n#pragma endregion //Other macro\\n\\n#pragma region //namespace expansion\\n using namespace std;\\n using namespace comavius::competitive;\\n#pragma endregion //namespace expansion\\n\\n#pragma endregion //comavius::competitive library\\n\\n\\n\\n#pragma region // fundamental structures\\n\\nusing vvpll = vector<vpll>;\\n\\nint main() {\\n read(ld, p);\\n read(ll, n);\\n vvpll adj(n);\\n rep(i, n-1) {\\n read(ll,x,y,c);\\n x--;y--;\\n adj[x].push_back({y, c});\\n adj[y].push_back({x, c});\\n }\\n vld reach_prob(n, 0);\\n reach_prob[0] = 1;\\n ld cost_sum = 0;\\n queue<ll> q;\\n q.push(0);\\n vb visited(n, false);\\n visited[0] = true;\\n while(q.size()) {\\n ll cur = q.front();\\n q.pop();\\n for (auto [next, cost] : adj[cur]) {\\n if (visited[next]) continue;\\n reach_prob[next] = reach_prob[cur] * p;\\n cost_sum += ll(cost) * reach_prob[next];\\n q.push(next);\\n visited[next] = true;\\n }\\n }\\n ld cost_fr = cost_sum;\\n rep(i, n) {\\n cost_fr += cost_sum * reach_prob[i];\\n }\\n cout << setprecision(15) << cost_fr << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 12144,\n \"score_of_the_acc\": -0.5845,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2807_9117589\",\n \"code_snippet\": \"//#include<atcoder/all>\\n//using namespace atcoder;\\n\\n#include <bits/stdc++.h>\\ntemplate<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}\\ntemplate<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}\\n#define ll long long\\n#define double long double\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define REP(i,n) for(int i=1;i<=(n);i++)\\n#define mod (ll)(1e9+7)\\n#define inf (ll)(3e18+7)\\n#define eps (double)(1e-9)\\n#define pi (double) acos(-1)\\n#define all(x) x.begin(),x.end()\\n#define rall(x) x.rbegin(),x.rend()\\nusing namespace std;\\n\\nstruct edge{\\n int to, cost;\\n};\\n\\nusing Graph = vector<vector<edge>>;\\n\\ndouble P;\\nvector<double> dp1(100010, -1);\\nvector<double> dp2(100010, -1);\\n\\ndouble dfs1(const Graph &G, int v, int p){\\n if(dp1[v] != -1)return dp1[v];\\n\\n double now = 0;\\n for(auto nv : G[v]){\\n if(nv.to == p)continue;\\n now += P * (dfs1(G, nv.to, v) + nv.cost);\\n }\\n\\n return dp1[v] = now;\\n}\\n\\ndouble dfs2(const Graph &G, int v, int p){\\n if(dp2[v] != -1)return dp2[v];\\n \\n double now = 0;\\n for(auto nv : G[v]){\\n if(nv.to == p)continue;\\n now += P * (dfs2(G, nv.to, v) + nv.cost);\\n }\\n now += dp1[0];\\n\\n return dp2[v] = now;\\n}\\n\\nint main(){\\n int n;\\n cin >> P >> n;\\n Graph G(n);\\n rep(i, n-1){\\n int x, y, z;\\n cin >> x >> y >> z;\\n x--; y--;\\n G[x].push_back({y, z});\\n G[y].push_back({x, z});\\n }\\n\\n dfs1(G, 0, -1);\\n dfs2(G, 0, -1);\\n\\n cout << fixed << setprecision(15) << dp2[0] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 21084,\n \"score_of_the_acc\": -1.0803,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2807_9117546\",\n \"code_snippet\": \"// #ifndef ONLINE_JUDGE\\n#if __has_include(\\\"all.h\\\")\\n\\n#include \\\"all.h\\\"\\n\\n#else\\n\\n#include <bits/extc++.h>\\n\\n// #include <atcoder/all>\\n\\n#endif\\n\\nusing ll = long long int;\\n\\ntemplate <class T>\\nbool chmin(T &x, const T val) {\\n if (x > val) {\\n x = val;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T>\\nbool chmax(T &x, const T val) {\\n if (x < val) {\\n x = val;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class... T>\\nstd::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) {\\n std::apply([&](auto &&...args) { (is >> ... >> args); }, tpl);\\n return is;\\n}\\n\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &x : v) is >> x;\\n return is;\\n}\\n\\n// template <class mint, atcoder::internal::is_static_modint_t<mint> * =\\n// nullptr> std::ostream &operator<<(std::ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (int i = 0; i < v.size(); i++)\\n os << v[i] << (i == v.size() - 1 ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\nstruct Initialization {\\n Initialization() {\\n std::ios_base::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n }\\n} initialization;\\n\\nconstexpr std::pair<int, int> dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\\n\\ntemplate <typename T>\\nusing infs = std::numeric_limits<T>;\\n\\ntemplate <typename T>\\nclass factorials {\\n public:\\n static size_t n;\\n static std::vector<T> fact, inv_fact;\\n\\n static void extend(size_t m) {\\n if (m <= n) return;\\n fact.resize(m + 1);\\n inv_fact.resize(m + 1);\\n for (size_t i = n + 1; i <= m; i++) fact[i] = fact[i - 1] * i;\\n inv_fact[m] = fact[m].inv();\\n for (size_t i = m; i > n + 1; i--) inv_fact[i - 1] = inv_fact[i] * i;\\n n = m;\\n }\\n\\n static T inv(int k) {\\n extend(k);\\n return inv_fact[k];\\n }\\n\\n static T get(int k) {\\n extend(k);\\n return fact[k];\\n }\\n\\n static T perm(int n, int k) {\\n if (n < k) return 0;\\n if (k < 0) return 0;\\n extend(n);\\n return fact[n] * inv_fact[n - k];\\n }\\n\\n static T choose(int n, int k) {\\n if (n < k) return 0;\\n if (k < 0) return 0;\\n extend(n);\\n return fact[n] * inv_fact[n - k] * inv_fact[k];\\n }\\n};\\n\\ntemplate <typename T>\\nsize_t factorials<T>::n = 0;\\n\\ntemplate <typename T>\\nstd::vector<T> factorials<T>::fact = {1};\\n\\ntemplate <typename T>\\nstd::vector<T> factorials<T>::inv_fact = {1};\\n\\n// template <typename T>\\n// class fps {\\n// std::vector<T> v;\\n//\\n// public:\\n// using value_type = T;\\n// using reference = T &;\\n// using const_reference = const T &;\\n// using iterator = typename std::vector<T>::iterator;\\n// using const_iterator = typename std::vector<T>::const_iterator;\\n//\\n// size_t size() const { return v.size(); }\\n//\\n// const std::vector<T> &data() const { return v; }\\n//\\n// explicit fps(int n) : v(n) {}\\n//\\n// fps(const std::vector<T> &v) : v(v) {}\\n// fps(std::vector<T> &&v) : v(v) {}\\n//\\n// template <class InputIterator>\\n// fps(InputIterator first, InputIterator last) : v(first, last) {}\\n//\\n// void resize(int n) { v.resize(n); }\\n//\\n// T &operator[](int i) { return v[i]; }\\n//\\n// iterator begin() { return v.begin(); }\\n//\\n// iterator end() { return v.end(); }\\n//\\n// fps diff() {\\n// std::vector<T> res(v.size() - 1);\\n// for (int i = 0; i < res.size(); i++) res[i] = v[i + 1] * (i + 1);\\n// return fps(res);\\n// }\\n//\\n// fps integral() {\\n// std::vector<T> res(v.size() + 1);\\n// for (int i = 0; i < v.size(); i++) res[i + 1] = v[i] / (i + 1);\\n// return fps(res);\\n// }\\n//\\n// fps inv(int deg = -1) {\\n// assert(v[0] != 0);\\n//\\n// if (deg == -1) deg = size();\\n// std::vector<T> res(deg);\\n//\\n// res[0] = v[0].inv();\\n//\\n// for (int d = 1; d < deg; d <<= 1) {\\n// std::vector<T> f(2 * d), g(2 * d);\\n//\\n// std::copy(v.begin(), v.begin() + std::min(2 * d, (int)v.size()),\\n// std::back_inserter(f));\\n// std::copy(res.begin(), res.begin() + d, std::back_inserter(g));\\n//\\n// atcoder::internal::butterfly(f);\\n// atcoder::internal::butterfly(g);\\n//\\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\\n//\\n// atcoder::internal::butterfly_inv(f);\\n//\\n// for (int i = 0; i < d; i++) f[i] = 0;\\n//\\n// atcoder::internal::butterfly(f);\\n//\\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\\n//\\n// atcoder::internal::butterfly_inv(f);\\n//\\n// for (int i = d; i < std::min(2 * d, deg); i++) res[i] = -f[i];\\n// }\\n//\\n// res.resize(deg);\\n//\\n// return res;\\n// }\\n//\\n// fps shift(T c) {\\n// std::vector<T> res(size()), ifacts(size());\\n//\\n// T x = 1;\\n//\\n// for (int i = 0; i < size(); i++) {\\n// ifacts[i] = x * factorials<T>::inv(i);\\n// x *= c;\\n// }\\n//\\n// for (int i = 0; i < size(); i++) {\\n// res[size() - 1 - i] = v[i] * factorials<T>::get(i);\\n// }\\n//\\n// res = atcoder::convolution(res, ifacts);\\n//\\n// res.resize(size());\\n//\\n// std::ranges::reverse(res);\\n//\\n// for (int i = 0; i < size(); i++) {\\n// res[i] *= factorials<T>::inv(i);\\n// }\\n//\\n// return res;\\n// }\\n//\\n// fps operator-() {\\n// fps res(v.size());\\n// for (int i = 0; i < v.size(); i++) res[i] = -v[i];\\n// return res;\\n// }\\n//\\n// fps &operator+=(const fps &rhs) {\\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\\n// for (int i = 0; i < rhs.v.size(); i++) v[i] += rhs.v[i];\\n// return *this;\\n// }\\n//\\n// fps &operator-=(const fps &rhs) {\\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\\n// for (int i = 0; i < rhs.v.size(); i++) v[i] -= rhs.v[i];\\n// return *this;\\n// }\\n//\\n// fps &operator*=(const fps &rhs) {\\n// return *this = atcoder::convolution(v, rhs.v);\\n// }\\n//\\n// fps &operator+=(const T &rhs) {\\n// if (v.size() == 0) v.resize(1);\\n// v[0] += rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator-=(const T &rhs) {\\n// if (v.size() == 0) v.resize(1);\\n// v[0] -= rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator*=(const T &rhs) {\\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator/=(const T &rhs) {\\n// T rhs_inv = rhs.inv();\\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs_inv;\\n// return *this;\\n// }\\n//\\n// friend fps operator+(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) += rhs;\\n// }\\n//\\n// friend fps operator-(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) -= rhs;\\n// }\\n//\\n// friend fps operator*(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) *= rhs;\\n// }\\n//\\n// friend fps operator+(const fps &lhs, const T &rhs) { return fps(lhs) +=\\n// rhs; }\\n//\\n// friend fps operator-(const fps &lhs, const T &rhs) { return fps(lhs) -=\\n// rhs; }\\n//\\n// friend fps operator*(const fps &lhs, const T &rhs) { return fps(lhs) *=\\n// rhs; }\\n//\\n// friend fps operator/(const fps &lhs, const T &rhs) { return fps(lhs) /=\\n// rhs; }\\n//\\n// friend fps operator+(const T &lhs, const fps &rhs) { return fps(rhs) +=\\n// lhs; }\\n//\\n// friend fps operator-(const T &lhs, const fps &rhs) {\\n// return -(fps(rhs) -= lhs);\\n// }\\n//\\n// friend fps operator*(const T &lhs, const fps &rhs) { return fps(rhs) *=\\n// lhs; }\\n// };\\n\\n// using mint = atcoder::modint998244353;\\n// using mint = atcoder::modint1000000007;\\n\\n// using fs = factorials<mint>;\\n\\nint main() {\\n double p;\\n ll N;\\n std::cin >> p >> N;\\n\\n std::vector graph(N, std::vector<std::pair<int, int>>());\\n\\n for (int i = 0; i < N - 1; i++) {\\n int x, y, c;\\n std::cin >> x >> y >> c;\\n x--;\\n y--;\\n graph[x].emplace_back(y, c);\\n graph[y].emplace_back(x, c);\\n }\\n\\n auto rec1 = [&](auto self, int v, int par = -1) -> double {\\n double result = 0;\\n\\n for (auto [w, c] : graph[v]) {\\n if (par == w) continue;\\n result += p * (c + self(self, w, v));\\n }\\n\\n return result;\\n };\\n\\n double orig = rec1(rec1, 0);\\n\\n auto rec2 = [&](auto self, int v, int par = -1) -> double {\\n double result = orig;\\n\\n for (auto [w, c] : graph[v]) {\\n if (par == w) continue;\\n result += p * (c + self(self, w, v));\\n }\\n\\n return result;\\n };\\n\\n std::cout << std::fixed << std::setprecision(15) << rec2(rec2, 0)\\n << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 18012,\n \"score_of_the_acc\": -0.5775,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2807_5968025\",\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< 998244353 >;\\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};\\nvector<vector<pair<int, int>>> g(101010);\\nint depth[101010];\\ndouble p; \\ndouble dfs(int v, int par, int d) {\\n double sum = 0.0;\\n depth[v] = d;\\n for(auto [u, c]: g[v]) {\\n if(u == par) continue;\\n sum += p * (c+dfs(u, v, d+1));\\n }\\n return sum;\\n}\\ndouble mypow[101010];\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n \\n cin >> p;\\n int n; cin >> n;\\n REP(i,n-1) {\\n int a, b, c; cin >> a >> b >> c;\\n a--; b--;\\n g[a].push_back({b, c});\\n g[b].push_back({a, c});\\n }\\n double tmp = dfs(0, -1, 0);\\n mypow[0] = 1;\\n REP(i,100010) mypow[i+1] = mypow[i] * p;\\n\\n double sum = tmp;\\n REP(i,n) sum += mypow[depth[i]] * tmp;\\n cout << sum << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 15944,\n \"score_of_the_acc\": -0.4839,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2807_5967058\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n//#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\nusing namespace std;\\n//#include<boost/multiprecision/cpp_int.hpp>\\n//#include<boost/multiprecision/cpp_dec_float.hpp>\\n//namespace mp=boost::multiprecision;\\n//#define mulint mp::cpp_int\\n//#define mulfloat mp::cpp_dec_float_100\\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\\n#define INF (1<<30)\\n#define LINF (lint)(1LL<<56)\\n#define endl \\\"\\\\n\\\"\\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\\n#define flc(x) __builtin_popcountll(x)\\n#define pint pair<int,int>\\n#define pdouble pair<double,double>\\n#define plint pair<lint,lint>\\n#define fi first\\n#define se second\\n#define all(x) x.begin(),x.end()\\n#define vec vector<lint>\\n#define nep(x) next_permutation(all(x))\\ntypedef long long lint;\\nint dx[8]={1,1,0,-1,-1,-1,0,1};\\nint dy[8]={0,1,1,1,0,-1,-1,-1};\\nconst int MAX_N=4e5+5;\\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//vector<int> bucket[MAX_N/1000];\\nconstexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n/*#include<atcoder/all>\\nusing namespace atcoder;\\ntypedef __int128_t llint;*/\\n\\nvector<pair<int,double>> edge[100050];\\nbool reach[100050];\\ndouble rec[100050];\\nint dep[100050];\\ndouble p;\\n\\ndouble dfs(int now,int depth,double par){\\n if(reach[now]) return rec[now];\\n reach[now]=true;\\n dep[now]=depth;\\n double ret=0;\\n ret+=par*p;\\n //cout << now << \\\" \\\" << ret << endl;\\n rep(i,edge[now].size()){\\n if(reach[edge[now][i].fi]) continue;\\n ret+=dfs(edge[now][i].fi,depth+1,edge[now][i].se)*p;\\n }\\n return rec[now]=ret;\\n}\\n\\nint main(void){\\n cin >> p;\\n int N;\\n cin >> N;\\n rep(i,N-1){\\n int u,v;\\n double c;\\n cin >> u >> v >> c;\\n u--,v--;\\n edge[u].push_back({v,c});\\n edge[v].push_back({u,c});\\n }\\n double res=dfs(0,1,0);\\n double s=res;\\n rep(i,N){\\n res+=s*pow(p,dep[i]-1);\\n }\\n cout << res/p << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 18536,\n \"score_of_the_acc\": -0.6922,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2807_4179050\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing ull = unsigned long long int;\\nusing P = pair<int, int>;\\n\\ndouble p, z = 0;\\nvector<vector<P> > g;\\n\\ndouble dfs(int now, int pre){\\n double res = 0;\\n for(auto e : g[now]){\\n int nxt = e.first, c = e.second;\\n if(nxt == pre) continue;\\n res += p*(dfs(nxt,now)+c);\\n }\\n return res + z;\\n}\\n\\nbool solve(){\\n int n;\\n cin >> p >> n;\\n g.resize(n);\\n for(int i=0;i<n-1;i++){\\n int x, y, c;\\n cin >> x >> y >> c;\\n x--; y--;\\n g[x].push_back(P(y,c));\\n g[y].push_back(P(x,c));\\n }\\n z = dfs(0,-1);\\n printf(\\\"%.9lf\\\\n\\\",dfs(0,-1));\\n return true;\\n}\\n\\nint main(){\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 14500,\n \"score_of_the_acc\": -0.873,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2807_3991442\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nint main() {\\n\\tdouble p;\\n\\tll n;\\n\\tcin >> p >> n;\\n\\tvector<vector<PII>> g(n);\\n\\tREP(i, n - 1) {\\n\\t\\tll a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\ta--, b--;\\n\\t\\tg[a].push_back({ b, c });\\n\\t\\tg[b].push_back({ a, c });\\n\\t}\\n\\n\\tdouble all = 0;\\n\\tfunction<void(ll, ll, double)> pre = [&](ll v, ll par, double prob) {\\n\\t\\tfor (auto to : g[v]) {\\n\\t\\t\\tif (to.first == par) continue;\\n\\t\\t\\tall += prob * to.second;\\n\\t\\t\\tpre(to.first, v, prob * p);\\n\\t\\t}\\n\\t};\\n\\tpre(0, -1, p);\\n\\n\\tdouble ans = 0;\\n\\tfunction<void(ll, ll, double)> dfs = [&](ll v, ll par, double prob) {\\n\\t\\tans += prob * all;\\n\\t\\tfor (auto to : g[v]) {\\n\\t\\t\\tif (to.first == par) continue;\\n\\t\\t\\tans += prob * p * to.second;\\n\\t\\t\\tdfs(to.first, v, prob*p);\\n\\t\\t}\\n\\t};\\n\\tdfs(0, -1, 1);\\n\\t\\n\\tcout << fixed << setprecision(9) << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 19240,\n \"score_of_the_acc\": -1.0877,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2807_3523392\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n\\n#include <cstdio>\\n#include <cstdlib>\\n#include <iostream>\\n#include <cmath>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n\\nusing namespace std;\\n\\ntypedef pair<long long int, long long int> P;\\n\\nlong long int INF = 1e18;\\nlong long int MOD = 1e9 + 7;\\n\\nvector<int> E[110000];\\ndouble p;\\ndouble prob[110000] = {};\\nlong long int cost[110000] = {};\\n\\nvoid func(int pos, int pre, double pp){\\n prob[pos] = pp;\\n for(int i = 0; i < E[pos].size(); i++){\\n if(E[pos][i] != pre){\\n func(E[pos][i], pos, pp * p);\\n }\\n }\\n}\\n\\nint main(){\\n cin >> p;\\n int N;\\n cin >> N;\\n for(int i = 0; i < N - 1; i++){\\n int u1, u2, c;\\n cin >> u1 >> u2 >> c;\\n E[u1].push_back(u2);\\n E[u2].push_back(u1);\\n cost[u2] = c;\\n }\\n func(1, -1, 1);\\n double ans = 0;\\n double S = 0;\\n for(int i = 1; i <= N; i++){\\n ans += prob[i] * cost[i];\\n S += prob[i];\\n }\\n ans += S * ans;\\n printf(\\\"%.10f\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 60,\n \"memory_kb\": 16716,\n \"score_of_the_acc\": -0.8825,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2807_3523381\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n\\n#include <cstdio>\\n#include <cstdlib>\\n#include <iostream>\\n#include <cmath>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n\\nusing namespace std;\\n\\ntypedef pair<long long int, long long int> P;\\n\\nlong long int INF = 1e18;\\nlong long int MOD = 1e9 + 7;\\n\\nvector<int> E[110000];\\ndouble p;\\ndouble prob[110000] = {};\\nlong long int cost[110000] = {};\\n\\nvoid func(int pos, double pp){\\n prob[pos] = pp;\\n for(int i = 0; i < E[pos].size(); i++){\\n func(E[pos][i], pp * p);\\n }\\n}\\n\\nint main(){\\n cin >> p;\\n int N;\\n cin >> N;\\n for(int i = 0; i < N - 1; i++){\\n int u1, u2, c;\\n cin >> u1 >> u2 >> c;\\n E[u1].push_back(u2);\\n cost[u2] = c;\\n }\\n func(1, 1);\\n double ans = 0;\\n double S = 0;\\n for(int i = 1; i <= N; i++){\\n ans += prob[i] * cost[i];\\n S += prob[i];\\n }\\n ans += S * ans;\\n printf(\\\"%.10f\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 60,\n \"memory_kb\": 15252,\n \"score_of_the_acc\": -0.8162,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2807_3252038\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2807.cc: Fractal Tree\\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\n\\n/* typedef */\\n\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vpii;\\n\\nstruct Stat {\\n int i, prt;\\n double p;\\n Stat() {}\\n Stat(int _i, int _prt, double _p): i(_i), prt(_prt), p(_p) {}\\n};\\n\\n/* global variables */\\n\\nvpii nbrs[MAX_N];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n double p;\\n int n;\\n scanf(\\\"%lf%d\\\", &p, &n);\\n\\n for (int i = 1; i < n; i++) {\\n int x, y, c;\\n scanf(\\\"%d%d%d\\\", &x, &y, &c);\\n x--, y--;\\n nbrs[x].push_back(pii(y, c));\\n nbrs[y].push_back(pii(x, c));\\n }\\n\\n queue<Stat> q;\\n q.push(Stat(0, -1, 1.0));\\n double t = 0.0;\\n\\n while (! q.empty()) {\\n Stat u = q.front(); q.pop();\\n vpii nbru = nbrs[u.i];\\n double vp = u.p * p;\\n\\n for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\\n int &vi = vit->first, &vc = vit->second;\\n if (vi != u.prt) {\\n\\tt += vc * vp;\\n\\tq.push(Stat(vi, u.i, vp));\\n }\\n }\\n }\\n //printf(\\\"t=%lf\\\\n\\\", t);\\n\\n q.push(Stat(0, -1, 1.0));\\n double ans = t;\\n \\n while (! q.empty()) {\\n Stat u = q.front(); q.pop();\\n vpii nbru = nbrs[u.i];\\n double vp = u.p * p;\\n ans += t * u.p;\\n\\n for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\\n int &vi = vit->first;\\n if (vi != u.prt)\\n\\tq.push(Stat(vi, u.i, vp));\\n }\\n }\\n printf(\\\"%.10lf\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 9268,\n \"score_of_the_acc\": -0.2724,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2807_2977017\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nvector<pair<int,double> > G[100000];\\ndouble p;\\nint n;\\nint deep=0;\\ndouble ans=0;\\ndouble ans2;\\n\\nvector<int> used(100000,0);\\nvector<int> used1(100000,0);\\n\\nvoid dfs(int x){\\n\\n deep++;\\n for(int i=0;i<G[x].size();i++){\\n if(used[G[x][i].first]==0){\\n used[G[x][i].first]=1;\\n ans+=pow(p,deep)*G[x][i].second;\\n dfs(G[x][i].first);\\n }\\n }\\n deep--;\\n}\\n\\nvoid dfs2(int x){\\n deep++;\\n for(int i=0;i<G[x].size();i++){\\n if(used1[G[x][i].first]==0){\\n used1[G[x][i].first]=1;\\n ans2+=pow(p,deep)*(G[x][i].second+ans);\\n dfs2(G[x][i].first);\\n }\\n }\\n deep--;\\n}\\n\\nint main(){\\n cin>>p>>n;\\n for(int i=0;i<n-1;i++){\\n int a,b;\\n double c;\\n cin>>a>>b>>c;\\n a--;\\n b--;\\n G[a].push_back(make_pair(b,c));\\n G[b].push_back(make_pair(a,c));\\n }\\n used[0]=1;\\n used1[0]=1;\\n dfs(0);\\n ans2=ans;\\n deep=0;\\n dfs2(0);\\n\\n cout<< fixed << setprecision(10) <<ans2<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 15592,\n \"score_of_the_acc\": -1.2861,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2807_2976998\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing P = pair<int, int>;\\n\\nvector<bool> used;\\nvector<vector<P>> g;\\nvector<P> num;\\n\\nvoid dfs(int s, int dep) {\\n for (auto&& p : g[s]) {\\n int v, c; tie(v, c) = p;\\n if (used[v]) continue;\\n used[v] = true;\\n num[v] = {dep + 1, c};\\n dfs(v, dep + 1);\\n }\\n}\\n\\nint main() {\\n double p; cin >> p;\\n int N; cin >> N;\\n g = vector<vector<P>>(N);\\n for (int i = 0; i < N-1; ++i) {\\n int x, y, c; cin >> x >> y >> c; --x; --y;\\n g[x].push_back({y, c});\\n g[y].push_back({x, c});\\n }\\n used = vector<bool>(N, false);\\n num = vector<P>(N, {0, 0});\\n used[0] = true;\\n dfs(0, 0);\\n\\n double t = 0;\\n for (int i = 1; i < N; ++i) t += pow(p, num[i].first) * num[i].second;\\n double d = 0;\\n for (int i = 0; i < N; ++i) d += pow(p, num[i].first);\\n\\n cout << fixed << setprecision(7) << t + t * d << endl; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 12364,\n \"score_of_the_acc\": -0.9581,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2807_2976978\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nvector<pair<int,double> > G[100000];\\ndouble p;\\nint n;\\nint deep=0;\\ndouble ans=0;\\ndouble ans2;\\n\\nvoid dfs(int x){\\n deep++;\\n for(int i=0;i<G[x].size();i++){\\n ans+=pow(p,deep)*G[x][i].second;\\n dfs(G[x][i].first);\\n }\\n deep--;\\n}\\n\\nvoid dfs2(int x){\\n deep++;\\n for(int i=0;i<G[x].size();i++){\\n ans2+=pow(p,deep)*(G[x][i].second+ans);\\n dfs2(G[x][i].first);\\n }\\n deep--;\\n}\\n\\nint main(){\\n cin>>p>>n;\\n for(int i=0;i<n-1;i++){\\n int a,b;\\n double c;\\n cin>>a>>b>>c;\\n a--;\\n b--;\\n if(a>b){\\n int tmp=a;\\n a=b;\\n b=tmp;\\n }\\n G[a].push_back(make_pair(b,c));\\n }\\n dfs(0);\\n ans2=ans;\\n deep=0;\\n dfs2(0);\\n\\n cout<< fixed << setprecision(10) <<ans2<<endl;\\n\\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 80,\n \"memory_kb\": 11968,\n \"score_of_the_acc\": -0.8493,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2807_2976972\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nvector<pair<int,double> > G[100000];\\ndouble p;\\nint n;\\nint deep=0;\\ndouble ans=0;\\ndouble ans2;\\n\\nvoid dfs(int x){\\n deep++;\\n for(int i=0;i<G[x].size();i++){\\n ans+=pow(p,deep)*G[x][i].second;\\n dfs(G[x][i].first);\\n }\\n deep--;\\n}\\n\\nvoid dfs2(int x){\\n deep++;\\n for(int i=0;i<G[x].size();i++){\\n ans2+=pow(p,deep)*(G[x][i].second+ans);\\n dfs2(G[x][i].first);\\n }\\n deep--;\\n}\\n\\nint main(){\\n cin>>p>>n;\\n for(int i=0;i<n-1;i++){\\n int a,b;\\n double c;\\n cin>>a>>b>>c;\\n a--;\\n b--;\\n int ma,mi;\\n ma=max(a,b);\\n mi=min(a,b);\\n a=mi;\\n b=ma;\\n G[a].push_back(make_pair(b,c));\\n }\\n dfs(0);\\n ans2=ans;\\n deep=0;\\n dfs2(0);\\n\\n cout<< fixed << setprecision(10) <<ans2<<endl;\\n\\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 80,\n \"memory_kb\": 11988,\n \"score_of_the_acc\": -0.8502,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2807_2976965\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nvector<pair<int,int> > G[100000];\\ndouble p;\\nint n;\\nint deep=0;\\ndouble ans=0;\\ndouble ans2;\\n\\nvoid dfs(int x){\\n deep++;\\n for(int i=0;i<G[x].size();i++){\\n ans+=pow(p,deep)*G[x][i].second;\\n dfs(G[x][i].first);\\n }\\n deep--;\\n}\\n\\nvoid dfs2(int x){\\n deep++;\\n for(int i=0;i<G[x].size();i++){\\n ans2+=pow(p,deep)*(G[x][i].second+ans);\\n dfs2(G[x][i].first);\\n }\\n deep--;\\n}\\n\\nint main(){\\n cin>>p>>n;\\n for(int i=0;i<n-1;i++){\\n int a,b,c;\\n cin>>a>>b>>c;\\n a--;\\n b--;\\n int ma,mi;\\n ma=max(a,b);\\n mi=min(a,b);\\n a=mi;\\n b=ma;\\n G[a].push_back(make_pair(b,c));\\n }\\n dfs(0);\\n ans2=ans;\\n deep=0;\\n dfs2(0);\\n\\n cout<< fixed << setprecision(10) <<ans2<<endl;\\n\\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 70,\n \"memory_kb\": 12044,\n \"score_of_the_acc\": -0.7618,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2807_2976956\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing P = pair<int, int>;\\n\\nint main() {\\n double p; cin >> p;\\n int N; cin >> N;\\n auto xy = vector<P>(N-1);\\n auto c = vector<int>(N-1);\\n for (int i = 0; i < N-1; ++i) {\\n cin >> xy[i].first >> xy[i].second >> c[i];\\n --xy[i].first; --xy[i].second;\\n }\\n sort(begin(xy), end(xy));\\n auto num = vector<P>(N, {0, 0});\\n num[0] = {0, 0};\\n for (int i = 0; i < N-1; ++i) {\\n num[xy[i].second] = {num[xy[i].first].first + 1, c[i]};\\n }\\n double t = 0;\\n for (int i = 1; i < N; ++i) t += pow(p, num[i].first) * num[i].second;\\n double d = 0;\\n for (int i = 0; i < N; ++i) d += pow(p, num[i].first);\\n\\n cout << fixed << setprecision(7) << t + t * d << endl; \\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 80,\n \"memory_kb\": 5260,\n \"score_of_the_acc\": -0.5455,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2807_2976946\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nvector<pair<int,int> > G[100000];\\ndouble p;\\nint n;\\nint deep=0;\\ndouble ans=0;\\ndouble ans2;\\n\\nvoid dfs(int x){\\n for(int i=0;i<G[x].size();i++){\\n deep++;\\n ans+=pow(p,deep)*G[x][i].second;\\n dfs(G[x][i].first);\\n deep--;\\n }\\n}\\n\\nvoid dfs2(int x){\\n for(int i=0;i<G[x].size();i++){\\n deep++;\\n ans2+=pow(p,deep)*(G[x][i].second+ans);\\n dfs2(G[x][i].first);\\n deep--;\\n }\\n}\\n\\nint main(){\\n cin>>p>>n;\\n for(int i=0;i<n-1;i++){\\n int a,b,c;\\n cin>>a>>b>>c;\\n a--;\\n b--;\\n int ma,mi;\\n ma=max(a,b);\\n mi=min(a,b);\\n a=mi;\\n b=ma;\\n G[a].push_back(make_pair(b,c));\\n }\\n dfs(0);\\n ans2=ans;\\n deep=0;\\n dfs2(0);\\n\\n cout<< fixed << setprecision(10) <<ans2<<endl;\\n\\n}\",\n \"accuracy\": 0.15789473684210525,\n \"time_ms\": 80,\n \"memory_kb\": 11920,\n \"score_of_the_acc\": -0.8471,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1688,"cells":{"group_id":{"kind":"string","value":"aoj_2804_cpp"},"problem_description":{"kind":"string","value":"G: 最小包含矩形 - Minimum Enclosing Rectangle -\n物語\nみんなぁ、こんにちは！ 八森中ぷろこん部の藍座あいりだよぉ。\n突然だけど、あいりがこの前解けなかった問題をみんなに解いて欲しいんだぁ～。\nこの前部活で\nICPC2010のA問題\nを解いたんだけど、その時の問題が難しかったんだぁ。\nあ、ICPCについて説明しなきゃ！ ICPCは、い、いんたーなしょなる……ちゅうがくせい……ぷろぐらみんぐ……こんてすとの略で、日本語に直すと、国際中学生対抗プログラミングコンテストらしいよぉ！ あいりにはちょっとむずかしい言葉がいっぱいだよぉ。\nあいり達はこの世界大会に出るために毎日頑張ってるんだぁ！\n部活から帰った後お姉ちゃんにも聞いてみたんだけど、「わ、わからないわ……A問題からわからないなんて……お姉ちゃん失格ね……」って落ち込んじゃって…… \nでも、「『プロ』の人たちが一杯集まるところを知ってるの、お姉ちゃんちょっと連絡してみるわ。あいり、そこで聞いてみなさい！」って言ってここの合宿を教えてもらったんだぁ～ 。\nここに集まる『プロ』のみんなには簡単かもしれないけど……この問題を解いてほしいの！\n問題\n長さが\n1\nの正方形が\nN\n個、\n2\n次元平面上にある。これら\nN\n個の正方形を全て内包する、最小面積の長方形を求めよ。\n入力形式\n入力は\nN\n行からなる。\nN\nn_1\nd_1\nn_2\nd_2\nn_3\nd_3\n...\nn_{N − 1}\nd_{N − 1}\n最初の行には、正方形の個数\nN\nが与えられる。\n以下\nN − 1\n行は、正方形の置き方を表している。そのうち上から\ni\n行目は、空白区切りで1つの整数\nn_{i}\nと1つの文字\nd_{i}\nが与えられる。これは\ni\n番目の正方形の置き方を指示している。ここで正方形の番号付けは、最初の正方形を\n0\n番目とし、その後置いた順番に\n1\n,\n2\n, ...,\nN − 1\nと番号付けられるものとする。\n0\n番目の正方形に対する置き方の指示はない。\ni\n番目の正方形に対する置き方の指示\nn_i, d_i\nは、\ni\n番目の正方形を\nn_i\n番目の正方形に対して\nd_i\nで示される方向に隣接して置くことを指示する。\nここで、\nn_i\nは\ni\n未満の非負整数である。また、\nd_i\nは\n0,1,2,3\nのいずれかの値をとり、それぞれ\nd_i\nの値が、\n0\nならば左側、\n1\nならば下側、\n2\nならば右側、\n3\nならば上側を表す。\n以下にそれぞれの入力例に対応した最終的な正方形の配置を図示している。左から入力例1、入力例2、入力例3、入力例4の最終的な正方形の配置となっている。図中の番号は正方形の番号に相当する。また、図中の緑線は求める最小面積の長方形を示している。\n制約\n入力はすべて整数\n1 ≤ N ≤ 100,000\n1 ≤ n_i < i\n(\n1 ≤ i < N\n)\n0 ≤ d_i ≤ 3\n(\n1 ≤ i < N\n)\n既に正方形が置かれている位置に、新たな正方形を置くような指示は与えられない。\n出力形式\n与えられた\nN\n個の点を全て包含する最小面積の長方形の面積を1行で出力する。\n出力には\n10^{−5}\n以上の誤差を含んではならない。\n入力例1\n1\n出力例1\n1\n入力例2\n5\n0 0\n0 1\n0 2\n0 3\n出力例2\n8\n入力例3\n12\n0 0\n1 0\n2 0\n3 1\n4 1\n5 1\n6 2\n7 2\n8 2\n9 3\n10 3\n出力例3\n16\n入力例4\n10\n0 2\n1 2\n2 2\n3 2\n2 1\n5 1\n6 1\n7 1\n8 1\n出力例4\n30"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2804_8322784","code_snippet":"#include <iostream>\n#include <cmath>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct Point {\n\tlong long px, py;\n};\n\nPoint operator-(const Point& a1, const Point& a2) {\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n}\n\nbool operator<(const Point& a1, const Point& a2) {\n\tif (a2.py - a1.py > 0) return true;\n\tif (a1.py - a2.py > 0) return false;\n\tif (a2.px - a1.px > 0) return true;\n\tif (a1.px - a2.px > 0) return false;\n\treturn false;\n}\n\nlong long crs(Point a1, Point a2) {\n\treturn a1.px * a2.py - a2.px * a1.py;\n}\n\nvector<Point> Convex(vector<Point> Poly) {\n\tsort(Poly.begin(), Poly.end());\n\n\t// Right Part\n\tvector<Point> Stack1 = { Poly[0], Poly[1] };\n\tfor (int i = 2; i < Poly.size(); i++) {\n\t\twhile (Stack1.size() >= 2) {\n\t\t\tPoint v1 = Stack1[Stack1.size() - 2];\n\t\t\tPoint v2 = Stack1[Stack1.size() - 1];\n\t\t\tPoint v3 = Poly[i];\n\t\t\tif (crs(v2 - v1, v3 - v2) <= 0) Stack1.pop_back();\n\t\t\telse break;\n\t\t}\n\t\tStack1.push_back(Poly[i]);\n\t}\n\n\t// Left Part\n\tvector<Point> Stack2 = { Poly[0], Poly[1] };\n\tfor (int i = 2; i < Poly.size(); i++) {\n\t\twhile (Stack2.size() >= 2) {\n\t\t\tPoint v1 = Stack2[Stack2.size() - 2];\n\t\t\tPoint v2 = Stack2[Stack2.size() - 1];\n\t\t\tPoint v3 = Poly[i];\n\t\t\tif (crs(v2 - v1, v3 - v2) >= 0) Stack2.pop_back();\n\t\t\telse break;\n\t\t}\n\t\tStack2.push_back(Poly[i]);\n\t}\n\n\t// Joint\n\tvector<Point> Return = Stack1;\n\tfor (int i = (int)Stack2.size() - 2; i >= 1; i--) Return.push_back(Stack2[i]);\n\treturn Return;\n}\n\nconst int dx[4] = { -1, 0, 1, 0 };\nconst int dy[4] = { 0, -1, 0, 1 };\nconst long double TEISUU = 3.14159265358979L / 2.0L;\nlong long N;\nlong long A[1 << 18], B[1 << 18];\nlong long X[1 << 18], Y[1 << 18];\nlong double Angle[1 << 18];\n\nlong double GetArea(Point p1, Point p2, Point p3, Point p4, long double val) {\n\t// Get Yoko1\n\tPoint diff1 = p2 - p1;\n\tlong double dst1 = sqrtl(1.0L * diff1.px * diff1.px + 1.0L * diff1.py * diff1.py);\n\tlong double yoko1 = dst1 * cos(atan2l(diff1.py, diff1.px) - val);\n\n\t// Get Yoko2\n\tPoint diff2 = p1 - p4;\n\tlong double dst2 = sqrtl(1.0L * diff2.px * diff2.px + 1.0L * diff2.py * diff2.py);\n\tlong double yoko2 = dst2 * cos(atan2l(diff2.py, diff2.px) - val);\n\n\t// Get Tate1\n\tlong double tate1 = dst1 * sin(atan2l(diff1.py, diff1.px) - val);\n\n\t// Get Tate2\n\tPoint diff3 = p3 - p2;\n\tlong double dst3 = sqrt(1.0L * diff3.px * diff3.px + 1.0L * diff3.py * diff3.py);\n\tlong double tate2 = dst3 * cos(atan2l(diff3.py, diff3.px) - (val + TEISUU));\n\n\t// Return\n\treturn (yoko1 + yoko2) * (tate1 + tate2);\n}\n\nlong double Tansaku(Point p1, Point p2, Point p3, Point p4, double Left, long double Rigt) {\n\tlong double cl = Left, cr = Rigt, c1 = 0, c2 = 0, minx = 1.0e12L;\n\tminx = min(minx, GetArea(p1, p2, p3, p4, Left));\n\tminx = min(minx, GetArea(p1, p2, p3, p4, Rigt));\n\tfor (int i = 0; i < 40; i++) {\n\t\tc1 = (cl + cl + cr) / 3.0L;\n\t\tc2 = (cl + cr + cr) / 3.0L;\n\t\tc2 = Rigt;\n\t\tlong double v1 = GetArea(p1, p2, p3, p4, c1);\n\t\tlong double v2 = GetArea(p1, p2, p3, p4, c2);\n\t\tminx = min(minx, min(v1, v2));\n\t\tif (v1 > v2) { v1 = c1; }\n\t\telse { v2 = c2; }\n\t}\n\treturn minx;\n}\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tfor (int i = 1; i < N; i++) cin >> A[i] >> B[i];\n\t// for (int i = 1; i < N; i++) { A[i] = max(0, i - 4); B[i] = (i - 1) % 4; }\n\tfor (int i = 1; i < N; i++) {\n\t\tX[i] = X[A[i]] + dx[B[i]];\n\t\tY[i] = Y[A[i]] + dy[B[i]];\n\t}\n\n\t// Step 2. Convex\n\tvector<Point> V;\n\tfor (int i = 0; i < N; i++) {\n\t\tV.push_back(Point{ X[i] + 0, Y[i] + 0 });\n\t\tV.push_back(Point{ X[i] + 0, Y[i] + 1 });\n\t\tV.push_back(Point{ X[i] + 1, Y[i] + 0 });\n\t\tV.push_back(Point{ X[i] + 1, Y[i] + 1 });\n\t}\n\tvector<Point> W = Convex(V);\n\tfor (int i = 0; i < W.size(); i++) {\n\t\tPoint v = W[i] - W[(i + W.size() - 1) % W.size()];\n\t\tAngle[i] = atan2(v.py, v.px);\n\t\tif (Angle[i] < 0.0L) Angle[i] += 4.0L * TEISUU;\n\t}\n\n\t// Step 3. Brute Force\n\tlong double Answer = 1.0e12;\n\tfor (int i = 0; i <= W.size(); i++) {\n\t\tfor (int j = i + 1; j <= W.size(); j++) {\n\t\t\tfor (int k = j + 1; k <= W.size(); k++) {\n\t\t\t\tfor (int l = k + 1; l <= W.size(); l++) {\n\t\t\t\t\tlong double cl = 0.0L - 1.0e-9L, cr = TEISUU + 1.0e-9L;\n\t\t\t\t\tif (i != 0) cl = max(cl, Angle[(i + 0) % W.size()]);\n\t\t\t\t\tcr = min(cr, Angle[(i + 1) % W.size()]);\n\t\t\t\t\tcl = max(cl, Angle[(j + 0) % W.size()] - 1.0L * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(j + 1) % W.size()] - 1.0L * TEISUU);\n\t\t\t\t\tcl = max(cl, Angle[(k + 0) % W.size()] - 2.0L * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(k + 1) % W.size()] - 2.0L * TEISUU);\n\t\t\t\t\tcl = max(cl, Angle[(l + 0) % W.size()] - 3.0L * TEISUU);\n\t\t\t\t\tif (l != W.size()) cr = min(cr, Angle[(l + 1) % W.size()] - 3.0L * TEISUU);\n\t\t\t\t\tif (cl > cr) continue;\n\t\t\t\t\tlong double ret = Tansaku(W[i], W[j], W[k], W[l % W.size()], cl, cr);\n\t\t\t\t\tAnswer = min(Answer, ret);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12Lf\\n\", Answer);\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":25708,"score_of_the_acc":-0.639,"final_rank":9},{"submission_id":"aoj_2804_8322734","code_snippet":"#include <iostream>\n#include <cmath>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct Point {\n\tlong long px, py;\n};\n\nPoint operator-(const Point& a1, const Point& a2) {\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n}\n\nbool operator<(const Point& a1, const Point& a2) {\n\tif (a2.py - a1.py > 0) return true;\n\tif (a1.py - a2.py > 0) return false;\n\tif (a2.px - a1.px > 0) return true;\n\tif (a1.px - a2.px > 0) return false;\n\treturn false;\n}\n\nlong long crs(Point a1, Point a2) {\n\treturn a1.px * a2.py - a2.px * a1.py;\n}\n\nvector<Point> Convex(vector<Point> Poly) {\n\tsort(Poly.begin(), Poly.end());\n\n\t// Right Part\n\tvector<Point> Stack1 = { Poly[0], Poly[1] };\n\tfor (int i = 2; i < Poly.size(); i++) {\n\t\twhile (Stack1.size() >= 2) {\n\t\t\tPoint v1 = Stack1[Stack1.size() - 2];\n\t\t\tPoint v2 = Stack1[Stack1.size() - 1];\n\t\t\tPoint v3 = Poly[i];\n\t\t\tif (crs(v2 - v1, v3 - v2) <= 0) Stack1.pop_back();\n\t\t\telse break;\n\t\t}\n\t\tStack1.push_back(Poly[i]);\n\t}\n\n\t// Left Part\n\tvector<Point> Stack2 = { Poly[0], Poly[1] };\n\tfor (int i = 2; i < Poly.size(); i++) {\n\t\twhile (Stack2.size() >= 2) {\n\t\t\tPoint v1 = Stack2[Stack2.size() - 2];\n\t\t\tPoint v2 = Stack2[Stack2.size() - 1];\n\t\t\tPoint v3 = Poly[i];\n\t\t\tif (crs(v2 - v1, v3 - v2) >= 0) Stack2.pop_back();\n\t\t\telse break;\n\t\t}\n\t\tStack2.push_back(Poly[i]);\n\t}\n\n\t// Joint\n\tvector<Point> Return = Stack1;\n\tfor (int i = (int)Stack2.size() - 2; i >= 1; i--) Return.push_back(Stack2[i]);\n\treturn Return;\n}\n\nconst int dx[4] = { -1, 0, 1, 0 };\nconst int dy[4] = { 0, -1, 0, 1 };\nconst long double TEISUU = 3.14159265358979L / 2.0L;\nlong long N;\nlong long A[1 << 18], B[1 << 18];\nlong long X[1 << 18], Y[1 << 18];\nlong double Angle[1 << 18];\n\nlong double GetArea(Point p1, Point p2, Point p3, Point p4, long double val) {\n\t// Get Yoko1\n\tPoint diff1 = p2 - p1;\n\tlong double dst1 = sqrtl(1.0L * diff1.px * diff1.px + 1.0L * diff1.py * diff1.py);\n\tlong double yoko1 = dst1 * cos(atan2l(diff1.py, diff1.px) - val);\n\n\t// Get Yoko2\n\tPoint diff2 = p1 - p4;\n\tlong double dst2 = sqrtl(1.0L * diff2.px * diff2.px + 1.0L * diff2.py * diff2.py);\n\tlong double yoko2 = dst2 * cos(atan2l(diff2.py, diff2.px) - val);\n\n\t// Get Tate1\n\tlong double tate1 = dst1 * sin(atan2l(diff1.py, diff1.px) - val);\n\n\t// Get Tate2\n\tPoint diff3 = p3 - p2;\n\tlong double dst3 = sqrt(1.0L * diff3.px * diff3.px + 1.0L * diff3.py * diff3.py);\n\tlong double tate2 = dst3 * cos(atan2l(diff3.py, diff3.px) - (val + TEISUU));\n\n\t// Return\n\treturn (yoko1 + yoko2) * (tate1 + tate2);\n}\n\nlong double Tansaku(Point p1, Point p2, Point p3, Point p4, long double Left, long double Rigt) {\n\tlong double minx = 1.0e12L;\n\tminx = min(minx, GetArea(p1, p2, p3, p4, Left));\n\tminx = min(minx, GetArea(p1, p2, p3, p4, Rigt));\n\tfor (int t = 0; t < 10; t++) {\n\t\tlong double cl = 0.1L * (10 - t) * Left + 0.1L * (t + 0) * Rigt;\n\t\tlong double cr = 0.1L * ( 9 - t) * Left + 0.1L * (t + 1) * Rigt;\n\t\tlong double c1 = 0, c2 = 0;\n\t\tfor (int i = 0; i < 80; i++) {\n\t\t\tc1 = (cl + cl + cr) / 3.0L;\n\t\t\tc2 = (cl + cr + cr) / 3.0L;\n\t\t\tc2 = Rigt;\n\t\t\tlong double v1 = GetArea(p1, p2, p3, p4, c1);\n\t\t\tlong double v2 = GetArea(p1, p2, p3, p4, c2);\n\t\t\tminx = min(minx, min(v1, v2));\n\t\t\tif (v1 > v2) { v1 = c1; }\n\t\t\telse { v2 = c2; }\n\t\t}\n\t}\n\treturn minx;\n}\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tfor (int i = 1; i < N; i++) cin >> A[i] >> B[i];\n\t// for (int i = 1; i < (N + 1) / 2; i++) { A[i] = i - 1; B[i] = 0; }\n\t// for (int i = (N + 1) / 2; i < N; i++) { A[i] = i - 1; B[i] = 1; }\n\tfor (int i = 1; i < N; i++) {\n\t\tX[i] = X[A[i]] + dx[B[i]];\n\t\tY[i] = Y[A[i]] + dy[B[i]];\n\t}\n\n\t// Step 2. Convex\n\tvector<Point> V;\n\tfor (int i = 0; i < N; i++) {\n\t\tV.push_back(Point{ X[i] + 0, Y[i] + 0 });\n\t\tV.push_back(Point{ X[i] + 0, Y[i] + 1 });\n\t\tV.push_back(Point{ X[i] + 1, Y[i] + 0 });\n\t\tV.push_back(Point{ X[i] + 1, Y[i] + 1 });\n\t}\n\tvector<Point> W = Convex(V);\n\tfor (int i = 0; i < W.size(); i++) {\n\t\tPoint v = W[i] - W[(i + W.size() - 1) % W.size()];\n\t\tAngle[i] = atan2(v.py, v.px);\n\t\tif (Angle[i] < 0.0) Angle[i] += 4.0 * TEISUU;\n\t}\n\n\t// Step 3. Brute Force\n\tlong double Answer = 1.0e12;\n\tfor (int i = 0; i < W.size(); i++) {\n\t\tfor (int j = i + 1; j < W.size(); j++) {\n\t\t\tfor (int k = j + 1; k < W.size(); k++) {\n\t\t\t\tfor (int l = k + 1; l < W.size(); l++) {\n\t\t\t\t\tlong double cl = 0.0L - 1.0e-9L, cr = TEISUU + 1.0e-9L;\n\t\t\t\t\tif (i != 0) cl = max(cl, Angle[(i + 0) % W.size()]);\n\t\t\t\t\tcr = min(cr, Angle[(i + 1) % W.size()]);\n\t\t\t\t\tcl = max(cl, Angle[(j + 0) % W.size()] - 1.0 * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(j + 1) % W.size()] - 1.0 * TEISUU);\n\t\t\t\t\tcl = max(cl, Angle[(k + 0) % W.size()] - 2.0 * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(k + 1) % W.size()] - 2.0 * TEISUU);\n\t\t\t\t\tcl = max(cl, Angle[(l + 0) % W.size()] - 3.0 * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(l + 1) % W.size()] - 3.0 * TEISUU);\n\t\t\t\t\tif (cl > cr) continue;\n\t\t\t\t\tlong double ret = Tansaku(W[i], W[j], W[k], W[l], cl, cr);\n\t\t\t\t\tAnswer = min(Answer, ret);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12Lf\\n\", Answer);\n\treturn 0;\n}","accuracy":0.6233766233766234,"time_ms":90,"memory_kb":25088,"score_of_the_acc":-0.7659,"final_rank":20},{"submission_id":"aoj_2804_8322725","code_snippet":"#include <iostream>\n#include <cmath>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct Point {\n\tlong long px, py;\n};\n\nPoint operator-(const Point& a1, const Point& a2) {\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n}\n\nbool operator<(const Point& a1, const Point& a2) {\n\tif (a2.py - a1.py > 0) return true;\n\tif (a1.py - a2.py > 0) return false;\n\tif (a2.px - a1.px > 0) return true;\n\tif (a1.px - a2.px > 0) return false;\n\treturn false;\n}\n\nlong long crs(Point a1, Point a2) {\n\treturn a1.px * a2.py - a2.px * a1.py;\n}\n\nvector<Point> Convex(vector<Point> Poly) {\n\tsort(Poly.begin(), Poly.end());\n\n\t// Right Part\n\tvector<Point> Stack1 = { Poly[0], Poly[1]};\n\tfor (int i = 2; i < Poly.size(); i++) {\n\t\twhile (Stack1.size() >= 2) {\n\t\t\tPoint v1 = Stack1[Stack1.size() - 2];\n\t\t\tPoint v2 = Stack1[Stack1.size() - 1];\n\t\t\tPoint v3 = Poly[i];\n\t\t\tif (crs(v2 - v1, v3 - v2) <= 0) Stack1.pop_back();\n\t\t\telse break;\n\t\t}\n\t\tStack1.push_back(Poly[i]);\n\t}\n\n\t// Left Part\n\tvector<Point> Stack2 = { Poly[0], Poly[1] };\n\tfor (int i = 2; i < Poly.size(); i++) {\n\t\twhile (Stack2.size() >= 2) {\n\t\t\tPoint v1 = Stack2[Stack2.size() - 2];\n\t\t\tPoint v2 = Stack2[Stack2.size() - 1];\n\t\t\tPoint v3 = Poly[i];\n\t\t\tif (crs(v2 - v1, v3 - v2) >= 0) Stack2.pop_back();\n\t\t\telse break;\n\t\t}\n\t\tStack2.push_back(Poly[i]);\n\t}\n\n\t// Joint\n\tvector<Point> Return = Stack1;\n\tfor (int i = (int)Stack2.size() - 2; i >= 1; i--) Return.push_back(Stack2[i]);\n\treturn Return;\n}\n\nconst int dx[4] = { -1, 0, 1, 0 };\nconst int dy[4] = { 0, -1, 0, 1 };\nconst long double TEISUU = 3.14159265358979L / 2.0L;\nlong long N;\nlong long A[1 << 18], B[1 << 18];\nlong long X[1 << 18], Y[1 << 18];\nlong double Angle[1 << 18];\n\nlong double GetArea(Point p1, Point p2, Point p3, Point p4, long double val) {\n\t// Get Yoko1\n\tPoint diff1 = p2 - p1;\n\tlong double dst1 = sqrtl(1.0L * diff1.px * diff1.px + 1.0L * diff1.py * diff1.py);\n\tlong double yoko1 = dst1 * cos(atan2l(diff1.py, diff1.px) - val);\n\n\t// Get Yoko2\n\tPoint diff2 = p1 - p4;\n\tlong double dst2 = sqrtl(1.0L * diff2.px * diff2.px + 1.0L * diff2.py * diff2.py);\n\tlong double yoko2 = dst2 * cos(atan2l(diff2.py, diff2.px) - val);\n\t\n\t// Get Tate1\n\tlong double tate1 = dst1 * sin(atan2l(diff1.py, diff1.px) - val);\n\n\t// Get Tate2\n\tPoint diff3 = p3 - p2;\n\tlong double dst3 = sqrt(1.0L * diff3.px * diff3.px + 1.0L * diff3.py * diff3.py);\n\tlong double tate2 = dst3 * cos(atan2l(diff3.py, diff3.px) - (val + TEISUU));\n\n\t// Return\n\treturn (yoko1 + yoko2) * (tate1 + tate2);\n}\n\nlong double Tansaku(Point p1, Point p2, Point p3, Point p4, long double Left, long double Rigt) {\n\tlong double cl = Left, cr = Rigt, c1 = 0, c2 = 0, minx = 1.0e12L;\n\tminx = min(minx, GetArea(p1, p2, p3, p4, Left));\n\tminx = min(minx, GetArea(p1, p2, p3, p4, Rigt));\n\tfor (int i = 0; i < 80; i++) {\n\t\tc1 = (cl + cl + cr) / 3.0L;\n\t\tc2 = (cl + cr + cr) / 3.0L;\n\t\tc2 = Rigt;\n\t\tlong double v1 = GetArea(p1, p2, p3, p4, c1);\n\t\tlong double v2 = GetArea(p1, p2, p3, p4, c2);\n\t\tminx = min(minx, min(v1, v2));\n\t\tif (v1 > v2) { v1 = c1; }\n\t\telse { v2 = c2; }\n\t}\n\treturn minx;\n}\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tfor (int i = 1; i < N; i++) cin >> A[i] >> B[i];\n\tfor (int i = 1; i < N; i++) {\n\t\tX[i] = X[A[i]] + dx[B[i]];\n\t\tY[i] = Y[A[i]] + dy[B[i]];\n\t}\n\n\t// Step 2. Convex\n\tvector<Point> V;\n\tfor (int i = 0; i < N; i++) {\n\t\tV.push_back(Point{ X[i] + 0, Y[i] + 0 });\n\t\tV.push_back(Point{ X[i] + 0, Y[i] + 1 });\n\t\tV.push_back(Point{ X[i] + 1, Y[i] + 0 });\n\t\tV.push_back(Point{ X[i] + 1, Y[i] + 1 });\n\t}\n\tvector<Point> W = Convex(V);\n\tfor (int i = 0; i < W.size(); i++) {\n\t\tPoint v = W[i] - W[(i + W.size() - 1) % W.size()];\n\t\tAngle[i] = atan2(v.py, v.px);\n\t\tif (Angle[i] < 0.0) Angle[i] += 4.0 * TEISUU;\n\t}\n\n\t// Step 3. Brute Force\n\tlong double Answer = 1.0e12;\n\tfor (int i = 0; i < W.size(); i++) {\n\t\tfor (int j = i + 1; j < W.size(); j++) {\n\t\t\tfor (int k = j + 1; k < W.size(); k++) {\n\t\t\t\tfor (int l = k + 1; l < W.size(); l++) {\n\t\t\t\t\tlong double cl = 0.0L - 1.0e-9L, cr = TEISUU + 1.0e-9L;\n\t\t\t\t\tif (i != 0) cl = max(cl, Angle[(i + 0) % W.size()]);\n\t\t\t\t\tcr = min(cr, Angle[(i + 1) % W.size()]);\n\t\t\t\t\tcl = max(cl, Angle[(j + 0) % W.size()] - 1.0 * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(j + 1) % W.size()] - 1.0 * TEISUU);\n\t\t\t\t\tcl = max(cl, Angle[(k + 0) % W.size()] - 2.0 * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(k + 1) % W.size()] - 2.0 * TEISUU);\n\t\t\t\t\tcl = max(cl, Angle[(l + 0) % W.size()] - 3.0 * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(l + 1) % W.size()] - 3.0 * TEISUU);\n\t\t\t\t\tif (cl > cr) continue;\n\t\t\t\t\tlong double ret = Tansaku(W[i], W[j], W[k], W[l], cl, cr);\n\t\t\t\t\tAnswer = min(Answer, ret);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12Lf\\n\", Answer);\n\treturn 0;\n}","accuracy":0.6233766233766234,"time_ms":60,"memory_kb":25316,"score_of_the_acc":-0.6244,"final_rank":19},{"submission_id":"aoj_2804_8322721","code_snippet":"#include <iostream>\n#include <cmath>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct Point {\n\tlong long px, py;\n};\n\nPoint operator-(const Point& a1, const Point& a2) {\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n}\n\nbool operator<(const Point& a1, const Point& a2) {\n\tif (a2.py - a1.py > 0) return true;\n\tif (a1.py - a2.py > 0) return false;\n\tif (a2.px - a1.px > 0) return true;\n\tif (a1.px - a2.px > 0) return false;\n\treturn false;\n}\n\nlong long crs(Point a1, Point a2) {\n\treturn a1.px * a2.py - a2.px * a1.py;\n}\n\nvector<Point> Convex(vector<Point> Poly) {\n\tsort(Poly.begin(), Poly.end());\n\n\t// Right Part\n\tvector<Point> Stack1 = { Poly[0], Poly[1]};\n\tfor (int i = 2; i < Poly.size(); i++) {\n\t\twhile (Stack1.size() >= 2) {\n\t\t\tPoint v1 = Stack1[Stack1.size() - 2];\n\t\t\tPoint v2 = Stack1[Stack1.size() - 1];\n\t\t\tPoint v3 = Poly[i];\n\t\t\tif (crs(v2 - v1, v3 - v2) <= 0) Stack1.pop_back();\n\t\t\telse break;\n\t\t}\n\t\tStack1.push_back(Poly[i]);\n\t}\n\n\t// Left Part\n\tvector<Point> Stack2 = { Poly[0], Poly[1] };\n\tfor (int i = 2; i < Poly.size(); i++) {\n\t\twhile (Stack2.size() >= 2) {\n\t\t\tPoint v1 = Stack2[Stack2.size() - 2];\n\t\t\tPoint v2 = Stack2[Stack2.size() - 1];\n\t\t\tPoint v3 = Poly[i];\n\t\t\tif (crs(v2 - v1, v3 - v2) >= 0) Stack2.pop_back();\n\t\t\telse break;\n\t\t}\n\t\tStack2.push_back(Poly[i]);\n\t}\n\n\t// Joint\n\tvector<Point> Return = Stack1;\n\tfor (int i = (int)Stack2.size() - 2; i >= 1; i--) Return.push_back(Stack2[i]);\n\treturn Return;\n}\n\nconst int dx[4] = { -1, 0, 1, 0 };\nconst int dy[4] = { 0, -1, 0, 1 };\nconst double TEISUU = 3.14159265358979 / 2.0;\nlong long N;\nlong long A[1 << 18], B[1 << 18];\nlong long X[1 << 18], Y[1 << 18];\ndouble Angle[1 << 18];\n\ndouble GetArea(Point p1, Point p2, Point p3, Point p4, double val) {\n\t// Get Yoko1\n\tPoint diff1 = p2 - p1;\n\tdouble dst1 = sqrt(diff1.px * diff1.px + diff1.py * diff1.py);\n\tdouble yoko1 = dst1 * cos(atan2(diff1.py, diff1.px) - val);\n\n\t// Get Yoko2\n\tPoint diff2 = p1 - p4;\n\tdouble dst2 = sqrt(diff2.px * diff2.px + diff2.py * diff2.py);\n\tdouble yoko2 = dst2 * cos(atan2(diff2.py, diff2.px) - val);\n\t\n\t// Get Tate1\n\tdouble tate1 = dst1 * sin(atan2(diff1.py, diff1.px) - val);\n\n\t// Get Tate2\n\tPoint diff3 = p3 - p2;\n\tdouble dst3 = sqrt(diff3.px * diff3.px + diff3.py * diff3.py);\n\tdouble tate2 = dst3 * cos(atan2(diff3.py, diff3.px) - (val + TEISUU));\n\n\t// Return\n\treturn (yoko1 + yoko2) * (tate1 + tate2);\n}\n\ndouble Tansaku(Point p1, Point p2, Point p3, Point p4, double Left, double Rigt) {\n\tdouble cl = Left, cr = Rigt, c1 = 0, c2 = 0, minx = 1e12;\n\tminx = min(minx, GetArea(p1, p2, p3, p4, Left));\n\tminx = min(minx, GetArea(p1, p2, p3, p4, Rigt));\n\tfor (int i = 0; i < 40; i++) {\n\t\tc1 = (cl + cl + cr) / 3.0;\n\t\tc2 = (cl + cr + cr) / 3.0;\n\t\tc2 = Rigt;\n\t\tdouble v1 = GetArea(p1, p2, p3, p4, c1);\n\t\tdouble v2 = GetArea(p1, p2, p3, p4, c2);\n\t\tminx = min(minx, min(v1, v2));\n\t\tif (v1 > v2) { v1 = c1; }\n\t\telse { v2 = c2; }\n\t}\n\treturn minx;\n}\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tfor (int i = 1; i < N; i++) cin >> A[i] >> B[i];\n\tfor (int i = 1; i < N; i++) {\n\t\tX[i] = X[A[i]] + dx[B[i]];\n\t\tY[i] = Y[A[i]] + dy[B[i]];\n\t}\n\n\t// Step 2. Convex\n\tvector<Point> V;\n\tfor (int i = 0; i < N; i++) {\n\t\tV.push_back(Point{ X[i] + 0, Y[i] + 0 });\n\t\tV.push_back(Point{ X[i] + 0, Y[i] + 1 });\n\t\tV.push_back(Point{ X[i] + 1, Y[i] + 0 });\n\t\tV.push_back(Point{ X[i] + 1, Y[i] + 1 });\n\t}\n\tvector<Point> W = Convex(V);\n\tfor (int i = 0; i < W.size(); i++) {\n\t\tPoint v = W[i] - W[(i + W.size() - 1) % W.size()];\n\t\tAngle[i] = atan2(v.py, v.px);\n\t\tif (Angle[i] < 0.0) Angle[i] += 4.0 * TEISUU;\n\t}\n\n\t// Step 3. Brute Force\n\tdouble Answer = 1.0e12;\n\tfor (int i = 0; i < W.size(); i++) {\n\t\tfor (int j = i + 1; j < W.size(); j++) {\n\t\t\tfor (int k = j + 1; k < W.size(); k++) {\n\t\t\t\tfor (int l = k + 1; l < W.size(); l++) {\n\t\t\t\t\tdouble cl = 0 - 1.0e-8, cr = TEISUU + 1.0e-8;\n\t\t\t\t\tif (i != 0) cl = max(cl, Angle[(i + 0) % W.size()]);\n\t\t\t\t\tcr = min(cr, Angle[(i + 1) % W.size()]);\n\t\t\t\t\tcl = max(cl, Angle[(j + 0) % W.size()] - 1.0 * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(j + 1) % W.size()] - 1.0 * TEISUU);\n\t\t\t\t\tcl = max(cl, Angle[(k + 0) % W.size()] - 2.0 * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(k + 1) % W.size()] - 2.0 * TEISUU);\n\t\t\t\t\tcl = max(cl, Angle[(l + 0) % W.size()] - 3.0 * TEISUU);\n\t\t\t\t\tcr = min(cr, Angle[(l + 1) % W.size()] - 3.0 * TEISUU);\n\t\t\t\t\tif (cl > cr) continue;\n\t\t\t\t\tdouble ret = Tansaku(W[i], W[j], W[k], W[l], cl, cr);\n\t\t\t\t\tAnswer = min(Answer, ret);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12lf\\n\", Answer);\n\treturn 0;\n}","accuracy":0.6233766233766234,"time_ms":60,"memory_kb":25252,"score_of_the_acc":-0.622,"final_rank":18},{"submission_id":"aoj_2804_5506764","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 100005\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint p[2];\n};\n\n\nPoint input[SIZE],work[SIZE];\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\nPolygon ConvexHull(Polygon V){\n\n\tsort(V.begin(),V.end());\n\n\tvector<Point> UP,DOWN;\n\n\tUP.push_back(V[0]);\n\tDOWN.push_back(V[0]);\n\n\tfor(int i = 1; i < V.size(); i++){\n\n\t\twhile(UP.size() > 1 && ccw(UP[UP.size()-2],UP[UP.size()-1],V[i]) == COUNTER_CLOCKWISE){\n\n\t\t\tUP.pop_back();\n\t\t}\n\n\t\twhile(DOWN.size() > 1 && ccw(DOWN[DOWN.size()-2],DOWN[DOWN.size()-1],V[i]) == CLOCKWISE){\n\n\t\t\tDOWN.pop_back();\n\t\t}\n\n\t\tUP.push_back(V[i]);\n\t\tDOWN.push_back(V[i]);\n\t}\n\n\tPolygon ret;\n\n\tfor(int i = 0; i < UP.size(); i++){\n\n\t\tret.push_back(UP[i]);\n\t}\n\n\tfor(int i = DOWN.size()-1; i >= 0; i--){ //★indexに注意★\n\n\t\tret.push_back(DOWN[i]);\n\t}\n\n\treturn ret;\n}\n\n\n//点のradを求める関数\ndouble calc_rad(Point p){\n\n\tif(p.y == 0){\n\n\t\tif(p.x > 0){\n\n\t\t\treturn 0;\n\n\t\t}else{ //p.x < 0\n\n\t\t\treturn M_PI;\n\t\t}\n\n\t}else if(p.x == 0){\n\n\t\tif(p.y > 0){\n\n\t\t\treturn M_PI/2.0;\n\t\t}else{\n\n\n\t\t\treturn 3*M_PI/2.0;\n\t\t}\n\n\t}else{\n\n\t\tdouble base = atan(fabs(p.y)/fabs(p.x));\n\n\t\tif(p.x > 0){\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn base;\n\n\t\t\t}else{ //p.y < 0\n\n\t\t\t\treturn 2*M_PI-base;\n\t\t\t}\n\n\t\t}else{ //p.x < 0\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn M_PI-base;\n\n\t\t\t}else{\n\n\t\t\t\treturn base+M_PI;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n/*点moveをbaseを中心にradラジアン回転させる\nrad > 0なら反時計回り、rad < 0なら時計周り\n*/\nPoint rotate(Point base,Point move,double rad){\n\n\tPoint ret;\n\tmove = move-base;\n\n\tret.x = move.x*cos(rad)-move.y*sin(rad);\n\tret.y = move.x*sin(rad)+move.y*cos(rad);\n\n\tret = ret+base;\n\n\treturn ret;\n}\n\ndouble calc_slope(Line A){\n\n\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\n\n\t\treturn 0;\n\n\t}else{\n\n\t\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\n\t}\n}\n\nint main(){\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tif(N == 1){\n\n\t\tprintf(\"1\\n\");\n\t\treturn 0;\n\t}\n\n\tinput[0] = Point(0,0); //左下の点\n\n\tint n,d;\n\n\tfor(int i = 1; i <= N-1; i++){\n\n\t\tscanf(\"%d %d\",&n,&d);\n\n\t\tswitch(d){\n\t\tcase 0: //左\n\n\t\t\tinput[i] = Point(input[n].x-1,input[n].y);\n\t\t\tbreak;\n\n\t\tcase 1: //下\n\n\t\t\tinput[i] = Point(input[n].x,input[n].y-1);\n\n\t\t\tbreak;\n\n\t\tcase 2: //右\n\n\t\t\tinput[i] = Point(input[n].x+1,input[n].y);\n\n\t\t\tbreak;\n\n\t\tcase 3: //上\n\n\t\t\tinput[i] = Point(input[n].x,input[n].y+1);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tvector<Point> vec;\n\tfor(int i = 0; i < N; i++){\n\n\t\tvec.push_back(input[i]);\n\t\tvec.push_back(Point(input[i].x+1,input[i].y));\n\t\tvec.push_back(Point(input[i].x+1,input[i].y+1));\n\t\tvec.push_back(Point(input[i].x,input[i].y+1));\n\t}\n\tsort(vec.begin(),vec.end());\n\tvec.erase(unique(vec.begin(),vec.end()),vec.end());\n\n\tPolygon ret = ConvexHull(vec);\n\tret.pop_back();\n\n\n\tPolygon CH;\n\tCH.push_back(ret[0]);\n\n\tfor(int i = 0; i < ret.size(); i++){\n\t\tif(i+1 < ret.size()){\n\n\t\t\tdouble pre_slope = calc_slope(Line(ret[i-1],ret[i]));\n\t\t\tdouble now_slope = calc_slope(Line(ret[i+1],ret[i]));\n\n\t\t\tif(fabs(pre_slope-now_slope) < EPS){\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tCH.push_back(ret[i]);\n\n\t\t}else{\n\n\t\t\tCH.push_back(ret[i]);\n\t\t}\n\t}\n\tdouble ans = HUGE_NUM;\n\n\tint M = CH.size();\n\n\tint start = -1;\n\tdouble bottom = HUGE_NUM;\n\tfor(int i = 0; i < M; i++){\n\n\t\tif(CH[i].y < bottom){\n\t\t\tbottom = CH[i].y;\n\t\t\tstart = i;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\twork[i] = CH[i];\n\t}\n\n\tbool pre_Hori = false;\n\n\tfor(int a = 0; a < M; a++){\n\n\t\tint i = (start+a)%M;\n\n\t\tdouble tmp_rad = calc_rad(work[(i+1)%M]-work[i]);\n\n\t\tPoint base = work[i];\n\n\t\tif(fabs(tmp_rad-M_PI) < EPS || fabs(tmp_rad) < EPS){ //回転不要\n\n\t\t\tif(pre_Hori){\n\n\t\t\t\tcontinue;\n\t\t\t}else{\n\n\t\t\t\tpre_Hori = true;\n\t\t\t}\n\t\t}else{\n\n\t\t\tpre_Hori = false;\n\t\t}\n\n\t\tfor(int k = 0; k < M; k++){\n\t\t\tif(k == i){\n\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tPoint tmp_p = rotate(base,work[k],-tmp_rad);\n\t\t\twork[k] = tmp_p;\n\t\t}\n\n\t\tdouble min_x = HUGE_NUM,max_x = -HUGE_NUM,min_y = HUGE_NUM,max_y = -HUGE_NUM;\n\n\t\tfor(int k = 0; k < M; k++){\n\n\t\t\tmin_x = min(min_x,work[k].x);\n\t\t\tmax_x = max(max_x,work[k].x);\n\n\t\t\tmin_y = min(min_y,work[k].y);\n\t\t\tmax_y = max(max_y,work[k].y);\n\t\t}\n\n\t\tans = min(ans,(max_x-min_x)*(max_y-min_y));\n\t}\n\n\tprintf(\"%.12lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":27160,"score_of_the_acc":-0.5931,"final_rank":6},{"submission_id":"aoj_2804_5506761","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 100005\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint p[2];\n};\n\n\nPoint input[SIZE],work[SIZE];\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\nPolygon ConvexHull(Polygon V){\n\n\tsort(V.begin(),V.end());\n\n\tvector<Point> UP,DOWN;\n\n\tUP.push_back(V[0]);\n\tDOWN.push_back(V[0]);\n\n\tfor(int i = 1; i < V.size(); i++){\n\n\t\twhile(UP.size() > 1 && ccw(UP[UP.size()-2],UP[UP.size()-1],V[i]) == COUNTER_CLOCKWISE){\n\n\t\t\tUP.pop_back();\n\t\t}\n\n\t\twhile(DOWN.size() > 1 && ccw(DOWN[DOWN.size()-2],DOWN[DOWN.size()-1],V[i]) == CLOCKWISE){\n\n\t\t\tDOWN.pop_back();\n\t\t}\n\n\t\tUP.push_back(V[i]);\n\t\tDOWN.push_back(V[i]);\n\t}\n\n\tPolygon ret;\n\n\tfor(int i = 0; i < UP.size(); i++){\n\n\t\tret.push_back(UP[i]);\n\t}\n\n\tfor(int i = DOWN.size()-1; i >= 0; i--){ //★indexに注意★\n\n\t\tret.push_back(DOWN[i]);\n\t}\n\n\treturn ret;\n}\n\n\n//点のradを求める関数\ndouble calc_rad(Point p){\n\n\tif(p.y == 0){\n\n\t\tif(p.x > 0){\n\n\t\t\treturn 0;\n\n\t\t}else{ //p.x < 0\n\n\t\t\treturn M_PI;\n\t\t}\n\n\t}else if(p.x == 0){\n\n\t\tif(p.y > 0){\n\n\t\t\treturn M_PI/2.0;\n\t\t}else{\n\n\n\t\t\treturn 3*M_PI/2.0;\n\t\t}\n\n\t}else{\n\n\t\tdouble base = atan(fabs(p.y)/fabs(p.x));\n\n\t\tif(p.x > 0){\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn base;\n\n\t\t\t}else{ //p.y < 0\n\n\t\t\t\treturn 2*M_PI-base;\n\t\t\t}\n\n\t\t}else{ //p.x < 0\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn M_PI-base;\n\n\t\t\t}else{\n\n\t\t\t\treturn base+M_PI;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n/*点moveをbaseを中心にradラジアン回転させる\nrad > 0なら反時計回り、rad < 0なら時計周り\n*/\nPoint rotate(Point base,Point move,double rad){\n\n\tPoint ret;\n\tmove = move-base;\n\n\tret.x = move.x*cos(rad)-move.y*sin(rad);\n\tret.y = move.x*sin(rad)+move.y*cos(rad);\n\n\tret = ret+base;\n\n\treturn ret;\n}\n\ndouble calc_slope(Line A){\n\n\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\n\n\t\treturn 0;\n\n\t}else{\n\n\t\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\n\t}\n}\n\nint main(){\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tif(N == 1){\n\n\t\tprintf(\"1\\n\");\n\t\treturn 0;\n\t}\n\n\tinput[0] = Point(0,0); //左下の点\n\n\tint n,d;\n\n\tfor(int i = 1; i <= N-1; i++){\n\n\t\tscanf(\"%d %d\",&n,&d);\n\n\t\tswitch(d){\n\t\tcase 0: //左\n\n\t\t\tinput[i] = Point(input[n].x-1,input[n].y);\n\t\t\tbreak;\n\n\t\tcase 1: //下\n\n\t\t\tinput[i] = Point(input[n].x,input[n].y-1);\n\n\t\t\tbreak;\n\n\t\tcase 2: //右\n\n\t\t\tinput[i] = Point(input[n].x+1,input[n].y);\n\n\t\t\tbreak;\n\n\t\tcase 3: //上\n\n\t\t\tinput[i] = Point(input[n].x,input[n].y+1);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tvector<Point> vec;\n\tfor(int i = 0; i < N; i++){\n\n\t\tvec.push_back(input[i]);\n\t\tvec.push_back(Point(input[i].x+1,input[i].y));\n\t\tvec.push_back(Point(input[i].x+1,input[i].y+1));\n\t\tvec.push_back(Point(input[i].x,input[i].y+1));\n\t}\n\tsort(vec.begin(),vec.end());\n\tvec.erase(unique(vec.begin(),vec.end()),vec.end());\n\n\tPolygon ret = ConvexHull(vec);\n\tret.pop_back();\n\n\n\tPolygon CH;\n\tCH.push_back(ret[0]);\n\n\tfor(int i = 0; i < ret.size(); i++){\n\t\tif(i+1 < ret.size()){\n\n\t\t\tdouble pre_slope = calc_slope(Line(ret[i-1],ret[i]));\n\t\t\tdouble now_slope = calc_slope(Line(ret[i+1],ret[i]));\n\n\t\t\tif(fabs(pre_slope-now_slope) < EPS){\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tCH.push_back(ret[i]);\n\n\t\t}else{\n\n\t\t\tCH.push_back(ret[i]);\n\t\t}\n\t}\n\n\tbool DEBUG = false;\n\tif(DEBUG){\n\n\t\tfor(int i = 0; i < CH.size(); i++){\n\n\t\t\tCH[i].debug();\n\t\t}\n\t}\n\n\tdouble ans = HUGE_NUM;\n\n\tint M = CH.size();\n\n\tint start = -1;\n\tdouble bottom = HUGE_NUM;\n\tfor(int i = 0; i < M; i++){\n\n\t\tif(CH[i].y < bottom){\n\t\t\tbottom = CH[i].y;\n\t\t\tstart = i;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\twork[i] = CH[i];\n\t}\n\n\tbool pre_Hori = false;\n\n\tfor(int a = 0; a < M; a++){\n\n\t\tint i = (start+a)%M;\n\n\t\tif(DEBUG){\n\n\t\t\tprintf(\"\\ni:%d\\n\",i);\n\t\t\tprintf(\"基準点\");\n\t\t\tCH[i].debug();\n\t\t\tprintf(\"次の点\");\n\t\t\tCH[(i+1)%M].debug();\n\t\t}\n\n\t\tdouble tmp_rad = calc_rad(work[(i+1)%M]-work[i]);\n\n\t\tif(DEBUG){\n\n\t\t\tprintf(\"\\ntmp_rad:%.3lf\\n\",tmp_rad);\n\t\t}\n\n\t\tPoint base = work[i];\n\n\t\tif(fabs(tmp_rad-M_PI) < EPS || fabs(tmp_rad) < EPS){ //回転不要\n\n\t\t\tif(pre_Hori){\n\n\t\t\t\tcontinue;\n\t\t\t}else{\n\n\t\t\t\tpre_Hori = true;\n\t\t\t}\n\t\t}else{\n\n\t\t\tpre_Hori = false;\n\t\t}\n\n\t\tfor(int k = 0; k < M; k++){\n\t\t\tif(k == i){\n\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tPoint tmp_p = rotate(base,work[k],-tmp_rad);\n\t\t\twork[k] = tmp_p;\n\t\t}\n\n\t\tif(DEBUG){\n\n\t\t\tprintf(\"work[i]\");\n\t\t\twork[i].debug();\n\n\t\t\tprintf(\"work[i+1]\");\n\t\t\twork[(i+1)%M].debug();\n\t\t}\n\n\t\tdouble min_x = HUGE_NUM,max_x = -HUGE_NUM,min_y = HUGE_NUM,max_y = -HUGE_NUM;\n\n\t\tfor(int k = 0; k < M; k++){\n\n\t\t\tmin_x = min(min_x,work[k].x);\n\t\t\tmax_x = max(max_x,work[k].x);\n\n\t\t\tmin_y = min(min_y,work[k].y);\n\t\t\tmax_y = max(max_y,work[k].y);\n\t\t}\n\n\t\tans = min(ans,(max_x-min_x)*(max_y-min_y));\n\t}\n\n\tprintf(\"%.12lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":27160,"score_of_the_acc":-0.5931,"final_rank":6},{"submission_id":"aoj_2804_5483927","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>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n\n\nstruct Vector {\n\tdouble x, y;\n\tdouble rad() const {\n\t\treturn std::atan2(y, x);\n\t}\n\tdouble cross(const Vector other) const {\n\t\treturn x * other.y - y * other.x;\n\t}\n\tVector rotate90() const {\n\t\treturn Vector{ y, -x };\n\t}\n\tdouble length() const {\n\t\treturn std::sqrt(x * x + y * y);\n\t}\n\tdouble dot(const Vector other) const {\n\t\treturn x * other.x + y * other.y;\n\t}\n\tVector to_len1() const {\n\t\tconst auto len = length();\n\t\treturn Vector{ x / len, y / len };\n\t}\n};\nstruct Point {\n\tint x, y;\n\tVector operator-(const Point other) const {\n\t\treturn Vector{ double(x) - other.x, double(y) - other.y };\n\t}\n\tPoint operator+(const Point other) const {\n\t\treturn Point{ x + other.x, y + other.y };\n\t}\n};\n\ndouble solve(std::vector<Point> point) {\n\tif (point.size() == 1) return 1;\n\tstd::sort(point.begin(), point.end(), [](const Point a, const Point b) {return a.y == b.y ? a.x < b.x : a.y > b.y; });\n\tstd::vector<Point> convex{ point[0], point[1] };\n\tfor (auto i = 2; i < point.size(); ++i) {\n\t\tint last = convex.size() - 1;\n\t\twhile (convex.size() >= 2 && (convex[last] - convex[last - 1]).cross(point[i] - convex[last - 1]) >= 0) {\n\t\t\tconvex.pop_back();\n\t\t\t--last;\n\t\t}\n\t\tconvex.push_back(point[i]);\n\t}\n\tfor (int i = point.size() - 2; i >= 0; --i) {\n\t\tint last = convex.size() - 1;\n\t\twhile (convex.size() >= 2 && (convex[last] - convex[last - 1]).cross(point[i] - convex[last - 1]) >= 0) {\n\t\t\tconvex.pop_back();\n\t\t\t--last;\n\t\t}\n\t\tconvex.push_back(point[i]);\n\t}\n\tconvex.pop_back();\n\tstd::vector<int> indices{ 0, \n\t\t(int)std::distance(convex.begin(), std::max_element(convex.begin(), convex.end(), [](const Point a, const Point b) {return a.x < b.x; })),\n\t\t(int)std::distance(convex.begin(), std::min_element(convex.begin(), convex.end(), [](const Point a, const Point b) {return a.y < b.y; })),\n\t\t(int)std::distance(convex.begin(), std::min_element(std::next(convex.begin()), convex.end(), [](const Point a, const Point b) {return a.x < b.x; })) };\n\tdouble result{ DBL_MAX };\n\tfor (; indices[0] < convex.size(); ++indices[0]) {\n\t\tauto vec = convex[(indices[0] + 1) % convex.size()] - convex[indices[0]];\n\t\tconst auto v = vec.to_len1();\n\t\tfor (auto i = 1; i < 4; ++i) {\n\t\t\tvec = vec.rotate90();\n\t\t\tauto& idx = indices[i];\n\t\t\twhile (vec.cross(convex[(idx + 1) % convex.size()] - convex[idx]) > 0) {\n\t\t\t\tidx = (idx + 1) % convex.size();\n\t\t\t}\n\t\t}\n\t\tconst auto height = (convex[indices[2]] - convex[indices[0]]).dot(v.rotate90());\n\t\tconst auto width = (convex[indices[1]] - convex[indices[3]]).dot(v);\n\t\tconst auto area = height * width;\n\t\tresult = std::min(result, area);\n\t}\n\treturn result;\n}\n\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<Point> point{ Point{0, 0} }; point.reserve(n << 2);\n\tstd::array<Point, 4> dir{ Point{-1, 0}, Point{0, 1}, Point{1, 0}, Point{0, -1} };\n\twhile (point.size() < n) {\n\t\tint x, d; std::cin >> x >> d;\n\t\tpoint.push_back(point[x] + dir[d]);\n\t}\n\tstd::unordered_map<int, std::unordered_set<int>> coordinates;\n\tfor (const auto [x, y] : point) {\n\t\tcoordinates[x].insert(y);\n\t\tcoordinates[x].insert(y + 1);\n\t\tcoordinates[x + 1].insert(y);\n\t\tcoordinates[x + 1].insert(y + 1);\n\t}\n\tpoint.clear();\n\tfor (const auto& [x, ys] : coordinates) {\n\t\tfor (const auto y : ys) {\n\t\t\tpoint.push_back(Point{ x, y });\n\t\t}\n\t}\n\tconst auto result = solve(std::move(point));\n\tstd::cout << std::setprecision(15) << std::fixed << result << '\\n';\n}","accuracy":1,"time_ms":50,"memory_kb":24072,"score_of_the_acc":-0.528,"final_rank":4},{"submission_id":"aoj_2804_5483787","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>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n\n\nstruct Vector {\n\tdouble x, y;\n\tdouble rad() const {\n\t\treturn std::atan2(y, x);\n\t}\n\tdouble cross(const Vector other) const {\n\t\treturn x * other.y - y * other.x;\n\t}\n\tVector rotate90() const {\n\t\treturn Vector{ y, -x };\n\t}\n\tdouble length() const {\n\t\treturn std::sqrt(x * x + y * y);\n\t}\n\tdouble dot(const Vector other) const {\n\t\treturn x * other.x + y * other.y;\n\t}\n\tVector to_len1() const {\n\t\tconst auto len = length();\n\t\treturn Vector{ x / len, y / len };\n\t}\n};\nstruct Point {\n\tint x, y;\n\tVector operator-(const Point other) const {\n\t\treturn Vector{ double(x) - other.x, double(y) - other.y };\n\t}\n\tPoint operator+(const Point other) const {\n\t\treturn Point{ x + other.x, y + other.y };\n\t}\n};\n\ndouble solve(std::vector<Point> point) {\n\tif (point.size() == 1) return 1;\n\tstd::sort(point.begin(), point.end(), [](const Point a, const Point b) {return a.y == b.y ? a.x < b.x : a.y > b.y; });\n\tstd::vector<Point> convex{ point[0], point[1] };\n\tfor (auto i = 2; i < point.size(); ++i) {\n\t\tint last = convex.size() - 1;\n\t\twhile (convex.size() >= 2 && (convex[last] - convex[last - 1]).cross(point[i] - convex[last - 1]) >= 0) {\n\t\t\tconvex.pop_back();\n\t\t\t--last;\n\t\t}\n\t\tconvex.push_back(point[i]);\n\t}\n\tfor (int i = point.size() - 2; i >= 0; --i) {\n\t\tint last = convex.size() - 1;\n\t\twhile (convex.size() >= 2 && (convex[last] - convex[last - 1]).cross(point[i] - convex[last - 1]) >= 0) {\n\t\t\tconvex.pop_back();\n\t\t\t--last;\n\t\t}\n\t\tconvex.push_back(point[i]);\n\t}\n\tstd::vector<int> indices{ 0, \n\t\t(int)std::distance(convex.begin(), std::max_element(convex.begin(), convex.end(), [](const Point a, const Point b) {return a.x < b.x; })),\n\t\t(int)std::distance(convex.begin(), std::min_element(convex.begin(), convex.end(), [](const Point a, const Point b) {return a.y < b.y; })),\n\t\t(int)std::distance(convex.begin(), std::min_element(std::next(convex.begin()), convex.end(), [](const Point a, const Point b) {return a.x < b.x; })) };\n\tdouble result{ DBL_MAX };\n\twhile (indices.back() + 1 < convex.size()) {\n\t\tstd::vector<Vector> vec;\n\t\tfor (const auto idx : indices) {\n\t\t\tvec.push_back(convex[idx + 1] - convex[idx]);\n\t\t\tfor (auto& v : vec) {\n\t\t\t\tv = v.rotate90();\n\t\t\t}\n\t\t}\n\t\tconst auto max = std::distance(vec.begin(), std::max_element(vec.begin(), vec.end(), [](const Vector a, const Vector b) {return a.rad() < b.rad(); }));\n\t\tauto v = vec[max].to_len1();\n\t\tconst auto height = (convex[indices[2]] - convex[indices[0]]).dot(v.rotate90());\n\t\tconst auto width = (convex[indices[1]] - convex[indices[3]]).dot(v);\n\t\tresult = std::min(result, height * width);\n\t\t++indices[max];\n\t}\n\treturn result;\n}\n\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<Point> point{ Point{0, 0} }; point.reserve(n << 2);\n\tstd::array<Point, 4> dir{ Point{-1, 0}, Point{0, 1}, Point{1, 0}, Point{0, -1} };\n\twhile (point.size() < n) {\n\t\tint x, d; std::cin >> x >> d;\n\t\tpoint.push_back(point[x] + dir[d]);\n\t}\n\tstd::unordered_map<int, std::unordered_set<int>> coordinates;\n\tfor (const auto [x, y] : point) {\n\t\tcoordinates[x].insert(y);\n\t\tcoordinates[x].insert(y + 1);\n\t\tcoordinates[x + 1].insert(y);\n\t\tcoordinates[x + 1].insert(y + 1);\n\t}\n\tpoint.clear();\n\tfor (const auto& [x, ys] : coordinates) {\n\t\tfor (const auto y : ys) {\n\t\t\tpoint.push_back(Point{ x, y });\n\t\t}\n\t}\n\tconst auto result = solve(std::move(point));\n\tstd::cout << std::setprecision(15) << std::fixed << result << '\\n';\n}","accuracy":0.6233766233766234,"time_ms":50,"memory_kb":11240,"score_of_the_acc":-0.05,"final_rank":17},{"submission_id":"aoj_2804_4488386","code_snippet":"#include <iostream>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <complex>\n#include <set>\nusing namespace std;\n\nusing W = double;\nusing P = complex<W>;\nusing L = pair<P,P>;\nusing C = pair<P,W>;\nusing Poly = vector<P>;\n#define X real()\n#define Y imag()\nconst W EPS = (1e-10), pi = acos(-1);\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n bool cmp_y(const P &a, const P &b){\n return a.Y != b.Y ? a.Y < b.Y : a.X < b.X;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){ return a.X * b.X + a.Y * b.Y;}\nW cross(P a, P b){ return a.X * b.Y - a.Y * b.X;}\n\nPoly convex_hull(Poly v){\n int n = v.size(), k = 0;\n sort(v.begin(), v.end(), cmp_y);\n Poly r(2*n);\n for(int i = 0; i < n; i++){\n while(k>1 && cross(r[k-1]-r[k-2],v[i]-r[k-2]) < -EPS) k--;\n r[k++] = v[i];\n }\n for(int i = n-2, t = k; i >= 0; i--){\n while(k>t && cross(r[k-1]-r[k-2],v[i]-r[k-2]) < -EPS) k--;\n r[k++] = v[i];\n }\n r.resize(k-1);\n return r;\n}\n\nint main(){\n int N;\n cin >> N;\n int dx[] = {-1,0,1,0}, dy[] = {0,-1,0,1};\n set<P> s;\n\n vector<P> sq = {{0,0},{1,0},{1,1},{0,1}};\n vector<vector<P>> D(N);\n D[0] = sq;\n for(int i = 1; i < N; ++i){\n int n, d;\n cin >> n >> d;\n vector<P> t = D[n];\n for(auto& p : t)\n p = p+P(dx[d],dy[d]);\n D[i] = t;\n }\n for(int i = 0; i < N; ++i){\n for(auto p : D[i])\n s.insert(p);\n }\n\n vector<P> ps;\n for(auto p : s)\n ps.push_back(p);\n vector<P> c = convex_hull(ps);\n\n // for(auto p : c)\n // fprintf(stderr,\"%lld %lld\\n\",p.X,p.Y);\n \n int v = c.size();\n int l = 0, r = 0, b = 0;\n P d = c[1] - c[0];\n P n(-d.Y,d.X);\n while(dot(d,c[(l+1)%v]-c[0]) >= dot(d,c[l]-c[0])){\n ++l;\n l %= v;\n }\n while(dot(d,c[(r+v-1)%v]-c[0]) <= dot(d,c[r]-c[0])){\n r = (r+v-1)%v;\n }\n while(dot(n,c[(b+1)%v]-c[0]) >= dot(n,c[b]-c[0])){\n b += 1;\n b %= v;\n }\n double ans = 1e18;\n for(int i = 0; i < v; ++i){\n d = c[(i+1)%v] - c[i];\n n = {-d.Y,d.X};\n while(dot(d,c[(l+1)%v]-c[i]) >= dot(d,c[l]-c[i])){\n ++l;\n l %= v;\n }\n while(dot(d,c[(r+1)%v]-c[i]) <= dot(d,c[r]-c[i])){\n ++r;\n r %= v;\n }\n while(dot(n,c[(b+1)%v]-c[i]) >= dot(n,c[b]-c[i])){\n ++b;\n b %= v;\n }\n // fprintf(stderr,\"--------------------\\n\");\n // fprintf(stderr,\"top : (%lld,%lld) - (%lld,%lld)\\n\",c[(i+1)%v].X,c[(i+1)%v].Y,c[i].X,c[i].Y);\n // fprintf(stderr,\"left : (%lld,%lld)\\n\",c[l].X,c[l].Y);\n // fprintf(stderr,\"bottom : (%lld,%lld)\\n\",c[b].X,c[b].Y);\n // fprintf(stderr,\"right : (%lld,%lld)\\n\",c[r].X,c[r].Y);\n // fprintf(stderr,\"area : %lld\\n\",dot(n,c[b]-c[i])*(dot(d,c[l]-c[i])-dot(d,c[r]-c[i]))/norm(d));\n // fprintf(stderr,\"--------------------\\n\");\n ans = min(ans,dot(n,c[b]-c[i])*(dot(d,c[l]-c[i])-dot(d,c[r]-c[i]))/norm(d));\n }\n printf(\"%.12f\\n\",ans);\n}","accuracy":1,"time_ms":240,"memory_kb":38084,"score_of_the_acc":-2,"final_rank":14},{"submission_id":"aoj_2804_4488247","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <map>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\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\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nP rotate(const P &p, double rad){\n return p *P(cos(rad), sin(rad));\n}\n\nVP convex(VP v){\n VP ret;\n int n = v.size();\n sort(v.begin(), v.end());\n for(int i=0; i<n; i++){\n while((int)ret.size()>1 && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\n ret.pop_back();\n }\n ret.push_back(v[i]);\n }\n int t = ret.size();\n for(int i=n-2; i>=0; i--){\n while((int)ret.size()>t && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\n ret.pop_back();\n }\n ret.push_back(v[i]);\n }\n if((int)ret.size() > 1) ret.pop_back();\n return ret;\n}\n\ndouble solve(int k, VP v){\n int n = v.size();\n P diff = v[k];\n for(int i=0; i<n; i++){\n v[i] -= diff;\n }\n double rot = arg(v[(k+1)%n] -v[k]);\n for(int i=0; i<n; i++){\n v[i] = rotate(v[i], -rot);\n }\n double xmin=INF,xmax=-INF,ymin=INF,ymax=-INF;\n for(int i=0; i<n; i++){\n xmin = min(xmin, v[i].X);\n xmax = max(xmax, v[i].X);\n ymin = min(ymin, v[i].Y);\n ymax = max(ymax, v[i].Y);\n }\n return (xmax-xmin)*(ymax-ymin);\n}\n\nint main(){\n int n;\n cin >> n;\n VP dir{P(-1,0), P(0,-1), P(1,0), P(0,1)};\n VP v(n);\n v[0] = P(0, 0);\n for(int i=1; i<n; i++){\n int idx,d;\n cin >> idx >> d;\n v[i] = v[idx]+dir[d];\n }\n VP p(4*n);\n VP vdir{P(0,0), P(0,1), P(1,0), P(1,1)};\n for(int i=0; i<n; i++){\n for(int d=0; d<4; d++){\n p[4*i+d] = v[i]+vdir[d];\n }\n }\n p = convex(p);\n\n double ans = INF;\n for(int i=0; i<(int)p.size(); i++){\n ans = min(ans, solve(i, p));\n }\n cout << fixed << setprecision(10);\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":16844,"score_of_the_acc":-0.3588,"final_rank":2},{"submission_id":"aoj_2804_3083325","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\ntypedef complex<double> P;\ntypedef vector<P> VP;\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\n\nVP convex(VP v){\n VP ret;\n int n = v.size();\n sort(v.begin(), v.end());\n for(int i=0; i<n; i++){\n while((int)ret.size()>1 && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\n ret.pop_back();\n }\n ret.push_back(v[i]);\n }\n int t = ret.size();\n for(int i=n-2; i>=0; i--){\n while((int)ret.size()>t && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\n ret.pop_back();\n }\n ret.push_back(v[i]);\n }\n if((int)ret.size() > 1) ret.pop_back();\n return ret;\n}\n\nint dx[4] = {-1, 0, 1, 0};\nint dy[4] = {0, -1, 0, 1};\nint ddx[4] = {0, 0, 1, 1};\nint ddy[4] = {0, 1, 0, 1};\n\nint main(){\n int n;\n cin >> n;\n\n VP tile(n);\n tile[0] = P(0, 0);\n for(int i=1; i<n; i++){\n int n,d;\n cin >> n >> d;\n tile[i] = tile[n] +P(dx[d], dy[d]);\n }\n VP points(4*n);\n for(int i=0; i<n; i++){\n for(int j=0; j<4; j++){\n points[4*i +j] = tile[i] +P(ddx[j], ddy[j]);\n }\n }\n points = convex(points);\n\n int m = points.size();\n double ans = INF;\n for(int i=0; i<m; i++){\n double angle = -arg(points[(i+1)%m] -points[i]);\n P rot(cos(angle), sin(angle));\n double xmin=INF, xmax=-INF, ymin=INF, ymax=-INF; \n for(P p: points){\n p *= rot;\n xmin = min(xmin, p.X);\n xmax = max(xmax, p.X);\n ymin = min(ymin, p.Y);\n ymax = max(ymax, p.Y);\n }\n ans = min(ans, (xmax -xmin) *(ymax -ymin));\n }\n cout << fixed << setprecision(10);\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":16848,"score_of_the_acc":-0.3589,"final_rank":3},{"submission_id":"aoj_2804_2613120","code_snippet":"#include<bits/stdc++.h>\n#define inf 1<<29\n#define linf (1e16)\n#define eps (1e-8)\n#define Eps (1e-15)\n#define mod 1000000007\n#define pi acos(-1.0)\n#define phi (1.0+sqrt(5.0))/2.0\n#define f first\n#define s second\n#define mp make_pair\n#define pb push_back\n#define all(a) (a).begin(),(a).end()\n#define pd(a) printf(\"%.10f\\n\",(double)(a))\n#define pld(a) printf(\"%.10Lf\\n\",(ld)(a))\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\n#define Unique(v) v.erase(unique(all(v)),v.end())\n#define equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\ntypedef long double ld;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef pair<int,double> pid;\ntypedef pair<double,int> pdi;\ntypedef pair<double,double> pdd;\ntypedef vector<int> vi;\ntypedef vector<pii> vpi;\n\nclass Point{\npublic:\n double x,y;\n Point(double x=0,double y=0):x(x),y(y){}\n\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 bool operator<(Point p)const{ \n return equals(x,p.x) ? y-p.y<-eps : x-p.x<-eps; }\n bool operator==(Point p)const{ \n return fabs(x-p.x)<eps && fabs(y-p.y)<eps;}\n\n double abs(){ return sqrt(norm());}\n double norm(){ return (x*x+y*y);}\n};\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nclass Segment{\npublic:\n Point p1,p2;\n Segment(Point p1=Point(),Point p2=Point()):p1(p1),p2(p2){}\n};\ntypedef Segment Line;\n\ndouble norm(Vector a){ return (a.x*a.x+a.y*a.y);}\ndouble abs(Vector a){ return sqrt(norm(a));}\ndouble dot(Vector a,Vector b){ return (a.x*b.x+a.y*b.y);}\ndouble cross(Vector a,Vector b){ return (a.x*b.y-a.y*b.x);}\n\nPoint project(Segment s,Point p){\n Vector base=(s.p2-s.p1);\n double r=(dot(p-s.p1,base)/base.norm());\n return (s.p1+base*r);\n}\n\nint ccw(Point p0,Point p1,Point p2){\n Vector a=p1-p0;\n Vector b=p2-p0;\n if(cross(a,b)>eps)return 1;\n if(cross(a,b)<-eps)return -1;\n if(dot(a,b)<-eps)return 2;\n if(a.norm()<b.norm())return -2;\n return 0;\n}\n\ndouble getDistance(Line l,Point p){\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\n}\n\nPolygon convex_hull(Polygon s){\n Polygon g;\n int n=s.size();\n if(n<3)return s;\n\n sort(s.begin(),s.end());\n\n for(int i=0;i<n;i++){\n for(int n=g.size();n>=2&&ccw(g[n-2],g[n-1],s[i])==1;n--){\n g.pop_back();\n }\n g.push_back(s[i]);\n }\n for(int i=n-2;i>=0;i--){\n for(int n=g.size();n>=2&&ccw(g[n-2],g[n-1],s[i])==1;n--){\n g.pop_back();\n }\n g.push_back(s[i]);\n }\n reverse(g.begin(),g.end());\n g.pop_back();\n return g;\n}\n\ndouble solve(Polygon p){\n double ans = linf;\n sort(all(p));\n Unique(p);\n Polygon P = convex_hull(p);\n FOR(i,0,P.size()){\n Line L(P[i],P[(i+1)%P.size()]);\n double h=0,w1=0,w2=0;\n FOR(j,0,P.size()){\n h = max(h,getDistance(L,P[j]));\n Point c=project(L,P[j]);\n if(ccw(L.p1,L.p2,c)==2)w1=max(w1,abs(L.p1-c));\n else w2=max(w2,abs(L.p1-c));\n }\n ans = min(ans,h*(w1+w2));\n }\n return ans;\n}\n\nint main()\n{\n int N,n,d;\n cin>>N;\n Polygon p(N);\n p[0]=Point(0,0);\n FOR(i,1,N){\n cin>>n>>d;\n if(d==0)p[i]=Point(p[n].x-1,p[n].y);\n else if(d==1)p[i]=Point(p[n].x,p[n].y-1);\n else if(d==2)p[i]=Point(p[n].x+1,p[n].y);\n else p[i]=Point(p[n].x,p[n].y+1);\n }\n FOR(i,0,N){\n p.pb(Point(p[i].x+1,p[i].y));\n p.pb(Point(p[i].x,p[i].y+1));\n p.pb(Point(p[i].x+1,p[i].y+1));\n }\n pd(solve(p));\n return 0;\n}","accuracy":0.6363636363636364,"time_ms":70,"memory_kb":16872,"score_of_the_acc":-0.3598,"final_rank":16},{"submission_id":"aoj_2804_2389142","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\nconst double EPS = 1e-10;\nconst double INF = 1e12;\ntypedef complex<double> P;\ntypedef pair<P,P> L;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n return real(a)!=real(b)?real(a)<real(b):imag(a)<imag(b);\n }\n}\nbool cmp(P a,P b) {return atan2(a.imag(),a.real())<atan2(b.imag(),b.real());}\ndouble cross(const P& a, const P& b) {return imag(conj(a)*b);}\ndouble dot(const P& a, const P& b) {return real(conj(a)*b);}\nint ccw(P a, P b, P c) {\n b-=a;c-=a;\n if(cross(b,c)>EPS)return +1;\n if(cross(b,c)<-EPS)return -1;\n if(dot(b,c)<-EPS)return +2;\n if(norm(b)<norm(c))return -2;\n return 0;\n}\ndouble D(P a, P b) {\n return sqrt((a.real()-b.real())*(a.real()-b.real())+(a.imag()-b.imag())*(a.imag()-b.imag()));\n}\nP rotate(P a, double r) {\n return P(a.real()*cos(r)-a.imag()*sin(r),a.real()*sin(r)+a.imag()*cos(r));\n}\nP projection(const L &l, const P &p) {\n double t = dot(p-l.F, l.F-l.S) / norm(l.F-l.S);\n return l.F + t*(l.F-l.S);\n}\ndouble toRad(double agl) {return agl*M_PI/180.0;}\ndouble distanceLP(const L &l, const P &p) {\n return abs(p - projection(l, p));\n}\nvector<P> convex_hull(vector<P> p) {\n int n = p.size(), k = 0;\n sort(p.begin(), p.end());\n vector<P> q(2*n);\n for(int i = 0; i < n; q[k++] = p[i++])\n while(k >= 2 && ccw(q[k-2], q[k-1], p[i]) <= 0) --k;\n for(int i = n-2, t = k+1; i >= 0; q[k++] = p[i--])\n while(k >= t && ccw(q[k-2], q[k-1], p[i]) <= 0) --k;\n q.resize(k-1);\n return q;\n}\n\nint main() {\n int n;\n cin >> n;\n vector<P> a;\n a.push_back(P(0,0));\n for(int i=0; i<n-1; i++) {\n int x,y;\n cin >> x >> y;\n P p=a[x],q;\n if(y==0) q=P(p.real()-1,p.imag());\n if(y==1) q=P(p.real(),p.imag()-1);\n if(y==2) q=P(p.real()+1,p.imag());\n if(y==3) q=P(p.real(),p.imag()+1);\n a.push_back(q);\n }\n vector<P> v;\n for(int i=0; i<n; i++) {\n for(int j=0; j<2; j++) {\n for(int k=0; k<2; k++) v.push_back(P(a[i].real()+j,a[i].imag()+k));\n }\n }\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n v=convex_hull(v);\n n=v.size();\n double ans=INF;\n for(int i=0; i<n; i++) {\n rotate(v.begin(),v.begin()+1,v.end());\n P q=rotate(v[1]-v[0],toRad(90+EPS))+v[0];\n L s=L(v[0],v[1]);\n L t=L(v[0],q);\n int l=2,r=n;\n while(l+1<r) {\n int m=(l+r)/2;\n if(ccw(q,v[0],v[m])<0) r=m;\n else l=m;\n }\n int k=l;\n l=2,r=k;\n for(int j=0; j<1000; j++) {\n int m1=(l*2+r)/3,m2=(l+r*2)/3;\n double d1=distanceLP(t,v[m1]),d2=distanceLP(t,v[m2]);\n if(d1<d2) l=m1;\n else r=m2;\n }\n l=(l+r)/2;\n double xx=distanceLP(t,v[l]);\n if(abs(ccw(q,v[0],v[k]))==1) k++;\n l=k,r=n;\n for(int j=0; j<1000; j++) {\n int m1=(l*2+r)/3,m2=(l+r*2)/3;\n double d1=distanceLP(t,v[m1]),d2=distanceLP(t,v[m2]);\n if(d1<d2) l=m1;\n else r=m2;\n }\n l=(l+r)/2;\n xx+=distanceLP(t,v[l]);\n l=2,r=n;\n for(int j=0; j<1000; j++) {\n int m1=(l*2+r)/3,m2=(l+r*2)/3;\n double d1=distanceLP(s,v[m1]),d2=distanceLP(s,v[m2]);\n if(d1<d2) l=m1;\n else r=m2;\n }\n l=(l+r)/2;\n double yy=distanceLP(s,v[l]);\n ans=min(ans,xx*yy);\n }\n printf(\"%.10f\\n\",ans);\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":20112,"score_of_the_acc":-0.5305,"final_rank":5},{"submission_id":"aoj_2804_2388508","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__\",\", __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 1120000000\n#define EPS 1e-8\n\n// ???????°???°???????????????\ninline double add(double a, double b){\n if(abs(a+b) < EPS*(abs(a) + abs(b))) return 0;\n return a+b;\n}\n\nstruct Point{\n double x,y;\n Point() {}\n Point(double nx, double ny) : x(nx), y(ny) {}\n inline Point operator + (const Point p){ return Point(add(x, p.x), add(y, p.y)); }\n inline Point operator - (const Point p){ return Point(add(x,-p.x), add(y,-p.y)); }\n inline Point operator * (double d){ return Point(x*d, y*d); }\n inline double dot(const Point p){ return add(x * p.x, y*p.y); } //??????\n inline double det(const Point p){ return add(x * p.y, -y*p.x); } //??????\n inline double dist(const Point p){ return sqrt((x-p.x)*(x-p.x) + (y-p.y)*(y-p.y)); }\n inline bool operator < (const Point p) const {\n if(x != p.x) return x < p.x;\n else return y < p.y;\n }\n inline bool operator == (const Point p) const {\n return (add(x, -p.x)==0) && (add(y, -p.y)==0);\n }\n friend ostream& operator<<(ostream& os, const Point& p) {\n os << \"[\" << p.x << \",\" << p.y << \"]\";\n return os;\n }\n};\n\ndouble norm(Point p) {return p.x*p.x+p.y*p.y;}\nPoint proj(Point a1, Point a2, Point p){\n return a1+(a2-a1) * ( (a2-a1).dot(p-a1)/norm(a2-a1) );\n}\n\nvector<Point> GrahamScan(vector<Point> points){\n int n = points.size();\n sort(all(points));\n int k=0;\n vector<Point> qs(2*n);\n for(int i=0; i<n; qs[k++] = points[i++]){\n while(k>1 && (qs[k-1] - qs[k-2]).det(points[i] - qs[k-1]) <= 0) k--;\n }\n for(int i=n-2,t=k; i>=0; qs[k++] = points[i--]){\n while(k>t && (qs[k-1] -qs[k-2]).det(points[i] - qs[k-1]) <= 0) k--;\n }\n qs.resize(k-1);\n return qs;\n}\n\nint main(){\n int n;\n cin>>n;\n const int dx[] = {-1,0,1,0}, dy[]={0,-1,0,1};\n vector<Point> vec;\n rep(x,2)rep(y,2) vec.pb(Point(x,y));\n rep(i,n-1){\n int p,d;\n cin>>p>>d;\n double bx = vec[p*4].x+dx[d], by = vec[p*4].y+dy[d];\n rep(x,2)rep(y,2) vec.pb(Point(bx+x, by+y));\n }\n\n vec = GrahamScan(vec);\n n = vec.size();\n\n int i=0,j=0,k=0,l=0;\n while(vec[i].y>vec[i+1].y) i = (i+1)%n;\n j = i;\n while(vec[j].x<vec[j+1].x) j = (j+1)%n;\n k = j;\n while(vec[k].y<vec[k+1].y) k = (k+1)%n;\n l = k;\n while(vec[l].x>vec[l+1].x) l = (l+1)%n;\n\n auto area = [&](int a, int b, int c, int d){\n Point p1 = proj(vec[a], vec[(a+1)%n], vec[b]);\n Point p2 = proj(vec[a], vec[(a+1)%n], vec[d]);\n double w = p1.dist(p2);\n Point p3 = proj(vec[a], vec[(a+1)%n], vec[c]);\n double h = vec[c].dist(p3);\n// dbg(a,b,c,d,vec, w*h);\n return w*h;\n };\n//dbg(vec);\n double best = area(i,j,k,l);\n int si=i;\n int cnt = 0;\n while(si != i || cnt<n){\n i = (i+1)%n;\n if(i==j) j = (j+1)%n;\n\n while( (vec[(i+1)%n]-vec[i]).det(vec[(k+1)%n]-vec[k]) >= 0){\n k = (k+1)%n;\n if(k==l) l= (l+1)%n;\n }\n\n while( (vec[(i+1)%n]-vec[i]).dot(vec[j] - vec[(j-1+n)%n]) * (vec[(i+1)%n]-vec[i]).dot(vec[(j+1)%n] - vec[j]) > 0 ) j = (j+1)%n;\n while( (vec[(i+1)%n]-vec[i]).dot(vec[l] - vec[(l-1+n)%n]) * (vec[(i+1)%n]-vec[i]).dot(vec[(l+1)%n] - vec[l]) > 0 ) l = (l+1)%n;\n\n best = min(best, area(i,j,k,l));\n cnt++;\n }\n\n printf(\"%.7f\\n\", best);\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":15372,"score_of_the_acc":-0.3539,"final_rank":1},{"submission_id":"aoj_2804_2241166","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define all(a) (a).begin(),(a).end()\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define pb push_back\n \n \nconst double INF = (1E20);\n#define EPS (1e-10)\nclass P{\npublic:\n double x,y;\n \n P(double _x=0,double _y=0):x(_x),y(_y){};\n P operator - (const P &p ) const { return P(x-p.x,y-p.y);}\n};\n \nstruct S{P p1,p2;};\n \n \ntypedef vector<P> Polygon;\ntypedef P Vector;\n \ndouble abs(P p) {return sqrt(p.x*p.x + p.y*p.y);}\ndouble dot(Vector a, Vector b) {return a.x*b.x+a.y*b.y;}\n \n \ndouble cross(Vector a,Vector b){return a.x*b.y-a.y*b.x;}\n \nbool cmp_x(const P& p,const P& q){\n if(p.x!=q.x)return p.x<q.x;\n return p.y<q.y;\n}\n \nvector<P> convex_hull(vector<P> ps){\n int n = ps.size();\n sort(all(ps),cmp_x);\n int k=0;\n vector<P> qs(n*2);\n rep(i,n){\n while(k>1 && cross((qs[k-1]-qs[k-2]),(ps[i]-qs[k-1]))<=0)k--;\n \n qs[k++] = ps[i];\n }\n for(int i=n-2,t=k;i>=0;i--){\n while(k>t && cross((qs[k-1]-qs[k-2]),(ps[i]-qs[k-1]))<=0 )k--;\n qs[k++]=ps[i];\n }\n qs.resize(k-1);\n return qs;\n}\n \n \nint px[1000005];\nint py[1000005];\n \ndouble getLR(S edge,vector<P> &tpol){\n double l=INF,r=-INF;\n \n rep(i,tpol.size()){\n P cur = tpol[i];\n Vector a,b;\n a = edge.p2 - edge.p1;\n b = cur - edge.p1;\n double tt = dot(a,b);\n tt /= abs(a);\n // cout<< tt <<endl;\n l=min(l,tt);\n r=max(r,tt);\n }\n // cout<<endl;\n return r-l;\n}\n \ndouble getU(S edge,vector<P> &tpol){\n double res=-INF;\n \n rep(i,tpol.size()){\n P cur = tpol[i];\n Vector a,b;\n a = edge.p2 - edge.p1;\n b = cur - edge.p1;\n double tt = cross(a,b);\n tt /= abs(a);\n \n res=max(res, abs(tt ));\n }\n return res;\n}\n \nint main(){\n int n;\n cin>>n;\n \n \n vector<P> points;\n px[0]=py[0]=0;\n \n for(int i=1;i<n;i++){\n int id,dir;\n cin>>id>>dir;\n if(dir==0){\n px[i]=px[id]-1;\n py[i]=py[id];\n }else if(dir==1){\n px[i]=px[id];\n py[i]=py[id]-1;\n }else if(dir==2){\n px[i]=px[id]+1;\n py[i]=py[id];\n }else if(dir==3){\n px[i]=px[id];\n py[i]=py[id]+1;\n }\n }\n set< pair<int,int> > st;\n for(int i=0;i<n;i++){\n for(int dy=0;dy<2;dy++)\n for(int dx=0;dx<2;dx++)\n st.insert( make_pair( px[i]+dx ,py[i]+dy) );\n \n }\n \n for( pair<int,int> sp : st ){\n \n //cout<< sp.first << ' ' <<sp.second <<endl;\n \n points.emplace_back( sp.first , sp.second );\n }\n \n vector<P> tpol = convex_hull(points);\n \n double ans=INF;\n \n rep(i,tpol.size()){\n S edge = S{tpol[i],tpol[(i+1)%tpol.size()]};\n \n double width = getLR(edge,tpol);\n double height = getU(edge,tpol);\n \n// cout<<edge.p1.x<<\" \"<<edge.p1.y<<\" \"<<edge.p2.x<<\" \"<<edge.p2.y<<endl;\n// cout<<width<<\" \"<<height<<endl;\n \n ans=min(ans, width * height );\n }\n printf(\"%.10f\\n\",ans);\n \n}","accuracy":1,"time_ms":110,"memory_kb":25604,"score_of_the_acc":-0.8851,"final_rank":11},{"submission_id":"aoj_2804_2235515","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define EPS (1e-10)\n \nstruct Point {\n double x, y;\n \n Point() {}\n Point (double x, double y) : x(x), y(y) {}\n \n Point operator + (const Point &p) const {\n return Point(x + p.x, y + p.y);\n }\n \n Point operator - (const Point &p) const {\n return Point(x - p.x, y - p.y);\n }\n \n Point operator * (const double &k) const {\n return Point(x * k, y * k);\n }\n \n bool operator < (const Point &p) const {\n return x != p.x ? x < p.x : y < p.y;\n }\n \n bool operator == (const Point &p) const { return (x == p.x && y == p.y); }\n};\n \ndouble dot(const Point &a, const Point &b)\n{\n return a.x * b.x + a.y * b.y;\n}\n \ndouble cross(const Point &a, const Point &b)\n{\n return a.x * b.y - b.x * a.y;\n}\n \ndouble norm(const Point &p)\n{\n return dot(p, p);\n}\n \ndouble abs(const Point &p)\n{\n return sqrt(norm(p));\n}\n \ndouble dist(const Point &a, const Point &b)\n{\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\n \n#define COUNTER_CLOCKWISE +1\n#define CLOCKWISE -1\n#define ONLINE_BACK +2\n#define ONLINE_FRONT -2\n#define ON_SEGMENT +0\ntypedef Point Vector;\n \nint ccw(const Point &p0, const Point &p1, const Point &p2)\n{\n Vector a = p1 - p0;\n Vector b = p2 - p0;\n if (cross(a, b) > EPS) return COUNTER_CLOCKWISE;\n if (cross(a, b) < -EPS) return CLOCKWISE;\n if (dot(a, b) < -EPS) return ONLINE_BACK;\n if (norm(a) < norm(b)) return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n \nbool sortY(Point p1, Point p2)\n{\n if (p1.y != p2.y) {\n return (p1.y - p2.y < -EPS);\n } else { \n return (p1.x - p2.x < -EPS);\n }\n}\n \ntypedef vector<Point> Polygon;\n \nPolygon convex_hull(Polygon &ps)\n{\n int N = ps.size(), j = 0;\n Polygon pg(N * 2);\n sort(ps.begin(), ps.end(), sortY);\n for (int i = 0; i < N; i++) {\n while (j > 1 && cross(pg[j - 1] - pg[j - 2], ps[i] - pg[j - 1]) <= 0) {\n j--;\n }\n pg[j++] = ps[i];\n }\n int k = j;\n for (int i = N - 2; i >= 0; i--) {\n while (j > k && cross(pg[j - 1] - pg[j - 2], ps[i] - pg[j - 1]) <= 0) {\n j--;\n }\n pg[j++] = ps[i];\n }\n pg.resize(j - 1);\n return pg;\n}\n \nvoid insert(set<Point> &points, Point p)\n{\n const int dx[] = {-1, -1, +1, +1};\n const int dy[] = {-1, +1, +1, -1};\n \n for (int i = 0; i < 4; i++) {\n double nx = p.x + dx[i] / 2.0;\n double ny = p.y + dy[i] / 2.0;\n points.insert(Point(nx, ny));\n } \n}\n \nstruct Segment {\n Point s, t;\n Segment () {}\n Segment (Point s, Point t) : s(s), t(t) {}\n};\n \ntypedef Segment Line;\n \nPoint projection(const Segment &s, const Point &p)\n{\n Vector b = s.t - s.s;\n double t = dot(p - s.s, b) / norm(b);\n return s.s + b * t;\n}\n \ndouble distanceLP(const Line &l, const Point &p)\n{\n return abs(p - projection(l, p));\n}\n \nint main()\n{\n int N;\n cin >> N;\n \n set<Point> points;\n insert(points, Point(0, 0));\n \n vector<Point> p(N);\n p[0] = Point(0, 0);\n \n const int dx[] = {-1, +0, +1, +0};\n const int dy[] = {+0, +1, +0, -1};\n \n for (int i = 0; i < N - 1; i++) {\n int n, d;\n cin >> n >> d;\n p[i + 1] = Point(p[n].x + dx[d], p[n].y + dy[d]);\n insert(points, p[i + 1]);\n }\n \n Polygon pg;\n for (auto &point: points) {\n pg.push_back(point);\n }\n pg = convex_hull(pg);\n N = pg.size();\n double res = 1e55; \n for (int i = 0; i < N; i++) {\n int ci = i, ni = (i + 1) % N;\n Line l1(pg[ci], pg[ni]);\n \n int jj = -1;\n double h = 0;\n for (int j = 0; j < N; j++) {\n double d = distanceLP(l1, pg[j]);\n if (d > h) {\n h = d;\n jj = j;\n }\n }\n Point pp = projection(l1, pg[jj]); \n Line l2(pp, pg[jj]);\n \n if (pp == pg[jj]) continue;\n \n jj = -1;\n double w1 = 0;\n for (int j = 0; j < N; j++) {\n double d = distanceLP(l2, pg[j]);\n if (d > w1) {\n w1 = d;\n jj = j;\n }\n }\n Point pp2 = projection(l1, pg[jj]);\n Line l3(pp2, pg[jj]);\n \n if (pp2 == pg[jj]) continue;\n \n double w = 0; \n for (int j = 0; j < N; j++) {\n double d = distanceLP(l3, pg[j]);\n if (d > w) w = d;\n } \n res = min(res, h * w);\n }\n printf(\"%.10f\\n\", res);\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":21088,"score_of_the_acc":-0.8669,"final_rank":10},{"submission_id":"aoj_2804_2235403","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e10+1)\n//#define INF (1LL<<59)\n \n \n#define OUT 0\n#define ON 1\n#define IN 2\n#define EPS (1e-10)\nclass P{ //???\npublic:\n double x,y;\n \n P(double _x=0,double _y=0):x(_x),y(_y){};\n P operator + (const P &p )const{ return P( x+p.x , y+p.y ); } //??????\n P operator - (const P &p )const{ return P( x-p.x , y-p.y ); } //??????\n P operator * (const double k )const{ return P( x*k , y*k ); } //??????\n P operator / (const double k )const{ return P( x/k , y/k ); } //??????\n \n bool operator == (const P &p){ return ( fabs(x-p.x)<EPS && fabs(y-p.y)<EPS ); }\n bool operator < (const P &p) const{ return ( x!=p.x ? x<p.x:y<p.y ); }\n \n double norm(){ return x*x+y*y; } //?????????\n double abs() { return sqrt(norm()); } //???§??????\n void normalize() {double d = sqrt(x*x+y*y); x /= d; y /= d;} //???£??????\n};\nstruct C{P p;double r;}; //???\nstruct S{P p1,p2;}; //??????\ntypedef vector<P> Polygon; //?????§????¢\ntypedef P Vector; //????????????\ntypedef S L; //???´???\n \ndouble norm (P p) { return p.norm(); }\ndouble abs (P p) { return p.abs(); }\ndouble dot (Vector a,Vector b) { return a.x*b.x+a.y*b.y; }\ndouble cross(Vector a,Vector b) { return a.x*b.y-a.y*b.x; }\ndouble sqDist(P a, P b) {return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);}\ndouble dist (P a, P b) {return sqrt(sqDist(a,b));}\nVector vec(S a) {return P(a.p2.x-a.p1.x,a.p2.y-a.p1.y);}\n \n \n//?????? verified AOJ0068,QUPC-G\n//????????????§??????\nbool cmp_x(const P& p, const P& q){\n if(p.x != q.x)return p.x<q.x;\n return p.y<q.y;\n}\n \n//???????????±???????\nvector<P> convex_hull(vector<P> ps){\n int n = ps.size();\n sort(all(ps),cmp_x);\n int k=0; //??????????????????°\n vector<P> qs(n*2); //??§????????????????\n //??????´???????????????\n rep(i,n){\n while( k>1 && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\n qs[k++]=ps[i];\n }\n //??????´???????????????\n for(int i=n-2, t=k;i>=0;i--){\n while( k>t && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\n qs[k++]=ps[i];\n }\n qs.resize(k-1);\n return qs;\n}\n \n \n \ndouble solveLR(vector<P> ps,S l){\n double mini=INF;\n double maxi=-INF;\n \n rep(i,ps.size()){\n double res = dot(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\n mini = min(res,mini);\n maxi = max(res,maxi);\n }\n return maxi-mini;\n}\n \ndouble solveU(vector<P> ps,S l){\n double maxi = -INF;\n rep(i,ps.size()){\n double res = cross(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\n maxi = max(maxi,abs(res));\n }\n return maxi;\n}\n \n \nint main(){\n int n;\n cin>>n;\n \n vector<P> inp(n);\n inp[0] = P(0,0);\n for(int i=1;i<n;i++){\n int a,b;\n cin>>a>>b;\n if(b==0) inp[i] = inp[a]+P(-1,0);\n else if(b==1) inp[i] = inp[a]+P(0,-1);\n else if(b==2) inp[i] = inp[a]+P(+1,0);\n else if(b==3) inp[i] = inp[a]+P(0,+1);\n }\n set<P> ps;\n rep(i,n){\n ps.insert(inp[i]+P(0,0));\n ps.insert(inp[i]+P(1,0));\n ps.insert(inp[i]+P(0,1));\n ps.insert(inp[i]+P(1,1));\n }\n \n vector<P> arg;\n for(auto &elm:ps)arg.pb(elm);\n \n vector<P> points = convex_hull(arg);\n \n double ans = INF;\n \n rep(i,points.size()){\n S line = S{points[i],points[(i+1)%points.size()]};\n \n double LR = solveLR(points,line);\n double U = solveU(points,line);\n// cout<<LR<<\" \"<<U<<endl;\n ans = min( ans , LR*U );\n }\n printf(\"%.10lf\\n\",ans);\n}","accuracy":1,"time_ms":140,"memory_kb":29500,"score_of_the_acc":-1.1802,"final_rank":12},{"submission_id":"aoj_2804_2235395","code_snippet":"#include<bits/stdc++.h>\n \nusing namespace std;\n \n#define eps 1e-8\n \nstruct Point\n{\n double x, y;\n \n Point(double a = 0, double b = 0) :\n x(a), y(b)\n {\n }\n \n bool operator<(const Point& a) const\n {\n if(fabs(x - a.x) > eps) return x < a.x;\n return y < a.y;\n }\n \n bool operator==(const Point& a) const\n {\n return fabs(x - a.x) < eps && fabs(y - a.y) < eps;\n }\n \n Point operator+(const Point& a) const\n {\n return Point(x + a.x, y + a.y);\n }\n \n Point operator-(const Point& a) const\n {\n return Point(x - a.x, y - a.y);\n }\n \n Point operator/(const double val) const\n {\n return Point(x / val, y / val);\n }\n \n Point operator*(const double val) const\n {\n return Point(x * val, y * val);\n }\n};\n \ntypedef Point Vector;\n \ndouble dist(Point a, Point b)\n{\n return hypot(a.x - b.x, a.y - b.y);\n}\n \ndouble dot(Point a, Point b)\n{\n return a.x * b.x + a.y * b.y;\n}\n \ndouble cross2(Point a, Point b)\n{\n return a.x * b.y - a.y * b.x;\n}\n \ndouble cross(Point o, Point a, Point b)\n{\n return (a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x);\n}\n \nint between(Point a, Point b, Point c)\n{\n return dot(c - a, b - a) >= 0 && dot(c - b, a - b) >= 0;\n}\n \nint onSeg(Point a, Point b, Point c)\n{\n return between(a, b, c) && fabs(cross(a, b, c)) < eps;\n}\n \ndouble distProjection(Point as, Point at, Point s)\n{\n double a, b, c;\n a = at.y - as.y;\n b = as.x - at.x;\n c = -(a * as.x + b * as.y);\n return fabs(a * s.x + b * s.y + c) / hypot(a, b);\n}\n \nstruct Seg\n{\n Point s, e;\n};\n \nint calcIntersection(Seg a, Seg b, Point& p)\n{\n double a1, b1, c1, a2, b2, c2;\n double d, dx, dy;\n a1 = a.s.y - a.e.y, b1 = -a.s.x + a.e.x;\n a2 = b.s.y - b.e.y, b2 = -b.s.x + b.e.x;\n c1 = a1 * a.s.x + b1 * a.s.y;\n c2 = a2 * b.s.x + b2 * b.s.y;\n d = a1 * b2 - a2 * b1;\n dx = c1 * b2 - c2 * b1;\n dy = a1 * c2 - a2 * c1;\n if(fabs(d) < eps) // NONE or LINE\n return 0;\n p.x = dx / d, p.y = dy / d;\n return onSeg(a.s, a.e, p) && onSeg(b.s, b.e, p);\n}\n \nint inPolygon(Point p[], int n, Point q)\n{\n int i, j, cnt = 0;\n for(i = 0, j = n - 1; i < n; j = i++) {\n if(p[i].y > q.y != p[j].y > q.y &&\n q.x < (p[j].x - p[i].x) * (q.y - p[i].y) / (p[j].y - p[i].y) + p[i].x)\n cnt++;\n }\n return cnt & 1;\n}\n \ndouble calcArea(Point p[], int n)\n{\n if(n < 3) return 0.0;\n double ret = 0;\n int i;\n p[n] = p[0];\n for(i = 0; i < n; i++)\n ret += p[i].x * p[i + 1].y - p[i].y * p[i + 1].x;\n return fabs(ret) / 2;\n}\n \nint monotone(int n, Point p[], Point ch[])\n{\n sort(p, p + n);\n int i, m = 0, t;\n for(i = 0; i < n; i++) {\n while(m >= 2 && cross(ch[m - 2], ch[m - 1], p[i]) <= 0)\n m--;\n ch[m++] = p[i];\n }\n for(i = n - 1, t = m + 1; i >= 0; i--) {\n while(m >= t && cross(ch[m - 2], ch[m - 1], p[i]) <= 0)\n m--;\n ch[m++] = p[i];\n }\n return m - 1;\n}\n \n#define INF 1e+30\n \ndouble smallRect(int n, Point ch[])\n{\n double lx, ly, rx, ry;\n int up, down, left, right;\n double ret = INF;\n lx = ly = INF;\n rx = ry = -INF;\n \n up = down = left = right = 0;\n for(int i = 0; i < n; i++) {\n if(ch[i].x > rx) rx = ch[i].x, right = i;\n if(ch[i].y > ry) ry = ch[i].y, up = i;\n if(ch[i].x < lx) lx = ch[i].x, left = i;\n if(ch[i].y < ly) ly = ch[i].y, down = i;\n }\n \n int corner[] = {up, down, left, right};\n Point vec[] = {Point(-1, 0), Point(1, 0), Point(0, -1), Point(0, 1)};\n \n ret = (rx - lx) * (ry - ly);\n for(int j = 0; j < 4; j++) {\n while(true) {\n Point a = ch[corner[j]], b = ch[(corner[j] + 1) % n], c = vec[j];\n if(fabs(cross2(b - a, c)) < eps)\n corner[j] = (corner[j] + 1) % n;\n else\n break;\n }\n }\n for(int i = 0; i < n; i++) {\n double mxVal = -INF, cos, sin;\n int mxIdx = 0;\n for(int j = 0; j < 4; j++) {\n Point a = ch[corner[j]], b = ch[(corner[j] + 1) % n], c = vec[j];\n double cosA = dot(b - a, c) / dist(b, a) / dist(c, Point(0, 0));\n if(mxVal < cosA)\n mxVal = cosA, mxIdx = j;\n }\n cos = mxVal, sin = sqrt(1 - cos * cos);\n for(int j = 0; j < 4; j++) {\n double tx, ty;\n tx = vec[j].x * cos - vec[j].y * sin;\n ty = vec[j].x * sin + vec[j].y * cos;\n vec[j] = Point(tx, ty);\n }\n for(int j = 0; j < 4; j++) {\n while(true) {\n Point a = ch[corner[j]], b = ch[(corner[j] + 1) % n], c = vec[j];\n if(fabs(cross2(b - a, c)) < eps)\n corner[j] = (corner[j] + 1) % n;\n else\n break;\n }\n }\n double w = distProjection(ch[corner[0]], ch[corner[0]] + vec[0], ch[corner[1]]);\n double h = distProjection(ch[corner[2]], ch[corner[2]] + vec[2], ch[corner[3]]);\n ret = min(ret, w * h);\n }\n return ret;\n}\n \n \nint xx[100001], yy[100001];\nvector< Point > pp;\nPoint ch[400007], k[400007];\n \nint main()\n{\n int N;\n cin >> N;\n int vy[] = {0, 1, 0, -1}, vx[] = {1, 0, -1, 0};\n xx[0] = 0, yy[0] = 0;\n pp.push_back((Point) {0.0, 0.0});\n pp.push_back((Point) {1.0, 0.0});\n pp.push_back((Point) {0.0, 1.0});\n pp.push_back((Point) {1.0, 1.0});\n \n int tail = 0;\n for(int i = 1; i < N; i++) {\n int n, d;\n cin >> n >> d;\n double x = xx[n] + vx[d];\n double y = yy[n] + vy[d];\n xx[i] = x, yy[i] = y;\n \n pp.push_back((Point) {x, y});\n pp.push_back((Point) {x + 1, y});\n pp.push_back((Point) {x, y + 1});\n pp.push_back((Point) {x + 1, y + 1});\n }\n for(int i = 0; i < pp.size(); i++) {\n k[i] = pp[i];\n }\n int m = monotone(pp.size(), k, ch);\n double ret = smallRect(m, ch);\n printf(\"%.8lf\\n\", ret);\n}","accuracy":1,"time_ms":70,"memory_kb":24216,"score_of_the_acc":-0.6334,"final_rank":8},{"submission_id":"aoj_2804_2015381","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e10+1)\n//#define INF (1LL<<59)\n\n\n#define OUT 0\n#define ON 1\n#define IN 2\n#define EPS (1e-10)\nclass P{ //???\npublic:\n\tdouble x,y;\n\t\n\tP(double _x=0,double _y=0):x(_x),y(_y){};\n\tP operator + (const P &p )const{ return P( x+p.x , y+p.y ); } //??????\n\tP operator - (const P &p )const{ return P( x-p.x , y-p.y ); } //??????\n\tP operator * (const double k )const{ return P( x*k , y*k ); } //??????\n\tP operator / (const double k )const{ return P( x/k , y/k ); } //??????\n\t\n\tbool operator == (const P &p){ return ( fabs(x-p.x)<EPS && fabs(y-p.y)<EPS ); }\n\tbool operator < (const P &p) const{ return ( x!=p.x ? x<p.x:y<p.y ); }\n\t\n\tdouble norm(){ return x*x+y*y; } //?????????\n\tdouble abs() { return sqrt(norm()); } //??§??????\n\tvoid normalize() {double d = sqrt(x*x+y*y); x /= d; y /= d;}\t//??£??????\n};\nstruct C{P p;double r;}; //???\nstruct S{P p1,p2;}; //??????\ntypedef vector<P> Polygon; //????§???¢\ntypedef P Vector; //????????????\ntypedef S L; //??´???\n\ndouble norm (P p) { return p.norm(); }\ndouble abs (P p) { return p.abs(); }\ndouble dot (Vector a,Vector b) { return a.x*b.x+a.y*b.y; }\ndouble cross(Vector a,Vector b) { return a.x*b.y-a.y*b.x; }\ndouble sqDist(P a, P b) {return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);}\ndouble dist (P a, P b) {return sqrt(sqDist(a,b));}\nVector vec(S a) {return P(a.p2.x-a.p1.x,a.p2.y-a.p1.y);}\n\n\n//?????? verified AOJ0068,QUPC-G\n//???????????§??????\nbool cmp_x(const P& p, const P& q){\n\tif(p.x != q.x)return p.x<q.x;\n\treturn p.y<q.y;\n}\n\n//??????????±???????\nvector<P> convex_hull(vector<P> ps){\n\tint n = ps.size();\n\tsort(all(ps),cmp_x);\n\tint k=0; //?????????????????°\n\tvector<P> qs(n*2); //?§????????????????\n\t//?????´???????????????\n\trep(i,n){\n\t\twhile( k>1 && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\n\t\tqs[k++]=ps[i];\n\t}\n\t//?????´???????????????\n\tfor(int i=n-2, t=k;i>=0;i--){\n\t\twhile( k>t && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\n\t\tqs[k++]=ps[i];\n\t}\n\tqs.resize(k-1);\n\treturn qs;\n}\n\n\n\ndouble solveLR(vector<P> ps,S l){\n\tdouble mini=INF;\n\tdouble maxi=-INF;\n\t\n\trep(i,ps.size()){\n\t\tdouble res = dot(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\n\t\tmini = min(res,mini);\n\t\tmaxi = max(res,maxi);\n\t}\n\treturn maxi-mini;\n}\n\ndouble solveU(vector<P> ps,S l){\n\tdouble maxi = -INF;\n\trep(i,ps.size()){\n\t\tdouble res = cross(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\n\t\tmaxi = max(maxi,abs(res));\n\t}\n\treturn maxi;\n}\n\n\nint main(){\n\tint n;\n\tcin>>n;\n\t\n\tvector<P> inp(n);\n\tinp[0] = P(0,0);\n\tfor(int i=1;i<n;i++){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\tif(b==0)\t\tinp[i] = inp[a]+P(-1,0);\n\t\telse if(b==1)\tinp[i] = inp[a]+P(0,-1);\n\t\telse if(b==2)\tinp[i] = inp[a]+P(+1,0);\n\t\telse if(b==3)\tinp[i] = inp[a]+P(0,+1);\n\t}\n\tset<P> ps;\n\trep(i,n){\n\t\tps.insert(inp[i]+P(0,0));\n\t\tps.insert(inp[i]+P(1,0));\n\t\tps.insert(inp[i]+P(0,1));\n\t\tps.insert(inp[i]+P(1,1));\n\t}\n\t\n\tvector<P> arg;\n\tfor(auto &elm:ps)arg.pb(elm);\n\t\n\tvector<P> points = convex_hull(arg);\n\t\n\tdouble ans = INF;\n\t\n\trep(i,points.size()){\n\t\tS line = S{points[i],points[(i+1)%points.size()]};\n\t\t\n\t\tdouble LR = solveLR(points,line);\n\t\tdouble U = solveU(points,line);\n//\t\tcout<<LR<<\" \"<<U<<endl;\n\t\tans = min( ans , LR*U );\n\t}\n\tprintf(\"%.10lf\\n\",ans);\n}","accuracy":1,"time_ms":140,"memory_kb":29504,"score_of_the_acc":-1.1804,"final_rank":13},{"submission_id":"aoj_2804_2015374","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n\n\n#define OUT 0\n#define ON 1\n#define IN 2\n#define EPS (1e-10)\nclass P{ //???\npublic:\n\tdouble x,y;\n\t\n\tP(double _x=0,double _y=0):x(_x),y(_y){};\n\tP operator + (const P &p )const{ return P( x+p.x , y+p.y ); } //??????\n\tP operator - (const P &p )const{ return P( x-p.x , y-p.y ); } //??????\n\tP operator * (const double k )const{ return P( x*k , y*k ); } //??????\n\tP operator / (const double k )const{ return P( x/k , y/k ); } //??????\n\t\n\tbool operator == (const P &p){ return ( fabs(x-p.x)<EPS && fabs(y-p.y)<EPS ); }\n\tbool operator < (const P &p) const{ return ( x!=p.x ? x<p.x:y<p.y ); }\n\t\n\tdouble norm(){ return x*x+y*y; } //?????????\n\tdouble abs() { return sqrt(norm()); } //??§??????\n\tvoid normalize() {double d = sqrt(x*x+y*y); x /= d; y /= d;}\t//??£??????\n};\nstruct C{P p;double r;}; //???\nstruct S{P p1,p2;}; //??????\ntypedef vector<P> Polygon; //????§???¢\ntypedef P Vector; //????????????\ntypedef S L; //??´???\n\ndouble norm (P p) { return p.norm(); }\ndouble abs (P p) { return p.abs(); }\ndouble dot (Vector a,Vector b) { return a.x*b.x+a.y*b.y; }\ndouble cross(Vector a,Vector b) { return a.x*b.y-a.y*b.x; }\ndouble sqDist(P a, P b) {return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);}\ndouble dist (P a, P b) {return sqrt(sqDist(a,b));}\nVector vec(S a) {return P(a.p2.x-a.p1.x,a.p2.y-a.p1.y);}\n\n\n//?????? verified AOJ0068,QUPC-G\n//???????????§??????\nbool cmp_x(const P& p, const P& q){\n\tif(p.x != q.x)return p.x<q.x;\n\treturn p.y<q.y;\n}\n\n//??????????±???????\nvector<P> convex_hull(vector<P> ps){\n\tint n = ps.size();\n\tsort(all(ps),cmp_x);\n\tint k=0; //?????????????????°\n\tvector<P> qs(n*2); //?§????????????????\n\t//?????´???????????????\n\trep(i,n){\n\t\twhile( k>1 && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\n\t\tqs[k++]=ps[i];\n\t}\n\t//?????´???????????????\n\tfor(int i=n-2, t=k;i>=0;i--){\n\t\twhile( k>t && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\n\t\tqs[k++]=ps[i];\n\t}\n\tqs.resize(k-1);\n\treturn qs;\n}\n\n\n\ndouble solveLR(vector<P> ps,S l){\n\tdouble mini=INF;\n\tdouble maxi=-INF;\n\t\n\trep(i,ps.size()){\n\t\tdouble res = dot(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\n\t\tmini = min(res,mini);\n\t\tmaxi = max(res,maxi);\n\t}\n\treturn maxi-mini;\n}\n\ndouble solveU(vector<P> ps,S l){\n\tdouble maxi = -INF;\n\trep(i,ps.size()){\n\t\tdouble res = cross(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\n\t\tmaxi = max(maxi,abs(res));\n\t}\n\treturn maxi;\n}\n\n\nint main(){\n\tint n;\n\tcin>>n;\n\t\n\tvector<P> inp(n);\n\tinp[0] = P(0,0);\n\tfor(int i=1;i<n;i++){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\tif(b==0)\t\tinp[i] = inp[a]+P(-1,0);\n\t\telse if(b==1)\tinp[i] = inp[a]+P(0,-1);\n\t\telse if(b==2)\tinp[i] = inp[a]+P(+1,0);\n\t\telse if(b==3)\tinp[i] = inp[a]+P(0,+1);\n\t}\n\tset<P> ps;\n\trep(i,n){\n\t\tps.insert(inp[i]+P(0,0));\n\t\tps.insert(inp[i]+P(1,0));\n\t\tps.insert(inp[i]+P(0,1));\n\t\tps.insert(inp[i]+P(1,1));\n\t}\n\t\n\tvector<P> arg;\n\tfor(auto &elm:ps)arg.pb(elm);\n\t\n\tvector<P> points = convex_hull(arg);\n\t\n\tdouble ans = INF;\n\t\n\trep(i,points.size()){\n\t\tS line = S{points[i],points[(i+1)%points.size()]};\n\t\t\n\t\tdouble LR = solveLR(points,line);\n\t\tdouble U = solveU(points,line);\n//\t\tcout<<LR<<\" \"<<U<<endl;\n\t\tans = min( ans , LR*U );\n\t}\n\tprintf(\"%.10lf\\n\",ans);\n}","accuracy":0.7532467532467533,"time_ms":130,"memory_kb":29504,"score_of_the_acc":-1.1304,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_2804_8322784\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct Point {\\n\\tlong long px, py;\\n};\\n\\nPoint operator-(const Point& a1, const Point& a2) {\\n\\treturn Point{ a1.px - a2.px, a1.py - a2.py };\\n}\\n\\nbool operator<(const Point& a1, const Point& a2) {\\n\\tif (a2.py - a1.py > 0) return true;\\n\\tif (a1.py - a2.py > 0) return false;\\n\\tif (a2.px - a1.px > 0) return true;\\n\\tif (a1.px - a2.px > 0) return false;\\n\\treturn false;\\n}\\n\\nlong long crs(Point a1, Point a2) {\\n\\treturn a1.px * a2.py - a2.px * a1.py;\\n}\\n\\nvector<Point> Convex(vector<Point> Poly) {\\n\\tsort(Poly.begin(), Poly.end());\\n\\n\\t// Right Part\\n\\tvector<Point> Stack1 = { Poly[0], Poly[1] };\\n\\tfor (int i = 2; i < Poly.size(); i++) {\\n\\t\\twhile (Stack1.size() >= 2) {\\n\\t\\t\\tPoint v1 = Stack1[Stack1.size() - 2];\\n\\t\\t\\tPoint v2 = Stack1[Stack1.size() - 1];\\n\\t\\t\\tPoint v3 = Poly[i];\\n\\t\\t\\tif (crs(v2 - v1, v3 - v2) <= 0) Stack1.pop_back();\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tStack1.push_back(Poly[i]);\\n\\t}\\n\\n\\t// Left Part\\n\\tvector<Point> Stack2 = { Poly[0], Poly[1] };\\n\\tfor (int i = 2; i < Poly.size(); i++) {\\n\\t\\twhile (Stack2.size() >= 2) {\\n\\t\\t\\tPoint v1 = Stack2[Stack2.size() - 2];\\n\\t\\t\\tPoint v2 = Stack2[Stack2.size() - 1];\\n\\t\\t\\tPoint v3 = Poly[i];\\n\\t\\t\\tif (crs(v2 - v1, v3 - v2) >= 0) Stack2.pop_back();\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tStack2.push_back(Poly[i]);\\n\\t}\\n\\n\\t// Joint\\n\\tvector<Point> Return = Stack1;\\n\\tfor (int i = (int)Stack2.size() - 2; i >= 1; i--) Return.push_back(Stack2[i]);\\n\\treturn Return;\\n}\\n\\nconst int dx[4] = { -1, 0, 1, 0 };\\nconst int dy[4] = { 0, -1, 0, 1 };\\nconst long double TEISUU = 3.14159265358979L / 2.0L;\\nlong long N;\\nlong long A[1 << 18], B[1 << 18];\\nlong long X[1 << 18], Y[1 << 18];\\nlong double Angle[1 << 18];\\n\\nlong double GetArea(Point p1, Point p2, Point p3, Point p4, long double val) {\\n\\t// Get Yoko1\\n\\tPoint diff1 = p2 - p1;\\n\\tlong double dst1 = sqrtl(1.0L * diff1.px * diff1.px + 1.0L * diff1.py * diff1.py);\\n\\tlong double yoko1 = dst1 * cos(atan2l(diff1.py, diff1.px) - val);\\n\\n\\t// Get Yoko2\\n\\tPoint diff2 = p1 - p4;\\n\\tlong double dst2 = sqrtl(1.0L * diff2.px * diff2.px + 1.0L * diff2.py * diff2.py);\\n\\tlong double yoko2 = dst2 * cos(atan2l(diff2.py, diff2.px) - val);\\n\\n\\t// Get Tate1\\n\\tlong double tate1 = dst1 * sin(atan2l(diff1.py, diff1.px) - val);\\n\\n\\t// Get Tate2\\n\\tPoint diff3 = p3 - p2;\\n\\tlong double dst3 = sqrt(1.0L * diff3.px * diff3.px + 1.0L * diff3.py * diff3.py);\\n\\tlong double tate2 = dst3 * cos(atan2l(diff3.py, diff3.px) - (val + TEISUU));\\n\\n\\t// Return\\n\\treturn (yoko1 + yoko2) * (tate1 + tate2);\\n}\\n\\nlong double Tansaku(Point p1, Point p2, Point p3, Point p4, double Left, long double Rigt) {\\n\\tlong double cl = Left, cr = Rigt, c1 = 0, c2 = 0, minx = 1.0e12L;\\n\\tminx = min(minx, GetArea(p1, p2, p3, p4, Left));\\n\\tminx = min(minx, GetArea(p1, p2, p3, p4, Rigt));\\n\\tfor (int i = 0; i < 40; i++) {\\n\\t\\tc1 = (cl + cl + cr) / 3.0L;\\n\\t\\tc2 = (cl + cr + cr) / 3.0L;\\n\\t\\tc2 = Rigt;\\n\\t\\tlong double v1 = GetArea(p1, p2, p3, p4, c1);\\n\\t\\tlong double v2 = GetArea(p1, p2, p3, p4, c2);\\n\\t\\tminx = min(minx, min(v1, v2));\\n\\t\\tif (v1 > v2) { v1 = c1; }\\n\\t\\telse { v2 = c2; }\\n\\t}\\n\\treturn minx;\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tfor (int i = 1; i < N; i++) cin >> A[i] >> B[i];\\n\\t// for (int i = 1; i < N; i++) { A[i] = max(0, i - 4); B[i] = (i - 1) % 4; }\\n\\tfor (int i = 1; i < N; i++) {\\n\\t\\tX[i] = X[A[i]] + dx[B[i]];\\n\\t\\tY[i] = Y[A[i]] + dy[B[i]];\\n\\t}\\n\\n\\t// Step 2. Convex\\n\\tvector<Point> V;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tV.push_back(Point{ X[i] + 0, Y[i] + 0 });\\n\\t\\tV.push_back(Point{ X[i] + 0, Y[i] + 1 });\\n\\t\\tV.push_back(Point{ X[i] + 1, Y[i] + 0 });\\n\\t\\tV.push_back(Point{ X[i] + 1, Y[i] + 1 });\\n\\t}\\n\\tvector<Point> W = Convex(V);\\n\\tfor (int i = 0; i < W.size(); i++) {\\n\\t\\tPoint v = W[i] - W[(i + W.size() - 1) % W.size()];\\n\\t\\tAngle[i] = atan2(v.py, v.px);\\n\\t\\tif (Angle[i] < 0.0L) Angle[i] += 4.0L * TEISUU;\\n\\t}\\n\\n\\t// Step 3. Brute Force\\n\\tlong double Answer = 1.0e12;\\n\\tfor (int i = 0; i <= W.size(); i++) {\\n\\t\\tfor (int j = i + 1; j <= W.size(); j++) {\\n\\t\\t\\tfor (int k = j + 1; k <= W.size(); k++) {\\n\\t\\t\\t\\tfor (int l = k + 1; l <= W.size(); l++) {\\n\\t\\t\\t\\t\\tlong double cl = 0.0L - 1.0e-9L, cr = TEISUU + 1.0e-9L;\\n\\t\\t\\t\\t\\tif (i != 0) cl = max(cl, Angle[(i + 0) % W.size()]);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(i + 1) % W.size()]);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(j + 0) % W.size()] - 1.0L * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(j + 1) % W.size()] - 1.0L * TEISUU);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(k + 0) % W.size()] - 2.0L * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(k + 1) % W.size()] - 2.0L * TEISUU);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(l + 0) % W.size()] - 3.0L * TEISUU);\\n\\t\\t\\t\\t\\tif (l != W.size()) cr = min(cr, Angle[(l + 1) % W.size()] - 3.0L * TEISUU);\\n\\t\\t\\t\\t\\tif (cl > cr) continue;\\n\\t\\t\\t\\t\\tlong double ret = Tansaku(W[i], W[j], W[k], W[l % W.size()], cl, cr);\\n\\t\\t\\t\\t\\tAnswer = min(Answer, ret);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12Lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 25708,\n \"score_of_the_acc\": -0.639,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2804_8322734\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct Point {\\n\\tlong long px, py;\\n};\\n\\nPoint operator-(const Point& a1, const Point& a2) {\\n\\treturn Point{ a1.px - a2.px, a1.py - a2.py };\\n}\\n\\nbool operator<(const Point& a1, const Point& a2) {\\n\\tif (a2.py - a1.py > 0) return true;\\n\\tif (a1.py - a2.py > 0) return false;\\n\\tif (a2.px - a1.px > 0) return true;\\n\\tif (a1.px - a2.px > 0) return false;\\n\\treturn false;\\n}\\n\\nlong long crs(Point a1, Point a2) {\\n\\treturn a1.px * a2.py - a2.px * a1.py;\\n}\\n\\nvector<Point> Convex(vector<Point> Poly) {\\n\\tsort(Poly.begin(), Poly.end());\\n\\n\\t// Right Part\\n\\tvector<Point> Stack1 = { Poly[0], Poly[1] };\\n\\tfor (int i = 2; i < Poly.size(); i++) {\\n\\t\\twhile (Stack1.size() >= 2) {\\n\\t\\t\\tPoint v1 = Stack1[Stack1.size() - 2];\\n\\t\\t\\tPoint v2 = Stack1[Stack1.size() - 1];\\n\\t\\t\\tPoint v3 = Poly[i];\\n\\t\\t\\tif (crs(v2 - v1, v3 - v2) <= 0) Stack1.pop_back();\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tStack1.push_back(Poly[i]);\\n\\t}\\n\\n\\t// Left Part\\n\\tvector<Point> Stack2 = { Poly[0], Poly[1] };\\n\\tfor (int i = 2; i < Poly.size(); i++) {\\n\\t\\twhile (Stack2.size() >= 2) {\\n\\t\\t\\tPoint v1 = Stack2[Stack2.size() - 2];\\n\\t\\t\\tPoint v2 = Stack2[Stack2.size() - 1];\\n\\t\\t\\tPoint v3 = Poly[i];\\n\\t\\t\\tif (crs(v2 - v1, v3 - v2) >= 0) Stack2.pop_back();\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tStack2.push_back(Poly[i]);\\n\\t}\\n\\n\\t// Joint\\n\\tvector<Point> Return = Stack1;\\n\\tfor (int i = (int)Stack2.size() - 2; i >= 1; i--) Return.push_back(Stack2[i]);\\n\\treturn Return;\\n}\\n\\nconst int dx[4] = { -1, 0, 1, 0 };\\nconst int dy[4] = { 0, -1, 0, 1 };\\nconst long double TEISUU = 3.14159265358979L / 2.0L;\\nlong long N;\\nlong long A[1 << 18], B[1 << 18];\\nlong long X[1 << 18], Y[1 << 18];\\nlong double Angle[1 << 18];\\n\\nlong double GetArea(Point p1, Point p2, Point p3, Point p4, long double val) {\\n\\t// Get Yoko1\\n\\tPoint diff1 = p2 - p1;\\n\\tlong double dst1 = sqrtl(1.0L * diff1.px * diff1.px + 1.0L * diff1.py * diff1.py);\\n\\tlong double yoko1 = dst1 * cos(atan2l(diff1.py, diff1.px) - val);\\n\\n\\t// Get Yoko2\\n\\tPoint diff2 = p1 - p4;\\n\\tlong double dst2 = sqrtl(1.0L * diff2.px * diff2.px + 1.0L * diff2.py * diff2.py);\\n\\tlong double yoko2 = dst2 * cos(atan2l(diff2.py, diff2.px) - val);\\n\\n\\t// Get Tate1\\n\\tlong double tate1 = dst1 * sin(atan2l(diff1.py, diff1.px) - val);\\n\\n\\t// Get Tate2\\n\\tPoint diff3 = p3 - p2;\\n\\tlong double dst3 = sqrt(1.0L * diff3.px * diff3.px + 1.0L * diff3.py * diff3.py);\\n\\tlong double tate2 = dst3 * cos(atan2l(diff3.py, diff3.px) - (val + TEISUU));\\n\\n\\t// Return\\n\\treturn (yoko1 + yoko2) * (tate1 + tate2);\\n}\\n\\nlong double Tansaku(Point p1, Point p2, Point p3, Point p4, long double Left, long double Rigt) {\\n\\tlong double minx = 1.0e12L;\\n\\tminx = min(minx, GetArea(p1, p2, p3, p4, Left));\\n\\tminx = min(minx, GetArea(p1, p2, p3, p4, Rigt));\\n\\tfor (int t = 0; t < 10; t++) {\\n\\t\\tlong double cl = 0.1L * (10 - t) * Left + 0.1L * (t + 0) * Rigt;\\n\\t\\tlong double cr = 0.1L * ( 9 - t) * Left + 0.1L * (t + 1) * Rigt;\\n\\t\\tlong double c1 = 0, c2 = 0;\\n\\t\\tfor (int i = 0; i < 80; i++) {\\n\\t\\t\\tc1 = (cl + cl + cr) / 3.0L;\\n\\t\\t\\tc2 = (cl + cr + cr) / 3.0L;\\n\\t\\t\\tc2 = Rigt;\\n\\t\\t\\tlong double v1 = GetArea(p1, p2, p3, p4, c1);\\n\\t\\t\\tlong double v2 = GetArea(p1, p2, p3, p4, c2);\\n\\t\\t\\tminx = min(minx, min(v1, v2));\\n\\t\\t\\tif (v1 > v2) { v1 = c1; }\\n\\t\\t\\telse { v2 = c2; }\\n\\t\\t}\\n\\t}\\n\\treturn minx;\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tfor (int i = 1; i < N; i++) cin >> A[i] >> B[i];\\n\\t// for (int i = 1; i < (N + 1) / 2; i++) { A[i] = i - 1; B[i] = 0; }\\n\\t// for (int i = (N + 1) / 2; i < N; i++) { A[i] = i - 1; B[i] = 1; }\\n\\tfor (int i = 1; i < N; i++) {\\n\\t\\tX[i] = X[A[i]] + dx[B[i]];\\n\\t\\tY[i] = Y[A[i]] + dy[B[i]];\\n\\t}\\n\\n\\t// Step 2. Convex\\n\\tvector<Point> V;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tV.push_back(Point{ X[i] + 0, Y[i] + 0 });\\n\\t\\tV.push_back(Point{ X[i] + 0, Y[i] + 1 });\\n\\t\\tV.push_back(Point{ X[i] + 1, Y[i] + 0 });\\n\\t\\tV.push_back(Point{ X[i] + 1, Y[i] + 1 });\\n\\t}\\n\\tvector<Point> W = Convex(V);\\n\\tfor (int i = 0; i < W.size(); i++) {\\n\\t\\tPoint v = W[i] - W[(i + W.size() - 1) % W.size()];\\n\\t\\tAngle[i] = atan2(v.py, v.px);\\n\\t\\tif (Angle[i] < 0.0) Angle[i] += 4.0 * TEISUU;\\n\\t}\\n\\n\\t// Step 3. Brute Force\\n\\tlong double Answer = 1.0e12;\\n\\tfor (int i = 0; i < W.size(); i++) {\\n\\t\\tfor (int j = i + 1; j < W.size(); j++) {\\n\\t\\t\\tfor (int k = j + 1; k < W.size(); k++) {\\n\\t\\t\\t\\tfor (int l = k + 1; l < W.size(); l++) {\\n\\t\\t\\t\\t\\tlong double cl = 0.0L - 1.0e-9L, cr = TEISUU + 1.0e-9L;\\n\\t\\t\\t\\t\\tif (i != 0) cl = max(cl, Angle[(i + 0) % W.size()]);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(i + 1) % W.size()]);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(j + 0) % W.size()] - 1.0 * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(j + 1) % W.size()] - 1.0 * TEISUU);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(k + 0) % W.size()] - 2.0 * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(k + 1) % W.size()] - 2.0 * TEISUU);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(l + 0) % W.size()] - 3.0 * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(l + 1) % W.size()] - 3.0 * TEISUU);\\n\\t\\t\\t\\t\\tif (cl > cr) continue;\\n\\t\\t\\t\\t\\tlong double ret = Tansaku(W[i], W[j], W[k], W[l], cl, cr);\\n\\t\\t\\t\\t\\tAnswer = min(Answer, ret);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12Lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6233766233766234,\n \"time_ms\": 90,\n \"memory_kb\": 25088,\n \"score_of_the_acc\": -0.7659,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2804_8322725\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct Point {\\n\\tlong long px, py;\\n};\\n\\nPoint operator-(const Point& a1, const Point& a2) {\\n\\treturn Point{ a1.px - a2.px, a1.py - a2.py };\\n}\\n\\nbool operator<(const Point& a1, const Point& a2) {\\n\\tif (a2.py - a1.py > 0) return true;\\n\\tif (a1.py - a2.py > 0) return false;\\n\\tif (a2.px - a1.px > 0) return true;\\n\\tif (a1.px - a2.px > 0) return false;\\n\\treturn false;\\n}\\n\\nlong long crs(Point a1, Point a2) {\\n\\treturn a1.px * a2.py - a2.px * a1.py;\\n}\\n\\nvector<Point> Convex(vector<Point> Poly) {\\n\\tsort(Poly.begin(), Poly.end());\\n\\n\\t// Right Part\\n\\tvector<Point> Stack1 = { Poly[0], Poly[1]};\\n\\tfor (int i = 2; i < Poly.size(); i++) {\\n\\t\\twhile (Stack1.size() >= 2) {\\n\\t\\t\\tPoint v1 = Stack1[Stack1.size() - 2];\\n\\t\\t\\tPoint v2 = Stack1[Stack1.size() - 1];\\n\\t\\t\\tPoint v3 = Poly[i];\\n\\t\\t\\tif (crs(v2 - v1, v3 - v2) <= 0) Stack1.pop_back();\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tStack1.push_back(Poly[i]);\\n\\t}\\n\\n\\t// Left Part\\n\\tvector<Point> Stack2 = { Poly[0], Poly[1] };\\n\\tfor (int i = 2; i < Poly.size(); i++) {\\n\\t\\twhile (Stack2.size() >= 2) {\\n\\t\\t\\tPoint v1 = Stack2[Stack2.size() - 2];\\n\\t\\t\\tPoint v2 = Stack2[Stack2.size() - 1];\\n\\t\\t\\tPoint v3 = Poly[i];\\n\\t\\t\\tif (crs(v2 - v1, v3 - v2) >= 0) Stack2.pop_back();\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tStack2.push_back(Poly[i]);\\n\\t}\\n\\n\\t// Joint\\n\\tvector<Point> Return = Stack1;\\n\\tfor (int i = (int)Stack2.size() - 2; i >= 1; i--) Return.push_back(Stack2[i]);\\n\\treturn Return;\\n}\\n\\nconst int dx[4] = { -1, 0, 1, 0 };\\nconst int dy[4] = { 0, -1, 0, 1 };\\nconst long double TEISUU = 3.14159265358979L / 2.0L;\\nlong long N;\\nlong long A[1 << 18], B[1 << 18];\\nlong long X[1 << 18], Y[1 << 18];\\nlong double Angle[1 << 18];\\n\\nlong double GetArea(Point p1, Point p2, Point p3, Point p4, long double val) {\\n\\t// Get Yoko1\\n\\tPoint diff1 = p2 - p1;\\n\\tlong double dst1 = sqrtl(1.0L * diff1.px * diff1.px + 1.0L * diff1.py * diff1.py);\\n\\tlong double yoko1 = dst1 * cos(atan2l(diff1.py, diff1.px) - val);\\n\\n\\t// Get Yoko2\\n\\tPoint diff2 = p1 - p4;\\n\\tlong double dst2 = sqrtl(1.0L * diff2.px * diff2.px + 1.0L * diff2.py * diff2.py);\\n\\tlong double yoko2 = dst2 * cos(atan2l(diff2.py, diff2.px) - val);\\n\\t\\n\\t// Get Tate1\\n\\tlong double tate1 = dst1 * sin(atan2l(diff1.py, diff1.px) - val);\\n\\n\\t// Get Tate2\\n\\tPoint diff3 = p3 - p2;\\n\\tlong double dst3 = sqrt(1.0L * diff3.px * diff3.px + 1.0L * diff3.py * diff3.py);\\n\\tlong double tate2 = dst3 * cos(atan2l(diff3.py, diff3.px) - (val + TEISUU));\\n\\n\\t// Return\\n\\treturn (yoko1 + yoko2) * (tate1 + tate2);\\n}\\n\\nlong double Tansaku(Point p1, Point p2, Point p3, Point p4, long double Left, long double Rigt) {\\n\\tlong double cl = Left, cr = Rigt, c1 = 0, c2 = 0, minx = 1.0e12L;\\n\\tminx = min(minx, GetArea(p1, p2, p3, p4, Left));\\n\\tminx = min(minx, GetArea(p1, p2, p3, p4, Rigt));\\n\\tfor (int i = 0; i < 80; i++) {\\n\\t\\tc1 = (cl + cl + cr) / 3.0L;\\n\\t\\tc2 = (cl + cr + cr) / 3.0L;\\n\\t\\tc2 = Rigt;\\n\\t\\tlong double v1 = GetArea(p1, p2, p3, p4, c1);\\n\\t\\tlong double v2 = GetArea(p1, p2, p3, p4, c2);\\n\\t\\tminx = min(minx, min(v1, v2));\\n\\t\\tif (v1 > v2) { v1 = c1; }\\n\\t\\telse { v2 = c2; }\\n\\t}\\n\\treturn minx;\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tfor (int i = 1; i < N; i++) cin >> A[i] >> B[i];\\n\\tfor (int i = 1; i < N; i++) {\\n\\t\\tX[i] = X[A[i]] + dx[B[i]];\\n\\t\\tY[i] = Y[A[i]] + dy[B[i]];\\n\\t}\\n\\n\\t// Step 2. Convex\\n\\tvector<Point> V;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tV.push_back(Point{ X[i] + 0, Y[i] + 0 });\\n\\t\\tV.push_back(Point{ X[i] + 0, Y[i] + 1 });\\n\\t\\tV.push_back(Point{ X[i] + 1, Y[i] + 0 });\\n\\t\\tV.push_back(Point{ X[i] + 1, Y[i] + 1 });\\n\\t}\\n\\tvector<Point> W = Convex(V);\\n\\tfor (int i = 0; i < W.size(); i++) {\\n\\t\\tPoint v = W[i] - W[(i + W.size() - 1) % W.size()];\\n\\t\\tAngle[i] = atan2(v.py, v.px);\\n\\t\\tif (Angle[i] < 0.0) Angle[i] += 4.0 * TEISUU;\\n\\t}\\n\\n\\t// Step 3. Brute Force\\n\\tlong double Answer = 1.0e12;\\n\\tfor (int i = 0; i < W.size(); i++) {\\n\\t\\tfor (int j = i + 1; j < W.size(); j++) {\\n\\t\\t\\tfor (int k = j + 1; k < W.size(); k++) {\\n\\t\\t\\t\\tfor (int l = k + 1; l < W.size(); l++) {\\n\\t\\t\\t\\t\\tlong double cl = 0.0L - 1.0e-9L, cr = TEISUU + 1.0e-9L;\\n\\t\\t\\t\\t\\tif (i != 0) cl = max(cl, Angle[(i + 0) % W.size()]);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(i + 1) % W.size()]);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(j + 0) % W.size()] - 1.0 * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(j + 1) % W.size()] - 1.0 * TEISUU);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(k + 0) % W.size()] - 2.0 * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(k + 1) % W.size()] - 2.0 * TEISUU);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(l + 0) % W.size()] - 3.0 * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(l + 1) % W.size()] - 3.0 * TEISUU);\\n\\t\\t\\t\\t\\tif (cl > cr) continue;\\n\\t\\t\\t\\t\\tlong double ret = Tansaku(W[i], W[j], W[k], W[l], cl, cr);\\n\\t\\t\\t\\t\\tAnswer = min(Answer, ret);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12Lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6233766233766234,\n \"time_ms\": 60,\n \"memory_kb\": 25316,\n \"score_of_the_acc\": -0.6244,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2804_8322721\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct Point {\\n\\tlong long px, py;\\n};\\n\\nPoint operator-(const Point& a1, const Point& a2) {\\n\\treturn Point{ a1.px - a2.px, a1.py - a2.py };\\n}\\n\\nbool operator<(const Point& a1, const Point& a2) {\\n\\tif (a2.py - a1.py > 0) return true;\\n\\tif (a1.py - a2.py > 0) return false;\\n\\tif (a2.px - a1.px > 0) return true;\\n\\tif (a1.px - a2.px > 0) return false;\\n\\treturn false;\\n}\\n\\nlong long crs(Point a1, Point a2) {\\n\\treturn a1.px * a2.py - a2.px * a1.py;\\n}\\n\\nvector<Point> Convex(vector<Point> Poly) {\\n\\tsort(Poly.begin(), Poly.end());\\n\\n\\t// Right Part\\n\\tvector<Point> Stack1 = { Poly[0], Poly[1]};\\n\\tfor (int i = 2; i < Poly.size(); i++) {\\n\\t\\twhile (Stack1.size() >= 2) {\\n\\t\\t\\tPoint v1 = Stack1[Stack1.size() - 2];\\n\\t\\t\\tPoint v2 = Stack1[Stack1.size() - 1];\\n\\t\\t\\tPoint v3 = Poly[i];\\n\\t\\t\\tif (crs(v2 - v1, v3 - v2) <= 0) Stack1.pop_back();\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tStack1.push_back(Poly[i]);\\n\\t}\\n\\n\\t// Left Part\\n\\tvector<Point> Stack2 = { Poly[0], Poly[1] };\\n\\tfor (int i = 2; i < Poly.size(); i++) {\\n\\t\\twhile (Stack2.size() >= 2) {\\n\\t\\t\\tPoint v1 = Stack2[Stack2.size() - 2];\\n\\t\\t\\tPoint v2 = Stack2[Stack2.size() - 1];\\n\\t\\t\\tPoint v3 = Poly[i];\\n\\t\\t\\tif (crs(v2 - v1, v3 - v2) >= 0) Stack2.pop_back();\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tStack2.push_back(Poly[i]);\\n\\t}\\n\\n\\t// Joint\\n\\tvector<Point> Return = Stack1;\\n\\tfor (int i = (int)Stack2.size() - 2; i >= 1; i--) Return.push_back(Stack2[i]);\\n\\treturn Return;\\n}\\n\\nconst int dx[4] = { -1, 0, 1, 0 };\\nconst int dy[4] = { 0, -1, 0, 1 };\\nconst double TEISUU = 3.14159265358979 / 2.0;\\nlong long N;\\nlong long A[1 << 18], B[1 << 18];\\nlong long X[1 << 18], Y[1 << 18];\\ndouble Angle[1 << 18];\\n\\ndouble GetArea(Point p1, Point p2, Point p3, Point p4, double val) {\\n\\t// Get Yoko1\\n\\tPoint diff1 = p2 - p1;\\n\\tdouble dst1 = sqrt(diff1.px * diff1.px + diff1.py * diff1.py);\\n\\tdouble yoko1 = dst1 * cos(atan2(diff1.py, diff1.px) - val);\\n\\n\\t// Get Yoko2\\n\\tPoint diff2 = p1 - p4;\\n\\tdouble dst2 = sqrt(diff2.px * diff2.px + diff2.py * diff2.py);\\n\\tdouble yoko2 = dst2 * cos(atan2(diff2.py, diff2.px) - val);\\n\\t\\n\\t// Get Tate1\\n\\tdouble tate1 = dst1 * sin(atan2(diff1.py, diff1.px) - val);\\n\\n\\t// Get Tate2\\n\\tPoint diff3 = p3 - p2;\\n\\tdouble dst3 = sqrt(diff3.px * diff3.px + diff3.py * diff3.py);\\n\\tdouble tate2 = dst3 * cos(atan2(diff3.py, diff3.px) - (val + TEISUU));\\n\\n\\t// Return\\n\\treturn (yoko1 + yoko2) * (tate1 + tate2);\\n}\\n\\ndouble Tansaku(Point p1, Point p2, Point p3, Point p4, double Left, double Rigt) {\\n\\tdouble cl = Left, cr = Rigt, c1 = 0, c2 = 0, minx = 1e12;\\n\\tminx = min(minx, GetArea(p1, p2, p3, p4, Left));\\n\\tminx = min(minx, GetArea(p1, p2, p3, p4, Rigt));\\n\\tfor (int i = 0; i < 40; i++) {\\n\\t\\tc1 = (cl + cl + cr) / 3.0;\\n\\t\\tc2 = (cl + cr + cr) / 3.0;\\n\\t\\tc2 = Rigt;\\n\\t\\tdouble v1 = GetArea(p1, p2, p3, p4, c1);\\n\\t\\tdouble v2 = GetArea(p1, p2, p3, p4, c2);\\n\\t\\tminx = min(minx, min(v1, v2));\\n\\t\\tif (v1 > v2) { v1 = c1; }\\n\\t\\telse { v2 = c2; }\\n\\t}\\n\\treturn minx;\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tfor (int i = 1; i < N; i++) cin >> A[i] >> B[i];\\n\\tfor (int i = 1; i < N; i++) {\\n\\t\\tX[i] = X[A[i]] + dx[B[i]];\\n\\t\\tY[i] = Y[A[i]] + dy[B[i]];\\n\\t}\\n\\n\\t// Step 2. Convex\\n\\tvector<Point> V;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tV.push_back(Point{ X[i] + 0, Y[i] + 0 });\\n\\t\\tV.push_back(Point{ X[i] + 0, Y[i] + 1 });\\n\\t\\tV.push_back(Point{ X[i] + 1, Y[i] + 0 });\\n\\t\\tV.push_back(Point{ X[i] + 1, Y[i] + 1 });\\n\\t}\\n\\tvector<Point> W = Convex(V);\\n\\tfor (int i = 0; i < W.size(); i++) {\\n\\t\\tPoint v = W[i] - W[(i + W.size() - 1) % W.size()];\\n\\t\\tAngle[i] = atan2(v.py, v.px);\\n\\t\\tif (Angle[i] < 0.0) Angle[i] += 4.0 * TEISUU;\\n\\t}\\n\\n\\t// Step 3. Brute Force\\n\\tdouble Answer = 1.0e12;\\n\\tfor (int i = 0; i < W.size(); i++) {\\n\\t\\tfor (int j = i + 1; j < W.size(); j++) {\\n\\t\\t\\tfor (int k = j + 1; k < W.size(); k++) {\\n\\t\\t\\t\\tfor (int l = k + 1; l < W.size(); l++) {\\n\\t\\t\\t\\t\\tdouble cl = 0 - 1.0e-8, cr = TEISUU + 1.0e-8;\\n\\t\\t\\t\\t\\tif (i != 0) cl = max(cl, Angle[(i + 0) % W.size()]);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(i + 1) % W.size()]);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(j + 0) % W.size()] - 1.0 * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(j + 1) % W.size()] - 1.0 * TEISUU);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(k + 0) % W.size()] - 2.0 * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(k + 1) % W.size()] - 2.0 * TEISUU);\\n\\t\\t\\t\\t\\tcl = max(cl, Angle[(l + 0) % W.size()] - 3.0 * TEISUU);\\n\\t\\t\\t\\t\\tcr = min(cr, Angle[(l + 1) % W.size()] - 3.0 * TEISUU);\\n\\t\\t\\t\\t\\tif (cl > cr) continue;\\n\\t\\t\\t\\t\\tdouble ret = Tansaku(W[i], W[j], W[k], W[l], cl, cr);\\n\\t\\t\\t\\t\\tAnswer = min(Answer, ret);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6233766233766234,\n \"time_ms\": 60,\n \"memory_kb\": 25252,\n \"score_of_the_acc\": -0.622,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2804_5506764\",\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 100005\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point a,Point b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\t/*void outPut(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\\\n\\\",p[0].x,p[0].y,p[1].x,p[1].y);\\n\\t}*/\\n\\tPoint p[2];\\n};\\n\\n\\nPoint input[SIZE],work[SIZE];\\n\\ndouble calc_dist(Point A,Point B){\\n\\n\\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\\n}\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\nPolygon ConvexHull(Polygon V){\\n\\n\\tsort(V.begin(),V.end());\\n\\n\\tvector<Point> UP,DOWN;\\n\\n\\tUP.push_back(V[0]);\\n\\tDOWN.push_back(V[0]);\\n\\n\\tfor(int i = 1; i < V.size(); i++){\\n\\n\\t\\twhile(UP.size() > 1 && ccw(UP[UP.size()-2],UP[UP.size()-1],V[i]) == COUNTER_CLOCKWISE){\\n\\n\\t\\t\\tUP.pop_back();\\n\\t\\t}\\n\\n\\t\\twhile(DOWN.size() > 1 && ccw(DOWN[DOWN.size()-2],DOWN[DOWN.size()-1],V[i]) == CLOCKWISE){\\n\\n\\t\\t\\tDOWN.pop_back();\\n\\t\\t}\\n\\n\\t\\tUP.push_back(V[i]);\\n\\t\\tDOWN.push_back(V[i]);\\n\\t}\\n\\n\\tPolygon ret;\\n\\n\\tfor(int i = 0; i < UP.size(); i++){\\n\\n\\t\\tret.push_back(UP[i]);\\n\\t}\\n\\n\\tfor(int i = DOWN.size()-1; i >= 0; i--){ //★indexに注意★\\n\\n\\t\\tret.push_back(DOWN[i]);\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\n/*点moveをbaseを中心にradラジアン回転させる\\nrad > 0なら反時計回り、rad < 0なら時計周り\\n*/\\nPoint rotate(Point base,Point move,double rad){\\n\\n\\tPoint ret;\\n\\tmove = move-base;\\n\\n\\tret.x = move.x*cos(rad)-move.y*sin(rad);\\n\\tret.y = move.x*sin(rad)+move.y*cos(rad);\\n\\n\\tret = ret+base;\\n\\n\\treturn ret;\\n}\\n\\ndouble calc_slope(Line A){\\n\\n\\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\\n\\n\\t\\treturn 0;\\n\\n\\t}else{\\n\\n\\t\\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tif(N == 1){\\n\\n\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tinput[0] = Point(0,0); //左下の点\\n\\n\\tint n,d;\\n\\n\\tfor(int i = 1; i <= N-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&n,&d);\\n\\n\\t\\tswitch(d){\\n\\t\\tcase 0: //左\\n\\n\\t\\t\\tinput[i] = Point(input[n].x-1,input[n].y);\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase 1: //下\\n\\n\\t\\t\\tinput[i] = Point(input[n].x,input[n].y-1);\\n\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase 2: //右\\n\\n\\t\\t\\tinput[i] = Point(input[n].x+1,input[n].y);\\n\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase 3: //上\\n\\n\\t\\t\\tinput[i] = Point(input[n].x,input[n].y+1);\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tvector<Point> vec;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tvec.push_back(input[i]);\\n\\t\\tvec.push_back(Point(input[i].x+1,input[i].y));\\n\\t\\tvec.push_back(Point(input[i].x+1,input[i].y+1));\\n\\t\\tvec.push_back(Point(input[i].x,input[i].y+1));\\n\\t}\\n\\tsort(vec.begin(),vec.end());\\n\\tvec.erase(unique(vec.begin(),vec.end()),vec.end());\\n\\n\\tPolygon ret = ConvexHull(vec);\\n\\tret.pop_back();\\n\\n\\n\\tPolygon CH;\\n\\tCH.push_back(ret[0]);\\n\\n\\tfor(int i = 0; i < ret.size(); i++){\\n\\t\\tif(i+1 < ret.size()){\\n\\n\\t\\t\\tdouble pre_slope = calc_slope(Line(ret[i-1],ret[i]));\\n\\t\\t\\tdouble now_slope = calc_slope(Line(ret[i+1],ret[i]));\\n\\n\\t\\t\\tif(fabs(pre_slope-now_slope) < EPS){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tCH.push_back(ret[i]);\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tCH.push_back(ret[i]);\\n\\t\\t}\\n\\t}\\n\\tdouble ans = HUGE_NUM;\\n\\n\\tint M = CH.size();\\n\\n\\tint start = -1;\\n\\tdouble bottom = HUGE_NUM;\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tif(CH[i].y < bottom){\\n\\t\\t\\tbottom = CH[i].y;\\n\\t\\t\\tstart = i;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\twork[i] = CH[i];\\n\\t}\\n\\n\\tbool pre_Hori = false;\\n\\n\\tfor(int a = 0; a < M; a++){\\n\\n\\t\\tint i = (start+a)%M;\\n\\n\\t\\tdouble tmp_rad = calc_rad(work[(i+1)%M]-work[i]);\\n\\n\\t\\tPoint base = work[i];\\n\\n\\t\\tif(fabs(tmp_rad-M_PI) < EPS || fabs(tmp_rad) < EPS){ //回転不要\\n\\n\\t\\t\\tif(pre_Hori){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tpre_Hori = true;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\n\\t\\t\\tpre_Hori = false;\\n\\t\\t}\\n\\n\\t\\tfor(int k = 0; k < M; k++){\\n\\t\\t\\tif(k == i){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tPoint tmp_p = rotate(base,work[k],-tmp_rad);\\n\\t\\t\\twork[k] = tmp_p;\\n\\t\\t}\\n\\n\\t\\tdouble min_x = HUGE_NUM,max_x = -HUGE_NUM,min_y = HUGE_NUM,max_y = -HUGE_NUM;\\n\\n\\t\\tfor(int k = 0; k < M; k++){\\n\\n\\t\\t\\tmin_x = min(min_x,work[k].x);\\n\\t\\t\\tmax_x = max(max_x,work[k].x);\\n\\n\\t\\t\\tmin_y = min(min_y,work[k].y);\\n\\t\\t\\tmax_y = max(max_y,work[k].y);\\n\\t\\t}\\n\\n\\t\\tans = min(ans,(max_x-min_x)*(max_y-min_y));\\n\\t}\\n\\n\\tprintf(\\\"%.12lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 27160,\n \"score_of_the_acc\": -0.5931,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2804_5506761\",\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 100005\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point a,Point b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\t/*void outPut(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\\\n\\\",p[0].x,p[0].y,p[1].x,p[1].y);\\n\\t}*/\\n\\tPoint p[2];\\n};\\n\\n\\nPoint input[SIZE],work[SIZE];\\n\\ndouble calc_dist(Point A,Point B){\\n\\n\\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\\n}\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\nPolygon ConvexHull(Polygon V){\\n\\n\\tsort(V.begin(),V.end());\\n\\n\\tvector<Point> UP,DOWN;\\n\\n\\tUP.push_back(V[0]);\\n\\tDOWN.push_back(V[0]);\\n\\n\\tfor(int i = 1; i < V.size(); i++){\\n\\n\\t\\twhile(UP.size() > 1 && ccw(UP[UP.size()-2],UP[UP.size()-1],V[i]) == COUNTER_CLOCKWISE){\\n\\n\\t\\t\\tUP.pop_back();\\n\\t\\t}\\n\\n\\t\\twhile(DOWN.size() > 1 && ccw(DOWN[DOWN.size()-2],DOWN[DOWN.size()-1],V[i]) == CLOCKWISE){\\n\\n\\t\\t\\tDOWN.pop_back();\\n\\t\\t}\\n\\n\\t\\tUP.push_back(V[i]);\\n\\t\\tDOWN.push_back(V[i]);\\n\\t}\\n\\n\\tPolygon ret;\\n\\n\\tfor(int i = 0; i < UP.size(); i++){\\n\\n\\t\\tret.push_back(UP[i]);\\n\\t}\\n\\n\\tfor(int i = DOWN.size()-1; i >= 0; i--){ //★indexに注意★\\n\\n\\t\\tret.push_back(DOWN[i]);\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\n/*点moveをbaseを中心にradラジアン回転させる\\nrad > 0なら反時計回り、rad < 0なら時計周り\\n*/\\nPoint rotate(Point base,Point move,double rad){\\n\\n\\tPoint ret;\\n\\tmove = move-base;\\n\\n\\tret.x = move.x*cos(rad)-move.y*sin(rad);\\n\\tret.y = move.x*sin(rad)+move.y*cos(rad);\\n\\n\\tret = ret+base;\\n\\n\\treturn ret;\\n}\\n\\ndouble calc_slope(Line A){\\n\\n\\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\\n\\n\\t\\treturn 0;\\n\\n\\t}else{\\n\\n\\t\\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tif(N == 1){\\n\\n\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tinput[0] = Point(0,0); //左下の点\\n\\n\\tint n,d;\\n\\n\\tfor(int i = 1; i <= N-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&n,&d);\\n\\n\\t\\tswitch(d){\\n\\t\\tcase 0: //左\\n\\n\\t\\t\\tinput[i] = Point(input[n].x-1,input[n].y);\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase 1: //下\\n\\n\\t\\t\\tinput[i] = Point(input[n].x,input[n].y-1);\\n\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase 2: //右\\n\\n\\t\\t\\tinput[i] = Point(input[n].x+1,input[n].y);\\n\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase 3: //上\\n\\n\\t\\t\\tinput[i] = Point(input[n].x,input[n].y+1);\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tvector<Point> vec;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tvec.push_back(input[i]);\\n\\t\\tvec.push_back(Point(input[i].x+1,input[i].y));\\n\\t\\tvec.push_back(Point(input[i].x+1,input[i].y+1));\\n\\t\\tvec.push_back(Point(input[i].x,input[i].y+1));\\n\\t}\\n\\tsort(vec.begin(),vec.end());\\n\\tvec.erase(unique(vec.begin(),vec.end()),vec.end());\\n\\n\\tPolygon ret = ConvexHull(vec);\\n\\tret.pop_back();\\n\\n\\n\\tPolygon CH;\\n\\tCH.push_back(ret[0]);\\n\\n\\tfor(int i = 0; i < ret.size(); i++){\\n\\t\\tif(i+1 < ret.size()){\\n\\n\\t\\t\\tdouble pre_slope = calc_slope(Line(ret[i-1],ret[i]));\\n\\t\\t\\tdouble now_slope = calc_slope(Line(ret[i+1],ret[i]));\\n\\n\\t\\t\\tif(fabs(pre_slope-now_slope) < EPS){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tCH.push_back(ret[i]);\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tCH.push_back(ret[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tbool DEBUG = false;\\n\\tif(DEBUG){\\n\\n\\t\\tfor(int i = 0; i < CH.size(); i++){\\n\\n\\t\\t\\tCH[i].debug();\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = HUGE_NUM;\\n\\n\\tint M = CH.size();\\n\\n\\tint start = -1;\\n\\tdouble bottom = HUGE_NUM;\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tif(CH[i].y < bottom){\\n\\t\\t\\tbottom = CH[i].y;\\n\\t\\t\\tstart = i;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\twork[i] = CH[i];\\n\\t}\\n\\n\\tbool pre_Hori = false;\\n\\n\\tfor(int a = 0; a < M; a++){\\n\\n\\t\\tint i = (start+a)%M;\\n\\n\\t\\tif(DEBUG){\\n\\n\\t\\t\\tprintf(\\\"\\\\ni:%d\\\\n\\\",i);\\n\\t\\t\\tprintf(\\\"基準点\\\");\\n\\t\\t\\tCH[i].debug();\\n\\t\\t\\tprintf(\\\"次の点\\\");\\n\\t\\t\\tCH[(i+1)%M].debug();\\n\\t\\t}\\n\\n\\t\\tdouble tmp_rad = calc_rad(work[(i+1)%M]-work[i]);\\n\\n\\t\\tif(DEBUG){\\n\\n\\t\\t\\tprintf(\\\"\\\\ntmp_rad:%.3lf\\\\n\\\",tmp_rad);\\n\\t\\t}\\n\\n\\t\\tPoint base = work[i];\\n\\n\\t\\tif(fabs(tmp_rad-M_PI) < EPS || fabs(tmp_rad) < EPS){ //回転不要\\n\\n\\t\\t\\tif(pre_Hori){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tpre_Hori = true;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\n\\t\\t\\tpre_Hori = false;\\n\\t\\t}\\n\\n\\t\\tfor(int k = 0; k < M; k++){\\n\\t\\t\\tif(k == i){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tPoint tmp_p = rotate(base,work[k],-tmp_rad);\\n\\t\\t\\twork[k] = tmp_p;\\n\\t\\t}\\n\\n\\t\\tif(DEBUG){\\n\\n\\t\\t\\tprintf(\\\"work[i]\\\");\\n\\t\\t\\twork[i].debug();\\n\\n\\t\\t\\tprintf(\\\"work[i+1]\\\");\\n\\t\\t\\twork[(i+1)%M].debug();\\n\\t\\t}\\n\\n\\t\\tdouble min_x = HUGE_NUM,max_x = -HUGE_NUM,min_y = HUGE_NUM,max_y = -HUGE_NUM;\\n\\n\\t\\tfor(int k = 0; k < M; k++){\\n\\n\\t\\t\\tmin_x = min(min_x,work[k].x);\\n\\t\\t\\tmax_x = max(max_x,work[k].x);\\n\\n\\t\\t\\tmin_y = min(min_y,work[k].y);\\n\\t\\t\\tmax_y = max(max_y,work[k].y);\\n\\t\\t}\\n\\n\\t\\tans = min(ans,(max_x-min_x)*(max_y-min_y));\\n\\t}\\n\\n\\tprintf(\\\"%.12lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 27160,\n \"score_of_the_acc\": -0.5931,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2804_5483927\",\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>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n\\n\\nstruct Vector {\\n\\tdouble x, y;\\n\\tdouble rad() const {\\n\\t\\treturn std::atan2(y, x);\\n\\t}\\n\\tdouble cross(const Vector other) const {\\n\\t\\treturn x * other.y - y * other.x;\\n\\t}\\n\\tVector rotate90() const {\\n\\t\\treturn Vector{ y, -x };\\n\\t}\\n\\tdouble length() const {\\n\\t\\treturn std::sqrt(x * x + y * y);\\n\\t}\\n\\tdouble dot(const Vector other) const {\\n\\t\\treturn x * other.x + y * other.y;\\n\\t}\\n\\tVector to_len1() const {\\n\\t\\tconst auto len = length();\\n\\t\\treturn Vector{ x / len, y / len };\\n\\t}\\n};\\nstruct Point {\\n\\tint x, y;\\n\\tVector operator-(const Point other) const {\\n\\t\\treturn Vector{ double(x) - other.x, double(y) - other.y };\\n\\t}\\n\\tPoint operator+(const Point other) const {\\n\\t\\treturn Point{ x + other.x, y + other.y };\\n\\t}\\n};\\n\\ndouble solve(std::vector<Point> point) {\\n\\tif (point.size() == 1) return 1;\\n\\tstd::sort(point.begin(), point.end(), [](const Point a, const Point b) {return a.y == b.y ? a.x < b.x : a.y > b.y; });\\n\\tstd::vector<Point> convex{ point[0], point[1] };\\n\\tfor (auto i = 2; i < point.size(); ++i) {\\n\\t\\tint last = convex.size() - 1;\\n\\t\\twhile (convex.size() >= 2 && (convex[last] - convex[last - 1]).cross(point[i] - convex[last - 1]) >= 0) {\\n\\t\\t\\tconvex.pop_back();\\n\\t\\t\\t--last;\\n\\t\\t}\\n\\t\\tconvex.push_back(point[i]);\\n\\t}\\n\\tfor (int i = point.size() - 2; i >= 0; --i) {\\n\\t\\tint last = convex.size() - 1;\\n\\t\\twhile (convex.size() >= 2 && (convex[last] - convex[last - 1]).cross(point[i] - convex[last - 1]) >= 0) {\\n\\t\\t\\tconvex.pop_back();\\n\\t\\t\\t--last;\\n\\t\\t}\\n\\t\\tconvex.push_back(point[i]);\\n\\t}\\n\\tconvex.pop_back();\\n\\tstd::vector<int> indices{ 0, \\n\\t\\t(int)std::distance(convex.begin(), std::max_element(convex.begin(), convex.end(), [](const Point a, const Point b) {return a.x < b.x; })),\\n\\t\\t(int)std::distance(convex.begin(), std::min_element(convex.begin(), convex.end(), [](const Point a, const Point b) {return a.y < b.y; })),\\n\\t\\t(int)std::distance(convex.begin(), std::min_element(std::next(convex.begin()), convex.end(), [](const Point a, const Point b) {return a.x < b.x; })) };\\n\\tdouble result{ DBL_MAX };\\n\\tfor (; indices[0] < convex.size(); ++indices[0]) {\\n\\t\\tauto vec = convex[(indices[0] + 1) % convex.size()] - convex[indices[0]];\\n\\t\\tconst auto v = vec.to_len1();\\n\\t\\tfor (auto i = 1; i < 4; ++i) {\\n\\t\\t\\tvec = vec.rotate90();\\n\\t\\t\\tauto& idx = indices[i];\\n\\t\\t\\twhile (vec.cross(convex[(idx + 1) % convex.size()] - convex[idx]) > 0) {\\n\\t\\t\\t\\tidx = (idx + 1) % convex.size();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst auto height = (convex[indices[2]] - convex[indices[0]]).dot(v.rotate90());\\n\\t\\tconst auto width = (convex[indices[1]] - convex[indices[3]]).dot(v);\\n\\t\\tconst auto area = height * width;\\n\\t\\tresult = std::min(result, area);\\n\\t}\\n\\treturn result;\\n}\\n\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tstd::vector<Point> point{ Point{0, 0} }; point.reserve(n << 2);\\n\\tstd::array<Point, 4> dir{ Point{-1, 0}, Point{0, 1}, Point{1, 0}, Point{0, -1} };\\n\\twhile (point.size() < n) {\\n\\t\\tint x, d; std::cin >> x >> d;\\n\\t\\tpoint.push_back(point[x] + dir[d]);\\n\\t}\\n\\tstd::unordered_map<int, std::unordered_set<int>> coordinates;\\n\\tfor (const auto [x, y] : point) {\\n\\t\\tcoordinates[x].insert(y);\\n\\t\\tcoordinates[x].insert(y + 1);\\n\\t\\tcoordinates[x + 1].insert(y);\\n\\t\\tcoordinates[x + 1].insert(y + 1);\\n\\t}\\n\\tpoint.clear();\\n\\tfor (const auto& [x, ys] : coordinates) {\\n\\t\\tfor (const auto y : ys) {\\n\\t\\t\\tpoint.push_back(Point{ x, y });\\n\\t\\t}\\n\\t}\\n\\tconst auto result = solve(std::move(point));\\n\\tstd::cout << std::setprecision(15) << std::fixed << result << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 24072,\n \"score_of_the_acc\": -0.528,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2804_5483787\",\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>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n\\n\\nstruct Vector {\\n\\tdouble x, y;\\n\\tdouble rad() const {\\n\\t\\treturn std::atan2(y, x);\\n\\t}\\n\\tdouble cross(const Vector other) const {\\n\\t\\treturn x * other.y - y * other.x;\\n\\t}\\n\\tVector rotate90() const {\\n\\t\\treturn Vector{ y, -x };\\n\\t}\\n\\tdouble length() const {\\n\\t\\treturn std::sqrt(x * x + y * y);\\n\\t}\\n\\tdouble dot(const Vector other) const {\\n\\t\\treturn x * other.x + y * other.y;\\n\\t}\\n\\tVector to_len1() const {\\n\\t\\tconst auto len = length();\\n\\t\\treturn Vector{ x / len, y / len };\\n\\t}\\n};\\nstruct Point {\\n\\tint x, y;\\n\\tVector operator-(const Point other) const {\\n\\t\\treturn Vector{ double(x) - other.x, double(y) - other.y };\\n\\t}\\n\\tPoint operator+(const Point other) const {\\n\\t\\treturn Point{ x + other.x, y + other.y };\\n\\t}\\n};\\n\\ndouble solve(std::vector<Point> point) {\\n\\tif (point.size() == 1) return 1;\\n\\tstd::sort(point.begin(), point.end(), [](const Point a, const Point b) {return a.y == b.y ? a.x < b.x : a.y > b.y; });\\n\\tstd::vector<Point> convex{ point[0], point[1] };\\n\\tfor (auto i = 2; i < point.size(); ++i) {\\n\\t\\tint last = convex.size() - 1;\\n\\t\\twhile (convex.size() >= 2 && (convex[last] - convex[last - 1]).cross(point[i] - convex[last - 1]) >= 0) {\\n\\t\\t\\tconvex.pop_back();\\n\\t\\t\\t--last;\\n\\t\\t}\\n\\t\\tconvex.push_back(point[i]);\\n\\t}\\n\\tfor (int i = point.size() - 2; i >= 0; --i) {\\n\\t\\tint last = convex.size() - 1;\\n\\t\\twhile (convex.size() >= 2 && (convex[last] - convex[last - 1]).cross(point[i] - convex[last - 1]) >= 0) {\\n\\t\\t\\tconvex.pop_back();\\n\\t\\t\\t--last;\\n\\t\\t}\\n\\t\\tconvex.push_back(point[i]);\\n\\t}\\n\\tstd::vector<int> indices{ 0, \\n\\t\\t(int)std::distance(convex.begin(), std::max_element(convex.begin(), convex.end(), [](const Point a, const Point b) {return a.x < b.x; })),\\n\\t\\t(int)std::distance(convex.begin(), std::min_element(convex.begin(), convex.end(), [](const Point a, const Point b) {return a.y < b.y; })),\\n\\t\\t(int)std::distance(convex.begin(), std::min_element(std::next(convex.begin()), convex.end(), [](const Point a, const Point b) {return a.x < b.x; })) };\\n\\tdouble result{ DBL_MAX };\\n\\twhile (indices.back() + 1 < convex.size()) {\\n\\t\\tstd::vector<Vector> vec;\\n\\t\\tfor (const auto idx : indices) {\\n\\t\\t\\tvec.push_back(convex[idx + 1] - convex[idx]);\\n\\t\\t\\tfor (auto& v : vec) {\\n\\t\\t\\t\\tv = v.rotate90();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst auto max = std::distance(vec.begin(), std::max_element(vec.begin(), vec.end(), [](const Vector a, const Vector b) {return a.rad() < b.rad(); }));\\n\\t\\tauto v = vec[max].to_len1();\\n\\t\\tconst auto height = (convex[indices[2]] - convex[indices[0]]).dot(v.rotate90());\\n\\t\\tconst auto width = (convex[indices[1]] - convex[indices[3]]).dot(v);\\n\\t\\tresult = std::min(result, height * width);\\n\\t\\t++indices[max];\\n\\t}\\n\\treturn result;\\n}\\n\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tstd::vector<Point> point{ Point{0, 0} }; point.reserve(n << 2);\\n\\tstd::array<Point, 4> dir{ Point{-1, 0}, Point{0, 1}, Point{1, 0}, Point{0, -1} };\\n\\twhile (point.size() < n) {\\n\\t\\tint x, d; std::cin >> x >> d;\\n\\t\\tpoint.push_back(point[x] + dir[d]);\\n\\t}\\n\\tstd::unordered_map<int, std::unordered_set<int>> coordinates;\\n\\tfor (const auto [x, y] : point) {\\n\\t\\tcoordinates[x].insert(y);\\n\\t\\tcoordinates[x].insert(y + 1);\\n\\t\\tcoordinates[x + 1].insert(y);\\n\\t\\tcoordinates[x + 1].insert(y + 1);\\n\\t}\\n\\tpoint.clear();\\n\\tfor (const auto& [x, ys] : coordinates) {\\n\\t\\tfor (const auto y : ys) {\\n\\t\\t\\tpoint.push_back(Point{ x, y });\\n\\t\\t}\\n\\t}\\n\\tconst auto result = solve(std::move(point));\\n\\tstd::cout << std::setprecision(15) << std::fixed << result << '\\\\n';\\n}\",\n \"accuracy\": 0.6233766233766234,\n \"time_ms\": 50,\n \"memory_kb\": 11240,\n \"score_of_the_acc\": -0.05,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2804_4488386\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <complex>\\n#include <set>\\nusing namespace std;\\n\\nusing W = double;\\nusing P = complex<W>;\\nusing L = pair<P,P>;\\nusing C = pair<P,W>;\\nusing Poly = vector<P>;\\n#define X real()\\n#define Y imag()\\nconst W EPS = (1e-10), pi = acos(-1);\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\\n }\\n bool cmp_y(const P &a, const P &b){\\n return a.Y != b.Y ? a.Y < b.Y : a.X < b.X;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){ return a.X * b.X + a.Y * b.Y;}\\nW cross(P a, P b){ return a.X * b.Y - a.Y * b.X;}\\n\\nPoly convex_hull(Poly v){\\n int n = v.size(), k = 0;\\n sort(v.begin(), v.end(), cmp_y);\\n Poly r(2*n);\\n for(int i = 0; i < n; i++){\\n while(k>1 && cross(r[k-1]-r[k-2],v[i]-r[k-2]) < -EPS) k--;\\n r[k++] = v[i];\\n }\\n for(int i = n-2, t = k; i >= 0; i--){\\n while(k>t && cross(r[k-1]-r[k-2],v[i]-r[k-2]) < -EPS) k--;\\n r[k++] = v[i];\\n }\\n r.resize(k-1);\\n return r;\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n int dx[] = {-1,0,1,0}, dy[] = {0,-1,0,1};\\n set<P> s;\\n\\n vector<P> sq = {{0,0},{1,0},{1,1},{0,1}};\\n vector<vector<P>> D(N);\\n D[0] = sq;\\n for(int i = 1; i < N; ++i){\\n int n, d;\\n cin >> n >> d;\\n vector<P> t = D[n];\\n for(auto& p : t)\\n p = p+P(dx[d],dy[d]);\\n D[i] = t;\\n }\\n for(int i = 0; i < N; ++i){\\n for(auto p : D[i])\\n s.insert(p);\\n }\\n\\n vector<P> ps;\\n for(auto p : s)\\n ps.push_back(p);\\n vector<P> c = convex_hull(ps);\\n\\n // for(auto p : c)\\n // fprintf(stderr,\\\"%lld %lld\\\\n\\\",p.X,p.Y);\\n \\n int v = c.size();\\n int l = 0, r = 0, b = 0;\\n P d = c[1] - c[0];\\n P n(-d.Y,d.X);\\n while(dot(d,c[(l+1)%v]-c[0]) >= dot(d,c[l]-c[0])){\\n ++l;\\n l %= v;\\n }\\n while(dot(d,c[(r+v-1)%v]-c[0]) <= dot(d,c[r]-c[0])){\\n r = (r+v-1)%v;\\n }\\n while(dot(n,c[(b+1)%v]-c[0]) >= dot(n,c[b]-c[0])){\\n b += 1;\\n b %= v;\\n }\\n double ans = 1e18;\\n for(int i = 0; i < v; ++i){\\n d = c[(i+1)%v] - c[i];\\n n = {-d.Y,d.X};\\n while(dot(d,c[(l+1)%v]-c[i]) >= dot(d,c[l]-c[i])){\\n ++l;\\n l %= v;\\n }\\n while(dot(d,c[(r+1)%v]-c[i]) <= dot(d,c[r]-c[i])){\\n ++r;\\n r %= v;\\n }\\n while(dot(n,c[(b+1)%v]-c[i]) >= dot(n,c[b]-c[i])){\\n ++b;\\n b %= v;\\n }\\n // fprintf(stderr,\\\"--------------------\\\\n\\\");\\n // fprintf(stderr,\\\"top : (%lld,%lld) - (%lld,%lld)\\\\n\\\",c[(i+1)%v].X,c[(i+1)%v].Y,c[i].X,c[i].Y);\\n // fprintf(stderr,\\\"left : (%lld,%lld)\\\\n\\\",c[l].X,c[l].Y);\\n // fprintf(stderr,\\\"bottom : (%lld,%lld)\\\\n\\\",c[b].X,c[b].Y);\\n // fprintf(stderr,\\\"right : (%lld,%lld)\\\\n\\\",c[r].X,c[r].Y);\\n // fprintf(stderr,\\\"area : %lld\\\\n\\\",dot(n,c[b]-c[i])*(dot(d,c[l]-c[i])-dot(d,c[r]-c[i]))/norm(d));\\n // fprintf(stderr,\\\"--------------------\\\\n\\\");\\n ans = min(ans,dot(n,c[b]-c[i])*(dot(d,c[l]-c[i])-dot(d,c[r]-c[i]))/norm(d));\\n }\\n printf(\\\"%.12f\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 38084,\n \"score_of_the_acc\": -2,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2804_4488247\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\n#include <map>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\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\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nP rotate(const P &p, double rad){\\n return p *P(cos(rad), sin(rad));\\n}\\n\\nVP convex(VP v){\\n VP ret;\\n int n = v.size();\\n sort(v.begin(), v.end());\\n for(int i=0; i<n; i++){\\n while((int)ret.size()>1 && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\\n ret.pop_back();\\n }\\n ret.push_back(v[i]);\\n }\\n int t = ret.size();\\n for(int i=n-2; i>=0; i--){\\n while((int)ret.size()>t && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\\n ret.pop_back();\\n }\\n ret.push_back(v[i]);\\n }\\n if((int)ret.size() > 1) ret.pop_back();\\n return ret;\\n}\\n\\ndouble solve(int k, VP v){\\n int n = v.size();\\n P diff = v[k];\\n for(int i=0; i<n; i++){\\n v[i] -= diff;\\n }\\n double rot = arg(v[(k+1)%n] -v[k]);\\n for(int i=0; i<n; i++){\\n v[i] = rotate(v[i], -rot);\\n }\\n double xmin=INF,xmax=-INF,ymin=INF,ymax=-INF;\\n for(int i=0; i<n; i++){\\n xmin = min(xmin, v[i].X);\\n xmax = max(xmax, v[i].X);\\n ymin = min(ymin, v[i].Y);\\n ymax = max(ymax, v[i].Y);\\n }\\n return (xmax-xmin)*(ymax-ymin);\\n}\\n\\nint main(){\\n int n;\\n cin >> n;\\n VP dir{P(-1,0), P(0,-1), P(1,0), P(0,1)};\\n VP v(n);\\n v[0] = P(0, 0);\\n for(int i=1; i<n; i++){\\n int idx,d;\\n cin >> idx >> d;\\n v[i] = v[idx]+dir[d];\\n }\\n VP p(4*n);\\n VP vdir{P(0,0), P(0,1), P(1,0), P(1,1)};\\n for(int i=0; i<n; i++){\\n for(int d=0; d<4; d++){\\n p[4*i+d] = v[i]+vdir[d];\\n }\\n }\\n p = convex(p);\\n\\n double ans = INF;\\n for(int i=0; i<(int)p.size(); i++){\\n ans = min(ans, solve(i, p));\\n }\\n cout << fixed << setprecision(10);\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 16844,\n \"score_of_the_acc\": -0.3588,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2804_3083325\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\n\\nVP convex(VP v){\\n VP ret;\\n int n = v.size();\\n sort(v.begin(), v.end());\\n for(int i=0; i<n; i++){\\n while((int)ret.size()>1 && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\\n ret.pop_back();\\n }\\n ret.push_back(v[i]);\\n }\\n int t = ret.size();\\n for(int i=n-2; i>=0; i--){\\n while((int)ret.size()>t && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\\n ret.pop_back();\\n }\\n ret.push_back(v[i]);\\n }\\n if((int)ret.size() > 1) ret.pop_back();\\n return ret;\\n}\\n\\nint dx[4] = {-1, 0, 1, 0};\\nint dy[4] = {0, -1, 0, 1};\\nint ddx[4] = {0, 0, 1, 1};\\nint ddy[4] = {0, 1, 0, 1};\\n\\nint main(){\\n int n;\\n cin >> n;\\n\\n VP tile(n);\\n tile[0] = P(0, 0);\\n for(int i=1; i<n; i++){\\n int n,d;\\n cin >> n >> d;\\n tile[i] = tile[n] +P(dx[d], dy[d]);\\n }\\n VP points(4*n);\\n for(int i=0; i<n; i++){\\n for(int j=0; j<4; j++){\\n points[4*i +j] = tile[i] +P(ddx[j], ddy[j]);\\n }\\n }\\n points = convex(points);\\n\\n int m = points.size();\\n double ans = INF;\\n for(int i=0; i<m; i++){\\n double angle = -arg(points[(i+1)%m] -points[i]);\\n P rot(cos(angle), sin(angle));\\n double xmin=INF, xmax=-INF, ymin=INF, ymax=-INF; \\n for(P p: points){\\n p *= rot;\\n xmin = min(xmin, p.X);\\n xmax = max(xmax, p.X);\\n ymin = min(ymin, p.Y);\\n ymax = max(ymax, p.Y);\\n }\\n ans = min(ans, (xmax -xmin) *(ymax -ymin));\\n }\\n cout << fixed << setprecision(10);\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 16848,\n \"score_of_the_acc\": -0.3589,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2804_2613120\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define inf 1<<29\\n#define linf (1e16)\\n#define eps (1e-8)\\n#define Eps (1e-15)\\n#define mod 1000000007\\n#define pi acos(-1.0)\\n#define phi (1.0+sqrt(5.0))/2.0\\n#define f first\\n#define s second\\n#define mp make_pair\\n#define pb push_back\\n#define all(a) (a).begin(),(a).end()\\n#define pd(a) printf(\\\"%.10f\\\\n\\\",(double)(a))\\n#define pld(a) printf(\\\"%.10Lf\\\\n\\\",(ld)(a))\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\\n#define Unique(v) v.erase(unique(all(v)),v.end())\\n#define equals(a,b) (fabs((a)-(b))<eps)\\nusing namespace std;\\ntypedef long double ld;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int,int> pii;\\ntypedef pair<int,double> pid;\\ntypedef pair<double,int> pdi;\\ntypedef pair<double,double> pdd;\\ntypedef vector<int> vi;\\ntypedef vector<pii> vpi;\\n\\nclass Point{\\npublic:\\n double x,y;\\n Point(double x=0,double y=0):x(x),y(y){}\\n\\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 bool operator<(Point p)const{ \\n return equals(x,p.x) ? y-p.y<-eps : x-p.x<-eps; }\\n bool operator==(Point p)const{ \\n return fabs(x-p.x)<eps && fabs(y-p.y)<eps;}\\n\\n double abs(){ return sqrt(norm());}\\n double norm(){ return (x*x+y*y);}\\n};\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nclass Segment{\\npublic:\\n Point p1,p2;\\n Segment(Point p1=Point(),Point p2=Point()):p1(p1),p2(p2){}\\n};\\ntypedef Segment Line;\\n\\ndouble norm(Vector a){ return (a.x*a.x+a.y*a.y);}\\ndouble abs(Vector a){ return sqrt(norm(a));}\\ndouble dot(Vector a,Vector b){ return (a.x*b.x+a.y*b.y);}\\ndouble cross(Vector a,Vector b){ return (a.x*b.y-a.y*b.x);}\\n\\nPoint project(Segment s,Point p){\\n Vector base=(s.p2-s.p1);\\n double r=(dot(p-s.p1,base)/base.norm());\\n return (s.p1+base*r);\\n}\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Vector a=p1-p0;\\n Vector b=p2-p0;\\n if(cross(a,b)>eps)return 1;\\n if(cross(a,b)<-eps)return -1;\\n if(dot(a,b)<-eps)return 2;\\n if(a.norm()<b.norm())return -2;\\n return 0;\\n}\\n\\ndouble getDistance(Line l,Point p){\\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\\n}\\n\\nPolygon convex_hull(Polygon s){\\n Polygon g;\\n int n=s.size();\\n if(n<3)return s;\\n\\n sort(s.begin(),s.end());\\n\\n for(int i=0;i<n;i++){\\n for(int n=g.size();n>=2&&ccw(g[n-2],g[n-1],s[i])==1;n--){\\n g.pop_back();\\n }\\n g.push_back(s[i]);\\n }\\n for(int i=n-2;i>=0;i--){\\n for(int n=g.size();n>=2&&ccw(g[n-2],g[n-1],s[i])==1;n--){\\n g.pop_back();\\n }\\n g.push_back(s[i]);\\n }\\n reverse(g.begin(),g.end());\\n g.pop_back();\\n return g;\\n}\\n\\ndouble solve(Polygon p){\\n double ans = linf;\\n sort(all(p));\\n Unique(p);\\n Polygon P = convex_hull(p);\\n FOR(i,0,P.size()){\\n Line L(P[i],P[(i+1)%P.size()]);\\n double h=0,w1=0,w2=0;\\n FOR(j,0,P.size()){\\n h = max(h,getDistance(L,P[j]));\\n Point c=project(L,P[j]);\\n if(ccw(L.p1,L.p2,c)==2)w1=max(w1,abs(L.p1-c));\\n else w2=max(w2,abs(L.p1-c));\\n }\\n ans = min(ans,h*(w1+w2));\\n }\\n return ans;\\n}\\n\\nint main()\\n{\\n int N,n,d;\\n cin>>N;\\n Polygon p(N);\\n p[0]=Point(0,0);\\n FOR(i,1,N){\\n cin>>n>>d;\\n if(d==0)p[i]=Point(p[n].x-1,p[n].y);\\n else if(d==1)p[i]=Point(p[n].x,p[n].y-1);\\n else if(d==2)p[i]=Point(p[n].x+1,p[n].y);\\n else p[i]=Point(p[n].x,p[n].y+1);\\n }\\n FOR(i,0,N){\\n p.pb(Point(p[i].x+1,p[i].y));\\n p.pb(Point(p[i].x,p[i].y+1));\\n p.pb(Point(p[i].x+1,p[i].y+1));\\n }\\n pd(solve(p));\\n return 0;\\n}\",\n \"accuracy\": 0.6363636363636364,\n \"time_ms\": 70,\n \"memory_kb\": 16872,\n \"score_of_the_acc\": -0.3598,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2804_2389142\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define F first\\n#define S second\\nconst double EPS = 1e-10;\\nconst double INF = 1e12;\\ntypedef complex<double> P;\\ntypedef pair<P,P> L;\\nnamespace std {\\n bool operator < (const P& a, const P& b) {\\n return real(a)!=real(b)?real(a)<real(b):imag(a)<imag(b);\\n }\\n}\\nbool cmp(P a,P b) {return atan2(a.imag(),a.real())<atan2(b.imag(),b.real());}\\ndouble cross(const P& a, const P& b) {return imag(conj(a)*b);}\\ndouble dot(const P& a, const P& b) {return real(conj(a)*b);}\\nint ccw(P a, P b, P c) {\\n b-=a;c-=a;\\n if(cross(b,c)>EPS)return +1;\\n if(cross(b,c)<-EPS)return -1;\\n if(dot(b,c)<-EPS)return +2;\\n if(norm(b)<norm(c))return -2;\\n return 0;\\n}\\ndouble D(P a, P b) {\\n return sqrt((a.real()-b.real())*(a.real()-b.real())+(a.imag()-b.imag())*(a.imag()-b.imag()));\\n}\\nP rotate(P a, double r) {\\n return P(a.real()*cos(r)-a.imag()*sin(r),a.real()*sin(r)+a.imag()*cos(r));\\n}\\nP projection(const L &l, const P &p) {\\n double t = dot(p-l.F, l.F-l.S) / norm(l.F-l.S);\\n return l.F + t*(l.F-l.S);\\n}\\ndouble toRad(double agl) {return agl*M_PI/180.0;}\\ndouble distanceLP(const L &l, const P &p) {\\n return abs(p - projection(l, p));\\n}\\nvector<P> convex_hull(vector<P> p) {\\n int n = p.size(), k = 0;\\n sort(p.begin(), p.end());\\n vector<P> q(2*n);\\n for(int i = 0; i < n; q[k++] = p[i++])\\n while(k >= 2 && ccw(q[k-2], q[k-1], p[i]) <= 0) --k;\\n for(int i = n-2, t = k+1; i >= 0; q[k++] = p[i--])\\n while(k >= t && ccw(q[k-2], q[k-1], p[i]) <= 0) --k;\\n q.resize(k-1);\\n return q;\\n}\\n\\nint main() {\\n int n;\\n cin >> n;\\n vector<P> a;\\n a.push_back(P(0,0));\\n for(int i=0; i<n-1; i++) {\\n int x,y;\\n cin >> x >> y;\\n P p=a[x],q;\\n if(y==0) q=P(p.real()-1,p.imag());\\n if(y==1) q=P(p.real(),p.imag()-1);\\n if(y==2) q=P(p.real()+1,p.imag());\\n if(y==3) q=P(p.real(),p.imag()+1);\\n a.push_back(q);\\n }\\n vector<P> v;\\n for(int i=0; i<n; i++) {\\n for(int j=0; j<2; j++) {\\n for(int k=0; k<2; k++) v.push_back(P(a[i].real()+j,a[i].imag()+k));\\n }\\n }\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n v=convex_hull(v);\\n n=v.size();\\n double ans=INF;\\n for(int i=0; i<n; i++) {\\n rotate(v.begin(),v.begin()+1,v.end());\\n P q=rotate(v[1]-v[0],toRad(90+EPS))+v[0];\\n L s=L(v[0],v[1]);\\n L t=L(v[0],q);\\n int l=2,r=n;\\n while(l+1<r) {\\n int m=(l+r)/2;\\n if(ccw(q,v[0],v[m])<0) r=m;\\n else l=m;\\n }\\n int k=l;\\n l=2,r=k;\\n for(int j=0; j<1000; j++) {\\n int m1=(l*2+r)/3,m2=(l+r*2)/3;\\n double d1=distanceLP(t,v[m1]),d2=distanceLP(t,v[m2]);\\n if(d1<d2) l=m1;\\n else r=m2;\\n }\\n l=(l+r)/2;\\n double xx=distanceLP(t,v[l]);\\n if(abs(ccw(q,v[0],v[k]))==1) k++;\\n l=k,r=n;\\n for(int j=0; j<1000; j++) {\\n int m1=(l*2+r)/3,m2=(l+r*2)/3;\\n double d1=distanceLP(t,v[m1]),d2=distanceLP(t,v[m2]);\\n if(d1<d2) l=m1;\\n else r=m2;\\n }\\n l=(l+r)/2;\\n xx+=distanceLP(t,v[l]);\\n l=2,r=n;\\n for(int j=0; j<1000; j++) {\\n int m1=(l*2+r)/3,m2=(l+r*2)/3;\\n double d1=distanceLP(s,v[m1]),d2=distanceLP(s,v[m2]);\\n if(d1<d2) l=m1;\\n else r=m2;\\n }\\n l=(l+r)/2;\\n double yy=distanceLP(s,v[l]);\\n ans=min(ans,xx*yy);\\n }\\n printf(\\\"%.10f\\\\n\\\",ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 20112,\n \"score_of_the_acc\": -0.5305,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2804_2388508\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__\\\",\\\", __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 1120000000\\n#define EPS 1e-8\\n\\n// ???????°???°???????????????\\ninline double add(double a, double b){\\n if(abs(a+b) < EPS*(abs(a) + abs(b))) return 0;\\n return a+b;\\n}\\n\\nstruct Point{\\n double x,y;\\n Point() {}\\n Point(double nx, double ny) : x(nx), y(ny) {}\\n inline Point operator + (const Point p){ return Point(add(x, p.x), add(y, p.y)); }\\n inline Point operator - (const Point p){ return Point(add(x,-p.x), add(y,-p.y)); }\\n inline Point operator * (double d){ return Point(x*d, y*d); }\\n inline double dot(const Point p){ return add(x * p.x, y*p.y); } //??????\\n inline double det(const Point p){ return add(x * p.y, -y*p.x); } //??????\\n inline double dist(const Point p){ return sqrt((x-p.x)*(x-p.x) + (y-p.y)*(y-p.y)); }\\n inline bool operator < (const Point p) const {\\n if(x != p.x) return x < p.x;\\n else return y < p.y;\\n }\\n inline bool operator == (const Point p) const {\\n return (add(x, -p.x)==0) && (add(y, -p.y)==0);\\n }\\n friend ostream& operator<<(ostream& os, const Point& p) {\\n os << \\\"[\\\" << p.x << \\\",\\\" << p.y << \\\"]\\\";\\n return os;\\n }\\n};\\n\\ndouble norm(Point p) {return p.x*p.x+p.y*p.y;}\\nPoint proj(Point a1, Point a2, Point p){\\n return a1+(a2-a1) * ( (a2-a1).dot(p-a1)/norm(a2-a1) );\\n}\\n\\nvector<Point> GrahamScan(vector<Point> points){\\n int n = points.size();\\n sort(all(points));\\n int k=0;\\n vector<Point> qs(2*n);\\n for(int i=0; i<n; qs[k++] = points[i++]){\\n while(k>1 && (qs[k-1] - qs[k-2]).det(points[i] - qs[k-1]) <= 0) k--;\\n }\\n for(int i=n-2,t=k; i>=0; qs[k++] = points[i--]){\\n while(k>t && (qs[k-1] -qs[k-2]).det(points[i] - qs[k-1]) <= 0) k--;\\n }\\n qs.resize(k-1);\\n return qs;\\n}\\n\\nint main(){\\n int n;\\n cin>>n;\\n const int dx[] = {-1,0,1,0}, dy[]={0,-1,0,1};\\n vector<Point> vec;\\n rep(x,2)rep(y,2) vec.pb(Point(x,y));\\n rep(i,n-1){\\n int p,d;\\n cin>>p>>d;\\n double bx = vec[p*4].x+dx[d], by = vec[p*4].y+dy[d];\\n rep(x,2)rep(y,2) vec.pb(Point(bx+x, by+y));\\n }\\n\\n vec = GrahamScan(vec);\\n n = vec.size();\\n\\n int i=0,j=0,k=0,l=0;\\n while(vec[i].y>vec[i+1].y) i = (i+1)%n;\\n j = i;\\n while(vec[j].x<vec[j+1].x) j = (j+1)%n;\\n k = j;\\n while(vec[k].y<vec[k+1].y) k = (k+1)%n;\\n l = k;\\n while(vec[l].x>vec[l+1].x) l = (l+1)%n;\\n\\n auto area = [&](int a, int b, int c, int d){\\n Point p1 = proj(vec[a], vec[(a+1)%n], vec[b]);\\n Point p2 = proj(vec[a], vec[(a+1)%n], vec[d]);\\n double w = p1.dist(p2);\\n Point p3 = proj(vec[a], vec[(a+1)%n], vec[c]);\\n double h = vec[c].dist(p3);\\n// dbg(a,b,c,d,vec, w*h);\\n return w*h;\\n };\\n//dbg(vec);\\n double best = area(i,j,k,l);\\n int si=i;\\n int cnt = 0;\\n while(si != i || cnt<n){\\n i = (i+1)%n;\\n if(i==j) j = (j+1)%n;\\n\\n while( (vec[(i+1)%n]-vec[i]).det(vec[(k+1)%n]-vec[k]) >= 0){\\n k = (k+1)%n;\\n if(k==l) l= (l+1)%n;\\n }\\n\\n while( (vec[(i+1)%n]-vec[i]).dot(vec[j] - vec[(j-1+n)%n]) * (vec[(i+1)%n]-vec[i]).dot(vec[(j+1)%n] - vec[j]) > 0 ) j = (j+1)%n;\\n while( (vec[(i+1)%n]-vec[i]).dot(vec[l] - vec[(l-1+n)%n]) * (vec[(i+1)%n]-vec[i]).dot(vec[(l+1)%n] - vec[l]) > 0 ) l = (l+1)%n;\\n\\n best = min(best, area(i,j,k,l));\\n cnt++;\\n }\\n\\n printf(\\\"%.7f\\\\n\\\", best);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 15372,\n \"score_of_the_acc\": -0.3539,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2804_2241166\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define pb push_back\\n \\n \\nconst double INF = (1E20);\\n#define EPS (1e-10)\\nclass P{\\npublic:\\n double x,y;\\n \\n P(double _x=0,double _y=0):x(_x),y(_y){};\\n P operator - (const P &p ) const { return P(x-p.x,y-p.y);}\\n};\\n \\nstruct S{P p1,p2;};\\n \\n \\ntypedef vector<P> Polygon;\\ntypedef P Vector;\\n \\ndouble abs(P p) {return sqrt(p.x*p.x + p.y*p.y);}\\ndouble dot(Vector a, Vector b) {return a.x*b.x+a.y*b.y;}\\n \\n \\ndouble cross(Vector a,Vector b){return a.x*b.y-a.y*b.x;}\\n \\nbool cmp_x(const P& p,const P& q){\\n if(p.x!=q.x)return p.x<q.x;\\n return p.y<q.y;\\n}\\n \\nvector<P> convex_hull(vector<P> ps){\\n int n = ps.size();\\n sort(all(ps),cmp_x);\\n int k=0;\\n vector<P> qs(n*2);\\n rep(i,n){\\n while(k>1 && cross((qs[k-1]-qs[k-2]),(ps[i]-qs[k-1]))<=0)k--;\\n \\n qs[k++] = ps[i];\\n }\\n for(int i=n-2,t=k;i>=0;i--){\\n while(k>t && cross((qs[k-1]-qs[k-2]),(ps[i]-qs[k-1]))<=0 )k--;\\n qs[k++]=ps[i];\\n }\\n qs.resize(k-1);\\n return qs;\\n}\\n \\n \\nint px[1000005];\\nint py[1000005];\\n \\ndouble getLR(S edge,vector<P> &tpol){\\n double l=INF,r=-INF;\\n \\n rep(i,tpol.size()){\\n P cur = tpol[i];\\n Vector a,b;\\n a = edge.p2 - edge.p1;\\n b = cur - edge.p1;\\n double tt = dot(a,b);\\n tt /= abs(a);\\n // cout<< tt <<endl;\\n l=min(l,tt);\\n r=max(r,tt);\\n }\\n // cout<<endl;\\n return r-l;\\n}\\n \\ndouble getU(S edge,vector<P> &tpol){\\n double res=-INF;\\n \\n rep(i,tpol.size()){\\n P cur = tpol[i];\\n Vector a,b;\\n a = edge.p2 - edge.p1;\\n b = cur - edge.p1;\\n double tt = cross(a,b);\\n tt /= abs(a);\\n \\n res=max(res, abs(tt ));\\n }\\n return res;\\n}\\n \\nint main(){\\n int n;\\n cin>>n;\\n \\n \\n vector<P> points;\\n px[0]=py[0]=0;\\n \\n for(int i=1;i<n;i++){\\n int id,dir;\\n cin>>id>>dir;\\n if(dir==0){\\n px[i]=px[id]-1;\\n py[i]=py[id];\\n }else if(dir==1){\\n px[i]=px[id];\\n py[i]=py[id]-1;\\n }else if(dir==2){\\n px[i]=px[id]+1;\\n py[i]=py[id];\\n }else if(dir==3){\\n px[i]=px[id];\\n py[i]=py[id]+1;\\n }\\n }\\n set< pair<int,int> > st;\\n for(int i=0;i<n;i++){\\n for(int dy=0;dy<2;dy++)\\n for(int dx=0;dx<2;dx++)\\n st.insert( make_pair( px[i]+dx ,py[i]+dy) );\\n \\n }\\n \\n for( pair<int,int> sp : st ){\\n \\n //cout<< sp.first << ' ' <<sp.second <<endl;\\n \\n points.emplace_back( sp.first , sp.second );\\n }\\n \\n vector<P> tpol = convex_hull(points);\\n \\n double ans=INF;\\n \\n rep(i,tpol.size()){\\n S edge = S{tpol[i],tpol[(i+1)%tpol.size()]};\\n \\n double width = getLR(edge,tpol);\\n double height = getU(edge,tpol);\\n \\n// cout<<edge.p1.x<<\\\" \\\"<<edge.p1.y<<\\\" \\\"<<edge.p2.x<<\\\" \\\"<<edge.p2.y<<endl;\\n// cout<<width<<\\\" \\\"<<height<<endl;\\n \\n ans=min(ans, width * height );\\n }\\n printf(\\\"%.10f\\\\n\\\",ans);\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 25604,\n \"score_of_the_acc\": -0.8851,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2804_2235515\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define EPS (1e-10)\\n \\nstruct Point {\\n double x, y;\\n \\n Point() {}\\n Point (double x, double y) : x(x), y(y) {}\\n \\n Point operator + (const Point &p) const {\\n return Point(x + p.x, y + p.y);\\n }\\n \\n Point operator - (const Point &p) const {\\n return Point(x - p.x, y - p.y);\\n }\\n \\n Point operator * (const double &k) const {\\n return Point(x * k, y * k);\\n }\\n \\n bool operator < (const Point &p) const {\\n return x != p.x ? x < p.x : y < p.y;\\n }\\n \\n bool operator == (const Point &p) const { return (x == p.x && y == p.y); }\\n};\\n \\ndouble dot(const Point &a, const Point &b)\\n{\\n return a.x * b.x + a.y * b.y;\\n}\\n \\ndouble cross(const Point &a, const Point &b)\\n{\\n return a.x * b.y - b.x * a.y;\\n}\\n \\ndouble norm(const Point &p)\\n{\\n return dot(p, p);\\n}\\n \\ndouble abs(const Point &p)\\n{\\n return sqrt(norm(p));\\n}\\n \\ndouble dist(const Point &a, const Point &b)\\n{\\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\\n}\\n \\n#define COUNTER_CLOCKWISE +1\\n#define CLOCKWISE -1\\n#define ONLINE_BACK +2\\n#define ONLINE_FRONT -2\\n#define ON_SEGMENT +0\\ntypedef Point Vector;\\n \\nint ccw(const Point &p0, const Point &p1, const Point &p2)\\n{\\n Vector a = p1 - p0;\\n Vector b = p2 - p0;\\n if (cross(a, b) > EPS) return COUNTER_CLOCKWISE;\\n if (cross(a, b) < -EPS) return CLOCKWISE;\\n if (dot(a, b) < -EPS) return ONLINE_BACK;\\n if (norm(a) < norm(b)) return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n \\nbool sortY(Point p1, Point p2)\\n{\\n if (p1.y != p2.y) {\\n return (p1.y - p2.y < -EPS);\\n } else { \\n return (p1.x - p2.x < -EPS);\\n }\\n}\\n \\ntypedef vector<Point> Polygon;\\n \\nPolygon convex_hull(Polygon &ps)\\n{\\n int N = ps.size(), j = 0;\\n Polygon pg(N * 2);\\n sort(ps.begin(), ps.end(), sortY);\\n for (int i = 0; i < N; i++) {\\n while (j > 1 && cross(pg[j - 1] - pg[j - 2], ps[i] - pg[j - 1]) <= 0) {\\n j--;\\n }\\n pg[j++] = ps[i];\\n }\\n int k = j;\\n for (int i = N - 2; i >= 0; i--) {\\n while (j > k && cross(pg[j - 1] - pg[j - 2], ps[i] - pg[j - 1]) <= 0) {\\n j--;\\n }\\n pg[j++] = ps[i];\\n }\\n pg.resize(j - 1);\\n return pg;\\n}\\n \\nvoid insert(set<Point> &points, Point p)\\n{\\n const int dx[] = {-1, -1, +1, +1};\\n const int dy[] = {-1, +1, +1, -1};\\n \\n for (int i = 0; i < 4; i++) {\\n double nx = p.x + dx[i] / 2.0;\\n double ny = p.y + dy[i] / 2.0;\\n points.insert(Point(nx, ny));\\n } \\n}\\n \\nstruct Segment {\\n Point s, t;\\n Segment () {}\\n Segment (Point s, Point t) : s(s), t(t) {}\\n};\\n \\ntypedef Segment Line;\\n \\nPoint projection(const Segment &s, const Point &p)\\n{\\n Vector b = s.t - s.s;\\n double t = dot(p - s.s, b) / norm(b);\\n return s.s + b * t;\\n}\\n \\ndouble distanceLP(const Line &l, const Point &p)\\n{\\n return abs(p - projection(l, p));\\n}\\n \\nint main()\\n{\\n int N;\\n cin >> N;\\n \\n set<Point> points;\\n insert(points, Point(0, 0));\\n \\n vector<Point> p(N);\\n p[0] = Point(0, 0);\\n \\n const int dx[] = {-1, +0, +1, +0};\\n const int dy[] = {+0, +1, +0, -1};\\n \\n for (int i = 0; i < N - 1; i++) {\\n int n, d;\\n cin >> n >> d;\\n p[i + 1] = Point(p[n].x + dx[d], p[n].y + dy[d]);\\n insert(points, p[i + 1]);\\n }\\n \\n Polygon pg;\\n for (auto &point: points) {\\n pg.push_back(point);\\n }\\n pg = convex_hull(pg);\\n N = pg.size();\\n double res = 1e55; \\n for (int i = 0; i < N; i++) {\\n int ci = i, ni = (i + 1) % N;\\n Line l1(pg[ci], pg[ni]);\\n \\n int jj = -1;\\n double h = 0;\\n for (int j = 0; j < N; j++) {\\n double d = distanceLP(l1, pg[j]);\\n if (d > h) {\\n h = d;\\n jj = j;\\n }\\n }\\n Point pp = projection(l1, pg[jj]); \\n Line l2(pp, pg[jj]);\\n \\n if (pp == pg[jj]) continue;\\n \\n jj = -1;\\n double w1 = 0;\\n for (int j = 0; j < N; j++) {\\n double d = distanceLP(l2, pg[j]);\\n if (d > w1) {\\n w1 = d;\\n jj = j;\\n }\\n }\\n Point pp2 = projection(l1, pg[jj]);\\n Line l3(pp2, pg[jj]);\\n \\n if (pp2 == pg[jj]) continue;\\n \\n double w = 0; \\n for (int j = 0; j < N; j++) {\\n double d = distanceLP(l3, pg[j]);\\n if (d > w) w = d;\\n } \\n res = min(res, h * w);\\n }\\n printf(\\\"%.10f\\\\n\\\", res);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 21088,\n \"score_of_the_acc\": -0.8669,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2804_2235403\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb push_back\\n#define INF (1e10+1)\\n//#define INF (1LL<<59)\\n \\n \\n#define OUT 0\\n#define ON 1\\n#define IN 2\\n#define EPS (1e-10)\\nclass P{ //???\\npublic:\\n double x,y;\\n \\n P(double _x=0,double _y=0):x(_x),y(_y){};\\n P operator + (const P &p )const{ return P( x+p.x , y+p.y ); } //??????\\n P operator - (const P &p )const{ return P( x-p.x , y-p.y ); } //??????\\n P operator * (const double k )const{ return P( x*k , y*k ); } //??????\\n P operator / (const double k )const{ return P( x/k , y/k ); } //??????\\n \\n bool operator == (const P &p){ return ( fabs(x-p.x)<EPS && fabs(y-p.y)<EPS ); }\\n bool operator < (const P &p) const{ return ( x!=p.x ? x<p.x:y<p.y ); }\\n \\n double norm(){ return x*x+y*y; } //?????????\\n double abs() { return sqrt(norm()); } //???§??????\\n void normalize() {double d = sqrt(x*x+y*y); x /= d; y /= d;} //???£??????\\n};\\nstruct C{P p;double r;}; //???\\nstruct S{P p1,p2;}; //??????\\ntypedef vector<P> Polygon; //?????§????¢\\ntypedef P Vector; //????????????\\ntypedef S L; //???´???\\n \\ndouble norm (P p) { return p.norm(); }\\ndouble abs (P p) { return p.abs(); }\\ndouble dot (Vector a,Vector b) { return a.x*b.x+a.y*b.y; }\\ndouble cross(Vector a,Vector b) { return a.x*b.y-a.y*b.x; }\\ndouble sqDist(P a, P b) {return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);}\\ndouble dist (P a, P b) {return sqrt(sqDist(a,b));}\\nVector vec(S a) {return P(a.p2.x-a.p1.x,a.p2.y-a.p1.y);}\\n \\n \\n//?????? verified AOJ0068,QUPC-G\\n//????????????§??????\\nbool cmp_x(const P& p, const P& q){\\n if(p.x != q.x)return p.x<q.x;\\n return p.y<q.y;\\n}\\n \\n//???????????±???????\\nvector<P> convex_hull(vector<P> ps){\\n int n = ps.size();\\n sort(all(ps),cmp_x);\\n int k=0; //??????????????????°\\n vector<P> qs(n*2); //??§????????????????\\n //??????´???????????????\\n rep(i,n){\\n while( k>1 && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\\n qs[k++]=ps[i];\\n }\\n //??????´???????????????\\n for(int i=n-2, t=k;i>=0;i--){\\n while( k>t && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\\n qs[k++]=ps[i];\\n }\\n qs.resize(k-1);\\n return qs;\\n}\\n \\n \\n \\ndouble solveLR(vector<P> ps,S l){\\n double mini=INF;\\n double maxi=-INF;\\n \\n rep(i,ps.size()){\\n double res = dot(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\\n mini = min(res,mini);\\n maxi = max(res,maxi);\\n }\\n return maxi-mini;\\n}\\n \\ndouble solveU(vector<P> ps,S l){\\n double maxi = -INF;\\n rep(i,ps.size()){\\n double res = cross(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\\n maxi = max(maxi,abs(res));\\n }\\n return maxi;\\n}\\n \\n \\nint main(){\\n int n;\\n cin>>n;\\n \\n vector<P> inp(n);\\n inp[0] = P(0,0);\\n for(int i=1;i<n;i++){\\n int a,b;\\n cin>>a>>b;\\n if(b==0) inp[i] = inp[a]+P(-1,0);\\n else if(b==1) inp[i] = inp[a]+P(0,-1);\\n else if(b==2) inp[i] = inp[a]+P(+1,0);\\n else if(b==3) inp[i] = inp[a]+P(0,+1);\\n }\\n set<P> ps;\\n rep(i,n){\\n ps.insert(inp[i]+P(0,0));\\n ps.insert(inp[i]+P(1,0));\\n ps.insert(inp[i]+P(0,1));\\n ps.insert(inp[i]+P(1,1));\\n }\\n \\n vector<P> arg;\\n for(auto &elm:ps)arg.pb(elm);\\n \\n vector<P> points = convex_hull(arg);\\n \\n double ans = INF;\\n \\n rep(i,points.size()){\\n S line = S{points[i],points[(i+1)%points.size()]};\\n \\n double LR = solveLR(points,line);\\n double U = solveU(points,line);\\n// cout<<LR<<\\\" \\\"<<U<<endl;\\n ans = min( ans , LR*U );\\n }\\n printf(\\\"%.10lf\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 29500,\n \"score_of_the_acc\": -1.1802,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2804_2235395\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define eps 1e-8\\n \\nstruct Point\\n{\\n double x, y;\\n \\n Point(double a = 0, double b = 0) :\\n x(a), y(b)\\n {\\n }\\n \\n bool operator<(const Point& a) const\\n {\\n if(fabs(x - a.x) > eps) return x < a.x;\\n return y < a.y;\\n }\\n \\n bool operator==(const Point& a) const\\n {\\n return fabs(x - a.x) < eps && fabs(y - a.y) < eps;\\n }\\n \\n Point operator+(const Point& a) const\\n {\\n return Point(x + a.x, y + a.y);\\n }\\n \\n Point operator-(const Point& a) const\\n {\\n return Point(x - a.x, y - a.y);\\n }\\n \\n Point operator/(const double val) const\\n {\\n return Point(x / val, y / val);\\n }\\n \\n Point operator*(const double val) const\\n {\\n return Point(x * val, y * val);\\n }\\n};\\n \\ntypedef Point Vector;\\n \\ndouble dist(Point a, Point b)\\n{\\n return hypot(a.x - b.x, a.y - b.y);\\n}\\n \\ndouble dot(Point a, Point b)\\n{\\n return a.x * b.x + a.y * b.y;\\n}\\n \\ndouble cross2(Point a, Point b)\\n{\\n return a.x * b.y - a.y * b.x;\\n}\\n \\ndouble cross(Point o, Point a, Point b)\\n{\\n return (a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x);\\n}\\n \\nint between(Point a, Point b, Point c)\\n{\\n return dot(c - a, b - a) >= 0 && dot(c - b, a - b) >= 0;\\n}\\n \\nint onSeg(Point a, Point b, Point c)\\n{\\n return between(a, b, c) && fabs(cross(a, b, c)) < eps;\\n}\\n \\ndouble distProjection(Point as, Point at, Point s)\\n{\\n double a, b, c;\\n a = at.y - as.y;\\n b = as.x - at.x;\\n c = -(a * as.x + b * as.y);\\n return fabs(a * s.x + b * s.y + c) / hypot(a, b);\\n}\\n \\nstruct Seg\\n{\\n Point s, e;\\n};\\n \\nint calcIntersection(Seg a, Seg b, Point& p)\\n{\\n double a1, b1, c1, a2, b2, c2;\\n double d, dx, dy;\\n a1 = a.s.y - a.e.y, b1 = -a.s.x + a.e.x;\\n a2 = b.s.y - b.e.y, b2 = -b.s.x + b.e.x;\\n c1 = a1 * a.s.x + b1 * a.s.y;\\n c2 = a2 * b.s.x + b2 * b.s.y;\\n d = a1 * b2 - a2 * b1;\\n dx = c1 * b2 - c2 * b1;\\n dy = a1 * c2 - a2 * c1;\\n if(fabs(d) < eps) // NONE or LINE\\n return 0;\\n p.x = dx / d, p.y = dy / d;\\n return onSeg(a.s, a.e, p) && onSeg(b.s, b.e, p);\\n}\\n \\nint inPolygon(Point p[], int n, Point q)\\n{\\n int i, j, cnt = 0;\\n for(i = 0, j = n - 1; i < n; j = i++) {\\n if(p[i].y > q.y != p[j].y > q.y &&\\n q.x < (p[j].x - p[i].x) * (q.y - p[i].y) / (p[j].y - p[i].y) + p[i].x)\\n cnt++;\\n }\\n return cnt & 1;\\n}\\n \\ndouble calcArea(Point p[], int n)\\n{\\n if(n < 3) return 0.0;\\n double ret = 0;\\n int i;\\n p[n] = p[0];\\n for(i = 0; i < n; i++)\\n ret += p[i].x * p[i + 1].y - p[i].y * p[i + 1].x;\\n return fabs(ret) / 2;\\n}\\n \\nint monotone(int n, Point p[], Point ch[])\\n{\\n sort(p, p + n);\\n int i, m = 0, t;\\n for(i = 0; i < n; i++) {\\n while(m >= 2 && cross(ch[m - 2], ch[m - 1], p[i]) <= 0)\\n m--;\\n ch[m++] = p[i];\\n }\\n for(i = n - 1, t = m + 1; i >= 0; i--) {\\n while(m >= t && cross(ch[m - 2], ch[m - 1], p[i]) <= 0)\\n m--;\\n ch[m++] = p[i];\\n }\\n return m - 1;\\n}\\n \\n#define INF 1e+30\\n \\ndouble smallRect(int n, Point ch[])\\n{\\n double lx, ly, rx, ry;\\n int up, down, left, right;\\n double ret = INF;\\n lx = ly = INF;\\n rx = ry = -INF;\\n \\n up = down = left = right = 0;\\n for(int i = 0; i < n; i++) {\\n if(ch[i].x > rx) rx = ch[i].x, right = i;\\n if(ch[i].y > ry) ry = ch[i].y, up = i;\\n if(ch[i].x < lx) lx = ch[i].x, left = i;\\n if(ch[i].y < ly) ly = ch[i].y, down = i;\\n }\\n \\n int corner[] = {up, down, left, right};\\n Point vec[] = {Point(-1, 0), Point(1, 0), Point(0, -1), Point(0, 1)};\\n \\n ret = (rx - lx) * (ry - ly);\\n for(int j = 0; j < 4; j++) {\\n while(true) {\\n Point a = ch[corner[j]], b = ch[(corner[j] + 1) % n], c = vec[j];\\n if(fabs(cross2(b - a, c)) < eps)\\n corner[j] = (corner[j] + 1) % n;\\n else\\n break;\\n }\\n }\\n for(int i = 0; i < n; i++) {\\n double mxVal = -INF, cos, sin;\\n int mxIdx = 0;\\n for(int j = 0; j < 4; j++) {\\n Point a = ch[corner[j]], b = ch[(corner[j] + 1) % n], c = vec[j];\\n double cosA = dot(b - a, c) / dist(b, a) / dist(c, Point(0, 0));\\n if(mxVal < cosA)\\n mxVal = cosA, mxIdx = j;\\n }\\n cos = mxVal, sin = sqrt(1 - cos * cos);\\n for(int j = 0; j < 4; j++) {\\n double tx, ty;\\n tx = vec[j].x * cos - vec[j].y * sin;\\n ty = vec[j].x * sin + vec[j].y * cos;\\n vec[j] = Point(tx, ty);\\n }\\n for(int j = 0; j < 4; j++) {\\n while(true) {\\n Point a = ch[corner[j]], b = ch[(corner[j] + 1) % n], c = vec[j];\\n if(fabs(cross2(b - a, c)) < eps)\\n corner[j] = (corner[j] + 1) % n;\\n else\\n break;\\n }\\n }\\n double w = distProjection(ch[corner[0]], ch[corner[0]] + vec[0], ch[corner[1]]);\\n double h = distProjection(ch[corner[2]], ch[corner[2]] + vec[2], ch[corner[3]]);\\n ret = min(ret, w * h);\\n }\\n return ret;\\n}\\n \\n \\nint xx[100001], yy[100001];\\nvector< Point > pp;\\nPoint ch[400007], k[400007];\\n \\nint main()\\n{\\n int N;\\n cin >> N;\\n int vy[] = {0, 1, 0, -1}, vx[] = {1, 0, -1, 0};\\n xx[0] = 0, yy[0] = 0;\\n pp.push_back((Point) {0.0, 0.0});\\n pp.push_back((Point) {1.0, 0.0});\\n pp.push_back((Point) {0.0, 1.0});\\n pp.push_back((Point) {1.0, 1.0});\\n \\n int tail = 0;\\n for(int i = 1; i < N; i++) {\\n int n, d;\\n cin >> n >> d;\\n double x = xx[n] + vx[d];\\n double y = yy[n] + vy[d];\\n xx[i] = x, yy[i] = y;\\n \\n pp.push_back((Point) {x, y});\\n pp.push_back((Point) {x + 1, y});\\n pp.push_back((Point) {x, y + 1});\\n pp.push_back((Point) {x + 1, y + 1});\\n }\\n for(int i = 0; i < pp.size(); i++) {\\n k[i] = pp[i];\\n }\\n int m = monotone(pp.size(), k, ch);\\n double ret = smallRect(m, ch);\\n printf(\\\"%.8lf\\\\n\\\", ret);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 24216,\n \"score_of_the_acc\": -0.6334,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2804_2015381\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb push_back\\n#define INF (1e10+1)\\n//#define INF (1LL<<59)\\n\\n\\n#define OUT 0\\n#define ON 1\\n#define IN 2\\n#define EPS (1e-10)\\nclass P{ //???\\npublic:\\n\\tdouble x,y;\\n\\t\\n\\tP(double _x=0,double _y=0):x(_x),y(_y){};\\n\\tP operator + (const P &p )const{ return P( x+p.x , y+p.y ); } //??????\\n\\tP operator - (const P &p )const{ return P( x-p.x , y-p.y ); } //??????\\n\\tP operator * (const double k )const{ return P( x*k , y*k ); } //??????\\n\\tP operator / (const double k )const{ return P( x/k , y/k ); } //??????\\n\\t\\n\\tbool operator == (const P &p){ return ( fabs(x-p.x)<EPS && fabs(y-p.y)<EPS ); }\\n\\tbool operator < (const P &p) const{ return ( x!=p.x ? x<p.x:y<p.y ); }\\n\\t\\n\\tdouble norm(){ return x*x+y*y; } //?????????\\n\\tdouble abs() { return sqrt(norm()); } //??§??????\\n\\tvoid normalize() {double d = sqrt(x*x+y*y); x /= d; y /= d;}\\t//??£??????\\n};\\nstruct C{P p;double r;}; //???\\nstruct S{P p1,p2;}; //??????\\ntypedef vector<P> Polygon; //????§???¢\\ntypedef P Vector; //????????????\\ntypedef S L; //??´???\\n\\ndouble norm (P p) { return p.norm(); }\\ndouble abs (P p) { return p.abs(); }\\ndouble dot (Vector a,Vector b) { return a.x*b.x+a.y*b.y; }\\ndouble cross(Vector a,Vector b) { return a.x*b.y-a.y*b.x; }\\ndouble sqDist(P a, P b) {return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);}\\ndouble dist (P a, P b) {return sqrt(sqDist(a,b));}\\nVector vec(S a) {return P(a.p2.x-a.p1.x,a.p2.y-a.p1.y);}\\n\\n\\n//?????? verified AOJ0068,QUPC-G\\n//???????????§??????\\nbool cmp_x(const P& p, const P& q){\\n\\tif(p.x != q.x)return p.x<q.x;\\n\\treturn p.y<q.y;\\n}\\n\\n//??????????±???????\\nvector<P> convex_hull(vector<P> ps){\\n\\tint n = ps.size();\\n\\tsort(all(ps),cmp_x);\\n\\tint k=0; //?????????????????°\\n\\tvector<P> qs(n*2); //?§????????????????\\n\\t//?????´???????????????\\n\\trep(i,n){\\n\\t\\twhile( k>1 && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\\n\\t\\tqs[k++]=ps[i];\\n\\t}\\n\\t//?????´???????????????\\n\\tfor(int i=n-2, t=k;i>=0;i--){\\n\\t\\twhile( k>t && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\\n\\t\\tqs[k++]=ps[i];\\n\\t}\\n\\tqs.resize(k-1);\\n\\treturn qs;\\n}\\n\\n\\n\\ndouble solveLR(vector<P> ps,S l){\\n\\tdouble mini=INF;\\n\\tdouble maxi=-INF;\\n\\t\\n\\trep(i,ps.size()){\\n\\t\\tdouble res = dot(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\\n\\t\\tmini = min(res,mini);\\n\\t\\tmaxi = max(res,maxi);\\n\\t}\\n\\treturn maxi-mini;\\n}\\n\\ndouble solveU(vector<P> ps,S l){\\n\\tdouble maxi = -INF;\\n\\trep(i,ps.size()){\\n\\t\\tdouble res = cross(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\\n\\t\\tmaxi = max(maxi,abs(res));\\n\\t}\\n\\treturn maxi;\\n}\\n\\n\\nint main(){\\n\\tint n;\\n\\tcin>>n;\\n\\t\\n\\tvector<P> inp(n);\\n\\tinp[0] = P(0,0);\\n\\tfor(int i=1;i<n;i++){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\tif(b==0)\\t\\tinp[i] = inp[a]+P(-1,0);\\n\\t\\telse if(b==1)\\tinp[i] = inp[a]+P(0,-1);\\n\\t\\telse if(b==2)\\tinp[i] = inp[a]+P(+1,0);\\n\\t\\telse if(b==3)\\tinp[i] = inp[a]+P(0,+1);\\n\\t}\\n\\tset<P> ps;\\n\\trep(i,n){\\n\\t\\tps.insert(inp[i]+P(0,0));\\n\\t\\tps.insert(inp[i]+P(1,0));\\n\\t\\tps.insert(inp[i]+P(0,1));\\n\\t\\tps.insert(inp[i]+P(1,1));\\n\\t}\\n\\t\\n\\tvector<P> arg;\\n\\tfor(auto &elm:ps)arg.pb(elm);\\n\\t\\n\\tvector<P> points = convex_hull(arg);\\n\\t\\n\\tdouble ans = INF;\\n\\t\\n\\trep(i,points.size()){\\n\\t\\tS line = S{points[i],points[(i+1)%points.size()]};\\n\\t\\t\\n\\t\\tdouble LR = solveLR(points,line);\\n\\t\\tdouble U = solveU(points,line);\\n//\\t\\tcout<<LR<<\\\" \\\"<<U<<endl;\\n\\t\\tans = min( ans , LR*U );\\n\\t}\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 29504,\n \"score_of_the_acc\": -1.1804,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2804_2015374\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb push_back\\n#define INF (1e9+1)\\n//#define INF (1LL<<59)\\n\\n\\n#define OUT 0\\n#define ON 1\\n#define IN 2\\n#define EPS (1e-10)\\nclass P{ //???\\npublic:\\n\\tdouble x,y;\\n\\t\\n\\tP(double _x=0,double _y=0):x(_x),y(_y){};\\n\\tP operator + (const P &p )const{ return P( x+p.x , y+p.y ); } //??????\\n\\tP operator - (const P &p )const{ return P( x-p.x , y-p.y ); } //??????\\n\\tP operator * (const double k )const{ return P( x*k , y*k ); } //??????\\n\\tP operator / (const double k )const{ return P( x/k , y/k ); } //??????\\n\\t\\n\\tbool operator == (const P &p){ return ( fabs(x-p.x)<EPS && fabs(y-p.y)<EPS ); }\\n\\tbool operator < (const P &p) const{ return ( x!=p.x ? x<p.x:y<p.y ); }\\n\\t\\n\\tdouble norm(){ return x*x+y*y; } //?????????\\n\\tdouble abs() { return sqrt(norm()); } //??§??????\\n\\tvoid normalize() {double d = sqrt(x*x+y*y); x /= d; y /= d;}\\t//??£??????\\n};\\nstruct C{P p;double r;}; //???\\nstruct S{P p1,p2;}; //??????\\ntypedef vector<P> Polygon; //????§???¢\\ntypedef P Vector; //????????????\\ntypedef S L; //??´???\\n\\ndouble norm (P p) { return p.norm(); }\\ndouble abs (P p) { return p.abs(); }\\ndouble dot (Vector a,Vector b) { return a.x*b.x+a.y*b.y; }\\ndouble cross(Vector a,Vector b) { return a.x*b.y-a.y*b.x; }\\ndouble sqDist(P a, P b) {return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);}\\ndouble dist (P a, P b) {return sqrt(sqDist(a,b));}\\nVector vec(S a) {return P(a.p2.x-a.p1.x,a.p2.y-a.p1.y);}\\n\\n\\n//?????? verified AOJ0068,QUPC-G\\n//???????????§??????\\nbool cmp_x(const P& p, const P& q){\\n\\tif(p.x != q.x)return p.x<q.x;\\n\\treturn p.y<q.y;\\n}\\n\\n//??????????±???????\\nvector<P> convex_hull(vector<P> ps){\\n\\tint n = ps.size();\\n\\tsort(all(ps),cmp_x);\\n\\tint k=0; //?????????????????°\\n\\tvector<P> qs(n*2); //?§????????????????\\n\\t//?????´???????????????\\n\\trep(i,n){\\n\\t\\twhile( k>1 && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\\n\\t\\tqs[k++]=ps[i];\\n\\t}\\n\\t//?????´???????????????\\n\\tfor(int i=n-2, t=k;i>=0;i--){\\n\\t\\twhile( k>t && cross((qs[k-1]-qs[k-2]) , (ps[i]-qs[k-1]))<=0 ) k--;\\n\\t\\tqs[k++]=ps[i];\\n\\t}\\n\\tqs.resize(k-1);\\n\\treturn qs;\\n}\\n\\n\\n\\ndouble solveLR(vector<P> ps,S l){\\n\\tdouble mini=INF;\\n\\tdouble maxi=-INF;\\n\\t\\n\\trep(i,ps.size()){\\n\\t\\tdouble res = dot(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\\n\\t\\tmini = min(res,mini);\\n\\t\\tmaxi = max(res,maxi);\\n\\t}\\n\\treturn maxi-mini;\\n}\\n\\ndouble solveU(vector<P> ps,S l){\\n\\tdouble maxi = -INF;\\n\\trep(i,ps.size()){\\n\\t\\tdouble res = cross(l.p2-l.p1,ps[i]-l.p1)/abs(l.p2-l.p1);\\n\\t\\tmaxi = max(maxi,abs(res));\\n\\t}\\n\\treturn maxi;\\n}\\n\\n\\nint main(){\\n\\tint n;\\n\\tcin>>n;\\n\\t\\n\\tvector<P> inp(n);\\n\\tinp[0] = P(0,0);\\n\\tfor(int i=1;i<n;i++){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\tif(b==0)\\t\\tinp[i] = inp[a]+P(-1,0);\\n\\t\\telse if(b==1)\\tinp[i] = inp[a]+P(0,-1);\\n\\t\\telse if(b==2)\\tinp[i] = inp[a]+P(+1,0);\\n\\t\\telse if(b==3)\\tinp[i] = inp[a]+P(0,+1);\\n\\t}\\n\\tset<P> ps;\\n\\trep(i,n){\\n\\t\\tps.insert(inp[i]+P(0,0));\\n\\t\\tps.insert(inp[i]+P(1,0));\\n\\t\\tps.insert(inp[i]+P(0,1));\\n\\t\\tps.insert(inp[i]+P(1,1));\\n\\t}\\n\\t\\n\\tvector<P> arg;\\n\\tfor(auto &elm:ps)arg.pb(elm);\\n\\t\\n\\tvector<P> points = convex_hull(arg);\\n\\t\\n\\tdouble ans = INF;\\n\\t\\n\\trep(i,points.size()){\\n\\t\\tS line = S{points[i],points[(i+1)%points.size()]};\\n\\t\\t\\n\\t\\tdouble LR = solveLR(points,line);\\n\\t\\tdouble U = solveU(points,line);\\n//\\t\\tcout<<LR<<\\\" \\\"<<U<<endl;\\n\\t\\tans = min( ans , LR*U );\\n\\t}\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n}\",\n \"accuracy\": 0.7532467532467533,\n \"time_ms\": 130,\n \"memory_kb\": 29504,\n \"score_of_the_acc\": -1.1304,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1689,"cells":{"group_id":{"kind":"string","value":"aoj_2808_cpp"},"problem_description":{"kind":"string","value":"D: パスワード\n問題\nAOR イカちゃんは英小文字のみからなる強力なパスワードを作りたいと思っています。\n友達から $N$ 個の危険なパスワードの例を教えてもらった AOR イカちゃんは、\n以下の条件を全て満たすようなパスワードを作ることにしました。\n長さは1文字以上である。\nどの危険なパスワードの、どの連続した部分文字列とも異なる。\n1, 2 の条件を満たした中で、最も短い文字列である。\n1,2,3の条件を満たした中で、辞書順に並べたとき先頭に来る文字列である。\nAOR イカちゃんに代わって強力なパスワードを生成するプログラムを書いてください。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$\n$S_1$\n$\\vdots$\n$S_N$\n1 行目には、文字列の数を表す整数 $N$ が与えられる。\n2 行目からの $N$ 行には、文字列 $S_i$ が与えられる。\n$|S_i|$ とは文字列の長さであり、1 文字以上である。\n$1 \\le N \\le 100,000$ を満たす。\n$1 \\le \\sum_{1\\le i \\le N} |S_i| \\le 400,000$ を満たす。\n文字列は英小文字のみを含む。\n出力\n答えを 1 行で出力せよ。また、末尾に改行も出力せよ。\nサンプル\nサンプル入力 1\n5\npassword\nlogin\nadmin\nroot\nmaster\nサンプル出力 1\nb\nサンプル入力 2\n3\nabcdefghijklmnopqrstuvwxy\nqwertyuiopasdfghjklxcvbnm\nqawsxedcrfvtgbyhnujmikolp\nサンプル出力 2\nz\nサンプル入力 3\n1\nabcdefghijklmnopqrstuvwxyz\nサンプル出力 3\naa"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2808_10853905","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef unsigned long long ull;\n\nstruct RollingHash\n{\n\tvector<ull> hash, pow;\n\tRollingHash(string s, ull _b = 1000000007)\n\t{\n\t\t_b = _b;\n\t\tint sz = s.length();\n\t\thash.assign(sz + 1, 0);\n\t\tpow.assign(sz + 1, 0);\n\n\t\tpow[0] = 1;\n\t\tfor (int i = 0; i<sz; i++) {\n\t\t\tpow[i + 1] = pow[i] * _b;\n\t\t}\n\t\tfor (int i = 0; i<sz; i++) {\n\t\t\thash[i + 1] = (hash[i] + s[i])*_b;\n\t\t}\n\t}\n\tull get(int l, int r) {\n\t\treturn (hash[r] - hash[l] * pow[r - l]);\n\t}\n};\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint N;\n\tcin >> N;\n\tvector<string> S(N);\n\tset<ull> st;\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> S[i];\n\t\tRollingHash rh(S[i]);\n\t\tint n = S[i].size();\n\t\tfor (int l = 0; l <= 4; l++) {\n\t\t\tfor (int i = 0; i + l <= n; i++) {\n\t\t\t\tst.insert(rh.get(i, i + l));\n\t\t\t}\n\t\t}\n\t}\n\tstring s = \"a\";\n\tfor (s[0] = 'a'; s[0] <= 'z'; s[0]++) {\n\t\tull val = RollingHash(s).get(0, 1);\n\t\tif (st.count(val) == 0) {\n\t\t\tcout << s << endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\ts = \"aa\";\n\tfor (s[0] = 'a'; s[0] <= 'z'; s[0]++) {\n\t\tfor (s[1] = 'a'; s[1] <= 'z'; s[1]++) {\n\t\t\tull val = RollingHash(s).get(0, 2);\n\t\t\tif (st.count(val) == 0) {\n\t\t\t\tcout << s << endl;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\ts = \"aaa\";\n\tfor (s[0] = 'a'; s[0] <= 'z'; s[0]++) {\n\t\tfor (s[1] = 'a'; s[1] <= 'z'; s[1]++) {\n\t\t\tfor (s[2] = 'a'; s[2] <= 'z'; s[2]++) {\n\t\t\t\tull val = RollingHash(s).get(0, 3);\n\t\t\t\tif (st.count(val) == 0) {\n\t\t\t\t\tcout << s << endl;\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\ts = \"aaaa\";\n\tfor (s[0] = 'a'; s[0] <= 'z'; s[0]++) {\n\t\tfor (s[1] = 'a'; s[1] <= 'z'; s[1]++) {\n\t\t\tfor (s[2] = 'a'; s[2] <= 'z'; s[2]++) {\n\t\t\t\tfor (s[3] = 'a'; s[3] <= 'z'; s[3]++) {\n\t\t\t\t\tull val = RollingHash(s).get(0, 4);\n\t\t\t\t\tif (st.count(val) == 0) {\n\t\t\t\t\t\tcout << s << endl;\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":190,"memory_kb":29276,"score_of_the_acc":-0.3155,"final_rank":3},{"submission_id":"aoj_2808_9117772","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n\n#define rep(i, n) for (ll i = 0; i < n; ++i)\n#define all(v) begin(v), end(v)\n// #define BIT(n) (1LL << (n))\n#define MAX(type) numeric_limits<type>::max()\n#define MIN(type) numeric_limits<type>::min()\n#define yes cout << \"Yes\" << endl\n#define no cout << \"No\" << endl\n#define pb push_back\n#define mp make_pair\n#define fir first\n#define sec second\ntemplate <class T> using vec = vector<T>;\n\nsigned main() {\n int N;\n cin >> N;\n vec<string> S(N);\n rep(i, N) {\n cin >> S[i];\n }\n\n // 8文字以下の文字列は26+26^2+...+26^8=216'871'231'382 > 160'000'000'000\n // なので8文字以下\n\n vec<unordered_set<string>> st(8);\n rep(i, N) {\n rep(j, 8) {\n rep(k, max(0LL,(int) S[i].length() - j)) {\n st[j].insert(S[i].substr(k, j+1));\n }\n }\n }\n\n auto num_to_str = [&](int len, ll num) {\n string ans(len+1, 'a');\n rep(i, len+1) {\n ans[i] = 'a' + num % 26;\n num /= 26;\n }\n reverse(all(ans));\n return ans;\n };\n// rep(i, 100) cout << num_to_str(3, i) << endl;\n\n rep(i, 8) {\n ll pow26 = 1;\n rep(j, i+1) pow26 *= 26;\n if(pow26 == st[i].size()) {\n continue;\n } else {\n rep(j, pow26) {\n // cout << \"j = \" << j << \", str = \" << num_to_str(i, j) << endl;\n if(!st[i].count(num_to_str(i, j))) {\n cout << num_to_str(i, j) << endl;\n return 0;\n }\n }\n }\n }\n\n}","accuracy":1,"time_ms":660,"memory_kb":147056,"score_of_the_acc":-1.7143,"final_rank":15},{"submission_id":"aoj_2808_9117763","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n\n#define rep(i, n) for (ll i = 0; i < n; ++i)\n#define all(v) begin(v), end(v)\n// #define BIT(n) (1LL << (n))\n#define MAX(type) numeric_limits<type>::max()\n#define MIN(type) numeric_limits<type>::min()\n#define yes cout << \"Yes\" << endl\n#define no cout << \"No\" << endl\n#define pb push_back\n#define mp make_pair\n#define fir first\n#define sec second\ntemplate <class T> using vec = vector<T>;\n\nsigned main() {\n int N;\n cin >> N;\n vec<string> S(N);\n rep(i, N) {\n cin >> S[i];\n }\n\n // 8文字以下の文字列は26+26^2+...+26^8=216'871'231'382 > 160'000'000'000\n // なので8文字以下\n\n /*\n struct Vert {\n Vert* parent;\n map<char, Vert*> children;\n char content;\n public:\n Vert(Vert* p, map<char, vec<Vert*>> child, char c): parent(p), children(child), content(c) {}\n };\n deque<Vert*> verts;\n rep(i, N) {\n Vert* parent = nullptr;\n rep(j, 8) {\n Vert* v = new Vert(parent, {}, S[i][j]);\n verts.push_back(v);\n parent->children[S[i][j];\n }\n }\n*/\n vec<unordered_set<string>> st(8);\n rep(i, N) {\n // cout << S[i].length() << endl;\n rep(j, 8) {\n rep(k, max(0LL,(int) S[i].length() - j)) {\n st[j].insert(S[i].substr(k, j+1));\n // cout << \"i : \" << i << \", j : \" << j << \", k : \" << k << endl;\n // cout << \"insert : \" << S[i].substr(k, j+1) << endl;\n }\n }\n }\n // for(auto s : st) cout << s << endl;\n\n /*\n auto get_num = [&](string s) {\n int ans = 0;\n rep(i, s.size()) {\n ans += pow(26, i) * (s[i] - 'a');\n }\n return ans;\n };\n */\n auto num_to_str = [&](int len, ll num) {\n string ans(len+1, 'a');\n rep(i, len+1) {\n ans[i] = 'a' + num % 26;\n num /= 26;\n }\n return ans;\n };\n /*\n auto is_ok = [&](int len, int loc){\n int num = 0;\n rep(i, s[len][loc].size()) {\n num += (s[len][loc][i] - 'a' + 1) * pow(26, i);\n }\n // cout << \"loc = \" << loc << \", num = \" << num << endl;\n return loc+1 == num;\n };\n auto get_str_at = [](int len, int loc){\n string s;\n rep(i, len + 1) {\n s.push_back('a' + loc % 26);\n loc /= 26;\n }\n return s;\n };\n */\n\n rep(i, 8) {\n // cout << \"i = \" << i << \", size = \" << st[i].size() << endl;\n ll pow26 = 1;\n rep(j, i+1) pow26 *= 26;\n if(pow26 == st[i].size()) {\n continue;\n } else {\n /*\n int ok = -1, ng = st[i].size();\n while(ng - ok > 1) {\n int mid = (ng + ok) / 2;\n if(is_ok(i, mid)) ok = mid;\n else ng = mid;\n }\n cout << get_str_at(i, ng) << endl;\n break;\n */\n rep(j, pow26) {\n // cout << \"j = \" << j << \", str = \" << num_to_str(i, j) << endl;\n if(!st[i].count(num_to_str(i, j))) {\n cout << num_to_str(i, j) << endl;\n return 0;\n }\n }\n }\n }\n /*\n */\n\n}","accuracy":0.08333333333333333,"time_ms":400,"memory_kb":146744,"score_of_the_acc":-1.4025,"final_rank":20},{"submission_id":"aoj_2808_9117754","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 pii = pair<int, int>;\nusing pll = pair<ll, ll>;\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 MOD2=998244353;\nconst ld EPS=1e-9;\nconst ld PI=3.14159265358979323846;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define all(x) (x).begin(), (x).end()\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define fi first\n#define se second\n#define rep(i, n) rep2(i, 0, n)\n#define rep2(i, m, n) for (int i = m; i < (n); i++)\n#define per(i, b) per2(i, 0, b)\n#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)\n#define ALL(c) (c).begin(), (c).end()\n#define SZ(x) ((int)(x).size())\n#define nep(x) next_permutation(ALL(x))\ntemplate <class T>\nusing V = vector<T>;\ntemplate <class T>\nusing VV = V<V<T>>;\ntemplate <class T>\nusing VVV = V<VV<T>>;\ntemplate <class T>\nusing VVVV = V<VVV<T>>;\ntemplate <class T>\nusing V_p = V<pair<T,T>>;\ntemplate <class T>\nusing n_pq = priority_queue<T>;\ntemplate <class T>\nusing r_pq = priority_queue<T,vector<T>,greater<T>>;\ntemplate <class T>ostream &operator<<(ostream &o,const vector<T>&v)\n{o<<\"{\";for(int i=0;i<(int)v.size();i++)o<<(i>0?\", \":\"\")<<v[i];o<<\"}\";return o;}\ntemplate <class T>ostream &operator<<(ostream &o,const deque<T>&v)\n{o<<\"{\";for(int i=0;i<(int)v.size();i++)o<<(i>0?\", \":\"\")<<v[i];o<<\"}\";return o;}\ntemplate <class T>ostream &operator<<(ostream &o,const set<T>&v)\n{o<<\"{\";for(auto i:v)o<<\" \"<<i;o<<\"}\";return o;}\nll pow_ll(ll x, ll n) {\n long long ret = 1;\n while (n > 0) {\n if (n & 1) ret *= x; // n の最下位bitが 1 ならば x^(2^i) をかける\n x *= x;\n n >>= 1; // n を1bit 左にずらす\n }\n return ret;\n}\n\n\n////////////////////////////////////////////////////\n\nV<string> s_l;\nV<string> s_l_2;\nV<string> s_l_3;\nV<string> s_l_4;\nvoid solve1(string s) {\n\n if (s.length() == 1) {\n s_l.pb(s);\n return;\n }\n rep(i,26) {\n solve1(s+char('a' + i));\n }\n}\n\nvoid solve2(string s) {\n\n if (s.length() == 2) {\n s_l_2.pb(s);\n return;\n }\n rep(i,26) {\n solve2(s+char('a' + i));\n }\n}\n\nvoid solve3(string s) {\n\n if (s.length() == 3) {\n s_l_3.pb(s);\n return;\n }\n rep(i,26) {\n solve3(s+char('a' + i));\n }\n}\n\nvoid solve4(string s) {\n\n if (s.length() == 4) {\n s_l_4.pb(s);\n return;\n }\n rep(i,26) {\n solve4(s+char('a' + i));\n }\n}\n\nint main() {\n solve1(\"\");\n solve2(\"\");\n solve3(\"\");\n solve4(\"\");\n sort(ALL(s_l));\n sort(ALL(s_l_2));\n sort(ALL(s_l_3));\n sort(ALL(s_l_4));\n\n s_l.insert(s_l.end(), s_l_2.begin(), s_l_2.end());\n s_l.insert(s_l.end(), s_l_3.begin(), s_l_3.end());\n s_l.insert(s_l.end(), s_l_4.begin(), s_l_4.end());\n \n\n ll N,tmp;\n ll s_size;\n unordered_set<string> _set = {}; \n cin >> N;\n string T;\n rep(j,N) {\n\n string S;\n cin >> S;\n s_size = S.length();\n if (s_size+1>5) {\n tmp = 5;\n }\n else {\n tmp = s_size+1;\n }\n rep2(k,1,tmp){\n\n rep(st,s_size-k+1) {\n T = S.substr(st,k);\n _set.insert(T);\n\n }\n\n }\n }\n\n for (auto &tmp_st:s_l) {\n if (_set.count(tmp_st) == 0) {\n cout << tmp_st << endl;\n break;\n }\n }\n\n\n\n}","accuracy":1,"time_ms":210,"memory_kb":64760,"score_of_the_acc":-0.5922,"final_rank":8},{"submission_id":"aoj_2808_9117611","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <unordered_map>\nusing namespace std;\nint n;\nstring s[100005];\nunordered_map<string, bool> mp;\ntypedef long long ll;\nint main()\n{\n cin >> n;\n for (int i = 1; i <= n; ++i)\n {\n cin >> s[i];\n for (int j = 0; j < s[i].length(); ++j)\n for (int k = 1; k <= 4; ++k)\n {\n string a = \"\";\n for (int l = j; l < j + k; ++l)\n a += s[i][l];\n mp[a] = 1;\n }\n }\n for (int a = 1; a <= 26; ++a)\n {\n string tmp = \"\";\n if (a)\n tmp += a + 'a' - 1;\n if (!mp[tmp])\n {\n cout << tmp << endl;\n return 0;\n }\n }\n for (int a = 1; a <= 26; ++a)\n for (int b = 1; b <= 26; ++b)\n {\n string tmp = \"\";\n if (a)\n tmp += a + 'a' - 1;\n if (b)\n tmp += b + 'a' - 1;\n if (!mp[tmp])\n {\n cout << tmp << endl;\n return 0;\n }\n }\n for (int a = 1; a <= 26; ++a)\n for (int b = 1; b <= 26; ++b)\n for (int c = 1; c <= 26; ++c)\n {\n string tmp = \"\";\n if (a)\n tmp += a + 'a' - 1;\n if (b)\n tmp += b + 'a' - 1;\n if (c)\n tmp += c + 'a' - 1;\n if (!mp[tmp])\n {\n cout << tmp << endl;\n return 0;\n }\n }\n for (int a = 1; a <= 26; ++a)\n for (int b = 1; b <= 26; ++b)\n for (int c = 1; c <= 26; ++c)\n for (int d = 1; d <= 26; ++d)\n {\n string tmp = \"\";\n if (a)\n tmp += a + 'a' - 1;\n if (b)\n tmp += b + 'a' - 1;\n if (c)\n tmp += c + 'a' - 1;\n if (d)\n tmp += d + 'a' - 1;\n if (!mp[tmp])\n {\n cout << tmp << endl;\n return 0;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":36124,"score_of_the_acc":-0.3286,"final_rank":4},{"submission_id":"aoj_2808_9117586","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n//高速化 \nstruct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;\n//#define endl '\\n' //インタラクティブ問題の時は消す\n\n//型\nusing ll = long long;\nusing ld = long double;\ntemplate<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;\nusing vi = vc<int>; using vvi = vvc<int>; using vvvi = vvvc<int>;\nusing vl = vc<ll>; using vvl = vvc<ll>; using vvvl = vvvc<ll>;\nusing pi = pair<int, int>; using pl = pair<ll, ll>;\nusing ull = unsigned ll;\ntemplate<class T>using priq = priority_queue<T>;\ntemplate<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;\n\n// for文\n#define overload4(a, b, c, d, e, ...) e\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, step) for(ll i = a; i < b; i+= step)\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define per1(n) for(ll i = n-1; i >= 0; i--)\n#define per2(i, n) for(ll i = n-1; i >= 0; i--)\n#define per3(i, a, b) for(ll i = b-1; i >= a; i--)\n#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)\n#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)\n#define fore1(a) for(auto&& i : a)\t\n#define fore2(i,a) for(auto&& i : a)\n#define fore3(x,y,a) for(auto&& [x, y] : a)\n#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)\n#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)\n\n//関数\n#define mp make_pair\n#define mt make_tuple\n#define a first\n#define b second\n#define pb emplace_back\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define si(x) (ll)(x).size()\ntemplate<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}\ninline bool chmin(string& a, string b){\n if(a.size() > b.size()) {\n a = b;\n return true;\n }\n return a > b && ( a = b , true);\n}\ntemplate<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}\ntemplate<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}\ntemplate<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}\ntemplate<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}\ntemplate<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}\n\n//入出力(operator)\ntemplate<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}\ntemplate<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}\n\ntemplate<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<\" \"<<a.b;}\ntemplate<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<\" \";}return os;}\ntemplate<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<\" \";}return os;}\ntemplate<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<\" \"<<y<<\"\\n\";}return os;}\ntemplate<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<\" \";}return os;}\ntemplate<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<\" \"<<y<<\"\\n\";}return os;}\ntemplate<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<\" \";return os;}\ntemplate<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<\"\\n\";return os;}\n\n//入出力(関数)\nvi readvi(ll n){vi a(n);cin>>a;return a;}\nvl readvl(ll n){vl a(n);cin>>a;return a;}\nvvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].pb(b);if(bidirected)g[b].pb(a);}return g;}\nvvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].pb(b,c);if(bidirected)g[b].pb(a,c);}return g;}\nvvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}\nvvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}\n\ninline void yes(){cout << \"Yes\\n\";}\ninline void no(){cout << \"No\\n\";}\ninline void yesno(bool y = true){if(y)yes();else no();}\n\n//定数\nconstexpr ll mod = 998244353;\nconstexpr ll minf=-(1<<29);\nconstexpr ll inf=(1<<29);\nconstexpr ll MINF=-(1LL<<60);\nconstexpr ll INF=(1LL<<60);\nconstexpr ld EPS = 1e-8;\nconst ld PI = acosl(-1);\n#define equals(a, b) (abs((a) - (b)) < EPS)\nconst int dx[4] ={-1, 0, 1, 0};\nconst int dy[4] ={ 0, 1, 0,-1};\nconst int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};\nconst int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};\n\nvoid solve();\nint main() {\n\tint t = 1;\n // cin >>t;\n while(t--)solve();\n}\n\n\n\nvoid solve(){\n int n;\n cin >> n;\n string s;\n set<string> st;\n rep(i,n){\n cin >> s;\n rep(j,si(s)){\n string t = \"\";\n rep(k,5){\n if(j + k >= si(s))break;\n t += s[(j + k)];\n st.insert(t);\n }\n }\n }\n\n\n string ans = \"xxxxxxxx\";\n rep(i1,26){\n string t1 = string(1, 'a' + i1);\n if(st.find(t1) == st.end()) chmin(ans,t1);\n rep(i2,26){\n if(ans.size() < 2)break;\n string t2 = t1 + char('a' + i2);\n if(st.find(t2) == st.end()) chmin(ans,t2);\n rep(i3,26){\n if(ans.size() < 3)break;\n string t3 = t2 + char('a' + i3);\n if(st.find(t3) == st.end()) chmin(ans,t3);\n rep(i4,26){\n if(ans.size() < 4)break;\n string t4 = t3 + char('a' + i4);\n if(st.find(t4) == st.end()) chmin(ans,t4);\n rep(i5,26){\n if(ans.size() < 5)break;\n string t5 = t4 + char('a' + i5);\n if(st.find(t5) == st.end()) chmin(ans,t5);\n }\n }\n }\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":900,"memory_kb":67392,"score_of_the_acc":-1.4324,"final_rank":14},{"submission_id":"aoj_2808_9117578","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i, n) for(ll i = 0;i < n;i++)\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\n#define ll long long\n#define INF (ll)1ll << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(),n.end()\n#define MOD (ll)1000000007\n#define P pair<ll, ll>\n\nmap<string, ll> mp;\n\nbool ok = false;\nstring ans = \"\";\nvoid dfs(ll a, ll b){\n if(a == b){\n if(mp[ans] == 0){\n ok = true;\n }\n return;\n }\n if (ok) return;\n REP(i, 26){\n ans += 'a' + i;\n dfs(a + 1, b);\n if (ok) return;\n ans.pop_back();\n }\n}\nint main(){\n ll n;\n cin >> n;\n REP(i, n){\n string s;\n cin >> s;\n REP(j, 4){\n if((ll)s.size() - j <= 0)continue;\n REP(k, (ll)s.size() - j){\n mp[s.substr(k, j + 1)]++;\n }\n }\n }\n bool ok = false;\n REPO(i, 4){\n if (ok) break;\n dfs(0, i);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":340,"memory_kb":35956,"score_of_the_acc":-0.5417,"final_rank":5},{"submission_id":"aoj_2808_9117526","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i, n) for(ll i = 0;i < n;i++)\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\n#define ll long long\n#define INF (ll)1ll << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(),n.end()\n#define MOD (ll)1000000007\n#define P pair<ll, ll>\n\nmap<string, ll> mp;\n\nbool ok = false;\nstring ans = \"\";\nvoid dfs(ll a, ll b){\n if(a == b){\n if(mp[ans] == 0){\n ok = true;\n }\n return;\n }\n if (ok) return;\n REP(i, 26){\n ans += 'a' + i;\n dfs(a + 1, b);\n if (ok) return;\n ans.pop_back();\n }\n}\nint main(){\n ll n;\n cin >> n;\n REP(i, n){\n string s;\n cin >> s;\n REP(j, 4){\n REP(k, s.size() - j){\n mp[s.substr(k, j + 1)]++;\n }\n }\n }\n bool ok = false;\n REPO(i, 4){\n if (ok) break;\n dfs(0, i);\n }\n cout << ans << endl;\n}","accuracy":0.25,"time_ms":220,"memory_kb":35748,"score_of_the_acc":-0.3973,"final_rank":16},{"submission_id":"aoj_2808_5967060","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\";}\ntemplate<class T> struct RollingHash{\n using ull=unsigned long long int;\n const ull M=(1ull<<61)-1;\n const ull mask30 = (1ull << 30) - 1;\n const ull mask31 = (1ull << 31) - 1;\n const ull mask61 =M;\n vector<ull> hash,pows;\n ull base;\n\n // mod 2^61-1\n ull cal_mod(ull x){\n ull xu=(x>>61);\n ull xd=(x&mask61);\n ull res=xu+xd;\n if(res>=M)res-=M;\n return res;\n }\n\n //a*b mod 2^61-1\n ull mul(ull a,ull b){\n ull au=(a>>31),bu=(b>>31);\n ull ad=(a&mask31),bd=(b&mask31);\n ull mid=ad*bu+au*bd;\n ull midu=(mid>>30);\n ull midd=(mid&mask30);\n return cal_mod(au*bu*2+midu+(midd<<31)+ad*bd);\n }\n\n\n RollingHash(const T &a,ull base):hash(a.size()+1,0),pows(a.size()+1,1),base(base){\n\t\tfor(int i = 0; i <int (a.size()); i++) {\n pows[i + 1] =mul(pows[i], base);\n hash[i + 1] =cal_mod(mul(hash[i], base) + ull(a[i]));\n if(hash[i+1]>=M)hash[i+1]-=M;\n\t\t}\n }\n ull get_hash(const T &a){\n ull res=0;\n \tfor(int i = 0; i <int (a.size()); i++) {\n res =cal_mod(mul(res, base) + ull(a[i]));\n if(res>=M)res-=M;\n\t\t}\n return res;\n }\n //[b1,b1+len)と[b2,b2+len)が一致するかどうか\n bool match(int b1, int b2,int len){\n ull h1 = cal_mod(hash[b1+len]+M-mul(hash[b1], pows[len]));\n ull h2 = cal_mod(hash[b2 + len]+M-mul(hash[b2],pows[len]));\n return (h1 == h2);\n }\n //[l,l+len)のハッシュ値\n ull get(int l, int len){\n return cal_mod(hash[l+len] + M - mul(hash[l], pows[len]));\n }\n};\nconstexpr int Hash_Num=2;\nstruct base_t{\n int use[Hash_Num];\n int &operator[](int i){return use[i];}\n base_t(){\n mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n for(int i=0;i<Hash_Num;i++)use[i]=rnd()%10000+26;\n }\n}bases;\nusing ull=unsigned long long;\nint main(){\n int n;\n cin>>n;\n string s;\n cin>>s;\n for(int i=0;i<n;i++){\n string t;cin>>t;\n s+=t;\n s.push_back('$');\n }\n RollingHash<string> rh(s,bases[0]);\n int m=s.size();\n V<ull> v;\n v.emplace_back((1ull<<62)-1);\n for(int i=0;i<m;i++){\n string t=\"\";\n for(int j=0;j<4&&i+j<m;j++){\n v.emplace_back(rh.get(i,j+1));\n }\n }\n sort(all(v));\n v.erase(unique(all(v)),v.end());\n string ans=\"zzzzz\";\n auto calc=[&](string &tmp)->void{\n if(ans.size()>tmp.size())ans=tmp;\n else chmin(ans,tmp);\n };\n string tmp=\"\";\n for(char i='a';i<='z';i++){\n tmp.push_back(i);\n ull h=rh.get_hash(tmp);\n if(*lower_bound(all(v),h)!=h)calc(tmp);\n for(char j='a';j<='z';j++){\n tmp.push_back(j);\n h=rh.get_hash(tmp); \n if(*lower_bound(all(v),h)!=h)calc(tmp);\n for(char k='a';k<='z';k++){\n tmp.push_back(k);\n h=rh.get_hash(tmp); \n if(*lower_bound(all(v),h)!=h)calc(tmp); \n for(char r='a';r<='z';r++){\n tmp.push_back(r);\n h=rh.get_hash(tmp); \n if(*lower_bound(all(v),h)!=h)calc(tmp); \n tmp.pop_back(); \n }\n tmp.pop_back(); \n } \n tmp.pop_back(); \n }\n tmp.pop_back(); \n }\n cout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":110,"memory_kb":29404,"score_of_the_acc":-0.2212,"final_rank":1},{"submission_id":"aoj_2808_5152471","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = 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 rep(i, a, b) for (ll i=(a); i<(b); i++)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define tostr to_string\n#define ALL(A) A.begin(), A.end()\n#define elif else if\n// constexpr ll INF = LONG_LONG_MAX;\nconstexpr ll INF = 1e18;\nconstexpr ll MOD = 1000000007;\n\nconst string digits = \"0123456789\";\nconst string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\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\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\n\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\n'; }\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\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(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\n' : ' '); } }\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\n\nvoid Yes() { print(\"Yes\"); }\nvoid No() { print(\"No\"); }\nvoid YES() { print(\"YES\"); }\nvoid NO() { print(\"NO\"); }\n\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; } }\npll divmod(ll a, ll 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; }\n\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\n\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; }\nint ord(char c) { return (int)c; }\nchar chr(int a) { return (char)a; }\n\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, 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; }\n\nint popcount(ll S) { return __builtin_popcountll(S); }\nll gcd(ll a, ll b) { return __gcd(a, b); }\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\n\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\n\nstring dton(ll num, ll n, char base='0') {\n string res;\n while (abs(num) > 0) {\n ll m = num % abs(n);\n num -= m;\n res += base+m;\n num /= n;\n }\n reverse(ALL(res));\n if (res != \"\") {\n return res;\n } else {\n return res+base;\n }\n}\n\nstring replace(string str, const string& replace, const string& with) {\n if(!replace.empty()) {\n size_t pos = 0;\n while ((pos = str.find(replace, pos)) != string::npos) {\n str.replace(pos, replace.length(), with);\n pos += with.length();\n }\n }\n return str;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll N;\n cin >> N;\n set<string> se;\n rep(_, 0, N) {\n string s;\n cin >> s;\n rep(d, 1, 5) {\n if (s.size() < d) break;\n rep(i, 0, s.size()-d+1) {\n se.insert(s.substr(i, d));\n }\n }\n }\n\n rep(n, 1, 5) {\n vector<string> v;\n auto rec = [&](auto&& f, string cur, ll i) {\n if (i == n) {\n v.pb(cur);\n return;\n }\n for (char c : ascii_lowercase) {\n f(f, cur+c, i+1);\n }\n };\n rec(rec, \"\", 0);\n for (auto s : v) {\n if (!se.count(s)) {\n print(s);\n return 0;\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":380,"memory_kb":52720,"score_of_the_acc":-0.7088,"final_rank":9},{"submission_id":"aoj_2808_5152461","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = 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 rep(i, a, b) for (ll i=(a); i<(b); i++)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define tostr to_string\n#define ALL(A) A.begin(), A.end()\n#define elif else if\n// constexpr ll INF = LONG_LONG_MAX;\nconstexpr ll INF = 1e18;\nconstexpr ll MOD = 1000000007;\n\nconst string digits = \"0123456789\";\nconst string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\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\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\n\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\n'; }\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\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(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\n' : ' '); } }\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\n\nvoid Yes() { print(\"Yes\"); }\nvoid No() { print(\"No\"); }\nvoid YES() { print(\"YES\"); }\nvoid NO() { print(\"NO\"); }\n\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; } }\npll divmod(ll a, ll 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; }\n\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\n\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; }\nint ord(char c) { return (int)c; }\nchar chr(int a) { return (char)a; }\n\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, 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; }\n\nint popcount(ll S) { return __builtin_popcountll(S); }\nll gcd(ll a, ll b) { return __gcd(a, b); }\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\n\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\n\nstring dton(ll num, ll n, char base='0') {\n string res;\n while (abs(num) > 0) {\n ll m = num % abs(n);\n num -= m;\n res += base+m;\n num /= n;\n }\n reverse(ALL(res));\n if (res != \"\") {\n return res;\n } else {\n return res+base;\n }\n}\n\nstring replace(string str, const string& replace, const string& with) {\n if(!replace.empty()) {\n size_t pos = 0;\n while ((pos = str.find(replace, pos)) != string::npos) {\n str.replace(pos, replace.length(), with);\n pos += with.length();\n }\n }\n return str;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll N;\n cin >> N;\n set<string> se;\n rep(_, 0, N) {\n string s;\n cin >> s;\n rep(d, 1, 5) {\n if (s.size() < d) break;\n rep(i, 0, s.size()-d+1) {\n se.insert(s.substr(i, d));\n }\n }\n }\n\n ll d = 0;\n while (1) {\n auto ans = dton(d, 27, '`');\n ans = replace(ans, \"`\", \"\");\n if (!ans.empty()) {\n if (!se.count(ans)) {\n print(ans);\n break;\n }\n }\n d++;\n }\n return 0;\n}","accuracy":1,"time_ms":360,"memory_kb":35996,"score_of_the_acc":-0.5658,"final_rank":7},{"submission_id":"aoj_2808_5152377","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = 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 rep(i, a, b) for (ll i=(a); i<(b); i++)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define tostr to_string\n#define ALL(A) A.begin(), A.end()\n#define elif else if\n// constexpr ll INF = LONG_LONG_MAX;\nconstexpr ll INF = 1e18;\nconstexpr ll MOD = 1000000007;\n\nconst string digits = \"0123456789\";\nconst string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\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\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\n\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\n'; }\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\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(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\n' : ' '); } }\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\n\nvoid Yes() { print(\"Yes\"); }\nvoid No() { print(\"No\"); }\nvoid YES() { print(\"YES\"); }\nvoid NO() { print(\"NO\"); }\n\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; } }\npll divmod(ll a, ll 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; }\n\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\n\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; }\nint ord(char c) { return (int)c; }\nchar chr(int a) { return (char)a; }\n\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, 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; }\n\nint popcount(ll S) { return __builtin_popcountll(S); }\nll gcd(ll a, ll b) { return __gcd(a, b); }\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\n\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\n\nstruct RollingHash {\n static const uint64_t mod = (1ull << 61ull) - 1;\n using uint128_t = __uint128_t;\n vector< uint64_t > power;\n const uint64_t base;\n\n static inline uint64_t add(uint64_t a, uint64_t b) {\n if((a += b) >= mod) a -= mod;\n return a;\n }\n\n static inline uint64_t mul(uint64_t a, uint64_t b) {\n uint128_t c = (uint128_t) a * b;\n return add(c >> 61, c & mod);\n }\n\n // 2^61-1以下の乱数を返す。これをbaseとするとHackされにくい\n static inline uint64_t generate_base() {\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\n uniform_int_distribution< uint64_t > rand(1, RollingHash::mod - 1);\n return rand(mt);\n }\n\n inline void expand(size_t sz) {\n if(power.size() < sz + 1) {\n int pre_sz = (int) power.size();\n power.resize(sz + 1);\n for(int i = pre_sz - 1; i < sz; i++) {\n power[i + 1] = mul(power[i], base);\n }\n }\n }\n\n // 基数baseのローリングハッシュを構築する\n explicit RollingHash(uint64_t base = generate_base()) : base(base), power{1} {}\n\n // 文字列sのハッシュテーブルを返す：O(n)\n vector< uint64_t > build(const string &s) const {\n int sz = s.size();\n vector< uint64_t > hashed(sz + 1);\n for(int i = 0; i < sz; i++) {\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n return hashed;\n }\n\n template< typename T >\n vector< uint64_t > build(const vector< T > &s) const {\n int sz = s.size();\n vector< uint64_t > hashed(sz + 1);\n for(int i = 0; i < sz; i++) {\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n return hashed;\n }\n\n // sの区間[l,r)のハッシュ値を返す：O(1)\n uint64_t query(const vector< uint64_t > &s, int l, int r) {\n expand(r - l);\n return add(s[r], mod - mul(s[l], power[r - l]));\n }\n\n // ハッシュ値h1と長さh2lenのハッシュ値h2を結合する\n uint64_t combine(uint64_t h1, uint64_t h2, size_t h2len) {\n expand(h2len);\n return add(mul(h1, power[h2len]), h2);\n }\n\n // ハッシュテーブルaの区間[l1,r1)と、ハッシュテーブルbの区間[l2,r2)の文字列の最長共通接頭辞の長さを返す：O(logn)\n int lcp(const vector< uint64_t > &a, int l1, int r1, const vector< uint64_t > &b, int l2, int r2) {\n int len = min(r1 - l1, r2 - l2);\n int low = 0, high = len + 1;\n while(high - low > 1) {\n int mid = (low + high) / 2;\n if(query(a, l1, l1 + mid) == query(b, l2, l2 + mid)) low = mid;\n else high = mid;\n }\n return low;\n }\n};\n\nstring dton(ll num, ll n) {\n string res;\n while (abs(num) > 0) {\n ll m = num % abs(n);\n num -= m;\n res += '`'+m;\n num /= n;\n }\n reverse(ALL(res));\n if (res != \"\") {\n return res;\n } else {\n return \"`\";\n }\n}\n\nstring replace(string str, const string& replace, const string& with) {\n if(!replace.empty()) {\n size_t pos = 0;\n while ((pos = str.find(replace, pos)) != string::npos) {\n str.replace(pos, replace.length(), with);\n pos += with.length();\n }\n }\n return str;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll N;\n cin >> N;\n RollingHash rh;\n vector<string> A(N);\n set<uint64_t> se;\n rep(_, 0, N) {\n string s;\n cin >> s;\n auto table = rh.build(s);\n rep(d, 1, 5) {\n if (s.size() < d) break;\n rep(i, 0, s.size()-d+1) {\n auto hash = rh.query(table, i, i+d);\n se.insert(hash);\n }\n }\n }\n\n ll d = 0;\n while (1) {\n auto ans = dton(d, 27);\n ans = replace(ans, \"`\", \"\");\n if (ans.empty()) {\n d++;\n continue;\n }\n auto s_hash = rh.query(rh.build(ans), 0, ans.size());\n if (!se.count(s_hash)) {\n print(ans);\n break;\n }\n d++;\n }\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":26188,"score_of_the_acc":-0.2935,"final_rank":2},{"submission_id":"aoj_2808_5152244","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = 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 rep(i, a, b) for (ll i=(a); i<(b); i++)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define tostr to_string\n#define ALL(A) A.begin(), A.end()\n#define elif else if\n// constexpr ll INF = LONG_LONG_MAX;\nconstexpr ll INF = 1e18;\nconstexpr ll MOD = 1000000007;\n\nconst string digits = \"0123456789\";\nconst string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\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\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\n\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\n'; }\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\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(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\n' : ' '); } }\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\n\nvoid Yes() { print(\"Yes\"); }\nvoid No() { print(\"No\"); }\nvoid YES() { print(\"YES\"); }\nvoid NO() { print(\"NO\"); }\n\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; } }\npll divmod(ll a, ll 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; }\n\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\n\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; }\nint ord(char c) { return (int)c; }\nchar chr(int a) { return (char)a; }\n\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, 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; }\n\nint popcount(ll S) { return __builtin_popcountll(S); }\nll gcd(ll a, ll b) { return __gcd(a, b); }\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\n\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\n\nstruct RollingHash {\n static const uint64_t mod = (1ull << 61ull) - 1;\n using uint128_t = __uint128_t;\n vector< uint64_t > power;\n const uint64_t base;\n\n static inline uint64_t add(uint64_t a, uint64_t b) {\n if((a += b) >= mod) a -= mod;\n return a;\n }\n\n static inline uint64_t mul(uint64_t a, uint64_t b) {\n uint128_t c = (uint128_t) a * b;\n return add(c >> 61, c & mod);\n }\n\n // 2^61-1以下の乱数を返す。これをbaseとするとHackされにくい\n static inline uint64_t generate_base() {\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\n uniform_int_distribution< uint64_t > rand(1, RollingHash::mod - 1);\n return rand(mt);\n }\n\n inline void expand(size_t sz) {\n if(power.size() < sz + 1) {\n int pre_sz = (int) power.size();\n power.resize(sz + 1);\n for(int i = pre_sz - 1; i < sz; i++) {\n power[i + 1] = mul(power[i], base);\n }\n }\n }\n\n // 基数baseのローリングハッシュを構築する\n explicit RollingHash(uint64_t base = generate_base()) : base(base), power{1} {}\n\n // 文字列sのハッシュテーブルを返す：O(n)\n vector< uint64_t > build(const string &s) const {\n int sz = s.size();\n vector< uint64_t > hashed(sz + 1);\n for(int i = 0; i < sz; i++) {\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n return hashed;\n }\n\n template< typename T >\n vector< uint64_t > build(const vector< T > &s) const {\n int sz = s.size();\n vector< uint64_t > hashed(sz + 1);\n for(int i = 0; i < sz; i++) {\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n return hashed;\n }\n\n // sの区間[l,r)のハッシュ値を返す：O(1)\n uint64_t query(const vector< uint64_t > &s, int l, int r) {\n expand(r - l);\n return add(s[r], mod - mul(s[l], power[r - l]));\n }\n\n // ハッシュ値h1と長さh2lenのハッシュ値h2を結合する\n uint64_t combine(uint64_t h1, uint64_t h2, size_t h2len) {\n expand(h2len);\n return add(mul(h1, power[h2len]), h2);\n }\n\n // ハッシュテーブルaの区間[l1,r1)と、ハッシュテーブルbの区間[l2,r2)の文字列の最長共通接頭辞の長さを返す：O(logn)\n int lcp(const vector< uint64_t > &a, int l1, int r1, const vector< uint64_t > &b, int l2, int r2) {\n int len = min(r1 - l1, r2 - l2);\n int low = 0, high = len + 1;\n while(high - low > 1) {\n int mid = (low + high) / 2;\n if(query(a, l1, l1 + mid) == query(b, l2, l2 + mid)) low = mid;\n else high = mid;\n }\n return low;\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll N;\n cin >> N;\n RollingHash rh;\n vector<string> A(N);\n vector<vector<uint64_t>> tables(N);\n rep(i, 0, N) {\n cin >> A[i];\n tables[i] = rh.build(A[i]);\n }\n\n string ans = \"\";\n bool ok = 0;\n while (!ok) {\n for (char c : ascii_lowercase) {\n auto s_hash = rh.query(rh.build(ans+c), 0, ans.size()+1);\n ok = 1;\n rep(i, 0, N) {\n if (A[i].size() < ans.size()) continue;\n rep(j, 0, A[i].size()-ans.size()) {\n auto t_hash = rh.query(tables[i], j, j+ans.size()+1);\n if (s_hash == t_hash) {\n ok = 0;\n break;\n }\n }\n if (!ok) break;\n }\n if (ok) {\n ans += c;\n break;\n }\n }\n if (!ok) ans += 'a';\n } \n print(ans);\n return 0;\n}","accuracy":0.08333333333333333,"time_ms":60,"memory_kb":6716,"score_of_the_acc":0,"final_rank":17},{"submission_id":"aoj_2808_5057332","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, 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);\n\tVS s = in[n];\n\n\tset<string> substr;\n\trep(i, n) {\n\t\tFOR(len, 1, 5) {\n\t\t\trep(l, sz(s[i]) - len + 1) {\n\t\t\t\tsubstr.insert(s[i].substr(l, len));\n\t\t\t}\n\t\t}\n\t}\n\n\tstring str;\n\tauto dfs = [&](auto&& f, int len) -> void {\n\t\tif (sz(str) == len) {\n\t\t\tif (!substr.count(str)) {\n\t\t\t\tout.exit(str);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tfor (char c : step('a', '{')) {\n\t\t\tstr += c;\n\t\t\tf(f, len);\n\t\t\tstr.pop_back();\n\t\t}\n\t};\n\tFOR(len, 1, 5) {\n\t\tdfs(dfs, len);\n\t}\n}","accuracy":1,"time_ms":340,"memory_kb":36116,"score_of_the_acc":-0.5428,"final_rank":6},{"submission_id":"aoj_2808_3992937","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<string>s(N);\n\tfor (auto &i : s)cin >> i;\n\tfor (int i = 1; i <= 5; i++) {\n\t\tset<string>st;\n\t\tstring t(i, 'a');\n\t\twhile (t[0] <= 'z') {\n\t\t\tst.insert(t);\n\t\t\tt.back()++;\n\t\t\tint cnt = i - 1;\n\t\t\twhile (cnt&&t[cnt] > 'z') {\n\t\t\t\tt[cnt--] = 'a';\n\t\t\t\tt[cnt]++;\n\t\t\t}\n\t\t}\n\t\tfor (auto j : s) {\n\t\t\tfor (int k = 0; k + i <= j.size(); k++) {\n\t\t\t\tstring u;\n\t\t\t\tfor (int l = 0; l < i; l++) {\n\t\t\t\t\tu.push_back(j[k + l]);\n\t\t\t\t}\n\t\t\t\tst.erase(u);\n\t\t\t}\n\t\t}\n\t\tif (!st.empty()) {\n\t\t\tcout << *st.begin() << endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":630,"memory_kb":50632,"score_of_the_acc":-0.9915,"final_rank":13},{"submission_id":"aoj_2808_3991411","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<string>s(N);\n\tfor (auto &i : s)cin >> i;\n\tfor (int i = 1; i <= 5; i++) {\n\t\tset<string>st;\n\t\tstring t(i, 'a');\n\t\twhile (t[0] <= 'z') {\n\t\t\tst.insert(t);\n\t\t\tt.back()++;\n\t\t\tint cnt = i - 1;\n\t\t\twhile (cnt&&t[cnt] > 'z') {\n\t\t\t\tt[cnt--] = 'a';\n\t\t\t\tt[cnt]++;\n\t\t\t}\n\t\t}\n\t\tfor (auto j : s) {\n\t\t\tfor (int k = 0; k + i <= j.size(); k++) {\n\t\t\t\tstring u;\n\t\t\t\tfor (int l = 0; l < i; l++) {\n\t\t\t\t\tu.push_back(j[k + l]);\n\t\t\t\t}\n\t\t\t\tst.erase(u);\n\t\t\t}\n\t\t}\n\t\tif (!st.empty()) {\n\t\t\tcout << *st.begin() << endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":630,"memory_kb":50620,"score_of_the_acc":-0.9914,"final_rank":12},{"submission_id":"aoj_2808_3878417","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n// #define double long double\n#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)\n#define FORR(i, a, b) for(ll i = (a); i > (b); --i)\n#define REP(i, n) for(ll i = 0; i < (n); ++i)\n#define REPR(i, n) for(ll i = n; i >= 0; i--)\n#define FOREACH(x, a) for(auto &(x) : (a))\n#define VECCIN(x) \\\n for(auto &youso_ : (x)) cin >> youso_\n#define bitcnt(x) __builtin_popcount(x)\n#define lbit(x) __builtin_ffsll(x)\n#define rbit(x) __builtin_clzll(x)\n#define SZ(x) ((ll)(x).size())\n#define fi first\n#define se second\n#define All(a) (a).begin(), (a).end()\n#define rAll(a) (a).rbegin(), (a).rend()\n\ntemplate <typename T = long long> inline T IN() {\n T x;\n cin >> x;\n return (x);\n}\ninline void CIN() {}\ntemplate <class Head, class... Tail>\ninline void CIN(Head &&head, Tail &&... tail) {\n cin >> head;\n CIN(move(tail)...);\n}\n#define CCIN(...) \\\n char __VA_ARGS__; \\\n CIN(__VA_ARGS__)\n#define DCIN(...) \\\n double __VA_ARGS__; \\\n CIN(__VA_ARGS__)\n#define LCIN(...) \\\n ll __VA_ARGS__; \\\n CIN(__VA_ARGS__)\n#define SCIN(...) \\\n string __VA_ARGS__; \\\n CIN(__VA_ARGS__)\n#define Yes(a) cout << (a ? \"Yes\" : \"No\") << \"\\n\"\n#define YES(a) cout << (a ? \"YES\" : \"NO\") << \"\\n\"\n#define Printv(v) \\\n { \\\n FOREACH(x, v) { cout << x << \" \"; } \\\n cout << \"\\n\"; \\\n }\ntemplate <typename T = string> inline void eputs(T s) {\n cout << s << \"\\n\";\n exit(0);\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 <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T> using PQ = priority_queue<T>;\n\ntypedef long long ll;\ntypedef vector<ll> VL;\ntypedef vector<VL> VVL;\ntypedef pair<ll, ll> PL;\ntypedef vector<PL> VPL;\ntypedef vector<bool> VB;\ntypedef vector<double> VD;\ntypedef vector<string> VS;\n\nconst int INF = 1e9;\nconst int MOD = 1e9 + 7;\n// const int MOD = 998244353;\nconst ll LINF = 5e18;\n// const double PI = atan(1.0) * 4.0;\nconst ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};\nconst ll dy[] = {0, 1, 1, 1, 0, -1, -1, -1};\n#define PI 3.141592653589793238\n\n// ローリングハッシュ\n// 二分探索で LCP を求める機能つき\nstruct RollingHash {\n static const int base1 = 1007, base2 = 2009;\n static const int mod1 = 1000000007, mod2 = 1000000009;\n vector<long long> hash1, hash2, power1, power2;\n\n // construct\n RollingHash(const string &S) {\n int n = (int)S.size();\n hash1.assign(n + 1, 0);\n hash2.assign(n + 1, 0);\n power1.assign(n + 1, 1);\n power2.assign(n + 1, 1);\n for(int i = 0; i < n; ++i) {\n hash1[i + 1] = (hash1[i] * base1 + S[i]) % mod1;\n hash2[i + 1] = (hash2[i] * base2 + S[i]) % mod2;\n power1[i + 1] = (power1[i] * base1) % mod1;\n power2[i + 1] = (power2[i] * base2) % mod2;\n }\n }\n\n // get hash of S[left:right]\n inline pair<long long, long long> get(int l, int r) const {\n long long res1 = hash1[r] - hash1[l] * power1[r - l] % mod1;\n if(res1 < 0) res1 += mod1;\n long long res2 = hash2[r] - hash2[l] * power2[r - l] % mod2;\n if(res2 < 0) res2 += mod2;\n return {res1, res2};\n }\n\n // get lcp of S[a:] and T[b:]\n inline int getLCP(int a, int b) const {\n int len = min((int)hash1.size() - a, (int)hash1.size() - b);\n int low = 0, high = len;\n while(high - low > 1) {\n int mid = (low + high) >> 1;\n if(get(a, a + mid) != get(b, b + mid))\n high = mid;\n else\n low = mid;\n }\n return low;\n }\n};\n\nbool inc(int l, string &s) {\n for(int i = l - 1; i >= 0; --i) {\n if(s[i] != 'z') {\n s[i]++;\n return true;\n }\n s[i] = 'a';\n }\n return false;\n}\n\nsigned main() {\n LCIN(N);\n set<string> st;\n REP(i, N) {\n SCIN(S);\n REP(j, S.length()) {\n FOR(len, 1, 5) {\n if(j + len > S.length()) continue;\n st.emplace(S.substr(j, len));\n }\n }\n }\n REP(i, 27) REP(j, 27) REP(k, 27) REP(l, 26) {\n string t;\n if(i) t += 'a' - 1 + i;\n if(j) t += 'a' - 1 + j;\n if(k) t += 'a' - 1 + k;\n t += 'a' + l;\n if(!st.count(t)) eputs(t);\n }\n}","accuracy":1,"time_ms":520,"memory_kb":42472,"score_of_the_acc":-0.8024,"final_rank":10},{"submission_id":"aoj_2808_3844436","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\n#include <tuple>\n#include <iomanip>\n#include <cstring>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n#define rep(i, n) for(ll i = 0; i < (n); i++)\n#define revrep(i, n) for(ll i = (n-1); i >= 0; i--)\n#define pb push_back\n#define f first\n#define s second\nll max(ll a, ll b){return (a > b) ? a : b;}\nll min(ll a, ll b){return (a < b) ? a : b;}\nll max3(ll a, ll b, ll c){return max(a, max(b, c));};\nll min3(ll a, ll b, ll c){return min(a, min(b, c));};\nll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};\nll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};\nll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};\nll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};\n\nconst ll INFL = 1LL << 60;//10^18 = 2^60\nconst int INF = 1 << 30;//10^9\nll MOD = 1000000007;\n//ll MOD = 998244353;\nvector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};\nvector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};\n\nll pow_long(ll x, ll k){\n ll res = 1;\n while(k > 0){\n if(k % 2) res *= x;\n x *= x;\n k /= 2;\n }\n return res;\n}\nll pow_mod(ll x, ll k){\n x %= MOD; x += MOD; x %= MOD;\n ll res = 1;\n while(k > 0){\n if(k % 2){\n res *= x; res %= MOD;\n }\n x *= x; x %= MOD;\n k /= 2;\n }\n return res;\n}\n\nll inverse(ll x){return pow_mod(x, MOD - 2);};\n\nll gcd(ll a, ll b){\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\nll lcm(ll x, ll y){return x / gcd(x, y) * y;};\n\nll kai_mod(ll x){\n if(x == 0) return 1;\n return x * kai_mod(x-1) % MOD;\n}\n\n/*\n//コンビネーション\nconst int MAXcomb = 200010;\nll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];\n//facはn!,finvは1/n!\n//invは逆元\nvoid COMinit(){\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(int i = 2; i < MAXcomb; 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 comb(int n, int k){\n if(n < k) return 0;\n if(n < 0 || k < 0) return 0;\n return fac[n] * finv[k] % MOD * finv[n-k] % MOD;\n}\n*/\n\nint main(){\n ll N;\n cin >> N;\n set<pair<ll, ll>> hashList;\n ll base = 998244353;\n rep(i, N){\n string S;\n cin >> S;\n ll sl = S.size();\n for(ll i = 1; i <= 5; i++){\n ll hash = 0;\n rep(j, i) hash = (hash * base + S[j]) % MOD;\n hashList.insert({i, hash});\n ll power = pow_mod(base, i);\n rep(j, sl-i){\n hash = ((hash * base - S[j] * power + S[i+j]) % MOD + MOD) % MOD;\n hashList.insert({i, hash});\n }\n }\n }\n for(ll i = 1;;i++){\n rep(j, pow_long(26, i)){\n vector<ll> x(i);\n ll J = j;\n rep(k, i){\n x[k] = J % 26;\n J /= 26;\n }\n reverse(x.begin(), x.end());\n string P = \"\";\n ll hashP = 0;\n rep(k, i){\n P += 'a' + x[k];\n hashP = (hashP * base + x[k] + 'a') % MOD;\n }\n if(hashList.count({i, hashP})) continue;\n cout << P << endl;\n return 0;\n }\n }\n}","accuracy":1,"time_ms":530,"memory_kb":54204,"score_of_the_acc":-0.8979,"final_rank":11},{"submission_id":"aoj_2808_3844435","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\n#include <tuple>\n#include <iomanip>\n#include <cstring>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n#define rep(i, n) for(ll i = 0; i < (n); i++)\n#define revrep(i, n) for(ll i = (n-1); i >= 0; i--)\n#define pb push_back\n#define f first\n#define s second\nll max(ll a, ll b){return (a > b) ? a : b;}\nll min(ll a, ll b){return (a < b) ? a : b;}\nll max3(ll a, ll b, ll c){return max(a, max(b, c));};\nll min3(ll a, ll b, ll c){return min(a, min(b, c));};\nll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};\nll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};\nll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};\nll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};\n\nconst ll INFL = 1LL << 60;//10^18 = 2^60\nconst int INF = 1 << 30;//10^9\nll MOD = 1000000007;\n//ll MOD = 998244353;\nvector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};\nvector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};\n\nll pow_long(ll x, ll k){\n ll res = 1;\n while(k > 0){\n if(k % 2) res *= x;\n x *= x;\n k /= 2;\n }\n return res;\n}\nll pow_mod(ll x, ll k){\n x %= MOD; x += MOD; x %= MOD;\n ll res = 1;\n while(k > 0){\n if(k % 2){\n res *= x; res %= MOD;\n }\n x *= x; x %= MOD;\n k /= 2;\n }\n return res;\n}\n\nll inverse(ll x){return pow_mod(x, MOD - 2);};\n\nll gcd(ll a, ll b){\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\nll lcm(ll x, ll y){return x / gcd(x, y) * y;};\n\nll kai_mod(ll x){\n if(x == 0) return 1;\n return x * kai_mod(x-1) % MOD;\n}\n\n/*\n//コンビネーション\nconst int MAXcomb = 200010;\nll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];\n//facはn!,finvは1/n!\n//invは逆元\nvoid COMinit(){\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(int i = 2; i < MAXcomb; 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 comb(int n, int k){\n if(n < k) return 0;\n if(n < 0 || k < 0) return 0;\n return fac[n] * finv[k] % MOD * finv[n-k] % MOD;\n}\n*/\n\nint main(){\n ll N;\n cin >> N;\n set<pair<ll, ll>> hashList;\n ll base = 998244353;\n rep(i, N){\n string S;\n cin >> S;\n ll sl = S.size();\n for(ll i = 1; i <= 5; i++){\n ll hash = 0;\n rep(j, i) hash = (hash * base + S[j]) % MOD;\n hashList.insert({i, hash});\n ll power = pow_mod(base, i);\n rep(j, sl-i){\n hash = ((hash * base - S[j] * power + S[i+j]) % MOD + MOD) % MOD;\n hashList.insert({i, hash});\n }\n }\n }\n for(ll i = 1;;i++){\n rep(j, pow_long(26, i)){\n ll J = j;\n string P = \"\";\n ll hashP = 0;\n rep(k, i){\n P += 'a' + (J % 26);\n hashP = (hashP * base + (J % 26) + 'a') % MOD;\n J /= 26;\n }\n if(hashList.count({i, hashP})) continue;\n cout << P << endl;\n return 0;\n }\n }\n}","accuracy":0.08333333333333333,"time_ms":390,"memory_kb":53896,"score_of_the_acc":-0.729,"final_rank":19},{"submission_id":"aoj_2808_3844433","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\n#include <tuple>\n#include <iomanip>\n#include <cstring>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n#define rep(i, n) for(ll i = 0; i < (n); i++)\n#define revrep(i, n) for(ll i = (n-1); i >= 0; i--)\n#define pb push_back\n#define f first\n#define s second\nll max(ll a, ll b){return (a > b) ? a : b;}\nll min(ll a, ll b){return (a < b) ? a : b;}\nll max3(ll a, ll b, ll c){return max(a, max(b, c));};\nll min3(ll a, ll b, ll c){return min(a, min(b, c));};\nll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};\nll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};\nll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};\nll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};\n\nconst ll INFL = 1LL << 60;//10^18 = 2^60\nconst int INF = 1 << 30;//10^9\nll MOD = 1000000007;\n//ll MOD = 998244353;\nvector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};\nvector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};\n\nll pow_long(ll x, ll k){\n ll res = 1;\n while(k > 0){\n if(k % 2) res *= x;\n x *= x;\n k /= 2;\n }\n return res;\n}\nll pow_mod(ll x, ll k){\n x %= MOD; x += MOD; x %= MOD;\n ll res = 1;\n while(k > 0){\n if(k % 2){\n res *= x; res %= MOD;\n }\n x *= x; x %= MOD;\n k /= 2;\n }\n return res;\n}\n\nll inverse(ll x){return pow_mod(x, MOD - 2);};\n\nll gcd(ll a, ll b){\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\nll lcm(ll x, ll y){return x / gcd(x, y) * y;};\n\nll kai_mod(ll x){\n if(x == 0) return 1;\n return x * kai_mod(x-1) % MOD;\n}\n\n/*\n//コンビネーション\nconst int MAXcomb = 200010;\nll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];\n//facはn!,finvは1/n!\n//invは逆元\nvoid COMinit(){\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(int i = 2; i < MAXcomb; 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 comb(int n, int k){\n if(n < k) return 0;\n if(n < 0 || k < 0) return 0;\n return fac[n] * finv[k] % MOD * finv[n-k] % MOD;\n}\n*/\n\nint main(){\n ll N;\n cin >> N;\n set<pair<ll, ll>> hashList;\n ll base = 9973;\n rep(i, N){\n string S;\n cin >> S;\n ll sl = S.size();\n for(ll i = 1; i <= 5; i++){\n ll hash = 0;\n rep(j, i) hash = (hash * base + S[j]) % MOD;\n hashList.insert({i, hash});\n ll power = pow_mod(base, i);\n rep(j, sl-i){\n hash = (hash * base - S[j] * power + S[i+j] + MOD) % MOD;\n hashList.insert({i, hash});\n }\n }\n }\n for(ll i = 1;;i++){\n rep(j, pow_long(26, i)){\n ll J = j;\n string P = \"\";\n ll hashP = 0;\n rep(k, i){\n P += 'a' + (J % 26);\n hashP = (hashP * base + (J % 26) + 'a') % MOD;\n J /= 26;\n }\n if(hashList.count({i, hashP})) continue;\n cout << P << endl;\n return 0;\n }\n }\n}","accuracy":0.08333333333333333,"time_ms":330,"memory_kb":53952,"score_of_the_acc":-0.658,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_2808_10853905\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef unsigned long long ull;\\n\\nstruct RollingHash\\n{\\n\\tvector<ull> hash, pow;\\n\\tRollingHash(string s, ull _b = 1000000007)\\n\\t{\\n\\t\\t_b = _b;\\n\\t\\tint sz = s.length();\\n\\t\\thash.assign(sz + 1, 0);\\n\\t\\tpow.assign(sz + 1, 0);\\n\\n\\t\\tpow[0] = 1;\\n\\t\\tfor (int i = 0; i<sz; i++) {\\n\\t\\t\\tpow[i + 1] = pow[i] * _b;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i<sz; i++) {\\n\\t\\t\\thash[i + 1] = (hash[i] + s[i])*_b;\\n\\t\\t}\\n\\t}\\n\\tull get(int l, int r) {\\n\\t\\treturn (hash[r] - hash[l] * pow[r - l]);\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tios::sync_with_stdio(false), cin.tie(0);\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<string> S(N);\\n\\tset<ull> st;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> S[i];\\n\\t\\tRollingHash rh(S[i]);\\n\\t\\tint n = S[i].size();\\n\\t\\tfor (int l = 0; l <= 4; l++) {\\n\\t\\t\\tfor (int i = 0; i + l <= n; i++) {\\n\\t\\t\\t\\tst.insert(rh.get(i, i + l));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstring s = \\\"a\\\";\\n\\tfor (s[0] = 'a'; s[0] <= 'z'; s[0]++) {\\n\\t\\tull val = RollingHash(s).get(0, 1);\\n\\t\\tif (st.count(val) == 0) {\\n\\t\\t\\tcout << s << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\ts = \\\"aa\\\";\\n\\tfor (s[0] = 'a'; s[0] <= 'z'; s[0]++) {\\n\\t\\tfor (s[1] = 'a'; s[1] <= 'z'; s[1]++) {\\n\\t\\t\\tull val = RollingHash(s).get(0, 2);\\n\\t\\t\\tif (st.count(val) == 0) {\\n\\t\\t\\t\\tcout << s << endl;\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\ts = \\\"aaa\\\";\\n\\tfor (s[0] = 'a'; s[0] <= 'z'; s[0]++) {\\n\\t\\tfor (s[1] = 'a'; s[1] <= 'z'; s[1]++) {\\n\\t\\t\\tfor (s[2] = 'a'; s[2] <= 'z'; s[2]++) {\\n\\t\\t\\t\\tull val = RollingHash(s).get(0, 3);\\n\\t\\t\\t\\tif (st.count(val) == 0) {\\n\\t\\t\\t\\t\\tcout << s << endl;\\n\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\ts = \\\"aaaa\\\";\\n\\tfor (s[0] = 'a'; s[0] <= 'z'; s[0]++) {\\n\\t\\tfor (s[1] = 'a'; s[1] <= 'z'; s[1]++) {\\n\\t\\t\\tfor (s[2] = 'a'; s[2] <= 'z'; s[2]++) {\\n\\t\\t\\t\\tfor (s[3] = 'a'; s[3] <= 'z'; s[3]++) {\\n\\t\\t\\t\\t\\tull val = RollingHash(s).get(0, 4);\\n\\t\\t\\t\\t\\tif (st.count(val) == 0) {\\n\\t\\t\\t\\t\\t\\tcout << s << endl;\\n\\t\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 29276,\n \"score_of_the_acc\": -0.3155,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2808_9117772\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define ll long long\\n\\n#define rep(i, n) for (ll i = 0; i < n; ++i)\\n#define all(v) begin(v), end(v)\\n// #define BIT(n) (1LL << (n))\\n#define MAX(type) numeric_limits<type>::max()\\n#define MIN(type) numeric_limits<type>::min()\\n#define yes cout << \\\"Yes\\\" << endl\\n#define no cout << \\\"No\\\" << endl\\n#define pb push_back\\n#define mp make_pair\\n#define fir first\\n#define sec second\\ntemplate <class T> using vec = vector<T>;\\n\\nsigned main() {\\n int N;\\n cin >> N;\\n vec<string> S(N);\\n rep(i, N) {\\n cin >> S[i];\\n }\\n\\n // 8文字以下の文字列は26+26^2+...+26^8=216'871'231'382 > 160'000'000'000\\n // なので8文字以下\\n\\n vec<unordered_set<string>> st(8);\\n rep(i, N) {\\n rep(j, 8) {\\n rep(k, max(0LL,(int) S[i].length() - j)) {\\n st[j].insert(S[i].substr(k, j+1));\\n }\\n }\\n }\\n\\n auto num_to_str = [&](int len, ll num) {\\n string ans(len+1, 'a');\\n rep(i, len+1) {\\n ans[i] = 'a' + num % 26;\\n num /= 26;\\n }\\n reverse(all(ans));\\n return ans;\\n };\\n// rep(i, 100) cout << num_to_str(3, i) << endl;\\n\\n rep(i, 8) {\\n ll pow26 = 1;\\n rep(j, i+1) pow26 *= 26;\\n if(pow26 == st[i].size()) {\\n continue;\\n } else {\\n rep(j, pow26) {\\n // cout << \\\"j = \\\" << j << \\\", str = \\\" << num_to_str(i, j) << endl;\\n if(!st[i].count(num_to_str(i, j))) {\\n cout << num_to_str(i, j) << endl;\\n return 0;\\n }\\n }\\n }\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 147056,\n \"score_of_the_acc\": -1.7143,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2808_9117763\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define ll long long\\n\\n#define rep(i, n) for (ll i = 0; i < n; ++i)\\n#define all(v) begin(v), end(v)\\n// #define BIT(n) (1LL << (n))\\n#define MAX(type) numeric_limits<type>::max()\\n#define MIN(type) numeric_limits<type>::min()\\n#define yes cout << \\\"Yes\\\" << endl\\n#define no cout << \\\"No\\\" << endl\\n#define pb push_back\\n#define mp make_pair\\n#define fir first\\n#define sec second\\ntemplate <class T> using vec = vector<T>;\\n\\nsigned main() {\\n int N;\\n cin >> N;\\n vec<string> S(N);\\n rep(i, N) {\\n cin >> S[i];\\n }\\n\\n // 8文字以下の文字列は26+26^2+...+26^8=216'871'231'382 > 160'000'000'000\\n // なので8文字以下\\n\\n /*\\n struct Vert {\\n Vert* parent;\\n map<char, Vert*> children;\\n char content;\\n public:\\n Vert(Vert* p, map<char, vec<Vert*>> child, char c): parent(p), children(child), content(c) {}\\n };\\n deque<Vert*> verts;\\n rep(i, N) {\\n Vert* parent = nullptr;\\n rep(j, 8) {\\n Vert* v = new Vert(parent, {}, S[i][j]);\\n verts.push_back(v);\\n parent->children[S[i][j];\\n }\\n }\\n*/\\n vec<unordered_set<string>> st(8);\\n rep(i, N) {\\n // cout << S[i].length() << endl;\\n rep(j, 8) {\\n rep(k, max(0LL,(int) S[i].length() - j)) {\\n st[j].insert(S[i].substr(k, j+1));\\n // cout << \\\"i : \\\" << i << \\\", j : \\\" << j << \\\", k : \\\" << k << endl;\\n // cout << \\\"insert : \\\" << S[i].substr(k, j+1) << endl;\\n }\\n }\\n }\\n // for(auto s : st) cout << s << endl;\\n\\n /*\\n auto get_num = [&](string s) {\\n int ans = 0;\\n rep(i, s.size()) {\\n ans += pow(26, i) * (s[i] - 'a');\\n }\\n return ans;\\n };\\n */\\n auto num_to_str = [&](int len, ll num) {\\n string ans(len+1, 'a');\\n rep(i, len+1) {\\n ans[i] = 'a' + num % 26;\\n num /= 26;\\n }\\n return ans;\\n };\\n /*\\n auto is_ok = [&](int len, int loc){\\n int num = 0;\\n rep(i, s[len][loc].size()) {\\n num += (s[len][loc][i] - 'a' + 1) * pow(26, i);\\n }\\n // cout << \\\"loc = \\\" << loc << \\\", num = \\\" << num << endl;\\n return loc+1 == num;\\n };\\n auto get_str_at = [](int len, int loc){\\n string s;\\n rep(i, len + 1) {\\n s.push_back('a' + loc % 26);\\n loc /= 26;\\n }\\n return s;\\n };\\n */\\n\\n rep(i, 8) {\\n // cout << \\\"i = \\\" << i << \\\", size = \\\" << st[i].size() << endl;\\n ll pow26 = 1;\\n rep(j, i+1) pow26 *= 26;\\n if(pow26 == st[i].size()) {\\n continue;\\n } else {\\n /*\\n int ok = -1, ng = st[i].size();\\n while(ng - ok > 1) {\\n int mid = (ng + ok) / 2;\\n if(is_ok(i, mid)) ok = mid;\\n else ng = mid;\\n }\\n cout << get_str_at(i, ng) << endl;\\n break;\\n */\\n rep(j, pow26) {\\n // cout << \\\"j = \\\" << j << \\\", str = \\\" << num_to_str(i, j) << endl;\\n if(!st[i].count(num_to_str(i, j))) {\\n cout << num_to_str(i, j) << endl;\\n return 0;\\n }\\n }\\n }\\n }\\n /*\\n */\\n\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 400,\n \"memory_kb\": 146744,\n \"score_of_the_acc\": -1.4025,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2808_9117754\",\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 pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\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 MOD2=998244353;\\nconst ld EPS=1e-9;\\nconst ld PI=3.14159265358979323846;\\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\\n#define all(x) (x).begin(), (x).end()\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define fi first\\n#define se second\\n#define rep(i, n) rep2(i, 0, n)\\n#define rep2(i, m, n) for (int i = m; i < (n); i++)\\n#define per(i, b) per2(i, 0, b)\\n#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)\\n#define ALL(c) (c).begin(), (c).end()\\n#define SZ(x) ((int)(x).size())\\n#define nep(x) next_permutation(ALL(x))\\ntemplate <class T>\\nusing V = vector<T>;\\ntemplate <class T>\\nusing VV = V<V<T>>;\\ntemplate <class T>\\nusing VVV = V<VV<T>>;\\ntemplate <class T>\\nusing VVVV = V<VVV<T>>;\\ntemplate <class T>\\nusing V_p = V<pair<T,T>>;\\ntemplate <class T>\\nusing n_pq = priority_queue<T>;\\ntemplate <class T>\\nusing r_pq = priority_queue<T,vector<T>,greater<T>>;\\ntemplate <class T>ostream &operator<<(ostream &o,const vector<T>&v)\\n{o<<\\\"{\\\";for(int i=0;i<(int)v.size();i++)o<<(i>0?\\\", \\\":\\\"\\\")<<v[i];o<<\\\"}\\\";return o;}\\ntemplate <class T>ostream &operator<<(ostream &o,const deque<T>&v)\\n{o<<\\\"{\\\";for(int i=0;i<(int)v.size();i++)o<<(i>0?\\\", \\\":\\\"\\\")<<v[i];o<<\\\"}\\\";return o;}\\ntemplate <class T>ostream &operator<<(ostream &o,const set<T>&v)\\n{o<<\\\"{\\\";for(auto i:v)o<<\\\" \\\"<<i;o<<\\\"}\\\";return o;}\\nll pow_ll(ll x, ll n) {\\n long long ret = 1;\\n while (n > 0) {\\n if (n & 1) ret *= x; // n の最下位bitが 1 ならば x^(2^i) をかける\\n x *= x;\\n n >>= 1; // n を1bit 左にずらす\\n }\\n return ret;\\n}\\n\\n\\n////////////////////////////////////////////////////\\n\\nV<string> s_l;\\nV<string> s_l_2;\\nV<string> s_l_3;\\nV<string> s_l_4;\\nvoid solve1(string s) {\\n\\n if (s.length() == 1) {\\n s_l.pb(s);\\n return;\\n }\\n rep(i,26) {\\n solve1(s+char('a' + i));\\n }\\n}\\n\\nvoid solve2(string s) {\\n\\n if (s.length() == 2) {\\n s_l_2.pb(s);\\n return;\\n }\\n rep(i,26) {\\n solve2(s+char('a' + i));\\n }\\n}\\n\\nvoid solve3(string s) {\\n\\n if (s.length() == 3) {\\n s_l_3.pb(s);\\n return;\\n }\\n rep(i,26) {\\n solve3(s+char('a' + i));\\n }\\n}\\n\\nvoid solve4(string s) {\\n\\n if (s.length() == 4) {\\n s_l_4.pb(s);\\n return;\\n }\\n rep(i,26) {\\n solve4(s+char('a' + i));\\n }\\n}\\n\\nint main() {\\n solve1(\\\"\\\");\\n solve2(\\\"\\\");\\n solve3(\\\"\\\");\\n solve4(\\\"\\\");\\n sort(ALL(s_l));\\n sort(ALL(s_l_2));\\n sort(ALL(s_l_3));\\n sort(ALL(s_l_4));\\n\\n s_l.insert(s_l.end(), s_l_2.begin(), s_l_2.end());\\n s_l.insert(s_l.end(), s_l_3.begin(), s_l_3.end());\\n s_l.insert(s_l.end(), s_l_4.begin(), s_l_4.end());\\n \\n\\n ll N,tmp;\\n ll s_size;\\n unordered_set<string> _set = {}; \\n cin >> N;\\n string T;\\n rep(j,N) {\\n\\n string S;\\n cin >> S;\\n s_size = S.length();\\n if (s_size+1>5) {\\n tmp = 5;\\n }\\n else {\\n tmp = s_size+1;\\n }\\n rep2(k,1,tmp){\\n\\n rep(st,s_size-k+1) {\\n T = S.substr(st,k);\\n _set.insert(T);\\n\\n }\\n\\n }\\n }\\n\\n for (auto &tmp_st:s_l) {\\n if (_set.count(tmp_st) == 0) {\\n cout << tmp_st << endl;\\n break;\\n }\\n }\\n\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 64760,\n \"score_of_the_acc\": -0.5922,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2808_9117611\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <unordered_map>\\nusing namespace std;\\nint n;\\nstring s[100005];\\nunordered_map<string, bool> mp;\\ntypedef long long ll;\\nint main()\\n{\\n cin >> n;\\n for (int i = 1; i <= n; ++i)\\n {\\n cin >> s[i];\\n for (int j = 0; j < s[i].length(); ++j)\\n for (int k = 1; k <= 4; ++k)\\n {\\n string a = \\\"\\\";\\n for (int l = j; l < j + k; ++l)\\n a += s[i][l];\\n mp[a] = 1;\\n }\\n }\\n for (int a = 1; a <= 26; ++a)\\n {\\n string tmp = \\\"\\\";\\n if (a)\\n tmp += a + 'a' - 1;\\n if (!mp[tmp])\\n {\\n cout << tmp << endl;\\n return 0;\\n }\\n }\\n for (int a = 1; a <= 26; ++a)\\n for (int b = 1; b <= 26; ++b)\\n {\\n string tmp = \\\"\\\";\\n if (a)\\n tmp += a + 'a' - 1;\\n if (b)\\n tmp += b + 'a' - 1;\\n if (!mp[tmp])\\n {\\n cout << tmp << endl;\\n return 0;\\n }\\n }\\n for (int a = 1; a <= 26; ++a)\\n for (int b = 1; b <= 26; ++b)\\n for (int c = 1; c <= 26; ++c)\\n {\\n string tmp = \\\"\\\";\\n if (a)\\n tmp += a + 'a' - 1;\\n if (b)\\n tmp += b + 'a' - 1;\\n if (c)\\n tmp += c + 'a' - 1;\\n if (!mp[tmp])\\n {\\n cout << tmp << endl;\\n return 0;\\n }\\n }\\n for (int a = 1; a <= 26; ++a)\\n for (int b = 1; b <= 26; ++b)\\n for (int c = 1; c <= 26; ++c)\\n for (int d = 1; d <= 26; ++d)\\n {\\n string tmp = \\\"\\\";\\n if (a)\\n tmp += a + 'a' - 1;\\n if (b)\\n tmp += b + 'a' - 1;\\n if (c)\\n tmp += c + 'a' - 1;\\n if (d)\\n tmp += d + 'a' - 1;\\n if (!mp[tmp])\\n {\\n cout << tmp << endl;\\n return 0;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 36124,\n \"score_of_the_acc\": -0.3286,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2808_9117586\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//高速化 \\nstruct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;\\n//#define endl '\\\\n' //インタラクティブ問題の時は消す\\n\\n//型\\nusing ll = long long;\\nusing ld = long double;\\ntemplate<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;\\nusing vi = vc<int>; using vvi = vvc<int>; using vvvi = vvvc<int>;\\nusing vl = vc<ll>; using vvl = vvc<ll>; using vvvl = vvvc<ll>;\\nusing pi = pair<int, int>; using pl = pair<ll, ll>;\\nusing ull = unsigned ll;\\ntemplate<class T>using priq = priority_queue<T>;\\ntemplate<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;\\n\\n// for文\\n#define overload4(a, b, c, d, e, ...) e\\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, step) for(ll i = a; i < b; i+= step)\\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define per1(n) for(ll i = n-1; i >= 0; i--)\\n#define per2(i, n) for(ll i = n-1; i >= 0; i--)\\n#define per3(i, a, b) for(ll i = b-1; i >= a; i--)\\n#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)\\n#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)\\n#define fore1(a) for(auto&& i : a)\\t\\n#define fore2(i,a) for(auto&& i : a)\\n#define fore3(x,y,a) for(auto&& [x, y] : a)\\n#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)\\n#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)\\n\\n//関数\\n#define mp make_pair\\n#define mt make_tuple\\n#define a first\\n#define b second\\n#define pb emplace_back\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define si(x) (ll)(x).size()\\ntemplate<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}\\ninline bool chmin(string& a, string b){\\n if(a.size() > b.size()) {\\n a = b;\\n return true;\\n }\\n return a > b && ( a = b , true);\\n}\\ntemplate<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}\\ntemplate<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}\\ntemplate<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}\\ntemplate<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}\\ntemplate<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}\\n\\n//入出力(operator)\\ntemplate<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}\\ntemplate<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}\\n\\ntemplate<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<\\\" \\\"<<a.b;}\\ntemplate<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<\\\" \\\";}return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<\\\" \\\";}return os;}\\ntemplate<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<\\\" \\\"<<y<<\\\"\\\\n\\\";}return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<\\\" \\\";}return os;}\\ntemplate<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<\\\" \\\"<<y<<\\\"\\\\n\\\";}return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<\\\" \\\";return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<\\\"\\\\n\\\";return os;}\\n\\n//入出力(関数)\\nvi readvi(ll n){vi a(n);cin>>a;return a;}\\nvl readvl(ll n){vl a(n);cin>>a;return a;}\\nvvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].pb(b);if(bidirected)g[b].pb(a);}return g;}\\nvvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].pb(b,c);if(bidirected)g[b].pb(a,c);}return g;}\\nvvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}\\nvvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}\\n\\ninline void yes(){cout << \\\"Yes\\\\n\\\";}\\ninline void no(){cout << \\\"No\\\\n\\\";}\\ninline void yesno(bool y = true){if(y)yes();else no();}\\n\\n//定数\\nconstexpr ll mod = 998244353;\\nconstexpr ll minf=-(1<<29);\\nconstexpr ll inf=(1<<29);\\nconstexpr ll MINF=-(1LL<<60);\\nconstexpr ll INF=(1LL<<60);\\nconstexpr ld EPS = 1e-8;\\nconst ld PI = acosl(-1);\\n#define equals(a, b) (abs((a) - (b)) < EPS)\\nconst int dx[4] ={-1, 0, 1, 0};\\nconst int dy[4] ={ 0, 1, 0,-1};\\nconst int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};\\nconst int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};\\n\\nvoid solve();\\nint main() {\\n\\tint t = 1;\\n // cin >>t;\\n while(t--)solve();\\n}\\n\\n\\n\\nvoid solve(){\\n int n;\\n cin >> n;\\n string s;\\n set<string> st;\\n rep(i,n){\\n cin >> s;\\n rep(j,si(s)){\\n string t = \\\"\\\";\\n rep(k,5){\\n if(j + k >= si(s))break;\\n t += s[(j + k)];\\n st.insert(t);\\n }\\n }\\n }\\n\\n\\n string ans = \\\"xxxxxxxx\\\";\\n rep(i1,26){\\n string t1 = string(1, 'a' + i1);\\n if(st.find(t1) == st.end()) chmin(ans,t1);\\n rep(i2,26){\\n if(ans.size() < 2)break;\\n string t2 = t1 + char('a' + i2);\\n if(st.find(t2) == st.end()) chmin(ans,t2);\\n rep(i3,26){\\n if(ans.size() < 3)break;\\n string t3 = t2 + char('a' + i3);\\n if(st.find(t3) == st.end()) chmin(ans,t3);\\n rep(i4,26){\\n if(ans.size() < 4)break;\\n string t4 = t3 + char('a' + i4);\\n if(st.find(t4) == st.end()) chmin(ans,t4);\\n rep(i5,26){\\n if(ans.size() < 5)break;\\n string t5 = t4 + char('a' + i5);\\n if(st.find(t5) == st.end()) chmin(ans,t5);\\n }\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 67392,\n \"score_of_the_acc\": -1.4324,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2808_9117578\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#define REP(i, n) for(ll i = 0;i < n;i++)\\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\\n#define ll long long\\n#define INF (ll)1ll << 60\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(),n.end()\\n#define MOD (ll)1000000007\\n#define P pair<ll, ll>\\n\\nmap<string, ll> mp;\\n\\nbool ok = false;\\nstring ans = \\\"\\\";\\nvoid dfs(ll a, ll b){\\n if(a == b){\\n if(mp[ans] == 0){\\n ok = true;\\n }\\n return;\\n }\\n if (ok) return;\\n REP(i, 26){\\n ans += 'a' + i;\\n dfs(a + 1, b);\\n if (ok) return;\\n ans.pop_back();\\n }\\n}\\nint main(){\\n ll n;\\n cin >> n;\\n REP(i, n){\\n string s;\\n cin >> s;\\n REP(j, 4){\\n if((ll)s.size() - j <= 0)continue;\\n REP(k, (ll)s.size() - j){\\n mp[s.substr(k, j + 1)]++;\\n }\\n }\\n }\\n bool ok = false;\\n REPO(i, 4){\\n if (ok) break;\\n dfs(0, i);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 35956,\n \"score_of_the_acc\": -0.5417,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2808_9117526\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#define REP(i, n) for(ll i = 0;i < n;i++)\\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\\n#define ll long long\\n#define INF (ll)1ll << 60\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(),n.end()\\n#define MOD (ll)1000000007\\n#define P pair<ll, ll>\\n\\nmap<string, ll> mp;\\n\\nbool ok = false;\\nstring ans = \\\"\\\";\\nvoid dfs(ll a, ll b){\\n if(a == b){\\n if(mp[ans] == 0){\\n ok = true;\\n }\\n return;\\n }\\n if (ok) return;\\n REP(i, 26){\\n ans += 'a' + i;\\n dfs(a + 1, b);\\n if (ok) return;\\n ans.pop_back();\\n }\\n}\\nint main(){\\n ll n;\\n cin >> n;\\n REP(i, n){\\n string s;\\n cin >> s;\\n REP(j, 4){\\n REP(k, s.size() - j){\\n mp[s.substr(k, j + 1)]++;\\n }\\n }\\n }\\n bool ok = false;\\n REPO(i, 4){\\n if (ok) break;\\n dfs(0, i);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 220,\n \"memory_kb\": 35748,\n \"score_of_the_acc\": -0.3973,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2808_5967060\",\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\\\";}\\ntemplate<class T> struct RollingHash{\\n using ull=unsigned long long int;\\n const ull M=(1ull<<61)-1;\\n const ull mask30 = (1ull << 30) - 1;\\n const ull mask31 = (1ull << 31) - 1;\\n const ull mask61 =M;\\n vector<ull> hash,pows;\\n ull base;\\n\\n // mod 2^61-1\\n ull cal_mod(ull x){\\n ull xu=(x>>61);\\n ull xd=(x&mask61);\\n ull res=xu+xd;\\n if(res>=M)res-=M;\\n return res;\\n }\\n\\n //a*b mod 2^61-1\\n ull mul(ull a,ull b){\\n ull au=(a>>31),bu=(b>>31);\\n ull ad=(a&mask31),bd=(b&mask31);\\n ull mid=ad*bu+au*bd;\\n ull midu=(mid>>30);\\n ull midd=(mid&mask30);\\n return cal_mod(au*bu*2+midu+(midd<<31)+ad*bd);\\n }\\n\\n\\n RollingHash(const T &a,ull base):hash(a.size()+1,0),pows(a.size()+1,1),base(base){\\n\\t\\tfor(int i = 0; i <int (a.size()); i++) {\\n pows[i + 1] =mul(pows[i], base);\\n hash[i + 1] =cal_mod(mul(hash[i], base) + ull(a[i]));\\n if(hash[i+1]>=M)hash[i+1]-=M;\\n\\t\\t}\\n }\\n ull get_hash(const T &a){\\n ull res=0;\\n \\tfor(int i = 0; i <int (a.size()); i++) {\\n res =cal_mod(mul(res, base) + ull(a[i]));\\n if(res>=M)res-=M;\\n\\t\\t}\\n return res;\\n }\\n //[b1,b1+len)と[b2,b2+len)が一致するかどうか\\n bool match(int b1, int b2,int len){\\n ull h1 = cal_mod(hash[b1+len]+M-mul(hash[b1], pows[len]));\\n ull h2 = cal_mod(hash[b2 + len]+M-mul(hash[b2],pows[len]));\\n return (h1 == h2);\\n }\\n //[l,l+len)のハッシュ値\\n ull get(int l, int len){\\n return cal_mod(hash[l+len] + M - mul(hash[l], pows[len]));\\n }\\n};\\nconstexpr int Hash_Num=2;\\nstruct base_t{\\n int use[Hash_Num];\\n int &operator[](int i){return use[i];}\\n base_t(){\\n mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\\n for(int i=0;i<Hash_Num;i++)use[i]=rnd()%10000+26;\\n }\\n}bases;\\nusing ull=unsigned long long;\\nint main(){\\n int n;\\n cin>>n;\\n string s;\\n cin>>s;\\n for(int i=0;i<n;i++){\\n string t;cin>>t;\\n s+=t;\\n s.push_back('$');\\n }\\n RollingHash<string> rh(s,bases[0]);\\n int m=s.size();\\n V<ull> v;\\n v.emplace_back((1ull<<62)-1);\\n for(int i=0;i<m;i++){\\n string t=\\\"\\\";\\n for(int j=0;j<4&&i+j<m;j++){\\n v.emplace_back(rh.get(i,j+1));\\n }\\n }\\n sort(all(v));\\n v.erase(unique(all(v)),v.end());\\n string ans=\\\"zzzzz\\\";\\n auto calc=[&](string &tmp)->void{\\n if(ans.size()>tmp.size())ans=tmp;\\n else chmin(ans,tmp);\\n };\\n string tmp=\\\"\\\";\\n for(char i='a';i<='z';i++){\\n tmp.push_back(i);\\n ull h=rh.get_hash(tmp);\\n if(*lower_bound(all(v),h)!=h)calc(tmp);\\n for(char j='a';j<='z';j++){\\n tmp.push_back(j);\\n h=rh.get_hash(tmp); \\n if(*lower_bound(all(v),h)!=h)calc(tmp);\\n for(char k='a';k<='z';k++){\\n tmp.push_back(k);\\n h=rh.get_hash(tmp); \\n if(*lower_bound(all(v),h)!=h)calc(tmp); \\n for(char r='a';r<='z';r++){\\n tmp.push_back(r);\\n h=rh.get_hash(tmp); \\n if(*lower_bound(all(v),h)!=h)calc(tmp); \\n tmp.pop_back(); \\n }\\n tmp.pop_back(); \\n } \\n tmp.pop_back(); \\n }\\n tmp.pop_back(); \\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 29404,\n \"score_of_the_acc\": -0.2212,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2808_5152471\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = 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 rep(i, a, b) for (ll i=(a); i<(b); i++)\\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\\n#define pb push_back\\n#define tostr to_string\\n#define ALL(A) A.begin(), A.end()\\n#define elif else if\\n// constexpr ll INF = LONG_LONG_MAX;\\nconstexpr ll INF = 1e18;\\nconstexpr ll MOD = 1000000007;\\n\\nconst string digits = \\\"0123456789\\\";\\nconst string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\\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\\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\\n\\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\\\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(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\\\n' : ' '); } }\\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\\n\\nvoid Yes() { print(\\\"Yes\\\"); }\\nvoid No() { print(\\\"No\\\"); }\\nvoid YES() { print(\\\"YES\\\"); }\\nvoid NO() { print(\\\"NO\\\"); }\\n\\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; } }\\npll divmod(ll a, ll 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; }\\n\\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\\n\\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; }\\nint ord(char c) { return (int)c; }\\nchar chr(int a) { return (char)a; }\\n\\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, 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; }\\n\\nint popcount(ll S) { return __builtin_popcountll(S); }\\nll gcd(ll a, ll b) { return __gcd(a, b); }\\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\\n\\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\\n\\nstring dton(ll num, ll n, char base='0') {\\n string res;\\n while (abs(num) > 0) {\\n ll m = num % abs(n);\\n num -= m;\\n res += base+m;\\n num /= n;\\n }\\n reverse(ALL(res));\\n if (res != \\\"\\\") {\\n return res;\\n } else {\\n return res+base;\\n }\\n}\\n\\nstring replace(string str, const string& replace, const string& with) {\\n if(!replace.empty()) {\\n size_t pos = 0;\\n while ((pos = str.find(replace, pos)) != string::npos) {\\n str.replace(pos, replace.length(), with);\\n pos += with.length();\\n }\\n }\\n return str;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n ll N;\\n cin >> N;\\n set<string> se;\\n rep(_, 0, N) {\\n string s;\\n cin >> s;\\n rep(d, 1, 5) {\\n if (s.size() < d) break;\\n rep(i, 0, s.size()-d+1) {\\n se.insert(s.substr(i, d));\\n }\\n }\\n }\\n\\n rep(n, 1, 5) {\\n vector<string> v;\\n auto rec = [&](auto&& f, string cur, ll i) {\\n if (i == n) {\\n v.pb(cur);\\n return;\\n }\\n for (char c : ascii_lowercase) {\\n f(f, cur+c, i+1);\\n }\\n };\\n rec(rec, \\\"\\\", 0);\\n for (auto s : v) {\\n if (!se.count(s)) {\\n print(s);\\n return 0;\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 52720,\n \"score_of_the_acc\": -0.7088,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2808_5152461\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = 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 rep(i, a, b) for (ll i=(a); i<(b); i++)\\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\\n#define pb push_back\\n#define tostr to_string\\n#define ALL(A) A.begin(), A.end()\\n#define elif else if\\n// constexpr ll INF = LONG_LONG_MAX;\\nconstexpr ll INF = 1e18;\\nconstexpr ll MOD = 1000000007;\\n\\nconst string digits = \\\"0123456789\\\";\\nconst string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\\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\\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\\n\\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\\\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(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\\\n' : ' '); } }\\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\\n\\nvoid Yes() { print(\\\"Yes\\\"); }\\nvoid No() { print(\\\"No\\\"); }\\nvoid YES() { print(\\\"YES\\\"); }\\nvoid NO() { print(\\\"NO\\\"); }\\n\\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; } }\\npll divmod(ll a, ll 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; }\\n\\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\\n\\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; }\\nint ord(char c) { return (int)c; }\\nchar chr(int a) { return (char)a; }\\n\\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, 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; }\\n\\nint popcount(ll S) { return __builtin_popcountll(S); }\\nll gcd(ll a, ll b) { return __gcd(a, b); }\\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\\n\\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\\n\\nstring dton(ll num, ll n, char base='0') {\\n string res;\\n while (abs(num) > 0) {\\n ll m = num % abs(n);\\n num -= m;\\n res += base+m;\\n num /= n;\\n }\\n reverse(ALL(res));\\n if (res != \\\"\\\") {\\n return res;\\n } else {\\n return res+base;\\n }\\n}\\n\\nstring replace(string str, const string& replace, const string& with) {\\n if(!replace.empty()) {\\n size_t pos = 0;\\n while ((pos = str.find(replace, pos)) != string::npos) {\\n str.replace(pos, replace.length(), with);\\n pos += with.length();\\n }\\n }\\n return str;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n ll N;\\n cin >> N;\\n set<string> se;\\n rep(_, 0, N) {\\n string s;\\n cin >> s;\\n rep(d, 1, 5) {\\n if (s.size() < d) break;\\n rep(i, 0, s.size()-d+1) {\\n se.insert(s.substr(i, d));\\n }\\n }\\n }\\n\\n ll d = 0;\\n while (1) {\\n auto ans = dton(d, 27, '`');\\n ans = replace(ans, \\\"`\\\", \\\"\\\");\\n if (!ans.empty()) {\\n if (!se.count(ans)) {\\n print(ans);\\n break;\\n }\\n }\\n d++;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 35996,\n \"score_of_the_acc\": -0.5658,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2808_5152377\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = 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 rep(i, a, b) for (ll i=(a); i<(b); i++)\\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\\n#define pb push_back\\n#define tostr to_string\\n#define ALL(A) A.begin(), A.end()\\n#define elif else if\\n// constexpr ll INF = LONG_LONG_MAX;\\nconstexpr ll INF = 1e18;\\nconstexpr ll MOD = 1000000007;\\n\\nconst string digits = \\\"0123456789\\\";\\nconst string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\\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\\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\\n\\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\\\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(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\\\n' : ' '); } }\\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\\n\\nvoid Yes() { print(\\\"Yes\\\"); }\\nvoid No() { print(\\\"No\\\"); }\\nvoid YES() { print(\\\"YES\\\"); }\\nvoid NO() { print(\\\"NO\\\"); }\\n\\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; } }\\npll divmod(ll a, ll 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; }\\n\\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\\n\\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; }\\nint ord(char c) { return (int)c; }\\nchar chr(int a) { return (char)a; }\\n\\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, 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; }\\n\\nint popcount(ll S) { return __builtin_popcountll(S); }\\nll gcd(ll a, ll b) { return __gcd(a, b); }\\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\\n\\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\\n\\nstruct RollingHash {\\n static const uint64_t mod = (1ull << 61ull) - 1;\\n using uint128_t = __uint128_t;\\n vector< uint64_t > power;\\n const uint64_t base;\\n\\n static inline uint64_t add(uint64_t a, uint64_t b) {\\n if((a += b) >= mod) a -= mod;\\n return a;\\n }\\n\\n static inline uint64_t mul(uint64_t a, uint64_t b) {\\n uint128_t c = (uint128_t) a * b;\\n return add(c >> 61, c & mod);\\n }\\n\\n // 2^61-1以下の乱数を返す。これをbaseとするとHackされにくい\\n static inline uint64_t generate_base() {\\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\\n uniform_int_distribution< uint64_t > rand(1, RollingHash::mod - 1);\\n return rand(mt);\\n }\\n\\n inline void expand(size_t sz) {\\n if(power.size() < sz + 1) {\\n int pre_sz = (int) power.size();\\n power.resize(sz + 1);\\n for(int i = pre_sz - 1; i < sz; i++) {\\n power[i + 1] = mul(power[i], base);\\n }\\n }\\n }\\n\\n // 基数baseのローリングハッシュを構築する\\n explicit RollingHash(uint64_t base = generate_base()) : base(base), power{1} {}\\n\\n // 文字列sのハッシュテーブルを返す：O(n)\\n vector< uint64_t > build(const string &s) const {\\n int sz = s.size();\\n vector< uint64_t > hashed(sz + 1);\\n for(int i = 0; i < sz; i++) {\\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\\n }\\n return hashed;\\n }\\n\\n template< typename T >\\n vector< uint64_t > build(const vector< T > &s) const {\\n int sz = s.size();\\n vector< uint64_t > hashed(sz + 1);\\n for(int i = 0; i < sz; i++) {\\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\\n }\\n return hashed;\\n }\\n\\n // sの区間[l,r)のハッシュ値を返す：O(1)\\n uint64_t query(const vector< uint64_t > &s, int l, int r) {\\n expand(r - l);\\n return add(s[r], mod - mul(s[l], power[r - l]));\\n }\\n\\n // ハッシュ値h1と長さh2lenのハッシュ値h2を結合する\\n uint64_t combine(uint64_t h1, uint64_t h2, size_t h2len) {\\n expand(h2len);\\n return add(mul(h1, power[h2len]), h2);\\n }\\n\\n // ハッシュテーブルaの区間[l1,r1)と、ハッシュテーブルbの区間[l2,r2)の文字列の最長共通接頭辞の長さを返す：O(logn)\\n int lcp(const vector< uint64_t > &a, int l1, int r1, const vector< uint64_t > &b, int l2, int r2) {\\n int len = min(r1 - l1, r2 - l2);\\n int low = 0, high = len + 1;\\n while(high - low > 1) {\\n int mid = (low + high) / 2;\\n if(query(a, l1, l1 + mid) == query(b, l2, l2 + mid)) low = mid;\\n else high = mid;\\n }\\n return low;\\n }\\n};\\n\\nstring dton(ll num, ll n) {\\n string res;\\n while (abs(num) > 0) {\\n ll m = num % abs(n);\\n num -= m;\\n res += '`'+m;\\n num /= n;\\n }\\n reverse(ALL(res));\\n if (res != \\\"\\\") {\\n return res;\\n } else {\\n return \\\"`\\\";\\n }\\n}\\n\\nstring replace(string str, const string& replace, const string& with) {\\n if(!replace.empty()) {\\n size_t pos = 0;\\n while ((pos = str.find(replace, pos)) != string::npos) {\\n str.replace(pos, replace.length(), with);\\n pos += with.length();\\n }\\n }\\n return str;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n ll N;\\n cin >> N;\\n RollingHash rh;\\n vector<string> A(N);\\n set<uint64_t> se;\\n rep(_, 0, N) {\\n string s;\\n cin >> s;\\n auto table = rh.build(s);\\n rep(d, 1, 5) {\\n if (s.size() < d) break;\\n rep(i, 0, s.size()-d+1) {\\n auto hash = rh.query(table, i, i+d);\\n se.insert(hash);\\n }\\n }\\n }\\n\\n ll d = 0;\\n while (1) {\\n auto ans = dton(d, 27);\\n ans = replace(ans, \\\"`\\\", \\\"\\\");\\n if (ans.empty()) {\\n d++;\\n continue;\\n }\\n auto s_hash = rh.query(rh.build(ans), 0, ans.size());\\n if (!se.count(s_hash)) {\\n print(ans);\\n break;\\n }\\n d++;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 26188,\n \"score_of_the_acc\": -0.2935,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2808_5152244\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = 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 rep(i, a, b) for (ll i=(a); i<(b); i++)\\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\\n#define pb push_back\\n#define tostr to_string\\n#define ALL(A) A.begin(), A.end()\\n#define elif else if\\n// constexpr ll INF = LONG_LONG_MAX;\\nconstexpr ll INF = 1e18;\\nconstexpr ll MOD = 1000000007;\\n\\nconst string digits = \\\"0123456789\\\";\\nconst string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\\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\\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\\n\\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\\\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(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\\\n' : ' '); } }\\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\\n\\nvoid Yes() { print(\\\"Yes\\\"); }\\nvoid No() { print(\\\"No\\\"); }\\nvoid YES() { print(\\\"YES\\\"); }\\nvoid NO() { print(\\\"NO\\\"); }\\n\\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; } }\\npll divmod(ll a, ll 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; }\\n\\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\\n\\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; }\\nint ord(char c) { return (int)c; }\\nchar chr(int a) { return (char)a; }\\n\\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, 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; }\\n\\nint popcount(ll S) { return __builtin_popcountll(S); }\\nll gcd(ll a, ll b) { return __gcd(a, b); }\\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\\n\\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\\n\\nstruct RollingHash {\\n static const uint64_t mod = (1ull << 61ull) - 1;\\n using uint128_t = __uint128_t;\\n vector< uint64_t > power;\\n const uint64_t base;\\n\\n static inline uint64_t add(uint64_t a, uint64_t b) {\\n if((a += b) >= mod) a -= mod;\\n return a;\\n }\\n\\n static inline uint64_t mul(uint64_t a, uint64_t b) {\\n uint128_t c = (uint128_t) a * b;\\n return add(c >> 61, c & mod);\\n }\\n\\n // 2^61-1以下の乱数を返す。これをbaseとするとHackされにくい\\n static inline uint64_t generate_base() {\\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\\n uniform_int_distribution< uint64_t > rand(1, RollingHash::mod - 1);\\n return rand(mt);\\n }\\n\\n inline void expand(size_t sz) {\\n if(power.size() < sz + 1) {\\n int pre_sz = (int) power.size();\\n power.resize(sz + 1);\\n for(int i = pre_sz - 1; i < sz; i++) {\\n power[i + 1] = mul(power[i], base);\\n }\\n }\\n }\\n\\n // 基数baseのローリングハッシュを構築する\\n explicit RollingHash(uint64_t base = generate_base()) : base(base), power{1} {}\\n\\n // 文字列sのハッシュテーブルを返す：O(n)\\n vector< uint64_t > build(const string &s) const {\\n int sz = s.size();\\n vector< uint64_t > hashed(sz + 1);\\n for(int i = 0; i < sz; i++) {\\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\\n }\\n return hashed;\\n }\\n\\n template< typename T >\\n vector< uint64_t > build(const vector< T > &s) const {\\n int sz = s.size();\\n vector< uint64_t > hashed(sz + 1);\\n for(int i = 0; i < sz; i++) {\\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\\n }\\n return hashed;\\n }\\n\\n // sの区間[l,r)のハッシュ値を返す：O(1)\\n uint64_t query(const vector< uint64_t > &s, int l, int r) {\\n expand(r - l);\\n return add(s[r], mod - mul(s[l], power[r - l]));\\n }\\n\\n // ハッシュ値h1と長さh2lenのハッシュ値h2を結合する\\n uint64_t combine(uint64_t h1, uint64_t h2, size_t h2len) {\\n expand(h2len);\\n return add(mul(h1, power[h2len]), h2);\\n }\\n\\n // ハッシュテーブルaの区間[l1,r1)と、ハッシュテーブルbの区間[l2,r2)の文字列の最長共通接頭辞の長さを返す：O(logn)\\n int lcp(const vector< uint64_t > &a, int l1, int r1, const vector< uint64_t > &b, int l2, int r2) {\\n int len = min(r1 - l1, r2 - l2);\\n int low = 0, high = len + 1;\\n while(high - low > 1) {\\n int mid = (low + high) / 2;\\n if(query(a, l1, l1 + mid) == query(b, l2, l2 + mid)) low = mid;\\n else high = mid;\\n }\\n return low;\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n ll N;\\n cin >> N;\\n RollingHash rh;\\n vector<string> A(N);\\n vector<vector<uint64_t>> tables(N);\\n rep(i, 0, N) {\\n cin >> A[i];\\n tables[i] = rh.build(A[i]);\\n }\\n\\n string ans = \\\"\\\";\\n bool ok = 0;\\n while (!ok) {\\n for (char c : ascii_lowercase) {\\n auto s_hash = rh.query(rh.build(ans+c), 0, ans.size()+1);\\n ok = 1;\\n rep(i, 0, N) {\\n if (A[i].size() < ans.size()) continue;\\n rep(j, 0, A[i].size()-ans.size()) {\\n auto t_hash = rh.query(tables[i], j, j+ans.size()+1);\\n if (s_hash == t_hash) {\\n ok = 0;\\n break;\\n }\\n }\\n if (!ok) break;\\n }\\n if (ok) {\\n ans += c;\\n break;\\n }\\n }\\n if (!ok) ans += 'a';\\n } \\n print(ans);\\n return 0;\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 60,\n \"memory_kb\": 6716,\n \"score_of_the_acc\": 0,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2808_5057332\",\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, 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);\\n\\tVS s = in[n];\\n\\n\\tset<string> substr;\\n\\trep(i, n) {\\n\\t\\tFOR(len, 1, 5) {\\n\\t\\t\\trep(l, sz(s[i]) - len + 1) {\\n\\t\\t\\t\\tsubstr.insert(s[i].substr(l, len));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tstring str;\\n\\tauto dfs = [&](auto&& f, int len) -> void {\\n\\t\\tif (sz(str) == len) {\\n\\t\\t\\tif (!substr.count(str)) {\\n\\t\\t\\t\\tout.exit(str);\\n\\t\\t\\t}\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tfor (char c : step('a', '{')) {\\n\\t\\t\\tstr += c;\\n\\t\\t\\tf(f, len);\\n\\t\\t\\tstr.pop_back();\\n\\t\\t}\\n\\t};\\n\\tFOR(len, 1, 5) {\\n\\t\\tdfs(dfs, len);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 36116,\n \"score_of_the_acc\": -0.5428,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2808_3992937\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<string>s(N);\\n\\tfor (auto &i : s)cin >> i;\\n\\tfor (int i = 1; i <= 5; i++) {\\n\\t\\tset<string>st;\\n\\t\\tstring t(i, 'a');\\n\\t\\twhile (t[0] <= 'z') {\\n\\t\\t\\tst.insert(t);\\n\\t\\t\\tt.back()++;\\n\\t\\t\\tint cnt = i - 1;\\n\\t\\t\\twhile (cnt&&t[cnt] > 'z') {\\n\\t\\t\\t\\tt[cnt--] = 'a';\\n\\t\\t\\t\\tt[cnt]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto j : s) {\\n\\t\\t\\tfor (int k = 0; k + i <= j.size(); k++) {\\n\\t\\t\\t\\tstring u;\\n\\t\\t\\t\\tfor (int l = 0; l < i; l++) {\\n\\t\\t\\t\\t\\tu.push_back(j[k + l]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tst.erase(u);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!st.empty()) {\\n\\t\\t\\tcout << *st.begin() << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 50632,\n \"score_of_the_acc\": -0.9915,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2808_3991411\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<string>s(N);\\n\\tfor (auto &i : s)cin >> i;\\n\\tfor (int i = 1; i <= 5; i++) {\\n\\t\\tset<string>st;\\n\\t\\tstring t(i, 'a');\\n\\t\\twhile (t[0] <= 'z') {\\n\\t\\t\\tst.insert(t);\\n\\t\\t\\tt.back()++;\\n\\t\\t\\tint cnt = i - 1;\\n\\t\\t\\twhile (cnt&&t[cnt] > 'z') {\\n\\t\\t\\t\\tt[cnt--] = 'a';\\n\\t\\t\\t\\tt[cnt]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto j : s) {\\n\\t\\t\\tfor (int k = 0; k + i <= j.size(); k++) {\\n\\t\\t\\t\\tstring u;\\n\\t\\t\\t\\tfor (int l = 0; l < i; l++) {\\n\\t\\t\\t\\t\\tu.push_back(j[k + l]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tst.erase(u);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!st.empty()) {\\n\\t\\t\\tcout << *st.begin() << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 50620,\n \"score_of_the_acc\": -0.9914,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2808_3878417\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n// #define double long double\\n#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)\\n#define FORR(i, a, b) for(ll i = (a); i > (b); --i)\\n#define REP(i, n) for(ll i = 0; i < (n); ++i)\\n#define REPR(i, n) for(ll i = n; i >= 0; i--)\\n#define FOREACH(x, a) for(auto &(x) : (a))\\n#define VECCIN(x) \\\\\\n for(auto &youso_ : (x)) cin >> youso_\\n#define bitcnt(x) __builtin_popcount(x)\\n#define lbit(x) __builtin_ffsll(x)\\n#define rbit(x) __builtin_clzll(x)\\n#define SZ(x) ((ll)(x).size())\\n#define fi first\\n#define se second\\n#define All(a) (a).begin(), (a).end()\\n#define rAll(a) (a).rbegin(), (a).rend()\\n\\ntemplate <typename T = long long> inline T IN() {\\n T x;\\n cin >> x;\\n return (x);\\n}\\ninline void CIN() {}\\ntemplate <class Head, class... Tail>\\ninline void CIN(Head &&head, Tail &&... tail) {\\n cin >> head;\\n CIN(move(tail)...);\\n}\\n#define CCIN(...) \\\\\\n char __VA_ARGS__; \\\\\\n CIN(__VA_ARGS__)\\n#define DCIN(...) \\\\\\n double __VA_ARGS__; \\\\\\n CIN(__VA_ARGS__)\\n#define LCIN(...) \\\\\\n ll __VA_ARGS__; \\\\\\n CIN(__VA_ARGS__)\\n#define SCIN(...) \\\\\\n string __VA_ARGS__; \\\\\\n CIN(__VA_ARGS__)\\n#define Yes(a) cout << (a ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"\\n#define YES(a) cout << (a ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"\\n#define Printv(v) \\\\\\n { \\\\\\n FOREACH(x, v) { cout << x << \\\" \\\"; } \\\\\\n cout << \\\"\\\\n\\\"; \\\\\\n }\\ntemplate <typename T = string> inline void eputs(T s) {\\n cout << s << \\\"\\\\n\\\";\\n exit(0);\\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 <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T> using PQ = priority_queue<T>;\\n\\ntypedef long long ll;\\ntypedef vector<ll> VL;\\ntypedef vector<VL> VVL;\\ntypedef pair<ll, ll> PL;\\ntypedef vector<PL> VPL;\\ntypedef vector<bool> VB;\\ntypedef vector<double> VD;\\ntypedef vector<string> VS;\\n\\nconst int INF = 1e9;\\nconst int MOD = 1e9 + 7;\\n// const int MOD = 998244353;\\nconst ll LINF = 5e18;\\n// const double PI = atan(1.0) * 4.0;\\nconst ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};\\nconst ll dy[] = {0, 1, 1, 1, 0, -1, -1, -1};\\n#define PI 3.141592653589793238\\n\\n// ローリングハッシュ\\n// 二分探索で LCP を求める機能つき\\nstruct RollingHash {\\n static const int base1 = 1007, base2 = 2009;\\n static const int mod1 = 1000000007, mod2 = 1000000009;\\n vector<long long> hash1, hash2, power1, power2;\\n\\n // construct\\n RollingHash(const string &S) {\\n int n = (int)S.size();\\n hash1.assign(n + 1, 0);\\n hash2.assign(n + 1, 0);\\n power1.assign(n + 1, 1);\\n power2.assign(n + 1, 1);\\n for(int i = 0; i < n; ++i) {\\n hash1[i + 1] = (hash1[i] * base1 + S[i]) % mod1;\\n hash2[i + 1] = (hash2[i] * base2 + S[i]) % mod2;\\n power1[i + 1] = (power1[i] * base1) % mod1;\\n power2[i + 1] = (power2[i] * base2) % mod2;\\n }\\n }\\n\\n // get hash of S[left:right]\\n inline pair<long long, long long> get(int l, int r) const {\\n long long res1 = hash1[r] - hash1[l] * power1[r - l] % mod1;\\n if(res1 < 0) res1 += mod1;\\n long long res2 = hash2[r] - hash2[l] * power2[r - l] % mod2;\\n if(res2 < 0) res2 += mod2;\\n return {res1, res2};\\n }\\n\\n // get lcp of S[a:] and T[b:]\\n inline int getLCP(int a, int b) const {\\n int len = min((int)hash1.size() - a, (int)hash1.size() - b);\\n int low = 0, high = len;\\n while(high - low > 1) {\\n int mid = (low + high) >> 1;\\n if(get(a, a + mid) != get(b, b + mid))\\n high = mid;\\n else\\n low = mid;\\n }\\n return low;\\n }\\n};\\n\\nbool inc(int l, string &s) {\\n for(int i = l - 1; i >= 0; --i) {\\n if(s[i] != 'z') {\\n s[i]++;\\n return true;\\n }\\n s[i] = 'a';\\n }\\n return false;\\n}\\n\\nsigned main() {\\n LCIN(N);\\n set<string> st;\\n REP(i, N) {\\n SCIN(S);\\n REP(j, S.length()) {\\n FOR(len, 1, 5) {\\n if(j + len > S.length()) continue;\\n st.emplace(S.substr(j, len));\\n }\\n }\\n }\\n REP(i, 27) REP(j, 27) REP(k, 27) REP(l, 26) {\\n string t;\\n if(i) t += 'a' - 1 + i;\\n if(j) t += 'a' - 1 + j;\\n if(k) t += 'a' - 1 + k;\\n t += 'a' + l;\\n if(!st.count(t)) eputs(t);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 42472,\n \"score_of_the_acc\": -0.8024,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2808_3844436\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <vector>\\n#include <tuple>\\n#include <iomanip>\\n#include <cstring>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n#define rep(i, n) for(ll i = 0; i < (n); i++)\\n#define revrep(i, n) for(ll i = (n-1); i >= 0; i--)\\n#define pb push_back\\n#define f first\\n#define s second\\nll max(ll a, ll b){return (a > b) ? a : b;}\\nll min(ll a, ll b){return (a < b) ? a : b;}\\nll max3(ll a, ll b, ll c){return max(a, max(b, c));};\\nll min3(ll a, ll b, ll c){return min(a, min(b, c));};\\nll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};\\nll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};\\nll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};\\nll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};\\n\\nconst ll INFL = 1LL << 60;//10^18 = 2^60\\nconst int INF = 1 << 30;//10^9\\nll MOD = 1000000007;\\n//ll MOD = 998244353;\\nvector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};\\nvector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};\\n\\nll pow_long(ll x, ll k){\\n ll res = 1;\\n while(k > 0){\\n if(k % 2) res *= x;\\n x *= x;\\n k /= 2;\\n }\\n return res;\\n}\\nll pow_mod(ll x, ll k){\\n x %= MOD; x += MOD; x %= MOD;\\n ll res = 1;\\n while(k > 0){\\n if(k % 2){\\n res *= x; res %= MOD;\\n }\\n x *= x; x %= MOD;\\n k /= 2;\\n }\\n return res;\\n}\\n\\nll inverse(ll x){return pow_mod(x, MOD - 2);};\\n\\nll gcd(ll a, ll b){\\n if(b == 0) return a;\\n return gcd(b, a % b);\\n}\\n\\nll lcm(ll x, ll y){return x / gcd(x, y) * y;};\\n\\nll kai_mod(ll x){\\n if(x == 0) return 1;\\n return x * kai_mod(x-1) % MOD;\\n}\\n\\n/*\\n//コンビネーション\\nconst int MAXcomb = 200010;\\nll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];\\n//facはn!,finvは1/n!\\n//invは逆元\\nvoid COMinit(){\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for(int i = 2; i < MAXcomb; 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 comb(int n, int k){\\n if(n < k) return 0;\\n if(n < 0 || k < 0) return 0;\\n return fac[n] * finv[k] % MOD * finv[n-k] % MOD;\\n}\\n*/\\n\\nint main(){\\n ll N;\\n cin >> N;\\n set<pair<ll, ll>> hashList;\\n ll base = 998244353;\\n rep(i, N){\\n string S;\\n cin >> S;\\n ll sl = S.size();\\n for(ll i = 1; i <= 5; i++){\\n ll hash = 0;\\n rep(j, i) hash = (hash * base + S[j]) % MOD;\\n hashList.insert({i, hash});\\n ll power = pow_mod(base, i);\\n rep(j, sl-i){\\n hash = ((hash * base - S[j] * power + S[i+j]) % MOD + MOD) % MOD;\\n hashList.insert({i, hash});\\n }\\n }\\n }\\n for(ll i = 1;;i++){\\n rep(j, pow_long(26, i)){\\n vector<ll> x(i);\\n ll J = j;\\n rep(k, i){\\n x[k] = J % 26;\\n J /= 26;\\n }\\n reverse(x.begin(), x.end());\\n string P = \\\"\\\";\\n ll hashP = 0;\\n rep(k, i){\\n P += 'a' + x[k];\\n hashP = (hashP * base + x[k] + 'a') % MOD;\\n }\\n if(hashList.count({i, hashP})) continue;\\n cout << P << endl;\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 530,\n \"memory_kb\": 54204,\n \"score_of_the_acc\": -0.8979,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2808_3844435\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <vector>\\n#include <tuple>\\n#include <iomanip>\\n#include <cstring>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n#define rep(i, n) for(ll i = 0; i < (n); i++)\\n#define revrep(i, n) for(ll i = (n-1); i >= 0; i--)\\n#define pb push_back\\n#define f first\\n#define s second\\nll max(ll a, ll b){return (a > b) ? a : b;}\\nll min(ll a, ll b){return (a < b) ? a : b;}\\nll max3(ll a, ll b, ll c){return max(a, max(b, c));};\\nll min3(ll a, ll b, ll c){return min(a, min(b, c));};\\nll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};\\nll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};\\nll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};\\nll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};\\n\\nconst ll INFL = 1LL << 60;//10^18 = 2^60\\nconst int INF = 1 << 30;//10^9\\nll MOD = 1000000007;\\n//ll MOD = 998244353;\\nvector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};\\nvector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};\\n\\nll pow_long(ll x, ll k){\\n ll res = 1;\\n while(k > 0){\\n if(k % 2) res *= x;\\n x *= x;\\n k /= 2;\\n }\\n return res;\\n}\\nll pow_mod(ll x, ll k){\\n x %= MOD; x += MOD; x %= MOD;\\n ll res = 1;\\n while(k > 0){\\n if(k % 2){\\n res *= x; res %= MOD;\\n }\\n x *= x; x %= MOD;\\n k /= 2;\\n }\\n return res;\\n}\\n\\nll inverse(ll x){return pow_mod(x, MOD - 2);};\\n\\nll gcd(ll a, ll b){\\n if(b == 0) return a;\\n return gcd(b, a % b);\\n}\\n\\nll lcm(ll x, ll y){return x / gcd(x, y) * y;};\\n\\nll kai_mod(ll x){\\n if(x == 0) return 1;\\n return x * kai_mod(x-1) % MOD;\\n}\\n\\n/*\\n//コンビネーション\\nconst int MAXcomb = 200010;\\nll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];\\n//facはn!,finvは1/n!\\n//invは逆元\\nvoid COMinit(){\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for(int i = 2; i < MAXcomb; 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 comb(int n, int k){\\n if(n < k) return 0;\\n if(n < 0 || k < 0) return 0;\\n return fac[n] * finv[k] % MOD * finv[n-k] % MOD;\\n}\\n*/\\n\\nint main(){\\n ll N;\\n cin >> N;\\n set<pair<ll, ll>> hashList;\\n ll base = 998244353;\\n rep(i, N){\\n string S;\\n cin >> S;\\n ll sl = S.size();\\n for(ll i = 1; i <= 5; i++){\\n ll hash = 0;\\n rep(j, i) hash = (hash * base + S[j]) % MOD;\\n hashList.insert({i, hash});\\n ll power = pow_mod(base, i);\\n rep(j, sl-i){\\n hash = ((hash * base - S[j] * power + S[i+j]) % MOD + MOD) % MOD;\\n hashList.insert({i, hash});\\n }\\n }\\n }\\n for(ll i = 1;;i++){\\n rep(j, pow_long(26, i)){\\n ll J = j;\\n string P = \\\"\\\";\\n ll hashP = 0;\\n rep(k, i){\\n P += 'a' + (J % 26);\\n hashP = (hashP * base + (J % 26) + 'a') % MOD;\\n J /= 26;\\n }\\n if(hashList.count({i, hashP})) continue;\\n cout << P << endl;\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 390,\n \"memory_kb\": 53896,\n \"score_of_the_acc\": -0.729,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2808_3844433\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <vector>\\n#include <tuple>\\n#include <iomanip>\\n#include <cstring>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n#define rep(i, n) for(ll i = 0; i < (n); i++)\\n#define revrep(i, n) for(ll i = (n-1); i >= 0; i--)\\n#define pb push_back\\n#define f first\\n#define s second\\nll max(ll a, ll b){return (a > b) ? a : b;}\\nll min(ll a, ll b){return (a < b) ? a : b;}\\nll max3(ll a, ll b, ll c){return max(a, max(b, c));};\\nll min3(ll a, ll b, ll c){return min(a, min(b, c));};\\nll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};\\nll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};\\nll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};\\nll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};\\n\\nconst ll INFL = 1LL << 60;//10^18 = 2^60\\nconst int INF = 1 << 30;//10^9\\nll MOD = 1000000007;\\n//ll MOD = 998244353;\\nvector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};\\nvector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};\\n\\nll pow_long(ll x, ll k){\\n ll res = 1;\\n while(k > 0){\\n if(k % 2) res *= x;\\n x *= x;\\n k /= 2;\\n }\\n return res;\\n}\\nll pow_mod(ll x, ll k){\\n x %= MOD; x += MOD; x %= MOD;\\n ll res = 1;\\n while(k > 0){\\n if(k % 2){\\n res *= x; res %= MOD;\\n }\\n x *= x; x %= MOD;\\n k /= 2;\\n }\\n return res;\\n}\\n\\nll inverse(ll x){return pow_mod(x, MOD - 2);};\\n\\nll gcd(ll a, ll b){\\n if(b == 0) return a;\\n return gcd(b, a % b);\\n}\\n\\nll lcm(ll x, ll y){return x / gcd(x, y) * y;};\\n\\nll kai_mod(ll x){\\n if(x == 0) return 1;\\n return x * kai_mod(x-1) % MOD;\\n}\\n\\n/*\\n//コンビネーション\\nconst int MAXcomb = 200010;\\nll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];\\n//facはn!,finvは1/n!\\n//invは逆元\\nvoid COMinit(){\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for(int i = 2; i < MAXcomb; 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 comb(int n, int k){\\n if(n < k) return 0;\\n if(n < 0 || k < 0) return 0;\\n return fac[n] * finv[k] % MOD * finv[n-k] % MOD;\\n}\\n*/\\n\\nint main(){\\n ll N;\\n cin >> N;\\n set<pair<ll, ll>> hashList;\\n ll base = 9973;\\n rep(i, N){\\n string S;\\n cin >> S;\\n ll sl = S.size();\\n for(ll i = 1; i <= 5; i++){\\n ll hash = 0;\\n rep(j, i) hash = (hash * base + S[j]) % MOD;\\n hashList.insert({i, hash});\\n ll power = pow_mod(base, i);\\n rep(j, sl-i){\\n hash = (hash * base - S[j] * power + S[i+j] + MOD) % MOD;\\n hashList.insert({i, hash});\\n }\\n }\\n }\\n for(ll i = 1;;i++){\\n rep(j, pow_long(26, i)){\\n ll J = j;\\n string P = \\\"\\\";\\n ll hashP = 0;\\n rep(k, i){\\n P += 'a' + (J % 26);\\n hashP = (hashP * base + (J % 26) + 'a') % MOD;\\n J /= 26;\\n }\\n if(hashList.count({i, hashP})) continue;\\n cout << P << endl;\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 330,\n \"memory_kb\": 53952,\n \"score_of_the_acc\": -0.658,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1690,"cells":{"group_id":{"kind":"string","value":"aoj_2810_cpp"},"problem_description":{"kind":"string","value":"F: カードゲーム\n問題\nカードを使ったゲームを $Q$ 回行います。\nカードには $1 \\cdots N$ の数が書かれており、各数が書かれたカードはゲームを行うのに十分な枚数があります。\n$i$ 回目のゲームでは、はじめに手札として 2 枚のカードが配られます。\nそれぞれのカードに書かれている数字は $x_i$ と $y_i$ です。\nカードはルールに従って交換することができます。\n$j$ 番目 $(1 \\le j \\le M)$ のルールでは、カード $a_j$ を手数料 $c_j$ 円で別のカード $b_j$ に交換することができます。\n各ルールは何回でも用いることができます。また、手数料が足りなくて交換できない場合はありません。\n最後に、手札のカードの数字を $R$ で割ったあまりが等しい時、報酬として $z_i$ 円受け取ります。\n異なる場合報酬は $0$ 円です。\n$Q$ 回ゲームを終えた時に増やすことのできるお金の最大値を求めてください。\n制約\n$1 \\le N \\le 10^5$\n$0 \\le M \\le \\min(2 \\times 10^5, N\\times(N-1))$\n$2 \\le R \\le 10$\n$1 \\le Q \\le 10^5$\n$1 \\le a_j, b_j \\le N$\n$a_j \\neq b_j$\n$0 \\le c_j \\le 10^5$\n$1 \\le x_i, y_i \\le N$\n$0 \\le z_i \\le 10^5$\n入力\n入力は以下の形式で標準入力から与えられます。\n$N \\ M \\ R \\ Q$\n$a_1 \\ b_1 \\ c_1$\n$\\vdots$\n$a_M \\ b_M \\ c_M$\n$x_1 \\ y_1 \\ z_1$\n$\\vdots$\n$x_Q \\ y_Q \\ z_Q$\n出力\nゲームを $Q$ 回行ったときに増やすことのできるお金の最大値を 1 行で出力してください。また、末尾に改行も出力してください。\nサンプル\n入力例 1\n4 4 2 2\n1 2 1\n2 3 1\n3 4 5\n4 1 7\n1 4 5\n2 4 3\n出力例 1\n7\n1 回目のゲームではカード 1 を手数料 1 でカード 2 に交換すると手札のカードを 2 で割った時のあまりがどちらも 0 となり、得られる報酬は 5 となります。\n2 回目のゲームではすでに 2 で割ったときのあまりがどちらも 0 であり、得られる報酬は 3 となります。\n2 回のゲームの結果、増やせるお金は $5-1+3=7$ です。\n入力例 2\n4 4 2 1\n1 2 1\n2 3 1\n3 4 5\n4 1 7\n3 4 2\n出力例 2\n0\nカードの交換での手数料が報酬よりも多いので、交換を行わないのが最適です。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2810_10412963","code_snippet":"// AOJ #2810 Card Game\n// 2025.4.23\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = (ll)1e18;\n\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(), M = Cin(), R = Cin(), Q = Cin();\n\n vector<vector<pair<int,int>>> G(N+1);\n for(int i = 0; i < M; i++){\n int a = Cin(), b = Cin(), c = Cin();\n G[b].emplace_back(a, c);\n }\n vector<vector<ll>> dist(R, vector<ll>(N+1, INF));\n for(int r = 0; r < R; r++){\n priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<>> pq;\n for(int v = r == 0 ? R : r; v <= N; v += R){\n dist[r][v] = 0;\n pq.emplace(0, v);\n }\n while(!pq.empty()){\n auto [d, v] = pq.top(); pq.pop();\n if(d > dist[r][v]) continue;\n for(auto &e : G[v]){\n int u = e.first, w = e.second;\n if(dist[r][u] > d + w){\n dist[r][u] = d + w;\n pq.emplace(dist[r][u], u);\n }\n }\n }\n }\n\n ll ans = 0;\n for(int i = 0; i < Q; i++){\n int x = Cin(), y = Cin();\n ll z = Cin();\n ll best = 0;\n for(int r = 0; r < R; r++){\n ll cx = dist[r][x], cy = dist[r][y];\n if(cx == INF || cy == INF) continue;\n ll cost = cx + cy;\n if(cost <= z) best = max(best, z - cost);\n }\n ans += best;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":17116,"score_of_the_acc":-0.9526,"final_rank":1},{"submission_id":"aoj_2810_9117726","code_snippet":"//#include<atcoder/all>\n//using namespace atcoder;\n\n#include <bits/stdc++.h>\ntemplate<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}\ntemplate<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}\n#define ll long long\n#define double long double\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define REP(i,n) for(int i=1;i<=(n);i++)\n#define mod (ll)(1e9+7)\n#define inf (ll)(3e18+7)\n#define eps (double)(1e-9)\n#define pi (double) acos(-1)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\nusing namespace std;\n\nstruct edge{\n ll to, cost;\n};\n\nusing Graph = vector<vector<edge>>;\n\n#define P pair<ll, ll>\nvector<ll> dijkstra(const vector<vector<edge>> &G, int s) {\n vector<ll> d((int)G.size(), inf);\n\tpriority_queue<P, vector<P>, greater<P>>que;\n\td[s] = 0;\n\tque.push(P(0, s));\n\twhile (!que.empty()) {\n\t\tP p = que.top(); que.pop();\n\t\tint v = p.second;\n\t\tif (d[v] < p.first)continue;\n\t\trep(i, G[v].size()) {\n\t\t\tedge e = G[v][i];\n\t\t\tif (d[e.to] > d[v] + e.cost) {\n\t\t\t\td[e.to] = d[v] + e.cost;\n\t\t\t\tque.push(P(d[e.to], e.to));\n\t\t\t}\n\t\t}\n\t}\n\treturn d;\n}\n\nint main(){\n int n, m, r, q;\n cin >> n >> m >> r >> q;\n vector<ll> a(m), b(m), c(m);\n vector<ll> x(q), y(q), z(q);\n rep(i, m)cin >> a[i] >> b[i] >> c[i];\n rep(i, q)cin >> x[i] >> y[i] >> z[i];\n rep(i, m){a[i]--; b[i]--;}\n\n Graph G(n+r);\n rep(i, m)G[b[i]].push_back({a[i], c[i]});\n rep(i, n)G[n+i%r].push_back({i, 0});\n\n vector<vector<ll>> d(r);\n rep(i, r)d[i] = dijkstra(G, n+i);\n\n ll ans = 0;\n rep(i, q){\n x[i]--;\n y[i]--;\n ll now = inf;\n rep(j, r){\n chmin(now, d[j][x[i]] + d[j][y[i]]);\n }\n\n ans += max(0LL, z[i] - now);\n }\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":200,"memory_kb":23304,"score_of_the_acc":-1.75,"final_rank":10},{"submission_id":"aoj_2810_9117637","code_snippet":"// #ifndef ONLINE_JUDGE\n#if __has_include(\"all.h\")\n\n#include \"all.h\"\n\n#else\n\n#include <bits/extc++.h>\n\n// #include <atcoder/all>\n\n#endif\n\nusing ll = long long int;\n\ntemplate <class T>\nbool chmin(T &x, const T val) {\n if (x > val) {\n x = val;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T>\nbool chmax(T &x, const T val) {\n if (x < val) {\n x = val;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class... T>\nstd::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) {\n std::apply([&](auto &&...args) { (is >> ... >> args); }, tpl);\n return is;\n}\n\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &x : v) is >> x;\n return is;\n}\n\n// template <class mint, atcoder::internal::is_static_modint_t<mint> * =\n// nullptr> std::ostream &operator<<(std::ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (int i = 0; i < v.size(); i++)\n os << v[i] << (i == v.size() - 1 ? \"\" : \" \");\n return os;\n}\n\nstruct Initialization {\n Initialization() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n} initialization;\n\nconstexpr std::pair<int, int> dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\n\ntemplate <typename T>\nusing infs = std::numeric_limits<T>;\n\ntemplate <typename T>\nclass factorials {\n public:\n static size_t n;\n static std::vector<T> fact, inv_fact;\n\n static void extend(size_t m) {\n if (m <= n) return;\n fact.resize(m + 1);\n inv_fact.resize(m + 1);\n for (size_t i = n + 1; i <= m; i++) fact[i] = fact[i - 1] * i;\n inv_fact[m] = fact[m].inv();\n for (size_t i = m; i > n + 1; i--) inv_fact[i - 1] = inv_fact[i] * i;\n n = m;\n }\n\n static T inv(int k) {\n extend(k);\n return inv_fact[k];\n }\n\n static T get(int k) {\n extend(k);\n return fact[k];\n }\n\n static T perm(int n, int k) {\n if (n < k) return 0;\n if (k < 0) return 0;\n extend(n);\n return fact[n] * inv_fact[n - k];\n }\n\n static T choose(int n, int k) {\n if (n < k) return 0;\n if (k < 0) return 0;\n extend(n);\n return fact[n] * inv_fact[n - k] * inv_fact[k];\n }\n};\n\ntemplate <typename T>\nsize_t factorials<T>::n = 0;\n\ntemplate <typename T>\nstd::vector<T> factorials<T>::fact = {1};\n\ntemplate <typename T>\nstd::vector<T> factorials<T>::inv_fact = {1};\n\n// template <typename T>\n// class fps {\n// std::vector<T> v;\n//\n// public:\n// using value_type = T;\n// using reference = T &;\n// using const_reference = const T &;\n// using iterator = typename std::vector<T>::iterator;\n// using const_iterator = typename std::vector<T>::const_iterator;\n//\n// size_t size() const { return v.size(); }\n//\n// const std::vector<T> &data() const { return v; }\n//\n// explicit fps(int n) : v(n) {}\n//\n// fps(const std::vector<T> &v) : v(v) {}\n// fps(std::vector<T> &&v) : v(v) {}\n//\n// template <class InputIterator>\n// fps(InputIterator first, InputIterator last) : v(first, last) {}\n//\n// void resize(int n) { v.resize(n); }\n//\n// T &operator[](int i) { return v[i]; }\n//\n// iterator begin() { return v.begin(); }\n//\n// iterator end() { return v.end(); }\n//\n// fps diff() {\n// std::vector<T> res(v.size() - 1);\n// for (int i = 0; i < res.size(); i++) res[i] = v[i + 1] * (i + 1);\n// return fps(res);\n// }\n//\n// fps integral() {\n// std::vector<T> res(v.size() + 1);\n// for (int i = 0; i < v.size(); i++) res[i + 1] = v[i] / (i + 1);\n// return fps(res);\n// }\n//\n// fps inv(int deg = -1) {\n// assert(v[0] != 0);\n//\n// if (deg == -1) deg = size();\n// std::vector<T> res(deg);\n//\n// res[0] = v[0].inv();\n//\n// for (int d = 1; d < deg; d <<= 1) {\n// std::vector<T> f(2 * d), g(2 * d);\n//\n// std::copy(v.begin(), v.begin() + std::min(2 * d, (int)v.size()),\n// std::back_inserter(f));\n// std::copy(res.begin(), res.begin() + d, std::back_inserter(g));\n//\n// atcoder::internal::butterfly(f);\n// atcoder::internal::butterfly(g);\n//\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\n//\n// atcoder::internal::butterfly_inv(f);\n//\n// for (int i = 0; i < d; i++) f[i] = 0;\n//\n// atcoder::internal::butterfly(f);\n//\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\n//\n// atcoder::internal::butterfly_inv(f);\n//\n// for (int i = d; i < std::min(2 * d, deg); i++) res[i] = -f[i];\n// }\n//\n// res.resize(deg);\n//\n// return res;\n// }\n//\n// fps shift(T c) {\n// std::vector<T> res(size()), ifacts(size());\n//\n// T x = 1;\n//\n// for (int i = 0; i < size(); i++) {\n// ifacts[i] = x * factorials<T>::inv(i);\n// x *= c;\n// }\n//\n// for (int i = 0; i < size(); i++) {\n// res[size() - 1 - i] = v[i] * factorials<T>::get(i);\n// }\n//\n// res = atcoder::convolution(res, ifacts);\n//\n// res.resize(size());\n//\n// std::ranges::reverse(res);\n//\n// for (int i = 0; i < size(); i++) {\n// res[i] *= factorials<T>::inv(i);\n// }\n//\n// return res;\n// }\n//\n// fps operator-() {\n// fps res(v.size());\n// for (int i = 0; i < v.size(); i++) res[i] = -v[i];\n// return res;\n// }\n//\n// fps &operator+=(const fps &rhs) {\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\n// for (int i = 0; i < rhs.v.size(); i++) v[i] += rhs.v[i];\n// return *this;\n// }\n//\n// fps &operator-=(const fps &rhs) {\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\n// for (int i = 0; i < rhs.v.size(); i++) v[i] -= rhs.v[i];\n// return *this;\n// }\n//\n// fps &operator*=(const fps &rhs) {\n// return *this = atcoder::convolution(v, rhs.v);\n// }\n//\n// fps &operator+=(const T &rhs) {\n// if (v.size() == 0) v.resize(1);\n// v[0] += rhs;\n// return *this;\n// }\n//\n// fps &operator-=(const T &rhs) {\n// if (v.size() == 0) v.resize(1);\n// v[0] -= rhs;\n// return *this;\n// }\n//\n// fps &operator*=(const T &rhs) {\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs;\n// return *this;\n// }\n//\n// fps &operator/=(const T &rhs) {\n// T rhs_inv = rhs.inv();\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs_inv;\n// return *this;\n// }\n//\n// friend fps operator+(const fps &lhs, const fps &rhs) {\n// return fps(lhs) += rhs;\n// }\n//\n// friend fps operator-(const fps &lhs, const fps &rhs) {\n// return fps(lhs) -= rhs;\n// }\n//\n// friend fps operator*(const fps &lhs, const fps &rhs) {\n// return fps(lhs) *= rhs;\n// }\n//\n// friend fps operator+(const fps &lhs, const T &rhs) { return fps(lhs) +=\n// rhs; }\n//\n// friend fps operator-(const fps &lhs, const T &rhs) { return fps(lhs) -=\n// rhs; }\n//\n// friend fps operator*(const fps &lhs, const T &rhs) { return fps(lhs) *=\n// rhs; }\n//\n// friend fps operator/(const fps &lhs, const T &rhs) { return fps(lhs) /=\n// rhs; }\n//\n// friend fps operator+(const T &lhs, const fps &rhs) { return fps(rhs) +=\n// lhs; }\n//\n// friend fps operator-(const T &lhs, const fps &rhs) {\n// return -(fps(rhs) -= lhs);\n// }\n//\n// friend fps operator*(const T &lhs, const fps &rhs) { return fps(rhs) *=\n// lhs; }\n// };\n\n// using mint = atcoder::modint998244353;\n// using mint = atcoder::modint1000000007;\n\n// using fs = factorials<mint>;\n\nint main() {\n int N, M, R, Q;\n std::cin >> N >> M >> R >> Q;\n\n std::vector graph(N, std::vector<std::pair<int, ll>>());\n\n for (int i = 0; i < M; i++) {\n int a, b;\n ll c;\n std::cin >> a >> b >> c;\n a--;\n b--;\n\n graph[b].emplace_back(a, c);\n }\n\n std::vector dist(R, std::vector(N, infs<ll>::max() / 4));\n\n for (int r = 0; r < R; r++) {\n std::priority_queue<std::pair<ll, int>> priq;\n\n std::vector<bool> locked(N);\n\n for (int i = r; i < N; i += R) {\n dist[r][i] = 0;\n priq.emplace(0, i);\n }\n\n while (!priq.empty()) {\n auto [c, v] = priq.top();\n priq.pop();\n\n if (locked[v]) continue;\n c = -c;\n locked[v] = true;\n\n for (auto [w, d] : graph[v]) {\n if (chmin(dist[r][w], c + d)) {\n priq.emplace(-(c + d), w);\n }\n }\n }\n }\n\n ll ans = 0;\n\n for (int i = 0; i < Q; i++) {\n int x, y;\n ll z;\n std::cin >> x >> y >> z;\n\n x--;\n y--;\n\n ll tmp = infs<ll>::max() / 4;\n\n for (int r = 0; r < R; r++) {\n chmin(tmp, dist[r][x] + dist[r][y]);\n }\n\n ans += std::max(0LL, z - tmp);\n }\n\n std::cout << ans << std::endl;\n}","accuracy":1,"time_ms":130,"memory_kb":17072,"score_of_the_acc":-1.0749,"final_rank":3},{"submission_id":"aoj_2810_9117624","code_snippet":"//#include<atcoder/all>\n//using namespace atcoder;\n\n#include <bits/stdc++.h>\ntemplate<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}\ntemplate<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}\n#define ll long long\n#define double long double\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define REP(i,n) for(int i=1;i<=(n);i++)\n#define mod (ll)(1e9+7)\n#define inf (ll)(3e18+7)\n#define eps (double)(1e-9)\n#define pi (double) acos(-1)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\nusing namespace std;\n\nint main(){\n int n, m, r, q;\n cin >> n >> m >> r >> q;\n vector<ll> a(m), b(m), c(m);\n vector<ll> x(q), y(q), z(q);\n rep(i, m)cin >> a[i] >> b[i] >> c[i];\n rep(i, q)cin >> x[i] >> y[i] >> z[i];\n\n vector<vector<ll>> mn(n+1, vector<ll>(r, inf));\n rep(i, m)chmin(mn[a[i]][b[i]%r], c[i]);\n\n ll ans = 0;\n rep(i, q){\n ll now = inf;\n rep(j, r){\n ll cost1 = mn[x[i]][j];\n ll cost2 = mn[y[i]][j];\n if(x[i] % r == j)cost1 = 0;\n if(y[i] % r == j)cost2 = 0;\n chmin(now, cost1 + cost2);\n }\n ans += max(0LL, - now + z[i]);\n }\n\n cout << ans << endl;\n\n}","accuracy":0.03333333333333333,"time_ms":50,"memory_kb":12844,"score_of_the_acc":-0.4814,"final_rank":15},{"submission_id":"aoj_2810_9117621","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n//高速化 \nstruct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;\n//#define endl '\\n' //インタラクティブ問題の時は消す\n\n//型\nusing ll = long long;\nusing ld = long double;\ntemplate<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;\nusing vi = vc<int>; using vvi = vvc<int>; using vvvi = vvvc<int>;\nusing vl = vc<ll>; using vvl = vvc<ll>; using vvvl = vvvc<ll>;\nusing pi = pair<int, int>; using pl = pair<ll, ll>;\nusing ull = unsigned ll;\ntemplate<class T>using priq = priority_queue<T>;\ntemplate<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;\n\n// for文\n#define overload4(a, b, c, d, e, ...) e\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, step) for(ll i = a; i < b; i+= step)\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define per1(n) for(ll i = n-1; i >= 0; i--)\n#define per2(i, n) for(ll i = n-1; i >= 0; i--)\n#define per3(i, a, b) for(ll i = b-1; i >= a; i--)\n#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)\n#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)\n#define fore1(a) for(auto&& i : a)\t\n#define fore2(i,a) for(auto&& i : a)\n#define fore3(x,y,a) for(auto&& [x, y] : a)\n#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)\n#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)\n\n//関数\n#define mp make_pair\n#define mt make_tuple\n#define a first\n#define b second\n#define pb emplace_back\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define si(x) (ll)(x).size()\ntemplate<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}\ntemplate<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}\ntemplate<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}\ntemplate<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}\ntemplate<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}\ntemplate<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}\ntemplate<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}\n\n//入出力(operator)\ntemplate<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}\ntemplate<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}\n\ntemplate<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<\" \"<<a.b;}\ntemplate<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<\" \";}return os;}\ntemplate<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<\" \";}return os;}\ntemplate<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<\" \"<<y<<\"\\n\";}return os;}\ntemplate<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<\" \";}return os;}\ntemplate<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<\" \"<<y<<\"\\n\";}return os;}\ntemplate<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<\" \";return os;}\ntemplate<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<\"\\n\";return os;}\n\n//入出力(関数)\nvi readvi(ll n){vi a(n);cin>>a;return a;}\nvl readvl(ll n){vl a(n);cin>>a;return a;}\nvvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].pb(b);if(bidirected)g[b].pb(a);}return g;}\nvvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].pb(b,c);if(bidirected)g[b].pb(a,c);}return g;}\nvvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}\nvvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}\n\ninline void yes(){cout << \"Yes\\n\";}\ninline void no(){cout << \"No\\n\";}\ninline void yesno(bool y = true){if(y)yes();else no();}\n\n//定数\nconstexpr ll mod = 998244353;\nconstexpr ll minf=-(1<<29);\nconstexpr ll inf=(1<<29);\nconstexpr ll MINF=-(1LL<<60);\nconstexpr ll INF=(1LL<<60);\nconstexpr ld EPS = 1e-8;\nconst ld PI = acosl(-1);\n#define equals(a, b) (abs((a) - (b)) < EPS)\nconst int dx[4] ={-1, 0, 1, 0};\nconst int dy[4] ={ 0, 1, 0,-1};\nconst int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};\nconst int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};\n\nvoid solve();\nint main() {\n\tint t = 1;\n // cin >>t;\n while(t--)solve();\n}\n\n\n\nvoid solve(){\n ll n,m,q,r;\n cin >> n >> m >> r >> q;\n\n vvc<pi> g(n);\n\n vvi cst(n, vi(r, inf));\n rep(i,n) cst[i][i % r] = 0;\n rep(i,m){\n int a,b,c;\n cin >> a >> b >> c;\n a--,b--;\n g[b].emplace_back(a, c);\n }\n\n rep(i,r){\n priqg<pi> q;\n rep(j,n){\n if(j * r + i >= n) break;\n q.push({0, j * r + i});\n }\n\n while(q.size()){\n int p = q.top().second;\n int c = q.top().first;\n q.pop();\n if(cst[p][i] != c) continue;\n\n rep(j, si(g[p])){\n if(chmin(cst[g[p][j].first][i], c + g[p][j].second)){\n q.push({c + g[p][j].second, g[p][j].first});\n }\n }\n }\n }\n\n ll ans = 0;\n rep(_, q){\n int x,y,z;\n cin >> x >> y >> z;\n x--,y--;\n\n int mx = 0;\n rep(i, r){\n chmax(mx, z - cst[x][i] - cst[y][i]);\n }\n ans += mx;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":150,"memory_kb":15880,"score_of_the_acc":-1.0849,"final_rank":4},{"submission_id":"aoj_2810_8491873","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2810.cc: Card Game\n */\n\n#include<cstdio>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_R = 10;\nconst long long LINF = 1LL << 60;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,int> pli;\ntypedef vector<pii> vpii;\n\n/* global variables */\n\nvpii nbrs[MAX_N];\nll kds[MAX_R][MAX_N];\n\n/* subroutines */\n\nvoid calcdists(int n, int k, int r, ll ds[]) {\n fill(ds, ds + n, LINF);\n priority_queue<pli> q;\n\n for (int u = k; u < n; u += r)\n ds[u] = 0, q.push(pii(0, u));\n\n while (! q.empty()) {\n auto ue = q.top(); q.pop();\n ll ud = -ue.first;\n int u = ue.second;\n if (ud != ds[u]) continue;\n\n for (auto &vw: nbrs[u]) {\n int v = vw.first;\n ll vd = ud + vw.second;\n if (ds[v] > vd) {\n\tds[v] = vd;\n\tq.push(pli(-vd, v));\n }\n }\n }\n}\n\n/* main */\n\nint main() {\n int n, m, r, qn;\n scanf(\"%d%d%d%d\", &n, &m, &r, &qn);\n \n for (int i = 0; i < m; i++) {\n int a, b, c;\n scanf(\"%d%d%d\", &a, &b, &c);\n a--, b--;\n nbrs[b].push_back(pii(a, c));\n }\n\n for (int k = 0; k < r; k++) calcdists(n, k, r, kds[k]);\n\n ll sum = 0;\n \n while (qn--) {\n int x, y, z;\n scanf(\"%d%d%d\", &x, &y, &z);\n x--, y--;\n\n ll maxd = 0;\n for (int k = 0; k < r; k++)\n maxd = max(maxd, z - (kds[k][x] + kds[k][y]));\n\n sum += maxd;\n }\n\n printf(\"%lld\\n\", sum);\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":16540,"score_of_the_acc":-1.0005,"final_rank":2},{"submission_id":"aoj_2810_5967135","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\";}\nstruct edge{\n int to;\n ll cost;\n edge(int to,ll cost):to(to),cost(cost){}\n};\nint main(){\n int n,m,r,q;\n cin>>n>>m>>r>>q;\n V<V<int>> d(r);\n for(int i=1;i<=n;i++){\n d[i%r].emplace_back(i);\n }\n V<V<edge>> g(n+1);\n for(int i=0;i<m;i++){\n ll a,b,c;\n cin>>a>>b>>c;\n g[b].emplace_back(a,c);\n }\n V<V<ll>> dp(n+1,V<ll>(r,inf));\n for(int i=0;i<r;i++){\n priority_queue<P,V<P>,greater<P>> pq;\n for(int v:d[i]){\n pq.emplace(0,v);\n dp[v][i]=0;\n }\n while(pq.size()){\n auto[v,cur]=pq.top();\n pq.pop();\n if(dp[cur][i]<v)continue;\n for(edge &e:g[cur]){\n if(chmin(dp[e.to][i],dp[cur][i]+e.cost)){\n pq.emplace(dp[e.to][i],e.to);\n }\n }\n }\n }\n ll ans=0;\n for(int i=0;i<q;i++){\n ll x,y,z;\n cin>>x>>y>>z;\n ll mi=inf;\n for(int j=0;j<r;j++){\n chmin(mi,dp[x][j]+dp[y][j]);\n }\n ans+=max(0ll,z-mi);\n }\n cout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":210,"memory_kb":21344,"score_of_the_acc":-1.6711,"final_rank":8},{"submission_id":"aoj_2810_3992939","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n\n\n\nint main() {\n\tint N, M, MD, K;\n\tcin >> N >> M >> MD >> K;\n\tvector<vector<pair<int, long long int>>>rev_edge(N + 1);\n\tfor (int i = 0; i < M; i++) {\n\t\tint l, r, k;\n\t\tcin >> l >> r >> k;\n\t\trev_edge[r].push_back({ l,k });\n\t}\n\tvector<vector<long long int>>dis(MD, vector<long long int>(N + 1,MOD*MOD));\n\tfor (int i = 0; i < MD; i++) {\n\t\tfor (int j = i; j <= N; j += MD) {\n\t\t\tdis[i][j] = 0;\n\t\t}\n\t\tpriority_queue<pair<long long int, int>, vector<pair<long long int, int>>, greater<pair<long long int, int>>>PQ;\n\t\tfor (int j = 0; j <= N; j++) {\n\t\t\tif (dis[i][j] == MOD*MOD) continue;\n\t\t\tPQ.push({ dis[i][j],j });\n\t\t}\n\t\twhile (!PQ.empty()) {\n\t\t\tint cn = PQ.top().second;\n\t\t\tlong long int c = PQ.top().first;\n\t\t\tPQ.pop();\n\t\t\tfor (auto j : rev_edge[cn]) {\n\t\t\t\tif (dis[i][j.first]>c + j.second) {\n\t\t\t\t\tdis[i][j.first] = c + j.second;\n\t\t\t\t\tPQ.push({ dis[i][j.first],j.first });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tlong long int ans = 0;\n\tfor (int i = 0; i < K; i++) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c;\n\t\tlong long int add = 0;\n\t\tfor (int j = 0; j < MD; j++) {\n\t\t\tadd = max(add, c - dis[j][a] - dis[j][b]);\n\t\t}\n\t\tans += add;\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":260,"memory_kb":16780,"score_of_the_acc":-1.5986,"final_rank":6},{"submission_id":"aoj_2810_3991523","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n\n\n\nint main() {\n\tint N, M, MD, K;\n\tcin >> N >> M >> MD >> K;\n\tvector<vector<pair<int, long long int>>>rev_edge(N + 1);\n\tfor (int i = 0; i < M; i++) {\n\t\tint l, r, k;\n\t\tcin >> l >> r >> k;\n\t\trev_edge[r].push_back({ l,k });\n\t}\n\tvector<vector<long long int>>dis(MD, vector<long long int>(N + 1,MOD*MOD));\n\tfor (int i = 0; i < MD; i++) {\n\t\tfor (int j = i; j <= N; j += MD) {\n\t\t\tdis[i][j] = 0;\n\t\t}\n\t\tpriority_queue<pair<long long int, int>, vector<pair<long long int, int>>, greater<pair<long long int, int>>>PQ;\n\t\tfor (int j = 0; j <= N; j++) {\n\t\t\tif (dis[i][j] == MOD*MOD) continue;\n\t\t\tPQ.push({ dis[i][j],j });\n\t\t}\n\t\twhile (!PQ.empty()) {\n\t\t\tint cn = PQ.top().second;\n\t\t\tlong long int c = PQ.top().first;\n\t\t\tPQ.pop();\n\t\t\tfor (auto j : rev_edge[cn]) {\n\t\t\t\tif (dis[i][j.first]>c + j.second) {\n\t\t\t\t\tdis[i][j.first] = c + j.second;\n\t\t\t\t\tPQ.push({ dis[i][j.first],j.first });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tlong long int ans = 0;\n\tfor (int i = 0; i < K; i++) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c;\n\t\tlong long int add = 0;\n\t\tfor (int j = 0; j < MD; j++) {\n\t\t\tadd = max(add, c - dis[j][a] - dis[j][b]);\n\t\t}\n\t\tans += add;\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":260,"memory_kb":16844,"score_of_the_acc":-1.6025,"final_rank":7},{"submission_id":"aoj_2810_3527952","code_snippet":"#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <cmath>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e9 + 7;\n\n#define MAX_V 200000\n\nstruct edge{\n\tint to;\n\tlong long int cost;\n};\n\nvector<edge> G[MAX_V];\nlong long int cost[10][MAX_V];\n\nvoid shortest_path(int s, int V, long long int d[]){\n\t\n\tpriority_queue<P, vector<P>, greater<P> > que;\n\t\n\tfor(int i = 0; i < V; i++){\n\t\td[i] = INF;\n\t}\n\td[s] = 0;\n\t\n\tque.push(P(0, s));\n\t\n\twhile(!que.empty()){\n\t\t\n\t\tP p = que.top();\n\t\tque.pop();\n\t\t\n\t\tint v = p.second;\n\t\t\n\t\tif(d[v] < p.first){\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < G[v].size(); i++){\n\t\t\tedge e = G[v][i];\n\t\t\tif(d[e.to] > e.cost + d[v]){\n\t\t\t\td[e.to] = d[v] + e.cost;\n\t\t\t\tque.push(P(d[e.to], e.to));\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main(){\n int N, M, R, Q;\n cin >> N >> M >> R >> Q;\n for(int i = 0; i < M; i++){\n\t\tint u, v, cost;\n\t\tcin >> u >> v >> cost;\n edge e;\n e.cost = cost;\n e.to = u;\n G[v].push_back(e);\n }\n for(int i = 0; i < R; i++){\n G[0].clear();\n edge e;\n e.cost = 0;\n for(int j = 1; j <= N; j++){\n if(j % R == i){\n e.to = j;\n G[0].push_back(e);\n }\n }\n shortest_path(0, N + 1, cost[i]);\n }\n long long int ans = 0;\n for(int loop = 0; loop < Q; loop++){\n long long int x, y, z;\n cin >> x >> y >> z;\n long long int S = 0;\n for(int i = 0; i < R; i++){\n S = max(S, z - cost[i][x] - cost[i][y]);\n }\n ans += S;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":19252,"score_of_the_acc":-1.7507,"final_rank":11},{"submission_id":"aoj_2810_3253223","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2810.cc: Card Game\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_R = 10;\nconst int MAX_Z = 100000;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\ntypedef map<pii,int> mpii;\n\nstruct Stat {\n int d, i, j;\n Stat() {}\n Stat(int _d, int _i, int _j): d(_d), i(_i), j(_j) {}\n\n bool operator<(const Stat &s) const { return d > s.d; }\n void print() { printf(\"Stat: (%d,%d):%d\\n\", i, j, d); }\n};\n\n/* global variables */\n\nvpii nbrs[MAX_N];\nmpii dists;\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m, r, qn;\n scanf(\"%d%d%d%d\", &n, &m, &r, &qn);\n \n for (int i = 0; i < n; i++) {\n int a, b, c;\n scanf(\"%d%d%d\", &a, &b, &c);\n a--, b--;\n nbrs[a].push_back(pii(b, c));\n }\n\n ll sum = 0;\n \n while (qn--) {\n int x, y, z;\n scanf(\"%d%d%d\", &x, &y, &z);\n x--, y--;\n if (x > y) swap(x, y);\n\n priority_queue<Stat> q;\n q.push(Stat(0, x, y));\n\n dists.clear();\n dists[pii(x, y)] = 0;\n\n int mind = z;\n while (! q.empty()) {\n Stat u = q.top(); q.pop();\n //u.print();\n if (u.d != dists[pii(u.i, u.j)]) continue;\n\n if (u.i % r == u.j % r) {\n\tmind = u.d;\n\tbreak;\n }\n\n vpii &nbri = nbrs[u.i];\n for (vpii::iterator vit = nbri.begin(); vit != nbri.end(); vit++) {\n\tint vi = vit->first, vd = u.d + vit->second;\n\tif (vd < z) {\n\t int vj = u.j;\n\t if (vi > vj) swap(vi, vj);\n\t pii vp(vi, vj);\n\t mpii::iterator mit = dists.find(vp);\n\t if (mit == dists.end() || mit->second > vd) {\n\t dists[vp] = vd;\n\t q.push(Stat(vd, vi, vj));\n\t }\n\t}\n }\n\n vpii &nbrj = nbrs[u.j];\n for (vpii::iterator vit = nbrj.begin(); vit != nbrj.end(); vit++) {\n\tint vj = vit->first, vd = u.d + vit->second;\n\tif (vd < z) {\n\t int vi = u.i;\n\t if (vi > vj) swap(vi, vj);\n\t pii vp(vi, vj);\n\t mpii::iterator mit = dists.find(vp);\n\t if (mit == dists.end() || mit->second > vd) {\n\t dists[vp] = vd;\n\t q.push(Stat(vd, vi, vj));\n\t }\n\t}\n }\n }\n\n sum += z - mind;\n }\n\n printf(\"%lld\\n\", sum);\n return 0;\n}","accuracy":0.03333333333333333,"time_ms":20,"memory_kb":7052,"score_of_the_acc":0,"final_rank":14},{"submission_id":"aoj_2810_2977008","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n#define int ll\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1LL<<60)\n\n//verified AOJ GRL_1\n#define MAX_V 100020\ntemplate <typename T>\nstruct edge{int to;T cost;};\n\ntemplate <typename T>\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\n priority_queue< pii,vector<pii>,greater<pii> > que;\n rep( i,d.size() )d[i]=INF;\n d[s] = 0;\n que.push( pii(0,s) );\n \n while( que.size() ){\n pii p=que.top();\n que.pop();\n \n int v=p.second;\n if(d[v]<p.first)continue;\n \n rep(i,G[v].size()){\n edge<T> e=G[v][i];\n if(d[e.to]>d[v]+e.cost){\n d[e.to]=d[v]+e.cost;\n que.push(pii(d[e.to],e.to));\n }\n }\n }\n}\n\n\n\nsigned main(){\n int n,m,r,q;\n cin>>n>>m>>r>>q;\n vector<edge<int>> G[MAX_V];\n\n rep(i,m){\n int s,t,c;\n cin>>s>>t>>c;\n G[t].pb(edge<int>{s,c});\n }\n for(int i=1;i<=n;i++){\n G[n+1+i%r].pb(edge<int>{i,0});\n }\n \n static vector<vector<int>> d(r,vector<int>(n+r+1));\n for(int i=0;i<r;i++){\n dijkstra<int>(n+i+1,d[i],G);\n }\n \n int ans = 0;\n rep(i,q){\n int x,y,z;\n cin>>x>>y>>z;\n int mini = INF;\n rep(j,r){\n mini = min(mini,d[j][x]+d[j][y]);\n }\n if(z-mini>0)ans += z-mini;\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":260,"memory_kb":19192,"score_of_the_acc":-1.747,"final_rank":9},{"submission_id":"aoj_2810_2977006","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n#define int ll\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1LL<<60)\n\n//verified AOJ GRL_1\n#define MAX_V 100020\ntemplate <typename T>\nstruct edge{int to;T cost;};\n\ntemplate <typename T>\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\n priority_queue< pii,vector<pii>,greater<pii> > que;\n rep( i,d.size() )d[i]=INF;\n d[s] = 0;\n que.push( pii(0,s) );\n \n while( que.size() ){\n pii p=que.top();\n que.pop();\n \n int v=p.second;\n if(d[v]<p.first)continue;\n \n rep(i,G[v].size()){\n edge<T> e=G[v][i];\n if(d[e.to]>d[v]+e.cost){\n d[e.to]=d[v]+e.cost;\n que.push(pii(d[e.to],e.to));\n }\n }\n }\n}\n\n\n\nsigned main(){\n int n,m,r,q;\n cin>>n>>m>>r>>q;\n vector<edge<int>> G[MAX_V];\n\n rep(i,m){\n int s,t,c;\n cin>>s>>t>>c;\n G[t].pb(edge<int>{s,c});\n }\n for(int i=1;i<=n;i++){\n G[n+1+i%r].pb(edge<int>{i,0});\n }\n \n static vector<vector<int>> d(r,vector<int>(n+r));\n for(int i=0;i<r;i++){\n dijkstra<int>(n+i+1,d[i],G);\n }\n \n int ans = 0;\n rep(i,q){\n int x,y,z;\n cin>>x>>y>>z;\n int mini = INF;\n rep(j,r){\n mini = min(mini,d[j][x]+d[j][y]);\n }\n if(z-mini>0)ans += z-mini;\n }\n cout<<ans<<endl;\n}","accuracy":0.16666666666666666,"time_ms":260,"memory_kb":18096,"score_of_the_acc":-1.6795,"final_rank":12},{"submission_id":"aoj_2810_2977005","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n#define int ll\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1LL<<60)\n\n//verified AOJ GRL_1\n#define MAX_V 100011\ntemplate <typename T>\nstruct edge{int to;T cost;};\n\ntemplate <typename T>\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\n priority_queue< pii,vector<pii>,greater<pii> > que;\n rep( i,d.size() )d[i]=INF;\n d[s] = 0;\n que.push( pii(0,s) );\n \n while( que.size() ){\n pii p=que.top();\n que.pop();\n \n int v=p.second;\n if(d[v]<p.first)continue;\n \n rep(i,G[v].size()){\n edge<T> e=G[v][i];\n if(d[e.to]>d[v]+e.cost){\n d[e.to]=d[v]+e.cost;\n que.push(pii(d[e.to],e.to));\n }\n }\n }\n}\n\n\n\nsigned main(){\n int n,m,r,q;\n cin>>n>>m>>r>>q;\n vector<edge<int>> G[MAX_V];\n\n rep(i,m){\n int s,t,c;\n cin>>s>>t>>c;\n G[t].pb(edge<int>{s,c});\n }\n for(int i=1;i<=n;i++){\n G[n+1+i%r].pb(edge<int>{i,0});\n }\n \n vector<vector<int>> d(r,vector<int>(n+r));\n for(int i=0;i<r;i++){\n dijkstra<int>(n+i+1,d[i],G);\n }\n \n int ans = 0;\n rep(i,q){\n int x,y,z;\n cin>>x>>y>>z;\n int mini = INF;\n rep(j,r){\n mini = min(mini,d[j][x]+d[j][y]);\n }\n if(z-mini>0)ans += z-mini;\n }\n cout<<ans<<endl;\n}","accuracy":0.16666666666666666,"time_ms":260,"memory_kb":18204,"score_of_the_acc":-1.6862,"final_rank":13},{"submission_id":"aoj_2810_2976962","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n#define int ll\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1LL<<60)\n\n//verified AOJ GRL_1\n#define MAX_V 100011\ntemplate <typename T>\nstruct edge{int to;T cost;};\n\ntemplate <typename T>\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\n priority_queue< pii,vector<pii>,greater<pii> > que;\n rep( i,d.size() )d[i]=INF;\n d[s] = 0;\n que.push( pii(0,s) );\n \n while( que.size() ){\n pii p=que.top();\n que.pop();\n \n int v=p.second;\n if(d[v]<p.first)continue;\n \n rep(i,G[v].size()){\n edge<T> e=G[v][i];\n if(d[e.to]>d[v]+e.cost){\n d[e.to]=d[v]+e.cost;\n que.push(pii(d[e.to],e.to));\n }\n }\n }\n}\n\n\n\nsigned main(){\n int n,m,r,q;\n cin>>n>>m>>r>>q;\n vector<edge<int>> G[MAX_V];\n\n rep(i,m){\n int s,t,c;\n cin>>s>>t>>c;\n G[t].pb(edge<int>{s,c});\n }\n for(int i=1;i<=n;i++){\n G[n+i%r].pb(edge<int>{i,0});\n }\n \n vector<vector<int>> d(r,vector<int>(n+r));\n for(int i=0;i<r;i++){\n dijkstra<int>(n+i,d[i],G);\n }\n \n int ans = 0;\n rep(i,q){\n int x,y,z;\n cin>>x>>y>>z;\n int mini = INF;\n rep(j,r){\n mini = min(mini,d[j][x]+d[j][y]);\n }\n if(z-mini>0)ans += z-mini;\n }\n cout<<ans<<endl;\n}","accuracy":0.03333333333333333,"time_ms":110,"memory_kb":13980,"score_of_the_acc":-0.8013,"final_rank":19},{"submission_id":"aoj_2810_2976954","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n#define int ll\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1LL<<60)\n\n//verified AOJ GRL_1\n#define MAX_V 100011\ntemplate <typename T>\nstruct edge{int to;T cost;};\n\ntemplate <typename T>\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\n priority_queue< pii,vector<pii>,greater<pii> > que;\n rep( i,d.size() )d[i]=INF;\n d[s] = 0;\n que.push( pii(0,s) );\n \n while( que.size() ){\n pii p=que.top();\n que.pop();\n \n int v=p.second;\n if(d[v]<p.first)continue;\n \n rep(i,G[v].size()){\n edge<T> e=G[v][i];\n if(d[e.to]>d[v]+e.cost){\n d[e.to]=d[v]+e.cost;\n que.push(pii(d[e.to],e.to));\n }\n }\n }\n}\n\n\n\nsigned main(){\n int n,m,r,q;\n cin>>n>>m>>r>>q;\n vector<edge<int>> G[MAX_V];\n\n rep(i,m){\n int s,t,c;\n cin>>s>>t>>c;\n G[t].pb(edge<int>{s,c});\n }\n for(int i=1;i<=n;i++){\n G[n+i%r].pb(edge<int>{i,0});\n }\n \n vector<vector<int>> d(r,vector<int>(n+r));\n for(int i=0;i<r;i++){\n dijkstra<int>(n+i,d[i],G);\n }\n \n int ans = 0;\n rep(i,q){\n int x,y,z;\n cin>>x>>y>>z;\n int mini = INF;\n rep(i,r){\n mini = min(mini,d[i][x]+d[i][y]);\n }\n if(z-mini>0)ans += z-mini;\n }\n cout<<ans<<endl;\n}","accuracy":0.03333333333333333,"time_ms":110,"memory_kb":14124,"score_of_the_acc":-0.8101,"final_rank":20},{"submission_id":"aoj_2810_2976947","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1e9+1)\n\n//verified AOJ GRL_1\n#define MAX_V 100011\ntemplate <typename T>\nstruct edge{int to;T cost;};\n\ntemplate <typename T>\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\n priority_queue< pii,vector<pii>,greater<pii> > que;\n rep( i,d.size() )d[i]=INF;\n d[s] = 0;\n que.push( pii(0,s) );\n \n while( que.size() ){\n pii p=que.top();\n que.pop();\n \n int v=p.second;\n if(d[v]<p.first)continue;\n \n rep(i,G[v].size()){\n edge<T> e=G[v][i];\n if(d[e.to]>d[v]+e.cost){\n d[e.to]=d[v]+e.cost;\n que.push(pii(d[e.to],e.to));\n }\n }\n }\n}\n\n\n\nint main(){\n int n,m,r,q;\n cin>>n>>m>>r>>q;\n vector<edge<int>> G[MAX_V];\n\n rep(i,m){\n int s,t,c;\n cin>>s>>t>>c;\n G[t].pb(edge<int>{s,c});\n }\n for(int i=1;i<=n;i++){\n G[n+i%r].pb(edge<int>{i,0});\n }\n \n vector<vector<int>> d(r,vector<int>(n+r));\n for(int i=0;i<r;i++){\n dijkstra<int>(n+i,d[i],G);\n }\n \n int ans = 0;\n rep(i,q){\n int x,y,z;\n cin>>x>>y>>z;\n int mini = INF;\n rep(i,r){\n mini = min(mini,d[i][x]+d[i][y]);\n }\n if(z-mini>0)ans += z-mini;\n }\n cout<<ans<<endl;\n}","accuracy":0.03333333333333333,"time_ms":100,"memory_kb":10416,"score_of_the_acc":-0.5403,"final_rank":17},{"submission_id":"aoj_2810_2695017","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n//#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define BIG_NUM 200000000000\n#define NUM 100000\n\n\nstruct Info{\n\tInfo(int arg_to,ll arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to;\n\tll cost;\n};\n\nstruct Data{\n\tData(int arg_num,ll arg_cost){\n\t\tnum = arg_num;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\t\treturn cost > arg.cost;\n\t}\n\tint num;\n\tll cost;\n};\n\nvector<Info> rev_G[NUM+1];\nll min_cost[10][NUM+1];\n\n\nint main(){\n\n\tint N,M,R,Q;\n\tscanf(\"%d %d %d %d\",&N,&M,&R,&Q);\n\n\tint from,to;\n\tll cost;\n\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%d %d %lld\",&from,&to,&cost);\n\t\trev_G[to].push_back(Info(from,cost));\n\t}\n\n\tfor(int i = 0; i < R; i++){\n\t\tfor(int k = 1; k <= N; k++)min_cost[i][k] = BIG_NUM;\n\t}\n\n\tint next_num;\n\tll next_cost;\n\tpriority_queue<Data> PQ;\n\n\tfor(int start = 0; start < R; start++){\n\n\t\tfor(int to = 1; to <= N; to++){\n\t\t\tif(to%R == start){\n\t\t\t\tmin_cost[start][to] = 0;\n\t\t\t\tPQ.push(Data(to,0));\n\t\t\t}else{\n\t\t\t\tmin_cost[start][to] = BIG_NUM;\n\t\t\t}\n\t\t}\n\n\t\twhile(!PQ.empty()){\n\n\t\t\tif(PQ.top().cost > min_cost[start][PQ.top().num]){\n\t\t\t\tPQ.pop();\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < rev_G[PQ.top().num].size(); i++){\n\t\t\t\tnext_num = rev_G[PQ.top().num][i].to;\n\t\t\t\tnext_cost = PQ.top().cost+rev_G[PQ.top().num][i].cost;\n\n\t\t\t\tif(min_cost[start][next_num] > next_cost){\n\t\t\t\t\tmin_cost[start][next_num] = next_cost;\n\t\t\t\t\tPQ.push(Data(next_num,next_cost));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tPQ.pop();\n\t\t}\n\t}\n\n\tll ans = 0;\n\tint x,y;\n\tll z,minimum;\n\n\tfor(int loop = 0; loop < Q; loop++){\n\t\tscanf(\"%d %d %lld\",&x,&y,&z);\n\n\t\tif(x%R == y%R){\n\t\t\tans += z;\n\t\t\tcontinue;\n\t\t}\n\n\t\tminimum = BIG_NUM;\n\t\tfor(int i = 0; i < R; i++){\n\t\t\tif(min_cost[i][x] == BIG_NUM || min_cost[i][y] == BIG_NUM)continue;\n\t\t\tminimum = min(minimum,min_cost[i][x]+min_cost[i][y]);\n\t\t}\n\n\t\tif(z > minimum){\n\t\t\tans += z-minimum;\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":170,"memory_kb":16620,"score_of_the_acc":-1.2137,"final_rank":5},{"submission_id":"aoj_2810_2694991","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n//#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define BIG_NUM 200000000000\n#define NUM 100000\n\n\nstruct Info{\n\tInfo(int arg_to,ll arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to;\n\tll cost;\n};\n\nstruct Data{\n\tData(int arg_num,ll arg_cost){\n\t\tnum = arg_num;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\t\treturn cost > arg.cost;\n\t}\n\tint num;\n\tll cost;\n};\n\nvector<Info> G[NUM+1];\nll min_cost[NUM+1][10];\n\n\nint main(){\n\n\tint N,M,R,Q;\n\tscanf(\"%d %d %d %d\",&N,&M,&R,&Q);\n\n\tint from,to;\n\tll cost;\n\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%d %d %lld\",&from,&to,&cost);\n\t\tG[from].push_back(Info(to,cost)); //★有向と解釈\n\t}\n\n\t//各数字から、Rで割ったあまりへの最小移行コストを計算する\n\tfor(int i = 1; i <= N; i++){\n\t\tfor(int k = 0; k < R; k++)min_cost[i][k] = BIG_NUM;\n\t}\n\n\tint next_num;\n\tll next_cost;\n\tpriority_queue<Data> PQ;\n\n\tfor(int i = 1; i <= N; i++){\n\t\tmin_cost[i][i%R] = 0; //数字そのものの、Rで割った余りは当然コスト0\n\n\t\tPQ.push(Data(i,0));\n\n\t\twhile(!PQ.empty()){\n\n\t\t\tif(PQ.top().cost > min_cost[i][PQ.top().num%R]){\n\t\t\t\tPQ.pop();\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int k = 0; k < G[PQ.top().num].size(); k++){\n\t\t\t\tnext_num = G[PQ.top().num][k].to;\n\t\t\t\tnext_cost = PQ.top().cost+G[PQ.top().num][k].cost;\n\n\t\t\t\tif(min_cost[i][next_num%R] > next_cost){\n\t\t\t\t\tmin_cost[i][next_num%R] = next_cost;\n\t\t\t\t\tPQ.push(Data(next_num,next_cost));\n\t\t\t\t}\n\t\t\t}\n\t\t\tPQ.pop();\n\t\t}\n\t}\n\n\tll ans = 0;\n\tint x,y;\n\tll z,minimum;\n\n\tfor(int loop = 0; loop < Q; loop++){\n\t\tscanf(\"%d %d %lld\",&x,&y,&z);\n\n\t\tif(x%R == y%R){\n\t\t\tans += z;\n\t\t\tcontinue;\n\t\t}\n\n\t\tminimum = BIG_NUM;\n\t\tfor(int i = 0; i < R; i++){\n\t\t\tif(min_cost[x][i] == BIG_NUM || min_cost[y][i] == BIG_NUM)continue;\n\t\t\tminimum = min(minimum,min_cost[x][i]+min_cost[y][i]);\n\t\t}\n\n\t\tif(z > minimum){ //報酬が最小変換コストより高い場合\n\t\t\tans += z-minimum;\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.03333333333333333,"time_ms":60,"memory_kb":13324,"score_of_the_acc":-0.5526,"final_rank":18},{"submission_id":"aoj_2810_2694942","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n//#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define BIG_NUM 200000000000\n#define NUM 100000\n\n\nstruct Info{\n\tInfo(int arg_to,ll arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to;\n\tll cost;\n};\n\nstruct Data{\n\tData(int arg_num,ll arg_cost){\n\t\tnum = arg_num;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\t\treturn cost > arg.cost;\n\t}\n\tint num;\n\tll cost;\n};\n\nvector<Info> G[NUM+1];\nll min_cost[NUM+1][10];\n\n\nint main(){\n\n\tint N,M,R,Q;\n\tscanf(\"%d %d %d %d\",&N,&M,&R,&Q);\n\n\tint from,to,cost;\n\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%d %d %lld\",&from,&to,&cost);\n\t\tG[from].push_back(Info(to,cost));\n\t}\n\n\tfor(int i = 1; i <= N; i++){\n\t\tfor(int k = 0; k < R; k++)min_cost[i][k] = BIG_NUM;\n\t}\n\n\tint next_num;\n\tll next_cost;\n\tpriority_queue<Data> PQ;\n\n\tfor(int i = 1; i <= N; i++){\n\t\tmin_cost[i][i%R] = 0;\n\n\t\tPQ.push(Data(i,0));\n\n\t\twhile(!PQ.empty()){\n\n\t\t\tfor(int k = 0; k < G[PQ.top().num].size(); k++){\n\t\t\t\tnext_num = G[PQ.top().num][k].to;\n\t\t\t\tnext_cost = PQ.top().cost+G[PQ.top().num][k].cost;\n\n\t\t\t\tif(min_cost[i][next_num%R] > next_cost){\n\t\t\t\t\tmin_cost[i][next_num%R] = next_cost;\n\t\t\t\t\tPQ.push(Data(next_num,next_cost));\n\t\t\t\t}\n\t\t\t}\n\t\t\tPQ.pop();\n\t\t}\n\t}\n\n\tll ans = 0;\n\tint x,y;\n\tll z,minimum;\n\n\tfor(int loop = 0; loop < Q; loop++){\n\t\tscanf(\"%d %d %lld\",&x,&y,&z);\n\n\t\tif(x%R == y%R){\n\t\t\tans += z;\n\t\t\tcontinue;\n\t\t}\n\n\t\tminimum = BIG_NUM;\n\t\tfor(int i = 0; i < R; i++){\n\t\t\tif(min_cost[x][i] == BIG_NUM || min_cost[y][i] == BIG_NUM)continue;\n\t\t\tminimum = min(minimum,min_cost[x][i]+min_cost[y][i]);\n\t\t}\n\n\t\tif(z > minimum){\n\t\t\tans += z-minimum;\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.03333333333333333,"time_ms":50,"memory_kb":13384,"score_of_the_acc":-0.5146,"final_rank":16}],"string":"[\n {\n \"submission_id\": \"aoj_2810_10412963\",\n \"code_snippet\": \"// AOJ #2810 Card Game\\n// 2025.4.23\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll INF = (ll)1e18;\\n\\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(), M = Cin(), R = Cin(), Q = Cin();\\n\\n vector<vector<pair<int,int>>> G(N+1);\\n for(int i = 0; i < M; i++){\\n int a = Cin(), b = Cin(), c = Cin();\\n G[b].emplace_back(a, c);\\n }\\n vector<vector<ll>> dist(R, vector<ll>(N+1, INF));\\n for(int r = 0; r < R; r++){\\n priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<>> pq;\\n for(int v = r == 0 ? R : r; v <= N; v += R){\\n dist[r][v] = 0;\\n pq.emplace(0, v);\\n }\\n while(!pq.empty()){\\n auto [d, v] = pq.top(); pq.pop();\\n if(d > dist[r][v]) continue;\\n for(auto &e : G[v]){\\n int u = e.first, w = e.second;\\n if(dist[r][u] > d + w){\\n dist[r][u] = d + w;\\n pq.emplace(dist[r][u], u);\\n }\\n }\\n }\\n }\\n\\n ll ans = 0;\\n for(int i = 0; i < Q; i++){\\n int x = Cin(), y = Cin();\\n ll z = Cin();\\n ll best = 0;\\n for(int r = 0; r < R; r++){\\n ll cx = dist[r][x], cy = dist[r][y];\\n if(cx == INF || cy == INF) continue;\\n ll cost = cx + cy;\\n if(cost <= z) best = max(best, z - cost);\\n }\\n ans += best;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 17116,\n \"score_of_the_acc\": -0.9526,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2810_9117726\",\n \"code_snippet\": \"//#include<atcoder/all>\\n//using namespace atcoder;\\n\\n#include <bits/stdc++.h>\\ntemplate<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}\\ntemplate<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}\\n#define ll long long\\n#define double long double\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define REP(i,n) for(int i=1;i<=(n);i++)\\n#define mod (ll)(1e9+7)\\n#define inf (ll)(3e18+7)\\n#define eps (double)(1e-9)\\n#define pi (double) acos(-1)\\n#define all(x) x.begin(),x.end()\\n#define rall(x) x.rbegin(),x.rend()\\nusing namespace std;\\n\\nstruct edge{\\n ll to, cost;\\n};\\n\\nusing Graph = vector<vector<edge>>;\\n\\n#define P pair<ll, ll>\\nvector<ll> dijkstra(const vector<vector<edge>> &G, int s) {\\n vector<ll> d((int)G.size(), inf);\\n\\tpriority_queue<P, vector<P>, greater<P>>que;\\n\\td[s] = 0;\\n\\tque.push(P(0, s));\\n\\twhile (!que.empty()) {\\n\\t\\tP p = que.top(); que.pop();\\n\\t\\tint v = p.second;\\n\\t\\tif (d[v] < p.first)continue;\\n\\t\\trep(i, G[v].size()) {\\n\\t\\t\\tedge e = G[v][i];\\n\\t\\t\\tif (d[e.to] > d[v] + e.cost) {\\n\\t\\t\\t\\td[e.to] = d[v] + e.cost;\\n\\t\\t\\t\\tque.push(P(d[e.to], e.to));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn d;\\n}\\n\\nint main(){\\n int n, m, r, q;\\n cin >> n >> m >> r >> q;\\n vector<ll> a(m), b(m), c(m);\\n vector<ll> x(q), y(q), z(q);\\n rep(i, m)cin >> a[i] >> b[i] >> c[i];\\n rep(i, q)cin >> x[i] >> y[i] >> z[i];\\n rep(i, m){a[i]--; b[i]--;}\\n\\n Graph G(n+r);\\n rep(i, m)G[b[i]].push_back({a[i], c[i]});\\n rep(i, n)G[n+i%r].push_back({i, 0});\\n\\n vector<vector<ll>> d(r);\\n rep(i, r)d[i] = dijkstra(G, n+i);\\n\\n ll ans = 0;\\n rep(i, q){\\n x[i]--;\\n y[i]--;\\n ll now = inf;\\n rep(j, r){\\n chmin(now, d[j][x[i]] + d[j][y[i]]);\\n }\\n\\n ans += max(0LL, z[i] - now);\\n }\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 23304,\n \"score_of_the_acc\": -1.75,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2810_9117637\",\n \"code_snippet\": \"// #ifndef ONLINE_JUDGE\\n#if __has_include(\\\"all.h\\\")\\n\\n#include \\\"all.h\\\"\\n\\n#else\\n\\n#include <bits/extc++.h>\\n\\n// #include <atcoder/all>\\n\\n#endif\\n\\nusing ll = long long int;\\n\\ntemplate <class T>\\nbool chmin(T &x, const T val) {\\n if (x > val) {\\n x = val;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T>\\nbool chmax(T &x, const T val) {\\n if (x < val) {\\n x = val;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class... T>\\nstd::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) {\\n std::apply([&](auto &&...args) { (is >> ... >> args); }, tpl);\\n return is;\\n}\\n\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &x : v) is >> x;\\n return is;\\n}\\n\\n// template <class mint, atcoder::internal::is_static_modint_t<mint> * =\\n// nullptr> std::ostream &operator<<(std::ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (int i = 0; i < v.size(); i++)\\n os << v[i] << (i == v.size() - 1 ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\nstruct Initialization {\\n Initialization() {\\n std::ios_base::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n }\\n} initialization;\\n\\nconstexpr std::pair<int, int> dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\\n\\ntemplate <typename T>\\nusing infs = std::numeric_limits<T>;\\n\\ntemplate <typename T>\\nclass factorials {\\n public:\\n static size_t n;\\n static std::vector<T> fact, inv_fact;\\n\\n static void extend(size_t m) {\\n if (m <= n) return;\\n fact.resize(m + 1);\\n inv_fact.resize(m + 1);\\n for (size_t i = n + 1; i <= m; i++) fact[i] = fact[i - 1] * i;\\n inv_fact[m] = fact[m].inv();\\n for (size_t i = m; i > n + 1; i--) inv_fact[i - 1] = inv_fact[i] * i;\\n n = m;\\n }\\n\\n static T inv(int k) {\\n extend(k);\\n return inv_fact[k];\\n }\\n\\n static T get(int k) {\\n extend(k);\\n return fact[k];\\n }\\n\\n static T perm(int n, int k) {\\n if (n < k) return 0;\\n if (k < 0) return 0;\\n extend(n);\\n return fact[n] * inv_fact[n - k];\\n }\\n\\n static T choose(int n, int k) {\\n if (n < k) return 0;\\n if (k < 0) return 0;\\n extend(n);\\n return fact[n] * inv_fact[n - k] * inv_fact[k];\\n }\\n};\\n\\ntemplate <typename T>\\nsize_t factorials<T>::n = 0;\\n\\ntemplate <typename T>\\nstd::vector<T> factorials<T>::fact = {1};\\n\\ntemplate <typename T>\\nstd::vector<T> factorials<T>::inv_fact = {1};\\n\\n// template <typename T>\\n// class fps {\\n// std::vector<T> v;\\n//\\n// public:\\n// using value_type = T;\\n// using reference = T &;\\n// using const_reference = const T &;\\n// using iterator = typename std::vector<T>::iterator;\\n// using const_iterator = typename std::vector<T>::const_iterator;\\n//\\n// size_t size() const { return v.size(); }\\n//\\n// const std::vector<T> &data() const { return v; }\\n//\\n// explicit fps(int n) : v(n) {}\\n//\\n// fps(const std::vector<T> &v) : v(v) {}\\n// fps(std::vector<T> &&v) : v(v) {}\\n//\\n// template <class InputIterator>\\n// fps(InputIterator first, InputIterator last) : v(first, last) {}\\n//\\n// void resize(int n) { v.resize(n); }\\n//\\n// T &operator[](int i) { return v[i]; }\\n//\\n// iterator begin() { return v.begin(); }\\n//\\n// iterator end() { return v.end(); }\\n//\\n// fps diff() {\\n// std::vector<T> res(v.size() - 1);\\n// for (int i = 0; i < res.size(); i++) res[i] = v[i + 1] * (i + 1);\\n// return fps(res);\\n// }\\n//\\n// fps integral() {\\n// std::vector<T> res(v.size() + 1);\\n// for (int i = 0; i < v.size(); i++) res[i + 1] = v[i] / (i + 1);\\n// return fps(res);\\n// }\\n//\\n// fps inv(int deg = -1) {\\n// assert(v[0] != 0);\\n//\\n// if (deg == -1) deg = size();\\n// std::vector<T> res(deg);\\n//\\n// res[0] = v[0].inv();\\n//\\n// for (int d = 1; d < deg; d <<= 1) {\\n// std::vector<T> f(2 * d), g(2 * d);\\n//\\n// std::copy(v.begin(), v.begin() + std::min(2 * d, (int)v.size()),\\n// std::back_inserter(f));\\n// std::copy(res.begin(), res.begin() + d, std::back_inserter(g));\\n//\\n// atcoder::internal::butterfly(f);\\n// atcoder::internal::butterfly(g);\\n//\\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\\n//\\n// atcoder::internal::butterfly_inv(f);\\n//\\n// for (int i = 0; i < d; i++) f[i] = 0;\\n//\\n// atcoder::internal::butterfly(f);\\n//\\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\\n//\\n// atcoder::internal::butterfly_inv(f);\\n//\\n// for (int i = d; i < std::min(2 * d, deg); i++) res[i] = -f[i];\\n// }\\n//\\n// res.resize(deg);\\n//\\n// return res;\\n// }\\n//\\n// fps shift(T c) {\\n// std::vector<T> res(size()), ifacts(size());\\n//\\n// T x = 1;\\n//\\n// for (int i = 0; i < size(); i++) {\\n// ifacts[i] = x * factorials<T>::inv(i);\\n// x *= c;\\n// }\\n//\\n// for (int i = 0; i < size(); i++) {\\n// res[size() - 1 - i] = v[i] * factorials<T>::get(i);\\n// }\\n//\\n// res = atcoder::convolution(res, ifacts);\\n//\\n// res.resize(size());\\n//\\n// std::ranges::reverse(res);\\n//\\n// for (int i = 0; i < size(); i++) {\\n// res[i] *= factorials<T>::inv(i);\\n// }\\n//\\n// return res;\\n// }\\n//\\n// fps operator-() {\\n// fps res(v.size());\\n// for (int i = 0; i < v.size(); i++) res[i] = -v[i];\\n// return res;\\n// }\\n//\\n// fps &operator+=(const fps &rhs) {\\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\\n// for (int i = 0; i < rhs.v.size(); i++) v[i] += rhs.v[i];\\n// return *this;\\n// }\\n//\\n// fps &operator-=(const fps &rhs) {\\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\\n// for (int i = 0; i < rhs.v.size(); i++) v[i] -= rhs.v[i];\\n// return *this;\\n// }\\n//\\n// fps &operator*=(const fps &rhs) {\\n// return *this = atcoder::convolution(v, rhs.v);\\n// }\\n//\\n// fps &operator+=(const T &rhs) {\\n// if (v.size() == 0) v.resize(1);\\n// v[0] += rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator-=(const T &rhs) {\\n// if (v.size() == 0) v.resize(1);\\n// v[0] -= rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator*=(const T &rhs) {\\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator/=(const T &rhs) {\\n// T rhs_inv = rhs.inv();\\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs_inv;\\n// return *this;\\n// }\\n//\\n// friend fps operator+(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) += rhs;\\n// }\\n//\\n// friend fps operator-(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) -= rhs;\\n// }\\n//\\n// friend fps operator*(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) *= rhs;\\n// }\\n//\\n// friend fps operator+(const fps &lhs, const T &rhs) { return fps(lhs) +=\\n// rhs; }\\n//\\n// friend fps operator-(const fps &lhs, const T &rhs) { return fps(lhs) -=\\n// rhs; }\\n//\\n// friend fps operator*(const fps &lhs, const T &rhs) { return fps(lhs) *=\\n// rhs; }\\n//\\n// friend fps operator/(const fps &lhs, const T &rhs) { return fps(lhs) /=\\n// rhs; }\\n//\\n// friend fps operator+(const T &lhs, const fps &rhs) { return fps(rhs) +=\\n// lhs; }\\n//\\n// friend fps operator-(const T &lhs, const fps &rhs) {\\n// return -(fps(rhs) -= lhs);\\n// }\\n//\\n// friend fps operator*(const T &lhs, const fps &rhs) { return fps(rhs) *=\\n// lhs; }\\n// };\\n\\n// using mint = atcoder::modint998244353;\\n// using mint = atcoder::modint1000000007;\\n\\n// using fs = factorials<mint>;\\n\\nint main() {\\n int N, M, R, Q;\\n std::cin >> N >> M >> R >> Q;\\n\\n std::vector graph(N, std::vector<std::pair<int, ll>>());\\n\\n for (int i = 0; i < M; i++) {\\n int a, b;\\n ll c;\\n std::cin >> a >> b >> c;\\n a--;\\n b--;\\n\\n graph[b].emplace_back(a, c);\\n }\\n\\n std::vector dist(R, std::vector(N, infs<ll>::max() / 4));\\n\\n for (int r = 0; r < R; r++) {\\n std::priority_queue<std::pair<ll, int>> priq;\\n\\n std::vector<bool> locked(N);\\n\\n for (int i = r; i < N; i += R) {\\n dist[r][i] = 0;\\n priq.emplace(0, i);\\n }\\n\\n while (!priq.empty()) {\\n auto [c, v] = priq.top();\\n priq.pop();\\n\\n if (locked[v]) continue;\\n c = -c;\\n locked[v] = true;\\n\\n for (auto [w, d] : graph[v]) {\\n if (chmin(dist[r][w], c + d)) {\\n priq.emplace(-(c + d), w);\\n }\\n }\\n }\\n }\\n\\n ll ans = 0;\\n\\n for (int i = 0; i < Q; i++) {\\n int x, y;\\n ll z;\\n std::cin >> x >> y >> z;\\n\\n x--;\\n y--;\\n\\n ll tmp = infs<ll>::max() / 4;\\n\\n for (int r = 0; r < R; r++) {\\n chmin(tmp, dist[r][x] + dist[r][y]);\\n }\\n\\n ans += std::max(0LL, z - tmp);\\n }\\n\\n std::cout << ans << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 17072,\n \"score_of_the_acc\": -1.0749,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2810_9117624\",\n \"code_snippet\": \"//#include<atcoder/all>\\n//using namespace atcoder;\\n\\n#include <bits/stdc++.h>\\ntemplate<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}\\ntemplate<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}\\n#define ll long long\\n#define double long double\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define REP(i,n) for(int i=1;i<=(n);i++)\\n#define mod (ll)(1e9+7)\\n#define inf (ll)(3e18+7)\\n#define eps (double)(1e-9)\\n#define pi (double) acos(-1)\\n#define all(x) x.begin(),x.end()\\n#define rall(x) x.rbegin(),x.rend()\\nusing namespace std;\\n\\nint main(){\\n int n, m, r, q;\\n cin >> n >> m >> r >> q;\\n vector<ll> a(m), b(m), c(m);\\n vector<ll> x(q), y(q), z(q);\\n rep(i, m)cin >> a[i] >> b[i] >> c[i];\\n rep(i, q)cin >> x[i] >> y[i] >> z[i];\\n\\n vector<vector<ll>> mn(n+1, vector<ll>(r, inf));\\n rep(i, m)chmin(mn[a[i]][b[i]%r], c[i]);\\n\\n ll ans = 0;\\n rep(i, q){\\n ll now = inf;\\n rep(j, r){\\n ll cost1 = mn[x[i]][j];\\n ll cost2 = mn[y[i]][j];\\n if(x[i] % r == j)cost1 = 0;\\n if(y[i] % r == j)cost2 = 0;\\n chmin(now, cost1 + cost2);\\n }\\n ans += max(0LL, - now + z[i]);\\n }\\n\\n cout << ans << endl;\\n\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 50,\n \"memory_kb\": 12844,\n \"score_of_the_acc\": -0.4814,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2810_9117621\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//高速化 \\nstruct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;\\n//#define endl '\\\\n' //インタラクティブ問題の時は消す\\n\\n//型\\nusing ll = long long;\\nusing ld = long double;\\ntemplate<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;\\nusing vi = vc<int>; using vvi = vvc<int>; using vvvi = vvvc<int>;\\nusing vl = vc<ll>; using vvl = vvc<ll>; using vvvl = vvvc<ll>;\\nusing pi = pair<int, int>; using pl = pair<ll, ll>;\\nusing ull = unsigned ll;\\ntemplate<class T>using priq = priority_queue<T>;\\ntemplate<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;\\n\\n// for文\\n#define overload4(a, b, c, d, e, ...) e\\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, step) for(ll i = a; i < b; i+= step)\\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define per1(n) for(ll i = n-1; i >= 0; i--)\\n#define per2(i, n) for(ll i = n-1; i >= 0; i--)\\n#define per3(i, a, b) for(ll i = b-1; i >= a; i--)\\n#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)\\n#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)\\n#define fore1(a) for(auto&& i : a)\\t\\n#define fore2(i,a) for(auto&& i : a)\\n#define fore3(x,y,a) for(auto&& [x, y] : a)\\n#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)\\n#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)\\n\\n//関数\\n#define mp make_pair\\n#define mt make_tuple\\n#define a first\\n#define b second\\n#define pb emplace_back\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define si(x) (ll)(x).size()\\ntemplate<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}\\ntemplate<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}\\ntemplate<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}\\ntemplate<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}\\ntemplate<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}\\ntemplate<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}\\ntemplate<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}\\n\\n//入出力(operator)\\ntemplate<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}\\ntemplate<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}\\n\\ntemplate<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<\\\" \\\"<<a.b;}\\ntemplate<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<\\\" \\\";}return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<\\\" \\\";}return os;}\\ntemplate<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<\\\" \\\"<<y<<\\\"\\\\n\\\";}return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<\\\" \\\";}return os;}\\ntemplate<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<\\\" \\\"<<y<<\\\"\\\\n\\\";}return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<\\\" \\\";return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<\\\"\\\\n\\\";return os;}\\n\\n//入出力(関数)\\nvi readvi(ll n){vi a(n);cin>>a;return a;}\\nvl readvl(ll n){vl a(n);cin>>a;return a;}\\nvvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].pb(b);if(bidirected)g[b].pb(a);}return g;}\\nvvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].pb(b,c);if(bidirected)g[b].pb(a,c);}return g;}\\nvvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}\\nvvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}\\n\\ninline void yes(){cout << \\\"Yes\\\\n\\\";}\\ninline void no(){cout << \\\"No\\\\n\\\";}\\ninline void yesno(bool y = true){if(y)yes();else no();}\\n\\n//定数\\nconstexpr ll mod = 998244353;\\nconstexpr ll minf=-(1<<29);\\nconstexpr ll inf=(1<<29);\\nconstexpr ll MINF=-(1LL<<60);\\nconstexpr ll INF=(1LL<<60);\\nconstexpr ld EPS = 1e-8;\\nconst ld PI = acosl(-1);\\n#define equals(a, b) (abs((a) - (b)) < EPS)\\nconst int dx[4] ={-1, 0, 1, 0};\\nconst int dy[4] ={ 0, 1, 0,-1};\\nconst int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};\\nconst int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};\\n\\nvoid solve();\\nint main() {\\n\\tint t = 1;\\n // cin >>t;\\n while(t--)solve();\\n}\\n\\n\\n\\nvoid solve(){\\n ll n,m,q,r;\\n cin >> n >> m >> r >> q;\\n\\n vvc<pi> g(n);\\n\\n vvi cst(n, vi(r, inf));\\n rep(i,n) cst[i][i % r] = 0;\\n rep(i,m){\\n int a,b,c;\\n cin >> a >> b >> c;\\n a--,b--;\\n g[b].emplace_back(a, c);\\n }\\n\\n rep(i,r){\\n priqg<pi> q;\\n rep(j,n){\\n if(j * r + i >= n) break;\\n q.push({0, j * r + i});\\n }\\n\\n while(q.size()){\\n int p = q.top().second;\\n int c = q.top().first;\\n q.pop();\\n if(cst[p][i] != c) continue;\\n\\n rep(j, si(g[p])){\\n if(chmin(cst[g[p][j].first][i], c + g[p][j].second)){\\n q.push({c + g[p][j].second, g[p][j].first});\\n }\\n }\\n }\\n }\\n\\n ll ans = 0;\\n rep(_, q){\\n int x,y,z;\\n cin >> x >> y >> z;\\n x--,y--;\\n\\n int mx = 0;\\n rep(i, r){\\n chmax(mx, z - cst[x][i] - cst[y][i]);\\n }\\n ans += mx;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 15880,\n \"score_of_the_acc\": -1.0849,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2810_8491873\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2810.cc: Card Game\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n#include<utility>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\nconst int MAX_R = 10;\\nconst long long LINF = 1LL << 60;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,int> pli;\\ntypedef vector<pii> vpii;\\n\\n/* global variables */\\n\\nvpii nbrs[MAX_N];\\nll kds[MAX_R][MAX_N];\\n\\n/* subroutines */\\n\\nvoid calcdists(int n, int k, int r, ll ds[]) {\\n fill(ds, ds + n, LINF);\\n priority_queue<pli> q;\\n\\n for (int u = k; u < n; u += r)\\n ds[u] = 0, q.push(pii(0, u));\\n\\n while (! q.empty()) {\\n auto ue = q.top(); q.pop();\\n ll ud = -ue.first;\\n int u = ue.second;\\n if (ud != ds[u]) continue;\\n\\n for (auto &vw: nbrs[u]) {\\n int v = vw.first;\\n ll vd = ud + vw.second;\\n if (ds[v] > vd) {\\n\\tds[v] = vd;\\n\\tq.push(pli(-vd, v));\\n }\\n }\\n }\\n}\\n\\n/* main */\\n\\nint main() {\\n int n, m, r, qn;\\n scanf(\\\"%d%d%d%d\\\", &n, &m, &r, &qn);\\n \\n for (int i = 0; i < m; i++) {\\n int a, b, c;\\n scanf(\\\"%d%d%d\\\", &a, &b, &c);\\n a--, b--;\\n nbrs[b].push_back(pii(a, c));\\n }\\n\\n for (int k = 0; k < r; k++) calcdists(n, k, r, kds[k]);\\n\\n ll sum = 0;\\n \\n while (qn--) {\\n int x, y, z;\\n scanf(\\\"%d%d%d\\\", &x, &y, &z);\\n x--, y--;\\n\\n ll maxd = 0;\\n for (int k = 0; k < r; k++)\\n maxd = max(maxd, z - (kds[k][x] + kds[k][y]));\\n\\n sum += maxd;\\n }\\n\\n printf(\\\"%lld\\\\n\\\", sum);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 16540,\n \"score_of_the_acc\": -1.0005,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2810_5967135\",\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\\\";}\\nstruct edge{\\n int to;\\n ll cost;\\n edge(int to,ll cost):to(to),cost(cost){}\\n};\\nint main(){\\n int n,m,r,q;\\n cin>>n>>m>>r>>q;\\n V<V<int>> d(r);\\n for(int i=1;i<=n;i++){\\n d[i%r].emplace_back(i);\\n }\\n V<V<edge>> g(n+1);\\n for(int i=0;i<m;i++){\\n ll a,b,c;\\n cin>>a>>b>>c;\\n g[b].emplace_back(a,c);\\n }\\n V<V<ll>> dp(n+1,V<ll>(r,inf));\\n for(int i=0;i<r;i++){\\n priority_queue<P,V<P>,greater<P>> pq;\\n for(int v:d[i]){\\n pq.emplace(0,v);\\n dp[v][i]=0;\\n }\\n while(pq.size()){\\n auto[v,cur]=pq.top();\\n pq.pop();\\n if(dp[cur][i]<v)continue;\\n for(edge &e:g[cur]){\\n if(chmin(dp[e.to][i],dp[cur][i]+e.cost)){\\n pq.emplace(dp[e.to][i],e.to);\\n }\\n }\\n }\\n }\\n ll ans=0;\\n for(int i=0;i<q;i++){\\n ll x,y,z;\\n cin>>x>>y>>z;\\n ll mi=inf;\\n for(int j=0;j<r;j++){\\n chmin(mi,dp[x][j]+dp[y][j]);\\n }\\n ans+=max(0ll,z-mi);\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 21344,\n \"score_of_the_acc\": -1.6711,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2810_3992939\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n\\n\\nint main() {\\n\\tint N, M, MD, K;\\n\\tcin >> N >> M >> MD >> K;\\n\\tvector<vector<pair<int, long long int>>>rev_edge(N + 1);\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tint l, r, k;\\n\\t\\tcin >> l >> r >> k;\\n\\t\\trev_edge[r].push_back({ l,k });\\n\\t}\\n\\tvector<vector<long long int>>dis(MD, vector<long long int>(N + 1,MOD*MOD));\\n\\tfor (int i = 0; i < MD; i++) {\\n\\t\\tfor (int j = i; j <= N; j += MD) {\\n\\t\\t\\tdis[i][j] = 0;\\n\\t\\t}\\n\\t\\tpriority_queue<pair<long long int, int>, vector<pair<long long int, int>>, greater<pair<long long int, int>>>PQ;\\n\\t\\tfor (int j = 0; j <= N; j++) {\\n\\t\\t\\tif (dis[i][j] == MOD*MOD) continue;\\n\\t\\t\\tPQ.push({ dis[i][j],j });\\n\\t\\t}\\n\\t\\twhile (!PQ.empty()) {\\n\\t\\t\\tint cn = PQ.top().second;\\n\\t\\t\\tlong long int c = PQ.top().first;\\n\\t\\t\\tPQ.pop();\\n\\t\\t\\tfor (auto j : rev_edge[cn]) {\\n\\t\\t\\t\\tif (dis[i][j.first]>c + j.second) {\\n\\t\\t\\t\\t\\tdis[i][j.first] = c + j.second;\\n\\t\\t\\t\\t\\tPQ.push({ dis[i][j.first],j.first });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tlong long int ans = 0;\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\tlong long int add = 0;\\n\\t\\tfor (int j = 0; j < MD; j++) {\\n\\t\\t\\tadd = max(add, c - dis[j][a] - dis[j][b]);\\n\\t\\t}\\n\\t\\tans += add;\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 16780,\n \"score_of_the_acc\": -1.5986,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2810_3991523\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n\\n\\nint main() {\\n\\tint N, M, MD, K;\\n\\tcin >> N >> M >> MD >> K;\\n\\tvector<vector<pair<int, long long int>>>rev_edge(N + 1);\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tint l, r, k;\\n\\t\\tcin >> l >> r >> k;\\n\\t\\trev_edge[r].push_back({ l,k });\\n\\t}\\n\\tvector<vector<long long int>>dis(MD, vector<long long int>(N + 1,MOD*MOD));\\n\\tfor (int i = 0; i < MD; i++) {\\n\\t\\tfor (int j = i; j <= N; j += MD) {\\n\\t\\t\\tdis[i][j] = 0;\\n\\t\\t}\\n\\t\\tpriority_queue<pair<long long int, int>, vector<pair<long long int, int>>, greater<pair<long long int, int>>>PQ;\\n\\t\\tfor (int j = 0; j <= N; j++) {\\n\\t\\t\\tif (dis[i][j] == MOD*MOD) continue;\\n\\t\\t\\tPQ.push({ dis[i][j],j });\\n\\t\\t}\\n\\t\\twhile (!PQ.empty()) {\\n\\t\\t\\tint cn = PQ.top().second;\\n\\t\\t\\tlong long int c = PQ.top().first;\\n\\t\\t\\tPQ.pop();\\n\\t\\t\\tfor (auto j : rev_edge[cn]) {\\n\\t\\t\\t\\tif (dis[i][j.first]>c + j.second) {\\n\\t\\t\\t\\t\\tdis[i][j.first] = c + j.second;\\n\\t\\t\\t\\t\\tPQ.push({ dis[i][j.first],j.first });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tlong long int ans = 0;\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\tlong long int add = 0;\\n\\t\\tfor (int j = 0; j < MD; j++) {\\n\\t\\t\\tadd = max(add, c - dis[j][a] - dis[j][b]);\\n\\t\\t}\\n\\t\\tans += add;\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 16844,\n \"score_of_the_acc\": -1.6025,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2810_3527952\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n\\n#include <cstdio>\\n#include <cstdlib>\\n#include <iostream>\\n#include <cmath>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n\\nusing namespace std;\\n\\ntypedef pair<long long int, long long int> P;\\n\\nlong long int INF = 1e18;\\nlong long int MOD = 1e9 + 7;\\n\\n#define MAX_V 200000\\n\\nstruct edge{\\n\\tint to;\\n\\tlong long int cost;\\n};\\n\\nvector<edge> G[MAX_V];\\nlong long int cost[10][MAX_V];\\n\\nvoid shortest_path(int s, int V, long long int d[]){\\n\\t\\n\\tpriority_queue<P, vector<P>, greater<P> > que;\\n\\t\\n\\tfor(int i = 0; i < V; i++){\\n\\t\\td[i] = INF;\\n\\t}\\n\\td[s] = 0;\\n\\t\\n\\tque.push(P(0, s));\\n\\t\\n\\twhile(!que.empty()){\\n\\t\\t\\n\\t\\tP p = que.top();\\n\\t\\tque.pop();\\n\\t\\t\\n\\t\\tint v = p.second;\\n\\t\\t\\n\\t\\tif(d[v] < p.first){\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i = 0; i < G[v].size(); i++){\\n\\t\\t\\tedge e = G[v][i];\\n\\t\\t\\tif(d[e.to] > e.cost + d[v]){\\n\\t\\t\\t\\td[e.to] = d[v] + e.cost;\\n\\t\\t\\t\\tque.push(P(d[e.to], e.to));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(){\\n int N, M, R, Q;\\n cin >> N >> M >> R >> Q;\\n for(int i = 0; i < M; i++){\\n\\t\\tint u, v, cost;\\n\\t\\tcin >> u >> v >> cost;\\n edge e;\\n e.cost = cost;\\n e.to = u;\\n G[v].push_back(e);\\n }\\n for(int i = 0; i < R; i++){\\n G[0].clear();\\n edge e;\\n e.cost = 0;\\n for(int j = 1; j <= N; j++){\\n if(j % R == i){\\n e.to = j;\\n G[0].push_back(e);\\n }\\n }\\n shortest_path(0, N + 1, cost[i]);\\n }\\n long long int ans = 0;\\n for(int loop = 0; loop < Q; loop++){\\n long long int x, y, z;\\n cin >> x >> y >> z;\\n long long int S = 0;\\n for(int i = 0; i < R; i++){\\n S = max(S, z - cost[i][x] - cost[i][y]);\\n }\\n ans += S;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 19252,\n \"score_of_the_acc\": -1.7507,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2810_3253223\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2810.cc: Card Game\\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\nconst int MAX_R = 10;\\nconst int MAX_Z = 100000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vpii;\\ntypedef map<pii,int> mpii;\\n\\nstruct Stat {\\n int d, i, j;\\n Stat() {}\\n Stat(int _d, int _i, int _j): d(_d), i(_i), j(_j) {}\\n\\n bool operator<(const Stat &s) const { return d > s.d; }\\n void print() { printf(\\\"Stat: (%d,%d):%d\\\\n\\\", i, j, d); }\\n};\\n\\n/* global variables */\\n\\nvpii nbrs[MAX_N];\\nmpii dists;\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, m, r, qn;\\n scanf(\\\"%d%d%d%d\\\", &n, &m, &r, &qn);\\n \\n for (int i = 0; i < n; i++) {\\n int a, b, c;\\n scanf(\\\"%d%d%d\\\", &a, &b, &c);\\n a--, b--;\\n nbrs[a].push_back(pii(b, c));\\n }\\n\\n ll sum = 0;\\n \\n while (qn--) {\\n int x, y, z;\\n scanf(\\\"%d%d%d\\\", &x, &y, &z);\\n x--, y--;\\n if (x > y) swap(x, y);\\n\\n priority_queue<Stat> q;\\n q.push(Stat(0, x, y));\\n\\n dists.clear();\\n dists[pii(x, y)] = 0;\\n\\n int mind = z;\\n while (! q.empty()) {\\n Stat u = q.top(); q.pop();\\n //u.print();\\n if (u.d != dists[pii(u.i, u.j)]) continue;\\n\\n if (u.i % r == u.j % r) {\\n\\tmind = u.d;\\n\\tbreak;\\n }\\n\\n vpii &nbri = nbrs[u.i];\\n for (vpii::iterator vit = nbri.begin(); vit != nbri.end(); vit++) {\\n\\tint vi = vit->first, vd = u.d + vit->second;\\n\\tif (vd < z) {\\n\\t int vj = u.j;\\n\\t if (vi > vj) swap(vi, vj);\\n\\t pii vp(vi, vj);\\n\\t mpii::iterator mit = dists.find(vp);\\n\\t if (mit == dists.end() || mit->second > vd) {\\n\\t dists[vp] = vd;\\n\\t q.push(Stat(vd, vi, vj));\\n\\t }\\n\\t}\\n }\\n\\n vpii &nbrj = nbrs[u.j];\\n for (vpii::iterator vit = nbrj.begin(); vit != nbrj.end(); vit++) {\\n\\tint vj = vit->first, vd = u.d + vit->second;\\n\\tif (vd < z) {\\n\\t int vi = u.i;\\n\\t if (vi > vj) swap(vi, vj);\\n\\t pii vp(vi, vj);\\n\\t mpii::iterator mit = dists.find(vp);\\n\\t if (mit == dists.end() || mit->second > vd) {\\n\\t dists[vp] = vd;\\n\\t q.push(Stat(vd, vi, vj));\\n\\t }\\n\\t}\\n }\\n }\\n\\n sum += z - mind;\\n }\\n\\n printf(\\\"%lld\\\\n\\\", sum);\\n return 0;\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 20,\n \"memory_kb\": 7052,\n \"score_of_the_acc\": 0,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2810_2977008\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\n#define int ll\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n#define INF (1LL<<60)\\n\\n//verified AOJ GRL_1\\n#define MAX_V 100020\\ntemplate <typename T>\\nstruct edge{int to;T cost;};\\n\\ntemplate <typename T>\\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\\n priority_queue< pii,vector<pii>,greater<pii> > que;\\n rep( i,d.size() )d[i]=INF;\\n d[s] = 0;\\n que.push( pii(0,s) );\\n \\n while( que.size() ){\\n pii p=que.top();\\n que.pop();\\n \\n int v=p.second;\\n if(d[v]<p.first)continue;\\n \\n rep(i,G[v].size()){\\n edge<T> e=G[v][i];\\n if(d[e.to]>d[v]+e.cost){\\n d[e.to]=d[v]+e.cost;\\n que.push(pii(d[e.to],e.to));\\n }\\n }\\n }\\n}\\n\\n\\n\\nsigned main(){\\n int n,m,r,q;\\n cin>>n>>m>>r>>q;\\n vector<edge<int>> G[MAX_V];\\n\\n rep(i,m){\\n int s,t,c;\\n cin>>s>>t>>c;\\n G[t].pb(edge<int>{s,c});\\n }\\n for(int i=1;i<=n;i++){\\n G[n+1+i%r].pb(edge<int>{i,0});\\n }\\n \\n static vector<vector<int>> d(r,vector<int>(n+r+1));\\n for(int i=0;i<r;i++){\\n dijkstra<int>(n+i+1,d[i],G);\\n }\\n \\n int ans = 0;\\n rep(i,q){\\n int x,y,z;\\n cin>>x>>y>>z;\\n int mini = INF;\\n rep(j,r){\\n mini = min(mini,d[j][x]+d[j][y]);\\n }\\n if(z-mini>0)ans += z-mini;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 19192,\n \"score_of_the_acc\": -1.747,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2810_2977006\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\n#define int ll\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n#define INF (1LL<<60)\\n\\n//verified AOJ GRL_1\\n#define MAX_V 100020\\ntemplate <typename T>\\nstruct edge{int to;T cost;};\\n\\ntemplate <typename T>\\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\\n priority_queue< pii,vector<pii>,greater<pii> > que;\\n rep( i,d.size() )d[i]=INF;\\n d[s] = 0;\\n que.push( pii(0,s) );\\n \\n while( que.size() ){\\n pii p=que.top();\\n que.pop();\\n \\n int v=p.second;\\n if(d[v]<p.first)continue;\\n \\n rep(i,G[v].size()){\\n edge<T> e=G[v][i];\\n if(d[e.to]>d[v]+e.cost){\\n d[e.to]=d[v]+e.cost;\\n que.push(pii(d[e.to],e.to));\\n }\\n }\\n }\\n}\\n\\n\\n\\nsigned main(){\\n int n,m,r,q;\\n cin>>n>>m>>r>>q;\\n vector<edge<int>> G[MAX_V];\\n\\n rep(i,m){\\n int s,t,c;\\n cin>>s>>t>>c;\\n G[t].pb(edge<int>{s,c});\\n }\\n for(int i=1;i<=n;i++){\\n G[n+1+i%r].pb(edge<int>{i,0});\\n }\\n \\n static vector<vector<int>> d(r,vector<int>(n+r));\\n for(int i=0;i<r;i++){\\n dijkstra<int>(n+i+1,d[i],G);\\n }\\n \\n int ans = 0;\\n rep(i,q){\\n int x,y,z;\\n cin>>x>>y>>z;\\n int mini = INF;\\n rep(j,r){\\n mini = min(mini,d[j][x]+d[j][y]);\\n }\\n if(z-mini>0)ans += z-mini;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 260,\n \"memory_kb\": 18096,\n \"score_of_the_acc\": -1.6795,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2810_2977005\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\n#define int ll\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n#define INF (1LL<<60)\\n\\n//verified AOJ GRL_1\\n#define MAX_V 100011\\ntemplate <typename T>\\nstruct edge{int to;T cost;};\\n\\ntemplate <typename T>\\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\\n priority_queue< pii,vector<pii>,greater<pii> > que;\\n rep( i,d.size() )d[i]=INF;\\n d[s] = 0;\\n que.push( pii(0,s) );\\n \\n while( que.size() ){\\n pii p=que.top();\\n que.pop();\\n \\n int v=p.second;\\n if(d[v]<p.first)continue;\\n \\n rep(i,G[v].size()){\\n edge<T> e=G[v][i];\\n if(d[e.to]>d[v]+e.cost){\\n d[e.to]=d[v]+e.cost;\\n que.push(pii(d[e.to],e.to));\\n }\\n }\\n }\\n}\\n\\n\\n\\nsigned main(){\\n int n,m,r,q;\\n cin>>n>>m>>r>>q;\\n vector<edge<int>> G[MAX_V];\\n\\n rep(i,m){\\n int s,t,c;\\n cin>>s>>t>>c;\\n G[t].pb(edge<int>{s,c});\\n }\\n for(int i=1;i<=n;i++){\\n G[n+1+i%r].pb(edge<int>{i,0});\\n }\\n \\n vector<vector<int>> d(r,vector<int>(n+r));\\n for(int i=0;i<r;i++){\\n dijkstra<int>(n+i+1,d[i],G);\\n }\\n \\n int ans = 0;\\n rep(i,q){\\n int x,y,z;\\n cin>>x>>y>>z;\\n int mini = INF;\\n rep(j,r){\\n mini = min(mini,d[j][x]+d[j][y]);\\n }\\n if(z-mini>0)ans += z-mini;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 260,\n \"memory_kb\": 18204,\n \"score_of_the_acc\": -1.6862,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2810_2976962\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\n#define int ll\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n#define INF (1LL<<60)\\n\\n//verified AOJ GRL_1\\n#define MAX_V 100011\\ntemplate <typename T>\\nstruct edge{int to;T cost;};\\n\\ntemplate <typename T>\\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\\n priority_queue< pii,vector<pii>,greater<pii> > que;\\n rep( i,d.size() )d[i]=INF;\\n d[s] = 0;\\n que.push( pii(0,s) );\\n \\n while( que.size() ){\\n pii p=que.top();\\n que.pop();\\n \\n int v=p.second;\\n if(d[v]<p.first)continue;\\n \\n rep(i,G[v].size()){\\n edge<T> e=G[v][i];\\n if(d[e.to]>d[v]+e.cost){\\n d[e.to]=d[v]+e.cost;\\n que.push(pii(d[e.to],e.to));\\n }\\n }\\n }\\n}\\n\\n\\n\\nsigned main(){\\n int n,m,r,q;\\n cin>>n>>m>>r>>q;\\n vector<edge<int>> G[MAX_V];\\n\\n rep(i,m){\\n int s,t,c;\\n cin>>s>>t>>c;\\n G[t].pb(edge<int>{s,c});\\n }\\n for(int i=1;i<=n;i++){\\n G[n+i%r].pb(edge<int>{i,0});\\n }\\n \\n vector<vector<int>> d(r,vector<int>(n+r));\\n for(int i=0;i<r;i++){\\n dijkstra<int>(n+i,d[i],G);\\n }\\n \\n int ans = 0;\\n rep(i,q){\\n int x,y,z;\\n cin>>x>>y>>z;\\n int mini = INF;\\n rep(j,r){\\n mini = min(mini,d[j][x]+d[j][y]);\\n }\\n if(z-mini>0)ans += z-mini;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 110,\n \"memory_kb\": 13980,\n \"score_of_the_acc\": -0.8013,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2810_2976954\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\n#define int ll\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n#define INF (1LL<<60)\\n\\n//verified AOJ GRL_1\\n#define MAX_V 100011\\ntemplate <typename T>\\nstruct edge{int to;T cost;};\\n\\ntemplate <typename T>\\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\\n priority_queue< pii,vector<pii>,greater<pii> > que;\\n rep( i,d.size() )d[i]=INF;\\n d[s] = 0;\\n que.push( pii(0,s) );\\n \\n while( que.size() ){\\n pii p=que.top();\\n que.pop();\\n \\n int v=p.second;\\n if(d[v]<p.first)continue;\\n \\n rep(i,G[v].size()){\\n edge<T> e=G[v][i];\\n if(d[e.to]>d[v]+e.cost){\\n d[e.to]=d[v]+e.cost;\\n que.push(pii(d[e.to],e.to));\\n }\\n }\\n }\\n}\\n\\n\\n\\nsigned main(){\\n int n,m,r,q;\\n cin>>n>>m>>r>>q;\\n vector<edge<int>> G[MAX_V];\\n\\n rep(i,m){\\n int s,t,c;\\n cin>>s>>t>>c;\\n G[t].pb(edge<int>{s,c});\\n }\\n for(int i=1;i<=n;i++){\\n G[n+i%r].pb(edge<int>{i,0});\\n }\\n \\n vector<vector<int>> d(r,vector<int>(n+r));\\n for(int i=0;i<r;i++){\\n dijkstra<int>(n+i,d[i],G);\\n }\\n \\n int ans = 0;\\n rep(i,q){\\n int x,y,z;\\n cin>>x>>y>>z;\\n int mini = INF;\\n rep(i,r){\\n mini = min(mini,d[i][x]+d[i][y]);\\n }\\n if(z-mini>0)ans += z-mini;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 110,\n \"memory_kb\": 14124,\n \"score_of_the_acc\": -0.8101,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2810_2976947\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n#define INF (1e9+1)\\n\\n//verified AOJ GRL_1\\n#define MAX_V 100011\\ntemplate <typename T>\\nstruct edge{int to;T cost;};\\n\\ntemplate <typename T>\\nvoid dijkstra(int s, vector<T> &d, vector<edge<T>> G[MAX_V]){\\n priority_queue< pii,vector<pii>,greater<pii> > que;\\n rep( i,d.size() )d[i]=INF;\\n d[s] = 0;\\n que.push( pii(0,s) );\\n \\n while( que.size() ){\\n pii p=que.top();\\n que.pop();\\n \\n int v=p.second;\\n if(d[v]<p.first)continue;\\n \\n rep(i,G[v].size()){\\n edge<T> e=G[v][i];\\n if(d[e.to]>d[v]+e.cost){\\n d[e.to]=d[v]+e.cost;\\n que.push(pii(d[e.to],e.to));\\n }\\n }\\n }\\n}\\n\\n\\n\\nint main(){\\n int n,m,r,q;\\n cin>>n>>m>>r>>q;\\n vector<edge<int>> G[MAX_V];\\n\\n rep(i,m){\\n int s,t,c;\\n cin>>s>>t>>c;\\n G[t].pb(edge<int>{s,c});\\n }\\n for(int i=1;i<=n;i++){\\n G[n+i%r].pb(edge<int>{i,0});\\n }\\n \\n vector<vector<int>> d(r,vector<int>(n+r));\\n for(int i=0;i<r;i++){\\n dijkstra<int>(n+i,d[i],G);\\n }\\n \\n int ans = 0;\\n rep(i,q){\\n int x,y,z;\\n cin>>x>>y>>z;\\n int mini = INF;\\n rep(i,r){\\n mini = min(mini,d[i][x]+d[i][y]);\\n }\\n if(z-mini>0)ans += z-mini;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 100,\n \"memory_kb\": 10416,\n \"score_of_the_acc\": -0.5403,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2810_2695017\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n//#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define BIG_NUM 200000000000\\n#define NUM 100000\\n\\n\\nstruct Info{\\n\\tInfo(int arg_to,ll arg_cost){\\n\\t\\tto = arg_to;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tint to;\\n\\tll cost;\\n};\\n\\nstruct Data{\\n\\tData(int arg_num,ll arg_cost){\\n\\t\\tnum = arg_num;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\t\\treturn cost > arg.cost;\\n\\t}\\n\\tint num;\\n\\tll cost;\\n};\\n\\nvector<Info> rev_G[NUM+1];\\nll min_cost[10][NUM+1];\\n\\n\\nint main(){\\n\\n\\tint N,M,R,Q;\\n\\tscanf(\\\"%d %d %d %d\\\",&N,&M,&R,&Q);\\n\\n\\tint from,to;\\n\\tll cost;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\t\\tscanf(\\\"%d %d %lld\\\",&from,&to,&cost);\\n\\t\\trev_G[to].push_back(Info(from,cost));\\n\\t}\\n\\n\\tfor(int i = 0; i < R; i++){\\n\\t\\tfor(int k = 1; k <= N; k++)min_cost[i][k] = BIG_NUM;\\n\\t}\\n\\n\\tint next_num;\\n\\tll next_cost;\\n\\tpriority_queue<Data> PQ;\\n\\n\\tfor(int start = 0; start < R; start++){\\n\\n\\t\\tfor(int to = 1; to <= N; to++){\\n\\t\\t\\tif(to%R == start){\\n\\t\\t\\t\\tmin_cost[start][to] = 0;\\n\\t\\t\\t\\tPQ.push(Data(to,0));\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tmin_cost[start][to] = BIG_NUM;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\twhile(!PQ.empty()){\\n\\n\\t\\t\\tif(PQ.top().cost > min_cost[start][PQ.top().num]){\\n\\t\\t\\t\\tPQ.pop();\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = 0; i < rev_G[PQ.top().num].size(); i++){\\n\\t\\t\\t\\tnext_num = rev_G[PQ.top().num][i].to;\\n\\t\\t\\t\\tnext_cost = PQ.top().cost+rev_G[PQ.top().num][i].cost;\\n\\n\\t\\t\\t\\tif(min_cost[start][next_num] > next_cost){\\n\\t\\t\\t\\t\\tmin_cost[start][next_num] = next_cost;\\n\\t\\t\\t\\t\\tPQ.push(Data(next_num,next_cost));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tPQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tll ans = 0;\\n\\tint x,y;\\n\\tll z,minimum;\\n\\n\\tfor(int loop = 0; loop < Q; loop++){\\n\\t\\tscanf(\\\"%d %d %lld\\\",&x,&y,&z);\\n\\n\\t\\tif(x%R == y%R){\\n\\t\\t\\tans += z;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tminimum = BIG_NUM;\\n\\t\\tfor(int i = 0; i < R; i++){\\n\\t\\t\\tif(min_cost[i][x] == BIG_NUM || min_cost[i][y] == BIG_NUM)continue;\\n\\t\\t\\tminimum = min(minimum,min_cost[i][x]+min_cost[i][y]);\\n\\t\\t}\\n\\n\\t\\tif(z > minimum){\\n\\t\\t\\tans += z-minimum;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 16620,\n \"score_of_the_acc\": -1.2137,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2810_2694991\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n//#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define BIG_NUM 200000000000\\n#define NUM 100000\\n\\n\\nstruct Info{\\n\\tInfo(int arg_to,ll arg_cost){\\n\\t\\tto = arg_to;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tint to;\\n\\tll cost;\\n};\\n\\nstruct Data{\\n\\tData(int arg_num,ll arg_cost){\\n\\t\\tnum = arg_num;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\t\\treturn cost > arg.cost;\\n\\t}\\n\\tint num;\\n\\tll cost;\\n};\\n\\nvector<Info> G[NUM+1];\\nll min_cost[NUM+1][10];\\n\\n\\nint main(){\\n\\n\\tint N,M,R,Q;\\n\\tscanf(\\\"%d %d %d %d\\\",&N,&M,&R,&Q);\\n\\n\\tint from,to;\\n\\tll cost;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\t\\tscanf(\\\"%d %d %lld\\\",&from,&to,&cost);\\n\\t\\tG[from].push_back(Info(to,cost)); //★有向と解釈\\n\\t}\\n\\n\\t//各数字から、Rで割ったあまりへの最小移行コストを計算する\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tfor(int k = 0; k < R; k++)min_cost[i][k] = BIG_NUM;\\n\\t}\\n\\n\\tint next_num;\\n\\tll next_cost;\\n\\tpriority_queue<Data> PQ;\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tmin_cost[i][i%R] = 0; //数字そのものの、Rで割った余りは当然コスト0\\n\\n\\t\\tPQ.push(Data(i,0));\\n\\n\\t\\twhile(!PQ.empty()){\\n\\n\\t\\t\\tif(PQ.top().cost > min_cost[i][PQ.top().num%R]){\\n\\t\\t\\t\\tPQ.pop();\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int k = 0; k < G[PQ.top().num].size(); k++){\\n\\t\\t\\t\\tnext_num = G[PQ.top().num][k].to;\\n\\t\\t\\t\\tnext_cost = PQ.top().cost+G[PQ.top().num][k].cost;\\n\\n\\t\\t\\t\\tif(min_cost[i][next_num%R] > next_cost){\\n\\t\\t\\t\\t\\tmin_cost[i][next_num%R] = next_cost;\\n\\t\\t\\t\\t\\tPQ.push(Data(next_num,next_cost));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tPQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tll ans = 0;\\n\\tint x,y;\\n\\tll z,minimum;\\n\\n\\tfor(int loop = 0; loop < Q; loop++){\\n\\t\\tscanf(\\\"%d %d %lld\\\",&x,&y,&z);\\n\\n\\t\\tif(x%R == y%R){\\n\\t\\t\\tans += z;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tminimum = BIG_NUM;\\n\\t\\tfor(int i = 0; i < R; i++){\\n\\t\\t\\tif(min_cost[x][i] == BIG_NUM || min_cost[y][i] == BIG_NUM)continue;\\n\\t\\t\\tminimum = min(minimum,min_cost[x][i]+min_cost[y][i]);\\n\\t\\t}\\n\\n\\t\\tif(z > minimum){ //報酬が最小変換コストより高い場合\\n\\t\\t\\tans += z-minimum;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 60,\n \"memory_kb\": 13324,\n \"score_of_the_acc\": -0.5526,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2810_2694942\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n//#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define BIG_NUM 200000000000\\n#define NUM 100000\\n\\n\\nstruct Info{\\n\\tInfo(int arg_to,ll arg_cost){\\n\\t\\tto = arg_to;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tint to;\\n\\tll cost;\\n};\\n\\nstruct Data{\\n\\tData(int arg_num,ll arg_cost){\\n\\t\\tnum = arg_num;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\t\\treturn cost > arg.cost;\\n\\t}\\n\\tint num;\\n\\tll cost;\\n};\\n\\nvector<Info> G[NUM+1];\\nll min_cost[NUM+1][10];\\n\\n\\nint main(){\\n\\n\\tint N,M,R,Q;\\n\\tscanf(\\\"%d %d %d %d\\\",&N,&M,&R,&Q);\\n\\n\\tint from,to,cost;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\t\\tscanf(\\\"%d %d %lld\\\",&from,&to,&cost);\\n\\t\\tG[from].push_back(Info(to,cost));\\n\\t}\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tfor(int k = 0; k < R; k++)min_cost[i][k] = BIG_NUM;\\n\\t}\\n\\n\\tint next_num;\\n\\tll next_cost;\\n\\tpriority_queue<Data> PQ;\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tmin_cost[i][i%R] = 0;\\n\\n\\t\\tPQ.push(Data(i,0));\\n\\n\\t\\twhile(!PQ.empty()){\\n\\n\\t\\t\\tfor(int k = 0; k < G[PQ.top().num].size(); k++){\\n\\t\\t\\t\\tnext_num = G[PQ.top().num][k].to;\\n\\t\\t\\t\\tnext_cost = PQ.top().cost+G[PQ.top().num][k].cost;\\n\\n\\t\\t\\t\\tif(min_cost[i][next_num%R] > next_cost){\\n\\t\\t\\t\\t\\tmin_cost[i][next_num%R] = next_cost;\\n\\t\\t\\t\\t\\tPQ.push(Data(next_num,next_cost));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tPQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tll ans = 0;\\n\\tint x,y;\\n\\tll z,minimum;\\n\\n\\tfor(int loop = 0; loop < Q; loop++){\\n\\t\\tscanf(\\\"%d %d %lld\\\",&x,&y,&z);\\n\\n\\t\\tif(x%R == y%R){\\n\\t\\t\\tans += z;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tminimum = BIG_NUM;\\n\\t\\tfor(int i = 0; i < R; i++){\\n\\t\\t\\tif(min_cost[x][i] == BIG_NUM || min_cost[y][i] == BIG_NUM)continue;\\n\\t\\t\\tminimum = min(minimum,min_cost[x][i]+min_cost[y][i]);\\n\\t\\t}\\n\\n\\t\\tif(z > minimum){\\n\\t\\t\\tans += z-minimum;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 50,\n \"memory_kb\": 13384,\n \"score_of_the_acc\": -0.5146,\n \"final_rank\": 16\n }\n]","isConversational":false}}},{"rowIdx":1691,"cells":{"group_id":{"kind":"string","value":"aoj_2803_cpp"},"problem_description":{"kind":"string","value":"F: 風呂がオーバーフロー - Overflow of Furo -\n物語\n温泉宿・パロは自慢の温泉に全ての情熱を注いでおり、風呂のプロフェッショナルを集めている。\n風呂のプロたちは主に温泉の配管を管理しており、複数の源泉から1つの大浴場へと繋がる、複雑に入り組んだ配管網を管理・調整している。\n配管網の管理・調整業務もなかなかに大変なのだが、風呂のプロたちはその合間を縫って、さらに多くの湯を浴槽へと供給できるよう日々努力を積み重ねていた。\n結果、風呂のプロたちは「1本だけ配管をオーバーフローさせることができる」という荒技を習得した。\nすなわち、自由に配管1本を選び、その配管の湯量の制限をなくすことができるようになったのだ。\n今まで最大湯量を実現する配管網の設定をあなたのプログラムに依存していた風呂のプロたちは、この技術を使ってさらに浴槽への供給湯量を増やすにはどうすればよいか、あなたに再びプログラムを書くよう依頼してきた。\n問題\n1\nつの浴槽、\nK\n個の源泉、\nN\n個の結合点を含む配管網がある。\n配管網は\nM\n本の配管からなり、配管1つ1つは流すことのできる湯量の制限を持つ。\n配管それぞれは湯を流す方向が決められていないので、自由に決めて使ってよい。\nN\n個の結合点では何本かの配管から流れてきた湯をそれ以外の何本かの配管へと自由な配分で流すことができる。\nすべての源泉、および浴槽は一部の配管の端点になっており、源泉からの湯量、および結合点での湯量を調整することで源泉から浴槽へと湯を供給している。\nM\n個の配管のうち1本だけオーバーフローさせる、すなわち流せる湯量を無限に増やすことで浴槽に供給できるようになる最大湯量はいくらか。\nただし、最大供給湯量を無限に増やすことができる場合も考えられるが、その場合は風呂がオーバーフローしてしまうので、\"overfuro\"と出力すること。\n入力形式\n入力は以下の形式で与えられる。\nK\nN\nM\na_1\nb_1\nc_1\n...\na_M\nb_M\nc_M\n入力は全て整数からなる。\n最初の行では源泉の数\nK\n、結合点の数\nN\n、配管の数\nM\nが与えられる。\n続く\nM\n行のうち\ni\n行目には、\ni\n番目の配管の情報を表す3つの整数\na_i\n,\nb_i\n,\nc_i\nが与えられる。\nこれは\ni\n番目の配管の両端点がそれぞれ\na_i\nと\nb_i\nであり、湯量の制限が\nc_i\nであることを示す。\nここで、配管の端点\nx\nが\n0\nのときは大浴場、\n1\nから\nK\nまでのときは\nx\n番目の源泉、\nK+1\nから\nK+N\nまでのときは\nx − K\n番目の結合点であることを表す。\n制約\n1 ≤ K\n0 ≤ N\nN+K ≤ 100\n1 ≤ M ≤ (N+K+1)(N+K)\n/\n2\n0 ≤ a_i, b_i ≤ K+N\na_i ≠ b_i\n1 ≤ c_i ≤ 5{,}000\n同じ2端点を持つ配管は2つ以上存在しないことが保証される。\n与えられる配管網は、配管をオーバーフローさせることなく最低1以上の湯を源泉から浴槽に供給できることが保証される。\n出力形式\n1本だけ配管をオーバーフローさせて源泉から浴槽への供給湯量を最大化するときの最大供給湯量を1行に出力せよ。\nただし、最大湯量を無限に増やせるときは、\"overfuro\"と1行に出力せよ。\n入力例1\n2 2 4\n1 3 4\n2 4 2\n0 3 3\n4 0 5\n出力例1\n8\n入力例2\n2 3 7\n1 0 8\n2 0 9\n3 0 3\n0 4 5\n5 0 2\n1 3 2\n2 4 9\n出力例2\noverfuro\n入力例3\n1 1 2\n0 2 1\n1 2 1\n出力例3\n1\n入力例4\n5 0 5\n0 1 1\n0 2 1\n0 3 1\n0 4 1\n0 5 1\n出力例4\noverfuro"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2803_8322658","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n\nstruct Edge {\n\tint to, cap, rev;\n};\n\nclass MaxFlow {\npublic:\n\tvector<Edge> G[109];\n\tint Dist[109];\n\tbool Used[109];\n\n\tvoid add_edge(int u, int v, int c) {\n\t\tG[u].push_back(Edge{ v, c, (int)G[v].size() });\n\t\tG[v].push_back(Edge{ u, 0, (int)G[u].size() - 1 });\n\t}\n\n\tvoid shortest(int u) {\n\t\tqueue<int> Q;\n\t\tfor (int i = 0; i < 109; i++) Dist[i] = 1000000000;\n\t\tDist[u] = 0;\n\t\tQ.push(u);\n\n\t\t// BFS Start\n\t\twhile (!Q.empty()) {\n\t\t\tint pos = Q.front(); Q.pop();\n\t\t\tfor (int i = 0; i < G[pos].size(); i++) {\n\t\t\t\tif (G[pos][i].cap == 0) continue;\n\t\t\t\tif (Dist[G[pos][i].to] != 1000000000) continue;\n\t\t\t\tDist[G[pos][i].to] = Dist[pos] + 1;\n\t\t\t\tQ.push(G[pos][i].to);\n\t\t\t}\n\t\t}\n\t}\n\n\tint dfs(int pos, int goal, int f) {\n\t\tif (pos == goal) return f;\n\t\tUsed[pos] = true;\n\n\t\t// Brute Force\n\t\tfor (int i = 0; i < G[pos].size(); i++) {\n\t\t\tif (G[pos][i].cap == 0) continue;\n\t\t\tif (Used[G[pos][i].to] == true) continue;\n\t\t\tif (Dist[pos] >= Dist[G[pos][i].to]) continue;\n\t\t\tint F = dfs(G[pos][i].to, goal, min(f, G[pos][i].cap));\n\t\t\tif (F == 0) continue;\n\t\t\tG[pos][i].cap -= F;\n\t\t\tG[G[pos][i].to][G[pos][i].rev].cap += F;\n\t\t\treturn F;\n\t\t}\n\t\treturn 0;\n\t}\n\n\tint max_flow(int u, int v) {\n\t\tint F = 0;\n\t\twhile (true) {\n\t\t\tshortest(u);\n\t\t\tfor (int i = 0; i < 109; i++) Used[i] = false;\n\t\t\tint res = dfs(u, v, 100000000);\n\t\t\tif (res == 0) break;\n\t\t\tF += res;\n\t\t}\n\t\treturn F;\n\t}\n};\n\nint K;\nint N;\nint M, A[1 << 18], B[1 << 18], C[1 << 18];\nint S[1 << 18];\nint T[1 << 18];\nMaxFlow Z;\n\nint main() {\n\t// Step 1. Input\n\tcin >> K >> N >> M;\n\tfor (int i = 1; i <= M; i++) cin >> A[i] >> B[i] >> C[i];\n\t\n\t// Step 2. Max Flow\n\tfor (int i = 1; i <= K; i++) Z.add_edge(K + N + 1, i, 100000000);\n\tfor (int i = 1; i <= M; i++) Z.add_edge(A[i], B[i], C[i]);\n\tfor (int i = 1; i <= M; i++) Z.add_edge(B[i], A[i], C[i]);\n\tint First = Z.max_flow(K + N + 1, 0);\n\n\t// Step 3. Get S & T\n\tfor (int i = 1; i <= K + N; i++) {\n\t\tMaxFlow Z2 = Z, Z3 = Z;\n\t\tS[i] = Z2.max_flow(K + N + 1, i);\n\t\tT[i] = Z3.max_flow(i, 0);\n\t}\n\tT[0] = 100000000;\n\n\t// Step 4. Get Answer\n\tint Answer = 0;\n\tfor (int i = 1; i <= M; i++) {\n\t\tAnswer = max(Answer, min(S[A[i]], T[B[i]]));\n\t\tAnswer = max(Answer, min(S[B[i]], T[A[i]]));\n\t}\n\tif (Answer >= 10000000) cout << \"overfuro\" << endl;\n\telse cout << First + Answer << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":780,"memory_kb":6136,"score_of_the_acc":-1.6937,"final_rank":14},{"submission_id":"aoj_2803_4526536","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;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000007LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\n/* do your best */\n\n// verified : http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_A\n// O(E V^2)\n\n// [使い方]\n// add_edge(from, to, cap) : from から to へ 容量 cap の辺を貼る\n// max_flow(s, t) : s から t への最大フローを返す\n\ntemplate< typename T >\nstruct Dinic{\n const T inf;\n\n struct edge{\n int to;\n T cap;\n int rev;\n bool isrev;\n };\n\n vector<vector<edge>> g;\n vector<int> min_cost, iter;\n\n Dinic(int V) : inf(numeric_limits<T>::max()), g(V){}\n\n\n // 0-indexed\n void add_edge(int from, int to, T cap){\n g[from].emplace_back((edge){to, cap, (int)g[to].size(), false});\n g[to].emplace_back((edge){from, 0, (int)g[from].size() - 1, true});\n }\n\n bool bfs(int s, int t) {\n min_cost.assign(g.size(), -1);\n queue<int> que;\n min_cost[s] = 0;\n que.push(s);\n while(!que.empty() && min_cost[t] == -1){\n int p = que.front();\n que.pop();\n for(auto &e : g[p]) {\n if(e.cap > 0 && min_cost[e.to] == -1){\n min_cost[e.to] = min_cost[p] + 1;\n que.push(e.to);\n }\n }\n }\n return min_cost[t] != -1;\n }\n \n T dfs(int idx, const int t, T flow){\n if(idx == t) return flow;\n for(int &i = iter[idx]; i < g[idx].size(); i++){\n edge &e = g[idx][i];\n if(e.cap > 0 && min_cost[idx] < min_cost[e.to]){\n T d = dfs(e.to, t, min(flow, 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 \n // 0-indexed\n T max_flow(int s, int t){\n T flow = 0;\n while(bfs(s, t)){\n iter.assign(g.size(), 0);\n T f = 0;\n while((f = dfs(s, t, inf)) > 0) flow += f;\n }\n\n return flow;\n }\n \n void output() {\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n if(e.isrev) continue;\n auto &rev_e = g[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n }\n};\n\nint main() {\n\n int k, n, m; cin >> k >> n >> m;\n int source = n + k + 1;\n int sink = 0;\n\n // 0 と (1 ~ k) が直接繋がっていたら，overfuro\n\n Dinic<lint> dc(n + k + 2);\n bool overfuro = false;\n for (int i = 0; i < m; i++) {\n lint a, b, c; cin >> a >> b >> c;\n if (a > b) swap(a, b);\n if (a == sink and 1 <= b and b <= k) {\n overfuro = true;\n }\n dc.add_edge(a, b, c);\n dc.add_edge(b, a, c);\n }\n\n if (overfuro) {\n cout << \"overfuro\" << endl;\n return 0;\n }\n\n for (int i = 1; i <= k; i++) {\n dc.add_edge(source, i, INF);\n }\n\n lint ans = dc.max_flow(source, sink);\n\n lint add = 0;\n for(int i = 0; i < dc.g.size(); i++) {\n for(auto &e : dc.g[i]) {\n if(e.isrev) continue;\n auto &rev_e = dc.g[e.to][e.rev];\n if (rev_e.cap == e.cap + rev_e.cap) {\n auto extra = dc;\n extra.add_edge(i, e.to, INF);\n lint tmp = extra.max_flow(source, sink);\n add = max(add, tmp);\n }\n // cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n\n cout << ans + add << endl;\n return 0;\n}","accuracy":1,"time_ms":390,"memory_kb":3992,"score_of_the_acc":-0.618,"final_rank":12},{"submission_id":"aoj_2803_4488321","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<ll,ll> mp;\ntypedef pair<mp,ll> mmp;\n\n#define INF 1e9\nstruct edge{\n ll to,rev;\n ll cap,cost;\n edge(ll to, ll cap ,ll rev):to(to),cap(cap),rev(rev){}\n edge(ll to, ll cap,ll cost,ll rev):to(to),cap(cap),cost(cost),rev(rev){}\n};\ntypedef vector<vector<edge> > graph;\nstruct Flow{\n\tgraph g;\n\tll MAXC = 1<<30;\n\tll n;\n\tvector<bool> used;\n\tvector<ll> prevv,preve,dist;\n\tFlow() {} \n\tFlow(ll _n) : g(_n),n(_n),used(_n,false),prevv(_n),preve(_n),dist(_n,MAXC){}\n\t// G[e.to][e.rev] で逆辺を操作できる\n\tvoid add_edge(ll from , ll to , ll cap){\n\t g[from].push_back( edge(to,cap,g[to].size() ) );\n\t g[to].push_back( edge(from,0,g[from].size()-1) );\n\t}\n\tvoid add_edge(ll from, ll to, ll cap,ll cost){\n\t g[from].push_back( edge(to,cap,cost,g[to].size() ) );\n\t g[to].push_back( edge(from, 0,-cost,g[from].size()-1) );\n\t}\n\t// Ford-Fulkerson 法による 最大流 O( F |E| )\n\t// Bellman-Ford 法による 最小費用流 O( F |V| |E| )\n\t// Verified: AOJ GRL_6_A (Maximum Flow)\n\t// 行き先と容量と逆辺のインデックスを記録する構造体\n\t// 通常のグラフの辺の構造体と異なるため注意\n\t// 最小費用流はもう少し速くできるので、改良しましょう\n\t// → ダイクストラが使えるようにポテンシャルを導入しよう\n\tll dfs(ll v,ll t , ll f){\n\t if( v== t)return f;\n\t used[v] = true;\n\t for(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 ll d = dfs(e.to,t,min(f,e.cap) );\n\t\t if( d > 0){\n\t\t\te.cap -= d;\n\t\t\tg[e.to][e.rev].cap += d;\n\t\t\treturn d;\n\t\t }\n\t\t}\n\t }\n\t return 0;\n\t}\n\tll max_flow(ll s,ll t){\n\t ll flow = 0;\n\t while(1){\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\t }\n\t}\n\tll mincost_flow(ll s,ll t,ll f){\n\t ll res = 0;\n\t ll M = MAXC ;\n\t while(f>0){\n\t\tfill(dist.begin(),dist.end(), M);\n\t\tdist[s] = 0;\n\t\tbool update = true;\n\t\twhile(update){\n\t\t update = false;\n\t\t for(ll i=0;i<n;i++){\n\t\t\tif(dist[i] == M) continue;\n\t\t\tfor(ll j=0;j<g[i].size();j++){\n\t\t\t edge &e = g[i][j];\n\t\t\t if(e.cap > 0 && dist[e.to] > dist[i] + e.cost){\n\t\t\t\tdist[e.to] = dist[i] + e.cost;\n\t\t\t\tprevv[e.to] = i;\n\t\t\t\tpreve[e.to] = j;\n\t\t\t\tupdate = true;\n\t\t\t }\n\t\t\t}\n\t\t }\n\t\t}\n\t\tif( dist[t] == M) return -1;\n\t\tll d = f;\n\t\tfor(ll i= t ; i!=s; i=prevv[i] ) d = min(d,g[ prevv[i] ][ preve[i] ].cap );\n\t\tf -= d;\n\t\tres += d*dist[t];\n\t\tfor(ll i= t ; i!=s; i=prevv[i] ){\n\t\t edge &e = g[prevv[i] ][preve[i]];\n\t\t e.cap -= d;\n\t\t g[i][e.rev].cap += d;\n\t\t}\n\t }\n\t return res;\n\t}\n\t // ポテンシャルの導入により、ダイクストラ法で最小費用流を解く\n\t // [仮定している条件]\n\t // 1. グラフに負の閉路が存在しない (流量の 0 初期化のため)\n\t // もし存在するならベルマンフォードで負の閉路を見つけ\n\t // そこに流せるだけ流してスタート\n\t // 2. グラフに負の辺が存在しない (pot_0 の計算可能性)\n\t // もし存在する場合は最初のみベルマンフォードを使う必要あり\n\tll fast_mincost_flow(ll s,ll t,ll f){\n\t ll res = 0, M = MAXC;\n\t vector<ll> pot(n);\n\t while( f > 0 ){\n\t\tpriority_queue<mp,vector<mp>,greater<mp> > q;\n\t\tfill(dist.begin(),dist.end(),M);\n\t\tdist[s] = 0;\n\t\tq.push( mp(0,s) );\n\t\twhile(!q.empty()){\n\t\t mp now = q.top();\n\t\t q.pop();\n\t\t ll v = now.second;\n\t\t ll cost = now.first;\n\t\t if( dist[v] < cost ) continue;\n\t\t for(ll i=0;i<g[v].size();i++){\n\t\t\tedge &e = g[v][i];\n\t\t\tif( e.cap > 0 && dist[e.to] > dist[v] + e.cost + pot[v] - pot[e.to] ){\n\t\t\t dist[e.to] = dist[v] + e.cost + pot[v] - pot[e.to];\n\t\t\t prevv[e.to] = v;\n\t\t\t preve[e.to] = i;\n\t\t\t q.push( mp(dist[e.to],e.to) );\n\t\t\t}\n\t\t }\n\t\t}\n\t\tif( dist[t] == M ) return -1;\n\t\tfor(ll i = 0; i< n;i++)pot[i] += dist[i];\n\t\tll d = f;\n\t\tfor(ll i = t; i!=s; i= prevv[i] ) d = min(d,g[prevv[i]][preve[i]].cap);\n\t\tf-=d;\n\t\tres += d*pot[t];\n\t\tfor(ll i = t; i!=s; i=prevv[i] ){\n\t\t edge &e = g[prevv[i] ][preve[i]];\n\t\t e.cap -= d;\n\t\t g[i][e.rev].cap += d;\n\t\t}\n\t }\n\t return res;\n\t}\n};\n\nint main(){\n ll k,n,m;\n cin>>k>>n>>m;\n vector< vector<mp> > g(n+k+2);\n vector<mmp> ed(m);\n\n for(int i=0;i<m;i++){\n ll a,b,c;\n cin>>a>>b>>c;\n if( a > b ){\n swap(a,b);\n }\n if( a== 0 ){\n if( b <= k ){\n cout<<\"overfuro\"<<endl;\n return 0;\n }\n }\n ed[i] = mmp( mp(a,b), c );\n if( a == 0 ){\n g[b].push_back( mp(a,c) );\n continue;\n }\n g[a].push_back( mp(b,c) );\n if( k+1 <= a ) g[b].push_back( mp(a,c) );\n }\n\n // cout<<\"OK\"<<endl;\n\n ll ans = 0;\n for(int i=0;i<m;i++){\n Flow f(n+k+2);\n for(int j=1;j<=k;j++){\n f.add_edge( n + k + 1 , j , INF );\n }\n for(int j=0;j<n+k+2;j++){\n for(int l=0;l<g[j].size();l++) \n f.add_edge( j , g[j][l].first , g[j][l].second );\n }\n \n f.add_edge( ed[i].first.first , ed[i].first.second , INF );\n if( k+1 <= ed[i].first.first ) f.add_edge( ed[i].first.second , ed[i].first.first, INF ); \n\n \n \n ans = max(ans , f.max_flow( n+k+1 , 0 ) );\n }\n\n\n cout<<ans<<endl;\n\n\n\n\n return 0;\n}","accuracy":0.08333333333333333,"time_ms":540,"memory_kb":3176,"score_of_the_acc":-0.4775,"final_rank":20},{"submission_id":"aoj_2803_2921741","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld =long double;\nconst ld eps = 1e-9;\n\n\n//namespace cent {\n//\n//\tstruct Edge {\n//\t\tint src;\n//\t\tint dst;\n//\t\tlong long int cost;\n//\t};\n//\tusing Graph = vector<vector<Edge>>;\n//\n//\tclass Centroid {\n//\tprivate:\n//\t\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tint sum = 1;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ch_nums[now] = sum;\n//\t\t}\n//\n//\t\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tfor (auto&& e : graph[pre_root]) {\n//\t\t\t\tif (e.dst == pre_from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\n//\t\t\t}\n//\t\t\treturn pre_root;\n//\t\t}\n//\n//\t\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\n//\t\t\tmp[make_pair(root,now)]=depth;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tdfs2(g,root,e.dst,e.src,oks,depth+1);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t};\n//\n//\n//\t\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\n//\t\t\tdfs(graph, root, from, ch_nums, oks);\n//\n//\t\t\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\n//\n//\n//\t\t\tdfs2(graph,cent_id,cent_id,-1,oks,0);\n//\t\t\tlens1[cent_id][make_pair(0,0)]--;\n//\t\t\tlens2[cent_id][0]--;\n//\n//\n//\t\t\toks[cent_id] = depth;\n//\n//\t\t\t//for (auto&& e : graph[cent_id]) {\n//\t\t\t//\tif (e.dst == from)continue;\n//\t\t\t//\tif (oks[e.dst] != -1)continue;\n//\n//\t\t\t//\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\n//\n//\t\t\t//\tfor (auto&& l1 : lens1[e.dst]) {\n//\t\t\t//\t\tint keta = l1.first.second;\n//\t\t\t//\t\tlong long int num = l1.first.first;\n//\n//\t\t\t//\t\tlong long int need = (mod - num) / mod_pow(10, keta);\n//\t\t\t//\t\tneed%=mod;\n//\t\t\t//\t\tauto it = lens2[e.dst].find(need);\n//\t\t\t//\t\tif (it != lens2[e.dst].end()) {\n//\t\t\t//\t\t\tans -= l1.second*it->second;\n//\t\t\t//\t\t}\n//\t\t\t//\t}\n//\t\t\t//\tlens1[e.dst].clear();\n//\t\t\t//\tlens2[e.dst].clear();\n//\t\t\t//}\n//\n//\t\t\tif (from != -1) {\n//\t\t\t\tcentroid_edges[from].push_back(cent_id);\n//\t\t\t}\n//\t\t\telse {\n//\t\t\t\tfst_centroid = cent_id;\n//\t\t\t}\n//\t\t\tfor (auto&& e : graph[cent_id]) {\n//\t\t\t\tif (e.dst == from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\n//\t\t\t}\n//\t\t}\n//\n//\tpublic:\n//\n//\t\tmap<pair<int,int>,int>mp;\n//\n//\t\tvector<map<pair<long long int,int>, long long int>>lens1;\n//\t\tvector<map<long long int, long long int>>lens2;\n//\t\tvector<vector<int>> centroid_graph;\n//\t\tvector<int>ts;\n//\t\tvector<int>parents;\n//\t\tvector<int>oks;\n//\t\tvector<int>anss;\n//\n//\t\t//fst:root snd:centroid_graph\n//\t\tvoid init(const Graph&g) {\n//\t\t\tlens1.resize(g.size());\n//\t\t\tlens2.resize(g.size());\n//\t\t\toks = vector<int>(g.size(), -1);\n//\t\t\tint root = -1;\n//\t\t\tcentroid_graph.resize(g.size());\n//\t\t\tparents = vector<int>(g.size(), -1);\n//\t\t\tts=vector<int>(g.size(),-1);\n//\t\t\tanss=vector<int>(g.size(),100000);\n//\n//\t\t\tvector<int>ch_nums(g.size());\n//\t\t\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\n//\n//\t\t\tfor (int i = 0; i < centroid_graph.size(); ++i) {\n//\t\t\t\tfor (auto&& e : centroid_graph[i]) {\n//\t\t\t\t\tparents[e] = i;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ;\n//\t\t}\n//\t}centroid;\n//\n//\n//\tvoid addEdge(Graph& g, int a, int b, long long int c) {\n//\t\tg[a].push_back(Edge{ a,b,c });\n//\t\tg[b].push_back(Edge{ b,a,c });\n//\t}\n//}\n\n\n//const int mod = 1000000007;\n//struct Mod {\n//public:\n//\tint num;\n//\tMod() : Mod(0) { ; }\n//\tMod(long long int n) : num((n % mod + mod) % mod) {\n//\t\tstatic_assert(mod<INT_MAX / 2, \"mod is too big, please make num 'long long int' from 'int'\");\n//\t}\n//\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\n//\toperator int() { return num; }\n//};\n//\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\n//Mod operator++(Mod &a) { return a + Mod(1); }\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\n//Mod operator--(Mod &a) { return a - Mod(1); }\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\n//Mod operator^(const Mod a, const int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = (a * a) ^ (n / 2);\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//Mod mod_pow(const Mod a, const long long int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = mod_pow((a * a), (n / 2));\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\n//Mod operator/(const Mod a, const Mod b) {\n//\tassert(b.num != 0);\n//\treturn a * inv(b);\n//}\n//Mod operator/(const long long int a, const Mod b) {\n//\treturn Mod(a) / b;\n//}\n//Mod operator/=(Mod &a, const Mod b) {\n//\treturn a = a / b;\n//}\n//\n//#define MAX_MOD_N 1024000\n//\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\n//void init(const int amax = MAX_MOD_N) {\n//\tfact[0] = Mod(1); factinv[0] = 1;\n//\tfor (int i = 0; i < amax - 1; ++i) {\n//\t\tfact[i + 1] = fact[i] * Mod(i + 1);\n//\t\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\n//\t}\n//}\n//Mod comb(const int a, const int b) {\n//\treturn fact[a] * factinv[b] * factinv[a - b];\n//}\n//\n//vector<int>primes;\n//void hurui(const int amax=3500) {\n//\tstatic bool flag = false;\n//\tif (flag)return;\n//\tvector<int>sos;\n//\tsos = vector<int>(amax + 1, true);\n//\tsos[0] = false; sos[1] = false;\n//\tfor (int i = 2; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\n//\t\t}\n//\t}\n//\tfor (int i = 0; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tprimes.push_back(i);\n//\t\t}\n//\t}\n//\tflag = true;\n//}\n//\n//\n//struct query {\n//\tint u;\n//\tint v;\n//\tmap<int,int>mp;\n//};\n//\n//map<int, int>mk_mp(const int a) {\n//\tint rest(a);\n//\tmap<int,int>as;\n//\tfor (auto pr : primes) {\n//\t\twhile (rest%pr == 0) {\n//\t\t\tas[pr]++;\n//\t\t\trest /= pr;\n//\t\t}\n//\t}\n//\tif (rest!=1)as[rest]++;\n//\treturn as;\n//}\n//\n//#define Seg_Max_N (1<<18) \n//\n//class Tree {\n//public:\n//\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\n//\t\tT.resize(V);\n//\t\tfor (int i = 0; i < MAXLOGV; i++) {\n//\t\t\tparent[i].resize(V);\n//\t\t}\n//\t\tdepth.resize(V);\n//\t}\n//\t// uとvをつなぐ\n//\t// lcaを求めることが主目的なので無向グラフとしている\n//\tvoid unite(int u, int v) {\n//\t\tT[u].push_back(v);\n//\t\tT[v].push_back(u);\n//\t}\n//\tvoid unite(vector<vector<int>>&e) {\n//\t\tT = e;\n//\t}\n//\t// initする\n//\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\n//\tvoid init() {\n//\t\tdfs(root, 0, 0);\n//\t\tint id = 0;\n//\t\tgetid(root, 0, id);\n//\t}\n//\t// uとvのlcaを求める\n//\tint lca(int u, int v) const {\n//\t\tif (depth[u] > depth[v]) swap(u, v);\n//\t\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\t// uとvの距離を求める\n//\t// edgeを定義しないといけない時はこれじゃダメ\n//\tint dist(int u, int v) const {\n//\t\tint p = lca(u, v);\n//\t\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\n//\t}\n//\tint dfs(int v, int p, int d) {\n//\t\tparent[0][v] = p;\n//\t\tdepth[v] = d;\n//\t\tcnum[v] = 0;\n//\t\tfor (int i = 1; i < MAXLOGV; i++) {\n//\t\t\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\n//\t\t}\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) cnum[v] += dfs(next, v, d + 1);\n//\t\t}\n//\t\treturn cnum[v] + 1;\n//\t}\n//\n//\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) dfs2(next, v, doubles, nums);\n//\t\t}\n//\t\tdoubles[0][v] = nums[v];\n//\t\tfor (int j = 1; j < MAXLOGV; ++j) {\n//\t\t\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\n//\t\t}\n//\t\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\n//\t\t\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\n//\t\t}\n//\t}\n//\t//ここでは親から距離2^iの部分木の最小値を求めている\n//\tvector<vector<int>>get_doubles(const vector<int>&nums) {\n//\t\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\n//\t\tdfs2(root, -1, doubles, nums);\n//\t\treturn doubles;\n//\t}\n//\n//\tvoid getid(const int v, const int p, int &nplace) {\n//\t\tplace[v] = nplace;\n//\t\tid[nplace] = v;\n//\t\tnplace++;\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) getid(next, v, nplace);\n//\t\t}\n//\t}\n//\tstatic const int MAXLOGV = 25;\n//\t// グラフの隣接リスト表現\n//\tvector<vector<int> > T;\n//\t// 頂点の数\n//\tint V;\n//\t// 根ノードの番号\n//\tint root;\n//\n//\t// 親ノード\n//\tvector<int> parent[MAXLOGV];\n//\t// 根からの深さ\n//\tvector<int> depth;\n//\n//\t//子の数\n//\tvector<int>cnum;\n//\n//\t//変換\n//\tvector<int>place;\n//\tvector<int>id;\n//\n//};\n//\n//vector<int>pas;\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\n//\ttos[now]=id;\n//\tlrs[tos[now]].first=id++;\n//\tfor (auto e : edges[now]) {\n//\t\tif (e == from) {\n//\t\t\tpas[now] = from;\n//\t\t\tcontinue;\n//\t\t}\n//\t\tadfs(lrs,tos,edges,e,now,id);\n//\t}\n//\tlrs[tos[now]].second=id;\n//}\n//\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\n//\tpas.resize(tos.size());pas[0]=-1;\n//\tvector<pair<int,int>>lrs(edges.size());\n//\tint id=0;\n//\tadfs(lrs,tos,edges,0,-1,id);\n//\treturn lrs;\n//}\n\n\n\n#define _GLIBCXX_DEBUG\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(auto i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\n\n\n//const int INF = 2147483647;\n//const long long int L_INF = 9223372036854775807;\n\ntypedef int Weight;\n\nconst Weight INF = 1e9;\nconst Weight ZERO = 0;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tint id;\n\tEdge(int src_, int dst_, Weight weight_, const int id_) :\n\t\tsrc(src_), dst(dst_), weight(weight_), id(id_) { }\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n\tEdge() :src(0), dst(0), weight(0) {\n\n\t}\n};\nbool operator < (const Edge &e, const Edge &f) {\n\treturn e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\n\te.src != f.src ? e.src < f.src : e.dst < f.dst;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\n\nint flow_try(const Graph&g, int s, int t, Matrix&flow, Matrix&capacity) {\n\tWeight total = ZERO;\n\twhile (1) {\n\t\tqueue<int> Q; Q.push(s);\n\t\tvector<int> prev(g.size(), -1); prev[s] = s;\n\t\twhile (!Q.empty() && prev[t] < 0) {\n\t\t\tint u = Q.front(); Q.pop();\n\t\t\tFOR(e, g[u]) if (prev[e->dst] < 0 && RESIDUE(u, e->dst) > ZERO) {\n\t\t\t\tprev[e->dst] = u;\n\t\t\t\tQ.push(e->dst);\n\t\t\t}\n\t\t}\n\t\tif (prev[t] < 0)break; // prev[x] == -1 <=> t-side\n\t\tWeight inc = INF;\n\t\tfor (int j = t; prev[j] != j; j = prev[j]) {\n\t\t\tauto v(RESIDUE(prev[j], j));\n\t\t\tif (inc > v) {\n\t\t\t\tinc = v;\n\t\t\t}\n\t\t}\n\t\tfor (int j = t; prev[j] != j; j = prev[j])\n\t\t\tflow[prev[j]][j] = flow[prev[j]][j] + inc, flow[j][prev[j]] = flow[j][prev[j]] - inc;;\n\t\ttotal += inc;\n\t}\n\treturn total;\n}\n\n//流量0の逆辺も張らないと正しく求まらないので注意\nWeight maximumFlow(const Graph &ag, int s, int t) {\n\n\tGraph g(ag);\n\tfor (int i = 0; i < ag.size(); ++i) {\n\t\tfor (int j = 0; j < ag[i].size(); ++j) {\n\t\t\tint d = ag[i][j].dst;\n\t\t\tint s = ag[i][j].src;\n\n\t\t\tbool ok = false;\n\t\t\tfor (int k = 0; k < ag[d].size(); ++k) {\n\t\t\t\tif (ag[d][k].dst == s) {\n\t\t\t\t\tok = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!ok) {\n\t\t\t\tg[d].push_back(Edge(d, s, ZERO));\n\t\t\t}\n\t\t}\n\t}\n\tint n = g.size();\n\tMatrix flow(n, Array(n,ZERO)), capacity(n, Array(n,ZERO));\n\tREP(u, n) FOR(e, g[u]) capacity[e->src][e->dst] =capacity[e->src][e->dst]+ e->weight;\n\n\n\tWeight total = flow_try(g,s,t,flow,capacity);\n\n\tvector<int>ss(g.size()),ts(g.size());\n\n\tfor (int at = 0; at < g.size(); ++at) {\n\t\tint as=0;\n\t\tif(as==at)ss[at]=1e9;\n\t\telse {\n\t\t\tMatrix aflow(flow);\n\t\t\tMatrix acap(capacity);\n\t\t\tss[at]=flow_try(g,as,at,aflow,acap);\n\t\t}\n\t}\n\tfor (int as = 0; as < g.size(); ++as) {\n\t\tint at = g.size()-1;\n\t\tif (as == at)ts[as]=1e9;\n\t\telse {\n\t\t\tMatrix aflow(flow);\n\t\t\tMatrix acap(capacity);\n\t\t\tts[as] = flow_try(g, as, at, aflow, acap);\n\t\t}\n\t}\n\n\tint plus=0;\n\tfor (int i = 0; i < g.size(); ++i) {\n\t\tfor (auto e : g[i]) {\n\t\t\tint nplus=min(ss[e.src],ts[e.dst]);\n\t\t\t\n\t\t\tplus=max(plus,nplus);\n\t\t}\n\t}\n\n\treturn total+plus;\n}\n\n\n\nint main()\n{\n\tint K,N,M;cin>>K>>N>>M;\n\n\tconst int start=0;\n\tconst int gensen=1;\n\tconst int connection=gensen+K;\n\tconst int goal=connection+N;\n\n\tGraph g(goal+1);\n\tfor (int i = 0; i < M; ++i) {\n\t\tint a,b,c;\n\t\tcin>>a>>b>>c;\n\t\tg[a].push_back(Edge(a,b,c));\n\t\tg[b].push_back(Edge(b,a,c));\n\t}\n\n\tfor (int i = 0; i < K; ++i) {\n\t\tbool flag=false;\n\t\tfor (auto&e : g[goal]) {\n\t\t\tif (e.dst == gensen + i) {\n\t\t\t\te.weight=1e9;\n\t\t\t\tflag=true;\n\t\t\t}\n\t\t}\n\t\tfor (auto&e : g[gensen+i]) {\n\t\t\tif (e.dst == goal) {\n\t\t\t\te.weight = 1e9;\n\t\t\t}\n\t\t}\n\t\tif (!flag) {\n\n\t\t\tg[goal].push_back(Edge(goal, gensen + i, 1e9));\n\t\t\tg[gensen + i].push_back(Edge(gensen + i, goal, 1e9));\n\t\t}\n\t}\n\n\tauto f=maximumFlow(g,start,goal);\n\n\tif (f >= 1e9-1e8) {\n\t\tcout<<\"overfuro\"<<endl;\n\t}\n\telse {\n\n\n\t\tcout << f << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3568,"score_of_the_acc":-0.2045,"final_rank":11},{"submission_id":"aoj_2803_2901595","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 120\n\nenum Type{\n\tBASE,\n\tTMP,\n};\n\n\n//辺を表す構造体(行先、容量、逆辺のインデックス)\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\trev_index = arg_rev_index;\n\t}\n\tint to,capacity,rev_index;\n};\n\nint V;\nint K,N,E;\nvector<Edge> G[2][NUM]; //グラフの隣接リスト表現\nint dist[2][NUM]; //sourceからの距離\nint cheked_index[2][NUM]; //どこまで調べ終わったか\nint table[NUM];\nbool can_visit[NUM];\n\n//fromからtoへ向かう容量capacityの辺をグラフに追加する\nvoid add_edge(int from,int to,int capacity){\n\tG[BASE][from].push_back(Edge(to,capacity,G[BASE][to].size())); //★逆辺はそれぞれ張る★\n\tG[BASE][to].push_back(Edge(from,0,G[BASE][from].size()-1)); //逆辺の、初期容量は0\n}\n\n//sourceからの最短距離をBFSで計算する\nvoid bfs(Type type,int source){\n\tfor(int i = 0; i < V; i++)dist[type][i] = -1;\n\tqueue<int> Q;\n\tdist[type][source] = 0;\n\tQ.push(source);\n\n\twhile(!Q.empty()){\n\t\tint node_id = Q.front();\n\t\tQ.pop();\n\n\t\tfor(int i = 0; i < G[type][node_id].size(); i++){\n\t\t\tEdge &e = G[type][node_id][i];\n\t\t\tif(e.capacity > 0 && dist[type][e.to] < 0){ //辺の容量が正で、かつエッジの行先に未訪問の場合\n\t\t\t\tdist[type][e.to] = dist[type][node_id]+1;\n\t\t\t\tQ.push(e.to);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//増加パスをDFSで探す\nint dfs(Type type,int node_id,int sink,int flow){\n\tif(node_id == sink)return flow; //終点についたらflowをreturn\n\n\tfor(int &i = cheked_index[type][node_id]; i < G[type][node_id].size(); i++){ //node_idから出ているエッジを調査\n\t\tEdge &e = G[type][node_id][i];\n\t\tif(e.capacity > 0 && dist[type][node_id] < dist[type][e.to]){ //流せる余裕があり、かつsourceからの距離が増加する方法である場合\n\t\t\tint tmp_flow = dfs(type,e.to,sink,min(flow,e.capacity)); //流せるだけ流す\n\t\t\tif(tmp_flow > 0){ //流せた場合\n\t\t\t\te.capacity -= tmp_flow; //流した分、エッジの容量を削減する\n\t\t\t\tG[type][e.to][e.rev_index].capacity += tmp_flow; //逆辺の容量を、流した分だけ増加させる\n\t\t\t\treturn tmp_flow;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\n//sourceからsinkへの最大流を求める\nint max_flow(Type type,int source,int sink){ //source:始点 sink:終点\n\tint flow = 0,add;\n\twhile(true){ //増加パスが存在する限り、流量を追加し続ける\n\t\tbfs(type,source);\n\t\tif(dist[type][sink] < 0)break; //sourceからsinkへと辿り着く残余グラフがない、つまり増加パスが無くなった場合、break\n\t\tfor(int i = 0; i < V; i++)cheked_index[type][i] = 0;\n\t\twhile((add = dfs(type,source,sink,BIG_NUM)) > 0){ //増加パスが見つかる間、加算\n\t\t\tflow += add;\n\t\t}\n\t}\n\treturn flow;\n}\n\n//sourceから行けるノードを探す\nvoid visit_check(int node_id){\n\tcan_visit[node_id] = true;\n\n\tfor(int i = 0; i < G[BASE][node_id].size(); i++){\n\t\tif(can_visit[G[BASE][node_id][i].to] == true || G[BASE][node_id][i].capacity == 0)continue;\n\t\tvisit_check(G[BASE][node_id][i].to);\n\t}\n}\n\n\nint main(){\n\n\tscanf(\"%d %d %d\",&K,&N,&E);\n\n\tint from,to,capacity;\n\tfor(int loop = 0; loop < E; loop++){\n\t\tscanf(\"%d %d %d\",&from,&to,&capacity);\n\t\tadd_edge(from,to,capacity);\n\t\tadd_edge(to,from,capacity);\n\t}\n\n\tint source = K+N+1,sink = 0; //浴槽をsinkとする\n\n\tfor(int i = 1; i <= K; i++){\n\t\tadd_edge(source,i,BIG_NUM);\n\t}\n\n\t//一回流す\n\tV = K+N+2;\n\tint base_flow = max_flow(BASE,source,sink);\n\n\t//sourceから行けるノードを探す\n\tfor(int i = 0; i < V; i++)can_visit[i] = false;\n\tvisit_check(source);\n\n\tint ans = 0;\n\n\t//残余グラフ上でボトルネックを走査(ボトルネック辺はcapacityが0になっているはず)\n\t//ループの際、sourceとsinkは除く\n\ttable[source] = BIG_NUM;\n\ttable[sink] = BIG_NUM;\n\tfor(int i = 1; i < V-1; i++){\n\t\tfor(int k = 0; k < NUM; k++){\n\t\t\tG[TMP][k] = G[BASE][k];\n\t\t}\n\t\tif(can_visit[i]){\n\t\t\ttable[i] = max_flow(TMP,source,i);\n\t\t}else{\n\t\t\ttable[i] = max_flow(TMP,i,sink);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < V; i++){\n\t\tif(!can_visit[i])continue;\n\t\tfor(int k = 0; k < G[BASE][i].size(); k++){\n\t\t\tif(can_visit[G[BASE][i][k].to])continue;\n\t\t\tans = max(ans,min(table[i],table[G[BASE][i][k].to]));\n\t\t}\n\t}\n\n\tans += base_flow;\n\n\tif(ans >= BIG_NUM){\n\t\tprintf(\"overfuro\\n\");\n\t}else{\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3576,"score_of_the_acc":-0.1622,"final_rank":8},{"submission_id":"aoj_2803_2901593","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 120\n\nenum Type{\n\tBASE,\n\tTMP,\n};\n\n\n//辺を表す構造体(行先、容量、逆辺のインデックス)\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\trev_index = arg_rev_index;\n\t}\n\tint to,capacity,rev_index;\n};\n\nint V;\nint K,N,E;\nvector<Edge> G[2][NUM]; //グラフの隣接リスト表現\nint dist[2][NUM]; //sourceからの距離\nint cheked_index[2][NUM]; //どこまで調べ終わったか\nint table[NUM];\nbool can_visit[NUM];\n\n//fromからtoへ向かう容量capacityの辺をグラフに追加する\nvoid add_edge(int from,int to,int capacity){\n\tG[BASE][from].push_back(Edge(to,capacity,G[BASE][to].size())); //★逆辺はそれぞれ張る★\n\tG[BASE][to].push_back(Edge(from,0,G[BASE][from].size()-1)); //逆辺の、初期容量は0\n}\n\n//sourceからの最短距離をBFSで計算する\nvoid bfs(Type type,int source){\n\tfor(int i = 0; i < V; i++)dist[type][i] = -1;\n\tqueue<int> Q;\n\tdist[type][source] = 0;\n\tQ.push(source);\n\n\tint debug = 0;\n\twhile(!Q.empty()){\n\t\tint node_id = Q.front();\n\t\tQ.pop();\n\t\tdebug++;\n\t\tif(debug == 100){\n\t\t\tprintf(\"LOOP!!\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\tfor(int i = 0; i < G[type][node_id].size(); i++){\n\t\t\tEdge &e = G[type][node_id][i];\n\t\t\tif(e.capacity > 0 && dist[type][e.to] < 0){ //辺の容量が正で、かつエッジの行先に未訪問の場合\n\t\t\t\tdist[type][e.to] = dist[type][node_id]+1;\n\t\t\t\tQ.push(e.to);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//増加パスをDFSで探す\nint dfs(Type type,int node_id,int sink,int flow){\n\tif(node_id == sink)return flow; //終点についたらflowをreturn\n\n\tfor(int &i = cheked_index[type][node_id]; i < G[type][node_id].size(); i++){ //node_idから出ているエッジを調査\n\t\tEdge &e = G[type][node_id][i];\n\t\tif(e.capacity > 0 && dist[type][node_id] < dist[type][e.to]){ //流せる余裕があり、かつsourceからの距離が増加する方法である場合\n\t\t\tint tmp_flow = dfs(type,e.to,sink,min(flow,e.capacity)); //流せるだけ流す\n\t\t\tif(tmp_flow > 0){ //流せた場合\n\t\t\t\te.capacity -= tmp_flow; //流した分、エッジの容量を削減する\n\t\t\t\tG[type][e.to][e.rev_index].capacity += tmp_flow; //逆辺の容量を、流した分だけ増加させる\n\t\t\t\treturn tmp_flow;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\n//sourceからsinkへの最大流を求める\nint max_flow(Type type,int source,int sink){ //source:始点 sink:終点\n\tint flow = 0,add;\n\twhile(true){ //増加パスが存在する限り、流量を追加し続ける\n\t\tbfs(type,source);\n\t\tif(dist[type][sink] < 0)break; //sourceからsinkへと辿り着く残余グラフがない、つまり増加パスが無くなった場合、break\n\t\tfor(int i = 0; i < V; i++)cheked_index[type][i] = 0;\n\t\twhile((add = dfs(type,source,sink,BIG_NUM)) > 0){ //増加パスが見つかる間、加算\n\t\t\tflow += add;\n\t\t}\n\t}\n\treturn flow;\n}\n\n//sourceから行けるノードを探す\nvoid visit_check(int node_id){\n\tcan_visit[node_id] = true;\n\n\tfor(int i = 0; i < G[BASE][node_id].size(); i++){\n\t\tif(can_visit[G[BASE][node_id][i].to] == true || G[BASE][node_id][i].capacity == 0)continue;\n\t\tvisit_check(G[BASE][node_id][i].to);\n\t}\n}\n\n\nint main(){\n\n\tscanf(\"%d %d %d\",&K,&N,&E);\n\n\tint from,to,capacity;\n\tfor(int loop = 0; loop < E; loop++){\n\t\tscanf(\"%d %d %d\",&from,&to,&capacity);\n\t\tadd_edge(from,to,capacity);\n\t\tadd_edge(to,from,capacity);\n\t}\n\n\tint source = K+N+1,sink = 0; //浴槽をsinkとする\n\n\tfor(int i = 1; i <= K; i++){\n\t\tadd_edge(source,i,BIG_NUM);\n\t}\n\n\t//一回流す\n\tV = K+N+2;\n\tint base_flow = max_flow(BASE,source,sink);\n\n\t//sourceから行けるノードを探す\n\tfor(int i = 0; i < V; i++)can_visit[i] = false;\n\tvisit_check(source);\n\n\tint ans = 0;\n\n\t//残余グラフ上でボトルネックを走査(ボトルネック辺はcapacityが0になっているはず)\n\t//ループの際、sourceとsinkは除く\n\ttable[source] = BIG_NUM;\n\ttable[sink] = BIG_NUM;\n\tfor(int i = 1; i < V-1; i++){\n\t\tfor(int k = 0; k < NUM; k++){\n\t\t\tG[TMP][k] = G[BASE][k];\n\t\t}\n\t\tif(can_visit[i]){\n\t\t\ttable[i] = max_flow(TMP,source,i);\n\t\t}else{\n\t\t\ttable[i] = max_flow(TMP,i,sink);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < V; i++){\n\t\tif(!can_visit[i])continue;\n\t\tfor(int k = 0; k < G[BASE][i].size(); k++){\n\t\t\tif(can_visit[G[BASE][i][k].to])continue;\n\t\t\tans = max(ans,min(table[i],table[G[BASE][i][k].to]));\n\t\t}\n\t}\n\n\tans += base_flow;\n\n\tif(ans >= BIG_NUM){\n\t\tprintf(\"overfuro\\n\");\n\t}else{\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":0.125,"time_ms":30,"memory_kb":3452,"score_of_the_acc":-0.1113,"final_rank":19},{"submission_id":"aoj_2803_2775523","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) FOR(i,0,n)\n#define pb emplace_back\ntypedef long long ll;\ntypedef pair<ll,ll> pint;\n\nconst int INF=1000100010;\nconst int MAX_N=102;\nstruct edge{\n int to,cap,rev;\n edge(int to,int cap,int rev):\n to(to),cap(cap),rev(rev){}\n };\n\nvector<edge> g[MAX_N];\nint dist[MAX_N];\nint used[MAX_N];\nvoid add_edge(int src,int dst,int cap){\n g[src].pb(edge(dst,cap,g[dst].size()));\n g[dst].pb(edge(src,cap,g[src].size()-1));\n}\nvoid bfs(int s){\n memset(dist,-1,sizeof(dist));\n queue<int> q;\n dist[s]=0;\n q.push(s);\n while(!q.empty()){\n int v=q.front();q.pop();\n rep(i,g[v].size()){\n edge &e=g[v][i];\n if(e.cap>0&&dist[e.to]<0){\n dist[e.to]=dist[v]+1;\n q.push(e.to);\n }\n }\n }\n}\nint dfs(int v,int t,int f){\n if(v==t) return f;\n used[v]=true;\n rep(i,g[v].size()){\n edge &e=g[v][i];\n if(e.cap>0&&dist[v]<dist[e.to]){\n int d=dfs(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}\nint max_flow(int s,int t){\n int flow=0;\n while(1){\n bfs(s);\n if(dist[t]<0) return flow;\n memset(used,0,sizeof(used));\n int f;\n while((f=dfs(s,t,INF))>0){\n flow+=f;\n }\n }\n}\nvector<edge> g2[MAX_N];\nint main(){\n int k,n,m;\n int a,b,c;\n cin>>k>>n>>m;\n bool flag=false;\n rep(i,m){\n cin>>a>>b>>c;\n add_edge(a,b,c);\n if(a==0&&b<=k||b==0&&a<=k) flag=true;\n }\n if(flag){\n cout<<\"overfuro\"<<endl;\n return 0;\n }\n int s=n+k+1;\n FOR(i,1,k+1){\n add_edge(s,i,INF);\n }\n int cur=max_flow(s,0);\n //cout<<cur<<endl;\n int mx=0;\n rep(i,s+1) g2[i]=g[i];\n rep(i,s+1){\n rep(j,g[i].size()){\n if(g[i][j].cap==0){\n g[i][j].cap=INF;\n mx=max(mx,max_flow(s,0));\n rep(l,s+1) g[l]=g2[l];\n }\n }\n }\n if(cur+mx>=INF) cout<<\"overfuro\"<<endl;\n else cout<<cur+mx<<endl;\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":3288,"score_of_the_acc":-0.155,"final_rank":6},{"submission_id":"aoj_2803_2388807","code_snippet":"#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\nusing pi = pair<int,int>;\n\n// (?????????,??????,??????)\nstruct edge{ int to,cap,rev; };\n\nconst int MAX_V = 111; // TODO:initialize\nconst int F_INF = 99999999; // TODO:initialize\nvector<edge> G[MAX_V],z[MAX_V];\nint level[MAX_V]; // s??????????????¢\nint iter[MAX_V]; // ???????????§??????????????£??????\n\nvoid add_edge(int from, int to, int cap){\n G[from].pb({to,cap,(int)G[to].size()});\n G[to].pb({from,cap,(int)G[from].size()-1});\n}\n\nvoid dinic_bfs(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();\n que.pop();\n rep(i,G[v].size()){\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\n// ?¢?????????????dfs??§??¢???\nint dinic_dfs(int v, int t, int f){\n if(v==t) return f;\n for(int &i=iter[v]; i<G[v].size(); ++i){\n edge &e=G[v][i];\n if(e.cap>0 && level[v]<level[e.to]){\n int d = dinic_dfs(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\n// s??????t???????????§???\nint max_flow(int s, int t){\n int flow = 0;\n while(1){\n dinic_bfs(s);\n if(level[t]<0) return flow;\n memset(iter,0,sizeof(iter));\n int f;\n while((f=dinic_dfs(s,t,F_INF))>0) flow+=f;\n }\n}\n\nconst int INF=5555555;\nint ff[MAX_V][2]={};\n\nvoid solve()\n{\n bool direct = false;\n int K,N,M;\n cin >>K >>N >>M;\n vector<int> a(M),b(M),c(M);\n rep(i,M)\n {\n cin >>a[i] >>b[i] >>c[i];\n if(a[i]>b[i]) swap(a[i],b[i]);\n add_edge(a[i],b[i],c[i]);\n direct|=(a[i]==0 && 1<=b[i] && b[i]<=K);\n }\n\n if(direct)\n {\n cout << \"overfuro\" << endl;\n return;\n }\n\n int S=K+N+1,T=0;\n for(int i=1; i<=K; ++i) add_edge(S,i,INF);\n\n int F = max_flow(S,T);\n\n rep(i,MAX_V) z[i]=G[i];\n\n ff[S][0]=INF;\n rep(i,S)\n {\n rep(j,MAX_V) G[j]=z[j];\n ff[i][0] = max_flow(S,i);\n }\n ff[0][1]=INF;\n for(int i=1; i<=S; ++i)\n {\n rep(j,MAX_V) G[j]=z[j];\n ff[i][1] = max_flow(i,T);\n }\n\n int add = 0;\n rep(i,M)\n {\n int u=a[i], v=b[i];\n add = max(add,min(ff[u][0],ff[v][1]));\n add = max(add,min(ff[v][0],ff[u][1]));\n }\n\n cout << F+add << endl;\n}\n\nint main()\n{\n solve();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3324,"score_of_the_acc":-0.05,"final_rank":1},{"submission_id":"aoj_2803_2388798","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__\",\", __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 100000000\n\ntemplate<typename T>\nclass MaximumFlow{\npublic:\n struct edge{int to; T cap; int rev;};\n vector<vector<edge> > Graph;\n vector<int> level, iter; //s??????????????¢,???????????§????????????\n void bfs(int s){\n fill(all(level), -1);\n queue<int> q;\n level[s]=0;\n q.push(s);\n while(!q.empty()){\n int v=q.front(); q.pop();\n for(auto e : Graph[v]){\n if(e.cap>0 && level[e.to]<0){\n level[e.to] = level[v]+1;\n q.push(e.to);\n }\n }\n }\n }\n T dfs(int v, int t, T f){\n if(v==t) return f;\n for(int &i=iter[v]; i<(int)Graph[v].size(); i++){\n auto &e = Graph[v][i];\n if(e.cap>0 && level[v]<level[e.to]){\n T d = dfs(e.to, t, min(f, 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 MaximumFlow(int n){\n Graph = vector<vector<edge> >(n, vector<edge>());\n level = vector<int>(n);\n iter = vector<int>(n);\n }\n T max_flow(int s, int t){\n T flow=0;\n while(true){\n bfs(s);\n if(level[t] < 0) break;\n fill(all(iter), 0);\n T f;\n while( (f=dfs(s,t,INF)) > 0){\n flow += f;\n }\n }\n return flow;\n }\n void add_edge(int from, int to, T cap){\n int tos = Graph[to].size(), froms = Graph[from].size();\n Graph[from].pb(((edge){to, cap, tos}));\n Graph[to].pb(((edge){from, cap, froms}));\n }\n}; // END class MaximumFlow\n\nint main(){\n int k,n,m;\n cin>>k>>n>>m;\n MaximumFlow<int> flow(k+n+2);\n // 0: sink\n // 1-k: gensen\n // k+1 - k+n: vertex\n // k+n+1: source\n rep(i,k) flow.add_edge(k+n+1, i+1, INF);\n\n bool ov = false;\n rep(i,m){\n int a,b,c;\n cin>>a>>b>>c;\n if(1<=a && a<=k && 1<=b && b<=k) continue;\n flow.add_edge(a, b, c);\n if(a*b==0 && ((1<=a && a<=k) || (1<=b && b<=k)) ) ov = true;\n }\n if(ov){ cout << \"overfuro\" << endl; return 0; }\n\n int f = flow.max_flow(k+n+1, 0);\n\n // source??????bfs??????????????????????£????????????¢???\n auto g = flow.Graph;\n vector<int> u,v;\n queue<int> q;\n vector<bool> visited(k+n+2);\n q.push(k+n+1);\n visited[k+n+1]=true;\n while(!q.empty()){\n int d = q.front(); q.pop();\n for(auto to : g[d]) if(!visited[to.to]){\n if(to.cap==0){u.pb(d); v.pb(to.to);}\n else{\n q.push(to.to);\n visited[to.to] = true;\n }\n }\n }\n // dbg(u);\n // dbg(v);\n\n vector<int> uu(k+n+2, -1), vv(k+n+2, -1);\n int ans = f;\n rep(i,u.size()){\n if(uu[u[i]]==-1 || vv[v[i]]==-1){\n flow.Graph = g;\n if(uu[u[i]]==-1){\n if(1<=u[i] && u[i]<=k) uu[u[i]] = INF;\n else uu[u[i]] = flow.max_flow(k+n+1, u[i]);\n }\n if(vv[v[i]]==-1){\n if(v[i]==0) vv[v[i]] = INF;\n else vv[v[i]] = flow.max_flow(v[i], 0);\n }\n }\n// dbg(uu[u[i]],vv[v[i]]);\n ans = max(ans, f + min(uu[u[i]], vv[v[i]]) );\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3340,"score_of_the_acc":-0.0554,"final_rank":3},{"submission_id":"aoj_2803_2270650","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a) for(int i=0;i<(int)(a);i++)\n#define pb push_back\n#define sz size()\nusing namespace std;\ntypedef vector<int> vi;\n\nconst int INF = 1e8;\n\nstruct edge{\n int from,to,cap,rev;\n edge(int a,int b,int c,int e)\n :from(a),to(b),cap(c),rev(e){}\n};\n\nstruct dinic{\n int n;\n vector< vector<edge> > graph;\n vi level,iter;\n\n dinic(int a=0):n(a){graph.resize(a);}\n\n void AddEdge(int s,int g,int p){\n graph[s].pb( edge(s,g,p,graph[g].sz) );\n graph[g].pb( edge(g,s,0,graph[s].sz-1) );\n }\n\n void bfs(int s){\n level = vi(n,-1);\n level[s] = 0;\n queue<int> q; q.push(s);\n while(q.sz){\n int v = q.front(); q.pop();\n for(edge e: graph[v]){\n\tif(e.cap > 0 && level[e.to] < 0){\n\t level[e.to] = level[v] + 1;\n\t q.push(e.to);\n\t}\n }\n }\n }\n \n int dfs(int v, int t, int f){\n if(v==t)return f;\n for(int &i = iter[v];i<(int)graph[v].sz;i++){\n edge &e = graph[v][i];\n if(e.cap > 0 && level[v] < level[e.to]){\n\tint d = dfs(e.to,t,min(f,e.cap));\n\tif(d > 0){\n\t e.cap -= d;\n\t graph[e.to][e.rev].cap += d;\n\t return d;\n\t}\n }\n }\n return 0;\n }\n \n int max_flow(int s, int t){\n int res = 0;\n for(;;){\n bfs(s);\n if(level[t]<0)return res;\n iter = vi(n,0);\n int f;\n while((f=dfs(s,t,INF))>0)res += f;\n }\n }\n};\n\nint main(){\n int k,n,m;\n cin >> k >> n >> m;\n\n int v = k+n+2;\n dinic mf(v);\n rep(i,k) mf.AddEdge(v-1,i+1,INF);\n\n vector<int> a(m), b(m), c(m);\n rep(i,m){\n cin >> a[i] >> b[i] >> c[i];\n mf.AddEdge(a[i], b[i], c[i]);\n mf.AddEdge(b[i], a[i], c[i]);\n }\n\n //check overfuro\n rep(i,m){\n if(a[i] > b[i]) swap(a[i], b[i]);\n if( a[i] == 0 && (1 <= b[i] && b[i] <= k) ){\n cout << \"overfuro\" << endl;\n return 0;\n }\n }\n\n int ans = mf.max_flow(v-1,0);\n\n vi from_s(v,-1), to_t(v,-1);\n rep(i,v){\n dinic red(v);\n red.graph = mf.graph;\n from_s[i] = i==v-1 ? INF : red.max_flow(v-1,i);\n\n red.graph = mf.graph;\n to_t[i] = i==0 ? INF : red.max_flow(i,0);\n }\n\n int over = 0;\n rep(i,m){\n over = max( over, min(from_s[a[i]], to_t[b[i]]) );\n over = max( over, min(from_s[b[i]], to_t[a[i]]) );\n }\n\n cout << ans + over << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3636,"score_of_the_acc":-0.1734,"final_rank":9},{"submission_id":"aoj_2803_2241164","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX 105\n#define INF (1e8)\nint K,N,M;\nint T;\n \nbool g[MAX][MAX];\nint G[MAX][MAX];\nint C[MAX];\nint tmp[MAX][MAX];\n \nbool visited[MAX];\nbool used[MAX];\n \nvoid copyA(){\n for(int i=0;i<MAX;i++)\n for(int j=0;j<MAX;j++)\n tmp[i][j]=G[i][j];\n}\nvoid copyB(){\n for(int i=0;i<MAX;i++)\n for(int j=0;j<MAX;j++)\n G[i][j]=tmp[i][j];\n}\n \n \n \nint dfs(int pos,int ti,int f){\n if(pos==ti)return f;\n visited[pos]=true;\n for(int tt=0;tt<=T;tt++){\n int to=tt;\n if(to==-1)to=T;\n \n if(visited[to])continue;\n if(G[pos][to]==0)continue;\n \n int k=dfs(to,ti, min(f,G[pos][to]) );\n if(k>0){\n G[pos][to]-=k;\n G[to][pos]+=k;\n return k;\n }\n }\n return 0;\n}\n \nint maxFlow(int si,int ti){\n if(si==ti)return INF;\n int res=0;\n while(1){\n memset(visited,false,sizeof(visited));\n int f=dfs(si,ti,INF);\n if(f==0)break;\n res+=f;\n \n }\n return res;\n}\nint calcC(int id){\n if(C[id]!=-1)return C[id];\n copyA();\n if(used[id]){\n C[id]=maxFlow(T,id);\n }else{\n C[id]=maxFlow(id,0);\n }\n copyB();\n return C[id];\n}\n \nint main(){\n memset(C,-1,sizeof(C));\n \n bool isOverfuro=false;\n cin>>K>>N>>M;\n T=N+K+1;\n for(int i=0;i<M;i++){\n int a,b,c;\n cin>>a>>b>>c;\n if(a==0&&1<=b&&b<=K){\n isOverfuro=true;\n }\n if(b==0&&1<=a&&a<=K){\n isOverfuro=true;\n }\n G[a][b]+=c;\n G[b][a]+=c;\n g[a][b]=true;\n g[b][a]=true;\n }\n \n for(int i=1;i<=K;i++){\n G[T][i]=INF;\n }\n \n if(isOverfuro){\n cout<<\"overfuro\"<<endl;\n return 0;\n }\n \n int F=maxFlow(T,0);\n assert(F>0);\n \n memset(visited,false,sizeof(visited));\n dfs(T,0,INF);\n \n for(int i=0;i<=T;i++){\n used[i]=visited[i];\n }\n \n C[0]=INF;\n \n int ans=0;\n for(int i=0;i<T;i++){\n for(int j=0;j<T;j++){\n if(i==j)continue;\n if(G[i][j]==0&&g[i][j]==true && used[i]==true && used[j]==false ){\n calcC(i);\n calcC(j);\n ans=max(ans, min(C[i],C[j]) );\n }\n }\n }\n cout<<F+ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":1120,"memory_kb":3192,"score_of_the_acc":-1.0054,"final_rank":13},{"submission_id":"aoj_2803_2235402","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n \n \n#define MAX_V 110\n \nstruct edge{int to,cap,rev;};\n \nvector<edge> G[MAX_V]; //???°???????????????\nint level[MAX_V]; //??§???????????????????¢\nint iter[MAX_V]; //????????????§????????????\n \n// from??????to?????????????????????cap????????????°?????????????????????\nvoid add_edge(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 \n// s?????????????????????¢???BFS???§??¨??????????\nvoid bfs(int s){\n rep(i,MAX_V)level[i]=-1;\n queue<int> que;\n level[s]=0;\n que.push(s);\n while(!que.empty()){\n int v=que.front();que.pop();\n \n rep(i,G[v].size()){\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 \n//??¢?????????????DFS???§???¢???\nint dfs(int v,int t,int f){\n if(v==t)return f;\n for(int &i=iter[v];i<G[v].size();i++){\n edge &e=G[v][i];\n if(e.cap>0&&level[v]<level[e.to]){\n int d=dfs(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 \n// s??????t????????????§????????±???????\nint max_flow(int s,int t){\n if(s==t)return INF;\n int flow=0;\n for(;;){\n bfs(s);\n if(level[t]<0)return flow;\n memset(iter,0,sizeof(iter));\n int f;\n while((f=dfs(s,t,INF))>0){\n flow+=f;\n }\n }\n}\n \nvoid isUsedDfs(int s,int t,bool used[MAX_V]){\n if(s==t)return ;\n for(auto &e:G[s]){\n if(!used[e.to]&&e.cap>0){\n used[e.to]=true;\n isUsedDfs(e.to,t,used);\n }\n }\n}\n \n \nint main(){\n int k,n,m;\n cin>>k>>n>>m;\n int s = 1+k+n;\n int t = 0;\n int v = s+1;\n \n rep(i,m){\n int a,b,c;\n cin>>a>>b>>c;\n add_edge(a,b,c);\n add_edge(b,a,c);\n }\n \n rep(i,k)add_edge(s,i+1,INF);\n \n int res = max_flow(s,t);\n vector<edge> Greg[MAX_V];\n rep(i,v)Greg[i] = G[i];\n \n \n bool used[MAX_V]={};\n used[s]=true;\n isUsedDfs(s,t,used);\n \n int ans = 0;\n vector<int> sflow(v,-1),tflow(v,-1);\n rep(i,v){\n for(auto e:Greg[i]){\n if(used[i]&&!used[e.to]){\n rep(i,v)G[i] = Greg[i];\n if(sflow[i]==-1) sflow[i] = max_flow(s,i);\n if(tflow[e.to]==-1)tflow[e.to] = max_flow(e.to,t);\n ans = max( ans , res + min(sflow[i],tflow[e.to]) );\n }\n }\n }\n if(ans>=INF)cout<<\"overfuro\"<<endl;\n else cout<<ans<<endl;\n \n}","accuracy":1,"time_ms":30,"memory_kb":3592,"score_of_the_acc":-0.1586,"final_rank":7},{"submission_id":"aoj_2803_2073602","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define INF 1<<28\n#define MAX_V 105\n#define ll int\nstruct edge{\n ll to,cap,rev;\n edge(ll to ,ll cap,ll rev):to(to),cap(cap),rev(rev){}\n};\nvector<edge> G[MAX_V];\nvector<edge> G2[MAX_V];\nbool used[MAX_V];\nint level[MAX_V];\nint iter[MAX_V];\n\n\nvoid add_edge(ll from,ll to,ll cap){\n G[from].push_back(edge(to,cap,G[to].size()));\n G[to].push_back(edge(from,cap,G[from].size()-1));\n}\n\nvoid bfs(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<G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&level[e.to]<0){\n\tlevel[e.to]=level[v]+1;\n\tque.push(e.to);\n }\n }\n }\n}\n\nint dfs(int v,int t,int f){\n if(v==t) return f;\n for(int &i=iter[v];i<G[v].size();i++){\n edge &e=G[v][i];\n if(e.cap>0&&level[v]<level[e.to]){\n int d = dfs(e.to,t,min(f,e.cap));\n if(d>0){\n\te.cap-=d;\n\tG[e.to][e.rev].cap+=d;\n\treturn d;\n }\n }\n }\n return 0;\n}\n\nvoid bfs2(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<G2[v].size();i++){\n edge &e = G2[v][i];\n if(e.cap>0&&level[e.to]<0){\n\tlevel[e.to]=level[v]+1;\n\tque.push(e.to);\n }\n }\n }\n}\n\nint dfs2(int v,int t,int f){\n if(v==t) return f;\n for(int &i=iter[v];i<G2[v].size();i++){\n edge &e=G2[v][i];\n if(e.cap>0&&level[v]<level[e.to]){\n int d = dfs2(e.to,t,min(f,e.cap));\n if(d>0){\n\te.cap-=d;\n\tG2[e.to][e.rev].cap+=d;\n\treturn d;\n }\n }\n }\n return 0;\n}\n\nint flow=0;\nint max_flow(int s,int t){\n for(;;){\n bfs(s);\n if(level[t]<0) return flow;\n memset(iter,0,sizeof(iter));\n int f;\n while((f=dfs(s,t,INF))>0){\n flow+=f;\n }\n }\n}\n\nint max_flow2(int s,int t){\n int flow2=0;\n for(;;){\n bfs2(s);\n if(level[t]<0) return flow2;\n memset(iter,0,sizeof(iter));\n int f;\n while((f=dfs2(s,t,INF))>0){\n flow2+=f;\n }\n }\n}\n\nsigned main(){\n ll k,n,m,i,j,a,b,c,x,y;\n cin >> k >> n >> m;\n ll s=MAX_V-1,t=0;\n for(i=0;i<m;i++){\n cin >> a >> b >> c;\n add_edge(a,b,c);\n }\n for(i=1;i<=k;i++){\n add_edge(s,i,INF);\n }\n ll ans=max_flow(s,t);\n for(i=1;i<MAX_V-1;i++){\n for(j=0;j<G[i].size();j++){\n if(G[i][j].cap!=0) continue;\n for(x=0;x<MAX_V;x++) G2[x]=G[x];\n G2[i][j].cap=INF;\n ans=max(ans,flow+max_flow2(s,t));\n if(ans>=INF) break;\n }\n } if(ans>=INF) cout << \"overfuro\" << endl;\n else cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3264,"score_of_the_acc":-0.0838,"final_rank":4},{"submission_id":"aoj_2803_2030843","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <sstream>\n#include <string>\n#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repd(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define mod 1000000007\n#define inf 1000000007\n#define mp make_pair\n#define pb push_back\ntypedef long long ll;\nusing namespace std;\ntemplate <typename T>\ninline void output(T a, int p = 0) {\n if(p) cout << fixed << setprecision(p) << a << \"\\n\";\n else cout << a << \"\\n\";\n}\n// end of template\n// goal, capacity, index of reverse edge\nstruct edge {\n int to, cap, rev;\n};\n\nstruct ftc{\n int from, to, cap;\n};\n\n// O(EV^2)\nclass Dinic{\npublic:\n int V;\n vector<vector<edge>> G;\n vector<int> L;\n vector<int> I;\n vector<int> vis;\n \n Dinic(int v){\n G.resize(v), L.resize(v), I.resize(v), vis.assign(v, 0);\n V = v;\n }\n \n // add edge\n void add(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 \n // label dist from s\n void bfs(int s){\n L.assign(V, -1);\n queue<int> q;\n L[s] = 0;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n rep(i, G[v].size()){\n edge &e = G[v][i];\n if (e.cap > 0 && L[e.to] < 0) {\n L[e.to] = L[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n \n // search positive path\n int dfs(int v, int t, int f){\n if (v == t) return f;\n for (int &i = I[v]; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && L[v] < L[e.to]) {\n int d = dfs(e.to, t, min(f, e.cap));\n if (d) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n \n // calc max flow\n int max_flow(int s, int t){\n int flow = 0;\n for (;;) {\n bfs(s);\n if (L[t] < 0) return flow;\n I.assign(V, 0);\n int f;\n while ((f = dfs(s, t, inf)) > 0) {\n flow += f;\n }\n }\n }\n \n vector<ftc> pipe;\n vector<int> ofuro;\n vector<int> neck;\n void dfs_cut(int s){\n if(vis[s] == 1){\n return;\n }\n vis[s] = 1;\n rep(i, G[s].size()){\n \n if(G[s][i].cap > 0){\n dfs_cut(G[s][i].to);\n }\n else ofuro.pb(s), neck.pb(G[s][i].to), pipe.pb({s, G[s][i].to, G[s][i].cap});\n }\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n // source code\n int K, N, M;\n cin >> K >> N >> M;\n \n Dinic mf(K + N + 2);\n vector<ftc> E;\n // source: K + N + 1\n // sink: 0\n // spring: 1 ~ K\n // joint: K + 1 ~ K + N\n rep(i, K){\n E.pb({K + N + 1, i + 1, inf});\n mf.add(K + N + 1, i + 1, inf);\n }\n \n rep(i, M){\n int a, b, c;\n cin >> a >> b >> c;\n if(a != 0 && !(b >= 1 && b <= K)) mf.add(a, b, c), E.pb({a, b, c});\n if(!(a >= 1 && a <= K) && b != 0) mf.add(b, a, c), E.pb({b, a, c});\n }\n auto D = mf;\n int mfmf = mf.max_flow(K + N + 1, 0);\n \n mf.dfs_cut(K + N + 1);\n \n int ret = 0;\n vector<int> source(K + N + 2, 0), sink(K + N + 2, 0);\n \n for(int f: mf.ofuro){\n auto d = D;\n if(K + N + 1 == f) {\n source[f] = inf;\n continue;\n }\n source[f] = d.max_flow(K + N + 1, f);\n }\n \n for(int f: mf.neck){\n auto d = D;\n if(f == 0) {\n sink[f] = inf;\n continue;\n }\n sink[f] = d.max_flow(f, 0);\n }\n \n rep(i, D.G.size()){\n for(edge e: D.G[i]){\n if(source[i] > 0 && sink[e.to] > 0){\n// cout << source[i] << \", \" << sink[e.to] << \", \" << e.cap << endl;\n ret = max(ret, mfmf + min(source[i], sink[e.to]) - e.cap);\n if(min(source[i], sink[e.to]) == inf){\n output(\"overfuro\");\n return 0;\n }\n }\n }\n }\n \n \n \n \n// if(ret >= inf){\n// output(\"overfuro\");\n// }\n// else{\n output(ret);\n// }\n \n \n return 0;\n}","accuracy":0.14583333333333334,"time_ms":180,"memory_kb":3300,"score_of_the_acc":-0.195,"final_rank":18},{"submission_id":"aoj_2803_2029878","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <sstream>\n#include <string>\n#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repd(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define mod 1000000007\n#define inf 1000000007\n#define mp make_pair\n#define pb push_back\ntypedef long long ll;\nusing namespace std;\ntemplate <typename T>\ninline void output(T a, int p = 0) {\n if(p) cout << fixed << setprecision(p) << a << \"\\n\";\n else cout << a << \"\\n\";\n}\n// end of template\n// goal, capacity, index of reverse edge\nstruct edge {\n int to, cap, rev;\n};\n\nstruct ftc{\n int from, to, cap;\n};\n\n// O(EV^2)\nclass Dinic{\npublic:\n int V;\n vector<vector<edge>> G;\n vector<int> L;\n vector<int> I;\n vector<int> vis;\n \n Dinic(int v){\n G.resize(v), L.resize(v), I.resize(v), vis.assign(v, 0);\n V = v;\n }\n \n // add edge\n void add(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 \n // label dist from s\n void bfs(int s){\n L.assign(V, -1);\n queue<int> q;\n L[s] = 0;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n rep(i, G[v].size()){\n edge &e = G[v][i];\n if (e.cap > 0 && L[e.to] < 0) {\n L[e.to] = L[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n \n // search positive path\n int dfs(int v, int t, int f){\n if (v == t) return f;\n for (int &i = I[v]; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && L[v] < L[e.to]) {\n int d = dfs(e.to, t, min(f, e.cap));\n if (d) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n \n // calc max flow\n int max_flow(int s, int t){\n int flow = 0;\n for (;;) {\n bfs(s);\n if (L[t] < 0) return flow;\n I.assign(V, 0);\n int f;\n while ((f = dfs(s, t, inf)) > 0) {\n flow += f;\n }\n }\n }\n \n vector<ftc> pipe;\n vector<int> ofuro;\n vector<int> neck;\n void dfs_cut(int s){\n if(vis[s] == 1){\n return;\n }\n vis[s] = 1;\n rep(i, G[s].size()){\n \n if(G[s][i].cap > 0){\n dfs_cut(G[s][i].to);\n }\n else ofuro.pb(s), neck.pb(G[s][i].to), pipe.pb({s, G[s][i].to, G[s][i].cap});\n }\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n // source code\n int K, N, M;\n cin >> K >> N >> M;\n \n Dinic mf(K + N + 2);\n vector<ftc> E;\n // source: K + N + 1\n // sink: 0\n // spring: 1 ~ K\n // joint: K + 1 ~ K + N\n rep(i, K){\n E.pb({K + N + 1, i + 1, inf});\n mf.add(K + N + 1, i + 1, inf);\n }\n \n rep(i, M){\n int a, b, c;\n cin >> a >> b >> c;\n if(a != 0 && !(b >= 1 && b <= K)) mf.add(a, b, c), E.pb({a, b, c});\n if(!(a >= 1 && a <= K) && b != 0) mf.add(b, a, c), E.pb({b, a, c});\n }\n auto D = mf;\n int mfmf = mf.max_flow(K + N + 1, 0);\n \n mf.dfs_cut(K + N + 1);\n \n int ret = 0;\n vector<int> source(K + N + 2, 0), sink(K + N + 2, 0);\n \n for(int f: mf.ofuro){\n auto d = D;\n if(K + N + 1 == f) {\n source[f] = inf;\n continue;\n }\n source[f] = d.max_flow(K + N + 1, f);\n }\n \n for(int f: mf.neck){\n auto d = D;\n if(f == 0) {\n sink[f] = inf;\n continue;\n }\n sink[f] = d.max_flow(f, 0);\n }\n \n rep(i, D.G.size()){\n for(edge e: D.G[i]){\n if(source[i] && sink[e.to]){\n// cout << source[i] << \", \" << sink[e.to] << \", \" << e.cap << endl;\n ret = max(ret, mfmf + min(source[i], sink[e.to]) - e.cap);\n if(min(source[i], sink[e.to]) == inf){\n output(\"overfuro\");\n return 0;\n }\n }\n }\n }\n \n \n \n \n// if(ret >= inf){\n// output(\"overfuro\");\n// }\n// else{\n output(ret);\n// }\n \n \n return 0;\n}","accuracy":0.14583333333333334,"time_ms":150,"memory_kb":3296,"score_of_the_acc":-0.1667,"final_rank":15},{"submission_id":"aoj_2803_2029832","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <sstream>\n#include <string>\n#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repd(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define mod 1000000007\n#define inf 1000000007\n#define mp make_pair\n#define pb push_back\ntypedef long long ll;\nusing namespace std;\ntemplate <typename T>\ninline void output(T a, int p = 0) {\n if(p) cout << fixed << setprecision(p) << a << \"\\n\";\n else cout << a << \"\\n\";\n}\n// end of template\n// goal, capacity, index of reverse edge\nstruct edge {\n int to, cap, rev;\n};\n\nstruct ftc{\n int from, to, cap;\n};\n\n// O(EV^2)\nclass Dinic{\npublic:\n int V;\n vector<vector<edge>> G;\n vector<int> L;\n vector<int> I;\n vector<int> vis;\n \n Dinic(int v){\n G.resize(v), L.resize(v), I.resize(v), vis.assign(v, 0);\n V = v;\n }\n \n // add edge\n void add(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 \n // label dist from s\n void bfs(int s){\n L.assign(V, -1);\n queue<int> q;\n L[s] = 0;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n rep(i, G[v].size()){\n edge &e = G[v][i];\n if (e.cap > 0 && L[e.to] < 0) {\n L[e.to] = L[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n \n // search positive path\n int dfs(int v, int t, int f){\n if (v == t) return f;\n for (int &i = I[v]; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && L[v] < L[e.to]) {\n int d = dfs(e.to, t, min(f, e.cap));\n if (d) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n \n // calc max flow\n int max_flow(int s, int t){\n int flow = 0;\n for (;;) {\n bfs(s);\n if (L[t] < 0) return flow;\n I.assign(V, 0);\n int f;\n while ((f = dfs(s, t, inf)) > 0) {\n flow += f;\n }\n }\n }\n \n vector<ftc> pipe;\n vector<int> ofuro;\n vector<int> neck;\n void dfs_cut(int s){\n if(vis[s] == 1){\n return;\n }\n vis[s] = 1;\n rep(i, G[s].size()){\n \n if(G[s][i].cap > 0){\n dfs_cut(G[s][i].to);\n }\n else ofuro.pb(s), neck.pb(G[s][i].to), pipe.pb({s, G[s][i].to, G[s][i].cap});\n }\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n // source code\n int K, N, M;\n cin >> K >> N >> M;\n \n Dinic mf(K + N + 2);\n vector<ftc> E;\n // source: K + N + 1\n // sink: 0\n // spring: 1 ~ K\n // joint: K + 1 ~ K + N\n rep(i, K){\n E.pb({K + N + 1, i + 1, inf});\n mf.add(K + N + 1, i + 1, inf);\n }\n \n rep(i, M){\n int a, b, c;\n cin >> a >> b >> c;\n if(a != 0 && !(b >= 1 && b <= K)) mf.add(a, b, c), E.pb({a, b, c});\n if(!(a >= 1 && a <= K) && b != 0) mf.add(b, a, c), E.pb({b, a, c});\n }\n auto D = mf;\n int mfmf = mf.max_flow(K + N + 1, 0);\n \n mf.dfs_cut(K + N + 1);\n \n int ret = 0;\n vector<int> source(K + N + 2, 0), sink(K + N + 2, 0);\n \n for(int f: mf.ofuro){\n auto d = D;\n if(K + N + 1 == f) {\n source[f] = inf;\n continue;\n }\n source[f] = d.max_flow(K + N + 1, f);\n }\n \n for(int f: mf.neck){\n auto d = D;\n if(f == 0) {\n sink[f] = inf;\n continue;\n }\n sink[f] = d.max_flow(f, 0);\n }\n \n rep(i, D.G.size()){\n for(edge e: D.G[i]){\n if(source[i] && sink[e.to]){\n ret = max(ret, mfmf + min(source[i], sink[e.to]) - e.cap);\n }\n }\n }\n \n \n \n \n if(ret >= inf){\n output(\"overfuro\");\n }\n else{\n output(ret);\n }\n \n \n return 0;\n}","accuracy":0.14583333333333334,"time_ms":170,"memory_kb":3300,"score_of_the_acc":-0.186,"final_rank":17},{"submission_id":"aoj_2803_2029831","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <sstream>\n#include <string>\n#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repd(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define mod 1000000007\n#define inf 20000000\n#define mp make_pair\n#define pb push_back\ntypedef long long ll;\nusing namespace std;\ntemplate <typename T>\ninline void output(T a, int p = 0) {\n if(p) cout << fixed << setprecision(p) << a << \"\\n\";\n else cout << a << \"\\n\";\n}\n// end of template\n// goal, capacity, index of reverse edge\nstruct edge {\n int to, cap, rev;\n};\n\nstruct ftc{\n int from, to, cap;\n};\n\n// O(EV^2)\nclass Dinic{\npublic:\n int V;\n vector<vector<edge>> G;\n vector<int> L;\n vector<int> I;\n vector<int> vis;\n \n Dinic(int v){\n G.resize(v), L.resize(v), I.resize(v), vis.assign(v, 0);\n V = v;\n }\n \n // add edge\n void add(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 \n // label dist from s\n void bfs(int s){\n L.assign(V, -1);\n queue<int> q;\n L[s] = 0;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n rep(i, G[v].size()){\n edge &e = G[v][i];\n if (e.cap > 0 && L[e.to] < 0) {\n L[e.to] = L[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n \n // search positive path\n int dfs(int v, int t, int f){\n if (v == t) return f;\n for (int &i = I[v]; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && L[v] < L[e.to]) {\n int d = dfs(e.to, t, min(f, e.cap));\n if (d) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n \n // calc max flow\n int max_flow(int s, int t){\n int flow = 0;\n for (;;) {\n bfs(s);\n if (L[t] < 0) return flow;\n I.assign(V, 0);\n int f;\n while ((f = dfs(s, t, inf)) > 0) {\n flow += f;\n }\n }\n }\n \n vector<ftc> pipe;\n vector<int> ofuro;\n vector<int> neck;\n void dfs_cut(int s){\n if(vis[s] == 1){\n return;\n }\n vis[s] = 1;\n rep(i, G[s].size()){\n \n if(G[s][i].cap > 0){\n dfs_cut(G[s][i].to);\n }\n else ofuro.pb(s), neck.pb(G[s][i].to), pipe.pb({s, G[s][i].to, G[s][i].cap});\n }\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n // source code\n int K, N, M;\n cin >> K >> N >> M;\n \n Dinic mf(K + N + 2);\n vector<ftc> E;\n // source: K + N + 1\n // sink: 0\n // spring: 1 ~ K\n // joint: K + 1 ~ K + N\n rep(i, K){\n E.pb({K + N + 1, i + 1, inf});\n mf.add(K + N + 1, i + 1, inf);\n }\n \n rep(i, M){\n int a, b, c;\n cin >> a >> b >> c;\n if(a != 0 && !(b >= 1 && b <= K)) mf.add(a, b, c), E.pb({a, b, c});\n if(!(a >= 1 && a <= K) && b != 0) mf.add(b, a, c), E.pb({b, a, c});\n }\n auto D = mf;\n int mfmf = mf.max_flow(K + N + 1, 0);\n \n mf.dfs_cut(K + N + 1);\n \n int ret = 0;\n vector<int> source(K + N + 2, 0), sink(K + N + 2, 0);\n \n for(int f: mf.ofuro){\n auto d = D;\n if(K + N + 1 == f) {\n source[f] = inf;\n continue;\n }\n source[f] = d.max_flow(K + N + 1, f);\n }\n \n for(int f: mf.neck){\n auto d = D;\n if(f == 0) {\n sink[f] = inf;\n continue;\n }\n sink[f] = d.max_flow(f, 0);\n }\n \n rep(i, D.G.size()){\n for(edge e: D.G[i]){\n if(source[i] && sink[e.to]){\n ret = max(ret, mfmf + min(source[i], sink[e.to]) - e.cap);\n }\n }\n }\n \n \n \n \n if(ret >= inf){\n output(\"overfuro\");\n }\n else{\n output(ret);\n }\n \n \n return 0;\n}","accuracy":0.14583333333333334,"time_ms":170,"memory_kb":3288,"score_of_the_acc":-0.182,"final_rank":16},{"submission_id":"aoj_2803_2008371","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n\n\n#define MAX_V 110\n\nstruct edge{int to,cap,rev;};\n\nvector<edge> G[MAX_V]; //??°???????????????\nint level[MAX_V]; //?§??????????????????¢\nint iter[MAX_V]; //???????????§????????????\n\n// from??????to?????????????????????cap???????????°?????????????????????\nvoid add_edge(int from,int to,int cap){\n\tG[from].push_back( (edge){ to ,cap,(int)G[to ].size() } );\n\tG[to ].push_back( (edge){ from,0 ,(int)G[from].size()-1 } );\n}\n\n// s????????????????????¢???BFS??§?¨??????????\nvoid bfs(int s){\n\trep(i,MAX_V)level[i]=-1;\n\tqueue<int> que;\n\tlevel[s]=0;\n\tque.push(s);\n\twhile(!que.empty()){\n\t\tint v=que.front();que.pop();\n\t\t\n\t\trep(i,G[v].size()){\n\t\t\tedge &e=G[v][i];\n\t\t\tif(e.cap>0 && level[e.to]<0){\n\t\t\t\tlevel[e.to]=level[v]+1;\n\t\t\t\tque.push(e.to);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//?¢?????????????DFS??§??¢???\nint dfs(int v,int t,int f){\n\tif(v==t)return f;\n\tfor(int &i=iter[v];i<G[v].size();i++){\n\t\tedge &e=G[v][i];\n\t\tif(e.cap>0&&level[v]<level[e.to]){\n\t\t\tint 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\n// s??????t???????????§???????±???????\nint max_flow(int s,int t){\n\tif(s==t)return INF;\n\tint flow=0;\n\tfor(;;){\n\t\tbfs(s);\n\t\tif(level[t]<0)return flow;\n\t\tmemset(iter,0,sizeof(iter));\n\t\tint f;\n\t\twhile((f=dfs(s,t,INF))>0){\n\t\t\tflow+=f;\n\t\t}\n\t}\n}\n\nvoid isUsedDfs(int s,int t,bool used[MAX_V]){\n\tif(s==t)return ;\n\tfor(auto &e:G[s]){\n\t\tif(!used[e.to]&&e.cap>0){\n\t\t\tused[e.to]=true;\n\t\t\tisUsedDfs(e.to,t,used);\n\t\t}\n\t}\n}\n\n\nint main(){\n\tint k,n,m;\n\tcin>>k>>n>>m;\n\tint s = 1+k+n;\n\tint t = 0;\n\tint v = s+1;\n\t\n\trep(i,m){\n\t\tint a,b,c;\n\t\tcin>>a>>b>>c;\n\t\tadd_edge(a,b,c);\n\t\tadd_edge(b,a,c);\n\t}\n\t\n\trep(i,k)add_edge(s,i+1,INF);\n\t\n\tint res = max_flow(s,t);\n\tvector<edge> Greg[MAX_V];\n\trep(i,v)Greg[i] = G[i];\n\t\n\t\n\tbool used[MAX_V]={};\n\tused[s]=true;\n\tisUsedDfs(s,t,used);\n\t\n\tint ans = 0;\n\tvector<int> sflow(v,-1),tflow(v,-1);\n\trep(i,v){\n\t\tfor(auto e:Greg[i]){\n\t\t\tif(used[i]&&!used[e.to]){\n\t\t\t\trep(i,v)G[i] = Greg[i];\n\t\t\t\tif(sflow[i]==-1) sflow[i] = max_flow(s,i);\n\t\t\t\tif(tflow[e.to]==-1)tflow[e.to] = max_flow(e.to,t);\n\t\t\t\tans = max( ans , res + min(sflow[i],tflow[e.to]) );\n\t\t\t}\n\t\t}\n\t}\n\tif(ans>=INF)cout<<\"overfuro\"<<endl;\n\telse cout<<ans<<endl;\n\t\n}","accuracy":1,"time_ms":30,"memory_kb":3580,"score_of_the_acc":-0.1545,"final_rank":5},{"submission_id":"aoj_2803_2005167","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\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++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define printV(v) for(auto&& x : v){cout << x << \" \";} cout << endl\n#define printVV(vv) for(auto&& v : vv){for(auto&& x : v){cout << x << \" \";}cout << endl;}\n#define printP(p) cout << p.first << \" \" << p.second << endl\n#define printVP(vp) for(auto&& p : vp) printP(p);\n\nstruct edge { int to, cap, rev; };\nusing Graph = vector<vector<edge>>;\n\nconst int inf = 1e9;\nconst int MAX_V = 110;\nint level[MAX_V];\nint iter[MAX_V];\nbool reachable[MAX_V]; // ????????°?????????????????????S????????°???????????????\n\nvoid add_edge(Graph& 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\nvoid bfs(Graph& G, 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 < 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 dfs(Graph& G, int v, int t, int f) {\n if (v == t) return f;\n for (int &i = iter[v]; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && level[v] < level[e.to]) {\n int d = dfs(G, 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(Graph& G, int s, int t) {\n int flow = 0;\n for (;;) {\n bfs(G, s);\n if (level[t] < 0) return flow;\n memset(iter, 0, sizeof(iter));\n int f;\n while ((f = dfs(G, s, t, inf)) > 0) {\n flow += f;\n }\n }\n}\n\n// Graph????????§??§?????????\nint max_flow_2(Graph G, int s, int t) {\n int flow = 0;\n for (;;) {\n bfs(G, s);\n if (level[t] < 0) return flow;\n memset(iter, 0, sizeof(iter));\n int f;\n while ((f = dfs(G, s, t, inf)) > 0) {\n flow += f;\n }\n }\n}\n\nvoid my_dfs (Graph& G, int v) {\n if (reachable[v]) return; // ??¢?????\\?????????\n reachable[v] = true;\n for (auto e : G[v]) {\n if (e.cap > 0) {\n my_dfs(G, e.to);\n }\n }\n}\n\nsigned main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int K, N, M;\n cin >> K >> N >> M;\n\n Graph G_ori(MAX_V);\n const int s = K + N + 1, t = 0;\n const int V = s + 1;\n rep(i, M) {\n int a, b, c;\n cin >> a >> b >> c;\n add_edge(G_ori, a, b, c);\n add_edge(G_ori, b, a, c);\n }\n rep(i, K) {\n add_edge(G_ori, s, i + 1, inf);\n }\n\n Graph G_flow = G_ori;\n int flow = max_flow(G_flow, s, t);\n my_dfs(G_flow, s);\n\n vector<int> f1(V), f2(V); // s->i, i->t\n f1[s] = inf; f2[t] = inf;\n rep2(i, 1, K + N + 1) {\n Graph G_tmp = G_flow;\n if (reachable[i]) {\n f1[i] = max_flow(G_tmp, s, i);\n } else {\n f2[i] = max_flow(G_tmp, i, t);\n }\n }\n\n int ans = -1;\n rep(v, V) {\n for (auto e : G_ori[v]) {\n int u = e.to;\n if (reachable[v] && !reachable[u]) {\n ans = max(ans, flow + min(f1[v], f2[u]));\n }\n }\n }\n\n if (ans >= inf) {\n cout << \"overfuro\" << endl;\n } else {\n cout << ans << endl;\n }\n\n}","accuracy":1,"time_ms":30,"memory_kb":3708,"score_of_the_acc":-0.1977,"final_rank":10},{"submission_id":"aoj_2803_2004232","code_snippet":"#define _USE_MATH_DEFINES\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <complex>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <limits>\n#include <climits>\n#include <cfloat>\n#include <functional>\nusing namespace std;\n\nclass Edge\n{\npublic:\n int to, cap, rev;\n Edge(){};\n Edge(int to0, int cap0){to = to0; cap = cap0;}\n Edge(int to0, int cap0, int rev0){to = to0; cap = cap0; rev = rev0;}\n};\n\nint maxFlow(const vector<vector<Edge> >& edges0, int source, int sink, vector<vector<Edge> >& edgesOut)\n{\n static vector<vector<Edge> > edges;\n static vector<unsigned> index;\n static vector<int> level;\n static int n;\n\n class Func{\n public:\n static void bfs(int s){\n level.assign(n, -1);\n queue<int> q;\n level[s] = 0;\n q.push(s);\n while(!q.empty()){\n int v = q.front();\n q.pop();\n for(unsigned i=0; i<edges[v].size(); ++i){\n Edge& e = edges[v][i];\n if(e.cap > 0 && level[e.to] < 0){\n level[e.to] = level[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n static int dfs(int s, int t, int f){\n if(s == t)\n return f;\n for(unsigned& i=index[s]; i<edges[s].size(); ++i){\n Edge& e = edges[s][i];\n if(e.cap > 0 && level[s] < level[e.to]){\n int g = dfs(e.to, t, min(f, e.cap));\n if(g > 0){\n e.cap -= g;\n edges[e.to][e.rev].cap += g;\n return g;\n }\n }\n }\n return 0;\n }\n };\n\n if(source == sink){\n edgesOut = edges;\n return INT_MAX;\n }\n\n n = edges0.size();\n edges = edges0;\n\n int ret = 0;\n for(;;){\n Func::bfs(source);\n if(level[sink] < 0){\n edgesOut.swap(edges);\n return ret;\n }\n index.assign(n, 0);\n int f;\n while((f = Func::dfs(source, sink, INT_MAX)) > 0)\n ret += f;\n }\n}\n\nconst int INF = INT_MAX / 2;\n\nint main()\n{\n int k, n, m;\n cin >> k >> n >> m;\n\n vector<vector<Edge> > edges(n+k+2);\n int source = n + k + 1;\n int sink = 0;\n for(int i=1; i<=k; ++ i){\n edges[source].push_back(Edge(i, INF, edges[i].size()));\n edges[i].push_back(Edge(source, INF, edges[source].size()-1));\n }\n for(int i=0; i<m; ++i){\n int a, b, c;\n cin >> a >> b >> c;\n if(a == 0 || b == 0){\n if(1 <= a + b && a + b <= k){\n cout << \"overfuro\" << endl;\n return 0;\n }\n }\n edges[a].push_back(Edge(b, c, edges[b].size()));\n edges[b].push_back(Edge(a, c, edges[a].size()-1));\n }\n\n vector<vector<Edge> > edges2;\n int flow = maxFlow(edges, source, sink, edges2);\n vector<bool> check(n+k+2, false);\n queue<int> q;\n check[source] = true;\n q.push(source);\n while(!q.empty()){\n int pos = q.front();\n q.pop();\n for(const Edge& e : edges2[pos]){\n if(e.cap > 0 && !check[e.to]){\n check[e.to] = true;\n q.push(e.to);\n }\n }\n }\n\n vector<int> addFlow(n+k+2);\n for(int i=0; i<n+k+2; ++i){\n vector<vector<Edge> > edges3;\n if(check[i])\n addFlow[i] = maxFlow(edges2, source, i, edges3);\n else\n addFlow[i] = maxFlow(edges2, i, sink, edges3);\n }\n\n int ans = flow;\n for(int i=0; i<n+k+2; ++i){\n for(const Edge& e : edges2[i]){\n if(check[i] ^ check[e.to])\n ans = max(ans, flow + min(addFlow[i], addFlow[e.to]));\n }\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3312,"score_of_the_acc":-0.055,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2803_8322658\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\nusing namespace std;\\n\\nstruct Edge {\\n\\tint to, cap, rev;\\n};\\n\\nclass MaxFlow {\\npublic:\\n\\tvector<Edge> G[109];\\n\\tint Dist[109];\\n\\tbool Used[109];\\n\\n\\tvoid add_edge(int u, int v, int c) {\\n\\t\\tG[u].push_back(Edge{ v, c, (int)G[v].size() });\\n\\t\\tG[v].push_back(Edge{ u, 0, (int)G[u].size() - 1 });\\n\\t}\\n\\n\\tvoid shortest(int u) {\\n\\t\\tqueue<int> Q;\\n\\t\\tfor (int i = 0; i < 109; i++) Dist[i] = 1000000000;\\n\\t\\tDist[u] = 0;\\n\\t\\tQ.push(u);\\n\\n\\t\\t// BFS Start\\n\\t\\twhile (!Q.empty()) {\\n\\t\\t\\tint pos = Q.front(); Q.pop();\\n\\t\\t\\tfor (int i = 0; i < G[pos].size(); i++) {\\n\\t\\t\\t\\tif (G[pos][i].cap == 0) continue;\\n\\t\\t\\t\\tif (Dist[G[pos][i].to] != 1000000000) continue;\\n\\t\\t\\t\\tDist[G[pos][i].to] = Dist[pos] + 1;\\n\\t\\t\\t\\tQ.push(G[pos][i].to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint dfs(int pos, int goal, int f) {\\n\\t\\tif (pos == goal) return f;\\n\\t\\tUsed[pos] = true;\\n\\n\\t\\t// Brute Force\\n\\t\\tfor (int i = 0; i < G[pos].size(); i++) {\\n\\t\\t\\tif (G[pos][i].cap == 0) continue;\\n\\t\\t\\tif (Used[G[pos][i].to] == true) continue;\\n\\t\\t\\tif (Dist[pos] >= Dist[G[pos][i].to]) continue;\\n\\t\\t\\tint F = dfs(G[pos][i].to, goal, min(f, G[pos][i].cap));\\n\\t\\t\\tif (F == 0) continue;\\n\\t\\t\\tG[pos][i].cap -= F;\\n\\t\\t\\tG[G[pos][i].to][G[pos][i].rev].cap += F;\\n\\t\\t\\treturn F;\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tint max_flow(int u, int v) {\\n\\t\\tint F = 0;\\n\\t\\twhile (true) {\\n\\t\\t\\tshortest(u);\\n\\t\\t\\tfor (int i = 0; i < 109; i++) Used[i] = false;\\n\\t\\t\\tint res = dfs(u, v, 100000000);\\n\\t\\t\\tif (res == 0) break;\\n\\t\\t\\tF += res;\\n\\t\\t}\\n\\t\\treturn F;\\n\\t}\\n};\\n\\nint K;\\nint N;\\nint M, A[1 << 18], B[1 << 18], C[1 << 18];\\nint S[1 << 18];\\nint T[1 << 18];\\nMaxFlow Z;\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> K >> N >> M;\\n\\tfor (int i = 1; i <= M; i++) cin >> A[i] >> B[i] >> C[i];\\n\\t\\n\\t// Step 2. Max Flow\\n\\tfor (int i = 1; i <= K; i++) Z.add_edge(K + N + 1, i, 100000000);\\n\\tfor (int i = 1; i <= M; i++) Z.add_edge(A[i], B[i], C[i]);\\n\\tfor (int i = 1; i <= M; i++) Z.add_edge(B[i], A[i], C[i]);\\n\\tint First = Z.max_flow(K + N + 1, 0);\\n\\n\\t// Step 3. Get S & T\\n\\tfor (int i = 1; i <= K + N; i++) {\\n\\t\\tMaxFlow Z2 = Z, Z3 = Z;\\n\\t\\tS[i] = Z2.max_flow(K + N + 1, i);\\n\\t\\tT[i] = Z3.max_flow(i, 0);\\n\\t}\\n\\tT[0] = 100000000;\\n\\n\\t// Step 4. Get Answer\\n\\tint Answer = 0;\\n\\tfor (int i = 1; i <= M; i++) {\\n\\t\\tAnswer = max(Answer, min(S[A[i]], T[B[i]]));\\n\\t\\tAnswer = max(Answer, min(S[B[i]], T[A[i]]));\\n\\t}\\n\\tif (Answer >= 10000000) cout << \\\"overfuro\\\" << endl;\\n\\telse cout << First + Answer << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 6136,\n \"score_of_the_acc\": -1.6937,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2803_4526536\",\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;\\nusing lint = long long int;\\nlong long int INF = 1001001001001001LL;\\nint inf = 1000000007;\\nlong long int MOD = 1000000007LL;\\ndouble PI = 3.1415926535897932;\\n\\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\\n\\n#define ALL(a) a.begin(),a.end()\\n#define RALL(a) a.rbegin(),a.rend()\\n\\n/* do your best */\\n\\n// verified : http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_A\\n// O(E V^2)\\n\\n// [使い方]\\n// add_edge(from, to, cap) : from から to へ 容量 cap の辺を貼る\\n// max_flow(s, t) : s から t への最大フローを返す\\n\\ntemplate< typename T >\\nstruct Dinic{\\n const T inf;\\n\\n struct edge{\\n int to;\\n T cap;\\n int rev;\\n bool isrev;\\n };\\n\\n vector<vector<edge>> g;\\n vector<int> min_cost, iter;\\n\\n Dinic(int V) : inf(numeric_limits<T>::max()), g(V){}\\n\\n\\n // 0-indexed\\n void add_edge(int from, int to, T cap){\\n g[from].emplace_back((edge){to, cap, (int)g[to].size(), false});\\n g[to].emplace_back((edge){from, 0, (int)g[from].size() - 1, true});\\n }\\n\\n bool bfs(int s, int t) {\\n min_cost.assign(g.size(), -1);\\n queue<int> que;\\n min_cost[s] = 0;\\n que.push(s);\\n while(!que.empty() && min_cost[t] == -1){\\n int p = que.front();\\n que.pop();\\n for(auto &e : g[p]) {\\n if(e.cap > 0 && min_cost[e.to] == -1){\\n min_cost[e.to] = min_cost[p] + 1;\\n que.push(e.to);\\n }\\n }\\n }\\n return min_cost[t] != -1;\\n }\\n \\n T dfs(int idx, const int t, T flow){\\n if(idx == t) return flow;\\n for(int &i = iter[idx]; i < g[idx].size(); i++){\\n edge &e = g[idx][i];\\n if(e.cap > 0 && min_cost[idx] < min_cost[e.to]){\\n T d = dfs(e.to, t, min(flow, 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 \\n // 0-indexed\\n T max_flow(int s, int t){\\n T flow = 0;\\n while(bfs(s, t)){\\n iter.assign(g.size(), 0);\\n T f = 0;\\n while((f = dfs(s, t, inf)) > 0) flow += f;\\n }\\n\\n return flow;\\n }\\n \\n void output() {\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = g[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n }\\n};\\n\\nint main() {\\n\\n int k, n, m; cin >> k >> n >> m;\\n int source = n + k + 1;\\n int sink = 0;\\n\\n // 0 と (1 ~ k) が直接繋がっていたら，overfuro\\n\\n Dinic<lint> dc(n + k + 2);\\n bool overfuro = false;\\n for (int i = 0; i < m; i++) {\\n lint a, b, c; cin >> a >> b >> c;\\n if (a > b) swap(a, b);\\n if (a == sink and 1 <= b and b <= k) {\\n overfuro = true;\\n }\\n dc.add_edge(a, b, c);\\n dc.add_edge(b, a, c);\\n }\\n\\n if (overfuro) {\\n cout << \\\"overfuro\\\" << endl;\\n return 0;\\n }\\n\\n for (int i = 1; i <= k; i++) {\\n dc.add_edge(source, i, INF);\\n }\\n\\n lint ans = dc.max_flow(source, sink);\\n\\n lint add = 0;\\n for(int i = 0; i < dc.g.size(); i++) {\\n for(auto &e : dc.g[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = dc.g[e.to][e.rev];\\n if (rev_e.cap == e.cap + rev_e.cap) {\\n auto extra = dc;\\n extra.add_edge(i, e.to, INF);\\n lint tmp = extra.max_flow(source, sink);\\n add = max(add, tmp);\\n }\\n // cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n\\n cout << ans + add << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3992,\n \"score_of_the_acc\": -0.618,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2803_4488321\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> mp;\\ntypedef pair<mp,ll> mmp;\\n\\n#define INF 1e9\\nstruct edge{\\n ll to,rev;\\n ll cap,cost;\\n edge(ll to, ll cap ,ll rev):to(to),cap(cap),rev(rev){}\\n edge(ll to, ll cap,ll cost,ll rev):to(to),cap(cap),cost(cost),rev(rev){}\\n};\\ntypedef vector<vector<edge> > graph;\\nstruct Flow{\\n\\tgraph g;\\n\\tll MAXC = 1<<30;\\n\\tll n;\\n\\tvector<bool> used;\\n\\tvector<ll> prevv,preve,dist;\\n\\tFlow() {} \\n\\tFlow(ll _n) : g(_n),n(_n),used(_n,false),prevv(_n),preve(_n),dist(_n,MAXC){}\\n\\t// G[e.to][e.rev] で逆辺を操作できる\\n\\tvoid add_edge(ll from , ll to , ll cap){\\n\\t g[from].push_back( edge(to,cap,g[to].size() ) );\\n\\t g[to].push_back( edge(from,0,g[from].size()-1) );\\n\\t}\\n\\tvoid add_edge(ll from, ll to, ll cap,ll cost){\\n\\t g[from].push_back( edge(to,cap,cost,g[to].size() ) );\\n\\t g[to].push_back( edge(from, 0,-cost,g[from].size()-1) );\\n\\t}\\n\\t// Ford-Fulkerson 法による 最大流 O( F |E| )\\n\\t// Bellman-Ford 法による 最小費用流 O( F |V| |E| )\\n\\t// Verified: AOJ GRL_6_A (Maximum Flow)\\n\\t// 行き先と容量と逆辺のインデックスを記録する構造体\\n\\t// 通常のグラフの辺の構造体と異なるため注意\\n\\t// 最小費用流はもう少し速くできるので、改良しましょう\\n\\t// → ダイクストラが使えるようにポテンシャルを導入しよう\\n\\tll dfs(ll v,ll t , ll f){\\n\\t if( v== t)return f;\\n\\t used[v] = true;\\n\\t for(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 ll d = dfs(e.to,t,min(f,e.cap) );\\n\\t\\t if( d > 0){\\n\\t\\t\\te.cap -= d;\\n\\t\\t\\tg[e.to][e.rev].cap += d;\\n\\t\\t\\treturn d;\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t return 0;\\n\\t}\\n\\tll max_flow(ll s,ll t){\\n\\t ll flow = 0;\\n\\t while(1){\\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\\t }\\n\\t}\\n\\tll mincost_flow(ll s,ll t,ll f){\\n\\t ll res = 0;\\n\\t ll M = MAXC ;\\n\\t while(f>0){\\n\\t\\tfill(dist.begin(),dist.end(), M);\\n\\t\\tdist[s] = 0;\\n\\t\\tbool update = true;\\n\\t\\twhile(update){\\n\\t\\t update = false;\\n\\t\\t for(ll i=0;i<n;i++){\\n\\t\\t\\tif(dist[i] == M) continue;\\n\\t\\t\\tfor(ll j=0;j<g[i].size();j++){\\n\\t\\t\\t edge &e = g[i][j];\\n\\t\\t\\t if(e.cap > 0 && dist[e.to] > dist[i] + e.cost){\\n\\t\\t\\t\\tdist[e.to] = dist[i] + e.cost;\\n\\t\\t\\t\\tprevv[e.to] = i;\\n\\t\\t\\t\\tpreve[e.to] = j;\\n\\t\\t\\t\\tupdate = true;\\n\\t\\t\\t }\\n\\t\\t\\t}\\n\\t\\t }\\n\\t\\t}\\n\\t\\tif( dist[t] == M) return -1;\\n\\t\\tll d = f;\\n\\t\\tfor(ll i= t ; i!=s; i=prevv[i] ) d = min(d,g[ prevv[i] ][ preve[i] ].cap );\\n\\t\\tf -= d;\\n\\t\\tres += d*dist[t];\\n\\t\\tfor(ll i= t ; i!=s; i=prevv[i] ){\\n\\t\\t edge &e = g[prevv[i] ][preve[i]];\\n\\t\\t e.cap -= d;\\n\\t\\t g[i][e.rev].cap += d;\\n\\t\\t}\\n\\t }\\n\\t return res;\\n\\t}\\n\\t // ポテンシャルの導入により、ダイクストラ法で最小費用流を解く\\n\\t // [仮定している条件]\\n\\t // 1. グラフに負の閉路が存在しない (流量の 0 初期化のため)\\n\\t // もし存在するならベルマンフォードで負の閉路を見つけ\\n\\t // そこに流せるだけ流してスタート\\n\\t // 2. グラフに負の辺が存在しない (pot_0 の計算可能性)\\n\\t // もし存在する場合は最初のみベルマンフォードを使う必要あり\\n\\tll fast_mincost_flow(ll s,ll t,ll f){\\n\\t ll res = 0, M = MAXC;\\n\\t vector<ll> pot(n);\\n\\t while( f > 0 ){\\n\\t\\tpriority_queue<mp,vector<mp>,greater<mp> > q;\\n\\t\\tfill(dist.begin(),dist.end(),M);\\n\\t\\tdist[s] = 0;\\n\\t\\tq.push( mp(0,s) );\\n\\t\\twhile(!q.empty()){\\n\\t\\t mp now = q.top();\\n\\t\\t q.pop();\\n\\t\\t ll v = now.second;\\n\\t\\t ll cost = now.first;\\n\\t\\t if( dist[v] < cost ) continue;\\n\\t\\t for(ll i=0;i<g[v].size();i++){\\n\\t\\t\\tedge &e = g[v][i];\\n\\t\\t\\tif( e.cap > 0 && dist[e.to] > dist[v] + e.cost + pot[v] - pot[e.to] ){\\n\\t\\t\\t dist[e.to] = dist[v] + e.cost + pot[v] - pot[e.to];\\n\\t\\t\\t prevv[e.to] = v;\\n\\t\\t\\t preve[e.to] = i;\\n\\t\\t\\t q.push( mp(dist[e.to],e.to) );\\n\\t\\t\\t}\\n\\t\\t }\\n\\t\\t}\\n\\t\\tif( dist[t] == M ) return -1;\\n\\t\\tfor(ll i = 0; i< n;i++)pot[i] += dist[i];\\n\\t\\tll d = f;\\n\\t\\tfor(ll i = t; i!=s; i= prevv[i] ) d = min(d,g[prevv[i]][preve[i]].cap);\\n\\t\\tf-=d;\\n\\t\\tres += d*pot[t];\\n\\t\\tfor(ll i = t; i!=s; i=prevv[i] ){\\n\\t\\t edge &e = g[prevv[i] ][preve[i]];\\n\\t\\t e.cap -= d;\\n\\t\\t g[i][e.rev].cap += d;\\n\\t\\t}\\n\\t }\\n\\t return res;\\n\\t}\\n};\\n\\nint main(){\\n ll k,n,m;\\n cin>>k>>n>>m;\\n vector< vector<mp> > g(n+k+2);\\n vector<mmp> ed(m);\\n\\n for(int i=0;i<m;i++){\\n ll a,b,c;\\n cin>>a>>b>>c;\\n if( a > b ){\\n swap(a,b);\\n }\\n if( a== 0 ){\\n if( b <= k ){\\n cout<<\\\"overfuro\\\"<<endl;\\n return 0;\\n }\\n }\\n ed[i] = mmp( mp(a,b), c );\\n if( a == 0 ){\\n g[b].push_back( mp(a,c) );\\n continue;\\n }\\n g[a].push_back( mp(b,c) );\\n if( k+1 <= a ) g[b].push_back( mp(a,c) );\\n }\\n\\n // cout<<\\\"OK\\\"<<endl;\\n\\n ll ans = 0;\\n for(int i=0;i<m;i++){\\n Flow f(n+k+2);\\n for(int j=1;j<=k;j++){\\n f.add_edge( n + k + 1 , j , INF );\\n }\\n for(int j=0;j<n+k+2;j++){\\n for(int l=0;l<g[j].size();l++) \\n f.add_edge( j , g[j][l].first , g[j][l].second );\\n }\\n \\n f.add_edge( ed[i].first.first , ed[i].first.second , INF );\\n if( k+1 <= ed[i].first.first ) f.add_edge( ed[i].first.second , ed[i].first.first, INF ); \\n\\n \\n \\n ans = max(ans , f.max_flow( n+k+1 , 0 ) );\\n }\\n\\n\\n cout<<ans<<endl;\\n\\n\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 540,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.4775,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2803_2921741\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld =long double;\\nconst ld eps = 1e-9;\\n\\n\\n//namespace cent {\\n//\\n//\\tstruct Edge {\\n//\\t\\tint src;\\n//\\t\\tint dst;\\n//\\t\\tlong long int cost;\\n//\\t};\\n//\\tusing Graph = vector<vector<Edge>>;\\n//\\n//\\tclass Centroid {\\n//\\tprivate:\\n//\\t\\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tint sum = 1;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ch_nums[now] = sum;\\n//\\t\\t}\\n//\\n//\\t\\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tfor (auto&& e : graph[pre_root]) {\\n//\\t\\t\\t\\tif (e.dst == pre_from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t}\\n//\\t\\t\\treturn pre_root;\\n//\\t\\t}\\n//\\n//\\t\\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\\n//\\t\\t\\tmp[make_pair(root,now)]=depth;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tdfs2(g,root,e.dst,e.src,oks,depth+1);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t};\\n//\\n//\\n//\\t\\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\\n//\\t\\t\\tdfs(graph, root, from, ch_nums, oks);\\n//\\n//\\t\\t\\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\\n//\\n//\\n//\\t\\t\\tdfs2(graph,cent_id,cent_id,-1,oks,0);\\n//\\t\\t\\tlens1[cent_id][make_pair(0,0)]--;\\n//\\t\\t\\tlens2[cent_id][0]--;\\n//\\n//\\n//\\t\\t\\toks[cent_id] = depth;\\n//\\n//\\t\\t\\t//for (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t//\\tif (e.dst == from)continue;\\n//\\t\\t\\t//\\tif (oks[e.dst] != -1)continue;\\n//\\n//\\t\\t\\t//\\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\\n//\\n//\\t\\t\\t//\\tfor (auto&& l1 : lens1[e.dst]) {\\n//\\t\\t\\t//\\t\\tint keta = l1.first.second;\\n//\\t\\t\\t//\\t\\tlong long int num = l1.first.first;\\n//\\n//\\t\\t\\t//\\t\\tlong long int need = (mod - num) / mod_pow(10, keta);\\n//\\t\\t\\t//\\t\\tneed%=mod;\\n//\\t\\t\\t//\\t\\tauto it = lens2[e.dst].find(need);\\n//\\t\\t\\t//\\t\\tif (it != lens2[e.dst].end()) {\\n//\\t\\t\\t//\\t\\t\\tans -= l1.second*it->second;\\n//\\t\\t\\t//\\t\\t}\\n//\\t\\t\\t//\\t}\\n//\\t\\t\\t//\\tlens1[e.dst].clear();\\n//\\t\\t\\t//\\tlens2[e.dst].clear();\\n//\\t\\t\\t//}\\n//\\n//\\t\\t\\tif (from != -1) {\\n//\\t\\t\\t\\tcentroid_edges[from].push_back(cent_id);\\n//\\t\\t\\t}\\n//\\t\\t\\telse {\\n//\\t\\t\\t\\tfst_centroid = cent_id;\\n//\\t\\t\\t}\\n//\\t\\t\\tfor (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t\\tif (e.dst == from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\n//\\tpublic:\\n//\\n//\\t\\tmap<pair<int,int>,int>mp;\\n//\\n//\\t\\tvector<map<pair<long long int,int>, long long int>>lens1;\\n//\\t\\tvector<map<long long int, long long int>>lens2;\\n//\\t\\tvector<vector<int>> centroid_graph;\\n//\\t\\tvector<int>ts;\\n//\\t\\tvector<int>parents;\\n//\\t\\tvector<int>oks;\\n//\\t\\tvector<int>anss;\\n//\\n//\\t\\t//fst:root snd:centroid_graph\\n//\\t\\tvoid init(const Graph&g) {\\n//\\t\\t\\tlens1.resize(g.size());\\n//\\t\\t\\tlens2.resize(g.size());\\n//\\t\\t\\toks = vector<int>(g.size(), -1);\\n//\\t\\t\\tint root = -1;\\n//\\t\\t\\tcentroid_graph.resize(g.size());\\n//\\t\\t\\tparents = vector<int>(g.size(), -1);\\n//\\t\\t\\tts=vector<int>(g.size(),-1);\\n//\\t\\t\\tanss=vector<int>(g.size(),100000);\\n//\\n//\\t\\t\\tvector<int>ch_nums(g.size());\\n//\\t\\t\\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\\n//\\n//\\t\\t\\tfor (int i = 0; i < centroid_graph.size(); ++i) {\\n//\\t\\t\\t\\tfor (auto&& e : centroid_graph[i]) {\\n//\\t\\t\\t\\t\\tparents[e] = i;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ;\\n//\\t\\t}\\n//\\t}centroid;\\n//\\n//\\n//\\tvoid addEdge(Graph& g, int a, int b, long long int c) {\\n//\\t\\tg[a].push_back(Edge{ a,b,c });\\n//\\t\\tg[b].push_back(Edge{ b,a,c });\\n//\\t}\\n//}\\n\\n\\n//const int mod = 1000000007;\\n//struct Mod {\\n//public:\\n//\\tint num;\\n//\\tMod() : Mod(0) { ; }\\n//\\tMod(long long int n) : num((n % mod + mod) % mod) {\\n//\\t\\tstatic_assert(mod<INT_MAX / 2, \\\"mod is too big, please make num 'long long int' from 'int'\\\");\\n//\\t}\\n//\\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\\n//\\toperator int() { return num; }\\n//};\\n//\\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\\n//Mod operator++(Mod &a) { return a + Mod(1); }\\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\\n//Mod operator--(Mod &a) { return a - Mod(1); }\\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\\n//Mod operator^(const Mod a, const int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = (a * a) ^ (n / 2);\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//Mod mod_pow(const Mod a, const long long int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = mod_pow((a * a), (n / 2));\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//\\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\\n//Mod operator/(const Mod a, const Mod b) {\\n//\\tassert(b.num != 0);\\n//\\treturn a * inv(b);\\n//}\\n//Mod operator/(const long long int a, const Mod b) {\\n//\\treturn Mod(a) / b;\\n//}\\n//Mod operator/=(Mod &a, const Mod b) {\\n//\\treturn a = a / b;\\n//}\\n//\\n//#define MAX_MOD_N 1024000\\n//\\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\\n//void init(const int amax = MAX_MOD_N) {\\n//\\tfact[0] = Mod(1); factinv[0] = 1;\\n//\\tfor (int i = 0; i < amax - 1; ++i) {\\n//\\t\\tfact[i + 1] = fact[i] * Mod(i + 1);\\n//\\t\\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\\n//\\t}\\n//}\\n//Mod comb(const int a, const int b) {\\n//\\treturn fact[a] * factinv[b] * factinv[a - b];\\n//}\\n//\\n//vector<int>primes;\\n//void hurui(const int amax=3500) {\\n//\\tstatic bool flag = false;\\n//\\tif (flag)return;\\n//\\tvector<int>sos;\\n//\\tsos = vector<int>(amax + 1, true);\\n//\\tsos[0] = false; sos[1] = false;\\n//\\tfor (int i = 2; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\\n//\\t\\t}\\n//\\t}\\n//\\tfor (int i = 0; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tprimes.push_back(i);\\n//\\t\\t}\\n//\\t}\\n//\\tflag = true;\\n//}\\n//\\n//\\n//struct query {\\n//\\tint u;\\n//\\tint v;\\n//\\tmap<int,int>mp;\\n//};\\n//\\n//map<int, int>mk_mp(const int a) {\\n//\\tint rest(a);\\n//\\tmap<int,int>as;\\n//\\tfor (auto pr : primes) {\\n//\\t\\twhile (rest%pr == 0) {\\n//\\t\\t\\tas[pr]++;\\n//\\t\\t\\trest /= pr;\\n//\\t\\t}\\n//\\t}\\n//\\tif (rest!=1)as[rest]++;\\n//\\treturn as;\\n//}\\n//\\n//#define Seg_Max_N (1<<18) \\n//\\n//class Tree {\\n//public:\\n//\\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\\n//\\t\\tT.resize(V);\\n//\\t\\tfor (int i = 0; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i].resize(V);\\n//\\t\\t}\\n//\\t\\tdepth.resize(V);\\n//\\t}\\n//\\t// uとvをつなぐ\\n//\\t// lcaを求めることが主目的なので無向グラフとしている\\n//\\tvoid unite(int u, int v) {\\n//\\t\\tT[u].push_back(v);\\n//\\t\\tT[v].push_back(u);\\n//\\t}\\n//\\tvoid unite(vector<vector<int>>&e) {\\n//\\t\\tT = e;\\n//\\t}\\n//\\t// initする\\n//\\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\\n//\\tvoid init() {\\n//\\t\\tdfs(root, 0, 0);\\n//\\t\\tint id = 0;\\n//\\t\\tgetid(root, 0, id);\\n//\\t}\\n//\\t// uとvのlcaを求める\\n//\\tint lca(int u, int v) const {\\n//\\t\\tif (depth[u] > depth[v]) swap(u, v);\\n//\\t\\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\\t// uとvの距離を求める\\n//\\t// edgeを定義しないといけない時はこれじゃダメ\\n//\\tint dist(int u, int v) const {\\n//\\t\\tint p = lca(u, v);\\n//\\t\\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\\n//\\t}\\n//\\tint dfs(int v, int p, int d) {\\n//\\t\\tparent[0][v] = p;\\n//\\t\\tdepth[v] = d;\\n//\\t\\tcnum[v] = 0;\\n//\\t\\tfor (int i = 1; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\\n//\\t\\t}\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) cnum[v] += dfs(next, v, d + 1);\\n//\\t\\t}\\n//\\t\\treturn cnum[v] + 1;\\n//\\t}\\n//\\n//\\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) dfs2(next, v, doubles, nums);\\n//\\t\\t}\\n//\\t\\tdoubles[0][v] = nums[v];\\n//\\t\\tfor (int j = 1; j < MAXLOGV; ++j) {\\n//\\t\\t\\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\\n//\\t\\t}\\n//\\t\\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\\n//\\t\\t\\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\\n//\\t\\t}\\n//\\t}\\n//\\t//ここでは親から距離2^iの部分木の最小値を求めている\\n//\\tvector<vector<int>>get_doubles(const vector<int>&nums) {\\n//\\t\\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\\n//\\t\\tdfs2(root, -1, doubles, nums);\\n//\\t\\treturn doubles;\\n//\\t}\\n//\\n//\\tvoid getid(const int v, const int p, int &nplace) {\\n//\\t\\tplace[v] = nplace;\\n//\\t\\tid[nplace] = v;\\n//\\t\\tnplace++;\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) getid(next, v, nplace);\\n//\\t\\t}\\n//\\t}\\n//\\tstatic const int MAXLOGV = 25;\\n//\\t// グラフの隣接リスト表現\\n//\\tvector<vector<int> > T;\\n//\\t// 頂点の数\\n//\\tint V;\\n//\\t// 根ノードの番号\\n//\\tint root;\\n//\\n//\\t// 親ノード\\n//\\tvector<int> parent[MAXLOGV];\\n//\\t// 根からの深さ\\n//\\tvector<int> depth;\\n//\\n//\\t//子の数\\n//\\tvector<int>cnum;\\n//\\n//\\t//変換\\n//\\tvector<int>place;\\n//\\tvector<int>id;\\n//\\n//};\\n//\\n//vector<int>pas;\\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\\n//\\ttos[now]=id;\\n//\\tlrs[tos[now]].first=id++;\\n//\\tfor (auto e : edges[now]) {\\n//\\t\\tif (e == from) {\\n//\\t\\t\\tpas[now] = from;\\n//\\t\\t\\tcontinue;\\n//\\t\\t}\\n//\\t\\tadfs(lrs,tos,edges,e,now,id);\\n//\\t}\\n//\\tlrs[tos[now]].second=id;\\n//}\\n//\\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\\n//\\tpas.resize(tos.size());pas[0]=-1;\\n//\\tvector<pair<int,int>>lrs(edges.size());\\n//\\tint id=0;\\n//\\tadfs(lrs,tos,edges,0,-1,id);\\n//\\treturn lrs;\\n//}\\n\\n\\n\\n#define _GLIBCXX_DEBUG\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(auto i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\n\\n\\n//const int INF = 2147483647;\\n//const long long int L_INF = 9223372036854775807;\\n\\ntypedef int Weight;\\n\\nconst Weight INF = 1e9;\\nconst Weight ZERO = 0;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tint id;\\n\\tEdge(int src_, int dst_, Weight weight_, const int id_) :\\n\\t\\tsrc(src_), dst(dst_), weight(weight_), id(id_) { }\\n\\tEdge(int src, int dst, Weight weight) :\\n\\t\\tsrc(src), dst(dst), weight(weight) { }\\n\\tEdge() :src(0), dst(0), weight(0) {\\n\\n\\t}\\n};\\nbool operator < (const Edge &e, const Edge &f) {\\n\\treturn e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\\n\\te.src != f.src ? e.src < f.src : e.dst < f.dst;\\n}\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\ntypedef vector<Weight> Array;\\ntypedef vector<Array> Matrix;\\n#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\\n\\nint flow_try(const Graph&g, int s, int t, Matrix&flow, Matrix&capacity) {\\n\\tWeight total = ZERO;\\n\\twhile (1) {\\n\\t\\tqueue<int> Q; Q.push(s);\\n\\t\\tvector<int> prev(g.size(), -1); prev[s] = s;\\n\\t\\twhile (!Q.empty() && prev[t] < 0) {\\n\\t\\t\\tint u = Q.front(); Q.pop();\\n\\t\\t\\tFOR(e, g[u]) if (prev[e->dst] < 0 && RESIDUE(u, e->dst) > ZERO) {\\n\\t\\t\\t\\tprev[e->dst] = u;\\n\\t\\t\\t\\tQ.push(e->dst);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (prev[t] < 0)break; // prev[x] == -1 <=> t-side\\n\\t\\tWeight inc = INF;\\n\\t\\tfor (int j = t; prev[j] != j; j = prev[j]) {\\n\\t\\t\\tauto v(RESIDUE(prev[j], j));\\n\\t\\t\\tif (inc > v) {\\n\\t\\t\\t\\tinc = v;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int j = t; prev[j] != j; j = prev[j])\\n\\t\\t\\tflow[prev[j]][j] = flow[prev[j]][j] + inc, flow[j][prev[j]] = flow[j][prev[j]] - inc;;\\n\\t\\ttotal += inc;\\n\\t}\\n\\treturn total;\\n}\\n\\n//流量0の逆辺も張らないと正しく求まらないので注意\\nWeight maximumFlow(const Graph &ag, int s, int t) {\\n\\n\\tGraph g(ag);\\n\\tfor (int i = 0; i < ag.size(); ++i) {\\n\\t\\tfor (int j = 0; j < ag[i].size(); ++j) {\\n\\t\\t\\tint d = ag[i][j].dst;\\n\\t\\t\\tint s = ag[i][j].src;\\n\\n\\t\\t\\tbool ok = false;\\n\\t\\t\\tfor (int k = 0; k < ag[d].size(); ++k) {\\n\\t\\t\\t\\tif (ag[d][k].dst == s) {\\n\\t\\t\\t\\t\\tok = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!ok) {\\n\\t\\t\\t\\tg[d].push_back(Edge(d, s, ZERO));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint n = g.size();\\n\\tMatrix flow(n, Array(n,ZERO)), capacity(n, Array(n,ZERO));\\n\\tREP(u, n) FOR(e, g[u]) capacity[e->src][e->dst] =capacity[e->src][e->dst]+ e->weight;\\n\\n\\n\\tWeight total = flow_try(g,s,t,flow,capacity);\\n\\n\\tvector<int>ss(g.size()),ts(g.size());\\n\\n\\tfor (int at = 0; at < g.size(); ++at) {\\n\\t\\tint as=0;\\n\\t\\tif(as==at)ss[at]=1e9;\\n\\t\\telse {\\n\\t\\t\\tMatrix aflow(flow);\\n\\t\\t\\tMatrix acap(capacity);\\n\\t\\t\\tss[at]=flow_try(g,as,at,aflow,acap);\\n\\t\\t}\\n\\t}\\n\\tfor (int as = 0; as < g.size(); ++as) {\\n\\t\\tint at = g.size()-1;\\n\\t\\tif (as == at)ts[as]=1e9;\\n\\t\\telse {\\n\\t\\t\\tMatrix aflow(flow);\\n\\t\\t\\tMatrix acap(capacity);\\n\\t\\t\\tts[as] = flow_try(g, as, at, aflow, acap);\\n\\t\\t}\\n\\t}\\n\\n\\tint plus=0;\\n\\tfor (int i = 0; i < g.size(); ++i) {\\n\\t\\tfor (auto e : g[i]) {\\n\\t\\t\\tint nplus=min(ss[e.src],ts[e.dst]);\\n\\t\\t\\t\\n\\t\\t\\tplus=max(plus,nplus);\\n\\t\\t}\\n\\t}\\n\\n\\treturn total+plus;\\n}\\n\\n\\n\\nint main()\\n{\\n\\tint K,N,M;cin>>K>>N>>M;\\n\\n\\tconst int start=0;\\n\\tconst int gensen=1;\\n\\tconst int connection=gensen+K;\\n\\tconst int goal=connection+N;\\n\\n\\tGraph g(goal+1);\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint a,b,c;\\n\\t\\tcin>>a>>b>>c;\\n\\t\\tg[a].push_back(Edge(a,b,c));\\n\\t\\tg[b].push_back(Edge(b,a,c));\\n\\t}\\n\\n\\tfor (int i = 0; i < K; ++i) {\\n\\t\\tbool flag=false;\\n\\t\\tfor (auto&e : g[goal]) {\\n\\t\\t\\tif (e.dst == gensen + i) {\\n\\t\\t\\t\\te.weight=1e9;\\n\\t\\t\\t\\tflag=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto&e : g[gensen+i]) {\\n\\t\\t\\tif (e.dst == goal) {\\n\\t\\t\\t\\te.weight = 1e9;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!flag) {\\n\\n\\t\\t\\tg[goal].push_back(Edge(goal, gensen + i, 1e9));\\n\\t\\t\\tg[gensen + i].push_back(Edge(gensen + i, goal, 1e9));\\n\\t\\t}\\n\\t}\\n\\n\\tauto f=maximumFlow(g,start,goal);\\n\\n\\tif (f >= 1e9-1e8) {\\n\\t\\tcout<<\\\"overfuro\\\"<<endl;\\n\\t}\\n\\telse {\\n\\n\\n\\t\\tcout << f << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.2045,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2803_2901595\",\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 MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 120\\n\\nenum Type{\\n\\tBASE,\\n\\tTMP,\\n};\\n\\n\\n//辺を表す構造体(行先、容量、逆辺のインデックス)\\nstruct Edge{\\n\\tEdge(int arg_to,int arg_capacity,int arg_rev_index){\\n\\t\\tto = arg_to;\\n\\t\\tcapacity = arg_capacity;\\n\\t\\trev_index = arg_rev_index;\\n\\t}\\n\\tint to,capacity,rev_index;\\n};\\n\\nint V;\\nint K,N,E;\\nvector<Edge> G[2][NUM]; //グラフの隣接リスト表現\\nint dist[2][NUM]; //sourceからの距離\\nint cheked_index[2][NUM]; //どこまで調べ終わったか\\nint table[NUM];\\nbool can_visit[NUM];\\n\\n//fromからtoへ向かう容量capacityの辺をグラフに追加する\\nvoid add_edge(int from,int to,int capacity){\\n\\tG[BASE][from].push_back(Edge(to,capacity,G[BASE][to].size())); //★逆辺はそれぞれ張る★\\n\\tG[BASE][to].push_back(Edge(from,0,G[BASE][from].size()-1)); //逆辺の、初期容量は0\\n}\\n\\n//sourceからの最短距離をBFSで計算する\\nvoid bfs(Type type,int source){\\n\\tfor(int i = 0; i < V; i++)dist[type][i] = -1;\\n\\tqueue<int> Q;\\n\\tdist[type][source] = 0;\\n\\tQ.push(source);\\n\\n\\twhile(!Q.empty()){\\n\\t\\tint node_id = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tfor(int i = 0; i < G[type][node_id].size(); i++){\\n\\t\\t\\tEdge &e = G[type][node_id][i];\\n\\t\\t\\tif(e.capacity > 0 && dist[type][e.to] < 0){ //辺の容量が正で、かつエッジの行先に未訪問の場合\\n\\t\\t\\t\\tdist[type][e.to] = dist[type][node_id]+1;\\n\\t\\t\\t\\tQ.push(e.to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//増加パスをDFSで探す\\nint dfs(Type type,int node_id,int sink,int flow){\\n\\tif(node_id == sink)return flow; //終点についたらflowをreturn\\n\\n\\tfor(int &i = cheked_index[type][node_id]; i < G[type][node_id].size(); i++){ //node_idから出ているエッジを調査\\n\\t\\tEdge &e = G[type][node_id][i];\\n\\t\\tif(e.capacity > 0 && dist[type][node_id] < dist[type][e.to]){ //流せる余裕があり、かつsourceからの距離が増加する方法である場合\\n\\t\\t\\tint tmp_flow = dfs(type,e.to,sink,min(flow,e.capacity)); //流せるだけ流す\\n\\t\\t\\tif(tmp_flow > 0){ //流せた場合\\n\\t\\t\\t\\te.capacity -= tmp_flow; //流した分、エッジの容量を削減する\\n\\t\\t\\t\\tG[type][e.to][e.rev_index].capacity += tmp_flow; //逆辺の容量を、流した分だけ増加させる\\n\\t\\t\\t\\treturn tmp_flow;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\n\\n//sourceからsinkへの最大流を求める\\nint max_flow(Type type,int source,int sink){ //source:始点 sink:終点\\n\\tint flow = 0,add;\\n\\twhile(true){ //増加パスが存在する限り、流量を追加し続ける\\n\\t\\tbfs(type,source);\\n\\t\\tif(dist[type][sink] < 0)break; //sourceからsinkへと辿り着く残余グラフがない、つまり増加パスが無くなった場合、break\\n\\t\\tfor(int i = 0; i < V; i++)cheked_index[type][i] = 0;\\n\\t\\twhile((add = dfs(type,source,sink,BIG_NUM)) > 0){ //増加パスが見つかる間、加算\\n\\t\\t\\tflow += add;\\n\\t\\t}\\n\\t}\\n\\treturn flow;\\n}\\n\\n//sourceから行けるノードを探す\\nvoid visit_check(int node_id){\\n\\tcan_visit[node_id] = true;\\n\\n\\tfor(int i = 0; i < G[BASE][node_id].size(); i++){\\n\\t\\tif(can_visit[G[BASE][node_id][i].to] == true || G[BASE][node_id][i].capacity == 0)continue;\\n\\t\\tvisit_check(G[BASE][node_id][i].to);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d\\\",&K,&N,&E);\\n\\n\\tint from,to,capacity;\\n\\tfor(int loop = 0; loop < E; loop++){\\n\\t\\tscanf(\\\"%d %d %d\\\",&from,&to,&capacity);\\n\\t\\tadd_edge(from,to,capacity);\\n\\t\\tadd_edge(to,from,capacity);\\n\\t}\\n\\n\\tint source = K+N+1,sink = 0; //浴槽をsinkとする\\n\\n\\tfor(int i = 1; i <= K; i++){\\n\\t\\tadd_edge(source,i,BIG_NUM);\\n\\t}\\n\\n\\t//一回流す\\n\\tV = K+N+2;\\n\\tint base_flow = max_flow(BASE,source,sink);\\n\\n\\t//sourceから行けるノードを探す\\n\\tfor(int i = 0; i < V; i++)can_visit[i] = false;\\n\\tvisit_check(source);\\n\\n\\tint ans = 0;\\n\\n\\t//残余グラフ上でボトルネックを走査(ボトルネック辺はcapacityが0になっているはず)\\n\\t//ループの際、sourceとsinkは除く\\n\\ttable[source] = BIG_NUM;\\n\\ttable[sink] = BIG_NUM;\\n\\tfor(int i = 1; i < V-1; i++){\\n\\t\\tfor(int k = 0; k < NUM; k++){\\n\\t\\t\\tG[TMP][k] = G[BASE][k];\\n\\t\\t}\\n\\t\\tif(can_visit[i]){\\n\\t\\t\\ttable[i] = max_flow(TMP,source,i);\\n\\t\\t}else{\\n\\t\\t\\ttable[i] = max_flow(TMP,i,sink);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\t\\tif(!can_visit[i])continue;\\n\\t\\tfor(int k = 0; k < G[BASE][i].size(); k++){\\n\\t\\t\\tif(can_visit[G[BASE][i][k].to])continue;\\n\\t\\t\\tans = max(ans,min(table[i],table[G[BASE][i][k].to]));\\n\\t\\t}\\n\\t}\\n\\n\\tans += base_flow;\\n\\n\\tif(ans >= BIG_NUM){\\n\\t\\tprintf(\\\"overfuro\\\\n\\\");\\n\\t}else{\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.1622,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2803_2901593\",\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 MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 120\\n\\nenum Type{\\n\\tBASE,\\n\\tTMP,\\n};\\n\\n\\n//辺を表す構造体(行先、容量、逆辺のインデックス)\\nstruct Edge{\\n\\tEdge(int arg_to,int arg_capacity,int arg_rev_index){\\n\\t\\tto = arg_to;\\n\\t\\tcapacity = arg_capacity;\\n\\t\\trev_index = arg_rev_index;\\n\\t}\\n\\tint to,capacity,rev_index;\\n};\\n\\nint V;\\nint K,N,E;\\nvector<Edge> G[2][NUM]; //グラフの隣接リスト表現\\nint dist[2][NUM]; //sourceからの距離\\nint cheked_index[2][NUM]; //どこまで調べ終わったか\\nint table[NUM];\\nbool can_visit[NUM];\\n\\n//fromからtoへ向かう容量capacityの辺をグラフに追加する\\nvoid add_edge(int from,int to,int capacity){\\n\\tG[BASE][from].push_back(Edge(to,capacity,G[BASE][to].size())); //★逆辺はそれぞれ張る★\\n\\tG[BASE][to].push_back(Edge(from,0,G[BASE][from].size()-1)); //逆辺の、初期容量は0\\n}\\n\\n//sourceからの最短距離をBFSで計算する\\nvoid bfs(Type type,int source){\\n\\tfor(int i = 0; i < V; i++)dist[type][i] = -1;\\n\\tqueue<int> Q;\\n\\tdist[type][source] = 0;\\n\\tQ.push(source);\\n\\n\\tint debug = 0;\\n\\twhile(!Q.empty()){\\n\\t\\tint node_id = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tdebug++;\\n\\t\\tif(debug == 100){\\n\\t\\t\\tprintf(\\\"LOOP!!\\\\n\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < G[type][node_id].size(); i++){\\n\\t\\t\\tEdge &e = G[type][node_id][i];\\n\\t\\t\\tif(e.capacity > 0 && dist[type][e.to] < 0){ //辺の容量が正で、かつエッジの行先に未訪問の場合\\n\\t\\t\\t\\tdist[type][e.to] = dist[type][node_id]+1;\\n\\t\\t\\t\\tQ.push(e.to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//増加パスをDFSで探す\\nint dfs(Type type,int node_id,int sink,int flow){\\n\\tif(node_id == sink)return flow; //終点についたらflowをreturn\\n\\n\\tfor(int &i = cheked_index[type][node_id]; i < G[type][node_id].size(); i++){ //node_idから出ているエッジを調査\\n\\t\\tEdge &e = G[type][node_id][i];\\n\\t\\tif(e.capacity > 0 && dist[type][node_id] < dist[type][e.to]){ //流せる余裕があり、かつsourceからの距離が増加する方法である場合\\n\\t\\t\\tint tmp_flow = dfs(type,e.to,sink,min(flow,e.capacity)); //流せるだけ流す\\n\\t\\t\\tif(tmp_flow > 0){ //流せた場合\\n\\t\\t\\t\\te.capacity -= tmp_flow; //流した分、エッジの容量を削減する\\n\\t\\t\\t\\tG[type][e.to][e.rev_index].capacity += tmp_flow; //逆辺の容量を、流した分だけ増加させる\\n\\t\\t\\t\\treturn tmp_flow;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\n\\n//sourceからsinkへの最大流を求める\\nint max_flow(Type type,int source,int sink){ //source:始点 sink:終点\\n\\tint flow = 0,add;\\n\\twhile(true){ //増加パスが存在する限り、流量を追加し続ける\\n\\t\\tbfs(type,source);\\n\\t\\tif(dist[type][sink] < 0)break; //sourceからsinkへと辿り着く残余グラフがない、つまり増加パスが無くなった場合、break\\n\\t\\tfor(int i = 0; i < V; i++)cheked_index[type][i] = 0;\\n\\t\\twhile((add = dfs(type,source,sink,BIG_NUM)) > 0){ //増加パスが見つかる間、加算\\n\\t\\t\\tflow += add;\\n\\t\\t}\\n\\t}\\n\\treturn flow;\\n}\\n\\n//sourceから行けるノードを探す\\nvoid visit_check(int node_id){\\n\\tcan_visit[node_id] = true;\\n\\n\\tfor(int i = 0; i < G[BASE][node_id].size(); i++){\\n\\t\\tif(can_visit[G[BASE][node_id][i].to] == true || G[BASE][node_id][i].capacity == 0)continue;\\n\\t\\tvisit_check(G[BASE][node_id][i].to);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d\\\",&K,&N,&E);\\n\\n\\tint from,to,capacity;\\n\\tfor(int loop = 0; loop < E; loop++){\\n\\t\\tscanf(\\\"%d %d %d\\\",&from,&to,&capacity);\\n\\t\\tadd_edge(from,to,capacity);\\n\\t\\tadd_edge(to,from,capacity);\\n\\t}\\n\\n\\tint source = K+N+1,sink = 0; //浴槽をsinkとする\\n\\n\\tfor(int i = 1; i <= K; i++){\\n\\t\\tadd_edge(source,i,BIG_NUM);\\n\\t}\\n\\n\\t//一回流す\\n\\tV = K+N+2;\\n\\tint base_flow = max_flow(BASE,source,sink);\\n\\n\\t//sourceから行けるノードを探す\\n\\tfor(int i = 0; i < V; i++)can_visit[i] = false;\\n\\tvisit_check(source);\\n\\n\\tint ans = 0;\\n\\n\\t//残余グラフ上でボトルネックを走査(ボトルネック辺はcapacityが0になっているはず)\\n\\t//ループの際、sourceとsinkは除く\\n\\ttable[source] = BIG_NUM;\\n\\ttable[sink] = BIG_NUM;\\n\\tfor(int i = 1; i < V-1; i++){\\n\\t\\tfor(int k = 0; k < NUM; k++){\\n\\t\\t\\tG[TMP][k] = G[BASE][k];\\n\\t\\t}\\n\\t\\tif(can_visit[i]){\\n\\t\\t\\ttable[i] = max_flow(TMP,source,i);\\n\\t\\t}else{\\n\\t\\t\\ttable[i] = max_flow(TMP,i,sink);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\t\\tif(!can_visit[i])continue;\\n\\t\\tfor(int k = 0; k < G[BASE][i].size(); k++){\\n\\t\\t\\tif(can_visit[G[BASE][i][k].to])continue;\\n\\t\\t\\tans = max(ans,min(table[i],table[G[BASE][i][k].to]));\\n\\t\\t}\\n\\t}\\n\\n\\tans += base_flow;\\n\\n\\tif(ans >= BIG_NUM){\\n\\t\\tprintf(\\\"overfuro\\\\n\\\");\\n\\t}else{\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.125,\n \"time_ms\": 30,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.1113,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2803_2775523\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define rep(i,n) FOR(i,0,n)\\n#define pb emplace_back\\ntypedef long long ll;\\ntypedef pair<ll,ll> pint;\\n\\nconst int INF=1000100010;\\nconst int MAX_N=102;\\nstruct edge{\\n int to,cap,rev;\\n edge(int to,int cap,int rev):\\n to(to),cap(cap),rev(rev){}\\n };\\n\\nvector<edge> g[MAX_N];\\nint dist[MAX_N];\\nint used[MAX_N];\\nvoid add_edge(int src,int dst,int cap){\\n g[src].pb(edge(dst,cap,g[dst].size()));\\n g[dst].pb(edge(src,cap,g[src].size()-1));\\n}\\nvoid bfs(int s){\\n memset(dist,-1,sizeof(dist));\\n queue<int> q;\\n dist[s]=0;\\n q.push(s);\\n while(!q.empty()){\\n int v=q.front();q.pop();\\n rep(i,g[v].size()){\\n edge &e=g[v][i];\\n if(e.cap>0&&dist[e.to]<0){\\n dist[e.to]=dist[v]+1;\\n q.push(e.to);\\n }\\n }\\n }\\n}\\nint dfs(int v,int t,int f){\\n if(v==t) return f;\\n used[v]=true;\\n rep(i,g[v].size()){\\n edge &e=g[v][i];\\n if(e.cap>0&&dist[v]<dist[e.to]){\\n int d=dfs(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}\\nint max_flow(int s,int t){\\n int flow=0;\\n while(1){\\n bfs(s);\\n if(dist[t]<0) return flow;\\n memset(used,0,sizeof(used));\\n int f;\\n while((f=dfs(s,t,INF))>0){\\n flow+=f;\\n }\\n }\\n}\\nvector<edge> g2[MAX_N];\\nint main(){\\n int k,n,m;\\n int a,b,c;\\n cin>>k>>n>>m;\\n bool flag=false;\\n rep(i,m){\\n cin>>a>>b>>c;\\n add_edge(a,b,c);\\n if(a==0&&b<=k||b==0&&a<=k) flag=true;\\n }\\n if(flag){\\n cout<<\\\"overfuro\\\"<<endl;\\n return 0;\\n }\\n int s=n+k+1;\\n FOR(i,1,k+1){\\n add_edge(s,i,INF);\\n }\\n int cur=max_flow(s,0);\\n //cout<<cur<<endl;\\n int mx=0;\\n rep(i,s+1) g2[i]=g[i];\\n rep(i,s+1){\\n rep(j,g[i].size()){\\n if(g[i][j].cap==0){\\n g[i][j].cap=INF;\\n mx=max(mx,max_flow(s,0));\\n rep(l,s+1) g[l]=g2[l];\\n }\\n }\\n }\\n if(cur+mx>=INF) cout<<\\\"overfuro\\\"<<endl;\\n else cout<<cur+mx<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.155,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2803_2388807\",\n \"code_snippet\": \"#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\\nusing pi = pair<int,int>;\\n\\n// (?????????,??????,??????)\\nstruct edge{ int to,cap,rev; };\\n\\nconst int MAX_V = 111; // TODO:initialize\\nconst int F_INF = 99999999; // TODO:initialize\\nvector<edge> G[MAX_V],z[MAX_V];\\nint level[MAX_V]; // s??????????????¢\\nint iter[MAX_V]; // ???????????§??????????????£??????\\n\\nvoid add_edge(int from, int to, int cap){\\n G[from].pb({to,cap,(int)G[to].size()});\\n G[to].pb({from,cap,(int)G[from].size()-1});\\n}\\n\\nvoid dinic_bfs(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();\\n que.pop();\\n rep(i,G[v].size()){\\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\\n// ?¢?????????????dfs??§??¢???\\nint dinic_dfs(int v, int t, int f){\\n if(v==t) return f;\\n for(int &i=iter[v]; i<G[v].size(); ++i){\\n edge &e=G[v][i];\\n if(e.cap>0 && level[v]<level[e.to]){\\n int d = dinic_dfs(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\\n// s??????t???????????§???\\nint max_flow(int s, int t){\\n int flow = 0;\\n while(1){\\n dinic_bfs(s);\\n if(level[t]<0) return flow;\\n memset(iter,0,sizeof(iter));\\n int f;\\n while((f=dinic_dfs(s,t,F_INF))>0) flow+=f;\\n }\\n}\\n\\nconst int INF=5555555;\\nint ff[MAX_V][2]={};\\n\\nvoid solve()\\n{\\n bool direct = false;\\n int K,N,M;\\n cin >>K >>N >>M;\\n vector<int> a(M),b(M),c(M);\\n rep(i,M)\\n {\\n cin >>a[i] >>b[i] >>c[i];\\n if(a[i]>b[i]) swap(a[i],b[i]);\\n add_edge(a[i],b[i],c[i]);\\n direct|=(a[i]==0 && 1<=b[i] && b[i]<=K);\\n }\\n\\n if(direct)\\n {\\n cout << \\\"overfuro\\\" << endl;\\n return;\\n }\\n\\n int S=K+N+1,T=0;\\n for(int i=1; i<=K; ++i) add_edge(S,i,INF);\\n\\n int F = max_flow(S,T);\\n\\n rep(i,MAX_V) z[i]=G[i];\\n\\n ff[S][0]=INF;\\n rep(i,S)\\n {\\n rep(j,MAX_V) G[j]=z[j];\\n ff[i][0] = max_flow(S,i);\\n }\\n ff[0][1]=INF;\\n for(int i=1; i<=S; ++i)\\n {\\n rep(j,MAX_V) G[j]=z[j];\\n ff[i][1] = max_flow(i,T);\\n }\\n\\n int add = 0;\\n rep(i,M)\\n {\\n int u=a[i], v=b[i];\\n add = max(add,min(ff[u][0],ff[v][1]));\\n add = max(add,min(ff[v][0],ff[u][1]));\\n }\\n\\n cout << F+add << endl;\\n}\\n\\nint main()\\n{\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3324,\n \"score_of_the_acc\": -0.05,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2803_2388798\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__\\\",\\\", __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 100000000\\n\\ntemplate<typename T>\\nclass MaximumFlow{\\npublic:\\n struct edge{int to; T cap; int rev;};\\n vector<vector<edge> > Graph;\\n vector<int> level, iter; //s??????????????¢,???????????§????????????\\n void bfs(int s){\\n fill(all(level), -1);\\n queue<int> q;\\n level[s]=0;\\n q.push(s);\\n while(!q.empty()){\\n int v=q.front(); q.pop();\\n for(auto e : Graph[v]){\\n if(e.cap>0 && level[e.to]<0){\\n level[e.to] = level[v]+1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n T dfs(int v, int t, T f){\\n if(v==t) return f;\\n for(int &i=iter[v]; i<(int)Graph[v].size(); i++){\\n auto &e = Graph[v][i];\\n if(e.cap>0 && level[v]<level[e.to]){\\n T d = dfs(e.to, t, min(f, 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 MaximumFlow(int n){\\n Graph = vector<vector<edge> >(n, vector<edge>());\\n level = vector<int>(n);\\n iter = vector<int>(n);\\n }\\n T max_flow(int s, int t){\\n T flow=0;\\n while(true){\\n bfs(s);\\n if(level[t] < 0) break;\\n fill(all(iter), 0);\\n T f;\\n while( (f=dfs(s,t,INF)) > 0){\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n void add_edge(int from, int to, T cap){\\n int tos = Graph[to].size(), froms = Graph[from].size();\\n Graph[from].pb(((edge){to, cap, tos}));\\n Graph[to].pb(((edge){from, cap, froms}));\\n }\\n}; // END class MaximumFlow\\n\\nint main(){\\n int k,n,m;\\n cin>>k>>n>>m;\\n MaximumFlow<int> flow(k+n+2);\\n // 0: sink\\n // 1-k: gensen\\n // k+1 - k+n: vertex\\n // k+n+1: source\\n rep(i,k) flow.add_edge(k+n+1, i+1, INF);\\n\\n bool ov = false;\\n rep(i,m){\\n int a,b,c;\\n cin>>a>>b>>c;\\n if(1<=a && a<=k && 1<=b && b<=k) continue;\\n flow.add_edge(a, b, c);\\n if(a*b==0 && ((1<=a && a<=k) || (1<=b && b<=k)) ) ov = true;\\n }\\n if(ov){ cout << \\\"overfuro\\\" << endl; return 0; }\\n\\n int f = flow.max_flow(k+n+1, 0);\\n\\n // source??????bfs??????????????????????£????????????¢???\\n auto g = flow.Graph;\\n vector<int> u,v;\\n queue<int> q;\\n vector<bool> visited(k+n+2);\\n q.push(k+n+1);\\n visited[k+n+1]=true;\\n while(!q.empty()){\\n int d = q.front(); q.pop();\\n for(auto to : g[d]) if(!visited[to.to]){\\n if(to.cap==0){u.pb(d); v.pb(to.to);}\\n else{\\n q.push(to.to);\\n visited[to.to] = true;\\n }\\n }\\n }\\n // dbg(u);\\n // dbg(v);\\n\\n vector<int> uu(k+n+2, -1), vv(k+n+2, -1);\\n int ans = f;\\n rep(i,u.size()){\\n if(uu[u[i]]==-1 || vv[v[i]]==-1){\\n flow.Graph = g;\\n if(uu[u[i]]==-1){\\n if(1<=u[i] && u[i]<=k) uu[u[i]] = INF;\\n else uu[u[i]] = flow.max_flow(k+n+1, u[i]);\\n }\\n if(vv[v[i]]==-1){\\n if(v[i]==0) vv[v[i]] = INF;\\n else vv[v[i]] = flow.max_flow(v[i], 0);\\n }\\n }\\n// dbg(uu[u[i]],vv[v[i]]);\\n ans = max(ans, f + min(uu[u[i]], vv[v[i]]) );\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.0554,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2803_2270650\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a) for(int i=0;i<(int)(a);i++)\\n#define pb push_back\\n#define sz size()\\nusing namespace std;\\ntypedef vector<int> vi;\\n\\nconst int INF = 1e8;\\n\\nstruct edge{\\n int from,to,cap,rev;\\n edge(int a,int b,int c,int e)\\n :from(a),to(b),cap(c),rev(e){}\\n};\\n\\nstruct dinic{\\n int n;\\n vector< vector<edge> > graph;\\n vi level,iter;\\n\\n dinic(int a=0):n(a){graph.resize(a);}\\n\\n void AddEdge(int s,int g,int p){\\n graph[s].pb( edge(s,g,p,graph[g].sz) );\\n graph[g].pb( edge(g,s,0,graph[s].sz-1) );\\n }\\n\\n void bfs(int s){\\n level = vi(n,-1);\\n level[s] = 0;\\n queue<int> q; q.push(s);\\n while(q.sz){\\n int v = q.front(); q.pop();\\n for(edge e: graph[v]){\\n\\tif(e.cap > 0 && level[e.to] < 0){\\n\\t level[e.to] = level[v] + 1;\\n\\t q.push(e.to);\\n\\t}\\n }\\n }\\n }\\n \\n int dfs(int v, int t, int f){\\n if(v==t)return f;\\n for(int &i = iter[v];i<(int)graph[v].sz;i++){\\n edge &e = graph[v][i];\\n if(e.cap > 0 && level[v] < level[e.to]){\\n\\tint d = dfs(e.to,t,min(f,e.cap));\\n\\tif(d > 0){\\n\\t e.cap -= d;\\n\\t graph[e.to][e.rev].cap += d;\\n\\t return d;\\n\\t}\\n }\\n }\\n return 0;\\n }\\n \\n int max_flow(int s, int t){\\n int res = 0;\\n for(;;){\\n bfs(s);\\n if(level[t]<0)return res;\\n iter = vi(n,0);\\n int f;\\n while((f=dfs(s,t,INF))>0)res += f;\\n }\\n }\\n};\\n\\nint main(){\\n int k,n,m;\\n cin >> k >> n >> m;\\n\\n int v = k+n+2;\\n dinic mf(v);\\n rep(i,k) mf.AddEdge(v-1,i+1,INF);\\n\\n vector<int> a(m), b(m), c(m);\\n rep(i,m){\\n cin >> a[i] >> b[i] >> c[i];\\n mf.AddEdge(a[i], b[i], c[i]);\\n mf.AddEdge(b[i], a[i], c[i]);\\n }\\n\\n //check overfuro\\n rep(i,m){\\n if(a[i] > b[i]) swap(a[i], b[i]);\\n if( a[i] == 0 && (1 <= b[i] && b[i] <= k) ){\\n cout << \\\"overfuro\\\" << endl;\\n return 0;\\n }\\n }\\n\\n int ans = mf.max_flow(v-1,0);\\n\\n vi from_s(v,-1), to_t(v,-1);\\n rep(i,v){\\n dinic red(v);\\n red.graph = mf.graph;\\n from_s[i] = i==v-1 ? INF : red.max_flow(v-1,i);\\n\\n red.graph = mf.graph;\\n to_t[i] = i==0 ? INF : red.max_flow(i,0);\\n }\\n\\n int over = 0;\\n rep(i,m){\\n over = max( over, min(from_s[a[i]], to_t[b[i]]) );\\n over = max( over, min(from_s[b[i]], to_t[a[i]]) );\\n }\\n\\n cout << ans + over << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -0.1734,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2803_2241164\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX 105\\n#define INF (1e8)\\nint K,N,M;\\nint T;\\n \\nbool g[MAX][MAX];\\nint G[MAX][MAX];\\nint C[MAX];\\nint tmp[MAX][MAX];\\n \\nbool visited[MAX];\\nbool used[MAX];\\n \\nvoid copyA(){\\n for(int i=0;i<MAX;i++)\\n for(int j=0;j<MAX;j++)\\n tmp[i][j]=G[i][j];\\n}\\nvoid copyB(){\\n for(int i=0;i<MAX;i++)\\n for(int j=0;j<MAX;j++)\\n G[i][j]=tmp[i][j];\\n}\\n \\n \\n \\nint dfs(int pos,int ti,int f){\\n if(pos==ti)return f;\\n visited[pos]=true;\\n for(int tt=0;tt<=T;tt++){\\n int to=tt;\\n if(to==-1)to=T;\\n \\n if(visited[to])continue;\\n if(G[pos][to]==0)continue;\\n \\n int k=dfs(to,ti, min(f,G[pos][to]) );\\n if(k>0){\\n G[pos][to]-=k;\\n G[to][pos]+=k;\\n return k;\\n }\\n }\\n return 0;\\n}\\n \\nint maxFlow(int si,int ti){\\n if(si==ti)return INF;\\n int res=0;\\n while(1){\\n memset(visited,false,sizeof(visited));\\n int f=dfs(si,ti,INF);\\n if(f==0)break;\\n res+=f;\\n \\n }\\n return res;\\n}\\nint calcC(int id){\\n if(C[id]!=-1)return C[id];\\n copyA();\\n if(used[id]){\\n C[id]=maxFlow(T,id);\\n }else{\\n C[id]=maxFlow(id,0);\\n }\\n copyB();\\n return C[id];\\n}\\n \\nint main(){\\n memset(C,-1,sizeof(C));\\n \\n bool isOverfuro=false;\\n cin>>K>>N>>M;\\n T=N+K+1;\\n for(int i=0;i<M;i++){\\n int a,b,c;\\n cin>>a>>b>>c;\\n if(a==0&&1<=b&&b<=K){\\n isOverfuro=true;\\n }\\n if(b==0&&1<=a&&a<=K){\\n isOverfuro=true;\\n }\\n G[a][b]+=c;\\n G[b][a]+=c;\\n g[a][b]=true;\\n g[b][a]=true;\\n }\\n \\n for(int i=1;i<=K;i++){\\n G[T][i]=INF;\\n }\\n \\n if(isOverfuro){\\n cout<<\\\"overfuro\\\"<<endl;\\n return 0;\\n }\\n \\n int F=maxFlow(T,0);\\n assert(F>0);\\n \\n memset(visited,false,sizeof(visited));\\n dfs(T,0,INF);\\n \\n for(int i=0;i<=T;i++){\\n used[i]=visited[i];\\n }\\n \\n C[0]=INF;\\n \\n int ans=0;\\n for(int i=0;i<T;i++){\\n for(int j=0;j<T;j++){\\n if(i==j)continue;\\n if(G[i][j]==0&&g[i][j]==true && used[i]==true && used[j]==false ){\\n calcC(i);\\n calcC(j);\\n ans=max(ans, min(C[i],C[j]) );\\n }\\n }\\n }\\n cout<<F+ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1120,\n \"memory_kb\": 3192,\n \"score_of_the_acc\": -1.0054,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2803_2235402\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb push_back\\n#define INF (1e9+1)\\n//#define INF (1LL<<59)\\n \\n \\n#define MAX_V 110\\n \\nstruct edge{int to,cap,rev;};\\n \\nvector<edge> G[MAX_V]; //???°???????????????\\nint level[MAX_V]; //??§???????????????????¢\\nint iter[MAX_V]; //????????????§????????????\\n \\n// from??????to?????????????????????cap????????????°?????????????????????\\nvoid add_edge(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 \\n// s?????????????????????¢???BFS???§??¨??????????\\nvoid bfs(int s){\\n rep(i,MAX_V)level[i]=-1;\\n queue<int> que;\\n level[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v=que.front();que.pop();\\n \\n rep(i,G[v].size()){\\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 \\n//??¢?????????????DFS???§???¢???\\nint dfs(int v,int t,int f){\\n if(v==t)return f;\\n for(int &i=iter[v];i<G[v].size();i++){\\n edge &e=G[v][i];\\n if(e.cap>0&&level[v]<level[e.to]){\\n int d=dfs(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 \\n// s??????t????????????§????????±???????\\nint max_flow(int s,int t){\\n if(s==t)return INF;\\n int flow=0;\\n for(;;){\\n bfs(s);\\n if(level[t]<0)return flow;\\n memset(iter,0,sizeof(iter));\\n int f;\\n while((f=dfs(s,t,INF))>0){\\n flow+=f;\\n }\\n }\\n}\\n \\nvoid isUsedDfs(int s,int t,bool used[MAX_V]){\\n if(s==t)return ;\\n for(auto &e:G[s]){\\n if(!used[e.to]&&e.cap>0){\\n used[e.to]=true;\\n isUsedDfs(e.to,t,used);\\n }\\n }\\n}\\n \\n \\nint main(){\\n int k,n,m;\\n cin>>k>>n>>m;\\n int s = 1+k+n;\\n int t = 0;\\n int v = s+1;\\n \\n rep(i,m){\\n int a,b,c;\\n cin>>a>>b>>c;\\n add_edge(a,b,c);\\n add_edge(b,a,c);\\n }\\n \\n rep(i,k)add_edge(s,i+1,INF);\\n \\n int res = max_flow(s,t);\\n vector<edge> Greg[MAX_V];\\n rep(i,v)Greg[i] = G[i];\\n \\n \\n bool used[MAX_V]={};\\n used[s]=true;\\n isUsedDfs(s,t,used);\\n \\n int ans = 0;\\n vector<int> sflow(v,-1),tflow(v,-1);\\n rep(i,v){\\n for(auto e:Greg[i]){\\n if(used[i]&&!used[e.to]){\\n rep(i,v)G[i] = Greg[i];\\n if(sflow[i]==-1) sflow[i] = max_flow(s,i);\\n if(tflow[e.to]==-1)tflow[e.to] = max_flow(e.to,t);\\n ans = max( ans , res + min(sflow[i],tflow[e.to]) );\\n }\\n }\\n }\\n if(ans>=INF)cout<<\\\"overfuro\\\"<<endl;\\n else cout<<ans<<endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.1586,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2803_2073602\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define INF 1<<28\\n#define MAX_V 105\\n#define ll int\\nstruct edge{\\n ll to,cap,rev;\\n edge(ll to ,ll cap,ll rev):to(to),cap(cap),rev(rev){}\\n};\\nvector<edge> G[MAX_V];\\nvector<edge> G2[MAX_V];\\nbool used[MAX_V];\\nint level[MAX_V];\\nint iter[MAX_V];\\n\\n\\nvoid add_edge(ll from,ll to,ll cap){\\n G[from].push_back(edge(to,cap,G[to].size()));\\n G[to].push_back(edge(from,cap,G[from].size()-1));\\n}\\n\\nvoid bfs(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<G[v].size();i++){\\n edge &e = G[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n\\tlevel[e.to]=level[v]+1;\\n\\tque.push(e.to);\\n }\\n }\\n }\\n}\\n\\nint dfs(int v,int t,int f){\\n if(v==t) return f;\\n for(int &i=iter[v];i<G[v].size();i++){\\n edge &e=G[v][i];\\n if(e.cap>0&&level[v]<level[e.to]){\\n int d = dfs(e.to,t,min(f,e.cap));\\n if(d>0){\\n\\te.cap-=d;\\n\\tG[e.to][e.rev].cap+=d;\\n\\treturn d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nvoid bfs2(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<G2[v].size();i++){\\n edge &e = G2[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n\\tlevel[e.to]=level[v]+1;\\n\\tque.push(e.to);\\n }\\n }\\n }\\n}\\n\\nint dfs2(int v,int t,int f){\\n if(v==t) return f;\\n for(int &i=iter[v];i<G2[v].size();i++){\\n edge &e=G2[v][i];\\n if(e.cap>0&&level[v]<level[e.to]){\\n int d = dfs2(e.to,t,min(f,e.cap));\\n if(d>0){\\n\\te.cap-=d;\\n\\tG2[e.to][e.rev].cap+=d;\\n\\treturn d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint flow=0;\\nint max_flow(int s,int t){\\n for(;;){\\n bfs(s);\\n if(level[t]<0) return flow;\\n memset(iter,0,sizeof(iter));\\n int f;\\n while((f=dfs(s,t,INF))>0){\\n flow+=f;\\n }\\n }\\n}\\n\\nint max_flow2(int s,int t){\\n int flow2=0;\\n for(;;){\\n bfs2(s);\\n if(level[t]<0) return flow2;\\n memset(iter,0,sizeof(iter));\\n int f;\\n while((f=dfs2(s,t,INF))>0){\\n flow2+=f;\\n }\\n }\\n}\\n\\nsigned main(){\\n ll k,n,m,i,j,a,b,c,x,y;\\n cin >> k >> n >> m;\\n ll s=MAX_V-1,t=0;\\n for(i=0;i<m;i++){\\n cin >> a >> b >> c;\\n add_edge(a,b,c);\\n }\\n for(i=1;i<=k;i++){\\n add_edge(s,i,INF);\\n }\\n ll ans=max_flow(s,t);\\n for(i=1;i<MAX_V-1;i++){\\n for(j=0;j<G[i].size();j++){\\n if(G[i][j].cap!=0) continue;\\n for(x=0;x<MAX_V;x++) G2[x]=G[x];\\n G2[i][j].cap=INF;\\n ans=max(ans,flow+max_flow2(s,t));\\n if(ans>=INF) break;\\n }\\n } if(ans>=INF) cout << \\\"overfuro\\\" << endl;\\n else cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -0.0838,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2803_2030843\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <sstream>\\n#include <string>\\n#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repd(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define mod 1000000007\\n#define inf 1000000007\\n#define mp make_pair\\n#define pb push_back\\ntypedef long long ll;\\nusing namespace std;\\ntemplate <typename T>\\ninline void output(T a, int p = 0) {\\n if(p) cout << fixed << setprecision(p) << a << \\\"\\\\n\\\";\\n else cout << a << \\\"\\\\n\\\";\\n}\\n// end of template\\n// goal, capacity, index of reverse edge\\nstruct edge {\\n int to, cap, rev;\\n};\\n\\nstruct ftc{\\n int from, to, cap;\\n};\\n\\n// O(EV^2)\\nclass Dinic{\\npublic:\\n int V;\\n vector<vector<edge>> G;\\n vector<int> L;\\n vector<int> I;\\n vector<int> vis;\\n \\n Dinic(int v){\\n G.resize(v), L.resize(v), I.resize(v), vis.assign(v, 0);\\n V = v;\\n }\\n \\n // add edge\\n void add(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 \\n // label dist from s\\n void bfs(int s){\\n L.assign(V, -1);\\n queue<int> q;\\n L[s] = 0;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n rep(i, G[v].size()){\\n edge &e = G[v][i];\\n if (e.cap > 0 && L[e.to] < 0) {\\n L[e.to] = L[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n \\n // search positive path\\n int dfs(int v, int t, int f){\\n if (v == t) return f;\\n for (int &i = I[v]; i < G[v].size(); i++) {\\n edge &e = G[v][i];\\n if (e.cap > 0 && L[v] < L[e.to]) {\\n int d = dfs(e.to, t, min(f, e.cap));\\n if (d) {\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n \\n // calc max flow\\n int max_flow(int s, int t){\\n int flow = 0;\\n for (;;) {\\n bfs(s);\\n if (L[t] < 0) return flow;\\n I.assign(V, 0);\\n int f;\\n while ((f = dfs(s, t, inf)) > 0) {\\n flow += f;\\n }\\n }\\n }\\n \\n vector<ftc> pipe;\\n vector<int> ofuro;\\n vector<int> neck;\\n void dfs_cut(int s){\\n if(vis[s] == 1){\\n return;\\n }\\n vis[s] = 1;\\n rep(i, G[s].size()){\\n \\n if(G[s][i].cap > 0){\\n dfs_cut(G[s][i].to);\\n }\\n else ofuro.pb(s), neck.pb(G[s][i].to), pipe.pb({s, G[s][i].to, G[s][i].cap});\\n }\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n // source code\\n int K, N, M;\\n cin >> K >> N >> M;\\n \\n Dinic mf(K + N + 2);\\n vector<ftc> E;\\n // source: K + N + 1\\n // sink: 0\\n // spring: 1 ~ K\\n // joint: K + 1 ~ K + N\\n rep(i, K){\\n E.pb({K + N + 1, i + 1, inf});\\n mf.add(K + N + 1, i + 1, inf);\\n }\\n \\n rep(i, M){\\n int a, b, c;\\n cin >> a >> b >> c;\\n if(a != 0 && !(b >= 1 && b <= K)) mf.add(a, b, c), E.pb({a, b, c});\\n if(!(a >= 1 && a <= K) && b != 0) mf.add(b, a, c), E.pb({b, a, c});\\n }\\n auto D = mf;\\n int mfmf = mf.max_flow(K + N + 1, 0);\\n \\n mf.dfs_cut(K + N + 1);\\n \\n int ret = 0;\\n vector<int> source(K + N + 2, 0), sink(K + N + 2, 0);\\n \\n for(int f: mf.ofuro){\\n auto d = D;\\n if(K + N + 1 == f) {\\n source[f] = inf;\\n continue;\\n }\\n source[f] = d.max_flow(K + N + 1, f);\\n }\\n \\n for(int f: mf.neck){\\n auto d = D;\\n if(f == 0) {\\n sink[f] = inf;\\n continue;\\n }\\n sink[f] = d.max_flow(f, 0);\\n }\\n \\n rep(i, D.G.size()){\\n for(edge e: D.G[i]){\\n if(source[i] > 0 && sink[e.to] > 0){\\n// cout << source[i] << \\\", \\\" << sink[e.to] << \\\", \\\" << e.cap << endl;\\n ret = max(ret, mfmf + min(source[i], sink[e.to]) - e.cap);\\n if(min(source[i], sink[e.to]) == inf){\\n output(\\\"overfuro\\\");\\n return 0;\\n }\\n }\\n }\\n }\\n \\n \\n \\n \\n// if(ret >= inf){\\n// output(\\\"overfuro\\\");\\n// }\\n// else{\\n output(ret);\\n// }\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 0.14583333333333334,\n \"time_ms\": 180,\n \"memory_kb\": 3300,\n \"score_of_the_acc\": -0.195,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2803_2029878\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <sstream>\\n#include <string>\\n#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repd(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define mod 1000000007\\n#define inf 1000000007\\n#define mp make_pair\\n#define pb push_back\\ntypedef long long ll;\\nusing namespace std;\\ntemplate <typename T>\\ninline void output(T a, int p = 0) {\\n if(p) cout << fixed << setprecision(p) << a << \\\"\\\\n\\\";\\n else cout << a << \\\"\\\\n\\\";\\n}\\n// end of template\\n// goal, capacity, index of reverse edge\\nstruct edge {\\n int to, cap, rev;\\n};\\n\\nstruct ftc{\\n int from, to, cap;\\n};\\n\\n// O(EV^2)\\nclass Dinic{\\npublic:\\n int V;\\n vector<vector<edge>> G;\\n vector<int> L;\\n vector<int> I;\\n vector<int> vis;\\n \\n Dinic(int v){\\n G.resize(v), L.resize(v), I.resize(v), vis.assign(v, 0);\\n V = v;\\n }\\n \\n // add edge\\n void add(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 \\n // label dist from s\\n void bfs(int s){\\n L.assign(V, -1);\\n queue<int> q;\\n L[s] = 0;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n rep(i, G[v].size()){\\n edge &e = G[v][i];\\n if (e.cap > 0 && L[e.to] < 0) {\\n L[e.to] = L[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n \\n // search positive path\\n int dfs(int v, int t, int f){\\n if (v == t) return f;\\n for (int &i = I[v]; i < G[v].size(); i++) {\\n edge &e = G[v][i];\\n if (e.cap > 0 && L[v] < L[e.to]) {\\n int d = dfs(e.to, t, min(f, e.cap));\\n if (d) {\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n \\n // calc max flow\\n int max_flow(int s, int t){\\n int flow = 0;\\n for (;;) {\\n bfs(s);\\n if (L[t] < 0) return flow;\\n I.assign(V, 0);\\n int f;\\n while ((f = dfs(s, t, inf)) > 0) {\\n flow += f;\\n }\\n }\\n }\\n \\n vector<ftc> pipe;\\n vector<int> ofuro;\\n vector<int> neck;\\n void dfs_cut(int s){\\n if(vis[s] == 1){\\n return;\\n }\\n vis[s] = 1;\\n rep(i, G[s].size()){\\n \\n if(G[s][i].cap > 0){\\n dfs_cut(G[s][i].to);\\n }\\n else ofuro.pb(s), neck.pb(G[s][i].to), pipe.pb({s, G[s][i].to, G[s][i].cap});\\n }\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n // source code\\n int K, N, M;\\n cin >> K >> N >> M;\\n \\n Dinic mf(K + N + 2);\\n vector<ftc> E;\\n // source: K + N + 1\\n // sink: 0\\n // spring: 1 ~ K\\n // joint: K + 1 ~ K + N\\n rep(i, K){\\n E.pb({K + N + 1, i + 1, inf});\\n mf.add(K + N + 1, i + 1, inf);\\n }\\n \\n rep(i, M){\\n int a, b, c;\\n cin >> a >> b >> c;\\n if(a != 0 && !(b >= 1 && b <= K)) mf.add(a, b, c), E.pb({a, b, c});\\n if(!(a >= 1 && a <= K) && b != 0) mf.add(b, a, c), E.pb({b, a, c});\\n }\\n auto D = mf;\\n int mfmf = mf.max_flow(K + N + 1, 0);\\n \\n mf.dfs_cut(K + N + 1);\\n \\n int ret = 0;\\n vector<int> source(K + N + 2, 0), sink(K + N + 2, 0);\\n \\n for(int f: mf.ofuro){\\n auto d = D;\\n if(K + N + 1 == f) {\\n source[f] = inf;\\n continue;\\n }\\n source[f] = d.max_flow(K + N + 1, f);\\n }\\n \\n for(int f: mf.neck){\\n auto d = D;\\n if(f == 0) {\\n sink[f] = inf;\\n continue;\\n }\\n sink[f] = d.max_flow(f, 0);\\n }\\n \\n rep(i, D.G.size()){\\n for(edge e: D.G[i]){\\n if(source[i] && sink[e.to]){\\n// cout << source[i] << \\\", \\\" << sink[e.to] << \\\", \\\" << e.cap << endl;\\n ret = max(ret, mfmf + min(source[i], sink[e.to]) - e.cap);\\n if(min(source[i], sink[e.to]) == inf){\\n output(\\\"overfuro\\\");\\n return 0;\\n }\\n }\\n }\\n }\\n \\n \\n \\n \\n// if(ret >= inf){\\n// output(\\\"overfuro\\\");\\n// }\\n// else{\\n output(ret);\\n// }\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 0.14583333333333334,\n \"time_ms\": 150,\n \"memory_kb\": 3296,\n \"score_of_the_acc\": -0.1667,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2803_2029832\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <sstream>\\n#include <string>\\n#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repd(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define mod 1000000007\\n#define inf 1000000007\\n#define mp make_pair\\n#define pb push_back\\ntypedef long long ll;\\nusing namespace std;\\ntemplate <typename T>\\ninline void output(T a, int p = 0) {\\n if(p) cout << fixed << setprecision(p) << a << \\\"\\\\n\\\";\\n else cout << a << \\\"\\\\n\\\";\\n}\\n// end of template\\n// goal, capacity, index of reverse edge\\nstruct edge {\\n int to, cap, rev;\\n};\\n\\nstruct ftc{\\n int from, to, cap;\\n};\\n\\n// O(EV^2)\\nclass Dinic{\\npublic:\\n int V;\\n vector<vector<edge>> G;\\n vector<int> L;\\n vector<int> I;\\n vector<int> vis;\\n \\n Dinic(int v){\\n G.resize(v), L.resize(v), I.resize(v), vis.assign(v, 0);\\n V = v;\\n }\\n \\n // add edge\\n void add(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 \\n // label dist from s\\n void bfs(int s){\\n L.assign(V, -1);\\n queue<int> q;\\n L[s] = 0;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n rep(i, G[v].size()){\\n edge &e = G[v][i];\\n if (e.cap > 0 && L[e.to] < 0) {\\n L[e.to] = L[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n \\n // search positive path\\n int dfs(int v, int t, int f){\\n if (v == t) return f;\\n for (int &i = I[v]; i < G[v].size(); i++) {\\n edge &e = G[v][i];\\n if (e.cap > 0 && L[v] < L[e.to]) {\\n int d = dfs(e.to, t, min(f, e.cap));\\n if (d) {\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n \\n // calc max flow\\n int max_flow(int s, int t){\\n int flow = 0;\\n for (;;) {\\n bfs(s);\\n if (L[t] < 0) return flow;\\n I.assign(V, 0);\\n int f;\\n while ((f = dfs(s, t, inf)) > 0) {\\n flow += f;\\n }\\n }\\n }\\n \\n vector<ftc> pipe;\\n vector<int> ofuro;\\n vector<int> neck;\\n void dfs_cut(int s){\\n if(vis[s] == 1){\\n return;\\n }\\n vis[s] = 1;\\n rep(i, G[s].size()){\\n \\n if(G[s][i].cap > 0){\\n dfs_cut(G[s][i].to);\\n }\\n else ofuro.pb(s), neck.pb(G[s][i].to), pipe.pb({s, G[s][i].to, G[s][i].cap});\\n }\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n // source code\\n int K, N, M;\\n cin >> K >> N >> M;\\n \\n Dinic mf(K + N + 2);\\n vector<ftc> E;\\n // source: K + N + 1\\n // sink: 0\\n // spring: 1 ~ K\\n // joint: K + 1 ~ K + N\\n rep(i, K){\\n E.pb({K + N + 1, i + 1, inf});\\n mf.add(K + N + 1, i + 1, inf);\\n }\\n \\n rep(i, M){\\n int a, b, c;\\n cin >> a >> b >> c;\\n if(a != 0 && !(b >= 1 && b <= K)) mf.add(a, b, c), E.pb({a, b, c});\\n if(!(a >= 1 && a <= K) && b != 0) mf.add(b, a, c), E.pb({b, a, c});\\n }\\n auto D = mf;\\n int mfmf = mf.max_flow(K + N + 1, 0);\\n \\n mf.dfs_cut(K + N + 1);\\n \\n int ret = 0;\\n vector<int> source(K + N + 2, 0), sink(K + N + 2, 0);\\n \\n for(int f: mf.ofuro){\\n auto d = D;\\n if(K + N + 1 == f) {\\n source[f] = inf;\\n continue;\\n }\\n source[f] = d.max_flow(K + N + 1, f);\\n }\\n \\n for(int f: mf.neck){\\n auto d = D;\\n if(f == 0) {\\n sink[f] = inf;\\n continue;\\n }\\n sink[f] = d.max_flow(f, 0);\\n }\\n \\n rep(i, D.G.size()){\\n for(edge e: D.G[i]){\\n if(source[i] && sink[e.to]){\\n ret = max(ret, mfmf + min(source[i], sink[e.to]) - e.cap);\\n }\\n }\\n }\\n \\n \\n \\n \\n if(ret >= inf){\\n output(\\\"overfuro\\\");\\n }\\n else{\\n output(ret);\\n }\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 0.14583333333333334,\n \"time_ms\": 170,\n \"memory_kb\": 3300,\n \"score_of_the_acc\": -0.186,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2803_2029831\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <sstream>\\n#include <string>\\n#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repd(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define mod 1000000007\\n#define inf 20000000\\n#define mp make_pair\\n#define pb push_back\\ntypedef long long ll;\\nusing namespace std;\\ntemplate <typename T>\\ninline void output(T a, int p = 0) {\\n if(p) cout << fixed << setprecision(p) << a << \\\"\\\\n\\\";\\n else cout << a << \\\"\\\\n\\\";\\n}\\n// end of template\\n// goal, capacity, index of reverse edge\\nstruct edge {\\n int to, cap, rev;\\n};\\n\\nstruct ftc{\\n int from, to, cap;\\n};\\n\\n// O(EV^2)\\nclass Dinic{\\npublic:\\n int V;\\n vector<vector<edge>> G;\\n vector<int> L;\\n vector<int> I;\\n vector<int> vis;\\n \\n Dinic(int v){\\n G.resize(v), L.resize(v), I.resize(v), vis.assign(v, 0);\\n V = v;\\n }\\n \\n // add edge\\n void add(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 \\n // label dist from s\\n void bfs(int s){\\n L.assign(V, -1);\\n queue<int> q;\\n L[s] = 0;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n rep(i, G[v].size()){\\n edge &e = G[v][i];\\n if (e.cap > 0 && L[e.to] < 0) {\\n L[e.to] = L[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n \\n // search positive path\\n int dfs(int v, int t, int f){\\n if (v == t) return f;\\n for (int &i = I[v]; i < G[v].size(); i++) {\\n edge &e = G[v][i];\\n if (e.cap > 0 && L[v] < L[e.to]) {\\n int d = dfs(e.to, t, min(f, e.cap));\\n if (d) {\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n \\n // calc max flow\\n int max_flow(int s, int t){\\n int flow = 0;\\n for (;;) {\\n bfs(s);\\n if (L[t] < 0) return flow;\\n I.assign(V, 0);\\n int f;\\n while ((f = dfs(s, t, inf)) > 0) {\\n flow += f;\\n }\\n }\\n }\\n \\n vector<ftc> pipe;\\n vector<int> ofuro;\\n vector<int> neck;\\n void dfs_cut(int s){\\n if(vis[s] == 1){\\n return;\\n }\\n vis[s] = 1;\\n rep(i, G[s].size()){\\n \\n if(G[s][i].cap > 0){\\n dfs_cut(G[s][i].to);\\n }\\n else ofuro.pb(s), neck.pb(G[s][i].to), pipe.pb({s, G[s][i].to, G[s][i].cap});\\n }\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n // source code\\n int K, N, M;\\n cin >> K >> N >> M;\\n \\n Dinic mf(K + N + 2);\\n vector<ftc> E;\\n // source: K + N + 1\\n // sink: 0\\n // spring: 1 ~ K\\n // joint: K + 1 ~ K + N\\n rep(i, K){\\n E.pb({K + N + 1, i + 1, inf});\\n mf.add(K + N + 1, i + 1, inf);\\n }\\n \\n rep(i, M){\\n int a, b, c;\\n cin >> a >> b >> c;\\n if(a != 0 && !(b >= 1 && b <= K)) mf.add(a, b, c), E.pb({a, b, c});\\n if(!(a >= 1 && a <= K) && b != 0) mf.add(b, a, c), E.pb({b, a, c});\\n }\\n auto D = mf;\\n int mfmf = mf.max_flow(K + N + 1, 0);\\n \\n mf.dfs_cut(K + N + 1);\\n \\n int ret = 0;\\n vector<int> source(K + N + 2, 0), sink(K + N + 2, 0);\\n \\n for(int f: mf.ofuro){\\n auto d = D;\\n if(K + N + 1 == f) {\\n source[f] = inf;\\n continue;\\n }\\n source[f] = d.max_flow(K + N + 1, f);\\n }\\n \\n for(int f: mf.neck){\\n auto d = D;\\n if(f == 0) {\\n sink[f] = inf;\\n continue;\\n }\\n sink[f] = d.max_flow(f, 0);\\n }\\n \\n rep(i, D.G.size()){\\n for(edge e: D.G[i]){\\n if(source[i] && sink[e.to]){\\n ret = max(ret, mfmf + min(source[i], sink[e.to]) - e.cap);\\n }\\n }\\n }\\n \\n \\n \\n \\n if(ret >= inf){\\n output(\\\"overfuro\\\");\\n }\\n else{\\n output(ret);\\n }\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 0.14583333333333334,\n \"time_ms\": 170,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.182,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2803_2008371\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb push_back\\n#define INF (1e9+1)\\n//#define INF (1LL<<59)\\n\\n\\n#define MAX_V 110\\n\\nstruct edge{int to,cap,rev;};\\n\\nvector<edge> G[MAX_V]; //??°???????????????\\nint level[MAX_V]; //?§??????????????????¢\\nint iter[MAX_V]; //???????????§????????????\\n\\n// from??????to?????????????????????cap???????????°?????????????????????\\nvoid add_edge(int from,int to,int cap){\\n\\tG[from].push_back( (edge){ to ,cap,(int)G[to ].size() } );\\n\\tG[to ].push_back( (edge){ from,0 ,(int)G[from].size()-1 } );\\n}\\n\\n// s????????????????????¢???BFS??§?¨??????????\\nvoid bfs(int s){\\n\\trep(i,MAX_V)level[i]=-1;\\n\\tqueue<int> que;\\n\\tlevel[s]=0;\\n\\tque.push(s);\\n\\twhile(!que.empty()){\\n\\t\\tint v=que.front();que.pop();\\n\\t\\t\\n\\t\\trep(i,G[v].size()){\\n\\t\\t\\tedge &e=G[v][i];\\n\\t\\t\\tif(e.cap>0 && level[e.to]<0){\\n\\t\\t\\t\\tlevel[e.to]=level[v]+1;\\n\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//?¢?????????????DFS??§??¢???\\nint dfs(int v,int t,int f){\\n\\tif(v==t)return f;\\n\\tfor(int &i=iter[v];i<G[v].size();i++){\\n\\t\\tedge &e=G[v][i];\\n\\t\\tif(e.cap>0&&level[v]<level[e.to]){\\n\\t\\t\\tint 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\\n// s??????t???????????§???????±???????\\nint max_flow(int s,int t){\\n\\tif(s==t)return INF;\\n\\tint flow=0;\\n\\tfor(;;){\\n\\t\\tbfs(s);\\n\\t\\tif(level[t]<0)return flow;\\n\\t\\tmemset(iter,0,sizeof(iter));\\n\\t\\tint f;\\n\\t\\twhile((f=dfs(s,t,INF))>0){\\n\\t\\t\\tflow+=f;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid isUsedDfs(int s,int t,bool used[MAX_V]){\\n\\tif(s==t)return ;\\n\\tfor(auto &e:G[s]){\\n\\t\\tif(!used[e.to]&&e.cap>0){\\n\\t\\t\\tused[e.to]=true;\\n\\t\\t\\tisUsedDfs(e.to,t,used);\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\tint k,n,m;\\n\\tcin>>k>>n>>m;\\n\\tint s = 1+k+n;\\n\\tint t = 0;\\n\\tint v = s+1;\\n\\t\\n\\trep(i,m){\\n\\t\\tint a,b,c;\\n\\t\\tcin>>a>>b>>c;\\n\\t\\tadd_edge(a,b,c);\\n\\t\\tadd_edge(b,a,c);\\n\\t}\\n\\t\\n\\trep(i,k)add_edge(s,i+1,INF);\\n\\t\\n\\tint res = max_flow(s,t);\\n\\tvector<edge> Greg[MAX_V];\\n\\trep(i,v)Greg[i] = G[i];\\n\\t\\n\\t\\n\\tbool used[MAX_V]={};\\n\\tused[s]=true;\\n\\tisUsedDfs(s,t,used);\\n\\t\\n\\tint ans = 0;\\n\\tvector<int> sflow(v,-1),tflow(v,-1);\\n\\trep(i,v){\\n\\t\\tfor(auto e:Greg[i]){\\n\\t\\t\\tif(used[i]&&!used[e.to]){\\n\\t\\t\\t\\trep(i,v)G[i] = Greg[i];\\n\\t\\t\\t\\tif(sflow[i]==-1) sflow[i] = max_flow(s,i);\\n\\t\\t\\t\\tif(tflow[e.to]==-1)tflow[e.to] = max_flow(e.to,t);\\n\\t\\t\\t\\tans = max( ans , res + min(sflow[i],tflow[e.to]) );\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(ans>=INF)cout<<\\\"overfuro\\\"<<endl;\\n\\telse cout<<ans<<endl;\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.1545,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2803_2005167\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\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++)\\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\\n#define all(a) (a).begin(),(a).end()\\n#define rall(a) (a).rbegin(),(a).rend()\\n#define printV(v) for(auto&& x : v){cout << x << \\\" \\\";} cout << endl\\n#define printVV(vv) for(auto&& v : vv){for(auto&& x : v){cout << x << \\\" \\\";}cout << endl;}\\n#define printP(p) cout << p.first << \\\" \\\" << p.second << endl\\n#define printVP(vp) for(auto&& p : vp) printP(p);\\n\\nstruct edge { int to, cap, rev; };\\nusing Graph = vector<vector<edge>>;\\n\\nconst int inf = 1e9;\\nconst int MAX_V = 110;\\nint level[MAX_V];\\nint iter[MAX_V];\\nbool reachable[MAX_V]; // ????????°?????????????????????S????????°???????????????\\n\\nvoid add_edge(Graph& 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\\nvoid bfs(Graph& G, 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 < 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 dfs(Graph& G, int v, int t, int f) {\\n if (v == t) return f;\\n for (int &i = iter[v]; i < G[v].size(); i++) {\\n edge &e = G[v][i];\\n if (e.cap > 0 && level[v] < level[e.to]) {\\n int d = dfs(G, 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(Graph& G, int s, int t) {\\n int flow = 0;\\n for (;;) {\\n bfs(G, s);\\n if (level[t] < 0) return flow;\\n memset(iter, 0, sizeof(iter));\\n int f;\\n while ((f = dfs(G, s, t, inf)) > 0) {\\n flow += f;\\n }\\n }\\n}\\n\\n// Graph????????§??§?????????\\nint max_flow_2(Graph G, int s, int t) {\\n int flow = 0;\\n for (;;) {\\n bfs(G, s);\\n if (level[t] < 0) return flow;\\n memset(iter, 0, sizeof(iter));\\n int f;\\n while ((f = dfs(G, s, t, inf)) > 0) {\\n flow += f;\\n }\\n }\\n}\\n\\nvoid my_dfs (Graph& G, int v) {\\n if (reachable[v]) return; // ??¢?????\\\\?????????\\n reachable[v] = true;\\n for (auto e : G[v]) {\\n if (e.cap > 0) {\\n my_dfs(G, e.to);\\n }\\n }\\n}\\n\\nsigned main() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(0);\\n\\n int K, N, M;\\n cin >> K >> N >> M;\\n\\n Graph G_ori(MAX_V);\\n const int s = K + N + 1, t = 0;\\n const int V = s + 1;\\n rep(i, M) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n add_edge(G_ori, a, b, c);\\n add_edge(G_ori, b, a, c);\\n }\\n rep(i, K) {\\n add_edge(G_ori, s, i + 1, inf);\\n }\\n\\n Graph G_flow = G_ori;\\n int flow = max_flow(G_flow, s, t);\\n my_dfs(G_flow, s);\\n\\n vector<int> f1(V), f2(V); // s->i, i->t\\n f1[s] = inf; f2[t] = inf;\\n rep2(i, 1, K + N + 1) {\\n Graph G_tmp = G_flow;\\n if (reachable[i]) {\\n f1[i] = max_flow(G_tmp, s, i);\\n } else {\\n f2[i] = max_flow(G_tmp, i, t);\\n }\\n }\\n\\n int ans = -1;\\n rep(v, V) {\\n for (auto e : G_ori[v]) {\\n int u = e.to;\\n if (reachable[v] && !reachable[u]) {\\n ans = max(ans, flow + min(f1[v], f2[u]));\\n }\\n }\\n }\\n\\n if (ans >= inf) {\\n cout << \\\"overfuro\\\" << endl;\\n } else {\\n cout << ans << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3708,\n \"score_of_the_acc\": -0.1977,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2803_2004232\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <fstream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\n#include <complex>\\n#include <string>\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <numeric>\\n#include <limits>\\n#include <climits>\\n#include <cfloat>\\n#include <functional>\\nusing namespace std;\\n\\nclass Edge\\n{\\npublic:\\n int to, cap, rev;\\n Edge(){};\\n Edge(int to0, int cap0){to = to0; cap = cap0;}\\n Edge(int to0, int cap0, int rev0){to = to0; cap = cap0; rev = rev0;}\\n};\\n\\nint maxFlow(const vector<vector<Edge> >& edges0, int source, int sink, vector<vector<Edge> >& edgesOut)\\n{\\n static vector<vector<Edge> > edges;\\n static vector<unsigned> index;\\n static vector<int> level;\\n static int n;\\n\\n class Func{\\n public:\\n static void bfs(int s){\\n level.assign(n, -1);\\n queue<int> q;\\n level[s] = 0;\\n q.push(s);\\n while(!q.empty()){\\n int v = q.front();\\n q.pop();\\n for(unsigned i=0; i<edges[v].size(); ++i){\\n Edge& e = edges[v][i];\\n if(e.cap > 0 && level[e.to] < 0){\\n level[e.to] = level[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n static int dfs(int s, int t, int f){\\n if(s == t)\\n return f;\\n for(unsigned& i=index[s]; i<edges[s].size(); ++i){\\n Edge& e = edges[s][i];\\n if(e.cap > 0 && level[s] < level[e.to]){\\n int g = dfs(e.to, t, min(f, e.cap));\\n if(g > 0){\\n e.cap -= g;\\n edges[e.to][e.rev].cap += g;\\n return g;\\n }\\n }\\n }\\n return 0;\\n }\\n };\\n\\n if(source == sink){\\n edgesOut = edges;\\n return INT_MAX;\\n }\\n\\n n = edges0.size();\\n edges = edges0;\\n\\n int ret = 0;\\n for(;;){\\n Func::bfs(source);\\n if(level[sink] < 0){\\n edgesOut.swap(edges);\\n return ret;\\n }\\n index.assign(n, 0);\\n int f;\\n while((f = Func::dfs(source, sink, INT_MAX)) > 0)\\n ret += f;\\n }\\n}\\n\\nconst int INF = INT_MAX / 2;\\n\\nint main()\\n{\\n int k, n, m;\\n cin >> k >> n >> m;\\n\\n vector<vector<Edge> > edges(n+k+2);\\n int source = n + k + 1;\\n int sink = 0;\\n for(int i=1; i<=k; ++ i){\\n edges[source].push_back(Edge(i, INF, edges[i].size()));\\n edges[i].push_back(Edge(source, INF, edges[source].size()-1));\\n }\\n for(int i=0; i<m; ++i){\\n int a, b, c;\\n cin >> a >> b >> c;\\n if(a == 0 || b == 0){\\n if(1 <= a + b && a + b <= k){\\n cout << \\\"overfuro\\\" << endl;\\n return 0;\\n }\\n }\\n edges[a].push_back(Edge(b, c, edges[b].size()));\\n edges[b].push_back(Edge(a, c, edges[a].size()-1));\\n }\\n\\n vector<vector<Edge> > edges2;\\n int flow = maxFlow(edges, source, sink, edges2);\\n vector<bool> check(n+k+2, false);\\n queue<int> q;\\n check[source] = true;\\n q.push(source);\\n while(!q.empty()){\\n int pos = q.front();\\n q.pop();\\n for(const Edge& e : edges2[pos]){\\n if(e.cap > 0 && !check[e.to]){\\n check[e.to] = true;\\n q.push(e.to);\\n }\\n }\\n }\\n\\n vector<int> addFlow(n+k+2);\\n for(int i=0; i<n+k+2; ++i){\\n vector<vector<Edge> > edges3;\\n if(check[i])\\n addFlow[i] = maxFlow(edges2, source, i, edges3);\\n else\\n addFlow[i] = maxFlow(edges2, i, sink, edges3);\\n }\\n\\n int ans = flow;\\n for(int i=0; i<n+k+2; ++i){\\n for(const Edge& e : edges2[i]){\\n if(check[i] ^ check[e.to])\\n ans = max(ans, flow + min(addFlow[i], addFlow[e.to]));\\n }\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3312,\n \"score_of_the_acc\": -0.055,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1692,"cells":{"group_id":{"kind":"string","value":"aoj_2802_cpp"},"problem_description":{"kind":"string","value":"E: 鬼畜ババ抜き - Unbalanced Old Maid -\n物語\n高坂さんと園田さんと南さんは子供の頃からの仲良し3人組だ。3人は沖縄に修学旅行に行くも、台風が来てしまい、海で遊ぶことができないのでババ抜きをすることにした。\n園田さんは勝負事には強いが、ポーカーフェイスが苦手なため、自分のカードが引かれるときに無意識にかわいらしい顔芸を披露してしまう。園田さんを愛して止まない高坂さんと南さんは、園田さんの顔芸を見るだけで園田さんの手札が分かってしまうため、園田さんのカードを引くときは、自分が有利になるように引くことができる。\n一方、高坂さんと南さんは特に顔芸をしたりはしないので、手札がばれることはない。 よって、高坂さんと南さんのカードを引く人はそれぞれ、高坂さんと南さんが持っているカードの中から等確率で1枚引く。\nどう考えても不利な園田さんは、ババ抜きでなかなか勝てないことに違和感を覚えている。 使用するカードの種類数\nn\nと初期の手札が与えられたとき、園田さんが負けとならない確率を求めてあげよう。\n問題文\n高坂さん、園田さん、南さんの3人は、以下の状況でババ抜きを行う。\n使用するカードは、1から\nn\nまでの整数が書かれた\nn\n種類のカードそれぞれ4枚ずつとジョーカー1枚の合計\n4n+1\n枚である。\n最初の手札が与えられたとき、3人はそれぞれ自分の手札に同一の整数が書かれたカードのペア（2枚組）があるならば、そのようなペアを全て捨てる。\n3人は「高坂さんが南さんの手札からカードを引く」、「園田さんが高坂さんの手札からカードを引く」「南さんが園田さんの手札からカードを引く」という順番（ターン）で以下の操作を繰り返す。（このババ抜きでは、カードを引いた人が、次に引かれるというルールであることに注意せよ。）\n一人がジョーカーのみを持ち、その人以外の2人の手札が空のとき、ババ抜きは終了し、ジョーカーを持っている人が負けとなる。\nカードを引く順番の人の手札が空のとき、ターンを次の人とし、1.に戻る。\nそうでなければ、カードを引く順番の人は決められた相手からカードを1枚引く。ただし、相手の手札が空のとき、まだ残っているもう1人からカードを引く。\n引いたカードと同じ整数が書かれたカードがカードを引いた人の手札にあれば、その2枚を捨てる。\nターンを次の人とし、1.へ戻る。\nただし、園田さんのカードを引く人（南さんか高坂さん）は、以下の戦略でカード引く。\nもし自分のカードと園田さんのカードで同じ整数が書かれたカードがあれば、それらのうち最小の整数が書かれたカードを引く\nそうでないとき、園田さんがジョーカーでないカードを持っていれば、それらのうち最小の整数が書かれたカードを引く\nそうでないなら、園田さんはジョーカーしか持っていないので、ジョーカーを引く\n高坂さんと南さんのカードを引く人は、それぞれ高坂さんと南さんが持っているカードの中から等確率で1枚引く。\n使用するカードの種類数\nn\nと3人の初期の手札が与えられたとき、園田さんが負けとならない確率を求めてあげよう。\n入力形式\n入力は4行からなり、以下の形式で与えられる。\nn\nm_1\nc_{1,1}\n...\nc_{1,m_1}\nm_2\nc_{2,1}\n...\nc_{2,m_2}\nm_3\nc_{3,1}\n...\nc_{3,m_3}\n1行目にジョーカー以外のカードの種類数\nn\nが与えられる。 \n続く入力は3行からなり、2行目に高坂さんの手札、3行目に園田さんの手札、4行目に南さんの手札の情報が与えられる。\ni+1 (1 ≤ i ≤ 3)\n行目では行頭に手持ちの枚数\nm_i\n、続けて手持ちのカードを表す\nm_i\n個の整数\nc_{i,j} (1 ≤ j ≤ m_i)\nが空白区切りで与えられる。\n0\nはジョーカー、\n1\nから\nn\nはカードに書かれた整数を表す。\n制約\n1 ≤ n ≤ 100\nm_1+m_2+m_3 = 4n+1\n3人の手札で0はちょうど1つ、\n1\nから\nn\nはちょうど4回ずつ現れる\n0 ≤ c_{i,j} ≤ n\n(\n1 ≤ i ≤ 3\n,\n1 ≤ j ≤ m_i\n)\n出力形式\n園田さんが負けとならない確率を1行に出力せよ。答えには\n10^{−6}\nを超える絶対誤差があってはならない。\n入力例1\n1\n1 1\n3 0 1 1\n1 1\n出力例1\n0.0\n高坂さんが南さんのカード1を引き、高坂さんと南さんは手札が空になる。\n園田さんはどうしても勝つことはできない。\n入力例2\n1\n2 1 1\n1 1\n2 0 1\n出力例2\n0.5\nはじめの高坂さんのターンは、高坂さんの手札が既に空なので何もしない。次の園田さんのターンでは、園田さんは南さんの手札のうちそれぞれ0.5の確率でカード1かジョーカーを引く。カード1を引いたとき、園田さんの手札は空となり勝利する。一方ジョーカーを引いたときは、次の南さんのターンで、南さんは確実にカード1を引くので園田さんが負けとなる。\n入力例3\n2\n3 0 1 2\n3 1 2 2\n3 1 1 2\n出力例3\n0.5\n入力例4\n2\n2 0 1\n6 2 2 2 1 1 1\n1 2\n出力例4\n0.6666666667"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2802_8322461","code_snippet":"#include <iostream>\n#include <tuple>\n#include <vector>\nusing namespace std;\n\nint N;\nint M[3], P[3][409];\nint Cnt[3][109];\ndouble prevs[109][109][109][3];\ndouble dp[109][109][109][3];\ndouble Answer = 0.0;\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\n\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\n\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\n\n\t// Step 2. Precount\n\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\n\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\n\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\n\tfor (int i = 0; i < 3; i++) {\n\t\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\n\t}\n\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\n\t\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\n\t\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\n\t}\n\tif (Cnt[0][0] == 1) j_ = 0;\n\tif (Cnt[1][0] == 1) j_ = 1;\n\tif (Cnt[2][0] == 1) j_ = 2;\n\tprevs[ab_][bc_][ca_][j_] = 1.0;\n\tif (ab_ + bc_ + ca_ == 0 && j_ != 1) Answer += 1.0;\n\n\t// Step 3. Dynamic Programming\n\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\n\t\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\n\t\tlims = min(lims, ab_ + bc_ + ca_);\n\n\t\t// Start\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims - ab; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tif (prevs[ab][bc][ca][j] == 0) continue;\n\t\t\t\t\t\tif (ab + bc + ca == 0) continue;\n\t\t\t\t\t\tint nex = (j + 2) % 3;\n\t\t\t\t\t\tint numa = ab + ca + (j == 0 ? 1 : 0);\n\t\t\t\t\t\tint numb = bc + ab + (j == 1 ? 1 : 0);\n\t\t\t\t\t\tint numc = ca + bc + (j == 2 ? 1 : 0);\n\n\t\t\t\t\t\t// Case 1\n\t\t\t\t\t\tif (numa == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 2\n\t\t\t\t\t\telse if (numc != 0 && i % 3 != 2) {\n\t\t\t\t\t\t\tint joker_flag = (j == 2 ? 1 : 0);\n\t\t\t\t\t\t\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\n\t\t\t\t\t\t\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 3\n\t\t\t\t\t\telse if (numc != 0 && i % 3 == 2) {\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 4\n\t\t\t\t\t\telse if (numb != 0 && i % 3 != 0) {\n\t\t\t\t\t\t\tint joker_flag = (j == 1 ? 1 : 0);\n\t\t\t\t\t\t\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 5\n\t\t\t\t\t\telse if (numb != 0 && i % 3 == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\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}\n\n\t\t// Refresh\n\t\t// printf(\"%d: %.12lf\\n\", i, Answer);\n\t\tif (i % 3 != 0) Answer += dp[0][0][0][0];\n\t\tif (i % 3 != 1) Answer += dp[0][0][0][2];\n\t\tif (i % 3 != 2) Answer += dp[0][0][0][1];\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\n\t\t\t\t\t\tdp[ab][bc][ca][j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12lf\\n\", Answer);\n\treturn 0;\n}","accuracy":1,"time_ms":590,"memory_kb":54204,"score_of_the_acc":-1.271,"final_rank":5},{"submission_id":"aoj_2802_8322445","code_snippet":"#include <iostream>\n#include <tuple>\n#include <vector>\nusing namespace std;\n\nint N;\nint M[3], P[3][409];\nint Cnt[3][109];\ndouble prevs[109][109][109][3];\ndouble dp[109][109][109][3];\ndouble Answer = 0.0;\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\n\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\n\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\n\n\t// Step 2. Precount\n\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\n\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\n\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\n\tfor (int i = 0; i < 3; i++) {\n\t\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\n\t}\n\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\n\t\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\n\t\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\n\t}\n\tif (Cnt[0][0] == 1) j_ = 0;\n\tif (Cnt[1][0] == 1) j_ = 1;\n\tif (Cnt[2][0] == 1) j_ = 2;\n\tprevs[ab_][bc_][ca_][j_] = 1.0;\n\tif (ab_ + bc_ + ca_ == 0 && j_ != 1) Answer += 1.0;\n\n\t// Step 3. Dynamic Programming\n\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\n\t\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\n\t\tlims = min(lims, ab_ + bc_ + ca_);\n\n\t\t// Start\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims - ab; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tif (prevs[ab][bc][ca][j] == 0) continue;\n\t\t\t\t\t\tif (ab + bc + ca == 0) continue;\n\t\t\t\t\t\tint nex = (j + 2) % 3;\n\n\t\t\t\t\t\t// Case 1\n\t\t\t\t\t\tif (ab + ca == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 2\n\t\t\t\t\t\telse if (bc + ca + (j == 2 ? 1 : 0) != 0 && i % 3 != 2) {\n\t\t\t\t\t\t\tint joker_flag = (j == 2 ? 1 : 0);\n\t\t\t\t\t\t\tint numc = bc + ca + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\n\t\t\t\t\t\t\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 3\n\t\t\t\t\t\telse if (bc + ca + (j == 2 ? 1 : 0) != 0 && i % 3 == 2) {\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 4\n\t\t\t\t\t\telse if (i % 3 != 0) {\n\t\t\t\t\t\t\tint joker_flag = (j == 1 ? 1 : 0);\n\t\t\t\t\t\t\tint numb = ab + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 5\n\t\t\t\t\t\telse if (i % 3 == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\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}\n\n\t\t// Refresh\n\t\t// printf(\"%d: %.12lf\\n\", i, Answer);\n\t\tif (i % 3 != 0) Answer += dp[0][0][0][0];\n\t\tif (i % 3 != 1) Answer += dp[0][0][0][2];\n\t\tif (i % 3 != 2) Answer += dp[0][0][0][1];\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\n\t\t\t\t\t\tdp[ab][bc][ca][j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12lf\\n\", Answer);\n\treturn 0;\n}","accuracy":0.11904761904761904,"time_ms":360,"memory_kb":45836,"score_of_the_acc":-0.8096,"final_rank":6},{"submission_id":"aoj_2802_8322423","code_snippet":"#include <iostream>\n#include <tuple>\n#include <vector>\nusing namespace std;\n\nint N;\nint M[3], P[3][409];\nint Cnt[3][109];\ndouble prevs[109][109][109][3];\ndouble dp[109][109][109][3];\ndouble Answer = 0.0;\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\n\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\n\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\n\n\t// Step 2. Precount\n\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\n\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\n\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\n\tfor (int i = 0; i < 3; i++) {\n\t\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\n\t}\n\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\n\t\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\n\t\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\n\t}\n\tif (Cnt[0][0] == 1) j_ = 0;\n\tif (Cnt[1][0] == 1) j_ = 1;\n\tif (Cnt[2][0] == 1) j_ = 2;\n\tprevs[ab_][bc_][ca_][j_] = 1.0;\n\tif (ab_ + bc_ + ca_ == 0 && j_ != 1) Answer += 1.0;\n\n\t// Step 3. Dynamic Programming\n\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\n\t\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\n\t\tlims = min(lims, ab_ + bc_ + ca_);\n\n\t\t// Start\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims - ab; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tif (prevs[ab][bc][ca][j] == 0) continue;\n\t\t\t\t\t\tif (ab + bc + ca == 0) continue;\n\t\t\t\t\t\tint nex = (j + 2) % 3;\n\n\t\t\t\t\t\t// Case 1\n\t\t\t\t\t\tif (ab + ca == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 2\n\t\t\t\t\t\telse if (bc + ca != 0 && i % 3 != 2) {\n\t\t\t\t\t\t\tint joker_flag = (j == 2 ? 1 : 0);\n\t\t\t\t\t\t\tint numc = bc + ca + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\n\t\t\t\t\t\t\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 3\n\t\t\t\t\t\telse if (bc + ca != 0 && i % 3 == 2) {\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 4\n\t\t\t\t\t\telse if (bc + ca == 0 && i % 3 != 0) {\n\t\t\t\t\t\t\tint joker_flag = (j == 1 ? 1 : 0);\n\t\t\t\t\t\t\tint numb = ab + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 5\n\t\t\t\t\t\telse if (bc + ca == 0 && i % 3 == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\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}\n\n\t\t// Refresh\n\t\t// printf(\"%d: %.12lf\\n\", i, Answer);\n\t\tif (i % 3 != 0) Answer += dp[0][0][0][0];\n\t\tif (i % 3 != 1) Answer += dp[0][0][0][2];\n\t\tif (i % 3 != 2) Answer += dp[0][0][0][1];\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\n\t\t\t\t\t\tdp[ab][bc][ca][j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12lf\\n\", Answer);\n\treturn 0;\n}","accuracy":0.09523809523809523,"time_ms":360,"memory_kb":45660,"score_of_the_acc":-0.8082,"final_rank":12},{"submission_id":"aoj_2802_8322411","code_snippet":"#include <iostream>\n#include <tuple>\n#include <vector>\nusing namespace std;\n\nint N;\nint M[3], P[3][409];\nint Cnt[3][109];\ndouble prevs[109][109][109][3];\ndouble dp[109][109][109][3];\ndouble Answer = 0.0;\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\n\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\n\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\n\n\t// Step 2. Precount\n\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\n\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\n\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\n\tfor (int i = 0; i < 3; i++) {\n\t\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\n\t}\n\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\n\t\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\n\t\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\n\t}\n\tif (Cnt[0][0] == 1) j_ = 0;\n\tif (Cnt[1][0] == 1) j_ = 1;\n\tif (Cnt[2][0] == 1) j_ = 2;\n\tprevs[ab_][bc_][ca_][j_] = 1.0;\n\tif (ab_ + bc_ + ca_ == 0 && j_ != 1) Answer += 1.0;\n\n\t// Step 3. Dynamic Programming\n\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\n\t\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\n\t\tlims = min(lims, ab_ + bc_ + ca_);\n\n\t\t// Start\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims - ab; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tif (prevs[ab][bc][ca][j] == 0) continue;\n\t\t\t\t\t\tif (ab + bc + ca == 0) continue;\n\t\t\t\t\t\tint nex = (j + 2) % 3;\n\n\t\t\t\t\t\t// Case 1\n\t\t\t\t\t\tif (ab + ca == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 2\n\t\t\t\t\t\telse if (bc + ca != 0 && i % 3 != 2) {\n\t\t\t\t\t\t\tint joker_flag = (j == 2 ? 1 : 0);\n\t\t\t\t\t\t\tint numc = bc + ca + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\n\t\t\t\t\t\t\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 3\n\t\t\t\t\t\telse if (bc + ca != 0 && i % 3 == 2) {\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 4\n\t\t\t\t\t\tif (bc + ca == 0 && i % 3 != 0) {\n\t\t\t\t\t\t\tint joker_flag = (j == 1 ? 1 : 0);\n\t\t\t\t\t\t\tint numb = ab + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 5\n\t\t\t\t\t\tif (bc + ca == 0 && i % 3 == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\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}\n\n\t\t// Refresh\n\t\t// printf(\"%d: %.12lf\\n\", i, Answer);\n\t\tif (i % 3 != 0) Answer += dp[0][0][0][0];\n\t\tif (i % 3 != 1) Answer += dp[0][0][0][2];\n\t\tif (i % 3 != 2) Answer += dp[0][0][0][1];\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\n\t\t\t\t\t\tdp[ab][bc][ca][j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12lf\\n\", Answer);\n\treturn 0;\n}","accuracy":0.09523809523809523,"time_ms":360,"memory_kb":45836,"score_of_the_acc":-0.8096,"final_rank":13},{"submission_id":"aoj_2802_8322390","code_snippet":"#include <iostream>\n#include <tuple>\n#include <vector>\nusing namespace std;\n\nint N;\nint M[3], P[3][409];\nint Cnt[3][109];\ndouble prevs[109][109][109][3];\ndouble dp[109][109][109][3];\ndouble Answer = 0.0;\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\n\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\n\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\n\n\t// Step 2. Precount\n\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\n\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\n\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\n\tfor (int i = 0; i < 3; i++) {\n\t\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\n\t}\n\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\n\t\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\n\t\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\n\t}\n\tif (Cnt[0][0] == 1) j_ = 0;\n\tif (Cnt[1][0] == 1) j_ = 1;\n\tif (Cnt[2][0] == 1) j_ = 2;\n\tprevs[ab_][bc_][ca_][j_] = 1.0;\n\n\t// Step 3. Dynamic Programming\n\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\n\t\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\n\t\tlims = min(lims, ab_ + bc_ + ca_);\n\n\t\t// Start\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims - ab; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tif (prevs[ab][bc][ca][j] == 0) continue;\n\t\t\t\t\t\tif (ab + bc + ca == 0) continue;\n\t\t\t\t\t\tint nex = (j + 2) % 3;\n\n\t\t\t\t\t\t// Case 1\n\t\t\t\t\t\tif (ab + ca == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 2\n\t\t\t\t\t\telse if (bc + ca != 0 && i % 3 != 2) {\n\t\t\t\t\t\t\tint joker_flag = (j == 2 ? 1 : 0);\n\t\t\t\t\t\t\tint numc = bc + ca + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\n\t\t\t\t\t\t\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 3\n\t\t\t\t\t\telse if (bc + ca != 0 && i % 3 == 2) {\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 4\n\t\t\t\t\t\tif (bc + ca == 0 && i % 3 != 0) {\n\t\t\t\t\t\t\tint joker_flag = (j == 1 ? 1 : 0);\n\t\t\t\t\t\t\tint numb = ab + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 5\n\t\t\t\t\t\tif (bc + ca == 0 && i % 3 == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\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}\n\n\t\t// Refresh\n\t\t// printf(\"%d: %.12lf\\n\", i, Answer);\n\t\tif (i % 3 != 0) Answer += dp[0][0][0][0];\n\t\tif (i % 3 != 1) Answer += dp[0][0][0][2];\n\t\tif (i % 3 != 2) Answer += dp[0][0][0][1];\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\n\t\t\t\t\t\tdp[ab][bc][ca][j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12lf\\n\", Answer);\n\treturn 0;\n}","accuracy":0.09523809523809523,"time_ms":360,"memory_kb":45876,"score_of_the_acc":-0.8099,"final_rank":14},{"submission_id":"aoj_2802_8322363","code_snippet":"#include <iostream>\n#include <tuple>\n#include <vector>\nusing namespace std;\n\nint N;\nint M[3], P[3][409];\nint Cnt[3][109];\ndouble prevs[109][109][109][3];\ndouble dp[109][109][109][3];\ndouble Answer = 0.0;\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\n\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\n\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\n\n\t// Step 2. Precount\n\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\n\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\n\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\n\tfor (int i = 0; i < 3; i++) {\n\t\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\n\t}\n\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\n\t\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\n\t\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\n\t}\n\tif (Cnt[0][0] == 1) j_ = 0;\n\tif (Cnt[1][0] == 1) j_ = 1;\n\tif (Cnt[2][0] == 1) j_ = 2;\n\tprevs[ab_][bc_][ca_][j_] = 1.0;\n\n\t// Step 3. Dynamic Programming\n\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 5 + 10; i++) {\n\t\tint lims = ((ab_ + bc_ + ca_) * 5 + 10 - i) / 5;\n\t\tlims = min(lims, ab_ + bc_ + ca_);\n\n\t\t// Start\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims - ab; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tif (prevs[ab][bc][ca][j] == 0) continue;\n\t\t\t\t\t\tif (ab + bc + ca == 0) continue;\n\t\t\t\t\t\tint nex = (j + 2) % 3;\n\n\t\t\t\t\t\t// Case 1\n\t\t\t\t\t\tif (ab + ca == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 2\n\t\t\t\t\t\telse if (bc + ca != 0 && i % 3 != 2) {\n\t\t\t\t\t\t\tint joker_flag = (j == 2 ? 1 : 0);\n\t\t\t\t\t\t\tint numc = bc + ca + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\n\t\t\t\t\t\t\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 3\n\t\t\t\t\t\telse if (bc + ca != 0 && i % 3 == 2) {\n\t\t\t\t\t\t\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 4\n\t\t\t\t\t\tif (bc + ca == 0 && i % 3 != 0) {\n\t\t\t\t\t\t\tint joker_flag = (j == 1 ? 1 : 0);\n\t\t\t\t\t\t\tint numb = ab + joker_flag;\n\t\t\t\t\t\t\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Case 5\n\t\t\t\t\t\tif (bc + ca == 0 && i % 3 == 0) {\n\t\t\t\t\t\t\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\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}\n\n\t\t// Refresh\n\t\tif (i % 3 != 0) Answer += dp[0][0][0][0];\n\t\tif (i % 3 != 1) Answer += dp[0][0][0][2];\n\t\tif (i % 3 != 2) Answer += dp[0][0][0][1];\n\t\tfor (int ab = 0; ab <= lims; ab++) {\n\t\t\tfor (int bc = 0; bc <= lims; bc++) {\n\t\t\t\tfor (int ca = 0; ca <= lims; ca++) {\n\t\t\t\t\tfor (int j = 0; j <= 2; j++) {\n\t\t\t\t\t\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\n\t\t\t\t\t\tdp[ab][bc][ca][j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4. Output\n\tprintf(\"%.12lf\\n\", Answer);\n\treturn 0;\n}","accuracy":0.09523809523809523,"time_ms":140,"memory_kb":45928,"score_of_the_acc":-0.431,"final_rank":11},{"submission_id":"aoj_2802_4445209","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\nenum Type{\n\tA,\n\tC,\n\tB,\n};\n\nint N,POW[4];\nint table[105],COUNT[3][105];\ndouble dp[101][101][101][3][3];\nType type_array[3] = {A,C,B};\n\n\ndouble recursive(int ab,int ac,int bc,Type joker,Type turn){\n\n\tif(dp[ab][ac][bc][joker][turn] >= 0){\n\n\t\treturn dp[ab][ac][bc][joker][turn];\n\t}\n\n\tint num_A = ab+ac;\n\tint num_B = ab+bc;\n\tint num_C = ac+bc;\n\n\tswitch(joker){\n\tcase A:\n\t\tnum_A++;\n\t\tbreak;\n\tcase B:\n\t\tnum_B++;\n\t\tbreak;\n\tcase C:\n\t\tnum_C++;\n\t\tbreak;\n\t}\n\n\tif(turn == A && num_A == 0){\n\n\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc,joker,C);\n\n\t}else if(turn == C && num_C == 0){\n\n\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\n\t}else if(turn == B && num_B == 0){\n\n\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc,joker,A);\n\t}\n\n\tif(num_A+num_B+num_C == 1){\n\n\t\tif(num_C == 1){\n\n\t\t\treturn dp[ab][ac][bc][joker][turn] = 0;\n\t\t}else{\n\n\t\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\t\t}\n\t}\n\n\tdouble ret = 0;\n\n\tif(turn == A){\n\n\t\tif(num_B == 0){\n\n\t\t\tif(num_C == 1){ //C,非負け\n\n\t\t\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\n\t\t\t}else{ //2枚以上あるなら、非jokerは少なくとも1枚ある\n\n\t\t\t\tif(ac > 0){\n\n\t\t\t\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac-1,bc,joker,C);\n\n\t\t\t\t}else{ //bc > 0\n\n\t\t\t\t\t//bが0枚なのであり得ない\n\t\t\t\t}\n\t\t\t}\n\n\t\t}else{ //num_B > 0\n\n\t\t\tif(ab > 0){\n\n\t\t\t\tret += recursive(ab-1,ac,bc,joker,C)*((double)ab/(double)num_B);\n\t\t\t}\n\t\t\tif(bc > 0){\n\n\t\t\t\tret += recursive(ab,ac+1,bc-1,joker,C)*((double)bc/(double)num_B);\n\t\t\t}\n\t\t\tif(joker == B){\n\n\t\t\t\tret += recursive(ab,ac,bc,A,C)*(1.0/(double)num_B);\n\t\t\t}\n\t\t}\n\n\t}else if(turn == B){\n\n\t\tif(num_C == 0){//C:非負け\n\n\t\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\n\t\t}else{ //num_C > 0\n\n\t\t\tif(num_C == 1){ //C,非負け\n\n\t\t\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\n\t\t\t}else{ //2枚以上あるなら、非jokerは少なくとも1枚ある\n\n\t\t\t\tif(bc > 0){\n\n\t\t\t\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc-1,joker,A);\n\n\t\t\t\t}else{ //ac > 0\n\n\t\t\t\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab+1,ac-1,bc,joker,A);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}else{ //turn == C\n\n\t\tif(num_A == 0){ //Bから引く\n\n\t\t\tif(ab > 0){\n\n\t\t\t\t//Aが0なのであり得ない\n\t\t\t}\n\t\t\tif(bc > 0){\n\n\t\t\t\tret += recursive(ab,ac,bc-1,joker,B)*((double)bc/(double)num_B);\n\t\t\t}\n\t\t\tif(joker == B){\n\n\t\t\t\tret += recursive(ab,ac,bc,C,B)*(1.0/(double)num_B);\n\t\t\t}\n\n\t\t}else{ //num_A > 0\n\n\t\t\tif(ab > 0){\n\n\t\t\t\tret += recursive(ab-1,ac,bc+1,joker,B)*((double)ab/(double)num_A);\n\t\t\t}\n\t\t\tif(ac > 0){\n\n\t\t\t\tret += recursive(ab,ac-1,bc,joker,B)*((double)ac/(double)num_A);\n\t\t\t}\n\t\t\tif(joker == A){\n\n\t\t\t\tret += recursive(ab,ac,bc,C,B)*(1.0/(double)num_A);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dp[ab][ac][bc][joker][turn] = ret;\n}\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < 4; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 1; i <= N; i++){\n\t\tfor(int k = 0; k < 3; k++){\n\t\t\tCOUNT[k][i] = 0;\n\t\t}\n\t}\n\n\tint num,tmp;\n\tType joker = A;\n\n\tfor(int i = 0; i < 3; i++){\n\t\tscanf(\"%d\",&num);\n\t\tfor(int k = 0; k < num; k++){\n\t\t\tscanf(\"%d\",&tmp);\n\n\t\t\tCOUNT[i][tmp]++;\n\n\t\t\tif(tmp == 0){\n\n\t\t\t\tjoker = type_array[i];\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < 3; i++){\n\t\tfor(int k = 1; k <= N; k++){\n\t\t\tif(COUNT[i][k]%2 == 1){\n\n\t\t\t\ttable[k] += POW[i];\n\t\t\t}\n\t\t}\n\t}\n\n\n\n\tint ab = 0,ac = 0,bc = 0;\n\tfor(int i = 1; i <= N; i++){\n\t\tif(table[i] == 0)continue;\n\n\t\tswitch(table[i]){\n\t\tcase 3:\n\t\t\tac++;\n\t\t\tbreak;\n\t\tcase 5:\n\t\t\tab++;\n\t\t\tbreak;\n\t\tcase 6:\n\t\t\tbc++;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= N; i++){\n\t\tfor(int k = 0; k <= N; k++){\n\t\t\tfor(int p = 0; p <= N; p++){\n\t\t\t\tfor(int a = 0; a < 3; a++){\n\t\t\t\t\tfor(int b = 0; b < 3; b++){\n\n\t\t\t\t\t\tdp[i][k][p][a][b] = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",recursive(ab,ac,bc,joker,A));\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":75660,"score_of_the_acc":-0.4374,"final_rank":1},{"submission_id":"aoj_2802_4445203","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\nenum Type{\n\tA,\n\tC,\n\tB,\n};\n\nint N,POW[4];\nint table[105],COUNT[3][105];\ndouble dp[101][101][101][3][3];\nType type_array[3] = {A,C,B};\n\n\ndouble recursive(int ab,int ac,int bc,Type joker,Type turn){\n\n\tif(dp[ab][ac][bc][joker][turn] >= 0){\n\n\t\treturn dp[ab][ac][bc][joker][turn];\n\t}\n\n\tint num_A = ab+ac;\n\tint num_B = ab+bc;\n\tint num_C = ac+bc;\n\n\tswitch(joker){\n\tcase A:\n\t\tnum_A++;\n\t\tbreak;\n\tcase B:\n\t\tnum_B++;\n\t\tbreak;\n\tcase C:\n\t\tnum_C++;\n\t\tbreak;\n\t}\n\n\tif(turn == A && num_A == 0){\n\n\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc,joker,C);\n\n\t}else if(turn == C && num_C == 0){\n\n\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\n\t}else if(turn == B && num_B == 0){\n\n\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc,joker,A);\n\t}\n\n\tif(num_A+num_B+num_C == 1){\n\n\t\tif(num_C == 1){\n\n\t\t\treturn dp[ab][ac][bc][joker][turn] = 0;\n\t\t}else{\n\n\t\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\t\t}\n\t}\n\n\tdouble ret = 0;\n\n\tif(turn == A){\n\n\t\tif(num_B == 0){\n\n\t\t\tif(num_C == 1){ //C,非負け\n\n\t\t\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\n\t\t\t}else{ //2枚以上あるなら、非jokerは少なくとも1枚ある\n\n\t\t\t\tif(ac > 0){\n\n\t\t\t\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac-1,bc,joker,C);\n\n\t\t\t\t}else{ //bc > 0\n\n\t\t\t\t\t//bが0枚なのであり得ない\n\t\t\t\t}\n\t\t\t}\n\n\t\t}else{ //num_B > 0\n\n\t\t\tif(ab > 0){\n\n\t\t\t\tret += recursive(ab-1,ac,bc,joker,C)*((double)ab/(double)num_B);\n\t\t\t}\n\t\t\tif(bc > 0){\n\n\t\t\t\tret += recursive(ab,ac+1,bc-1,joker,C)*((double)bc/(double)num_B);\n\t\t\t}\n\t\t\tif(joker == B){\n\n\t\t\t\tret += recursive(ab,ac,bc,A,C)*(1.0/(double)num_B);\n\t\t\t}\n\t\t}\n\n\t}else if(turn == B){\n\n\t\tif(num_C == 0){//C:非負け\n\n\t\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\n\t\t}else{ //num_C > 0\n\n\t\t\tif(num_C == 1){ //C,非負け\n\n\t\t\t\treturn dp[ab][ac][bc][joker][turn] = 1.0;\n\n\t\t\t}else{ //2枚以上あるなら、非jokerは少なくとも1枚ある\n\n\t\t\t\tif(bc > 0){\n\n\t\t\t\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc-1,joker,A);\n\n\t\t\t\t}else{ //ac > 0\n\n\t\t\t\t\treturn dp[ab][ac][bc][joker][turn] = recursive(ab+1,ac-1,bc,joker,A);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}else{ //turn == C\n\n\t\tif(num_A == 0){ //Bから引く\n\n\t\t\tif(ab > 0){\n\n\t\t\t\t//Aが0なのであり得ない\n\t\t\t}\n\t\t\tif(bc > 0){\n\n\t\t\t\tret += recursive(ab,ac,bc-1,joker,B)*((double)bc/(double)num_B);\n\t\t\t}\n\t\t\tif(joker == B){\n\n\t\t\t\tret += recursive(ab,ac,bc,C,B)*(1.0/(double)num_B);\n\t\t\t}\n\n\t\t}else{ //num_A > 0\n\n\t\t\tif(ab > 0){\n\n\t\t\t\tret += recursive(ab-1,ac,bc+1,joker,B)*((double)ab/(double)num_A);\n\t\t\t}\n\t\t\tif(ac > 0){\n\n\t\t\t\tret += recursive(ab,ac-1,bc,joker,B)*((double)ac/(double)num_A);\n\t\t\t}\n\t\t\tif(joker == A){\n\n\t\t\t\tret += recursive(ab,ac,bc,C,B)*(1.0/(double)num_A);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dp[ab][ac][bc][joker][turn] = ret;\n}\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < 4; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 1; i <= N; i++){\n\t\tfor(int k = 0; k < 3; k++){\n\t\t\tCOUNT[k][i] = 0;\n\t\t}\n\t}\n\n\tint num,tmp;\n\tType joker = A;\n\n\tfor(int i = 0; i < 3; i++){\n\t\tscanf(\"%d\",&num);\n\t\tfor(int k = 0; k < num; k++){\n\t\t\tscanf(\"%d\",&tmp);\n\n\t\t\tCOUNT[i][tmp]++;\n\n\t\t\tif(tmp == 0){\n\n\t\t\t\t//printf(\"joker:%d\\n\",i);\n\t\t\t\tjoker = type_array[i];\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < 3; i++){\n\t\tfor(int k = 1; k <= N; k++){\n\t\t\tif(COUNT[i][k]%2 == 1){\n\n\t\t\t\ttable[k] += POW[i];\n\t\t\t}\n\t\t}\n\t}\n\n\n\n\tint ab = 0,ac = 0,bc = 0;\n\tfor(int i = 1; i <= N; i++){\n\t\tif(table[i] == 0)continue;\n\n\t\tswitch(table[i]){\n\t\tcase 3:\n\t\t\tac++;\n\t\t\tbreak;\n\t\tcase 5:\n\t\t\tab++;\n\t\t\tbreak;\n\t\tcase 6:\n\t\t\tbc++;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= N; i++){\n\t\tfor(int k = 0; k <= N; k++){\n\t\t\tfor(int p = 0; p <= N; p++){\n\t\t\t\tfor(int a = 0; a < 3; a++){\n\t\t\t\t\tfor(int b = 0; b < 3; b++){\n\n\t\t\t\t\t\tdp[i][k][p][a][b] = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//printf(\"ab:%d ac:%d bc:%d\\n\",ab,ac,bc);\n\n\tprintf(\"%.10lf\\n\",recursive(ab,ac,bc,joker,A));\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":75688,"score_of_the_acc":-0.4376,"final_rank":2},{"submission_id":"aoj_2802_3989842","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"functional\"\n\nusing namespace std;\n\nint N, M, K, L, R, H, W;\n//long long int N,M,K,L,R,H,W;\n\nconstexpr long long int MOD = 1000000007;\n//constexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n//constexpr long long int MOD=998244353;\n\nconstexpr long double EPS = 1e-8;\n\nlong double dp[101][101][101][3][3];\n\ndouble Search(int ab, int bc, int ca, int j, int t) {\n\t//cout<<ab<<\" \"<<bc<<\" \"<<ca<<\" \"<<j<<\" \"<<t<<endl;\n\tif (dp[ab][bc][ca][j][t] >= 0)return dp[ab][bc][ca][j][t];\n\tif (!ab && !bc && !ca) {\n\t\tif (j == 1)return dp[0][0][0][1][t] = 0;\n\t\telse return dp[0][0][0][j][t] = 1;\n\t}\n\tif (!ab && !bc&&j != 1 && t == 1)return dp[ab][bc][ca][j][t] = Search(ab, bc, ca, j, 2);\n\tif (!bc && !ca&&j != 2 && t == 2)return dp[ab][bc][ca][j][t] = Search(ab, bc, ca, j, 0);\n\tif (!ca && !ab&&j != 0 && t == 0)return dp[ab][bc][ca][j][t] = Search(ab, bc, ca, j, 1);\n\t//nxが1のとき不正が発生\n\tint nx;\n\tif (t == 0) {\n\t\tnx = 2;\n\t\tif (!bc && !ca&&j != 2) {\n\t\t\tnx = 1;\n\t\t\tif (!ab) {\n\t\t\t\tif (j == 0)return dp[ab][bc][ca][j][t] = 1;\n\t\t\t\telse return dp[ab][bc][ca][j][t] = 0;\n\t\t\t}\n\t\t}\n\t}\n\telse if (t == 1) {\n\t\tnx = 0;\n\t\tif (!ab && !ca&&j != 0) {\n\t\t\tnx = 2;\n\t\t\tif (!bc) {\n\t\t\t\tif (j == 1)return dp[ab][bc][ca][j][t] = 0;\n\t\t\t\telse return dp[ab][bc][ca][j][t] = 1;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tnx = 1;\n\t\tif (!ab && !bc&&j != 1) {\n\t\t\tnx = 0;\n\t\t\tif (!ca) {\n\t\t\t\treturn dp[ab][bc][ca][j][t] = 0;\n\t\t\t}\n\t\t}\n\t}\n\tif (nx == 1) {\n\t\tif (t == 0) {\n\t\t\treturn dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 1);\n\t\t}\n\t\tif (t == 2) {\n\t\t\tif (bc) {\n\t\t\t\tif (ab || ca || j == 0)return dp[ab][bc][ca][j][t] = Search(ab, bc - 1, ca, j, 0);\n\t\t\t\telse return dp[ab][bc][ca][j][t] = Search(ab, bc - 1, ca, j, 1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (ab) {\n\t\t\t\t\tif (ab - 1 || bc || j == 1)return dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 1);\n\t\t\t\t\telse if (bc || ca || j == 2)return dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 2);\n\t\t\t\t\telse return dp[ab][bc][ca][j][t] = 1;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn dp[ab][bc][ca][j][t] = Search(ab, bc, ca - 1, 2, t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (nx == 2) {\n\t\tif (t == 1) {\n\t\t\tif (j == 1) {\n\t\t\t\treturn dp[ab][bc][ca][j][t] = Search(ab, bc - 1, ca, j, 2);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn dp[ab][bc][ca][j][t] = Search(ab, bc - 1, ca, j, 2)*bc / (bc + 1) + Search(ab, bc - 1, ca, 1, 1) / (bc + 1);\n\t\t\t}\n\t\t}\n\t\tif (t == 0) {\n\t\t\tif (ca) {\n\t\t\t\tif (ab || bc || j == 1)return dp[ab][bc][ca][j][t] = Search(ab, bc, ca - 1, j, 1);\n\t\t\t\telse return dp[ab][bc][ca][j][t] = Search(ab, bc, ca - 1, j, 2);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (bc)return dp[ab][bc][ca][j][t] = Search(ab + 1, bc - 1, ca, j, 1);\n\t\t\t\telse dp[ab][bc][ca][j][t] = Search(ab, bc, ca, 0, 1);\n\t\t\t\t//if(bc){\n\t\t\t\t//\tif(j==2)return dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,2);\n\t\t\t\t//\telse dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,0);\n\t\t\t\t//}\n\t\t\t\t//else{\n\t\t\t\t//\tdp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,0);\n\t\t\t\t//}\n\t\t\t}\n\t\t}\n\t}\n\tif (nx == 0) {\n\t\tif (t == 2) {\n\t\t\treturn dp[ab][bc][ca][j][t] = Search(ab, bc, ca - 1, j, 0);\n\t\t}\n\t\tif (t == 1) {\n\t\t\tif (bc || ca || j == 2) {\n\t\t\t\tif (j != 0) {\n\t\t\t\t\treturn dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 2)*ab / (ab + ca) + Search(ab, bc, ca - 1, j, 0)*ca / (ab + ca);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (bc)return dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 2)*ab / (ab + ca + 1) + Search(ab, bc, ca - 1, j, 0)*ca / (ab + ca + 1) + Search(ab, bc - 1, ca, 1, 0) / (ab + ca + 1);\n\t\t\t\t\telse return dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 2)*ab / (ab + ca + 1) + Search(ab, bc, ca - 1, j, 0)*ca / (ab + ca + 1) + Search(ab - 1, bc, ca, 1, 1) / (ab + ca + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (j == 1) {\n\t\t\t\t\treturn dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 0);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 0)*ab / (ab + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tcin >> N;\n\tvector<int>a(101);\n\tvector<int>b(101);\n\tvector<int>c(101);\n\tcin >> M;\n\tfor (int i = 0; i<M; i++) {\n\t\tcin >> K;\n\t\ta[K] ^= 1;\n\t}\n\tcin >> M;\n\tfor (int i = 0; i<M; i++) {\n\t\tcin >> K;\n\t\tb[K] ^= 1;\n\t}\n\tcin >> M;\n\tfor (int i = 0; i<M; i++) {\n\t\tcin >> K;\n\t\tc[K] ^= 1;\n\t}\n\tint ab = 0, bc = 0, ca = 0;\n\tfor (int i = 1; i <= N; i++)ab += a[i] & b[i];\n\tfor (int i = 1; i <= N; i++)bc += b[i] & c[i];\n\tfor (int i = 1; i <= N; i++)ca += c[i] & a[i];\n\tint joker = 0;\n\tif (b[0])joker = 1;\n\tif (c[0])joker = 2;\n\tint turn = 0;\n\tfor (int i = 0; i <= 100; i++)for (int j = 0; j <= 100; j++)for (int k = 0; k <= 100; k++)for (int l = 0; l<3; l++)for (int m = 0; m<3; m++)dp[i][j][k][l][m] = -1;\n\tcout << setprecision(20) << Search(ab, bc, ca, joker, turn) << endl;\n\t//for(int i=0;i<=N;i++)for(int j=0;j<=N;j++)for(int k=0;k<=N;k++)for(int l=0;l<3;l++)for(int m=0;m<3;m++)if(dp[i][j][k][l][m]>=0)cout<<i<<\" \"<<j<<\" \"<<k<<\" \"<<l<<\" \"<<m<<\" \"<<dp[i][j][k][l][m]<<endl;\n\treturn 0;\n}","accuracy":0.09523809523809523,"time_ms":40,"memory_kb":148176,"score_of_the_acc":-1.0515,"final_rank":15},{"submission_id":"aoj_2802_3987680","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nint N,M,K,L,R,H,W;\n//long long int N,M,K,L,R,H,W;\n\nconstexpr long long int MOD=1000000007;\n//constexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n//constexpr long long int MOD=998244353;\n\nconstexpr long double EPS=1e-8;\n\nlong double dp[101][101][101][3][3];\n\ndouble Search(int ab,int bc,int ca,int j,int t){\n\t//cout<<ab<<\" \"<<bc<<\" \"<<ca<<\" \"<<j<<\" \"<<t<<endl;\n\tif(dp[ab][bc][ca][j][t]>=0)return dp[ab][bc][ca][j][t];\n\tif(!ab&&!bc&&!ca){\n\t\tif(j==1)return dp[0][0][0][1][t]=0;\n\t\telse return dp[0][0][0][j][t]=1;\n\t}\n\tif(!ab&&!bc&&j!=1&&t==1)return dp[ab][bc][ca][j][t]=Search(ab,bc,ca,j,2);\n\tif(!bc&&!ca&&j!=2&&t==2)return dp[ab][bc][ca][j][t]=Search(ab,bc,ca,j,0);\n\tif(!ca&&!ab&&j!=0&&t==0)return dp[ab][bc][ca][j][t]=Search(ab,bc,ca,j,1);\n\t//nxが1のとき不正が発生\n\tint nx;\n\tif(t==0){\n\t\tnx=2;\n\t\tif(!bc&&!ca&&j!=2){\n\t\t\tnx=1;\n\t\t\tif(!ab){\n\t\t\t\tif(j==0)return dp[ab][bc][ca][j][t]=1;\n\t\t\t\telse return dp[ab][bc][ca][j][t]=0;\n\t\t\t}\n\t\t}\n\t}\n\telse if(t==1){\n\t\tnx=0;\n\t\tif(!ab&&!ca&&j!=0){\n\t\t\tnx=2;\n\t\t\tif(!bc){\n\t\t\t\tif(j==1)return dp[ab][bc][ca][j][t]=0;\n\t\t\t\telse return dp[ab][bc][ca][j][t]=1;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tnx=1;\n\t\tif(!ab&&!bc&&j!=1){\n\t\t\tnx=0;\n\t\t\tif(!ca){\n\t\t\t\treturn dp[ab][bc][ca][j][t]=0;\n\t\t\t}\n\t\t}\n\t}\n\tif(nx==1){\n\t\tif(t==0){\n\t\t\treturn dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,1);\n\t\t}\n\t\tif(t==2){\n\t\t\tif(bc){\n\t\t\t\tif(ab||ca||j==0)return dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,0);\n\t\t\t\telse return dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,1);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(ab){\n\t\t\t\t\tif(ab-1||bc||j==1)return dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,1);\n\t\t\t\t\telse if(bc||ca||j==2)return dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,2);\n\t\t\t\t\telse return dp[ab][bc][ca][j][t]=1;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\treturn dp[ab][bc][ca][j][t]=Search(ab,bc,ca-1,2,t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(nx==2){\n\t\tif(t==1){\n\t\t\tif(j==1){\n\t\t\t\treturn dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,2);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,2)*bc/(bc+1)+Search(ab,bc-1,ca,1,1)/(bc+1);\n\t\t\t}\n\t\t}\n\t\tif(t==0){\n\t\t\tif(ca){\n\t\t\t\tif(ab||bc||j==1)return dp[ab][bc][ca][j][t]=Search(ab,bc,ca-1,j,1);\n\t\t\t\telse return dp[ab][bc][ca][j][t]=Search(ab,bc,ca-1,j,2);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(bc)return dp[ab][bc][ca][j][t]=Search(ab+1,bc-1,ca,j,1);\n\t\t\t\telse dp[ab][bc][ca][j][t]=Search(ab,bc,ca,0,1);\n\t\t\t\t//if(bc){\n\t\t\t\t//\tif(j==2)return dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,2);\n\t\t\t\t//\telse dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,0);\n\t\t\t\t//}\n\t\t\t\t//else{\n\t\t\t\t//\tdp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,0);\n\t\t\t\t//}\n\t\t\t}\n\t\t}\n\t}\n\tif(nx==0){\n\t\tif(t==2){\n\t\t\treturn dp[ab][bc][ca][j][t]=Search(ab,bc,ca-1,j,0);\n\t\t}\n\t\tif(t==1){\n\t\t\tif(bc||ca||j==2){\n\t\t\t\tif(j!=0){\n\t\t\t\t\treturn dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,2)*ab/(ab+ca)+Search(ab,bc,ca-1,j,0)*ca/(ab+ca);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tif(bc)return dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,2)*ab/(ab+ca+1)+Search(ab,bc,ca-1,j,0)*ca/(ab+ca+1)+Search(ab,bc-1,ca,1,0)/(ab+ca+1);\n\t\t\t\t\telse return dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,2)*ab/(ab+ca+1)+Search(ab,bc,ca-1,j,0)*ca/(ab+ca+1)+Search(ab-1,bc,ca,1,1)/(ab+ca+1);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(j==1){\n\t\t\t\t\treturn dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,0);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\treturn dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,0)*ab/(ab+1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t\n\tcin>>N;\n\tvector<int>a(101);\n\tvector<int>b(101);\n\tvector<int>c(101);\n\tcin>>M;\n\tfor(int i=0;i<M;i++){\n\t\tcin>>K;\n\t\ta[K]^=1;\n\t}\n\tcin>>M;\n\tfor(int i=0;i<M;i++){\n\t\tcin>>K;\n\t\tb[K]^=1;\n\t}\n\tcin>>M;\n\tfor(int i=0;i<M;i++){\n\t\tcin>>K;\n\t\tc[K]^=1;\n\t}\n\tint ab=0,bc=0,ca=0;\n\tfor(int i=1;i<=N;i++)ab+=a[i]&b[i];\n\tfor(int i=1;i<=N;i++)bc+=b[i]&c[i];\n\tfor(int i=1;i<=N;i++)ca+=c[i]&a[i];\n\tint joker=0;\n\tif(b[0])joker=1;\n\tif(c[0])joker=2;\n\tint turn =0;\n\tfor(int i=0;i<=100;i++)for(int j=0;j<=100;j++)for(int k=0;k<=100;k++)for(int l=0;l<3;l++)for(int m=0;m<3;m++)dp[i][j][k][l][m]=-1;\n\tcout<<setprecision(20)<<Search(ab,bc,ca,joker,turn)<<endl;\n\t//for(int i=0;i<=N;i++)for(int j=0;j<=N;j++)for(int k=0;k<=N;k++)for(int l=0;l<3;l++)for(int m=0;m<3;m++)if(dp[i][j][k][l][m]>=0)cout<<i<<\" \"<<j<<\" \"<<k<<\" \"<<l<<\" \"<<m<<\" \"<<dp[i][j][k][l][m]<<endl;\n\treturn 0;\n}","accuracy":0.09523809523809523,"time_ms":40,"memory_kb":148184,"score_of_the_acc":-1.0515,"final_rank":16},{"submission_id":"aoj_2802_2915563","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld =long double;\nconst ld eps = 1e-9;\n\n\n//namespace cent {\n//\n//\tstruct Edge {\n//\t\tint src;\n//\t\tint dst;\n//\t\tlong long int cost;\n//\t};\n//\tusing Graph = vector<vector<Edge>>;\n//\n//\tclass Centroid {\n//\tprivate:\n//\t\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tint sum = 1;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ch_nums[now] = sum;\n//\t\t}\n//\n//\t\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tfor (auto&& e : graph[pre_root]) {\n//\t\t\t\tif (e.dst == pre_from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\n//\t\t\t}\n//\t\t\treturn pre_root;\n//\t\t}\n//\n//\t\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\n//\t\t\tmp[make_pair(root,now)]=depth;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tdfs2(g,root,e.dst,e.src,oks,depth+1);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t};\n//\n//\n//\t\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\n//\t\t\tdfs(graph, root, from, ch_nums, oks);\n//\n//\t\t\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\n//\n//\n//\t\t\tdfs2(graph,cent_id,cent_id,-1,oks,0);\n//\t\t\tlens1[cent_id][make_pair(0,0)]--;\n//\t\t\tlens2[cent_id][0]--;\n//\n//\n//\t\t\toks[cent_id] = depth;\n//\n//\t\t\t//for (auto&& e : graph[cent_id]) {\n//\t\t\t//\tif (e.dst == from)continue;\n//\t\t\t//\tif (oks[e.dst] != -1)continue;\n//\n//\t\t\t//\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\n//\n//\t\t\t//\tfor (auto&& l1 : lens1[e.dst]) {\n//\t\t\t//\t\tint keta = l1.first.second;\n//\t\t\t//\t\tlong long int num = l1.first.first;\n//\n//\t\t\t//\t\tlong long int need = (mod - num) / mod_pow(10, keta);\n//\t\t\t//\t\tneed%=mod;\n//\t\t\t//\t\tauto it = lens2[e.dst].find(need);\n//\t\t\t//\t\tif (it != lens2[e.dst].end()) {\n//\t\t\t//\t\t\tans -= l1.second*it->second;\n//\t\t\t//\t\t}\n//\t\t\t//\t}\n//\t\t\t//\tlens1[e.dst].clear();\n//\t\t\t//\tlens2[e.dst].clear();\n//\t\t\t//}\n//\n//\t\t\tif (from != -1) {\n//\t\t\t\tcentroid_edges[from].push_back(cent_id);\n//\t\t\t}\n//\t\t\telse {\n//\t\t\t\tfst_centroid = cent_id;\n//\t\t\t}\n//\t\t\tfor (auto&& e : graph[cent_id]) {\n//\t\t\t\tif (e.dst == from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\n//\t\t\t}\n//\t\t}\n//\n//\tpublic:\n//\n//\t\tmap<pair<int,int>,int>mp;\n//\n//\t\tvector<map<pair<long long int,int>, long long int>>lens1;\n//\t\tvector<map<long long int, long long int>>lens2;\n//\t\tvector<vector<int>> centroid_graph;\n//\t\tvector<int>ts;\n//\t\tvector<int>parents;\n//\t\tvector<int>oks;\n//\t\tvector<int>anss;\n//\n//\t\t//fst:root snd:centroid_graph\n//\t\tvoid init(const Graph&g) {\n//\t\t\tlens1.resize(g.size());\n//\t\t\tlens2.resize(g.size());\n//\t\t\toks = vector<int>(g.size(), -1);\n//\t\t\tint root = -1;\n//\t\t\tcentroid_graph.resize(g.size());\n//\t\t\tparents = vector<int>(g.size(), -1);\n//\t\t\tts=vector<int>(g.size(),-1);\n//\t\t\tanss=vector<int>(g.size(),100000);\n//\n//\t\t\tvector<int>ch_nums(g.size());\n//\t\t\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\n//\n//\t\t\tfor (int i = 0; i < centroid_graph.size(); ++i) {\n//\t\t\t\tfor (auto&& e : centroid_graph[i]) {\n//\t\t\t\t\tparents[e] = i;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ;\n//\t\t}\n//\t}centroid;\n//\n//\n//\tvoid addEdge(Graph& g, int a, int b, long long int c) {\n//\t\tg[a].push_back(Edge{ a,b,c });\n//\t\tg[b].push_back(Edge{ b,a,c });\n//\t}\n//}\n\n\n//const int mod = 1000000007;\n//struct Mod {\n//public:\n//\tint num;\n//\tMod() : Mod(0) { ; }\n//\tMod(long long int n) : num((n % mod + mod) % mod) {\n//\t\tstatic_assert(mod<INT_MAX / 2, \"mod is too big, please make num 'long long int' from 'int'\");\n//\t}\n//\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\n//\toperator int() { return num; }\n//};\n//\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\n//Mod operator++(Mod &a) { return a + Mod(1); }\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\n//Mod operator--(Mod &a) { return a - Mod(1); }\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\n//Mod operator^(const Mod a, const int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = (a * a) ^ (n / 2);\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//Mod mod_pow(const Mod a, const long long int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = mod_pow((a * a), (n / 2));\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\n//Mod operator/(const Mod a, const Mod b) {\n//\tassert(b.num != 0);\n//\treturn a * inv(b);\n//}\n//Mod operator/(const long long int a, const Mod b) {\n//\treturn Mod(a) / b;\n//}\n//Mod operator/=(Mod &a, const Mod b) {\n//\treturn a = a / b;\n//}\n//\n//#define MAX_MOD_N 1024000\n//\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\n//void init(const int amax = MAX_MOD_N) {\n//\tfact[0] = Mod(1); factinv[0] = 1;\n//\tfor (int i = 0; i < amax - 1; ++i) {\n//\t\tfact[i + 1] = fact[i] * Mod(i + 1);\n//\t\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\n//\t}\n//}\n//Mod comb(const int a, const int b) {\n//\treturn fact[a] * factinv[b] * factinv[a - b];\n//}\n//\n//vector<int>primes;\n//void hurui(const int amax=3500) {\n//\tstatic bool flag = false;\n//\tif (flag)return;\n//\tvector<int>sos;\n//\tsos = vector<int>(amax + 1, true);\n//\tsos[0] = false; sos[1] = false;\n//\tfor (int i = 2; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\n//\t\t}\n//\t}\n//\tfor (int i = 0; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tprimes.push_back(i);\n//\t\t}\n//\t}\n//\tflag = true;\n//}\n//\n//\n//struct query {\n//\tint u;\n//\tint v;\n//\tmap<int,int>mp;\n//};\n//\n//map<int, int>mk_mp(const int a) {\n//\tint rest(a);\n//\tmap<int,int>as;\n//\tfor (auto pr : primes) {\n//\t\twhile (rest%pr == 0) {\n//\t\t\tas[pr]++;\n//\t\t\trest /= pr;\n//\t\t}\n//\t}\n//\tif (rest!=1)as[rest]++;\n//\treturn as;\n//}\n//\n//#define Seg_Max_N (1<<18) \n//\n//class Tree {\n//public:\n//\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\n//\t\tT.resize(V);\n//\t\tfor (int i = 0; i < MAXLOGV; i++) {\n//\t\t\tparent[i].resize(V);\n//\t\t}\n//\t\tdepth.resize(V);\n//\t}\n//\t// uとvをつなぐ\n//\t// lcaを求めることが主目的なので無向グラフとしている\n//\tvoid unite(int u, int v) {\n//\t\tT[u].push_back(v);\n//\t\tT[v].push_back(u);\n//\t}\n//\tvoid unite(vector<vector<int>>&e) {\n//\t\tT = e;\n//\t}\n//\t// initする\n//\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\n//\tvoid init() {\n//\t\tdfs(root, 0, 0);\n//\t\tint id = 0;\n//\t\tgetid(root, 0, id);\n//\t}\n//\t// uとvのlcaを求める\n//\tint lca(int u, int v) const {\n//\t\tif (depth[u] > depth[v]) swap(u, v);\n//\t\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\t// uとvの距離を求める\n//\t// edgeを定義しないといけない時はこれじゃダメ\n//\tint dist(int u, int v) const {\n//\t\tint p = lca(u, v);\n//\t\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\n//\t}\n//\tint dfs(int v, int p, int d) {\n//\t\tparent[0][v] = p;\n//\t\tdepth[v] = d;\n//\t\tcnum[v] = 0;\n//\t\tfor (int i = 1; i < MAXLOGV; i++) {\n//\t\t\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\n//\t\t}\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) cnum[v] += dfs(next, v, d + 1);\n//\t\t}\n//\t\treturn cnum[v] + 1;\n//\t}\n//\n//\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) dfs2(next, v, doubles, nums);\n//\t\t}\n//\t\tdoubles[0][v] = nums[v];\n//\t\tfor (int j = 1; j < MAXLOGV; ++j) {\n//\t\t\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\n//\t\t}\n//\t\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\n//\t\t\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\n//\t\t}\n//\t}\n//\t//ここでは親から距離2^iの部分木の最小値を求めている\n//\tvector<vector<int>>get_doubles(const vector<int>&nums) {\n//\t\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\n//\t\tdfs2(root, -1, doubles, nums);\n//\t\treturn doubles;\n//\t}\n//\n//\tvoid getid(const int v, const int p, int &nplace) {\n//\t\tplace[v] = nplace;\n//\t\tid[nplace] = v;\n//\t\tnplace++;\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) getid(next, v, nplace);\n//\t\t}\n//\t}\n//\tstatic const int MAXLOGV = 25;\n//\t// グラフの隣接リスト表現\n//\tvector<vector<int> > T;\n//\t// 頂点の数\n//\tint V;\n//\t// 根ノードの番号\n//\tint root;\n//\n//\t// 親ノード\n//\tvector<int> parent[MAXLOGV];\n//\t// 根からの深さ\n//\tvector<int> depth;\n//\n//\t//子の数\n//\tvector<int>cnum;\n//\n//\t//変換\n//\tvector<int>place;\n//\tvector<int>id;\n//\n//};\n//\n//vector<int>pas;\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\n//\ttos[now]=id;\n//\tlrs[tos[now]].first=id++;\n//\tfor (auto e : edges[now]) {\n//\t\tif (e == from) {\n//\t\t\tpas[now] = from;\n//\t\t\tcontinue;\n//\t\t}\n//\t\tadfs(lrs,tos,edges,e,now,id);\n//\t}\n//\tlrs[tos[now]].second=id;\n//}\n//\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\n//\tpas.resize(tos.size());pas[0]=-1;\n//\tvector<pair<int,int>>lrs(edges.size());\n//\tint id=0;\n//\tadfs(lrs,tos,edges,0,-1,id);\n//\treturn lrs;\n//}\n\n\nld memo[101][101][101][3][3];\n\nld solve(int a, int b, int c, int d, int e) ;\n\nld solve(vector<int>v, int joker, int player) {\n\tif(!(v[0]>=0&&v[1]>=0&&v[2]>=0&&joker>=0&&joker<=2&&player>=0&&player<=2))return 0;\n\tif (memo[v[0]][v[1]][v[2]][joker][player] < -0.5) {\n\t\tif (v[0] == 0 && v[1] == 0 && v[2] == 0) {\n\t\t\tif (joker == 1) {\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=0;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=1;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tconst int n_player=(player+1)%3;\n\t\t\t// A no card\n\t\t\tif (v[0] == 0 && v[2] == 0 && joker != 0) {\n\t\t\t\tif (player == 0) {\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = solve(v, joker, n_player);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tconst int drawn_player=(player^3);\n\t\t\t\t\tld ans = 0;\n\t\t\t\t\tif (drawn_player == 2) {\n\t\t\t\t\t\tans+=(joker==drawn_player)*solve(v,player, n_player);\n\t\t\t\t\t\tans+=v[1]*solve(v[0],v[1]-1,v[2],joker, n_player);\n\n\t\t\t\t\t\tans/=(joker==2)+v[1];\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tassert(v[1]);\n\t\t\t\t\t\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\n\t\t\t\t\t}\n\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=ans;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// B no card\n\t\t\telse if (v[0] == 0 && v[1] == 0 && joker != 1) {\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = 1;\n\t\t\t}\n\t\t\t// C no card\n\t\t\telse if (v[1] == 0 && v[2] == 0 && joker != 2) {\n\t\t\t\tif (player == 2) {\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=solve(v,joker,n_player);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tconst int drawn_player = (player ^ 1);\n\t\t\t\t\tld ans = 0;\n\t\t\t\t\tif (drawn_player==0) {\n\t\t\t\t\t\tans += (joker == drawn_player)*solve(v, player ,n_player);\n\t\t\t\t\t\tans += v[0]*solve(v[0]-1, v[1], v[2], joker, n_player);\n\n\t\t\t\t\t\tassert((joker==0)+v[0]>=1);\n\t\t\t\t\t\tans /= (joker == 0) + v[0];\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tassert(v[0]);\n\t\t\t\t\t\tans = solve(v[0]-1, v[1], v[2], joker, n_player);\n\t\t\t\t\t}\n\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tld ans=0;\n\t\t\t\tint drawn_player=(player+2)%3;\n\t\t\t\tif (player == 0) {\n\t\t\t\t\tans+=v[1]*solve(v[0]+1,v[1]-1,v[2],joker,n_player);\n\t\t\t\t\tans+=v[2]*solve(v[0],v[1],v[2]-1,joker,n_player);\n\t\t\t\t\tans+=(joker==2)*solve(v[0],v[1],v[2],0,n_player);\n\n\t\t\t\t\tassert(v[1]+v[2]+(joker==2)>=1);\n\t\t\t\t\tans/=v[1]+v[2]+(joker==2);\n\t\t\t\t}\n\t\t\t\telse if (player == 1) {\n\t\t\t\t\tans+=v[2]*solve(v[0],v[1]+1,v[2]-1,joker,n_player);\n\t\t\t\t\tans+=v[0]*solve(v[0]-1,v[1],v[2],joker,n_player);\n\t\t\t\t\tans+=(joker==0)*solve(v[0],v[1],v[2],1,n_player);\n\n\t\t\t\t\tassert(v[2]+v[0]+(joker==0)>=1);\n\t\t\t\t\tans/=v[2]+v[0]+(joker==0);\n\t\t\t\t}\n\t\t\t\telse if (player == 2) {\n\t\t\t\t\tif (v[1]) {\n\t\t\t\t\t\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\n\t\t\t\t\t}\n\t\t\t\t\telse if (v[0]) {\n\t\t\t\t\t\tans=solve(v[0]-1,v[1],v[2]+1,joker,n_player);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tassert(joker==1);\n\t\t\t\t\t\tans=solve(v,player,n_player);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\n\t\t\t}\n\t\t}\n\t}\n\treturn memo[v[0]][v[1]][v[2]][joker][player];\n}\n\nld solve(int a, int b, int c, int d, int e) {\n\treturn solve(vector<int>{a, b, c},d,e);\n}\n\nint main()\n{\n\n\tint AB=0,BC=0,CA=0;\n\tint joker=-1;\n\n\tfor (int i = 0; i < 101; ++i) {\n\t\tfor (int j = 0; j < 101; ++j) {\n\t\t\tfor (int k = 0; k < 101; ++k) {\n\t\t\t\tfor (int l = 0; l < 3; ++l) {\n\t\t\t\t\tfor (int m = 0; m < 3; ++m) {\n\t\t\t\t\t\tmemo[i][j][k][l][m]=-1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tint N; cin >> N;\n\n\t\tvector<vector<int>>nums(3, vector<int>(101));\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tint m; cin >> m;\n\t\t\tmap<int, int>mp;\n\t\t\twhile (m--) {\n\t\t\t\tint a; cin >> a;\n\t\t\t\tmp[a]++;\n\t\t\t}\n\t\t\tfor (auto m : mp) {\n\t\t\t\tif (m.second % 2)nums[i][m.first]++;\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i <= N; ++i) {\n\t\t\tif (i == 0) {\n\t\t\t\tfor (int j = 0; j < 3; ++j) {\n\t\t\t\t\tif (nums[j][i]) {\n\t\t\t\t\t\tjoker=j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (nums[0][i] && nums[1][i]) {\n\t\t\t\t\tAB++;\n\t\t\t\t}\n\t\t\t\telse if (nums[1][i] && nums[2][i]) {\n\t\t\t\t\tBC++;\n\t\t\t\t}\n\t\t\t\telse if (nums[2][i] && nums[0][i]) {\n\t\t\t\t\tCA++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tld ans=solve(AB,BC,CA,joker,0);\n\n\tcout<<setprecision(10)<<fixed<<double(ans)<<endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":148208,"score_of_the_acc":-1.0862,"final_rank":4},{"submission_id":"aoj_2802_2915543","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = __float128;\nconst ld eps = 1e-9;\n\n\n//namespace cent {\n//\n//\tstruct Edge {\n//\t\tint src;\n//\t\tint dst;\n//\t\tlong long int cost;\n//\t};\n//\tusing Graph = vector<vector<Edge>>;\n//\n//\tclass Centroid {\n//\tprivate:\n//\t\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tint sum = 1;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ch_nums[now] = sum;\n//\t\t}\n//\n//\t\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tfor (auto&& e : graph[pre_root]) {\n//\t\t\t\tif (e.dst == pre_from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\n//\t\t\t}\n//\t\t\treturn pre_root;\n//\t\t}\n//\n//\t\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\n//\t\t\tmp[make_pair(root,now)]=depth;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tdfs2(g,root,e.dst,e.src,oks,depth+1);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t};\n//\n//\n//\t\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\n//\t\t\tdfs(graph, root, from, ch_nums, oks);\n//\n//\t\t\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\n//\n//\n//\t\t\tdfs2(graph,cent_id,cent_id,-1,oks,0);\n//\t\t\tlens1[cent_id][make_pair(0,0)]--;\n//\t\t\tlens2[cent_id][0]--;\n//\n//\n//\t\t\toks[cent_id] = depth;\n//\n//\t\t\t//for (auto&& e : graph[cent_id]) {\n//\t\t\t//\tif (e.dst == from)continue;\n//\t\t\t//\tif (oks[e.dst] != -1)continue;\n//\n//\t\t\t//\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\n//\n//\t\t\t//\tfor (auto&& l1 : lens1[e.dst]) {\n//\t\t\t//\t\tint keta = l1.first.second;\n//\t\t\t//\t\tlong long int num = l1.first.first;\n//\n//\t\t\t//\t\tlong long int need = (mod - num) / mod_pow(10, keta);\n//\t\t\t//\t\tneed%=mod;\n//\t\t\t//\t\tauto it = lens2[e.dst].find(need);\n//\t\t\t//\t\tif (it != lens2[e.dst].end()) {\n//\t\t\t//\t\t\tans -= l1.second*it->second;\n//\t\t\t//\t\t}\n//\t\t\t//\t}\n//\t\t\t//\tlens1[e.dst].clear();\n//\t\t\t//\tlens2[e.dst].clear();\n//\t\t\t//}\n//\n//\t\t\tif (from != -1) {\n//\t\t\t\tcentroid_edges[from].push_back(cent_id);\n//\t\t\t}\n//\t\t\telse {\n//\t\t\t\tfst_centroid = cent_id;\n//\t\t\t}\n//\t\t\tfor (auto&& e : graph[cent_id]) {\n//\t\t\t\tif (e.dst == from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\n//\t\t\t}\n//\t\t}\n//\n//\tpublic:\n//\n//\t\tmap<pair<int,int>,int>mp;\n//\n//\t\tvector<map<pair<long long int,int>, long long int>>lens1;\n//\t\tvector<map<long long int, long long int>>lens2;\n//\t\tvector<vector<int>> centroid_graph;\n//\t\tvector<int>ts;\n//\t\tvector<int>parents;\n//\t\tvector<int>oks;\n//\t\tvector<int>anss;\n//\n//\t\t//fst:root snd:centroid_graph\n//\t\tvoid init(const Graph&g) {\n//\t\t\tlens1.resize(g.size());\n//\t\t\tlens2.resize(g.size());\n//\t\t\toks = vector<int>(g.size(), -1);\n//\t\t\tint root = -1;\n//\t\t\tcentroid_graph.resize(g.size());\n//\t\t\tparents = vector<int>(g.size(), -1);\n//\t\t\tts=vector<int>(g.size(),-1);\n//\t\t\tanss=vector<int>(g.size(),100000);\n//\n//\t\t\tvector<int>ch_nums(g.size());\n//\t\t\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\n//\n//\t\t\tfor (int i = 0; i < centroid_graph.size(); ++i) {\n//\t\t\t\tfor (auto&& e : centroid_graph[i]) {\n//\t\t\t\t\tparents[e] = i;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ;\n//\t\t}\n//\t}centroid;\n//\n//\n//\tvoid addEdge(Graph& g, int a, int b, long long int c) {\n//\t\tg[a].push_back(Edge{ a,b,c });\n//\t\tg[b].push_back(Edge{ b,a,c });\n//\t}\n//}\n\n\n//const int mod = 1000000007;\n//struct Mod {\n//public:\n//\tint num;\n//\tMod() : Mod(0) { ; }\n//\tMod(long long int n) : num((n % mod + mod) % mod) {\n//\t\tstatic_assert(mod<INT_MAX / 2, \"mod is too big, please make num 'long long int' from 'int'\");\n//\t}\n//\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\n//\toperator int() { return num; }\n//};\n//\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\n//Mod operator++(Mod &a) { return a + Mod(1); }\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\n//Mod operator--(Mod &a) { return a - Mod(1); }\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\n//Mod operator^(const Mod a, const int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = (a * a) ^ (n / 2);\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//Mod mod_pow(const Mod a, const long long int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = mod_pow((a * a), (n / 2));\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\n//Mod operator/(const Mod a, const Mod b) {\n//\tassert(b.num != 0);\n//\treturn a * inv(b);\n//}\n//Mod operator/(const long long int a, const Mod b) {\n//\treturn Mod(a) / b;\n//}\n//Mod operator/=(Mod &a, const Mod b) {\n//\treturn a = a / b;\n//}\n//\n//#define MAX_MOD_N 1024000\n//\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\n//void init(const int amax = MAX_MOD_N) {\n//\tfact[0] = Mod(1); factinv[0] = 1;\n//\tfor (int i = 0; i < amax - 1; ++i) {\n//\t\tfact[i + 1] = fact[i] * Mod(i + 1);\n//\t\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\n//\t}\n//}\n//Mod comb(const int a, const int b) {\n//\treturn fact[a] * factinv[b] * factinv[a - b];\n//}\n//\n//vector<int>primes;\n//void hurui(const int amax=3500) {\n//\tstatic bool flag = false;\n//\tif (flag)return;\n//\tvector<int>sos;\n//\tsos = vector<int>(amax + 1, true);\n//\tsos[0] = false; sos[1] = false;\n//\tfor (int i = 2; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\n//\t\t}\n//\t}\n//\tfor (int i = 0; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tprimes.push_back(i);\n//\t\t}\n//\t}\n//\tflag = true;\n//}\n//\n//\n//struct query {\n//\tint u;\n//\tint v;\n//\tmap<int,int>mp;\n//};\n//\n//map<int, int>mk_mp(const int a) {\n//\tint rest(a);\n//\tmap<int,int>as;\n//\tfor (auto pr : primes) {\n//\t\twhile (rest%pr == 0) {\n//\t\t\tas[pr]++;\n//\t\t\trest /= pr;\n//\t\t}\n//\t}\n//\tif (rest!=1)as[rest]++;\n//\treturn as;\n//}\n//\n//#define Seg_Max_N (1<<18) \n//\n//class Tree {\n//public:\n//\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\n//\t\tT.resize(V);\n//\t\tfor (int i = 0; i < MAXLOGV; i++) {\n//\t\t\tparent[i].resize(V);\n//\t\t}\n//\t\tdepth.resize(V);\n//\t}\n//\t// uとvをつなぐ\n//\t// lcaを求めることが主目的なので無向グラフとしている\n//\tvoid unite(int u, int v) {\n//\t\tT[u].push_back(v);\n//\t\tT[v].push_back(u);\n//\t}\n//\tvoid unite(vector<vector<int>>&e) {\n//\t\tT = e;\n//\t}\n//\t// initする\n//\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\n//\tvoid init() {\n//\t\tdfs(root, 0, 0);\n//\t\tint id = 0;\n//\t\tgetid(root, 0, id);\n//\t}\n//\t// uとvのlcaを求める\n//\tint lca(int u, int v) const {\n//\t\tif (depth[u] > depth[v]) swap(u, v);\n//\t\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\t// uとvの距離を求める\n//\t// edgeを定義しないといけない時はこれじゃダメ\n//\tint dist(int u, int v) const {\n//\t\tint p = lca(u, v);\n//\t\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\n//\t}\n//\tint dfs(int v, int p, int d) {\n//\t\tparent[0][v] = p;\n//\t\tdepth[v] = d;\n//\t\tcnum[v] = 0;\n//\t\tfor (int i = 1; i < MAXLOGV; i++) {\n//\t\t\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\n//\t\t}\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) cnum[v] += dfs(next, v, d + 1);\n//\t\t}\n//\t\treturn cnum[v] + 1;\n//\t}\n//\n//\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) dfs2(next, v, doubles, nums);\n//\t\t}\n//\t\tdoubles[0][v] = nums[v];\n//\t\tfor (int j = 1; j < MAXLOGV; ++j) {\n//\t\t\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\n//\t\t}\n//\t\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\n//\t\t\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\n//\t\t}\n//\t}\n//\t//ここでは親から距離2^iの部分木の最小値を求めている\n//\tvector<vector<int>>get_doubles(const vector<int>&nums) {\n//\t\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\n//\t\tdfs2(root, -1, doubles, nums);\n//\t\treturn doubles;\n//\t}\n//\n//\tvoid getid(const int v, const int p, int &nplace) {\n//\t\tplace[v] = nplace;\n//\t\tid[nplace] = v;\n//\t\tnplace++;\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) getid(next, v, nplace);\n//\t\t}\n//\t}\n//\tstatic const int MAXLOGV = 25;\n//\t// グラフの隣接リスト表現\n//\tvector<vector<int> > T;\n//\t// 頂点の数\n//\tint V;\n//\t// 根ノードの番号\n//\tint root;\n//\n//\t// 親ノード\n//\tvector<int> parent[MAXLOGV];\n//\t// 根からの深さ\n//\tvector<int> depth;\n//\n//\t//子の数\n//\tvector<int>cnum;\n//\n//\t//変換\n//\tvector<int>place;\n//\tvector<int>id;\n//\n//};\n//\n//vector<int>pas;\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\n//\ttos[now]=id;\n//\tlrs[tos[now]].first=id++;\n//\tfor (auto e : edges[now]) {\n//\t\tif (e == from) {\n//\t\t\tpas[now] = from;\n//\t\t\tcontinue;\n//\t\t}\n//\t\tadfs(lrs,tos,edges,e,now,id);\n//\t}\n//\tlrs[tos[now]].second=id;\n//}\n//\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\n//\tpas.resize(tos.size());pas[0]=-1;\n//\tvector<pair<int,int>>lrs(edges.size());\n//\tint id=0;\n//\tadfs(lrs,tos,edges,0,-1,id);\n//\treturn lrs;\n//}\n\n\nld memo[101][101][101][3][3];\n\nld solve(int a, int b, int c, int d, int e) ;\n\nld solve(vector<int>v, int joker, int player) {\n\tif(!(v[0]>=0&&v[1]>=0&&v[2]>=0&&joker>=0&&joker<=2&&player>=0&&player<=2))return 0;\n\tif (memo[v[0]][v[1]][v[2]][joker][player] < -0.5) {\n\t\tif (v[0] == 0 && v[1] == 0 && v[2] == 0) {\n\t\t\tif (joker == 1) {\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=0;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=1;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tconst int n_player=(player+1)%3;\n\t\t\t// A no card\n\t\t\tif (v[0] == 0 && v[2] == 0 && joker != 0) {\n\t\t\t\tif (player == 0) {\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = solve(v, joker, n_player);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tconst int drawn_player=(player^3);\n\t\t\t\t\tld ans = 0;\n\t\t\t\t\tif (drawn_player == 2) {\n\t\t\t\t\t\tans+=(joker==drawn_player)*solve(v,1, n_player);\n\t\t\t\t\t\tans+=v[1]*solve(v[0],v[1]-1,v[2],2, n_player);\n\n\t\t\t\t\t\tans/=(joker==2)+v[1];\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tassert(v[1]);\n\t\t\t\t\t\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\n\t\t\t\t\t}\n\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=ans;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// B no card\n\t\t\telse if (v[0] == 0 && v[1] == 0 && joker != 1) {\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = 1;\n\t\t\t}\n\t\t\t// C no card\n\t\t\telse if (v[1] == 0 && v[2] == 0 && joker != 2) {\n\t\t\t\tif (player == 2) {\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=solve(v,joker,n_player);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tconst int drawn_player = (player ^ 1);\n\t\t\t\t\tld ans = 0;\n\t\t\t\t\tif (drawn_player==0) {\n\t\t\t\t\t\tans += (joker == drawn_player)*solve(v, player ,n_player);\n\t\t\t\t\t\tans += v[0]*solve(v[0]-1, v[1], v[2], joker, n_player);\n\n\t\t\t\t\t\tassert((joker==0)+v[0]>=1);\n\t\t\t\t\t\tans /= (joker == 0) + v[0];\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tassert(v[0]);\n\t\t\t\t\t\tans = solve(v[0]-1, v[1], v[2], joker, n_player);\n\t\t\t\t\t}\n\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tld ans=0;\n\t\t\t\tint drawn_player=(player+2)%3;\n\t\t\t\tif (player == 0) {\n\t\t\t\t\tans+=v[1]*solve(v[0]+1,v[1]-1,v[2],joker,n_player);\n\t\t\t\t\tans+=v[2]*solve(v[0],v[1],v[2]-1,joker,n_player);\n\t\t\t\t\tans+=(joker==2)*solve(v[0],v[1],v[2],0,n_player);\n\n\t\t\t\t\tassert(v[1]+v[2]+(joker==2)>=1);\n\t\t\t\t\tans/=v[1]+v[2]+(joker==2);\n\t\t\t\t}\n\t\t\t\telse if (player == 1) {\n\t\t\t\t\tans+=v[2]*solve(v[0],v[1]+1,v[2]-1,joker,n_player);\n\t\t\t\t\tans+=v[0]*solve(v[0]-1,v[1],v[2],joker,n_player);\n\t\t\t\t\tans+=(joker==0)*solve(v[0],v[1],v[2],1,n_player);\n\n\t\t\t\t\tassert(v[2]+v[0]+(joker==0)>=1);\n\t\t\t\t\tans/=v[2]+v[0]+(joker==0);\n\t\t\t\t}\n\t\t\t\telse if (player == 2) {\n\t\t\t\t\tif (v[1]) {\n\t\t\t\t\t\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\n\t\t\t\t\t}\n\t\t\t\t\telse if (v[0]) {\n\t\t\t\t\t\tans=solve(v[0]-1,v[1],v[2]+1,joker,n_player);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tans=solve(v,player,n_player);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\n\t\t\t}\n\t\t}\n\t}\n\treturn memo[v[0]][v[1]][v[2]][joker][player];\n}\n\nld solve(int a, int b, int c, int d, int e) {\n\treturn solve(vector<int>{a, b, c},d,e);\n}\n\nint main()\n{\n\n\tint AB=0,BC=0,CA=0;\n\tint joker=-1;\n\n\tfor (int i = 0; i < 101; ++i) {\n\t\tfor (int j = 0; j < 101; ++j) {\n\t\t\tfor (int k = 0; k < 101; ++k) {\n\t\t\t\tfor (int l = 0; l < 3; ++l) {\n\t\t\t\t\tfor (int m = 0; m < 3; ++m) {\n\t\t\t\t\t\tmemo[i][j][k][l][m]=-1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tint N; cin >> N;\n\n\t\tvector<vector<int>>nums(3, vector<int>(101));\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tint m; cin >> m;\n\t\t\tmap<int, int>mp;\n\t\t\twhile (m--) {\n\t\t\t\tint a; cin >> a;\n\t\t\t\tmp[a]++;\n\t\t\t}\n\t\t\tfor (auto m : mp) {\n\t\t\t\tif (m.second % 2)nums[i][m.first]++;\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i <= N; ++i) {\n\t\t\tif (i == 0) {\n\t\t\t\tfor (int j = 0; j < 3; ++j) {\n\t\t\t\t\tif (nums[j][i]) {\n\t\t\t\t\t\tjoker=j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (nums[0][i] && nums[1][i]) {\n\t\t\t\t\tAB++;\n\t\t\t\t}\n\t\t\t\telse if (nums[1][i] && nums[2][i]) {\n\t\t\t\t\tBC++;\n\t\t\t\t}\n\t\t\t\telse if (nums[2][i] && nums[0][i]) {\n\t\t\t\t\tCA++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tld ans=solve(AB,BC,CA,joker,0);\n\n\tcout<<setprecision(10)<<fixed<<double(ans)<<endl;\n\t\n\treturn 0;\n}","accuracy":0.11904761904761904,"time_ms":40,"memory_kb":148148,"score_of_the_acc":-1.0513,"final_rank":7},{"submission_id":"aoj_2802_2915527","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n//namespace cent {\n//\n//\tstruct Edge {\n//\t\tint src;\n//\t\tint dst;\n//\t\tlong long int cost;\n//\t};\n//\tusing Graph = vector<vector<Edge>>;\n//\n//\tclass Centroid {\n//\tprivate:\n//\t\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tint sum = 1;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ch_nums[now] = sum;\n//\t\t}\n//\n//\t\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\n//\t\t\tfor (auto&& e : graph[pre_root]) {\n//\t\t\t\tif (e.dst == pre_from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\n//\t\t\t}\n//\t\t\treturn pre_root;\n//\t\t}\n//\n//\t\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\n//\t\t\tmp[make_pair(root,now)]=depth;\n//\t\t\tfor (auto &&e : g[now]) {\n//\t\t\t\tif (e.dst == from || oks[e.dst] != -1)continue;\n//\t\t\t\telse {\n//\t\t\t\t\tdfs2(g,root,e.dst,e.src,oks,depth+1);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t};\n//\n//\n//\t\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\n//\t\t\tdfs(graph, root, from, ch_nums, oks);\n//\n//\t\t\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\n//\n//\n//\t\t\tdfs2(graph,cent_id,cent_id,-1,oks,0);\n//\t\t\tlens1[cent_id][make_pair(0,0)]--;\n//\t\t\tlens2[cent_id][0]--;\n//\n//\n//\t\t\toks[cent_id] = depth;\n//\n//\t\t\t//for (auto&& e : graph[cent_id]) {\n//\t\t\t//\tif (e.dst == from)continue;\n//\t\t\t//\tif (oks[e.dst] != -1)continue;\n//\n//\t\t\t//\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\n//\n//\t\t\t//\tfor (auto&& l1 : lens1[e.dst]) {\n//\t\t\t//\t\tint keta = l1.first.second;\n//\t\t\t//\t\tlong long int num = l1.first.first;\n//\n//\t\t\t//\t\tlong long int need = (mod - num) / mod_pow(10, keta);\n//\t\t\t//\t\tneed%=mod;\n//\t\t\t//\t\tauto it = lens2[e.dst].find(need);\n//\t\t\t//\t\tif (it != lens2[e.dst].end()) {\n//\t\t\t//\t\t\tans -= l1.second*it->second;\n//\t\t\t//\t\t}\n//\t\t\t//\t}\n//\t\t\t//\tlens1[e.dst].clear();\n//\t\t\t//\tlens2[e.dst].clear();\n//\t\t\t//}\n//\n//\t\t\tif (from != -1) {\n//\t\t\t\tcentroid_edges[from].push_back(cent_id);\n//\t\t\t}\n//\t\t\telse {\n//\t\t\t\tfst_centroid = cent_id;\n//\t\t\t}\n//\t\t\tfor (auto&& e : graph[cent_id]) {\n//\t\t\t\tif (e.dst == from)continue;\n//\t\t\t\tif (oks[e.dst] != -1)continue;\n//\t\t\t\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\n//\t\t\t}\n//\t\t}\n//\n//\tpublic:\n//\n//\t\tmap<pair<int,int>,int>mp;\n//\n//\t\tvector<map<pair<long long int,int>, long long int>>lens1;\n//\t\tvector<map<long long int, long long int>>lens2;\n//\t\tvector<vector<int>> centroid_graph;\n//\t\tvector<int>ts;\n//\t\tvector<int>parents;\n//\t\tvector<int>oks;\n//\t\tvector<int>anss;\n//\n//\t\t//fst:root snd:centroid_graph\n//\t\tvoid init(const Graph&g) {\n//\t\t\tlens1.resize(g.size());\n//\t\t\tlens2.resize(g.size());\n//\t\t\toks = vector<int>(g.size(), -1);\n//\t\t\tint root = -1;\n//\t\t\tcentroid_graph.resize(g.size());\n//\t\t\tparents = vector<int>(g.size(), -1);\n//\t\t\tts=vector<int>(g.size(),-1);\n//\t\t\tanss=vector<int>(g.size(),100000);\n//\n//\t\t\tvector<int>ch_nums(g.size());\n//\t\t\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\n//\n//\t\t\tfor (int i = 0; i < centroid_graph.size(); ++i) {\n//\t\t\t\tfor (auto&& e : centroid_graph[i]) {\n//\t\t\t\t\tparents[e] = i;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn ;\n//\t\t}\n//\t}centroid;\n//\n//\n//\tvoid addEdge(Graph& g, int a, int b, long long int c) {\n//\t\tg[a].push_back(Edge{ a,b,c });\n//\t\tg[b].push_back(Edge{ b,a,c });\n//\t}\n//}\n\n\n//const int mod = 1000000007;\n//struct Mod {\n//public:\n//\tint num;\n//\tMod() : Mod(0) { ; }\n//\tMod(long long int n) : num((n % mod + mod) % mod) {\n//\t\tstatic_assert(mod<INT_MAX / 2, \"mod is too big, please make num 'long long int' from 'int'\");\n//\t}\n//\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\n//\toperator int() { return num; }\n//};\n//\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\n//Mod operator++(Mod &a) { return a + Mod(1); }\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\n//Mod operator--(Mod &a) { return a - Mod(1); }\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\n//Mod operator^(const Mod a, const int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = (a * a) ^ (n / 2);\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//Mod mod_pow(const Mod a, const long long int n) {\n//\tif (n == 0) return Mod(1);\n//\tMod res = mod_pow((a * a), (n / 2));\n//\tif (n % 2) res = res * a;\n//\treturn res;\n//}\n//\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\n//Mod operator/(const Mod a, const Mod b) {\n//\tassert(b.num != 0);\n//\treturn a * inv(b);\n//}\n//Mod operator/(const long long int a, const Mod b) {\n//\treturn Mod(a) / b;\n//}\n//Mod operator/=(Mod &a, const Mod b) {\n//\treturn a = a / b;\n//}\n//\n//#define MAX_MOD_N 1024000\n//\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\n//void init(const int amax = MAX_MOD_N) {\n//\tfact[0] = Mod(1); factinv[0] = 1;\n//\tfor (int i = 0; i < amax - 1; ++i) {\n//\t\tfact[i + 1] = fact[i] * Mod(i + 1);\n//\t\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\n//\t}\n//}\n//Mod comb(const int a, const int b) {\n//\treturn fact[a] * factinv[b] * factinv[a - b];\n//}\n//\n//vector<int>primes;\n//void hurui(const int amax=3500) {\n//\tstatic bool flag = false;\n//\tif (flag)return;\n//\tvector<int>sos;\n//\tsos = vector<int>(amax + 1, true);\n//\tsos[0] = false; sos[1] = false;\n//\tfor (int i = 2; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\n//\t\t}\n//\t}\n//\tfor (int i = 0; i <= amax; ++i) {\n//\t\tif (sos[i]) {\n//\t\t\tprimes.push_back(i);\n//\t\t}\n//\t}\n//\tflag = true;\n//}\n//\n//\n//struct query {\n//\tint u;\n//\tint v;\n//\tmap<int,int>mp;\n//};\n//\n//map<int, int>mk_mp(const int a) {\n//\tint rest(a);\n//\tmap<int,int>as;\n//\tfor (auto pr : primes) {\n//\t\twhile (rest%pr == 0) {\n//\t\t\tas[pr]++;\n//\t\t\trest /= pr;\n//\t\t}\n//\t}\n//\tif (rest!=1)as[rest]++;\n//\treturn as;\n//}\n//\n//#define Seg_Max_N (1<<18) \n//\n//class Tree {\n//public:\n//\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\n//\t\tT.resize(V);\n//\t\tfor (int i = 0; i < MAXLOGV; i++) {\n//\t\t\tparent[i].resize(V);\n//\t\t}\n//\t\tdepth.resize(V);\n//\t}\n//\t// uとvをつなぐ\n//\t// lcaを求めることが主目的なので無向グラフとしている\n//\tvoid unite(int u, int v) {\n//\t\tT[u].push_back(v);\n//\t\tT[v].push_back(u);\n//\t}\n//\tvoid unite(vector<vector<int>>&e) {\n//\t\tT = e;\n//\t}\n//\t// initする\n//\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\n//\tvoid init() {\n//\t\tdfs(root, 0, 0);\n//\t\tint id = 0;\n//\t\tgetid(root, 0, id);\n//\t}\n//\t// uとvのlcaを求める\n//\tint lca(int u, int v) const {\n//\t\tif (depth[u] > depth[v]) swap(u, v);\n//\t\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\t// uとvの距離を求める\n//\t// edgeを定義しないといけない時はこれじゃダメ\n//\tint dist(int u, int v) const {\n//\t\tint p = lca(u, v);\n//\t\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\n//\t}\n//\tint dfs(int v, int p, int d) {\n//\t\tparent[0][v] = p;\n//\t\tdepth[v] = d;\n//\t\tcnum[v] = 0;\n//\t\tfor (int i = 1; i < MAXLOGV; i++) {\n//\t\t\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\n//\t\t}\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) cnum[v] += dfs(next, v, d + 1);\n//\t\t}\n//\t\treturn cnum[v] + 1;\n//\t}\n//\n//\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) dfs2(next, v, doubles, nums);\n//\t\t}\n//\t\tdoubles[0][v] = nums[v];\n//\t\tfor (int j = 1; j < MAXLOGV; ++j) {\n//\t\t\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\n//\t\t}\n//\t\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\n//\t\t\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\n//\t\t}\n//\t}\n//\t//ここでは親から距離2^iの部分木の最小値を求めている\n//\tvector<vector<int>>get_doubles(const vector<int>&nums) {\n//\t\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\n//\t\tdfs2(root, -1, doubles, nums);\n//\t\treturn doubles;\n//\t}\n//\n//\tvoid getid(const int v, const int p, int &nplace) {\n//\t\tplace[v] = nplace;\n//\t\tid[nplace] = v;\n//\t\tnplace++;\n//\t\tfor (int next : T[v]) {\n//\t\t\tif (next != p) getid(next, v, nplace);\n//\t\t}\n//\t}\n//\tstatic const int MAXLOGV = 25;\n//\t// グラフの隣接リスト表現\n//\tvector<vector<int> > T;\n//\t// 頂点の数\n//\tint V;\n//\t// 根ノードの番号\n//\tint root;\n//\n//\t// 親ノード\n//\tvector<int> parent[MAXLOGV];\n//\t// 根からの深さ\n//\tvector<int> depth;\n//\n//\t//子の数\n//\tvector<int>cnum;\n//\n//\t//変換\n//\tvector<int>place;\n//\tvector<int>id;\n//\n//};\n//\n//vector<int>pas;\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\n//\ttos[now]=id;\n//\tlrs[tos[now]].first=id++;\n//\tfor (auto e : edges[now]) {\n//\t\tif (e == from) {\n//\t\t\tpas[now] = from;\n//\t\t\tcontinue;\n//\t\t}\n//\t\tadfs(lrs,tos,edges,e,now,id);\n//\t}\n//\tlrs[tos[now]].second=id;\n//}\n//\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\n//\tpas.resize(tos.size());pas[0]=-1;\n//\tvector<pair<int,int>>lrs(edges.size());\n//\tint id=0;\n//\tadfs(lrs,tos,edges,0,-1,id);\n//\treturn lrs;\n//}\n\n\nld memo[101][101][101][3][3];\n\nld solve(int a, int b, int c, int d, int e) ;\n\nld solve(vector<int>v, int joker, int player) {\n\tif(!(v[0]>=0&&v[1]>=0&&v[2]>=0&&joker>=0&&joker<=2&&player>=0&&player<=2))return 0;\n\tif (memo[v[0]][v[1]][v[2]][joker][player] < -0.5) {\n\t\tif (v[0] == 0 && v[1] == 0 && v[2] == 0) {\n\t\t\tif (joker == 1) {\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=0;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=1;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tconst int n_player=(player+1)%3;\n\t\t\t// A no card\n\t\t\tif (v[0] == 0 && v[2] == 0 && joker != 0) {\n\t\t\t\tif (player == 0) {\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = solve(v, joker, n_player);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tconst int drawn_player=(player^3);\n\t\t\t\t\tld ans = 0;\n\t\t\t\t\tif (drawn_player == 2) {\n\t\t\t\t\t\tans+=(joker==drawn_player)*solve(v,1, n_player);\n\t\t\t\t\t\tans+=v[1]*solve(v[0],v[1]-1,v[2],2, n_player);\n\n\t\t\t\t\t\tans/=(joker==2)+v[1];\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tassert(v[1]);\n\t\t\t\t\t\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\n\t\t\t\t\t}\n\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=ans;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// B no card\n\t\t\telse if (v[0] == 0 && v[1] == 0 && joker != 1) {\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = 1;\n\t\t\t}\n\t\t\t// C no card\n\t\t\telse if (v[1] == 0 && v[2] == 0 && joker != 2) {\n\t\t\t\tif (player == 2) {\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player]=solve(v,joker,n_player);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tconst int drawn_player = (player ^ 1);\n\t\t\t\t\tld ans = 0;\n\t\t\t\t\tif (drawn_player==0) {\n\t\t\t\t\t\tans += (joker == drawn_player)*solve(v, player ,n_player);\n\t\t\t\t\t\tans += v[0]*solve(v[0]-1, v[1], v[2], joker, n_player);\n\n\t\t\t\t\t\tassert((joker==0)+v[0]>=1);\n\t\t\t\t\t\tans /= (joker == 0) + v[0];\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tassert(v[0]);\n\t\t\t\t\t\tans = solve(v[0]-1, v[1], v[2], joker, n_player);\n\t\t\t\t\t}\n\n\t\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tld ans=0;\n\t\t\t\tint drawn_player=(player+2)%3;\n\t\t\t\tif (player == 0) {\n\t\t\t\t\tans+=v[1]*solve(v[0]+1,v[1]-1,v[2],joker,n_player);\n\t\t\t\t\tans+=v[2]*solve(v[0],v[1],v[2]-1,joker,n_player);\n\t\t\t\t\tans+=(joker==2)*solve(v[0],v[1],v[2],0,n_player);\n\n\t\t\t\t\tassert(v[1]+v[2]+(joker==2)>=1);\n\t\t\t\t\tans/=v[1]+v[2]+(joker==2);\n\t\t\t\t}\n\t\t\t\telse if (player == 1) {\n\t\t\t\t\tans+=v[2]*solve(v[0],v[1]+1,v[2]-1,joker,n_player);\n\t\t\t\t\tans+=v[0]*solve(v[0]-1,v[1],v[2],joker,n_player);\n\t\t\t\t\tans+=(joker==0)*solve(v[0],v[1],v[2],1,n_player);\n\n\t\t\t\t\tassert(v[2]+v[0]+(joker==0)>=1);\n\t\t\t\t\tans/=v[2]+v[0]+(joker==0);\n\t\t\t\t}\n\t\t\t\telse if (player == 2) {\n\t\t\t\t\tif (v[1]) {\n\t\t\t\t\t\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\n\t\t\t\t\t}\n\t\t\t\t\telse if (v[0]) {\n\t\t\t\t\t\tans=solve(v[0]-1,v[1],v[2]+1,joker,n_player);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tans=solve(v,player,n_player);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\n\t\t\t}\n\t\t}\n\t}\n\treturn memo[v[0]][v[1]][v[2]][joker][player];\n}\n\nld solve(int a, int b, int c, int d, int e) {\n\treturn solve(vector<int>{a, b, c},d,e);\n}\n\nint main()\n{\n\n\tint AB=0,BC=0,CA=0;\n\tint joker=-1;\n\n\tfor (int i = 0; i < 101; ++i) {\n\t\tfor (int j = 0; j < 101; ++j) {\n\t\t\tfor (int k = 0; k < 101; ++k) {\n\t\t\t\tfor (int l = 0; l < 3; ++l) {\n\t\t\t\t\tfor (int m = 0; m < 3; ++m) {\n\t\t\t\t\t\tmemo[i][j][k][l][m]=-1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tint N; cin >> N;\n\n\t\tvector<vector<int>>nums(3, vector<int>(101));\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tint m; cin >> m;\n\t\t\tmap<int, int>mp;\n\t\t\twhile (m--) {\n\t\t\t\tint a; cin >> a;\n\t\t\t\tmp[a]++;\n\t\t\t}\n\t\t\tfor (auto m : mp) {\n\t\t\t\tif (m.second % 2)nums[i][m.first]++;\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i <= N; ++i) {\n\t\t\tif (i == 0) {\n\t\t\t\tfor (int j = 0; j < 3; ++j) {\n\t\t\t\t\tif (nums[j][i]) {\n\t\t\t\t\t\tjoker=j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (nums[0][i] && nums[1][i]) {\n\t\t\t\t\tAB++;\n\t\t\t\t}\n\t\t\t\telse if (nums[1][i] && nums[2][i]) {\n\t\t\t\t\tBC++;\n\t\t\t\t}\n\t\t\t\telse if (nums[2][i] && nums[0][i]) {\n\t\t\t\t\tCA++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tld ans=solve(AB,BC,CA,joker,0);\n\n\tcout<<setprecision(10)<<fixed<<ans<<endl;\n\t\n\treturn 0;\n}","accuracy":0.11904761904761904,"time_ms":50,"memory_kb":148168,"score_of_the_acc":-1.0687,"final_rank":8},{"submission_id":"aoj_2802_2390998","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__\",\", __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 1120000000\n\nmap<int, double> memo;\n\ndouble solve(int x, int y, int z, int turn, int joker){\n int idx = (((x*100+y)*100+z)*3+turn)*3+joker;\n if(memo.count(idx)==1) return memo[idx];\n// dbg(x,y,z,turn,joker);\n if(x+y+z==0){\n if(joker==1) return 0;\n else return 1;\n }\n double ans=0;\n if(turn==0){\n double total = x+z+(joker==2);\n if(total==0){\n if(y==0){\n if(joker==0) ans = 1;\n else ans = 0;\n }\n else ans = solve(0,y-1,0,1,joker);\n }\n else {\n if(x>0) ans += x*solve(x-1, y, z, 1, joker);\n if(z>0) ans += z*solve(x, y+1, z-1, 1, joker);\n if(joker==2) ans += solve(x,y,z,1,0);\n ans /= total;\n }\n }\n else if(turn==1){\n double total = x+y+(joker==0);\n if(total==0){\n if(z==0){\n if(joker==1) ans=0;\n else ans=1;\n }\n else {\n if(joker==1) ans = solve(0,0,z-1,2,joker);\n else ans = (solve(0,0,z,2,1) + z*solve(0,0,z-1,2,2)) / (z+1.0);\n }\n }\n else {\n if(x>0) ans += x*solve(x-1,y,z+1,2,joker);\n if(y>0) ans += y*solve(x,y-1,z,2,joker);\n if(joker==0) ans += solve(x,y,z,2,1);\n ans /= total;\n }\n }\n else if(turn==2){\n if(y+z+(joker==1) == 0) ans = 1;\n else if(z>0) ans = solve(x,y,z-1,0,joker);\n else if(y>0) ans = solve(x+1,y-1,z,0,joker);\n else if(joker==1) ans = solve(x,y,z,0,2);\n }\n// else assert(false);\n return memo[idx]=ans;\n}\n\nint main(){\n int n;\n cin>>n;\n vector<int> vec(n,0);\n int joker=-1;\n rep(i,3){\n int m; cin>>m;\n rep(j,m){\n int d; cin>>d;\n if(d==0) joker=i;\n else {\n d--;\n vec[d] ^= (1<<i);\n }\n }\n }\n// assert(joker!=-1);\n\n int x=0,y=0,z=0;\n rep(i,n){\n if(vec[i]==5) x++;\n else if(vec[i]==3) y++;\n else if(vec[i]==6) z++;\n// else if(vec[i]!=0) assert(false);\n }\n\n printf(\"%.8f\\n\", solve(x,y,z,0,joker));\n\n return 0;\n}","accuracy":0.09523809523809523,"time_ms":10,"memory_kb":19252,"score_of_the_acc":0,"final_rank":9},{"submission_id":"aoj_2802_2390855","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__\",\", __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 1120000000\n\nmap<int, double> memo;\n\ndouble solve(int x, int y, int z, int turn, int joker){\n int idx = (((x*100+y)*100+z)*3+turn)*3+joker;\n if(memo.count(idx)==1) return memo[idx];\n// dbg(x,y,z,turn,joker);\n if(x+y+z==0){\n if(joker==1) return 0;\n else return 1;\n }\n double ans=0;\n if(turn==0){\n double total = x+z+(joker==2);\n if(total==0){\n if(y==0){\n if(joker==0) ans = 1;\n else ans = 0;\n }\n else ans = solve(0,y-1,0,1,joker);\n }\n else {\n if(x>0) ans += x*solve(x-1, y, z, 1, joker);\n if(z>0) ans += z*solve(x, y+1, z-1, 1, joker);\n if(joker==2) ans += solve(x,y,z,1,0);\n ans /= total;\n }\n }\n else if(turn==1){\n double total = x+y+(joker==0);\n if(total==0){\n if(z==0){\n if(joker==1) ans=0;\n else ans=1;\n }\n else {\n if(joker==1) ans = solve(0,0,z-1,2,joker);\n else ans = (solve(0,0,z,2,1) + z*solve(0,0,z-1,2,2)) / (z+1.0);\n }\n }\n else {\n if(x>0) ans += x*solve(x-1,y,z+1,2,joker);\n if(y>0) ans += y*solve(x,y-1,z,2,joker);\n if(joker==0) ans += solve(x,y,z,2,1);\n ans /= total;\n }\n }\n else if(turn==2){\n if(y+z+(joker==1) == 0) ans = 1;\n else if(z>0) ans = solve(x,y,z-1,0,joker);\n else if(y>0) ans = solve(x+1,y-1,z,0,joker);\n else if(joker==1) ans = solve(x,y,z,0,2);\n }\n else assert(false);\n return memo[idx]=ans;\n}\n\nint main(){\n int n;\n cin>>n;\n vector<int> vec(n,0);\n int joker=-1;\n rep(i,3){\n int m; cin>>m;\n rep(j,m){\n int d; cin>>d;\n if(d==0) joker=i;\n else {\n d--;\n vec[d] ^= (1<<i);\n }\n }\n }\n assert(joker!=-1);\n\n int x=0,y=0,z=0;\n rep(i,n){\n if(vec[i]==5) x++;\n else if(vec[i]==3) y++;\n else if(vec[i]==6) z++;\n else if(vec[i]!=0) assert(false);\n }\n\n printf(\"%.8f\\n\", solve(x,y,z,0,joker));\n\n return 0;\n}","accuracy":0.09523809523809523,"time_ms":10,"memory_kb":19280,"score_of_the_acc":-0.0002,"final_rank":10},{"submission_id":"aoj_2802_2270648","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef double D;\n\nvector<int> hand(int n){\n vector<int> h(n+1,0);\n\n int m; cin >> m;\n for(int i=0;i<m;i++){\n int a; cin >> a; h[a]++;\n }\n \n for(int i=0;i<=n;i++) h[i] %= 2;\n\n return h;\n}\n\nD memo2[3][3][110]; //memo2[turn][joker][card]\n\n//0: kotori, 1: umi\nD rec2(int t, int j, int c){\n D &res = memo2[t][j][c];\n if(res >= 0) return res;\n \n if(c == 0){\n if(j == 1) return res = 0; //umi loses\n else return res = 1; //umi wins\n }\n\n if(t == 0){ //kotori turn\n return res = rec2(1-t,j,c-1);\n }else{ //umi turn\n int total = c + (j==0);\n res = c * rec2(1-t,j,c-1);\n if(j==0) res += rec2(1-t,1,c);\n res /= total;\n\n return res;\n }\n}\n\nD memo3[3][3][110][110][110]; //memo3[turn][joker][hono][umi][koto]\n\n//honoka: 0, umi: 1, kotori: 2\nD rec3(int t, int j, vector<int> p){\n D &res = memo3[t][j][p[0]][p[1]][p[2]];\n if(res >= 0) return res;\n\n //only joker\n if(p[0]==0 && p[1]==0 && p[2]==0){\n if(j == 1) return res = 0; //umi loses\n else return res = 1; //umi wins\n }\n\n int nt = (t+1)%3;\n //turn player has no card\n if(j!=t && p[(t+1)%3]==0 && p[(t+2)%3]==0){\n return res = rec3(nt, j, p); //skip turn\n }\n\n //two players remain\n for(int i=0;i<3;i++){\n if(j!=i && p[(i+1)%3]==0 && p[(i+2)%3]==0){\n if(i==1) return res = 1; //umi wins\n else return res = rec2(t==1,j==1,p[i]); //umi remains\n }\n }\n\n //three players remain\n if(t==2){\n if(p[0]){ //umi has cards that kotori also has\n res = rec3(nt, j, {p[0]-1,p[1],p[2]});\n }else if(p[0]==0 && p[2]==0 && j==1){ //umi only has joker\n res = 1;\n }else{\n res = rec3(nt, j, {p[0],p[1]+1,p[2]-1});\n }\n }else{\n int total = p[t] + p[(t+1)%3] + (j==(t+2)%3);\n\n vector<int> np = p;\n np[t]--;\n np[(t+2)%3]++;\n res = p[t] * rec3(nt,j,np);\n \n np = p;\n np[(t+1)%3]--;\n res += p[(t+1)%3] * rec3(nt,j,np);\n\n if(j==(t+2)%3) res += rec3(nt,t,p);\n\n res /= total;\n }\n \n return res;\n}\n\nint main(){\n int n;\n cin >> n;\n\n vector<int> hono = hand(n), umi = hand(n), koto = hand(n);\n\n int joker = 0;\n if(hono[0] == 1) joker = 0;\n if( umi[0] == 1) joker = 1;\n if(koto[0] == 1) joker = 2;\n\n int h=0, u=0, k=0;\n for(int i=1;i<=n;i++){\n if(umi[i] && koto[i]) h++;\n if(koto[i] && hono[i]) u++;\n if(hono[i] && umi[i]) k++;\n }\n\n for(int a=0;a<3;a++){\n for(int b=0;b<3;b++){\n for(int c=0;c<=n;c++){\n\tmemo2[a][b][c] = -1;\n\n\tfor(int d=0;d<=n;d++){\n\t for(int e=0;e<=n;e++) memo3[a][b][c][d][e] = -1;\n\t}\n }\n }\n }\n\n cout << fixed << setprecision(10) << rec3(0, joker, {h,u,k}) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":85784,"score_of_the_acc":-0.5159,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2802_8322461\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <vector>\\nusing namespace std;\\n\\nint N;\\nint M[3], P[3][409];\\nint Cnt[3][109];\\ndouble prevs[109][109][109][3];\\ndouble dp[109][109][109][3];\\ndouble Answer = 0.0;\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\\n\\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\\n\\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\\n\\n\\t// Step 2. Precount\\n\\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\\n\\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\\n\\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\\n\\tfor (int i = 0; i < 3; i++) {\\n\\t\\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\\n\\t}\\n\\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\\n\\t\\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\\n\\t\\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\\n\\t}\\n\\tif (Cnt[0][0] == 1) j_ = 0;\\n\\tif (Cnt[1][0] == 1) j_ = 1;\\n\\tif (Cnt[2][0] == 1) j_ = 2;\\n\\tprevs[ab_][bc_][ca_][j_] = 1.0;\\n\\tif (ab_ + bc_ + ca_ == 0 && j_ != 1) Answer += 1.0;\\n\\n\\t// Step 3. Dynamic Programming\\n\\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\\n\\t\\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\\n\\t\\tlims = min(lims, ab_ + bc_ + ca_);\\n\\n\\t\\t// Start\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims - ab; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tif (prevs[ab][bc][ca][j] == 0) continue;\\n\\t\\t\\t\\t\\t\\tif (ab + bc + ca == 0) continue;\\n\\t\\t\\t\\t\\t\\tint nex = (j + 2) % 3;\\n\\t\\t\\t\\t\\t\\tint numa = ab + ca + (j == 0 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\tint numb = bc + ab + (j == 1 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\tint numc = ca + bc + (j == 2 ? 1 : 0);\\n\\n\\t\\t\\t\\t\\t\\t// Case 1\\n\\t\\t\\t\\t\\t\\tif (numa == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 2\\n\\t\\t\\t\\t\\t\\telse if (numc != 0 && i % 3 != 2) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 2 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 3\\n\\t\\t\\t\\t\\t\\telse if (numc != 0 && i % 3 == 2) {\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 4\\n\\t\\t\\t\\t\\t\\telse if (numb != 0 && i % 3 != 0) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 1 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 5\\n\\t\\t\\t\\t\\t\\telse if (numb != 0 && i % 3 == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\\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}\\n\\n\\t\\t// Refresh\\n\\t\\t// printf(\\\"%d: %.12lf\\\\n\\\", i, Answer);\\n\\t\\tif (i % 3 != 0) Answer += dp[0][0][0][0];\\n\\t\\tif (i % 3 != 1) Answer += dp[0][0][0][2];\\n\\t\\tif (i % 3 != 2) Answer += dp[0][0][0][1];\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\tdp[ab][bc][ca][j] = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 590,\n \"memory_kb\": 54204,\n \"score_of_the_acc\": -1.271,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2802_8322445\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <vector>\\nusing namespace std;\\n\\nint N;\\nint M[3], P[3][409];\\nint Cnt[3][109];\\ndouble prevs[109][109][109][3];\\ndouble dp[109][109][109][3];\\ndouble Answer = 0.0;\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\\n\\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\\n\\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\\n\\n\\t// Step 2. Precount\\n\\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\\n\\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\\n\\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\\n\\tfor (int i = 0; i < 3; i++) {\\n\\t\\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\\n\\t}\\n\\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\\n\\t\\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\\n\\t\\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\\n\\t}\\n\\tif (Cnt[0][0] == 1) j_ = 0;\\n\\tif (Cnt[1][0] == 1) j_ = 1;\\n\\tif (Cnt[2][0] == 1) j_ = 2;\\n\\tprevs[ab_][bc_][ca_][j_] = 1.0;\\n\\tif (ab_ + bc_ + ca_ == 0 && j_ != 1) Answer += 1.0;\\n\\n\\t// Step 3. Dynamic Programming\\n\\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\\n\\t\\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\\n\\t\\tlims = min(lims, ab_ + bc_ + ca_);\\n\\n\\t\\t// Start\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims - ab; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tif (prevs[ab][bc][ca][j] == 0) continue;\\n\\t\\t\\t\\t\\t\\tif (ab + bc + ca == 0) continue;\\n\\t\\t\\t\\t\\t\\tint nex = (j + 2) % 3;\\n\\n\\t\\t\\t\\t\\t\\t// Case 1\\n\\t\\t\\t\\t\\t\\tif (ab + ca == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 2\\n\\t\\t\\t\\t\\t\\telse if (bc + ca + (j == 2 ? 1 : 0) != 0 && i % 3 != 2) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 2 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numc = bc + ca + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 3\\n\\t\\t\\t\\t\\t\\telse if (bc + ca + (j == 2 ? 1 : 0) != 0 && i % 3 == 2) {\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 4\\n\\t\\t\\t\\t\\t\\telse if (i % 3 != 0) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 1 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numb = ab + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 5\\n\\t\\t\\t\\t\\t\\telse if (i % 3 == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\\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}\\n\\n\\t\\t// Refresh\\n\\t\\t// printf(\\\"%d: %.12lf\\\\n\\\", i, Answer);\\n\\t\\tif (i % 3 != 0) Answer += dp[0][0][0][0];\\n\\t\\tif (i % 3 != 1) Answer += dp[0][0][0][2];\\n\\t\\tif (i % 3 != 2) Answer += dp[0][0][0][1];\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\tdp[ab][bc][ca][j] = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.11904761904761904,\n \"time_ms\": 360,\n \"memory_kb\": 45836,\n \"score_of_the_acc\": -0.8096,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2802_8322423\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <vector>\\nusing namespace std;\\n\\nint N;\\nint M[3], P[3][409];\\nint Cnt[3][109];\\ndouble prevs[109][109][109][3];\\ndouble dp[109][109][109][3];\\ndouble Answer = 0.0;\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\\n\\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\\n\\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\\n\\n\\t// Step 2. Precount\\n\\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\\n\\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\\n\\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\\n\\tfor (int i = 0; i < 3; i++) {\\n\\t\\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\\n\\t}\\n\\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\\n\\t\\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\\n\\t\\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\\n\\t}\\n\\tif (Cnt[0][0] == 1) j_ = 0;\\n\\tif (Cnt[1][0] == 1) j_ = 1;\\n\\tif (Cnt[2][0] == 1) j_ = 2;\\n\\tprevs[ab_][bc_][ca_][j_] = 1.0;\\n\\tif (ab_ + bc_ + ca_ == 0 && j_ != 1) Answer += 1.0;\\n\\n\\t// Step 3. Dynamic Programming\\n\\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\\n\\t\\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\\n\\t\\tlims = min(lims, ab_ + bc_ + ca_);\\n\\n\\t\\t// Start\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims - ab; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tif (prevs[ab][bc][ca][j] == 0) continue;\\n\\t\\t\\t\\t\\t\\tif (ab + bc + ca == 0) continue;\\n\\t\\t\\t\\t\\t\\tint nex = (j + 2) % 3;\\n\\n\\t\\t\\t\\t\\t\\t// Case 1\\n\\t\\t\\t\\t\\t\\tif (ab + ca == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 2\\n\\t\\t\\t\\t\\t\\telse if (bc + ca != 0 && i % 3 != 2) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 2 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numc = bc + ca + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 3\\n\\t\\t\\t\\t\\t\\telse if (bc + ca != 0 && i % 3 == 2) {\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 4\\n\\t\\t\\t\\t\\t\\telse if (bc + ca == 0 && i % 3 != 0) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 1 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numb = ab + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 5\\n\\t\\t\\t\\t\\t\\telse if (bc + ca == 0 && i % 3 == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\\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}\\n\\n\\t\\t// Refresh\\n\\t\\t// printf(\\\"%d: %.12lf\\\\n\\\", i, Answer);\\n\\t\\tif (i % 3 != 0) Answer += dp[0][0][0][0];\\n\\t\\tif (i % 3 != 1) Answer += dp[0][0][0][2];\\n\\t\\tif (i % 3 != 2) Answer += dp[0][0][0][1];\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\tdp[ab][bc][ca][j] = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 360,\n \"memory_kb\": 45660,\n \"score_of_the_acc\": -0.8082,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2802_8322411\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <vector>\\nusing namespace std;\\n\\nint N;\\nint M[3], P[3][409];\\nint Cnt[3][109];\\ndouble prevs[109][109][109][3];\\ndouble dp[109][109][109][3];\\ndouble Answer = 0.0;\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\\n\\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\\n\\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\\n\\n\\t// Step 2. Precount\\n\\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\\n\\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\\n\\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\\n\\tfor (int i = 0; i < 3; i++) {\\n\\t\\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\\n\\t}\\n\\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\\n\\t\\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\\n\\t\\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\\n\\t}\\n\\tif (Cnt[0][0] == 1) j_ = 0;\\n\\tif (Cnt[1][0] == 1) j_ = 1;\\n\\tif (Cnt[2][0] == 1) j_ = 2;\\n\\tprevs[ab_][bc_][ca_][j_] = 1.0;\\n\\tif (ab_ + bc_ + ca_ == 0 && j_ != 1) Answer += 1.0;\\n\\n\\t// Step 3. Dynamic Programming\\n\\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\\n\\t\\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\\n\\t\\tlims = min(lims, ab_ + bc_ + ca_);\\n\\n\\t\\t// Start\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims - ab; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tif (prevs[ab][bc][ca][j] == 0) continue;\\n\\t\\t\\t\\t\\t\\tif (ab + bc + ca == 0) continue;\\n\\t\\t\\t\\t\\t\\tint nex = (j + 2) % 3;\\n\\n\\t\\t\\t\\t\\t\\t// Case 1\\n\\t\\t\\t\\t\\t\\tif (ab + ca == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 2\\n\\t\\t\\t\\t\\t\\telse if (bc + ca != 0 && i % 3 != 2) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 2 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numc = bc + ca + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 3\\n\\t\\t\\t\\t\\t\\telse if (bc + ca != 0 && i % 3 == 2) {\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 4\\n\\t\\t\\t\\t\\t\\tif (bc + ca == 0 && i % 3 != 0) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 1 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numb = ab + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 5\\n\\t\\t\\t\\t\\t\\tif (bc + ca == 0 && i % 3 == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\\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}\\n\\n\\t\\t// Refresh\\n\\t\\t// printf(\\\"%d: %.12lf\\\\n\\\", i, Answer);\\n\\t\\tif (i % 3 != 0) Answer += dp[0][0][0][0];\\n\\t\\tif (i % 3 != 1) Answer += dp[0][0][0][2];\\n\\t\\tif (i % 3 != 2) Answer += dp[0][0][0][1];\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\tdp[ab][bc][ca][j] = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 360,\n \"memory_kb\": 45836,\n \"score_of_the_acc\": -0.8096,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2802_8322390\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <vector>\\nusing namespace std;\\n\\nint N;\\nint M[3], P[3][409];\\nint Cnt[3][109];\\ndouble prevs[109][109][109][3];\\ndouble dp[109][109][109][3];\\ndouble Answer = 0.0;\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\\n\\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\\n\\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\\n\\n\\t// Step 2. Precount\\n\\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\\n\\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\\n\\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\\n\\tfor (int i = 0; i < 3; i++) {\\n\\t\\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\\n\\t}\\n\\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\\n\\t\\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\\n\\t\\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\\n\\t}\\n\\tif (Cnt[0][0] == 1) j_ = 0;\\n\\tif (Cnt[1][0] == 1) j_ = 1;\\n\\tif (Cnt[2][0] == 1) j_ = 2;\\n\\tprevs[ab_][bc_][ca_][j_] = 1.0;\\n\\n\\t// Step 3. Dynamic Programming\\n\\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 8 + 100; i++) {\\n\\t\\tint lims = ((ab_ + bc_ + ca_) * 8 + 100 - i) / 8;\\n\\t\\tlims = min(lims, ab_ + bc_ + ca_);\\n\\n\\t\\t// Start\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims - ab; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tif (prevs[ab][bc][ca][j] == 0) continue;\\n\\t\\t\\t\\t\\t\\tif (ab + bc + ca == 0) continue;\\n\\t\\t\\t\\t\\t\\tint nex = (j + 2) % 3;\\n\\n\\t\\t\\t\\t\\t\\t// Case 1\\n\\t\\t\\t\\t\\t\\tif (ab + ca == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 2\\n\\t\\t\\t\\t\\t\\telse if (bc + ca != 0 && i % 3 != 2) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 2 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numc = bc + ca + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 3\\n\\t\\t\\t\\t\\t\\telse if (bc + ca != 0 && i % 3 == 2) {\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 4\\n\\t\\t\\t\\t\\t\\tif (bc + ca == 0 && i % 3 != 0) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 1 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numb = ab + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 5\\n\\t\\t\\t\\t\\t\\tif (bc + ca == 0 && i % 3 == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\\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}\\n\\n\\t\\t// Refresh\\n\\t\\t// printf(\\\"%d: %.12lf\\\\n\\\", i, Answer);\\n\\t\\tif (i % 3 != 0) Answer += dp[0][0][0][0];\\n\\t\\tif (i % 3 != 1) Answer += dp[0][0][0][2];\\n\\t\\tif (i % 3 != 2) Answer += dp[0][0][0][1];\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\tdp[ab][bc][ca][j] = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 360,\n \"memory_kb\": 45876,\n \"score_of_the_acc\": -0.8099,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2802_8322363\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <vector>\\nusing namespace std;\\n\\nint N;\\nint M[3], P[3][409];\\nint Cnt[3][109];\\ndouble prevs[109][109][109][3];\\ndouble dp[109][109][109][3];\\ndouble Answer = 0.0;\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N;\\n\\tcin >> M[0]; for (int i = 0; i < M[0]; i++) cin >> P[0][i];\\n\\tcin >> M[1]; for (int i = 0; i < M[1]; i++) cin >> P[1][i];\\n\\tcin >> M[2]; for (int i = 0; i < M[2]; i++) cin >> P[2][i];\\n\\n\\t// Step 2. Precount\\n\\tfor (int i = 0; i < M[0]; i++) Cnt[0][P[0][i]] += 1;\\n\\tfor (int i = 0; i < M[1]; i++) Cnt[1][P[1][i]] += 1;\\n\\tfor (int i = 0; i < M[2]; i++) Cnt[2][P[2][i]] += 1;\\n\\tfor (int i = 0; i < 3; i++) {\\n\\t\\tfor (int j = 1; j <= N; j++) Cnt[i][j] %= 2;\\n\\t}\\n\\tint ab_ = 0, bc_ = 0, ca_ = 0, j_ = -1;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (Cnt[0][i] == 1 && Cnt[1][i] == 1) ab_ += 1;\\n\\t\\tif (Cnt[1][i] == 1 && Cnt[2][i] == 1) bc_ += 1;\\n\\t\\tif (Cnt[2][i] == 1 && Cnt[0][i] == 1) ca_ += 1;\\n\\t}\\n\\tif (Cnt[0][0] == 1) j_ = 0;\\n\\tif (Cnt[1][0] == 1) j_ = 1;\\n\\tif (Cnt[2][0] == 1) j_ = 2;\\n\\tprevs[ab_][bc_][ca_][j_] = 1.0;\\n\\n\\t// Step 3. Dynamic Programming\\n\\tfor (int i = 0; i <= (ab_ + bc_ + ca_) * 5 + 10; i++) {\\n\\t\\tint lims = ((ab_ + bc_ + ca_) * 5 + 10 - i) / 5;\\n\\t\\tlims = min(lims, ab_ + bc_ + ca_);\\n\\n\\t\\t// Start\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims - ab; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims - ab - bc; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tif (prevs[ab][bc][ca][j] == 0) continue;\\n\\t\\t\\t\\t\\t\\tif (ab + bc + ca == 0) continue;\\n\\t\\t\\t\\t\\t\\tint nex = (j + 2) % 3;\\n\\n\\t\\t\\t\\t\\t\\t// Case 1\\n\\t\\t\\t\\t\\t\\tif (ab + ca == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 2\\n\\t\\t\\t\\t\\t\\telse if (bc + ca != 0 && i % 3 != 2) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 2 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numc = bc + ca + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j] * (1.0 * ca / numc);\\n\\t\\t\\t\\t\\t\\t\\tif (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j] * (1.0 * bc / numc);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 3\\n\\t\\t\\t\\t\\t\\telse if (bc + ca != 0 && i % 3 == 2) {\\n\\t\\t\\t\\t\\t\\t\\tif (ca >= 1) dp[bc - 0][ca - 1][ab - 0][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse if (bc >= 1) dp[bc - 1][ca - 0][ab + 1][nex] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t\\telse dp[bc][ca][ab][2] += prevs[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 4\\n\\t\\t\\t\\t\\t\\tif (bc + ca == 0 && i % 3 != 0) {\\n\\t\\t\\t\\t\\t\\t\\tint joker_flag = (j == 1 ? 1 : 0);\\n\\t\\t\\t\\t\\t\\t\\tint numb = ab + joker_flag;\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 0][2] += prevs[ab][bc][ca][j] * (1.0 * joker_flag / numb);\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j] * (1.0 * ab / numb);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t// Case 5\\n\\t\\t\\t\\t\\t\\tif (bc + ca == 0 && i % 3 == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[bc][ca][ab - 1][nex] += prevs[ab][bc][ca][j];\\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}\\n\\n\\t\\t// Refresh\\n\\t\\tif (i % 3 != 0) Answer += dp[0][0][0][0];\\n\\t\\tif (i % 3 != 1) Answer += dp[0][0][0][2];\\n\\t\\tif (i % 3 != 2) Answer += dp[0][0][0][1];\\n\\t\\tfor (int ab = 0; ab <= lims; ab++) {\\n\\t\\t\\tfor (int bc = 0; bc <= lims; bc++) {\\n\\t\\t\\t\\tfor (int ca = 0; ca <= lims; ca++) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j <= 2; j++) {\\n\\t\\t\\t\\t\\t\\tprevs[ab][bc][ca][j] = dp[ab][bc][ca][j];\\n\\t\\t\\t\\t\\t\\tdp[ab][bc][ca][j] = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tprintf(\\\"%.12lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 140,\n \"memory_kb\": 45928,\n \"score_of_the_acc\": -0.431,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2802_4445209\",\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\\nenum Type{\\n\\tA,\\n\\tC,\\n\\tB,\\n};\\n\\nint N,POW[4];\\nint table[105],COUNT[3][105];\\ndouble dp[101][101][101][3][3];\\nType type_array[3] = {A,C,B};\\n\\n\\ndouble recursive(int ab,int ac,int bc,Type joker,Type turn){\\n\\n\\tif(dp[ab][ac][bc][joker][turn] >= 0){\\n\\n\\t\\treturn dp[ab][ac][bc][joker][turn];\\n\\t}\\n\\n\\tint num_A = ab+ac;\\n\\tint num_B = ab+bc;\\n\\tint num_C = ac+bc;\\n\\n\\tswitch(joker){\\n\\tcase A:\\n\\t\\tnum_A++;\\n\\t\\tbreak;\\n\\tcase B:\\n\\t\\tnum_B++;\\n\\t\\tbreak;\\n\\tcase C:\\n\\t\\tnum_C++;\\n\\t\\tbreak;\\n\\t}\\n\\n\\tif(turn == A && num_A == 0){\\n\\n\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc,joker,C);\\n\\n\\t}else if(turn == C && num_C == 0){\\n\\n\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\n\\t}else if(turn == B && num_B == 0){\\n\\n\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc,joker,A);\\n\\t}\\n\\n\\tif(num_A+num_B+num_C == 1){\\n\\n\\t\\tif(num_C == 1){\\n\\n\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 0;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ret = 0;\\n\\n\\tif(turn == A){\\n\\n\\t\\tif(num_B == 0){\\n\\n\\t\\t\\tif(num_C == 1){ //C,非負け\\n\\n\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\n\\t\\t\\t}else{ //2枚以上あるなら、非jokerは少なくとも1枚ある\\n\\n\\t\\t\\t\\tif(ac > 0){\\n\\n\\t\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac-1,bc,joker,C);\\n\\n\\t\\t\\t\\t}else{ //bc > 0\\n\\n\\t\\t\\t\\t\\t//bが0枚なのであり得ない\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //num_B > 0\\n\\n\\t\\t\\tif(ab > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab-1,ac,bc,joker,C)*((double)ab/(double)num_B);\\n\\t\\t\\t}\\n\\t\\t\\tif(bc > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac+1,bc-1,joker,C)*((double)bc/(double)num_B);\\n\\t\\t\\t}\\n\\t\\t\\tif(joker == B){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac,bc,A,C)*(1.0/(double)num_B);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}else if(turn == B){\\n\\n\\t\\tif(num_C == 0){//C:非負け\\n\\n\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\n\\t\\t}else{ //num_C > 0\\n\\n\\t\\t\\tif(num_C == 1){ //C,非負け\\n\\n\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\n\\t\\t\\t}else{ //2枚以上あるなら、非jokerは少なくとも1枚ある\\n\\n\\t\\t\\t\\tif(bc > 0){\\n\\n\\t\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc-1,joker,A);\\n\\n\\t\\t\\t\\t}else{ //ac > 0\\n\\n\\t\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab+1,ac-1,bc,joker,A);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}else{ //turn == C\\n\\n\\t\\tif(num_A == 0){ //Bから引く\\n\\n\\t\\t\\tif(ab > 0){\\n\\n\\t\\t\\t\\t//Aが0なのであり得ない\\n\\t\\t\\t}\\n\\t\\t\\tif(bc > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac,bc-1,joker,B)*((double)bc/(double)num_B);\\n\\t\\t\\t}\\n\\t\\t\\tif(joker == B){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac,bc,C,B)*(1.0/(double)num_B);\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //num_A > 0\\n\\n\\t\\t\\tif(ab > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab-1,ac,bc+1,joker,B)*((double)ab/(double)num_A);\\n\\t\\t\\t}\\n\\t\\t\\tif(ac > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac-1,bc,joker,B)*((double)ac/(double)num_A);\\n\\t\\t\\t}\\n\\t\\t\\tif(joker == A){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac,bc,C,B)*(1.0/(double)num_A);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn dp[ab][ac][bc][joker][turn] = ret;\\n}\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < 4; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tfor(int k = 0; k < 3; k++){\\n\\t\\t\\tCOUNT[k][i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\tint num,tmp;\\n\\tType joker = A;\\n\\n\\tfor(int i = 0; i < 3; i++){\\n\\t\\tscanf(\\\"%d\\\",&num);\\n\\t\\tfor(int k = 0; k < num; k++){\\n\\t\\t\\tscanf(\\\"%d\\\",&tmp);\\n\\n\\t\\t\\tCOUNT[i][tmp]++;\\n\\n\\t\\t\\tif(tmp == 0){\\n\\n\\t\\t\\t\\tjoker = type_array[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < 3; i++){\\n\\t\\tfor(int k = 1; k <= N; k++){\\n\\t\\t\\tif(COUNT[i][k]%2 == 1){\\n\\n\\t\\t\\t\\ttable[k] += POW[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\n\\n\\tint ab = 0,ac = 0,bc = 0;\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tif(table[i] == 0)continue;\\n\\n\\t\\tswitch(table[i]){\\n\\t\\tcase 3:\\n\\t\\t\\tac++;\\n\\t\\t\\tbreak;\\n\\t\\tcase 5:\\n\\t\\t\\tab++;\\n\\t\\t\\tbreak;\\n\\t\\tcase 6:\\n\\t\\t\\tbc++;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= N; i++){\\n\\t\\tfor(int k = 0; k <= N; k++){\\n\\t\\t\\tfor(int p = 0; p <= N; p++){\\n\\t\\t\\t\\tfor(int a = 0; a < 3; a++){\\n\\t\\t\\t\\t\\tfor(int b = 0; b < 3; b++){\\n\\n\\t\\t\\t\\t\\t\\tdp[i][k][p][a][b] = -1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",recursive(ab,ac,bc,joker,A));\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 75660,\n \"score_of_the_acc\": -0.4374,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2802_4445203\",\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\\nenum Type{\\n\\tA,\\n\\tC,\\n\\tB,\\n};\\n\\nint N,POW[4];\\nint table[105],COUNT[3][105];\\ndouble dp[101][101][101][3][3];\\nType type_array[3] = {A,C,B};\\n\\n\\ndouble recursive(int ab,int ac,int bc,Type joker,Type turn){\\n\\n\\tif(dp[ab][ac][bc][joker][turn] >= 0){\\n\\n\\t\\treturn dp[ab][ac][bc][joker][turn];\\n\\t}\\n\\n\\tint num_A = ab+ac;\\n\\tint num_B = ab+bc;\\n\\tint num_C = ac+bc;\\n\\n\\tswitch(joker){\\n\\tcase A:\\n\\t\\tnum_A++;\\n\\t\\tbreak;\\n\\tcase B:\\n\\t\\tnum_B++;\\n\\t\\tbreak;\\n\\tcase C:\\n\\t\\tnum_C++;\\n\\t\\tbreak;\\n\\t}\\n\\n\\tif(turn == A && num_A == 0){\\n\\n\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc,joker,C);\\n\\n\\t}else if(turn == C && num_C == 0){\\n\\n\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\n\\t}else if(turn == B && num_B == 0){\\n\\n\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc,joker,A);\\n\\t}\\n\\n\\tif(num_A+num_B+num_C == 1){\\n\\n\\t\\tif(num_C == 1){\\n\\n\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 0;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ret = 0;\\n\\n\\tif(turn == A){\\n\\n\\t\\tif(num_B == 0){\\n\\n\\t\\t\\tif(num_C == 1){ //C,非負け\\n\\n\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\n\\t\\t\\t}else{ //2枚以上あるなら、非jokerは少なくとも1枚ある\\n\\n\\t\\t\\t\\tif(ac > 0){\\n\\n\\t\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac-1,bc,joker,C);\\n\\n\\t\\t\\t\\t}else{ //bc > 0\\n\\n\\t\\t\\t\\t\\t//bが0枚なのであり得ない\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //num_B > 0\\n\\n\\t\\t\\tif(ab > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab-1,ac,bc,joker,C)*((double)ab/(double)num_B);\\n\\t\\t\\t}\\n\\t\\t\\tif(bc > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac+1,bc-1,joker,C)*((double)bc/(double)num_B);\\n\\t\\t\\t}\\n\\t\\t\\tif(joker == B){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac,bc,A,C)*(1.0/(double)num_B);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}else if(turn == B){\\n\\n\\t\\tif(num_C == 0){//C:非負け\\n\\n\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\n\\t\\t}else{ //num_C > 0\\n\\n\\t\\t\\tif(num_C == 1){ //C,非負け\\n\\n\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = 1.0;\\n\\n\\t\\t\\t}else{ //2枚以上あるなら、非jokerは少なくとも1枚ある\\n\\n\\t\\t\\t\\tif(bc > 0){\\n\\n\\t\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab,ac,bc-1,joker,A);\\n\\n\\t\\t\\t\\t}else{ //ac > 0\\n\\n\\t\\t\\t\\t\\treturn dp[ab][ac][bc][joker][turn] = recursive(ab+1,ac-1,bc,joker,A);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}else{ //turn == C\\n\\n\\t\\tif(num_A == 0){ //Bから引く\\n\\n\\t\\t\\tif(ab > 0){\\n\\n\\t\\t\\t\\t//Aが0なのであり得ない\\n\\t\\t\\t}\\n\\t\\t\\tif(bc > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac,bc-1,joker,B)*((double)bc/(double)num_B);\\n\\t\\t\\t}\\n\\t\\t\\tif(joker == B){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac,bc,C,B)*(1.0/(double)num_B);\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //num_A > 0\\n\\n\\t\\t\\tif(ab > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab-1,ac,bc+1,joker,B)*((double)ab/(double)num_A);\\n\\t\\t\\t}\\n\\t\\t\\tif(ac > 0){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac-1,bc,joker,B)*((double)ac/(double)num_A);\\n\\t\\t\\t}\\n\\t\\t\\tif(joker == A){\\n\\n\\t\\t\\t\\tret += recursive(ab,ac,bc,C,B)*(1.0/(double)num_A);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn dp[ab][ac][bc][joker][turn] = ret;\\n}\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < 4; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tfor(int k = 0; k < 3; k++){\\n\\t\\t\\tCOUNT[k][i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\tint num,tmp;\\n\\tType joker = A;\\n\\n\\tfor(int i = 0; i < 3; i++){\\n\\t\\tscanf(\\\"%d\\\",&num);\\n\\t\\tfor(int k = 0; k < num; k++){\\n\\t\\t\\tscanf(\\\"%d\\\",&tmp);\\n\\n\\t\\t\\tCOUNT[i][tmp]++;\\n\\n\\t\\t\\tif(tmp == 0){\\n\\n\\t\\t\\t\\t//printf(\\\"joker:%d\\\\n\\\",i);\\n\\t\\t\\t\\tjoker = type_array[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < 3; i++){\\n\\t\\tfor(int k = 1; k <= N; k++){\\n\\t\\t\\tif(COUNT[i][k]%2 == 1){\\n\\n\\t\\t\\t\\ttable[k] += POW[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\n\\n\\tint ab = 0,ac = 0,bc = 0;\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tif(table[i] == 0)continue;\\n\\n\\t\\tswitch(table[i]){\\n\\t\\tcase 3:\\n\\t\\t\\tac++;\\n\\t\\t\\tbreak;\\n\\t\\tcase 5:\\n\\t\\t\\tab++;\\n\\t\\t\\tbreak;\\n\\t\\tcase 6:\\n\\t\\t\\tbc++;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= N; i++){\\n\\t\\tfor(int k = 0; k <= N; k++){\\n\\t\\t\\tfor(int p = 0; p <= N; p++){\\n\\t\\t\\t\\tfor(int a = 0; a < 3; a++){\\n\\t\\t\\t\\t\\tfor(int b = 0; b < 3; b++){\\n\\n\\t\\t\\t\\t\\t\\tdp[i][k][p][a][b] = -1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//printf(\\\"ab:%d ac:%d bc:%d\\\\n\\\",ab,ac,bc);\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",recursive(ab,ac,bc,joker,A));\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 75688,\n \"score_of_the_acc\": -0.4376,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2802_3989842\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"functional\\\"\\n\\nusing namespace std;\\n\\nint N, M, K, L, R, H, W;\\n//long long int N,M,K,L,R,H,W;\\n\\nconstexpr long long int MOD = 1000000007;\\n//constexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n//constexpr long long int MOD=998244353;\\n\\nconstexpr long double EPS = 1e-8;\\n\\nlong double dp[101][101][101][3][3];\\n\\ndouble Search(int ab, int bc, int ca, int j, int t) {\\n\\t//cout<<ab<<\\\" \\\"<<bc<<\\\" \\\"<<ca<<\\\" \\\"<<j<<\\\" \\\"<<t<<endl;\\n\\tif (dp[ab][bc][ca][j][t] >= 0)return dp[ab][bc][ca][j][t];\\n\\tif (!ab && !bc && !ca) {\\n\\t\\tif (j == 1)return dp[0][0][0][1][t] = 0;\\n\\t\\telse return dp[0][0][0][j][t] = 1;\\n\\t}\\n\\tif (!ab && !bc&&j != 1 && t == 1)return dp[ab][bc][ca][j][t] = Search(ab, bc, ca, j, 2);\\n\\tif (!bc && !ca&&j != 2 && t == 2)return dp[ab][bc][ca][j][t] = Search(ab, bc, ca, j, 0);\\n\\tif (!ca && !ab&&j != 0 && t == 0)return dp[ab][bc][ca][j][t] = Search(ab, bc, ca, j, 1);\\n\\t//nxが1のとき不正が発生\\n\\tint nx;\\n\\tif (t == 0) {\\n\\t\\tnx = 2;\\n\\t\\tif (!bc && !ca&&j != 2) {\\n\\t\\t\\tnx = 1;\\n\\t\\t\\tif (!ab) {\\n\\t\\t\\t\\tif (j == 0)return dp[ab][bc][ca][j][t] = 1;\\n\\t\\t\\t\\telse return dp[ab][bc][ca][j][t] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\telse if (t == 1) {\\n\\t\\tnx = 0;\\n\\t\\tif (!ab && !ca&&j != 0) {\\n\\t\\t\\tnx = 2;\\n\\t\\t\\tif (!bc) {\\n\\t\\t\\t\\tif (j == 1)return dp[ab][bc][ca][j][t] = 0;\\n\\t\\t\\t\\telse return dp[ab][bc][ca][j][t] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\telse {\\n\\t\\tnx = 1;\\n\\t\\tif (!ab && !bc&&j != 1) {\\n\\t\\t\\tnx = 0;\\n\\t\\t\\tif (!ca) {\\n\\t\\t\\t\\treturn dp[ab][bc][ca][j][t] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (nx == 1) {\\n\\t\\tif (t == 0) {\\n\\t\\t\\treturn dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 1);\\n\\t\\t}\\n\\t\\tif (t == 2) {\\n\\t\\t\\tif (bc) {\\n\\t\\t\\t\\tif (ab || ca || j == 0)return dp[ab][bc][ca][j][t] = Search(ab, bc - 1, ca, j, 0);\\n\\t\\t\\t\\telse return dp[ab][bc][ca][j][t] = Search(ab, bc - 1, ca, j, 1);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (ab) {\\n\\t\\t\\t\\t\\tif (ab - 1 || bc || j == 1)return dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 1);\\n\\t\\t\\t\\t\\telse if (bc || ca || j == 2)return dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 2);\\n\\t\\t\\t\\t\\telse return dp[ab][bc][ca][j][t] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn dp[ab][bc][ca][j][t] = Search(ab, bc, ca - 1, 2, t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (nx == 2) {\\n\\t\\tif (t == 1) {\\n\\t\\t\\tif (j == 1) {\\n\\t\\t\\t\\treturn dp[ab][bc][ca][j][t] = Search(ab, bc - 1, ca, j, 2);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\treturn dp[ab][bc][ca][j][t] = Search(ab, bc - 1, ca, j, 2)*bc / (bc + 1) + Search(ab, bc - 1, ca, 1, 1) / (bc + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (t == 0) {\\n\\t\\t\\tif (ca) {\\n\\t\\t\\t\\tif (ab || bc || j == 1)return dp[ab][bc][ca][j][t] = Search(ab, bc, ca - 1, j, 1);\\n\\t\\t\\t\\telse return dp[ab][bc][ca][j][t] = Search(ab, bc, ca - 1, j, 2);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (bc)return dp[ab][bc][ca][j][t] = Search(ab + 1, bc - 1, ca, j, 1);\\n\\t\\t\\t\\telse dp[ab][bc][ca][j][t] = Search(ab, bc, ca, 0, 1);\\n\\t\\t\\t\\t//if(bc){\\n\\t\\t\\t\\t//\\tif(j==2)return dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,2);\\n\\t\\t\\t\\t//\\telse dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,0);\\n\\t\\t\\t\\t//}\\n\\t\\t\\t\\t//else{\\n\\t\\t\\t\\t//\\tdp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,0);\\n\\t\\t\\t\\t//}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (nx == 0) {\\n\\t\\tif (t == 2) {\\n\\t\\t\\treturn dp[ab][bc][ca][j][t] = Search(ab, bc, ca - 1, j, 0);\\n\\t\\t}\\n\\t\\tif (t == 1) {\\n\\t\\t\\tif (bc || ca || j == 2) {\\n\\t\\t\\t\\tif (j != 0) {\\n\\t\\t\\t\\t\\treturn dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 2)*ab / (ab + ca) + Search(ab, bc, ca - 1, j, 0)*ca / (ab + ca);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tif (bc)return dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 2)*ab / (ab + ca + 1) + Search(ab, bc, ca - 1, j, 0)*ca / (ab + ca + 1) + Search(ab, bc - 1, ca, 1, 0) / (ab + ca + 1);\\n\\t\\t\\t\\t\\telse return dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 2)*ab / (ab + ca + 1) + Search(ab, bc, ca - 1, j, 0)*ca / (ab + ca + 1) + Search(ab - 1, bc, ca, 1, 1) / (ab + ca + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (j == 1) {\\n\\t\\t\\t\\t\\treturn dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn dp[ab][bc][ca][j][t] = Search(ab - 1, bc, ca, j, 0)*ab / (ab + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tcin >> N;\\n\\tvector<int>a(101);\\n\\tvector<int>b(101);\\n\\tvector<int>c(101);\\n\\tcin >> M;\\n\\tfor (int i = 0; i<M; i++) {\\n\\t\\tcin >> K;\\n\\t\\ta[K] ^= 1;\\n\\t}\\n\\tcin >> M;\\n\\tfor (int i = 0; i<M; i++) {\\n\\t\\tcin >> K;\\n\\t\\tb[K] ^= 1;\\n\\t}\\n\\tcin >> M;\\n\\tfor (int i = 0; i<M; i++) {\\n\\t\\tcin >> K;\\n\\t\\tc[K] ^= 1;\\n\\t}\\n\\tint ab = 0, bc = 0, ca = 0;\\n\\tfor (int i = 1; i <= N; i++)ab += a[i] & b[i];\\n\\tfor (int i = 1; i <= N; i++)bc += b[i] & c[i];\\n\\tfor (int i = 1; i <= N; i++)ca += c[i] & a[i];\\n\\tint joker = 0;\\n\\tif (b[0])joker = 1;\\n\\tif (c[0])joker = 2;\\n\\tint turn = 0;\\n\\tfor (int i = 0; i <= 100; i++)for (int j = 0; j <= 100; j++)for (int k = 0; k <= 100; k++)for (int l = 0; l<3; l++)for (int m = 0; m<3; m++)dp[i][j][k][l][m] = -1;\\n\\tcout << setprecision(20) << Search(ab, bc, ca, joker, turn) << endl;\\n\\t//for(int i=0;i<=N;i++)for(int j=0;j<=N;j++)for(int k=0;k<=N;k++)for(int l=0;l<3;l++)for(int m=0;m<3;m++)if(dp[i][j][k][l][m]>=0)cout<<i<<\\\" \\\"<<j<<\\\" \\\"<<k<<\\\" \\\"<<l<<\\\" \\\"<<m<<\\\" \\\"<<dp[i][j][k][l][m]<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 40,\n \"memory_kb\": 148176,\n \"score_of_the_acc\": -1.0515,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2802_3987680\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\nint N,M,K,L,R,H,W;\\n//long long int N,M,K,L,R,H,W;\\n\\nconstexpr long long int MOD=1000000007;\\n//constexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n//constexpr long long int MOD=998244353;\\n\\nconstexpr long double EPS=1e-8;\\n\\nlong double dp[101][101][101][3][3];\\n\\ndouble Search(int ab,int bc,int ca,int j,int t){\\n\\t//cout<<ab<<\\\" \\\"<<bc<<\\\" \\\"<<ca<<\\\" \\\"<<j<<\\\" \\\"<<t<<endl;\\n\\tif(dp[ab][bc][ca][j][t]>=0)return dp[ab][bc][ca][j][t];\\n\\tif(!ab&&!bc&&!ca){\\n\\t\\tif(j==1)return dp[0][0][0][1][t]=0;\\n\\t\\telse return dp[0][0][0][j][t]=1;\\n\\t}\\n\\tif(!ab&&!bc&&j!=1&&t==1)return dp[ab][bc][ca][j][t]=Search(ab,bc,ca,j,2);\\n\\tif(!bc&&!ca&&j!=2&&t==2)return dp[ab][bc][ca][j][t]=Search(ab,bc,ca,j,0);\\n\\tif(!ca&&!ab&&j!=0&&t==0)return dp[ab][bc][ca][j][t]=Search(ab,bc,ca,j,1);\\n\\t//nxが1のとき不正が発生\\n\\tint nx;\\n\\tif(t==0){\\n\\t\\tnx=2;\\n\\t\\tif(!bc&&!ca&&j!=2){\\n\\t\\t\\tnx=1;\\n\\t\\t\\tif(!ab){\\n\\t\\t\\t\\tif(j==0)return dp[ab][bc][ca][j][t]=1;\\n\\t\\t\\t\\telse return dp[ab][bc][ca][j][t]=0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\telse if(t==1){\\n\\t\\tnx=0;\\n\\t\\tif(!ab&&!ca&&j!=0){\\n\\t\\t\\tnx=2;\\n\\t\\t\\tif(!bc){\\n\\t\\t\\t\\tif(j==1)return dp[ab][bc][ca][j][t]=0;\\n\\t\\t\\t\\telse return dp[ab][bc][ca][j][t]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\telse {\\n\\t\\tnx=1;\\n\\t\\tif(!ab&&!bc&&j!=1){\\n\\t\\t\\tnx=0;\\n\\t\\t\\tif(!ca){\\n\\t\\t\\t\\treturn dp[ab][bc][ca][j][t]=0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(nx==1){\\n\\t\\tif(t==0){\\n\\t\\t\\treturn dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,1);\\n\\t\\t}\\n\\t\\tif(t==2){\\n\\t\\t\\tif(bc){\\n\\t\\t\\t\\tif(ab||ca||j==0)return dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,0);\\n\\t\\t\\t\\telse return dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,1);\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tif(ab){\\n\\t\\t\\t\\t\\tif(ab-1||bc||j==1)return dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,1);\\n\\t\\t\\t\\t\\telse if(bc||ca||j==2)return dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,2);\\n\\t\\t\\t\\t\\telse return dp[ab][bc][ca][j][t]=1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\treturn dp[ab][bc][ca][j][t]=Search(ab,bc,ca-1,2,t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(nx==2){\\n\\t\\tif(t==1){\\n\\t\\t\\tif(j==1){\\n\\t\\t\\t\\treturn dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,2);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\treturn dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,2)*bc/(bc+1)+Search(ab,bc-1,ca,1,1)/(bc+1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(t==0){\\n\\t\\t\\tif(ca){\\n\\t\\t\\t\\tif(ab||bc||j==1)return dp[ab][bc][ca][j][t]=Search(ab,bc,ca-1,j,1);\\n\\t\\t\\t\\telse return dp[ab][bc][ca][j][t]=Search(ab,bc,ca-1,j,2);\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tif(bc)return dp[ab][bc][ca][j][t]=Search(ab+1,bc-1,ca,j,1);\\n\\t\\t\\t\\telse dp[ab][bc][ca][j][t]=Search(ab,bc,ca,0,1);\\n\\t\\t\\t\\t//if(bc){\\n\\t\\t\\t\\t//\\tif(j==2)return dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,2);\\n\\t\\t\\t\\t//\\telse dp[ab][bc][ca][j][t]=Search(ab,bc-1,ca,j,0);\\n\\t\\t\\t\\t//}\\n\\t\\t\\t\\t//else{\\n\\t\\t\\t\\t//\\tdp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,0);\\n\\t\\t\\t\\t//}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(nx==0){\\n\\t\\tif(t==2){\\n\\t\\t\\treturn dp[ab][bc][ca][j][t]=Search(ab,bc,ca-1,j,0);\\n\\t\\t}\\n\\t\\tif(t==1){\\n\\t\\t\\tif(bc||ca||j==2){\\n\\t\\t\\t\\tif(j!=0){\\n\\t\\t\\t\\t\\treturn dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,2)*ab/(ab+ca)+Search(ab,bc,ca-1,j,0)*ca/(ab+ca);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tif(bc)return dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,2)*ab/(ab+ca+1)+Search(ab,bc,ca-1,j,0)*ca/(ab+ca+1)+Search(ab,bc-1,ca,1,0)/(ab+ca+1);\\n\\t\\t\\t\\t\\telse return dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,2)*ab/(ab+ca+1)+Search(ab,bc,ca-1,j,0)*ca/(ab+ca+1)+Search(ab-1,bc,ca,1,1)/(ab+ca+1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tif(j==1){\\n\\t\\t\\t\\t\\treturn dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\treturn dp[ab][bc][ca][j][t]=Search(ab-1,bc,ca,j,0)*ab/(ab+1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t\\n\\tcin>>N;\\n\\tvector<int>a(101);\\n\\tvector<int>b(101);\\n\\tvector<int>c(101);\\n\\tcin>>M;\\n\\tfor(int i=0;i<M;i++){\\n\\t\\tcin>>K;\\n\\t\\ta[K]^=1;\\n\\t}\\n\\tcin>>M;\\n\\tfor(int i=0;i<M;i++){\\n\\t\\tcin>>K;\\n\\t\\tb[K]^=1;\\n\\t}\\n\\tcin>>M;\\n\\tfor(int i=0;i<M;i++){\\n\\t\\tcin>>K;\\n\\t\\tc[K]^=1;\\n\\t}\\n\\tint ab=0,bc=0,ca=0;\\n\\tfor(int i=1;i<=N;i++)ab+=a[i]&b[i];\\n\\tfor(int i=1;i<=N;i++)bc+=b[i]&c[i];\\n\\tfor(int i=1;i<=N;i++)ca+=c[i]&a[i];\\n\\tint joker=0;\\n\\tif(b[0])joker=1;\\n\\tif(c[0])joker=2;\\n\\tint turn =0;\\n\\tfor(int i=0;i<=100;i++)for(int j=0;j<=100;j++)for(int k=0;k<=100;k++)for(int l=0;l<3;l++)for(int m=0;m<3;m++)dp[i][j][k][l][m]=-1;\\n\\tcout<<setprecision(20)<<Search(ab,bc,ca,joker,turn)<<endl;\\n\\t//for(int i=0;i<=N;i++)for(int j=0;j<=N;j++)for(int k=0;k<=N;k++)for(int l=0;l<3;l++)for(int m=0;m<3;m++)if(dp[i][j][k][l][m]>=0)cout<<i<<\\\" \\\"<<j<<\\\" \\\"<<k<<\\\" \\\"<<l<<\\\" \\\"<<m<<\\\" \\\"<<dp[i][j][k][l][m]<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 40,\n \"memory_kb\": 148184,\n \"score_of_the_acc\": -1.0515,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2802_2915563\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld =long double;\\nconst ld eps = 1e-9;\\n\\n\\n//namespace cent {\\n//\\n//\\tstruct Edge {\\n//\\t\\tint src;\\n//\\t\\tint dst;\\n//\\t\\tlong long int cost;\\n//\\t};\\n//\\tusing Graph = vector<vector<Edge>>;\\n//\\n//\\tclass Centroid {\\n//\\tprivate:\\n//\\t\\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tint sum = 1;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ch_nums[now] = sum;\\n//\\t\\t}\\n//\\n//\\t\\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tfor (auto&& e : graph[pre_root]) {\\n//\\t\\t\\t\\tif (e.dst == pre_from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t}\\n//\\t\\t\\treturn pre_root;\\n//\\t\\t}\\n//\\n//\\t\\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\\n//\\t\\t\\tmp[make_pair(root,now)]=depth;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tdfs2(g,root,e.dst,e.src,oks,depth+1);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t};\\n//\\n//\\n//\\t\\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\\n//\\t\\t\\tdfs(graph, root, from, ch_nums, oks);\\n//\\n//\\t\\t\\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\\n//\\n//\\n//\\t\\t\\tdfs2(graph,cent_id,cent_id,-1,oks,0);\\n//\\t\\t\\tlens1[cent_id][make_pair(0,0)]--;\\n//\\t\\t\\tlens2[cent_id][0]--;\\n//\\n//\\n//\\t\\t\\toks[cent_id] = depth;\\n//\\n//\\t\\t\\t//for (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t//\\tif (e.dst == from)continue;\\n//\\t\\t\\t//\\tif (oks[e.dst] != -1)continue;\\n//\\n//\\t\\t\\t//\\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\\n//\\n//\\t\\t\\t//\\tfor (auto&& l1 : lens1[e.dst]) {\\n//\\t\\t\\t//\\t\\tint keta = l1.first.second;\\n//\\t\\t\\t//\\t\\tlong long int num = l1.first.first;\\n//\\n//\\t\\t\\t//\\t\\tlong long int need = (mod - num) / mod_pow(10, keta);\\n//\\t\\t\\t//\\t\\tneed%=mod;\\n//\\t\\t\\t//\\t\\tauto it = lens2[e.dst].find(need);\\n//\\t\\t\\t//\\t\\tif (it != lens2[e.dst].end()) {\\n//\\t\\t\\t//\\t\\t\\tans -= l1.second*it->second;\\n//\\t\\t\\t//\\t\\t}\\n//\\t\\t\\t//\\t}\\n//\\t\\t\\t//\\tlens1[e.dst].clear();\\n//\\t\\t\\t//\\tlens2[e.dst].clear();\\n//\\t\\t\\t//}\\n//\\n//\\t\\t\\tif (from != -1) {\\n//\\t\\t\\t\\tcentroid_edges[from].push_back(cent_id);\\n//\\t\\t\\t}\\n//\\t\\t\\telse {\\n//\\t\\t\\t\\tfst_centroid = cent_id;\\n//\\t\\t\\t}\\n//\\t\\t\\tfor (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t\\tif (e.dst == from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\n//\\tpublic:\\n//\\n//\\t\\tmap<pair<int,int>,int>mp;\\n//\\n//\\t\\tvector<map<pair<long long int,int>, long long int>>lens1;\\n//\\t\\tvector<map<long long int, long long int>>lens2;\\n//\\t\\tvector<vector<int>> centroid_graph;\\n//\\t\\tvector<int>ts;\\n//\\t\\tvector<int>parents;\\n//\\t\\tvector<int>oks;\\n//\\t\\tvector<int>anss;\\n//\\n//\\t\\t//fst:root snd:centroid_graph\\n//\\t\\tvoid init(const Graph&g) {\\n//\\t\\t\\tlens1.resize(g.size());\\n//\\t\\t\\tlens2.resize(g.size());\\n//\\t\\t\\toks = vector<int>(g.size(), -1);\\n//\\t\\t\\tint root = -1;\\n//\\t\\t\\tcentroid_graph.resize(g.size());\\n//\\t\\t\\tparents = vector<int>(g.size(), -1);\\n//\\t\\t\\tts=vector<int>(g.size(),-1);\\n//\\t\\t\\tanss=vector<int>(g.size(),100000);\\n//\\n//\\t\\t\\tvector<int>ch_nums(g.size());\\n//\\t\\t\\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\\n//\\n//\\t\\t\\tfor (int i = 0; i < centroid_graph.size(); ++i) {\\n//\\t\\t\\t\\tfor (auto&& e : centroid_graph[i]) {\\n//\\t\\t\\t\\t\\tparents[e] = i;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ;\\n//\\t\\t}\\n//\\t}centroid;\\n//\\n//\\n//\\tvoid addEdge(Graph& g, int a, int b, long long int c) {\\n//\\t\\tg[a].push_back(Edge{ a,b,c });\\n//\\t\\tg[b].push_back(Edge{ b,a,c });\\n//\\t}\\n//}\\n\\n\\n//const int mod = 1000000007;\\n//struct Mod {\\n//public:\\n//\\tint num;\\n//\\tMod() : Mod(0) { ; }\\n//\\tMod(long long int n) : num((n % mod + mod) % mod) {\\n//\\t\\tstatic_assert(mod<INT_MAX / 2, \\\"mod is too big, please make num 'long long int' from 'int'\\\");\\n//\\t}\\n//\\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\\n//\\toperator int() { return num; }\\n//};\\n//\\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\\n//Mod operator++(Mod &a) { return a + Mod(1); }\\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\\n//Mod operator--(Mod &a) { return a - Mod(1); }\\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\\n//Mod operator^(const Mod a, const int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = (a * a) ^ (n / 2);\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//Mod mod_pow(const Mod a, const long long int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = mod_pow((a * a), (n / 2));\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//\\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\\n//Mod operator/(const Mod a, const Mod b) {\\n//\\tassert(b.num != 0);\\n//\\treturn a * inv(b);\\n//}\\n//Mod operator/(const long long int a, const Mod b) {\\n//\\treturn Mod(a) / b;\\n//}\\n//Mod operator/=(Mod &a, const Mod b) {\\n//\\treturn a = a / b;\\n//}\\n//\\n//#define MAX_MOD_N 1024000\\n//\\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\\n//void init(const int amax = MAX_MOD_N) {\\n//\\tfact[0] = Mod(1); factinv[0] = 1;\\n//\\tfor (int i = 0; i < amax - 1; ++i) {\\n//\\t\\tfact[i + 1] = fact[i] * Mod(i + 1);\\n//\\t\\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\\n//\\t}\\n//}\\n//Mod comb(const int a, const int b) {\\n//\\treturn fact[a] * factinv[b] * factinv[a - b];\\n//}\\n//\\n//vector<int>primes;\\n//void hurui(const int amax=3500) {\\n//\\tstatic bool flag = false;\\n//\\tif (flag)return;\\n//\\tvector<int>sos;\\n//\\tsos = vector<int>(amax + 1, true);\\n//\\tsos[0] = false; sos[1] = false;\\n//\\tfor (int i = 2; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\\n//\\t\\t}\\n//\\t}\\n//\\tfor (int i = 0; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tprimes.push_back(i);\\n//\\t\\t}\\n//\\t}\\n//\\tflag = true;\\n//}\\n//\\n//\\n//struct query {\\n//\\tint u;\\n//\\tint v;\\n//\\tmap<int,int>mp;\\n//};\\n//\\n//map<int, int>mk_mp(const int a) {\\n//\\tint rest(a);\\n//\\tmap<int,int>as;\\n//\\tfor (auto pr : primes) {\\n//\\t\\twhile (rest%pr == 0) {\\n//\\t\\t\\tas[pr]++;\\n//\\t\\t\\trest /= pr;\\n//\\t\\t}\\n//\\t}\\n//\\tif (rest!=1)as[rest]++;\\n//\\treturn as;\\n//}\\n//\\n//#define Seg_Max_N (1<<18) \\n//\\n//class Tree {\\n//public:\\n//\\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\\n//\\t\\tT.resize(V);\\n//\\t\\tfor (int i = 0; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i].resize(V);\\n//\\t\\t}\\n//\\t\\tdepth.resize(V);\\n//\\t}\\n//\\t// uとvをつなぐ\\n//\\t// lcaを求めることが主目的なので無向グラフとしている\\n//\\tvoid unite(int u, int v) {\\n//\\t\\tT[u].push_back(v);\\n//\\t\\tT[v].push_back(u);\\n//\\t}\\n//\\tvoid unite(vector<vector<int>>&e) {\\n//\\t\\tT = e;\\n//\\t}\\n//\\t// initする\\n//\\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\\n//\\tvoid init() {\\n//\\t\\tdfs(root, 0, 0);\\n//\\t\\tint id = 0;\\n//\\t\\tgetid(root, 0, id);\\n//\\t}\\n//\\t// uとvのlcaを求める\\n//\\tint lca(int u, int v) const {\\n//\\t\\tif (depth[u] > depth[v]) swap(u, v);\\n//\\t\\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\\t// uとvの距離を求める\\n//\\t// edgeを定義しないといけない時はこれじゃダメ\\n//\\tint dist(int u, int v) const {\\n//\\t\\tint p = lca(u, v);\\n//\\t\\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\\n//\\t}\\n//\\tint dfs(int v, int p, int d) {\\n//\\t\\tparent[0][v] = p;\\n//\\t\\tdepth[v] = d;\\n//\\t\\tcnum[v] = 0;\\n//\\t\\tfor (int i = 1; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\\n//\\t\\t}\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) cnum[v] += dfs(next, v, d + 1);\\n//\\t\\t}\\n//\\t\\treturn cnum[v] + 1;\\n//\\t}\\n//\\n//\\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) dfs2(next, v, doubles, nums);\\n//\\t\\t}\\n//\\t\\tdoubles[0][v] = nums[v];\\n//\\t\\tfor (int j = 1; j < MAXLOGV; ++j) {\\n//\\t\\t\\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\\n//\\t\\t}\\n//\\t\\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\\n//\\t\\t\\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\\n//\\t\\t}\\n//\\t}\\n//\\t//ここでは親から距離2^iの部分木の最小値を求めている\\n//\\tvector<vector<int>>get_doubles(const vector<int>&nums) {\\n//\\t\\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\\n//\\t\\tdfs2(root, -1, doubles, nums);\\n//\\t\\treturn doubles;\\n//\\t}\\n//\\n//\\tvoid getid(const int v, const int p, int &nplace) {\\n//\\t\\tplace[v] = nplace;\\n//\\t\\tid[nplace] = v;\\n//\\t\\tnplace++;\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) getid(next, v, nplace);\\n//\\t\\t}\\n//\\t}\\n//\\tstatic const int MAXLOGV = 25;\\n//\\t// グラフの隣接リスト表現\\n//\\tvector<vector<int> > T;\\n//\\t// 頂点の数\\n//\\tint V;\\n//\\t// 根ノードの番号\\n//\\tint root;\\n//\\n//\\t// 親ノード\\n//\\tvector<int> parent[MAXLOGV];\\n//\\t// 根からの深さ\\n//\\tvector<int> depth;\\n//\\n//\\t//子の数\\n//\\tvector<int>cnum;\\n//\\n//\\t//変換\\n//\\tvector<int>place;\\n//\\tvector<int>id;\\n//\\n//};\\n//\\n//vector<int>pas;\\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\\n//\\ttos[now]=id;\\n//\\tlrs[tos[now]].first=id++;\\n//\\tfor (auto e : edges[now]) {\\n//\\t\\tif (e == from) {\\n//\\t\\t\\tpas[now] = from;\\n//\\t\\t\\tcontinue;\\n//\\t\\t}\\n//\\t\\tadfs(lrs,tos,edges,e,now,id);\\n//\\t}\\n//\\tlrs[tos[now]].second=id;\\n//}\\n//\\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\\n//\\tpas.resize(tos.size());pas[0]=-1;\\n//\\tvector<pair<int,int>>lrs(edges.size());\\n//\\tint id=0;\\n//\\tadfs(lrs,tos,edges,0,-1,id);\\n//\\treturn lrs;\\n//}\\n\\n\\nld memo[101][101][101][3][3];\\n\\nld solve(int a, int b, int c, int d, int e) ;\\n\\nld solve(vector<int>v, int joker, int player) {\\n\\tif(!(v[0]>=0&&v[1]>=0&&v[2]>=0&&joker>=0&&joker<=2&&player>=0&&player<=2))return 0;\\n\\tif (memo[v[0]][v[1]][v[2]][joker][player] < -0.5) {\\n\\t\\tif (v[0] == 0 && v[1] == 0 && v[2] == 0) {\\n\\t\\t\\tif (joker == 1) {\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=0;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tconst int n_player=(player+1)%3;\\n\\t\\t\\t// A no card\\n\\t\\t\\tif (v[0] == 0 && v[2] == 0 && joker != 0) {\\n\\t\\t\\t\\tif (player == 0) {\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = solve(v, joker, n_player);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tconst int drawn_player=(player^3);\\n\\t\\t\\t\\t\\tld ans = 0;\\n\\t\\t\\t\\t\\tif (drawn_player == 2) {\\n\\t\\t\\t\\t\\t\\tans+=(joker==drawn_player)*solve(v,player, n_player);\\n\\t\\t\\t\\t\\t\\tans+=v[1]*solve(v[0],v[1]-1,v[2],joker, n_player);\\n\\n\\t\\t\\t\\t\\t\\tans/=(joker==2)+v[1];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tassert(v[1]);\\n\\t\\t\\t\\t\\t\\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// B no card\\n\\t\\t\\telse if (v[0] == 0 && v[1] == 0 && joker != 1) {\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = 1;\\n\\t\\t\\t}\\n\\t\\t\\t// C no card\\n\\t\\t\\telse if (v[1] == 0 && v[2] == 0 && joker != 2) {\\n\\t\\t\\t\\tif (player == 2) {\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=solve(v,joker,n_player);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tconst int drawn_player = (player ^ 1);\\n\\t\\t\\t\\t\\tld ans = 0;\\n\\t\\t\\t\\t\\tif (drawn_player==0) {\\n\\t\\t\\t\\t\\t\\tans += (joker == drawn_player)*solve(v, player ,n_player);\\n\\t\\t\\t\\t\\t\\tans += v[0]*solve(v[0]-1, v[1], v[2], joker, n_player);\\n\\n\\t\\t\\t\\t\\t\\tassert((joker==0)+v[0]>=1);\\n\\t\\t\\t\\t\\t\\tans /= (joker == 0) + v[0];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tassert(v[0]);\\n\\t\\t\\t\\t\\t\\tans = solve(v[0]-1, v[1], v[2], joker, n_player);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tld ans=0;\\n\\t\\t\\t\\tint drawn_player=(player+2)%3;\\n\\t\\t\\t\\tif (player == 0) {\\n\\t\\t\\t\\t\\tans+=v[1]*solve(v[0]+1,v[1]-1,v[2],joker,n_player);\\n\\t\\t\\t\\t\\tans+=v[2]*solve(v[0],v[1],v[2]-1,joker,n_player);\\n\\t\\t\\t\\t\\tans+=(joker==2)*solve(v[0],v[1],v[2],0,n_player);\\n\\n\\t\\t\\t\\t\\tassert(v[1]+v[2]+(joker==2)>=1);\\n\\t\\t\\t\\t\\tans/=v[1]+v[2]+(joker==2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (player == 1) {\\n\\t\\t\\t\\t\\tans+=v[2]*solve(v[0],v[1]+1,v[2]-1,joker,n_player);\\n\\t\\t\\t\\t\\tans+=v[0]*solve(v[0]-1,v[1],v[2],joker,n_player);\\n\\t\\t\\t\\t\\tans+=(joker==0)*solve(v[0],v[1],v[2],1,n_player);\\n\\n\\t\\t\\t\\t\\tassert(v[2]+v[0]+(joker==0)>=1);\\n\\t\\t\\t\\t\\tans/=v[2]+v[0]+(joker==0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (player == 2) {\\n\\t\\t\\t\\t\\tif (v[1]) {\\n\\t\\t\\t\\t\\t\\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (v[0]) {\\n\\t\\t\\t\\t\\t\\tans=solve(v[0]-1,v[1],v[2]+1,joker,n_player);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tassert(joker==1);\\n\\t\\t\\t\\t\\t\\tans=solve(v,player,n_player);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn memo[v[0]][v[1]][v[2]][joker][player];\\n}\\n\\nld solve(int a, int b, int c, int d, int e) {\\n\\treturn solve(vector<int>{a, b, c},d,e);\\n}\\n\\nint main()\\n{\\n\\n\\tint AB=0,BC=0,CA=0;\\n\\tint joker=-1;\\n\\n\\tfor (int i = 0; i < 101; ++i) {\\n\\t\\tfor (int j = 0; j < 101; ++j) {\\n\\t\\t\\tfor (int k = 0; k < 101; ++k) {\\n\\t\\t\\t\\tfor (int l = 0; l < 3; ++l) {\\n\\t\\t\\t\\t\\tfor (int m = 0; m < 3; ++m) {\\n\\t\\t\\t\\t\\t\\tmemo[i][j][k][l][m]=-1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tint N; cin >> N;\\n\\n\\t\\tvector<vector<int>>nums(3, vector<int>(101));\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tint m; cin >> m;\\n\\t\\t\\tmap<int, int>mp;\\n\\t\\t\\twhile (m--) {\\n\\t\\t\\t\\tint a; cin >> a;\\n\\t\\t\\t\\tmp[a]++;\\n\\t\\t\\t}\\n\\t\\t\\tfor (auto m : mp) {\\n\\t\\t\\t\\tif (m.second % 2)nums[i][m.first]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i = 0; i <= N; ++i) {\\n\\t\\t\\tif (i == 0) {\\n\\t\\t\\t\\tfor (int j = 0; j < 3; ++j) {\\n\\t\\t\\t\\t\\tif (nums[j][i]) {\\n\\t\\t\\t\\t\\t\\tjoker=j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (nums[0][i] && nums[1][i]) {\\n\\t\\t\\t\\t\\tAB++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (nums[1][i] && nums[2][i]) {\\n\\t\\t\\t\\t\\tBC++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (nums[2][i] && nums[0][i]) {\\n\\t\\t\\t\\t\\tCA++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tld ans=solve(AB,BC,CA,joker,0);\\n\\n\\tcout<<setprecision(10)<<fixed<<double(ans)<<endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 148208,\n \"score_of_the_acc\": -1.0862,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2802_2915543\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = __float128;\\nconst ld eps = 1e-9;\\n\\n\\n//namespace cent {\\n//\\n//\\tstruct Edge {\\n//\\t\\tint src;\\n//\\t\\tint dst;\\n//\\t\\tlong long int cost;\\n//\\t};\\n//\\tusing Graph = vector<vector<Edge>>;\\n//\\n//\\tclass Centroid {\\n//\\tprivate:\\n//\\t\\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tint sum = 1;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ch_nums[now] = sum;\\n//\\t\\t}\\n//\\n//\\t\\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tfor (auto&& e : graph[pre_root]) {\\n//\\t\\t\\t\\tif (e.dst == pre_from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t}\\n//\\t\\t\\treturn pre_root;\\n//\\t\\t}\\n//\\n//\\t\\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\\n//\\t\\t\\tmp[make_pair(root,now)]=depth;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tdfs2(g,root,e.dst,e.src,oks,depth+1);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t};\\n//\\n//\\n//\\t\\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\\n//\\t\\t\\tdfs(graph, root, from, ch_nums, oks);\\n//\\n//\\t\\t\\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\\n//\\n//\\n//\\t\\t\\tdfs2(graph,cent_id,cent_id,-1,oks,0);\\n//\\t\\t\\tlens1[cent_id][make_pair(0,0)]--;\\n//\\t\\t\\tlens2[cent_id][0]--;\\n//\\n//\\n//\\t\\t\\toks[cent_id] = depth;\\n//\\n//\\t\\t\\t//for (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t//\\tif (e.dst == from)continue;\\n//\\t\\t\\t//\\tif (oks[e.dst] != -1)continue;\\n//\\n//\\t\\t\\t//\\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\\n//\\n//\\t\\t\\t//\\tfor (auto&& l1 : lens1[e.dst]) {\\n//\\t\\t\\t//\\t\\tint keta = l1.first.second;\\n//\\t\\t\\t//\\t\\tlong long int num = l1.first.first;\\n//\\n//\\t\\t\\t//\\t\\tlong long int need = (mod - num) / mod_pow(10, keta);\\n//\\t\\t\\t//\\t\\tneed%=mod;\\n//\\t\\t\\t//\\t\\tauto it = lens2[e.dst].find(need);\\n//\\t\\t\\t//\\t\\tif (it != lens2[e.dst].end()) {\\n//\\t\\t\\t//\\t\\t\\tans -= l1.second*it->second;\\n//\\t\\t\\t//\\t\\t}\\n//\\t\\t\\t//\\t}\\n//\\t\\t\\t//\\tlens1[e.dst].clear();\\n//\\t\\t\\t//\\tlens2[e.dst].clear();\\n//\\t\\t\\t//}\\n//\\n//\\t\\t\\tif (from != -1) {\\n//\\t\\t\\t\\tcentroid_edges[from].push_back(cent_id);\\n//\\t\\t\\t}\\n//\\t\\t\\telse {\\n//\\t\\t\\t\\tfst_centroid = cent_id;\\n//\\t\\t\\t}\\n//\\t\\t\\tfor (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t\\tif (e.dst == from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\n//\\tpublic:\\n//\\n//\\t\\tmap<pair<int,int>,int>mp;\\n//\\n//\\t\\tvector<map<pair<long long int,int>, long long int>>lens1;\\n//\\t\\tvector<map<long long int, long long int>>lens2;\\n//\\t\\tvector<vector<int>> centroid_graph;\\n//\\t\\tvector<int>ts;\\n//\\t\\tvector<int>parents;\\n//\\t\\tvector<int>oks;\\n//\\t\\tvector<int>anss;\\n//\\n//\\t\\t//fst:root snd:centroid_graph\\n//\\t\\tvoid init(const Graph&g) {\\n//\\t\\t\\tlens1.resize(g.size());\\n//\\t\\t\\tlens2.resize(g.size());\\n//\\t\\t\\toks = vector<int>(g.size(), -1);\\n//\\t\\t\\tint root = -1;\\n//\\t\\t\\tcentroid_graph.resize(g.size());\\n//\\t\\t\\tparents = vector<int>(g.size(), -1);\\n//\\t\\t\\tts=vector<int>(g.size(),-1);\\n//\\t\\t\\tanss=vector<int>(g.size(),100000);\\n//\\n//\\t\\t\\tvector<int>ch_nums(g.size());\\n//\\t\\t\\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\\n//\\n//\\t\\t\\tfor (int i = 0; i < centroid_graph.size(); ++i) {\\n//\\t\\t\\t\\tfor (auto&& e : centroid_graph[i]) {\\n//\\t\\t\\t\\t\\tparents[e] = i;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ;\\n//\\t\\t}\\n//\\t}centroid;\\n//\\n//\\n//\\tvoid addEdge(Graph& g, int a, int b, long long int c) {\\n//\\t\\tg[a].push_back(Edge{ a,b,c });\\n//\\t\\tg[b].push_back(Edge{ b,a,c });\\n//\\t}\\n//}\\n\\n\\n//const int mod = 1000000007;\\n//struct Mod {\\n//public:\\n//\\tint num;\\n//\\tMod() : Mod(0) { ; }\\n//\\tMod(long long int n) : num((n % mod + mod) % mod) {\\n//\\t\\tstatic_assert(mod<INT_MAX / 2, \\\"mod is too big, please make num 'long long int' from 'int'\\\");\\n//\\t}\\n//\\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\\n//\\toperator int() { return num; }\\n//};\\n//\\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\\n//Mod operator++(Mod &a) { return a + Mod(1); }\\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\\n//Mod operator--(Mod &a) { return a - Mod(1); }\\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\\n//Mod operator^(const Mod a, const int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = (a * a) ^ (n / 2);\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//Mod mod_pow(const Mod a, const long long int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = mod_pow((a * a), (n / 2));\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//\\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\\n//Mod operator/(const Mod a, const Mod b) {\\n//\\tassert(b.num != 0);\\n//\\treturn a * inv(b);\\n//}\\n//Mod operator/(const long long int a, const Mod b) {\\n//\\treturn Mod(a) / b;\\n//}\\n//Mod operator/=(Mod &a, const Mod b) {\\n//\\treturn a = a / b;\\n//}\\n//\\n//#define MAX_MOD_N 1024000\\n//\\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\\n//void init(const int amax = MAX_MOD_N) {\\n//\\tfact[0] = Mod(1); factinv[0] = 1;\\n//\\tfor (int i = 0; i < amax - 1; ++i) {\\n//\\t\\tfact[i + 1] = fact[i] * Mod(i + 1);\\n//\\t\\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\\n//\\t}\\n//}\\n//Mod comb(const int a, const int b) {\\n//\\treturn fact[a] * factinv[b] * factinv[a - b];\\n//}\\n//\\n//vector<int>primes;\\n//void hurui(const int amax=3500) {\\n//\\tstatic bool flag = false;\\n//\\tif (flag)return;\\n//\\tvector<int>sos;\\n//\\tsos = vector<int>(amax + 1, true);\\n//\\tsos[0] = false; sos[1] = false;\\n//\\tfor (int i = 2; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\\n//\\t\\t}\\n//\\t}\\n//\\tfor (int i = 0; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tprimes.push_back(i);\\n//\\t\\t}\\n//\\t}\\n//\\tflag = true;\\n//}\\n//\\n//\\n//struct query {\\n//\\tint u;\\n//\\tint v;\\n//\\tmap<int,int>mp;\\n//};\\n//\\n//map<int, int>mk_mp(const int a) {\\n//\\tint rest(a);\\n//\\tmap<int,int>as;\\n//\\tfor (auto pr : primes) {\\n//\\t\\twhile (rest%pr == 0) {\\n//\\t\\t\\tas[pr]++;\\n//\\t\\t\\trest /= pr;\\n//\\t\\t}\\n//\\t}\\n//\\tif (rest!=1)as[rest]++;\\n//\\treturn as;\\n//}\\n//\\n//#define Seg_Max_N (1<<18) \\n//\\n//class Tree {\\n//public:\\n//\\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\\n//\\t\\tT.resize(V);\\n//\\t\\tfor (int i = 0; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i].resize(V);\\n//\\t\\t}\\n//\\t\\tdepth.resize(V);\\n//\\t}\\n//\\t// uとvをつなぐ\\n//\\t// lcaを求めることが主目的なので無向グラフとしている\\n//\\tvoid unite(int u, int v) {\\n//\\t\\tT[u].push_back(v);\\n//\\t\\tT[v].push_back(u);\\n//\\t}\\n//\\tvoid unite(vector<vector<int>>&e) {\\n//\\t\\tT = e;\\n//\\t}\\n//\\t// initする\\n//\\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\\n//\\tvoid init() {\\n//\\t\\tdfs(root, 0, 0);\\n//\\t\\tint id = 0;\\n//\\t\\tgetid(root, 0, id);\\n//\\t}\\n//\\t// uとvのlcaを求める\\n//\\tint lca(int u, int v) const {\\n//\\t\\tif (depth[u] > depth[v]) swap(u, v);\\n//\\t\\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\\t// uとvの距離を求める\\n//\\t// edgeを定義しないといけない時はこれじゃダメ\\n//\\tint dist(int u, int v) const {\\n//\\t\\tint p = lca(u, v);\\n//\\t\\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\\n//\\t}\\n//\\tint dfs(int v, int p, int d) {\\n//\\t\\tparent[0][v] = p;\\n//\\t\\tdepth[v] = d;\\n//\\t\\tcnum[v] = 0;\\n//\\t\\tfor (int i = 1; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\\n//\\t\\t}\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) cnum[v] += dfs(next, v, d + 1);\\n//\\t\\t}\\n//\\t\\treturn cnum[v] + 1;\\n//\\t}\\n//\\n//\\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) dfs2(next, v, doubles, nums);\\n//\\t\\t}\\n//\\t\\tdoubles[0][v] = nums[v];\\n//\\t\\tfor (int j = 1; j < MAXLOGV; ++j) {\\n//\\t\\t\\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\\n//\\t\\t}\\n//\\t\\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\\n//\\t\\t\\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\\n//\\t\\t}\\n//\\t}\\n//\\t//ここでは親から距離2^iの部分木の最小値を求めている\\n//\\tvector<vector<int>>get_doubles(const vector<int>&nums) {\\n//\\t\\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\\n//\\t\\tdfs2(root, -1, doubles, nums);\\n//\\t\\treturn doubles;\\n//\\t}\\n//\\n//\\tvoid getid(const int v, const int p, int &nplace) {\\n//\\t\\tplace[v] = nplace;\\n//\\t\\tid[nplace] = v;\\n//\\t\\tnplace++;\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) getid(next, v, nplace);\\n//\\t\\t}\\n//\\t}\\n//\\tstatic const int MAXLOGV = 25;\\n//\\t// グラフの隣接リスト表現\\n//\\tvector<vector<int> > T;\\n//\\t// 頂点の数\\n//\\tint V;\\n//\\t// 根ノードの番号\\n//\\tint root;\\n//\\n//\\t// 親ノード\\n//\\tvector<int> parent[MAXLOGV];\\n//\\t// 根からの深さ\\n//\\tvector<int> depth;\\n//\\n//\\t//子の数\\n//\\tvector<int>cnum;\\n//\\n//\\t//変換\\n//\\tvector<int>place;\\n//\\tvector<int>id;\\n//\\n//};\\n//\\n//vector<int>pas;\\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\\n//\\ttos[now]=id;\\n//\\tlrs[tos[now]].first=id++;\\n//\\tfor (auto e : edges[now]) {\\n//\\t\\tif (e == from) {\\n//\\t\\t\\tpas[now] = from;\\n//\\t\\t\\tcontinue;\\n//\\t\\t}\\n//\\t\\tadfs(lrs,tos,edges,e,now,id);\\n//\\t}\\n//\\tlrs[tos[now]].second=id;\\n//}\\n//\\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\\n//\\tpas.resize(tos.size());pas[0]=-1;\\n//\\tvector<pair<int,int>>lrs(edges.size());\\n//\\tint id=0;\\n//\\tadfs(lrs,tos,edges,0,-1,id);\\n//\\treturn lrs;\\n//}\\n\\n\\nld memo[101][101][101][3][3];\\n\\nld solve(int a, int b, int c, int d, int e) ;\\n\\nld solve(vector<int>v, int joker, int player) {\\n\\tif(!(v[0]>=0&&v[1]>=0&&v[2]>=0&&joker>=0&&joker<=2&&player>=0&&player<=2))return 0;\\n\\tif (memo[v[0]][v[1]][v[2]][joker][player] < -0.5) {\\n\\t\\tif (v[0] == 0 && v[1] == 0 && v[2] == 0) {\\n\\t\\t\\tif (joker == 1) {\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=0;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tconst int n_player=(player+1)%3;\\n\\t\\t\\t// A no card\\n\\t\\t\\tif (v[0] == 0 && v[2] == 0 && joker != 0) {\\n\\t\\t\\t\\tif (player == 0) {\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = solve(v, joker, n_player);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tconst int drawn_player=(player^3);\\n\\t\\t\\t\\t\\tld ans = 0;\\n\\t\\t\\t\\t\\tif (drawn_player == 2) {\\n\\t\\t\\t\\t\\t\\tans+=(joker==drawn_player)*solve(v,1, n_player);\\n\\t\\t\\t\\t\\t\\tans+=v[1]*solve(v[0],v[1]-1,v[2],2, n_player);\\n\\n\\t\\t\\t\\t\\t\\tans/=(joker==2)+v[1];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tassert(v[1]);\\n\\t\\t\\t\\t\\t\\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// B no card\\n\\t\\t\\telse if (v[0] == 0 && v[1] == 0 && joker != 1) {\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = 1;\\n\\t\\t\\t}\\n\\t\\t\\t// C no card\\n\\t\\t\\telse if (v[1] == 0 && v[2] == 0 && joker != 2) {\\n\\t\\t\\t\\tif (player == 2) {\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=solve(v,joker,n_player);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tconst int drawn_player = (player ^ 1);\\n\\t\\t\\t\\t\\tld ans = 0;\\n\\t\\t\\t\\t\\tif (drawn_player==0) {\\n\\t\\t\\t\\t\\t\\tans += (joker == drawn_player)*solve(v, player ,n_player);\\n\\t\\t\\t\\t\\t\\tans += v[0]*solve(v[0]-1, v[1], v[2], joker, n_player);\\n\\n\\t\\t\\t\\t\\t\\tassert((joker==0)+v[0]>=1);\\n\\t\\t\\t\\t\\t\\tans /= (joker == 0) + v[0];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tassert(v[0]);\\n\\t\\t\\t\\t\\t\\tans = solve(v[0]-1, v[1], v[2], joker, n_player);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tld ans=0;\\n\\t\\t\\t\\tint drawn_player=(player+2)%3;\\n\\t\\t\\t\\tif (player == 0) {\\n\\t\\t\\t\\t\\tans+=v[1]*solve(v[0]+1,v[1]-1,v[2],joker,n_player);\\n\\t\\t\\t\\t\\tans+=v[2]*solve(v[0],v[1],v[2]-1,joker,n_player);\\n\\t\\t\\t\\t\\tans+=(joker==2)*solve(v[0],v[1],v[2],0,n_player);\\n\\n\\t\\t\\t\\t\\tassert(v[1]+v[2]+(joker==2)>=1);\\n\\t\\t\\t\\t\\tans/=v[1]+v[2]+(joker==2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (player == 1) {\\n\\t\\t\\t\\t\\tans+=v[2]*solve(v[0],v[1]+1,v[2]-1,joker,n_player);\\n\\t\\t\\t\\t\\tans+=v[0]*solve(v[0]-1,v[1],v[2],joker,n_player);\\n\\t\\t\\t\\t\\tans+=(joker==0)*solve(v[0],v[1],v[2],1,n_player);\\n\\n\\t\\t\\t\\t\\tassert(v[2]+v[0]+(joker==0)>=1);\\n\\t\\t\\t\\t\\tans/=v[2]+v[0]+(joker==0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (player == 2) {\\n\\t\\t\\t\\t\\tif (v[1]) {\\n\\t\\t\\t\\t\\t\\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (v[0]) {\\n\\t\\t\\t\\t\\t\\tans=solve(v[0]-1,v[1],v[2]+1,joker,n_player);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tans=solve(v,player,n_player);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn memo[v[0]][v[1]][v[2]][joker][player];\\n}\\n\\nld solve(int a, int b, int c, int d, int e) {\\n\\treturn solve(vector<int>{a, b, c},d,e);\\n}\\n\\nint main()\\n{\\n\\n\\tint AB=0,BC=0,CA=0;\\n\\tint joker=-1;\\n\\n\\tfor (int i = 0; i < 101; ++i) {\\n\\t\\tfor (int j = 0; j < 101; ++j) {\\n\\t\\t\\tfor (int k = 0; k < 101; ++k) {\\n\\t\\t\\t\\tfor (int l = 0; l < 3; ++l) {\\n\\t\\t\\t\\t\\tfor (int m = 0; m < 3; ++m) {\\n\\t\\t\\t\\t\\t\\tmemo[i][j][k][l][m]=-1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tint N; cin >> N;\\n\\n\\t\\tvector<vector<int>>nums(3, vector<int>(101));\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tint m; cin >> m;\\n\\t\\t\\tmap<int, int>mp;\\n\\t\\t\\twhile (m--) {\\n\\t\\t\\t\\tint a; cin >> a;\\n\\t\\t\\t\\tmp[a]++;\\n\\t\\t\\t}\\n\\t\\t\\tfor (auto m : mp) {\\n\\t\\t\\t\\tif (m.second % 2)nums[i][m.first]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i = 0; i <= N; ++i) {\\n\\t\\t\\tif (i == 0) {\\n\\t\\t\\t\\tfor (int j = 0; j < 3; ++j) {\\n\\t\\t\\t\\t\\tif (nums[j][i]) {\\n\\t\\t\\t\\t\\t\\tjoker=j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (nums[0][i] && nums[1][i]) {\\n\\t\\t\\t\\t\\tAB++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (nums[1][i] && nums[2][i]) {\\n\\t\\t\\t\\t\\tBC++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (nums[2][i] && nums[0][i]) {\\n\\t\\t\\t\\t\\tCA++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tld ans=solve(AB,BC,CA,joker,0);\\n\\n\\tcout<<setprecision(10)<<fixed<<double(ans)<<endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.11904761904761904,\n \"time_ms\": 40,\n \"memory_kb\": 148148,\n \"score_of_the_acc\": -1.0513,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2802_2915527\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n//namespace cent {\\n//\\n//\\tstruct Edge {\\n//\\t\\tint src;\\n//\\t\\tint dst;\\n//\\t\\tlong long int cost;\\n//\\t};\\n//\\tusing Graph = vector<vector<Edge>>;\\n//\\n//\\tclass Centroid {\\n//\\tprivate:\\n//\\t\\tint dfs(const Graph&g, const int now, const int from, vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tint sum = 1;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tsum += dfs(g, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ch_nums[now] = sum;\\n//\\t\\t}\\n//\\n//\\t\\tint find_centroid(const int asize, const vector<vector<Edge>>&graph, const int pre_root, const int pre_from, const vector<int>&ch_nums, const vector<int>&oks) {\\n//\\t\\t\\tfor (auto&& e : graph[pre_root]) {\\n//\\t\\t\\t\\tif (e.dst == pre_from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tif (ch_nums[e.dst]>asize / 2)return find_centroid(asize, graph, e.dst, e.src, ch_nums, oks);\\n//\\t\\t\\t}\\n//\\t\\t\\treturn pre_root;\\n//\\t\\t}\\n//\\n//\\t\\tvoid dfs2(const Graph&g, const int root,const int now, const int from, const vector<int>&oks,int depth) {\\n//\\t\\t\\tmp[make_pair(root,now)]=depth;\\n//\\t\\t\\tfor (auto &&e : g[now]) {\\n//\\t\\t\\t\\tif (e.dst == from || oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\telse {\\n//\\t\\t\\t\\t\\tdfs2(g,root,e.dst,e.src,oks,depth+1);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t};\\n//\\n//\\n//\\t\\tvoid cent(const vector<vector<Edge>>&graph, vector<int>&oks, const int root, const int from, vector<vector<int>>¢roid_edges, int& fst_centroid, int depth, vector<int>&ch_nums) {\\n//\\t\\t\\tdfs(graph, root, from, ch_nums, oks);\\n//\\n//\\t\\t\\tint cent_id = find_centroid(ch_nums[root], graph, root, from, ch_nums, oks);\\n//\\n//\\n//\\t\\t\\tdfs2(graph,cent_id,cent_id,-1,oks,0);\\n//\\t\\t\\tlens1[cent_id][make_pair(0,0)]--;\\n//\\t\\t\\tlens2[cent_id][0]--;\\n//\\n//\\n//\\t\\t\\toks[cent_id] = depth;\\n//\\n//\\t\\t\\t//for (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t//\\tif (e.dst == from)continue;\\n//\\t\\t\\t//\\tif (oks[e.dst] != -1)continue;\\n//\\n//\\t\\t\\t//\\tdfs2(graph, e.dst, e.dst, e.src, oks,e.cost%mod,e.cost%mod,1);\\n//\\n//\\t\\t\\t//\\tfor (auto&& l1 : lens1[e.dst]) {\\n//\\t\\t\\t//\\t\\tint keta = l1.first.second;\\n//\\t\\t\\t//\\t\\tlong long int num = l1.first.first;\\n//\\n//\\t\\t\\t//\\t\\tlong long int need = (mod - num) / mod_pow(10, keta);\\n//\\t\\t\\t//\\t\\tneed%=mod;\\n//\\t\\t\\t//\\t\\tauto it = lens2[e.dst].find(need);\\n//\\t\\t\\t//\\t\\tif (it != lens2[e.dst].end()) {\\n//\\t\\t\\t//\\t\\t\\tans -= l1.second*it->second;\\n//\\t\\t\\t//\\t\\t}\\n//\\t\\t\\t//\\t}\\n//\\t\\t\\t//\\tlens1[e.dst].clear();\\n//\\t\\t\\t//\\tlens2[e.dst].clear();\\n//\\t\\t\\t//}\\n//\\n//\\t\\t\\tif (from != -1) {\\n//\\t\\t\\t\\tcentroid_edges[from].push_back(cent_id);\\n//\\t\\t\\t}\\n//\\t\\t\\telse {\\n//\\t\\t\\t\\tfst_centroid = cent_id;\\n//\\t\\t\\t}\\n//\\t\\t\\tfor (auto&& e : graph[cent_id]) {\\n//\\t\\t\\t\\tif (e.dst == from)continue;\\n//\\t\\t\\t\\tif (oks[e.dst] != -1)continue;\\n//\\t\\t\\t\\tcent(graph, oks, e.dst, e.src, centroid_edges, fst_centroid, depth + 1, ch_nums);\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\n//\\tpublic:\\n//\\n//\\t\\tmap<pair<int,int>,int>mp;\\n//\\n//\\t\\tvector<map<pair<long long int,int>, long long int>>lens1;\\n//\\t\\tvector<map<long long int, long long int>>lens2;\\n//\\t\\tvector<vector<int>> centroid_graph;\\n//\\t\\tvector<int>ts;\\n//\\t\\tvector<int>parents;\\n//\\t\\tvector<int>oks;\\n//\\t\\tvector<int>anss;\\n//\\n//\\t\\t//fst:root snd:centroid_graph\\n//\\t\\tvoid init(const Graph&g) {\\n//\\t\\t\\tlens1.resize(g.size());\\n//\\t\\t\\tlens2.resize(g.size());\\n//\\t\\t\\toks = vector<int>(g.size(), -1);\\n//\\t\\t\\tint root = -1;\\n//\\t\\t\\tcentroid_graph.resize(g.size());\\n//\\t\\t\\tparents = vector<int>(g.size(), -1);\\n//\\t\\t\\tts=vector<int>(g.size(),-1);\\n//\\t\\t\\tanss=vector<int>(g.size(),100000);\\n//\\n//\\t\\t\\tvector<int>ch_nums(g.size());\\n//\\t\\t\\tcent(g, oks, 0, -1, centroid_graph, root, 0, ch_nums);\\n//\\n//\\t\\t\\tfor (int i = 0; i < centroid_graph.size(); ++i) {\\n//\\t\\t\\t\\tfor (auto&& e : centroid_graph[i]) {\\n//\\t\\t\\t\\t\\tparents[e] = i;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\treturn ;\\n//\\t\\t}\\n//\\t}centroid;\\n//\\n//\\n//\\tvoid addEdge(Graph& g, int a, int b, long long int c) {\\n//\\t\\tg[a].push_back(Edge{ a,b,c });\\n//\\t\\tg[b].push_back(Edge{ b,a,c });\\n//\\t}\\n//}\\n\\n\\n//const int mod = 1000000007;\\n//struct Mod {\\n//public:\\n//\\tint num;\\n//\\tMod() : Mod(0) { ; }\\n//\\tMod(long long int n) : num((n % mod + mod) % mod) {\\n//\\t\\tstatic_assert(mod<INT_MAX / 2, \\\"mod is too big, please make num 'long long int' from 'int'\\\");\\n//\\t}\\n//\\tMod(int n) : Mod(static_cast<long long int>(n)) { ; }\\n//\\toperator int() { return num; }\\n//};\\n//\\n//Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }\\n//Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }\\n//Mod operator+(const Mod a, const long long int b) { return b + a; }\\n//Mod operator++(Mod &a) { return a + Mod(1); }\\n//Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }\\n//Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }\\n//Mod operator--(Mod &a) { return a - Mod(1); }\\n//Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }\\n//Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }\\n//Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }\\n//Mod operator*(const Mod a, const int b) { return Mod(b)*a; }\\n//Mod operator+=(Mod &a, const Mod b) { return a = a + b; }\\n//Mod operator+=(long long int &a, const Mod b) { return a = a + b; }\\n//Mod operator-=(Mod &a, const Mod b) { return a = a - b; }\\n//Mod operator-=(long long int &a, const Mod b) { return a = a - b; }\\n//Mod operator*=(Mod &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(long long int &a, const Mod b) { return a = a * b; }\\n//Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }\\n//Mod operator^(const Mod a, const int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = (a * a) ^ (n / 2);\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//Mod mod_pow(const Mod a, const long long int n) {\\n//\\tif (n == 0) return Mod(1);\\n//\\tMod res = mod_pow((a * a), (n / 2));\\n//\\tif (n % 2) res = res * a;\\n//\\treturn res;\\n//}\\n//\\n////mod が素数の場合のみ 違う場合はextend euclid を用いる。\\n//Mod inv(const Mod a) { return a ^ (mod - 2); }\\n//Mod operator/(const Mod a, const Mod b) {\\n//\\tassert(b.num != 0);\\n//\\treturn a * inv(b);\\n//}\\n//Mod operator/(const long long int a, const Mod b) {\\n//\\treturn Mod(a) / b;\\n//}\\n//Mod operator/=(Mod &a, const Mod b) {\\n//\\treturn a = a / b;\\n//}\\n//\\n//#define MAX_MOD_N 1024000\\n//\\n//Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];\\n//void init(const int amax = MAX_MOD_N) {\\n//\\tfact[0] = Mod(1); factinv[0] = 1;\\n//\\tfor (int i = 0; i < amax - 1; ++i) {\\n//\\t\\tfact[i + 1] = fact[i] * Mod(i + 1);\\n//\\t\\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\\n//\\t}\\n//}\\n//Mod comb(const int a, const int b) {\\n//\\treturn fact[a] * factinv[b] * factinv[a - b];\\n//}\\n//\\n//vector<int>primes;\\n//void hurui(const int amax=3500) {\\n//\\tstatic bool flag = false;\\n//\\tif (flag)return;\\n//\\tvector<int>sos;\\n//\\tsos = vector<int>(amax + 1, true);\\n//\\tsos[0] = false; sos[1] = false;\\n//\\tfor (int i = 2; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\\n//\\t\\t}\\n//\\t}\\n//\\tfor (int i = 0; i <= amax; ++i) {\\n//\\t\\tif (sos[i]) {\\n//\\t\\t\\tprimes.push_back(i);\\n//\\t\\t}\\n//\\t}\\n//\\tflag = true;\\n//}\\n//\\n//\\n//struct query {\\n//\\tint u;\\n//\\tint v;\\n//\\tmap<int,int>mp;\\n//};\\n//\\n//map<int, int>mk_mp(const int a) {\\n//\\tint rest(a);\\n//\\tmap<int,int>as;\\n//\\tfor (auto pr : primes) {\\n//\\t\\twhile (rest%pr == 0) {\\n//\\t\\t\\tas[pr]++;\\n//\\t\\t\\trest /= pr;\\n//\\t\\t}\\n//\\t}\\n//\\tif (rest!=1)as[rest]++;\\n//\\treturn as;\\n//}\\n//\\n//#define Seg_Max_N (1<<18) \\n//\\n//class Tree {\\n//public:\\n//\\tTree(int V, int root) : V(V), root(root), cnum(V), place(V), id(V) {\\n//\\t\\tT.resize(V);\\n//\\t\\tfor (int i = 0; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i].resize(V);\\n//\\t\\t}\\n//\\t\\tdepth.resize(V);\\n//\\t}\\n//\\t// uとvをつなぐ\\n//\\t// lcaを求めることが主目的なので無向グラフとしている\\n//\\tvoid unite(int u, int v) {\\n//\\t\\tT[u].push_back(v);\\n//\\t\\tT[v].push_back(u);\\n//\\t}\\n//\\tvoid unite(vector<vector<int>>&e) {\\n//\\t\\tT = e;\\n//\\t}\\n//\\t// initする\\n//\\t// コンストラクタだけじゃなくてこれも呼ばないとlcaが求められないぞ\\n//\\tvoid init() {\\n//\\t\\tdfs(root, 0, 0);\\n//\\t\\tint id = 0;\\n//\\t\\tgetid(root, 0, id);\\n//\\t}\\n//\\t// uとvのlcaを求める\\n//\\tint lca(int u, int v) const {\\n//\\t\\tif (depth[u] > depth[v]) swap(u, v);\\n//\\t\\tfor (int k = 0; k < MAXLOGV; 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 = MAXLOGV - 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//\\t// uとvの距離を求める\\n//\\t// edgeを定義しないといけない時はこれじゃダメ\\n//\\tint dist(int u, int v) const {\\n//\\t\\tint p = lca(u, v);\\n//\\t\\treturn (depth[u] - depth[p]) + (depth[v] - depth[p]);\\n//\\t}\\n//\\tint dfs(int v, int p, int d) {\\n//\\t\\tparent[0][v] = p;\\n//\\t\\tdepth[v] = d;\\n//\\t\\tcnum[v] = 0;\\n//\\t\\tfor (int i = 1; i < MAXLOGV; i++) {\\n//\\t\\t\\tparent[i][v] = parent[i - 1][parent[i - 1][v]];\\n//\\t\\t}\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) cnum[v] += dfs(next, v, d + 1);\\n//\\t\\t}\\n//\\t\\treturn cnum[v] + 1;\\n//\\t}\\n//\\n//\\tvoid dfs2(int v, int p, vector<vector<int>>&doubles, const vector<int>&nums) {\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) dfs2(next, v, doubles, nums);\\n//\\t\\t}\\n//\\t\\tdoubles[0][v] = nums[v];\\n//\\t\\tfor (int j = 1; j < MAXLOGV; ++j) {\\n//\\t\\t\\tdoubles[j][v] = min(doubles[j][v], doubles[j - 1][v]);\\n//\\t\\t}\\n//\\t\\tfor (int j = 0; j < MAXLOGV - 1; ++j) {\\n//\\t\\t\\tdoubles[j + 1][parent[j][v]] = min(doubles[j + 1][parent[j][v]], doubles[j][v]);\\n//\\t\\t}\\n//\\t}\\n//\\t//ここでは親から距離2^iの部分木の最小値を求めている\\n//\\tvector<vector<int>>get_doubles(const vector<int>&nums) {\\n//\\t\\tvector<vector<int>>doubles(MAXLOGV, vector<int>(V, 1e9));\\n//\\t\\tdfs2(root, -1, doubles, nums);\\n//\\t\\treturn doubles;\\n//\\t}\\n//\\n//\\tvoid getid(const int v, const int p, int &nplace) {\\n//\\t\\tplace[v] = nplace;\\n//\\t\\tid[nplace] = v;\\n//\\t\\tnplace++;\\n//\\t\\tfor (int next : T[v]) {\\n//\\t\\t\\tif (next != p) getid(next, v, nplace);\\n//\\t\\t}\\n//\\t}\\n//\\tstatic const int MAXLOGV = 25;\\n//\\t// グラフの隣接リスト表現\\n//\\tvector<vector<int> > T;\\n//\\t// 頂点の数\\n//\\tint V;\\n//\\t// 根ノードの番号\\n//\\tint root;\\n//\\n//\\t// 親ノード\\n//\\tvector<int> parent[MAXLOGV];\\n//\\t// 根からの深さ\\n//\\tvector<int> depth;\\n//\\n//\\t//子の数\\n//\\tvector<int>cnum;\\n//\\n//\\t//変換\\n//\\tvector<int>place;\\n//\\tvector<int>id;\\n//\\n//};\\n//\\n//vector<int>pas;\\n//void adfs(vector<pair<int, int>>&lrs, vector<int>&tos,const vector<vector<int>>&edges, const int now, const int from,int &id) {\\n//\\ttos[now]=id;\\n//\\tlrs[tos[now]].first=id++;\\n//\\tfor (auto e : edges[now]) {\\n//\\t\\tif (e == from) {\\n//\\t\\t\\tpas[now] = from;\\n//\\t\\t\\tcontinue;\\n//\\t\\t}\\n//\\t\\tadfs(lrs,tos,edges,e,now,id);\\n//\\t}\\n//\\tlrs[tos[now]].second=id;\\n//}\\n//\\n//vector<pair<int, int>>get_lrs(vector<int>&tos,const vector<vector<int>>&edges, const int root) {\\n//\\tpas.resize(tos.size());pas[0]=-1;\\n//\\tvector<pair<int,int>>lrs(edges.size());\\n//\\tint id=0;\\n//\\tadfs(lrs,tos,edges,0,-1,id);\\n//\\treturn lrs;\\n//}\\n\\n\\nld memo[101][101][101][3][3];\\n\\nld solve(int a, int b, int c, int d, int e) ;\\n\\nld solve(vector<int>v, int joker, int player) {\\n\\tif(!(v[0]>=0&&v[1]>=0&&v[2]>=0&&joker>=0&&joker<=2&&player>=0&&player<=2))return 0;\\n\\tif (memo[v[0]][v[1]][v[2]][joker][player] < -0.5) {\\n\\t\\tif (v[0] == 0 && v[1] == 0 && v[2] == 0) {\\n\\t\\t\\tif (joker == 1) {\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=0;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tconst int n_player=(player+1)%3;\\n\\t\\t\\t// A no card\\n\\t\\t\\tif (v[0] == 0 && v[2] == 0 && joker != 0) {\\n\\t\\t\\t\\tif (player == 0) {\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = solve(v, joker, n_player);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tconst int drawn_player=(player^3);\\n\\t\\t\\t\\t\\tld ans = 0;\\n\\t\\t\\t\\t\\tif (drawn_player == 2) {\\n\\t\\t\\t\\t\\t\\tans+=(joker==drawn_player)*solve(v,1, n_player);\\n\\t\\t\\t\\t\\t\\tans+=v[1]*solve(v[0],v[1]-1,v[2],2, n_player);\\n\\n\\t\\t\\t\\t\\t\\tans/=(joker==2)+v[1];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tassert(v[1]);\\n\\t\\t\\t\\t\\t\\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// B no card\\n\\t\\t\\telse if (v[0] == 0 && v[1] == 0 && joker != 1) {\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = 1;\\n\\t\\t\\t}\\n\\t\\t\\t// C no card\\n\\t\\t\\telse if (v[1] == 0 && v[2] == 0 && joker != 2) {\\n\\t\\t\\t\\tif (player == 2) {\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player]=solve(v,joker,n_player);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tconst int drawn_player = (player ^ 1);\\n\\t\\t\\t\\t\\tld ans = 0;\\n\\t\\t\\t\\t\\tif (drawn_player==0) {\\n\\t\\t\\t\\t\\t\\tans += (joker == drawn_player)*solve(v, player ,n_player);\\n\\t\\t\\t\\t\\t\\tans += v[0]*solve(v[0]-1, v[1], v[2], joker, n_player);\\n\\n\\t\\t\\t\\t\\t\\tassert((joker==0)+v[0]>=1);\\n\\t\\t\\t\\t\\t\\tans /= (joker == 0) + v[0];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tassert(v[0]);\\n\\t\\t\\t\\t\\t\\tans = solve(v[0]-1, v[1], v[2], joker, n_player);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tld ans=0;\\n\\t\\t\\t\\tint drawn_player=(player+2)%3;\\n\\t\\t\\t\\tif (player == 0) {\\n\\t\\t\\t\\t\\tans+=v[1]*solve(v[0]+1,v[1]-1,v[2],joker,n_player);\\n\\t\\t\\t\\t\\tans+=v[2]*solve(v[0],v[1],v[2]-1,joker,n_player);\\n\\t\\t\\t\\t\\tans+=(joker==2)*solve(v[0],v[1],v[2],0,n_player);\\n\\n\\t\\t\\t\\t\\tassert(v[1]+v[2]+(joker==2)>=1);\\n\\t\\t\\t\\t\\tans/=v[1]+v[2]+(joker==2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (player == 1) {\\n\\t\\t\\t\\t\\tans+=v[2]*solve(v[0],v[1]+1,v[2]-1,joker,n_player);\\n\\t\\t\\t\\t\\tans+=v[0]*solve(v[0]-1,v[1],v[2],joker,n_player);\\n\\t\\t\\t\\t\\tans+=(joker==0)*solve(v[0],v[1],v[2],1,n_player);\\n\\n\\t\\t\\t\\t\\tassert(v[2]+v[0]+(joker==0)>=1);\\n\\t\\t\\t\\t\\tans/=v[2]+v[0]+(joker==0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (player == 2) {\\n\\t\\t\\t\\t\\tif (v[1]) {\\n\\t\\t\\t\\t\\t\\tans=solve(v[0],v[1]-1,v[2],joker,n_player);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (v[0]) {\\n\\t\\t\\t\\t\\t\\tans=solve(v[0]-1,v[1],v[2]+1,joker,n_player);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tans=solve(v,player,n_player);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo[v[0]][v[1]][v[2]][joker][player] = ans;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn memo[v[0]][v[1]][v[2]][joker][player];\\n}\\n\\nld solve(int a, int b, int c, int d, int e) {\\n\\treturn solve(vector<int>{a, b, c},d,e);\\n}\\n\\nint main()\\n{\\n\\n\\tint AB=0,BC=0,CA=0;\\n\\tint joker=-1;\\n\\n\\tfor (int i = 0; i < 101; ++i) {\\n\\t\\tfor (int j = 0; j < 101; ++j) {\\n\\t\\t\\tfor (int k = 0; k < 101; ++k) {\\n\\t\\t\\t\\tfor (int l = 0; l < 3; ++l) {\\n\\t\\t\\t\\t\\tfor (int m = 0; m < 3; ++m) {\\n\\t\\t\\t\\t\\t\\tmemo[i][j][k][l][m]=-1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tint N; cin >> N;\\n\\n\\t\\tvector<vector<int>>nums(3, vector<int>(101));\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tint m; cin >> m;\\n\\t\\t\\tmap<int, int>mp;\\n\\t\\t\\twhile (m--) {\\n\\t\\t\\t\\tint a; cin >> a;\\n\\t\\t\\t\\tmp[a]++;\\n\\t\\t\\t}\\n\\t\\t\\tfor (auto m : mp) {\\n\\t\\t\\t\\tif (m.second % 2)nums[i][m.first]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i = 0; i <= N; ++i) {\\n\\t\\t\\tif (i == 0) {\\n\\t\\t\\t\\tfor (int j = 0; j < 3; ++j) {\\n\\t\\t\\t\\t\\tif (nums[j][i]) {\\n\\t\\t\\t\\t\\t\\tjoker=j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (nums[0][i] && nums[1][i]) {\\n\\t\\t\\t\\t\\tAB++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (nums[1][i] && nums[2][i]) {\\n\\t\\t\\t\\t\\tBC++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (nums[2][i] && nums[0][i]) {\\n\\t\\t\\t\\t\\tCA++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tld ans=solve(AB,BC,CA,joker,0);\\n\\n\\tcout<<setprecision(10)<<fixed<<ans<<endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.11904761904761904,\n \"time_ms\": 50,\n \"memory_kb\": 148168,\n \"score_of_the_acc\": -1.0687,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2802_2390998\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__\\\",\\\", __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 1120000000\\n\\nmap<int, double> memo;\\n\\ndouble solve(int x, int y, int z, int turn, int joker){\\n int idx = (((x*100+y)*100+z)*3+turn)*3+joker;\\n if(memo.count(idx)==1) return memo[idx];\\n// dbg(x,y,z,turn,joker);\\n if(x+y+z==0){\\n if(joker==1) return 0;\\n else return 1;\\n }\\n double ans=0;\\n if(turn==0){\\n double total = x+z+(joker==2);\\n if(total==0){\\n if(y==0){\\n if(joker==0) ans = 1;\\n else ans = 0;\\n }\\n else ans = solve(0,y-1,0,1,joker);\\n }\\n else {\\n if(x>0) ans += x*solve(x-1, y, z, 1, joker);\\n if(z>0) ans += z*solve(x, y+1, z-1, 1, joker);\\n if(joker==2) ans += solve(x,y,z,1,0);\\n ans /= total;\\n }\\n }\\n else if(turn==1){\\n double total = x+y+(joker==0);\\n if(total==0){\\n if(z==0){\\n if(joker==1) ans=0;\\n else ans=1;\\n }\\n else {\\n if(joker==1) ans = solve(0,0,z-1,2,joker);\\n else ans = (solve(0,0,z,2,1) + z*solve(0,0,z-1,2,2)) / (z+1.0);\\n }\\n }\\n else {\\n if(x>0) ans += x*solve(x-1,y,z+1,2,joker);\\n if(y>0) ans += y*solve(x,y-1,z,2,joker);\\n if(joker==0) ans += solve(x,y,z,2,1);\\n ans /= total;\\n }\\n }\\n else if(turn==2){\\n if(y+z+(joker==1) == 0) ans = 1;\\n else if(z>0) ans = solve(x,y,z-1,0,joker);\\n else if(y>0) ans = solve(x+1,y-1,z,0,joker);\\n else if(joker==1) ans = solve(x,y,z,0,2);\\n }\\n// else assert(false);\\n return memo[idx]=ans;\\n}\\n\\nint main(){\\n int n;\\n cin>>n;\\n vector<int> vec(n,0);\\n int joker=-1;\\n rep(i,3){\\n int m; cin>>m;\\n rep(j,m){\\n int d; cin>>d;\\n if(d==0) joker=i;\\n else {\\n d--;\\n vec[d] ^= (1<<i);\\n }\\n }\\n }\\n// assert(joker!=-1);\\n\\n int x=0,y=0,z=0;\\n rep(i,n){\\n if(vec[i]==5) x++;\\n else if(vec[i]==3) y++;\\n else if(vec[i]==6) z++;\\n// else if(vec[i]!=0) assert(false);\\n }\\n\\n printf(\\\"%.8f\\\\n\\\", solve(x,y,z,0,joker));\\n\\n return 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 10,\n \"memory_kb\": 19252,\n \"score_of_the_acc\": 0,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2802_2390855\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__\\\",\\\", __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 1120000000\\n\\nmap<int, double> memo;\\n\\ndouble solve(int x, int y, int z, int turn, int joker){\\n int idx = (((x*100+y)*100+z)*3+turn)*3+joker;\\n if(memo.count(idx)==1) return memo[idx];\\n// dbg(x,y,z,turn,joker);\\n if(x+y+z==0){\\n if(joker==1) return 0;\\n else return 1;\\n }\\n double ans=0;\\n if(turn==0){\\n double total = x+z+(joker==2);\\n if(total==0){\\n if(y==0){\\n if(joker==0) ans = 1;\\n else ans = 0;\\n }\\n else ans = solve(0,y-1,0,1,joker);\\n }\\n else {\\n if(x>0) ans += x*solve(x-1, y, z, 1, joker);\\n if(z>0) ans += z*solve(x, y+1, z-1, 1, joker);\\n if(joker==2) ans += solve(x,y,z,1,0);\\n ans /= total;\\n }\\n }\\n else if(turn==1){\\n double total = x+y+(joker==0);\\n if(total==0){\\n if(z==0){\\n if(joker==1) ans=0;\\n else ans=1;\\n }\\n else {\\n if(joker==1) ans = solve(0,0,z-1,2,joker);\\n else ans = (solve(0,0,z,2,1) + z*solve(0,0,z-1,2,2)) / (z+1.0);\\n }\\n }\\n else {\\n if(x>0) ans += x*solve(x-1,y,z+1,2,joker);\\n if(y>0) ans += y*solve(x,y-1,z,2,joker);\\n if(joker==0) ans += solve(x,y,z,2,1);\\n ans /= total;\\n }\\n }\\n else if(turn==2){\\n if(y+z+(joker==1) == 0) ans = 1;\\n else if(z>0) ans = solve(x,y,z-1,0,joker);\\n else if(y>0) ans = solve(x+1,y-1,z,0,joker);\\n else if(joker==1) ans = solve(x,y,z,0,2);\\n }\\n else assert(false);\\n return memo[idx]=ans;\\n}\\n\\nint main(){\\n int n;\\n cin>>n;\\n vector<int> vec(n,0);\\n int joker=-1;\\n rep(i,3){\\n int m; cin>>m;\\n rep(j,m){\\n int d; cin>>d;\\n if(d==0) joker=i;\\n else {\\n d--;\\n vec[d] ^= (1<<i);\\n }\\n }\\n }\\n assert(joker!=-1);\\n\\n int x=0,y=0,z=0;\\n rep(i,n){\\n if(vec[i]==5) x++;\\n else if(vec[i]==3) y++;\\n else if(vec[i]==6) z++;\\n else if(vec[i]!=0) assert(false);\\n }\\n\\n printf(\\\"%.8f\\\\n\\\", solve(x,y,z,0,joker));\\n\\n return 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 10,\n \"memory_kb\": 19280,\n \"score_of_the_acc\": -0.0002,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2802_2270648\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef double D;\\n\\nvector<int> hand(int n){\\n vector<int> h(n+1,0);\\n\\n int m; cin >> m;\\n for(int i=0;i<m;i++){\\n int a; cin >> a; h[a]++;\\n }\\n \\n for(int i=0;i<=n;i++) h[i] %= 2;\\n\\n return h;\\n}\\n\\nD memo2[3][3][110]; //memo2[turn][joker][card]\\n\\n//0: kotori, 1: umi\\nD rec2(int t, int j, int c){\\n D &res = memo2[t][j][c];\\n if(res >= 0) return res;\\n \\n if(c == 0){\\n if(j == 1) return res = 0; //umi loses\\n else return res = 1; //umi wins\\n }\\n\\n if(t == 0){ //kotori turn\\n return res = rec2(1-t,j,c-1);\\n }else{ //umi turn\\n int total = c + (j==0);\\n res = c * rec2(1-t,j,c-1);\\n if(j==0) res += rec2(1-t,1,c);\\n res /= total;\\n\\n return res;\\n }\\n}\\n\\nD memo3[3][3][110][110][110]; //memo3[turn][joker][hono][umi][koto]\\n\\n//honoka: 0, umi: 1, kotori: 2\\nD rec3(int t, int j, vector<int> p){\\n D &res = memo3[t][j][p[0]][p[1]][p[2]];\\n if(res >= 0) return res;\\n\\n //only joker\\n if(p[0]==0 && p[1]==0 && p[2]==0){\\n if(j == 1) return res = 0; //umi loses\\n else return res = 1; //umi wins\\n }\\n\\n int nt = (t+1)%3;\\n //turn player has no card\\n if(j!=t && p[(t+1)%3]==0 && p[(t+2)%3]==0){\\n return res = rec3(nt, j, p); //skip turn\\n }\\n\\n //two players remain\\n for(int i=0;i<3;i++){\\n if(j!=i && p[(i+1)%3]==0 && p[(i+2)%3]==0){\\n if(i==1) return res = 1; //umi wins\\n else return res = rec2(t==1,j==1,p[i]); //umi remains\\n }\\n }\\n\\n //three players remain\\n if(t==2){\\n if(p[0]){ //umi has cards that kotori also has\\n res = rec3(nt, j, {p[0]-1,p[1],p[2]});\\n }else if(p[0]==0 && p[2]==0 && j==1){ //umi only has joker\\n res = 1;\\n }else{\\n res = rec3(nt, j, {p[0],p[1]+1,p[2]-1});\\n }\\n }else{\\n int total = p[t] + p[(t+1)%3] + (j==(t+2)%3);\\n\\n vector<int> np = p;\\n np[t]--;\\n np[(t+2)%3]++;\\n res = p[t] * rec3(nt,j,np);\\n \\n np = p;\\n np[(t+1)%3]--;\\n res += p[(t+1)%3] * rec3(nt,j,np);\\n\\n if(j==(t+2)%3) res += rec3(nt,t,p);\\n\\n res /= total;\\n }\\n \\n return res;\\n}\\n\\nint main(){\\n int n;\\n cin >> n;\\n\\n vector<int> hono = hand(n), umi = hand(n), koto = hand(n);\\n\\n int joker = 0;\\n if(hono[0] == 1) joker = 0;\\n if( umi[0] == 1) joker = 1;\\n if(koto[0] == 1) joker = 2;\\n\\n int h=0, u=0, k=0;\\n for(int i=1;i<=n;i++){\\n if(umi[i] && koto[i]) h++;\\n if(koto[i] && hono[i]) u++;\\n if(hono[i] && umi[i]) k++;\\n }\\n\\n for(int a=0;a<3;a++){\\n for(int b=0;b<3;b++){\\n for(int c=0;c<=n;c++){\\n\\tmemo2[a][b][c] = -1;\\n\\n\\tfor(int d=0;d<=n;d++){\\n\\t for(int e=0;e<=n;e++) memo3[a][b][c][d][e] = -1;\\n\\t}\\n }\\n }\\n }\\n\\n cout << fixed << setprecision(10) << rec3(0, joker, {h,u,k}) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 85784,\n \"score_of_the_acc\": -0.5159,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1693,"cells":{"group_id":{"kind":"string","value":"aoj_2809_cpp"},"problem_description":{"kind":"string","value":"E: 卒業式\n背景\nある日 Y さんはプログラミングコンテストに参加するため，会場がある大学に向かいました．\nところが大学に着くと人がたくさん！なんと今日は卒業式だったのです．\n会場に向かおうにも人に押し流されてしまい，自分の進みたい方向に進むことすらできません．\n人混みから抜け出すために，Y さんは今いる場所から少しでも遠くに行きたいと考えました．\nそこで Y さんは状況を以下のような問題として定式化し，競技プログラミングを役に立てることにしました．\nなお，以下の問題文では Y さんは点 $P$ としてモデル化されています．\n問題\n座標平面上の原点に点 $P$ が置かれている．\n点 $P$ を動かし，できるだけ原点からのマンハッタン距離が遠い位置に移動させたい．\nはじめに，文字列 $S = s_1s_2 \\cdots s_{|S|}$ ($|S|$ は $S$ の文字数) が与えられる．\n点 $P$ の移動は，文字列 $S$ の先頭から文字を 1 文字ずつ読み込むことで行う．\n文字列 $S$ は文字 'U', 'L', 'D', 'R' からなる．\nそれぞれの文字を読み込んだとき，点 $P$ の移動前の座標を $(x, y)$ とすると，\n移動後の点 $P$ の座標はそれぞれ $(x, y+1),\\ (x-1, y),\\ (x, y-1),\\ (x+1, y)$ となる．\n各文字を読み込む直前に，魔法をかけるか否かを選択することができる．\n魔法には魔法 1 と魔法 2 の二種類がある．文字列 $S$ の $i$ 番目の文字を $s_i$ とすると，\n$s_i$ を読み込む直前に魔法をかけたときの変化は以下の通りである．\n魔法 1 をかけたとき: 全ての $s_j \\ (i \\le j \\le |S|)$ に対し，'U' を 'D' に，'D' を 'U' に置換する．\n魔法 2 をかけたとき: 全ての $s_j \\ (i \\le j \\le |S|)$ に対し，'L' を 'R' に，'R' を 'L' に置換する．\n直感的には，魔法 1 ではその後の上下の扱いを反転させることができ，魔法 2 では左右の扱いを反転させることができる．\nある文字を読み込む前にかける魔法の回数は複数回でも構わない．また，両方の魔法を続けてかけてもかまわない．\nただし，文字列 $S$ の文字をすべて読み終えるまでに魔法をかけられる回数は，合計 $K$ 回までである．\n詳細はサンプルを参照されたい．\n文字列 $S$ の文字をすべて読み終えた後の点 $P$ の座標を $(x',y')$ とするとき，$|x'| + |y'|$ \nの最大値を求めよ．\n制約\n$1 \\le |S| \\le 2000$\n$1 \\le K \\le 2000$\n入力\n入力は以下の形式で標準入力から与えられる．\n$S$\n$K$\n出力\n$|x'| + |y'|$ の最大値を 1 行で出力せよ．また、末尾に改行も出力せよ.\nサンプル\nサンプル入力 1\nRRLUDDD\n2\nサンプル出力 1\n7\n3 文字目を読み込む直前に魔法 2 をかけると，文字列 $S$ は \"RRRUDDD\" となる．\n続いて 5 文字目を読み込む直前に魔法 1 をかけると，文字列 $S$ は \"RRRUUUU\" となる．\nすべての文字を読み終えた後の点 $P$ の座標は $(3, 4)$ となり，\n原点からのマンハッタン距離は 7 である．これはこの例の最大値である．\nサンプル入力 2\nLULLLUULLU\n1984\nサンプル出力 2\n10\n1 回も魔法をかけなかった場合，$x’ = -6, \\ y’ = 4$ となり，$|x’| + |y’| = 10$ である．\nサンプル入力 3\nDRDLUDD\n1\nサンプル出力 3\n5\nサンプル入力 4\nLURRRLUDLL\n1\nサンプル出力 4\n6"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2809_9117771","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\n\ntemplate <typename T> bool chmin(T &a, const T &b) {\n\tif (a <= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> bool chmax(T &a, const T &b) {\n\tif (a >= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> T max(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T min(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T sum(vector<T> &a){\n\tT ret = 0;\n\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\n\treturn ret;\n}\n\nvector<int> solve(vector<int> a){\n\tint geta = 2500;\n\tvector<int> dp0(5000,2100);\n\tvector<int> dp1(5000,2100);\n\tdp0[geta] = 0;\n\trep(i,0,(int)a.size()){\n\t\tvector<int> ndp0(5000,2100);\n\t\tvector<int> ndp1(5000,2100);\n\t\trep(j,0,5000){\n\t\t\tif (0 <= j+a[i] && j+a[i] < 5000){\n\t\t\t\tchmin(ndp0[j+a[i]], dp0[j]);\n\t\t\t\tchmin(ndp0[j+a[i]], dp1[j] + 1);\n\t\t\t}\n\t\t\tif (0 <= j-a[i] && j-a[i] < 5000){\n\t\t\t\tchmin(ndp1[j-a[i]], dp1[j]);\n\t\t\t\tchmin(ndp1[j-a[i]], dp0[j] + 1);\n\t\t\t}\n\t\t}\n\t\tswap(ndp0, dp0);\n\t\tswap(ndp1, dp1);\n\t}\n\tvector<int> targ(2200, 0);\n\trep(j,0,5000){\n\t\tchmax(targ[dp0[j]], abs(j-geta));\n\t\tchmax(targ[dp1[j]], abs(j-geta));\n\t}\n\trep(j,0,2180){\n\t\tchmax(targ[j+1], targ[j]);\n\t}\n\treturn targ;\n}\n\n\nint main(){\n\tstring s; cin >> s;\n\tint k; cin >> k;\n\n\tvector<int> a, b;\n\trep(i,0,(int)s.size()){\n\t\tif (s[i] == 'U') a.push_back(+1);\n\t\tif (s[i] == 'D') a.push_back(-1);\n\t\tif (s[i] == 'L') b.push_back(+1);\n\t\tif (s[i] == 'R') b.push_back(-1);\n\t}\n\n\tvector<int> x = solve(a);\n\tvector<int> y = solve(b);\n\t\n\tint ans = 0;\n\trep(i,0,k+1){\n\t\tchmax(ans, x[i] + y[k-i]);\n\t}\n\tcout << ans << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":3544,"score_of_the_acc":-0.0365,"final_rank":2},{"submission_id":"aoj_2809_9117693","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#define rep(i,n) for(ll i=0;i<(n);++i)\n#define ALL(x) x.begin(),x.end()\n#define BACK(x) x.rbegin(),x.rend()\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MOD1_BASE 131\n#define INF (LLONG_MAX / 2)\n#define FLOAT_ANS setprecision(30)\n#define TORAD(x) (x*acos(-1)/180.0)\n#define TODEG(x) (x*180/acos(-1))\n#define GET_VALUENAME(value) # value\n\nusing namespace std;\nusing ll = long long;\nusing LL = __int128_t;\nusing ull = unsigned long long;\n\ntemplate<typename T> // T:重み\nusing p_que = priority_queue<T,vector<T>,greater<T>>;\n\ntemplate<typename T>\nbool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}\n\ntemplate<typename T>\nbool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}\n\nll modpow(ll a, ll n, ll mod) {ll res=1;while (n>0) {if(n&1)res=(res*(a%mod))%mod;a=((a%mod)*(a%mod))%mod;n>>=1;}return res;}\n\ntemplate<typename T>\nvoid RotateVec2(vector<vector<T>>&v){ll h=v.size();ll w=v[0].size();vector<vector<T>>t(w,vector<T>(h));rep(i,h){rep(j,w){t[j][h-i-1]=v[i][j];}}v=t;}\n\ntemplate<class T>\nbool InRange(T x, T mn, T mx){return (mn <= x && x <= mx);}\n\ntemplate<typename T>\nvector<T>&merged(vector<T>&a,vector<T>&b) {vector<T>res;merge(a.begin(),a.end(),b.begin(),b.end(),back_inserter(res));return res;}\n\nstruct UnionFind{\n vector<ll>tree;\n UnionFind(ll x):tree(x, -1){}\n ll root(ll x){if(tree[x]<0) return x;return tree[x]=root(tree[x]);}\n bool same(ll x,ll y){return root(x)==root(y);}\n ll size(ll x){return -tree[root(x)];}\n void unite(ll x,ll y){x=root(x),y=root(y);if(x==y)return;if(size(x)<size(y))swap(x,y);tree[x]+=tree[y];tree[y]=x;}\n};\n\ntemplate<class T>\nstruct SegTree{\n ll n;T e;vector<T>tree,lazy;function<T(T,T)>f,add;\n SegTree(ll n_,function<T(T,T)>f_,T e_=0,function<T(T,T)>add_=[](T next,T old){return next;}):e(e_),f(f_),add(add_){\n ll x=1;\n while(x<n_)x*=2;\n n=x;\n tree.assign(n*2,e);\n lazy.assign(n*2,e);\n }\n void eval(T k) {\n if (lazy[k] == e) return;\n if (k < n-1){\n lazy[k*2+1]=lazy[k*2+1]=lazy[k];\n }\n tree[k]=lazy[k], lazy[k]=e;\n }\n void update(ll idx,T x){\n update(idx, idx+1, x);\n }\n void update(ll a, ll b, ll x) { update(a, b, x, 0, n, 0); }\n void update(ll a, ll b, ll x, ll l, ll r, ll k) {\n eval(k);\n if (a <= l and r <= b) {\n lazy[k] = x;\n eval(k);\n }\n else if (a < r and l < b) {\n update(a, b, x, l, (l+r)/2, k*2+1);\n update(a, b, x, (l+r)/2, r, k*2+1);\n tree[k] = f(tree[k*2+1], tree[k*2+2]);\n }\n }\n T query(ll x,ll y){\n return query_sub(x,y,0,n,0);\n }\n T query_sub(ll x,ll y,ll l,ll r,ll k){\n eval(k);\n if(r<=x||y<=l)return e;\n if(x<=l&&r<=y)return tree[k];\n T c1=query_sub(x,y,l,(l+r)/2,k*2+1);\n T c2=query_sub(x,y,(l+r)/2,r,k*2+2);\n return f(c1,c2);\n }\n T get(ll idx){return tree[idx+n-1];}\n};\n\ntemplate<std::uint_fast64_t Modulus> class modint {\n using u64 = std::uint_fast64_t;\npublic:\n u64 a;\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 constexpr modint operator/(const modint rhs) const noexcept {return modint(*this) /= rhs;}\n constexpr modint &operator+=(const modint rhs) noexcept {a += rhs.a;if (a >= Modulus) {a -= Modulus;}return *this;}\n constexpr modint &operator-=(const modint rhs) noexcept {if (a < rhs.a) {a += Modulus;}a -= rhs.a;return *this;}\n constexpr modint &operator*=(const modint rhs) noexcept {a = a * rhs.a % Modulus;return *this;}\n constexpr modint &operator/=(modint rhs) noexcept {\n u64 exp = Modulus - 2;\n while (exp) {\n if (exp % 2) {\n *this *= rhs;\n }\n rhs *= rhs;\n exp /= 2;\n }\n return *this;\n }\n constexpr modint &operator=(u64 x){ a = x % Modulus; return *this; }\n};\n\ntemplate<class T=ll>\nstruct Vector2D {\n T x, y;\n Vector2D():x(0),y(0) {}\n Vector2D(T x_, T y_):x(x_),y(y_) {}\n\n double length() const { return sqrt((double)x*x+y*y); };\n T lengthp() const { return x*x+y*y; };\n bool inrange(const Vector2D a, const Vector2D b) { return (InRange(x, a.x, b.x) and InRange(y, a.y, b.y)); }\n Vector2D yx() { return Vector2D{ y, x }; }\n Vector2D operator-(const Vector2D a) const { return Vector2D(*this) -= a; }\n Vector2D operator+(const Vector2D a) const { return Vector2D(*this) += a; }\n T operator*(const Vector2D a) const { return x*a.x+y*a.y; }\n Vector2D operator*(const T a) const { return Vector2D(*this) *= a; }\n Vector2D operator/(const T a) const { return Vector2D(*this) /= a; }\n Vector2D &operator+=(const Vector2D a) { x += a.x; y += a.y; return *this; }\n Vector2D &operator-=(const Vector2D a) { x -= a.x; y -= a.y; return *this; }\n Vector2D &operator-=(const T a) { x -= a; y -= a; return *this; }\n Vector2D &operator*=(const T a) { x *= a; y *= a; return *this; }\n Vector2D &operator/=(const T a) { x /= a; y /= a; return *this; }\n friend ostream& operator<< (ostream& stream, const Vector2D<>& x);\n bool operator==(const Vector2D a) const { return (x==a.x and y==a.y); }\n bool operator!=(const Vector2D a) const { return not (x==a.x and y==a.y); }\n bool operator>(const Vector2D a) const { return a < *this; }\n bool operator<(const Vector2D a) const \n {\n return make_pair(x,y) < make_pair(a.x, a.y);\n // return x*a.y < y*a.x;\n }\n};\n\nostream& operator<< (ostream& stream, const Vector2D<ll>& x) {\n string s = \"(\" + to_string(x.x) + \", \" + to_string(x.y) + \")\";\n stream << s;\n return stream;\n}\n\nll popcount(ll x) { ll res = 0; while(x) {res+=x%2;x>>=1;} return res; }\n\n// debug kit\nvoid print() { cout << endl; }\ntemplate<class T>\nvoid print_(vector<T>x) { for(auto i : x) cout << i << \" \"; }\ntemplate<class T>\nvoid print_(T x) { cout << x << \" \"; }\n#ifdef ONLINE_JUDGE \ntemplate<class T, class ...Args>\nvoid print(T head, Args... args) {}\ntemplate<class T>\nvoid debug(T value) {}\n#else\ntemplate<class T, class ...Args>\nvoid print(T head, Args... args) { print_(head); print(args...); }\ntemplate<class T>\nvoid debug(T value) { print((string)\"\\\"\"+GET_VALUENAME(value)+\"\\\": \", value); }\n#endif\n\n// MAIN PROGRAM ------------\n\nusing mint = modint<MOD2>;\nusing Vec2 = Vector2D<ll>;\nconst Vec2 Angle[] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};\n\nstruct State\n{\n Vec2 pos = {0, 0};\n ll dist = -INF;\n int getDist() {\n return abs(pos.x) + abs(pos.y);\n }\n bool operator<(const State a) \n {\n return dist < a.dist;\n }\n};\n\nint main() {\n string s;\n cin >> s;\n ll k, n = s.length();\n cin >> k;\n map<char, ll>mp;\n mp['U'] = 0;\n mp['L'] = 1;\n mp['D'] = 2;\n mp['R'] = 3;\n \n vector dp(k+10, vector(4, State{}));\n vector dp_next(k+10, vector(4, State{}));\n\n dp[0][0].dist = 0;\n\n rep(i, n) \n {\n rep(j, k+1) rep(l, 4)\n {\n if (dp[j][l].dist == -INF) continue;\n int angle = mp[s[i]];\n if ((angle%2 and l/2) or (angle%2==0 and l%2)) angle = (angle+2)%4;\n\n State base = dp[j][l];\n rep(idx, 2)\n {\n // 0: 魔法なし, 1: 魔法あり\n State next = base;\n\n next.pos += Angle[angle];\n next.dist = next.getDist();\n\n chmax(dp_next[j+idx][l], next);\n\n // 魔法処理\n angle = (angle+2) % 4;\n if (angle % 2) l ^= 2;\n else l^= 1;\n }\n }\n dp = dp_next;\n dp_next = vector(k+10, vector(4, State{}));\n }\n\n ll ans = 0;\n rep(i, k+1){\n rep(j, 4) {\n chmax(ans, dp[i][j].dist);\n }\n }\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":180,"memory_kb":4120,"score_of_the_acc":-0.5929,"final_rank":12},{"submission_id":"aoj_2809_9117663","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\npair<vector<int>,vector<int>> calc(vector<int> rui, int k){\n int n = rui.size()-1;\n vector<int> dpma(k+1,-iinf), dpmi(k+1,iinf);\n dpma[0] = rui[0], dpmi[0] = rui[0];\n rep(i,n){\n auto epma = dpma, epmi = dpmi;\n rep(j,k){\n chmax(epma[j+1],dpma[j] + 2*rui[i]*(j % 2 == 0 ? -1 : 1));\n chmin(epmi[j+1],dpmi[j] + 2*rui[i]*(j % 2 == 0 ? -1 : 1));\n }\n swap(dpma,epma);\n swap(dpmi,epmi);\n }\n rep(i,k){\n chmax(dpma[i+1],dpma[i]);\n chmin(dpmi[i+1],dpmi[i]);\n }\n return pair(dpma,dpmi);\n}\n\nvoid solve(){\n string s; in(s);\n int k; in(k);\n int n = s.size();\n vector<int> ruix(n+1,0), ruiy(n+1,0);\n reb(i,n){\n ruix[i] = ruix[i+1] + (s[i] == 'D' ? 1 : s[i] == 'U' ? -1 : 0);\n ruiy[i] = ruiy[i+1] + (s[i] == 'R' ? 1 : s[i] == 'L' ? -1 : 0);\n }\n auto [xma, xmi] = calc(ruix,k);\n auto [yma, ymi] = calc(ruiy,k);\n int ans = 0;\n rep(i,k+1){\n chmax(ans,abs(xma[i])+abs(yma[k-i]));\n chmax(ans,abs(xma[i])+abs(ymi[k-i]));\n chmax(ans,abs(xmi[i])+abs(yma[k-i]));\n chmax(ans,abs(xmi[i])+abs(ymi[k-i]));\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":1,"time_ms":10,"memory_kb":3460,"score_of_the_acc":-0.0014,"final_rank":1},{"submission_id":"aoj_2809_9117630","code_snippet":"//#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n//using uLL = unsigned __int128;\nusing str = string;\ntemplate <typename T> \nusing pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T>\nusing pq = priority_queue<T>;\ntemplate <typename T>\nusing vec = vector<T>;\nusing pll = pair<long long, long long>;\nusing pii = pair<int, int>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvl = vector<vector<ll>>;\nusing vp = vector<pair<ll, ll>>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define vvvm vector<vector<vector<mint>>>\n#define vvm vector<vector<mint>>\n#define vm vector<mint>\ntemplate <typename T1, typename T2>\nusing umap = unordered_map<T1, T2>;\ntemplate <typename T>\nusing uset = unordered_set<T>;\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\n#define per(i, s, f) for(long long i = s; i >= f; i--)\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\n#define eb(a) emplace_back(a)\n#define pb(a) push_back(a)\n#define all0(x) (x).begin() ,(x).end()\n#define all(x) (x).begin() + 1, (x).end()\n#define ins(x, l, r) (l <= x && x <= r)\n#define ENDL '\\n'\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//これが本当の組み込み関数ってね（笑）\ntemplate <typename T>\nint LB(vector<T> &A, T x) {\n return lower_bound(A.begin(), A.end(), x) - A.begin();\n}\n\ntemplate <typename T>\nint UB(vector<T> &A, T x) {\n return upper_bound(A.begin(), A.end(), x) - A.begin();\n}\ntemplate <typename T>\nvoid UNIQUE(vector<T> &A, int indexed) {\n sort(A.begin() + indexed, A.end());\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\n}\n\ntemplate <typename T>\nvector<T> erase(vector<T>& A, T& x) {\n\tvector<T> res;\n\tfor(T a : A) if(a != x) res.emplace_back(a);\n\treturn res;\n}\nstring split(string& S, int l, int r) {\n\treturn S.substr(l, r - l + 1);\n}\n\nint msb(long long a) {\n if(a == 0) return -1;\n return 64 - int(__builtin_clzll(a));\n}\ntemplate<class T>\nvoid chmin(T &a, T b) {\n if(a > b) a = b;\n}\ntemplate<class T>\nvoid chmax(T &a, T b) {\n if(a < b) a = b;\n}\n//////////////////////////////////////////////////////////////////////\n//数学系\n///////////////////////////////////////////////////////////////////////\nll extgcd (ll a, ll b, ll &x, ll &y) {\n if(b == 0) { x = 1;y = 0;return a;}\n ll d = extgcd(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\ntemplate <typename T>\nT CEIL(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\n else return a / b;\n}\ntemplate <typename T>\nT FLOOR(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\n else return a/b - 1;\n}\nll SQRT(ll a) {\n ll l = 0;\n ll r = 3037000499LL;\n while(l < r) {\n ll mid = (l + r + 1) / 2;\n if(mid * mid <= a) l = mid;\n else r = mid - 1;\n }\n return l;\n}\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//グローバル変数を置くところ\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC optimize \"trapv\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\nconst ll big = 1001001001;\nconst ll BIG = 2002002002002002002LL;\nconst double pi = 3.141592653589793;\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\n//const ll mod = 1000000007;\n//const ll mod = 998244353;\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n/*\n以降全てをswapする。\n\nマンハッタン距離、つまり abs(x) + abs(y)の最大化。\nK回まで操作をswapして良い（上下・左右で別の操作をする必要がある。)\n\n\n[1]swapの分け方を全探索\nこれをすると、xとyを独立に考えてよくなる？（互いの操作で変化しない && スコアが独立)\n\n「 t回まで操作をして良い時、abs(x)を最大化せよ。」\nを解く。\n最終的な座標の+-で場合分けすればよい。\nあとは貪欲で終わり?\n\ndpを事前にしておく。\n\ndpy[2][f][i][d] .... iまで見た。d回上下のswapをした。今の状態がfの時の、yの最小値・最大値。\ndpx[2][f][i][d] .... iまで、d回横、今の状態がf, xのmin/max\n\niを飛ばす。\ndp[2][f][k]\nmin/max, flag, k回使った。\nO(KN)\n\n\nLRLRLLLRLRLRLLRRR\n\n計算量を見積もる。\n分け方でK通り。\n分け方が決まった時、+-で2通り。\n\n*/\n\nvoid solve() {\n\tstring S;\n\tcin >> S;\n\tll K;\n\tcin >> K;\n\tll N = S.size();\n\tS = \" \" + S;\n\n\tvvvl dpy(2, vvl(2, vl(K+1, BIG)));\n\trep(f, 0, 1) rep(k,0,K) dpy[1][f][k] = -BIG;\n\tdpy[0][0][0] = 0;\n\tdpy[1][0][0] = 0;\n\n\n\tvvvl dpx(2, vvl(2, vl(K+1, BIG)));\n\trep(f, 0, 1) rep(k,0,K) dpx[1][f][k] = -BIG;\n\tdpx[0][0][0] = 0;\n\tdpx[1][0][0] = 0;\n\n\t{\n\t\trep(i,1,N) {\n\t\t\tvvvl prey(2, vvl(2, vl(K+1, BIG)));\n\t\t\trep(f, 0, 1) rep(k,0,K) prey[1][f][k] = -BIG;\n\t\t\tswap(prey, dpy);\n\n\t\t\tif(S[i] == 'L' || S[i] == 'R') {\n\t\t\t\tdpy = prey;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\trep(m, 0, 1) {\n\t\t\t\trep(f, 0, 1) {\n\t\t\t\t\trep(k, 0, K) if(abs(prey[m][f][k]) < big) {\n\t\t\t\t\t\tll c = 1;\n\t\t\t\t\t\tif(S[i] == 'D') c = -1;\n\t\t\t\t\t\tif(f) c *= -1;//反転。\n\n\t\t\t\t\t\t//unuse\n\t\t\t\t\t\tif(m==0) chmin(dpy[m][f][k], prey[m][f][k] + c);\n\t\t\t\t\t\telse chmax(dpy[m][f][k], prey[m][f][k] + c);\n\n\n\t\t\t\t\t\tif(k != K) {//use\n\t\t\t\t\t\t c *= -1;\n\t\t\t\t\t\t\tll nf = f ^ 1;\n\t\t\t\t\t\t\tll nk = k + 1;\n\t\t\t\t\t\t\tif(m==0) chmin(dpy[m][nf][nk], prey[m][f][k] + c);\n\t\t\t\t\t\t\telse chmax(dpy[m][nf][nk], prey[m][f][k] + c);\n\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}\n\t}\n\n\n\t{\n\t\trep(i,1,N) {\n\t\t\tvvvl prex(2, vvl(2, vl(K+1, BIG)));\n\t\t\trep(f, 0, 1) rep(k,0,K) prex[1][f][k] = -BIG;\n\t\t\tswap(prex, dpx);\n\n\t\t\tif(S[i] == 'D' || S[i] == 'U') {\n\t\t\t\tdpx = prex;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\trep(m, 0, 1) {\n\t\t\t\trep(f, 0, 1) {\n\t\t\t\t\trep(k, 0, K) if(abs(prex[m][f][k]) < big) {\n\t\t\t\t\t\tll c = 1;\n\t\t\t\t\t\tif(S[i] == 'L') c = -1;\n\t\t\t\t\t\tif(f) c *= -1;//反転。\n\n\t\t\t\t\t\t//unuse\n\t\t\t\t\t\tif(m==0) chmin(dpx[m][f][k], prex[m][f][k] + c);\n\t\t\t\t\t\telse chmax(dpx[m][f][k], prex[m][f][k] + c);\n\n\n\t\t\t\t\t\tif(k != K) {//use\n\t\t\t\t\t\t c *= -1;\n\t\t\t\t\t\t\tll nf = f ^ 1;\n\t\t\t\t\t\t\tll nk = k + 1;\n\t\t\t\t\t\t\tif(m==0) chmin(dpx[m][nf][nk], prex[m][f][k] + c);\n\t\t\t\t\t\t\telse chmax(dpx[m][nf][nk], prex[m][f][k] + c);\n\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}\n\t}\n\n\n\n\n ll ans = -BIG;\n\trep(d, 0, K) {\n\t\t//上にd。\n\t\n\t\tll ansx = -BIG;\n\t\trep(m,0,1) rep(f, 0, 1) rep(k, 0, K-d) if(abs(dpx[m][f][k]) < big) chmax(ansx, abs(dpx[m][f][k]));\n\n\t\tll ansy = -BIG;\n\t\trep(m,0,1) rep(f, 0, 1) rep(k, 0, d) if(abs(dpy[m][f][k]) < big) chmax(ansy, abs(dpy[m][f][k]));\n\n\t\tchmax(ans, ansx + ansy);\n\n\t}\n \n\n\n\tcout << ans << endl;\n\t\n \n\n \n \n\n}\n\n\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n ll T = 1;\n //cin >> T;\n rep(i, 1, T) {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3596,"score_of_the_acc":-0.1059,"final_rank":4},{"submission_id":"aoj_2809_8108070","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\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n string s; cin >> s;\n int n = s.size();\n vector<pair<int,int>> v(n);\n for (int i = 0; i < n; ++i) {\n if (s[i] == 'U') v[i] = {0, 1};\n else if (s[i] == 'L') v[i] = {-1, 0};\n else if (s[i] == 'D') v[i] = {0, -1};\n else v[i] = {1, 0};\n }\n int K; cin >> K;\n int res = 0;\n vector<vector<vector<int>>> dp(2, vector<vector<int>> (2, vector<int>(K+1, -1e9)));\n dp[0][0][0] = 0;\n dp[0][1][0] = 0;\n dp[1][0][0] = 0;\n dp[1][1][0] = 0;\n for (int i = 0; i < n; ++i) {\n vector<vector<vector<int>>> ndp(2, vector<vector<int>> (2, vector<int>(K+1, -1e9)));\n for (int j = 0; j < 2; ++j) {\n for (int k = 0; k < 2; ++k) {\n for (int l = 0; l <= K; ++l) {\n if (dp[j][k][l] == -1e9) continue;\n // そのまま\n {\n int nxt = dp[j][k][l] + v[i].first * (j == 0 ? 1 : -1) + v[i].second * (k == 0 ? 1 : -1);\n ndp[j][k][l] = max(ndp[j][k][l], nxt);\n }\n // 魔法1\n if (l+1 <= K) {\n int nxt = dp[j][k][l] + v[i].first * (j == 1 ? 1 : -1) + v[i].second * (k == 0 ? 1 : -1);\n ndp[j^1][k][l+1] = max(ndp[j^1][k][l+1], nxt);\n }\n // 魔法2\n if (l+1 <= K) {\n int nxt = dp[j][k][l] + v[i].first * (j == 0 ? 1 : -1) + v[i].second * (k == 1 ? 1 : -1);\n ndp[j][k^1][l+1] = max(ndp[j][k^1][l+1], nxt);\n }\n // 両方\n if (l+2 <= K) {\n int nxt = dp[j][k][l] + v[i].first * (j == 1 ? 1 : -1) + v[i].second * (k == 1 ? 1 : -1);\n ndp[j^1][k^1][l+2] = max(ndp[j^1][k^1][l+2], nxt);\n }\n }\n }\n }\n swap(dp, ndp);\n }\n for (int i = 0; i < 2; ++i) {\n for (int j = 0; j < 2; ++j) {\n for (int k = 0; k <= K; ++k) {\n res = max(res, dp[i][j][k]);\n }\n }\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":3540,"score_of_the_acc":-0.1399,"final_rank":5},{"submission_id":"aoj_2809_5967122","code_snippet":"#include<bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n//#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"unroll-loops\")\nusing namespace std;\n//#include<boost/multiprecision/cpp_int.hpp>\n//#include<boost/multiprecision/cpp_dec_float.hpp>\n//namespace mp=boost::multiprecision;\n//#define mulint mp::cpp_int\n//#define mulfloat mp::cpp_dec_float_100\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n#define INF (1<<30)\n#define LINF (lint)(1LL<<56)\n#define endl \"\\n\"\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\n#define flc(x) __builtin_popcountll(x)\n#define pint pair<int,int>\n#define pdouble pair<double,double>\n#define plint pair<lint,lint>\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define vec vector<lint>\n#define nep(x) next_permutation(all(x))\ntypedef long long lint;\nint dx[8]={1,1,0,-1,-1,-1,0,1};\nint dy[8]={0,1,1,1,0,-1,-1,-1};\nconst int MAX_N=4e5+5;\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//vector<int> bucket[MAX_N/1000];\nconstexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n/*#include<atcoder/all>\nusing namespace atcoder;\ntypedef __int128_t llint;*/\n\nint main(void){\n string S;\n cin >> S;\n int K;\n cin >> K;\n int N=S.length();\n int ans=0;\n rep(x,2) rep(y,2){\n int A[N]={},B[N]={};\n rep(i,N){\n if(S[i]=='L'){\n if(x==1) A[i]=1;\n else A[i]=-1;\n }\n if(S[i]=='R'){\n if(x==1) A[i]=-1;\n else A[i]=1;\n }\n if(S[i]=='U'){\n if(y==1) B[i]=1;\n else B[i]=-1;\n }\n if(S[i]=='D'){\n if(y==1) B[i]=-1;\n else B[i]=1;\n }\n }\n int dp1[N+1][K+1],dp2[N+1][K+1];\n rep(i,N+1) rep(j,K+1) dp1[i][j]=-INF,dp2[i][j]=-INF;\n dp1[0][0]=0,dp2[0][0]=0;\n rep(i,N) rep(j,K+1){\n if(dp1[i][j]==-INF) continue;\n int nxt=A[i];\n if(j%2) nxt*=-1;\n if(j!=K) chmax(dp1[i+1][j+1],dp1[i][j]+nxt*-1);\n chmax(dp1[i+1][j],dp1[i][j]+nxt);\n }\n rep(i,N) rep(j,K+1){\n if(dp2[i][j]==-INF) continue;\n int nxt=B[i];\n if(j%2) nxt*=-1;\n if(j!=K) chmax(dp2[i+1][j+1],dp2[i][j]+nxt*-1);\n chmax(dp2[i+1][j],dp2[i][j]+nxt);\n }\n int amax[K+1],bmax[K+1];\n rep(i,K+1) amax[i]=-INF,bmax[i]=-INF;\n amax[0]=dp1[N][0],bmax[0]=dp2[N][0];\n rep(i,K){\n amax[i+1]=max(dp1[N][i+1],amax[i]);\n bmax[i+1]=max(dp2[N][i+1],bmax[i]);\n }\n rep(i,K+1){\n chmax(ans,amax[i]+bmax[K-i]);\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":34680,"score_of_the_acc":-0.32,"final_rank":9},{"submission_id":"aoj_2809_3991529","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\nint dp[2001][2001][2][2];\nint main() {\n\tstring S;\n\tcin >> S;\n\tint K;\n\tcin >> K;\n\tint N = S.size();\n\tint ans = 0;\n\tfor (int rx = 0; rx < 2; rx++) {\n\t\tfor (int ry = 0; ry < 2; ry++) {\n\t\t\tfill((int*)dp, (int*)(dp + N + 1), -(1 << 30));\n\t\t\tdp[0][0][rx][ry] = 0;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tfor (int j = 0; j <= K; j++) {\n\t\t\t\t\tfor (int k = 0; k < 2; k++) {\n\t\t\t\t\t\tfor (int l = 0; l < 2; l++) {\n\t\t\t\t\t\t\tif (dp[i][j][k][l] == -(1 << 30)) continue;\n\t\t\t\t\t\t\tint x = 0, y = 0;\n\t\t\t\t\t\t\tif (S[i] == 'R') x = 1;\n\t\t\t\t\t\t\telse if (S[i] == 'L') x = -1;\n\t\t\t\t\t\t\telse if (S[i] == 'U') y = 1;\n\t\t\t\t\t\t\telse y = -1;\n\t\t\t\t\t\t\tif (k) x *= -1;\n\t\t\t\t\t\t\tif (l) y *= -1;\n\t\t\t\t\t\t\t//操作をしない\n\t\t\t\t\t\t\tdp[i + 1][j][k][l] = max(dp[i + 1][j][k][l], dp[i][j][k][l] + x + y);\n\t\t\t\t\t\t\tif (j == K) continue;\n\t\t\t\t\t\t\t//x反転\n\t\t\t\t\t\t\tdp[i + 1][j + 1][k ^ 1][l] = max(dp[i + 1][j + 1][k ^ 1][l], dp[i][j][k][l] - x + y);\n\t\t\t\t\t\t\t//y反転\n\t\t\t\t\t\t\tdp[i + 1][j + 1][k][l ^ 1] = max(dp[i + 1][j + 1][k][l ^ 1], dp[i][j][k][l] + x - y);\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\tfor (int i = 0; i <= K; i++) {\n\t\t\t\tfor (int j = 0; j < 2; j++) {\n\t\t\t\t\tfor (int k = 0; k < 2; k++) {\n\t\t\t\t\t\tans = max(ans, dp[N][i][j][k]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\n}","accuracy":1,"time_ms":190,"memory_kb":65776,"score_of_the_acc":-1.1204,"final_rank":17},{"submission_id":"aoj_2809_3991490","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\nint dp[2001][2001][2][2];\nint main() {\n\tstring S;\n\tcin >> S;\n\tint K;\n\tcin >> K;\n\tint N = S.size();\n\tint ans = 0;\n\tfor (int rx = 0; rx < 2; rx++) {\n\t\tfor (int ry = 0; ry < 2; ry++) {\n\t\t\tmemset(dp, -1, sizeof(dp));\n\t\t\tdp[0][0][rx][ry] = 0;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tfor (int j = 0; j <= K; j++) {\n\t\t\t\t\tfor (int k = 0; k < 2; k++) {\n\t\t\t\t\t\tfor (int l = 0; l < 2; l++) {\n\t\t\t\t\t\t\tint x = 0, y = 0;\n\t\t\t\t\t\t\tif (S[i] == 'R') x = 1;\n\t\t\t\t\t\t\telse if(S[i]=='L') x = -1;\n\t\t\t\t\t\t\telse if (S[i] == 'U') y = 1;\n\t\t\t\t\t\t\telse y = -1;\n\t\t\t\t\t\t\tif (k) x *= -1;\n\t\t\t\t\t\t\tif (l) y *= -1;\n\t\t\t\t\t\t\t//操作をしない\n\t\t\t\t\t\t\tdp[i + 1][j][k][l] = max(dp[i + 1][j][k][l], dp[i][j][k][l] + x + y);\n\t\t\t\t\t\t\tif (j == K) continue;\n\t\t\t\t\t\t\t//x反転\n\t\t\t\t\t\t\tdp[i + 1][j + 1][k ^ 1][l] = max(dp[i + 1][j + 1][k ^ 1][l], dp[i][j][k][l] - x + y);\n\t\t\t\t\t\t\t//y反転\n\t\t\t\t\t\t\tdp[i + 1][j + 1][k][l ^ 1] = max(dp[i + 1][j + 1][k][l ^ 1], dp[i][j][k][l] + x - y);\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\tfor (int i = 0; i <= K; i++) {\n\t\t\t\tfor (int j = 0; j < 2; j++) {\n\t\t\t\t\tfor (int k = 0; k < 2; k++) {\n\t\t\t\t\t\tans = max(ans, dp[N][i][j][k]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\n}","accuracy":0.59375,"time_ms":270,"memory_kb":65776,"score_of_the_acc":-1.3963,"final_rank":20},{"submission_id":"aoj_2809_3524002","code_snippet":"#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <cmath>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e9 + 7;\n\nlong long int DP[2100][2100];\nlong long int res[2100][2] = {};\n\nint main(){\n string SS, S[2] = {\"\", \"\"}, hoge = \" \";\n cin >> SS;\n int K;\n cin >> K;\n for(int i = 0; i < SS.size(); i++){\n if(SS[i] == 'L' || SS[i] == 'R'){\n hoge[0] = '0' + (SS[i] == 'R');\n S[0] += hoge;\n }else{\n hoge[0] = '0' + (SS[i] == 'U');\n S[1] += hoge;\n }\n }\n for(int n = 0; n < 2; n++){\n for(int p = 0; p < 2; p++){\n for(int i = 0; i < 2100; i++){\n for(int j = 0; j < 2100; j++){\n DP[i][j] = -INF;\n }\n }\n DP[0][0] = 0;\n for(int i = 0; i < S[n].size(); i++){\n for(int j = 0; j <= K; j++){\n if(S[n][i] == '0' + (p + j) % 2){\n DP[i + 1][j] = max(DP[i + 1][j], DP[i][j] - 1);\n }else{\n DP[i + 1][j] = max(DP[i + 1][j], DP[i][j] + 1);\n }\n DP[i][j + 1] = max(DP[i][j + 1], DP[i][j]);\n }\n }\n for(int j = 0; j <= K; j++){\n DP[S[n].size()][j + 1] = max(DP[S[n].size()][j + 1], DP[S[n].size()][j]);\n res[j][n] = max(res[j][n], DP[S[n].size()][j]);\n }\n }\n }\n long long int ans = 0;\n for(int i = 0; i <= K; i++){\n ans = max(ans, res[i][0] + res[K - i][1]);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":37704,"score_of_the_acc":-0.3787,"final_rank":11},{"submission_id":"aoj_2809_3252365","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2809.cc: Graduation Ceremony\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 2000;\nconst int MAX_K = 2000;\nconst int MINF = 1 << 31;\n\nconst char cs[] = \"RULD\";\nconst int dxs[] = { 1, 0, -1, 0 }, dys[] = { 0, 1, 0, -1 };\n\nconst int qxs[] = { 1, -1, -1, 1 }, qys[] = { 1, 1, -1, -1 };\nconst int rxs[] = { 1, -1, 1, -1 }, rys[] = { 1, 1, -1, -1 };\nconst int bnums[] = { 0, 1, 1, 2 };\n\n\n/* typedef */\n\n/* global variables */\n\nint cdis[256], dp[2][MAX_K + 1][4];\nchar s[MAX_N + 4];\n\n/* subroutines */\n\ninline void setmax(int &a, int b) { if (a < b) a = b; }\n\n/* main */\n\nint main() {\n for (int di = 0; di < 4; di++) cdis[cs[di]] = di;\n\n int k;\n scanf(\"%s%d\", s, &k);\n\n int maxd = MINF;\n for (int q = 0; q < 4; q++) {\n const int &qx = qxs[q], &qy = qys[q];\n\n int cur = 0, nxt = 1;\n for (int j = 0; j <= k; j++)\n fill(dp[cur][j], dp[cur][j] + 4, MINF);\n fill(dp[cur][0], dp[cur][0] + 4, 0);\n\n for (int i = 0; s[i]; i++) {\n for (int j = 0; j <= k; j++)\n\tfill(dp[nxt][j], dp[nxt][j] + 4, MINF);\n\n int &di = cdis[s[i]];\n int dx = dxs[di] * qx, dy = dys[di] * qy;\n\n for (int j = 0; j <= k; j++)\n\tfor (int r = 0; r < 4; r++)\n\t if (dp[cur][j][r] > MINF)\n\t for (int r1 = 0; r1 < 4; r1++) {\n\t const int &b = bnums[r1];\n\t if (j + b <= k) {\n\t\tconst int r2 = r ^ r1;\n\t\tsetmax(dp[nxt][j + b][r2],\n\t\t dp[cur][j][r] + dx * rxs[r2] + dy * rys[r2]);\n\t }\n\t }\n cur ^= 1, nxt ^= 1;\n }\n\n for (int j = 0; j <= k; j++)\n for (int r = 0; r < 4; r++)\n\tsetmax(maxd, dp[cur][j][r]);\n }\n\n printf(\"%d\\n\", maxd);\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":3288,"score_of_the_acc":-1,"final_rank":16},{"submission_id":"aoj_2809_2977000","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint val[2][2000] = {};\nint dp_max[2][2001][2001] = {};\nint dp_min[2][2001][2001] = {};\n\nint main() {\n string s;\n int K;\n cin >> s >> K;\n\n for (int i = 0; i < s.size(); i++) {\n char c = s[i];\n if (c == 'U') val[0][i] = 1;\n else if (c == 'D') val[0][i] = -1;\n else if (c == 'L') val[1][i] = 1;\n else val[1][i] = -1;\n }\n\n int len = s.size();\n for (int i = 0; i < len; i++) {\n int sign = 1;\n for (int k = 0; k <= K; k++, sign *= -1) {\n for (int type = 0; type < 2; type++) {\n int v = val[type][i] * sign;\n if (i > 0) {\n dp_max[type][i][k] = dp_max[type][i-1][k];\n dp_min[type][i][k] = dp_min[type][i-1][k];\n if (k > 0) {\n dp_max[type][i][k] = max(dp_max[type][i][k], dp_max[type][i-1][k-1]);\n dp_min[type][i][k] = min(dp_min[type][i][k], dp_min[type][i-1][k-1]);\n }\n }\n dp_max[type][i][k] += v;\n dp_min[type][i][k] += v;\n }\n }\n }\n\n if(false) {\n cout << \"dp_max\" << endl;\n for (int type = 0; type < 2; type++) {\n cout << (type == 0 ? \"UD\" : \"RL\") << endl;\n for (int i = 0; i < len; i++) {\n cout << val[type][i] << \": \";\n for (int k = 0; k <= K; k++) {\n cout << dp_max[type][i][k] << \" \";\n }\n cout << endl;\n }\n cout << endl;\n }\n cout << \"dp_min\" << endl;\n for (int type = 0; type < 2; type++) {\n cout << (type == 0 ? \"UD\" : \"RL\") << endl;\n for (int i = 0; i < len; i++) {\n cout << val[type][i] << \": \";\n for (int k = 0; k <= K; k++) {\n cout << dp_max[type][i][k] << \" \";\n }\n cout << endl;\n }\n cout << endl;\n }\n }\n\n int ans = 0;\n for (int k_limit = 0; k_limit <= K; k_limit++) {\n int lr = 0, ud = 0;\n for (int i = 0; i <= k_limit; i++) {\n ud = max(ud, abs(dp_max[0][len-1][i]));\n ud = max(ud, abs(dp_min[0][len-1][i]));\n }\n for (int i = 0; i <= K-k_limit; i++) {\n lr = max(lr, abs(dp_max[1][len-1][i]));\n lr = max(lr, abs(dp_min[1][len-1][i]));\n }\n ans = max(ans, lr + ud);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":65728,"score_of_the_acc":-0.6028,"final_rank":13},{"submission_id":"aoj_2809_2685857","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst bool debug = true;\n#define dbg(...) if(debug) printf(__VA_ARGS__)\n#define print(var) if (debug) cout << #var << \" = \" << var << endl\n\nnamespace {\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\n template<typename T>\n ostream& operator<<(ostream& os, const vector<T>& xs) {\n if (xs.empty()) return os;\n os << xs[0];\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\n return os;\n }\n\n string S;\n int K;\n void input() {\n cin >> S >> K;\n }\n\n void normalize(vector<int>& xs) {\n if (xs.empty()) return;\n if (xs[0] == 1) {\n for (auto& x : xs) x = !x;\n }\n }\n\n void solve() {\n int N = S.size();\n vector<int> s[2];\n auto map_int = [&](char c) {\n return int(c == 'R' || c == 'U');\n };\n for (int i = 0; i < N; i++) {\n char c = S[i];\n s[int(c == 'R' || c == 'L')].push_back(map_int(c));\n }\n normalize(s[0]); normalize(s[1]);\n static int cache[2][2][2002][2002];\n const int INF = 1<<28;\n for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) for (int k = 0; k < 2002; k++) for (int l = 0; l < 2002; l++) cache[i][j][k][l] = -INF;\n function<int(int, int, int, int)> f = [&](int w, int flip, int i, int k) {\n auto& t = s[w];\n auto& ans = cache[w][flip][i][k];\n if (k < 0) return -INF;\n if (i == t.size()) return 0;\n if (ans >= 0) return ans;\n return ans = max(f(w, !flip, i + 1, k - 1) + (t[i] == !flip ? +1 : -1),\n f(w, flip, i + 1, k) + (t[i] == flip ? +1 : -1));\n };\n int ans = -INF;\n for (int k = 0; k <= K; k++) {\n for (int p = 0; p <= 1; p++) {\n for (int q = 0; q <= 1; q++) {\n ans = max(ans, f(0, p, 0, k) + f(1, q, 0, K - k));\n }\n }\n }\n cout << ans << endl;\n }\n}\n\nint main() {\n input(); solve();\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":65892,"score_of_the_acc":-1.2248,"final_rank":18},{"submission_id":"aoj_2809_2670980","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nchar buf[2001];\nint yoko[2001],tate[2001];\nint dp_yoko_plus[2000][2001],dp_yoko_minus[2000][2001];\nint dp_tate_plus[2000][2001],dp_tate_minus[2000][2001];\n\n\nint main(){\n\n\tint K;\n\tscanf(\"%s\",buf);\n\tscanf(\"%d\",&K);\n\n\tint yoko_index = 0,tate_index = 0;\n\tfor(int i = 0; buf[i] != '\\0'; i++){\n\t\tif(buf[i] == 'L' || buf[i] == 'R'){\n\t\t\tif(buf[i] == 'L'){\n\t\t\t\tyoko[yoko_index++] = -1;\n\t\t\t}else{\n\t\t\t\tyoko[yoko_index++] = 1;\n\t\t\t}\n\t\t}else{\n\t\t\tif(buf[i] == 'D'){\n\t\t\t\ttate[tate_index++] = -1;\n\t\t\t}else{\n\t\t\t\ttate[tate_index++] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < yoko_index; i++){\n\t\tfor(int a = 0; a <= K; a++){\n\t\t\tdp_yoko_plus[i][a] = -BIG_NUM;\n\t\t\tdp_yoko_minus[i][a] = BIG_NUM;\n\t\t}\n\t}\n\n\tdp_yoko_plus[0][0] = 0;\n\tdp_yoko_minus[0][0] = 0;\n\n\tfor(int i = 0; i < yoko_index; i++){\n\t\tfor(int used = 0; used <= min(i,K); used++){\n\t\t\tif(used%2 == 0){\n\n\t\t\t\tif(used < K){\n\t\t\t\t\tdp_yoko_plus[i+1][used+1] = max(dp_yoko_plus[i+1][used+1],dp_yoko_plus[i][used]+yoko[i]*(-1));\n\t\t\t\t\tdp_yoko_minus[i+1][used+1] = min(dp_yoko_minus[i+1][used+1],dp_yoko_minus[i][used]+yoko[i]*(-1));\n\t\t\t\t}\n\n\t\t\t\tdp_yoko_plus[i+1][used] = max(dp_yoko_plus[i+1][used],dp_yoko_plus[i][used]+yoko[i]);\n\t\t\t\tdp_yoko_minus[i+1][used] = min(dp_yoko_minus[i+1][used],dp_yoko_minus[i][used]+yoko[i]);\n\n\t\t\t}else{\n\t\t\t\tif(used < K){\n\t\t\t\t\tdp_yoko_plus[i+1][used+1] = max(dp_yoko_plus[i+1][used+1],dp_yoko_plus[i][used]+yoko[i]);\n\t\t\t\t\tdp_yoko_minus[i+1][used+1] = min(dp_yoko_minus[i+1][used+1],dp_yoko_minus[i][used]+yoko[i]);\n\t\t\t\t}\n\n\t\t\t\tdp_yoko_plus[i+1][used] = max(dp_yoko_plus[i+1][used],dp_yoko_plus[i][used]+yoko[i]*(-1));\n\t\t\t\tdp_yoko_minus[i+1][used] = min(dp_yoko_minus[i+1][used],dp_yoko_minus[i][used]+yoko[i]*(-1));\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < tate_index; i++){\n\t\tfor(int a = 0; a <= K; a++){\n\t\t\tdp_tate_plus[i][a] = -BIG_NUM;\n\t\t\tdp_tate_minus[i][a] = BIG_NUM;\n\t\t}\n\t}\n\n\tdp_tate_plus[0][0] = 0;\n\tdp_tate_minus[0][0] = 0;\n\n\tfor(int i = 0; i < tate_index; i++){\n\t\tfor(int used = 0; used <= min(i,K); used++){\n\t\t\tif(used%2 == 0){\n\n\t\t\t\tif(used < K){\n\t\t\t\t\tdp_tate_plus[i+1][used+1] = max(dp_tate_plus[i+1][used+1],dp_tate_plus[i][used]+tate[i]*(-1));\n\t\t\t\t\tdp_tate_minus[i+1][used+1] = min(dp_tate_minus[i+1][used+1],dp_tate_minus[i][used]+tate[i]*(-1));\n\t\t\t\t}\n\n\t\t\t\tdp_tate_plus[i+1][used] = max(dp_tate_plus[i+1][used],dp_tate_plus[i][used]+tate[i]);\n\t\t\t\tdp_tate_minus[i+1][used] = min(dp_tate_minus[i+1][used],dp_tate_minus[i][used]+tate[i]);\n\n\t\t\t}else{\n\n\t\t\t\tif(used < K){\n\t\t\t\t\tdp_tate_plus[i+1][used+1] = max(dp_tate_plus[i+1][used+1],dp_tate_plus[i][used]+tate[i]);\n\t\t\t\t\tdp_tate_minus[i+1][used+1] = min(dp_tate_minus[i+1][used+1],dp_tate_minus[i][used]+tate[i]);\n\t\t\t\t}\n\n\t\t\t\tdp_tate_plus[i+1][used] = max(dp_tate_plus[i+1][used],dp_tate_plus[i][used]+tate[i]*(-1));\n\t\t\t\tdp_tate_minus[i+1][used] = min(dp_tate_minus[i+1][used],dp_tate_minus[i][used]+tate[i]*(-1));\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tfor(int a = 0; a <= K; a++){\n\t\tfor(int b = 0; b <= K-a; b++){\n\n\t\t\tans = max(ans,max(dp_yoko_plus[yoko_index][a],abs(dp_yoko_minus[yoko_index][a]))\n\t\t\t\t\t+max(dp_tate_plus[tate_index][b],abs(dp_tate_minus[tate_index][b])));\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":34508,"score_of_the_acc":-0.2842,"final_rank":8},{"submission_id":"aoj_2809_2670974","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nchar buf[2001];\nint yoko[2001],tate[2001];\nint dp_yoko_plus[2000][2001],dp_yoko_minus[2000][2001];\nint dp_tate_plus[2000][2001],dp_tate_minus[2000][2001];\n\n\nint main(){\n\n\tint K;\n\tscanf(\"%s\",buf);\n\tscanf(\"%d\",&K);\n\n\tint yoko_index = 0,tate_index = 0;\n\tfor(int i = 0; buf[i] != '\\0'; i++){\n\t\tif(buf[i] == 'L' || buf[i] == 'R'){\n\t\t\tif(buf[i] == 'L'){\n\t\t\t\tyoko[yoko_index++] = -1;\n\t\t\t}else{\n\t\t\t\tyoko[yoko_index++] = 1;\n\t\t\t}\n\t\t}else{\n\t\t\tif(buf[i] == 'D'){\n\t\t\t\ttate[tate_index++] = -1;\n\t\t\t}else{\n\t\t\t\ttate[tate_index++] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < yoko_index; i++){\n\t\tfor(int a = 0; a <= K; a++){\n\t\t\tdp_yoko_plus[i][a] = -BIG_NUM;\n\t\t\tdp_yoko_minus[i][a] = BIG_NUM;\n\t\t}\n\t}\n\n\tdp_yoko_plus[0][0] = 0;\n\tdp_yoko_minus[0][0] = 0;\n\n\tfor(int i = 0; i < yoko_index; i++){\n\t\tfor(int used = 0; used <= min(i,K); used++){\n\t\t\tif(used%2 == 0){\n\n\t\t\t\tif(used < K){\n\t\t\t\t\tdp_yoko_plus[i+1][used+1] = max(dp_yoko_plus[i+1][used+1],dp_yoko_plus[i][used]+yoko[i]*(-1));\n\t\t\t\t\tdp_yoko_minus[i+1][used+1] = min(dp_yoko_minus[i+1][used+1],dp_yoko_minus[i][used]+yoko[i]*(-1));\n\t\t\t\t}\n\n\t\t\t\tdp_yoko_plus[i+1][used] = max(dp_yoko_plus[i+1][used],dp_yoko_plus[i][used]+yoko[i]);\n\t\t\t\tdp_yoko_minus[i+1][used] = min(dp_yoko_minus[i+1][used],dp_yoko_minus[i][used]+yoko[i]);\n\n\t\t\t}else{\n\t\t\t\tif(used < K){\n\t\t\t\t\tdp_yoko_plus[i+1][used+1] = max(dp_yoko_plus[i+1][used+1],dp_yoko_plus[i][used]+yoko[i]);\n\t\t\t\t\tdp_yoko_minus[i+1][used+1] = min(dp_yoko_minus[i+1][used+1],dp_yoko_minus[i][used]+yoko[i]);\n\t\t\t\t}\n\n\t\t\t\tdp_yoko_plus[i+1][used] = max(dp_yoko_plus[i+1][used],dp_yoko_plus[i][used]+yoko[i]*(-1));\n\t\t\t\tdp_yoko_minus[i+1][used] = min(dp_yoko_minus[i+1][used],dp_yoko_minus[i][used]+yoko[i]*(-1));\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < tate_index; i++){\n\t\tfor(int a = 0; a <= K; a++){\n\t\t\tdp_tate_plus[i][a] = -BIG_NUM;\n\t\t\tdp_tate_minus[i][a] = BIG_NUM;\n\t\t}\n\t}\n\n\tdp_tate_plus[0][0] = 0;\n\tdp_tate_minus[0][0] = 0;\n\n\tfor(int i = 0; i < tate_index; i++){\n\t\tfor(int used = 0; used <= min(i,K); used++){\n\t\t\tif(used%2 == 0){\n\n\t\t\t\tif(used < K){\n\t\t\t\t\tdp_tate_plus[i+1][used+1] = max(dp_tate_plus[i+1][used+1],dp_tate_plus[i][used]+tate[i]*(-1));\n\t\t\t\t\tdp_tate_minus[i+1][used+1] = min(dp_tate_minus[i+1][used+1],dp_tate_minus[i][used]+tate[i]*(-1));\n\t\t\t\t}\n\n\t\t\t\tdp_tate_plus[i+1][used] = max(dp_tate_plus[i+1][used],dp_tate_plus[i][used]+tate[i]);\n\t\t\t\tdp_tate_minus[i+1][used] = min(dp_tate_minus[i+1][used],dp_tate_minus[i][used]+tate[i]);\n\n\t\t\t}else{\n\n\t\t\t\tif(used < K){\n\t\t\t\t\tdp_tate_plus[i+1][used+1] = max(dp_tate_plus[i+1][used+1],dp_tate_plus[i][used]+tate[i]);\n\t\t\t\t\tdp_tate_minus[i+1][used+1] = min(dp_tate_minus[i+1][used+1],dp_tate_minus[i][used]+tate[i]);\n\t\t\t\t}\n\n\t\t\t\tdp_tate_plus[i+1][used] = max(dp_tate_plus[i+1][used],dp_tate_plus[i][used]+tate[i]*(-1));\n\t\t\t\tdp_tate_minus[i+1][used] = min(dp_tate_minus[i+1][used],dp_tate_minus[i][used]+tate[i]*(-1));\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tfor(int a = 0; a <= K; a++){\n\t\tfor(int b = 0; b <= K; b++){\n\t\t\tif(a+b > K)break;\n\n\t\t\tans = max(ans,max(dp_yoko_plus[yoko_index][a],abs(dp_yoko_minus[yoko_index][a]))\n\t\t\t\t\t+max(dp_tate_plus[tate_index][b],abs(dp_tate_minus[tate_index][b])));\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":34492,"score_of_the_acc":-0.284,"final_rank":7},{"submission_id":"aoj_2809_2391347","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <vector>\n#include <queue>\n#include <string>\n#include <algorithm>\n#include <iostream>\n#include <string>\n#include <map>\n#include <set>\n#include <functional>\n#include <iostream>\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n \n//[?????????¨????????????£??????][???????????????¨??????°][??????????????????£???????????????]\nint dp[2][2001][2];\nint dp2[2][2001][2];\nint tmp[2001][2];\nint tmp2[2001][2];\nstring str;\nint sumx[2001];\nint sumy[2001];\nint n,k;\n \nint main(void){\n cin >> str;\n n=str.size();\n scanf(\"%d\",&k);\n for(int i=0;i<=k;i++){\n for(int j=0;j<2;j++){\n dp[0][i][j]=-3000;\n dp2[0][i][j]=3000;\n dp[1][i][j]=-3000;\n dp2[1][i][j]=3000;\n }\n }\n dp[0][0][0]=0;\n dp[1][0][0]=0;\n dp2[0][0][0]=0;\n dp2[1][0][0]=0;\n \n for(int aa=0;aa<n;aa++){\n for(int i=0;i<=k;i++){\n for(int j=0;j<2;j++){\n tmp[i][j]=-3000;\n tmp2[i][j]=3000;\n }\n }\n for(int i=0;i<=k;i++){\n if(str[aa]=='U' || str[aa]=='D'){\n for(int j=0;j<2;j++){\n tmp[i][j]=max(tmp[i][j],dp[0][i][j]);\n tmp2[i][j]=min(tmp2[i][j],dp2[0][i][j]);\n }\n }\n if(str[aa]=='L'){\n tmp[i][0]=max(tmp[i][0],dp[0][i][0]-1);\n tmp[i][1]=max(tmp[i][1],dp[0][i][1]+1);\n tmp2[i][0]=min(tmp2[i][0],dp2[0][i][0]-1);\n tmp2[i][1]=min(tmp2[i][1],dp2[0][i][1]+1);\n if(i+1<=k){\n tmp[i+1][1]=max(tmp[i+1][1],dp[0][i][0]+1);\n tmp[i+1][0]=max(tmp[i+1][0],dp[0][i][1]-1);\n tmp2[i+1][1]=min(tmp2[i+1][1],dp2[0][i][0]+1);\n tmp2[i+1][0]=min(tmp2[i+1][0],dp2[0][i][1]-1);\n }\n }\n if(str[aa]=='R'){\n tmp[i][0]=max(tmp[i][0],dp[0][i][0]+1);\n tmp[i][1]=max(tmp[i][1],dp[0][i][1]-1);\n tmp2[i][0]=min(tmp2[i][0],dp2[0][i][0]+1);\n tmp2[i][1]=min(tmp2[i][1],dp2[0][i][1]-1);\n if(i+1<=k){\n tmp[i+1][1]=max(tmp[i+1][1],dp[0][i][0]-1);\n tmp[i+1][0]=max(tmp[i+1][0],dp[0][i][1]+1);\n tmp2[i+1][1]=min(tmp2[i+1][1],dp2[0][i][0]-1);\n tmp2[i+1][0]=min(tmp2[i+1][0],dp2[0][i][1]+1);\n }\n }\n }\n for(int i=0;i<=k;i++){\n for(int j=0;j<2;j++){\n dp[0][i][j]=tmp[i][j];\n dp2[0][i][j]=tmp2[i][j];\n }\n }\n }\n \n for(int aa=0;aa<n;aa++){\n for(int i=0;i<=k;i++){\n for(int j=0;j<2;j++){\n tmp[i][j]=-3000;\n tmp2[i][j]=3000;\n }\n }\n for(int i=0;i<=k;i++){\n if(str[aa]=='L' || str[aa]=='R'){\n for(int j=0;j<2;j++){\n tmp[i][j]=max(tmp[i][j],dp[1][i][j]);\n tmp2[i][j]=min(tmp2[i][j],dp2[1][i][j]);\n }\n }\n if(str[aa]=='D'){\n tmp[i][0]=max(tmp[i][0],dp[1][i][0]-1);\n tmp[i][1]=max(tmp[i][1],dp[1][i][1]+1);\n tmp2[i][0]=min(tmp2[i][0],dp2[1][i][0]-1);\n tmp2[i][1]=min(tmp2[i][1],dp2[1][i][1]+1);\n if(i+1<=k){\n tmp[i+1][1]=max(tmp[i+1][1],dp[1][i][0]+1);\n tmp[i+1][0]=max(tmp[i+1][0],dp[1][i][1]-1);\n tmp2[i+1][1]=min(tmp2[i+1][1],dp2[1][i][0]+1);\n tmp2[i+1][0]=min(tmp2[i+1][0],dp2[1][i][1]-1);\n }\n }\n if(str[aa]=='U'){\n tmp[i][0]=max(tmp[i][0],dp[1][i][0]+1);\n tmp[i][1]=max(tmp[i][1],dp[1][i][1]-1);\n tmp2[i][0]=min(tmp2[i][0],dp2[1][i][0]+1);\n tmp2[i][1]=min(tmp2[i][1],dp2[1][i][1]-1);\n if(i+1<=k){\n tmp[i+1][1]=max(tmp[i+1][1],dp[1][i][0]-1);\n tmp[i+1][0]=max(tmp[i+1][0],dp[1][i][1]+1);\n tmp2[i+1][1]=min(tmp2[i+1][1],dp2[1][i][0]-1);\n tmp2[i+1][0]=min(tmp2[i+1][0],dp2[1][i][1]+1);\n }\n }\n }\n for(int i=0;i<=k;i++){\n for(int j=0;j<2;j++){\n dp[1][i][j]=tmp[i][j];\n dp2[1][i][j]=tmp2[i][j];\n }\n }\n }\n \n for(int i=0;i<2;i++){\n for(int j=1;j<=k;j++){\n for(int l=0;l<2;l++){\n dp[i][j][l]=max(dp[i][j][l],dp[i][j-1][l]);\n dp2[i][j][l]=min(dp2[i][j][l],dp2[i][j-1][l]);\n }\n }\n }\n int res=0;\n for(int i=0;i<=k;i++){\n int lr=max(max(dp[0][i][0],dp[0][i][1]),max(-dp2[0][i][0],-dp2[0][i][1]));\n int ud=max(max(dp[1][k-i][0],dp[1][k-i][1]),max(-dp2[1][k-i][0],-dp2[1][k-i][1]));\n res=max(res,lr+ud);\n }\n printf(\"%d\\n\",res);\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3408,"score_of_the_acc":-0.2079,"final_rank":6},{"submission_id":"aoj_2809_2388774","code_snippet":"#include <string>\n#include <map>\n#include <iostream>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\n#define X real()\n#define Y imag()\n\n// #define DEBUG\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\ntypedef complex<int> Pos;\n\nint dp[2][2][2001][2001];\n\nint N, K;\nstring S;\n\nconst int INF = 1e9;\n\n/*\nvoid dfs(int n, int k, int pos, bool dir_x, bool plus)\n{\n cerr << n << \" \" << k << \" \" << pos << endl;\n\n if (~dp[dir_x][plus][n][k]) return dp[dir_x][plus][n][k];\n if (n == N) return dp[dir_x][plus][n][k] = pos;\n\n int diff;\n if (dir_x) {\n if (S[n] == 'L' || S[n] == 'R') {\n diff = (S[n] == 'R' ? 1 : -1);\n } else {\n diff = 0;\n }\n } else {\n if (S[n] == 'D' || S[n] == 'U') {\n diff = (S[n] == 'U' ? 1 : -1);\n } else {\n diff = 0;\n }\n }\n\n int mirror = (k%2 == 0 ? 1 : -1);\n int res = dfs(n+1, k, pos + (mirror * diff), dir_x, plus);\n if (k < K) {\n if (plus) res = max(res, dfs(n+1, k+1, pos + (mirror * diff * -1), dir_x, plus));\n else res = min(res, dfs(n+1, k+1, pos + (mirror * diff * -1), dir_x, plus));\n }\n\n return dp[dir_x][plus][n][k] = res;\n}\n*/\n\nint get_diff(char dir, bool dir_x)\n{\n int diff;\n if (dir_x) {\n if (dir == 'L' || dir == 'R') {\n diff = (dir == 'R' ? 1 : -1);\n } else {\n diff = 0;\n }\n } else {\n if (dir == 'D' || dir == 'U') {\n diff = (dir == 'U' ? 1 : -1);\n } else {\n diff = 0;\n }\n }\n return diff;\n}\n\n\nint main()\n{\n cin >> S >> K; \n N = S.size();\n\n rep(dir_x, 2) rep(n, N+1) rep(k, K+1) dp[dir_x][0][n][k] = INF;\n rep(dir_x, 2) rep(n, N+1) rep(k, K+1) dp[dir_x][1][n][k] = -INF;\n rep(dir_x, 2) rep(plus, 2) rep(k, K+1) dp[dir_x][plus][0][k] = 0;\n \n\n rep(dir_x, 2) rep(plus, 2) {\n rep(n, N) rep(k, K+1) {\n int diff = get_diff(S[n], dir_x);\n int mirror = (k%2 == 0 ? 1 : -1);\n {\n int npos = dp[dir_x][plus][n][k] + mirror * diff;\n\n if (plus) chmax(dp[dir_x][plus][n+1][k], npos);\n else chmin(dp[dir_x][plus][n+1][k], npos);\n }\n if (k < K) {\n int npos = dp[dir_x][plus][n][k] + mirror * diff * -1;\n if (plus) chmax(dp[dir_x][plus][n+1][k+1], npos);\n else chmin(dp[dir_x][plus][n+1][k+1], npos);\n }\n }\n }\n\n int dp_abs[2][2001] = {};\n rep(k, K+1) {\n rep(dir_x, 2) {\n int mx = max(abs(dp[dir_x][0][N][k]), abs(dp[dir_x][1][N][k]));\n dp_abs[dir_x][k] = max(dp_abs[dir_x][k], mx);\n }\n }\n\n int ans = 0;\n rep(kx, K+1) {\n rep(ky, K+1) {\n if (kx + ky <= K) {\n ans = max(ans, dp_abs[0][ky] + dp_abs[1][kx]);\n }\n }\n }\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":65736,"score_of_the_acc":-0.7063,"final_rank":15},{"submission_id":"aoj_2809_2330120","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)),end((a))\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort(ALL((c)))\n#define RSORT(c) sort(RALL((c)))\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\ntemplate<class S, class T>\nostream& operator<<(ostream& os, const pair<S,T>& p){\n return os << p.FF << \" \" << p.SS;\n}\ntemplate<class T>\nvoid maxi(T& x, T y){\n if(x < y) x = y;\n}\ntemplate<class T>\nvoid mini(T& x, T y){\n if(x > y) x = y;\n}\n\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst LL MOD = 1e9+7;\n\nint dp_mn_x[2001][2001][2];\nint dp_mx_x[2001][2001][2];\nint dp_mn_y[2001][2001][2];\nint dp_mx_y[2001][2001][2];\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n string S; cin >> S;\n int K; cin >> K;\n int N = SZ(S);\n\n fill((int*)dp_mn_x, (int*)dp_mn_x+2001*2001*2, 1e9);\n fill((int*)dp_mx_x, (int*)dp_mx_x+2001*2001*2, -1e9);\n fill((int*)dp_mn_y, (int*)dp_mn_y+2001*2001*2, 1e9);\n fill((int*)dp_mx_y, (int*)dp_mx_y+2001*2001*2, -1e9);\n dp_mn_x[0][0][0] = dp_mx_x[0][0][0] = dp_mn_y[0][0][0] = dp_mx_y[0][0][0] = 0;\n\n REP(i,N){\n\tREP(k,K+1){\n\t REP(f,2){\n\t\tif(S[i] == 'L' || S[i] == 'R'){\n\t\t mini(dp_mn_y[i+1][k][f], dp_mn_y[i][k][f]);\n\t\t maxi(dp_mx_y[i+1][k][f], dp_mx_y[i][k][f]);\n\n\t\t int dx = (S[i]=='L'?-1:1) * (f==0?1:-1);\n\t\t mini(dp_mn_x[i+1][k][f], dp_mn_x[i][k][f] + dx);\n\t\t mini(dp_mn_x[i+1][k+1][f^1], dp_mn_x[i][k][f] + dx * -1);\n\t\t maxi(dp_mx_x[i+1][k][f], dp_mx_x[i][k][f] + dx);\n\t\t maxi(dp_mx_x[i+1][k+1][f^1], dp_mx_x[i][k][f] + dx * -1);\n\t\t}\n\t\telse{\n\t\t mini(dp_mn_x[i+1][k][f], dp_mn_x[i][k][f]);\n\t\t maxi(dp_mx_x[i+1][k][f], dp_mx_x[i][k][f]);\n\n\t\t int dx = (S[i]=='D'?-1:1) * (f==0?1:-1);\n\t\t mini(dp_mn_y[i+1][k][f], dp_mn_y[i][k][f] + dx);\n\t\t mini(dp_mn_y[i+1][k+1][f^1], dp_mn_y[i][k][f] + dx * -1);\n\t\t maxi(dp_mx_y[i+1][k][f], dp_mx_y[i][k][f] + dx);\n\t\t maxi(dp_mx_y[i+1][k+1][f^1], dp_mx_y[i][k][f] + dx * -1);\n\t\t}\n\t }\n\t}\n }\n\n int ans = -1e9;\n REP(k1,K+1) REP(k2,K+1){\n\tif(k1+k2 > K) continue;\n\tREP(f1,2) REP(f2,2)\n\t maxi(ans, max(-dp_mn_x[N][k1][f1], dp_mx_x[N][k1][f1])\n\t\t + max(-dp_mn_y[N][k2][f2], dp_mx_y[N][k2][f2]));\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":128332,"score_of_the_acc":-1.2759,"final_rank":19},{"submission_id":"aoj_2809_2324867","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nvoid update(int &a, int b) {\n\tif (a < b)a = b;\n}\n\nint main() {\n\tstring st; cin >> st;\n\tint K; cin >> K;\n\tvector<vector<int>>dp_l(st.size() + 1, vector<int>(K + 1, -10000));\n\tvector<vector<int>>dp_r(st.size() + 1, vector<int>(K + 1, -10000));\n\tvector<vector<int>>dp_u(st.size() + 1, vector<int>(K + 1, -10000));\n\tvector<vector<int>>dp_d(st.size() + 1, vector<int>(K + 1, -10000));\n\tdp_l[0][0] = 0;\n\tdp_r[0][0] = 0;\n\tdp_u[0][0] = 0;\n\tdp_d[0][0] = 0;\n\tfor (int i = 0; i < st.size(); ++i) {\n\t\tchar c = st[i];\n\t\tfor (int magic_use = 0; magic_use <= K; ++magic_use) {\n\t\t\tbool rev = magic_use % 2;\n\t\t\tif ((c == 'L'&&!rev) || (c == 'R'&&rev)) {\n\t\t\t\tif (magic_use != K) {\n\t\t\t\t\tupdate(dp_r[i + 1][magic_use + 1], dp_r[i][magic_use] + 1);\n\t\t\t\t}\n\t\t\t\tupdate(dp_r[i + 1][magic_use], dp_r[i][magic_use] - 1);\n\t\t\t\tupdate(dp_l[i + 1][magic_use], dp_l[i][magic_use] + 1);\n\t\t\t\tupdate(dp_u[i + 1][magic_use], dp_u[i][magic_use]);\n\t\t\t\tupdate(dp_d[i + 1][magic_use], dp_d[i][magic_use]);\n\t\t\t}\n\t\t\telse if ((c == 'R'&&!rev) || (c == 'L'&&rev)) {\n\t\t\t\tif (magic_use != K) {\n\t\t\t\t\tupdate(dp_l[i + 1][magic_use + 1], dp_l[i][magic_use] + 1);\n\t\t\t\t}\n\t\t\t\tupdate(dp_r[i + 1][magic_use], dp_r[i][magic_use] + 1);\n\t\t\t\tupdate(dp_l[i + 1][magic_use], dp_l[i][magic_use] - 1);\n\t\t\t\tupdate(dp_u[i + 1][magic_use], dp_u[i][magic_use]);\n\t\t\t\tupdate(dp_d[i + 1][magic_use], dp_d[i][magic_use]);\n\t\t\t}\n\t\t\telse if ((c == 'U'&&!rev) || (c == 'D'&&rev)) {\n\t\t\t\tif (magic_use != K) {\n\t\t\t\t\tupdate(dp_d[i + 1][magic_use + 1], dp_d[i][magic_use] + 1);\n\t\t\t\t}\n\t\t\t\tupdate(dp_r[i + 1][magic_use], dp_r[i][magic_use]);\n\t\t\t\tupdate(dp_l[i + 1][magic_use], dp_l[i][magic_use]);\n\t\t\t\tupdate(dp_u[i + 1][magic_use], dp_u[i][magic_use] + 1);\n\t\t\t\tupdate(dp_d[i + 1][magic_use], dp_d[i][magic_use] - 1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (magic_use != K) {\n\t\t\t\t\tupdate(dp_u[i + 1][magic_use + 1], dp_u[i][magic_use] + 1);\n\t\t\t\t}\n\t\t\t\tupdate(dp_r[i + 1][magic_use], dp_r[i][magic_use]);\n\t\t\t\tupdate(dp_l[i + 1][magic_use], dp_l[i][magic_use]);\n\t\t\t\tupdate(dp_u[i + 1][magic_use], dp_u[i][magic_use] - 1);\n\t\t\t\tupdate(dp_d[i + 1][magic_use], dp_d[i][magic_use]+ 1);\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\tfor (int y = 0; y <= K; ++y) {\n\t\tfor (int x = 0; x <= K; ++x) {\n\t\t\tif (x + y <= K) {\n\t\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\t\tint sum = 0;\n\t\t\t\t\tif (i % 2)sum += dp_l[st.size()][x];\n\t\t\t\t\telse sum += dp_r[st.size()][x];\n\n\t\t\t\t\tif (i / 2)sum += dp_u[st.size()][y];\n\t\t\t\t\telse sum += dp_d[st.size()][y];\n\n\t\t\t\t\tupdate(ans, sum);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":65740,"score_of_the_acc":-0.6374,"final_rank":14},{"submission_id":"aoj_2809_2273375","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\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\n#define INF 147483600\n\nint k;\n\nvoid solve(vector<char> &s, vector<int> &ans, string str){\n int n = s.size();\n if(n==0) return;\n for(auto c : str){\n vector<vector<int>> dp(n, vector<int>(k+1,-INF));\n dp[0][0] = (s[0]==c);\n dp[0][1] = (s[0]!=c);\n repl(i,1,n){\n dp[i][0] = dp[i-1][0] + (s[i]==c);\n repl(j,1,k+1){\n if(j%2==0) dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]) + (s[i]==c);\n else dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]) + (s[i]!=c);\n }\n }\n rep(i,k+1) ans[i] = max(ans[i], 2*dp[n-1][i]-n);\n }\n}\n\nint main(){\n string s;\n cin>>s>>k;\n\n vector<char> x,y;\n for(auto c: s){\n if(c=='R' || c=='L') x.pb(c);\n else y.pb(c);\n }\n\n vector<int> xx(k+1,0),yy(k+1,0);\n\n solve(x, xx, \"RL\");\n solve(y, yy, \"UD\");\n\n int ans = 0;\n rep(i,k+1) rep(j,k+1) if(i+j<=k) ans = max(ans, xx[i]+yy[j]);\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":10944,"score_of_the_acc":-0.0957,"final_rank":3},{"submission_id":"aoj_2809_2273065","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n\n// 0:R????????°????????§???, 1:L????????°????????§???\nint dp[2001][2001][2];\nconst string LR=\"LR\";\n\nvoid calc(string s, int K)\n{\n int S=s.size();\n memset(dp,0,sizeof(dp));\n rep(i,S)rep(j,K+1)rep(k,2)\n {\n // ??????????????????\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]+(s[i]==LR[(j%2+k+1)%2]));\n // ????????????\n if(j<K) dp[i+1][j+1][k] = max(dp[i+1][j+1][k], dp[i][j][k]+(s[i]==LR[(j%2+k)%2]));\n }\n}\n\nint main()\n{\n cin.tie(0);ios::sync_with_stdio(false);\n\n string s;\n int K;\n cin >>s >>K;\n\n string x=\"\",y=\"\";\n rep(i,s.size())\n {\n if(s[i]=='L' || s[i]=='R') x+=s[i];\n else y+=(s[i]=='U')?'L':'R';\n }\n\n int X=x.size(), Y=y.size();\n // 0:R????????°????????§???, 1:L????????°????????§???\n int dx[2001]={};\n // 0:D????????°????????§???, 1:U????????°????????§???\n int dy[2001]={};\n\n calc(x,K);\n rep(i,K+1) dx[i]=max(2*dp[X][i][0]-X, 2*dp[X][i][1]-X);\n calc(y,K);\n rep(i,K+1) dy[i]=max(2*dp[Y][i][0]-Y, 2*dp[Y][i][1]-Y);\n\n int ans=0;\n rep(i,K+1)rep(j,K+1)if(i+j<=K) ans=max(ans,dx[i]+dy[j]);\n\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":34468,"score_of_the_acc":-0.3528,"final_rank":10}],"string":"[\n {\n \"submission_id\": \"aoj_2809_9117771\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\\n\\ntemplate <typename T> bool chmin(T &a, const T &b) {\\n\\tif (a <= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> bool chmax(T &a, const T &b) {\\n\\tif (a >= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> T max(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T min(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T sum(vector<T> &a){\\n\\tT ret = 0;\\n\\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\\n\\treturn ret;\\n}\\n\\nvector<int> solve(vector<int> a){\\n\\tint geta = 2500;\\n\\tvector<int> dp0(5000,2100);\\n\\tvector<int> dp1(5000,2100);\\n\\tdp0[geta] = 0;\\n\\trep(i,0,(int)a.size()){\\n\\t\\tvector<int> ndp0(5000,2100);\\n\\t\\tvector<int> ndp1(5000,2100);\\n\\t\\trep(j,0,5000){\\n\\t\\t\\tif (0 <= j+a[i] && j+a[i] < 5000){\\n\\t\\t\\t\\tchmin(ndp0[j+a[i]], dp0[j]);\\n\\t\\t\\t\\tchmin(ndp0[j+a[i]], dp1[j] + 1);\\n\\t\\t\\t}\\n\\t\\t\\tif (0 <= j-a[i] && j-a[i] < 5000){\\n\\t\\t\\t\\tchmin(ndp1[j-a[i]], dp1[j]);\\n\\t\\t\\t\\tchmin(ndp1[j-a[i]], dp0[j] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(ndp0, dp0);\\n\\t\\tswap(ndp1, dp1);\\n\\t}\\n\\tvector<int> targ(2200, 0);\\n\\trep(j,0,5000){\\n\\t\\tchmax(targ[dp0[j]], abs(j-geta));\\n\\t\\tchmax(targ[dp1[j]], abs(j-geta));\\n\\t}\\n\\trep(j,0,2180){\\n\\t\\tchmax(targ[j+1], targ[j]);\\n\\t}\\n\\treturn targ;\\n}\\n\\n\\nint main(){\\n\\tstring s; cin >> s;\\n\\tint k; cin >> k;\\n\\n\\tvector<int> a, b;\\n\\trep(i,0,(int)s.size()){\\n\\t\\tif (s[i] == 'U') a.push_back(+1);\\n\\t\\tif (s[i] == 'D') a.push_back(-1);\\n\\t\\tif (s[i] == 'L') b.push_back(+1);\\n\\t\\tif (s[i] == 'R') b.push_back(-1);\\n\\t}\\n\\n\\tvector<int> x = solve(a);\\n\\tvector<int> y = solve(b);\\n\\t\\n\\tint ans = 0;\\n\\trep(i,0,k+1){\\n\\t\\tchmax(ans, x[i] + y[k-i]);\\n\\t}\\n\\tcout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": -0.0365,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2809_9117693\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#define rep(i,n) for(ll i=0;i<(n);++i)\\n#define ALL(x) x.begin(),x.end()\\n#define BACK(x) x.rbegin(),x.rend()\\n#define MOD1 1000000007\\n#define MOD2 998244353\\n#define MOD1_BASE 131\\n#define INF (LLONG_MAX / 2)\\n#define FLOAT_ANS setprecision(30)\\n#define TORAD(x) (x*acos(-1)/180.0)\\n#define TODEG(x) (x*180/acos(-1))\\n#define GET_VALUENAME(value) # value\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LL = __int128_t;\\nusing ull = unsigned long long;\\n\\ntemplate<typename T> // T:重み\\nusing p_que = priority_queue<T,vector<T>,greater<T>>;\\n\\ntemplate<typename T>\\nbool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}\\n\\ntemplate<typename T>\\nbool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}\\n\\nll modpow(ll a, ll n, ll mod) {ll res=1;while (n>0) {if(n&1)res=(res*(a%mod))%mod;a=((a%mod)*(a%mod))%mod;n>>=1;}return res;}\\n\\ntemplate<typename T>\\nvoid RotateVec2(vector<vector<T>>&v){ll h=v.size();ll w=v[0].size();vector<vector<T>>t(w,vector<T>(h));rep(i,h){rep(j,w){t[j][h-i-1]=v[i][j];}}v=t;}\\n\\ntemplate<class T>\\nbool InRange(T x, T mn, T mx){return (mn <= x && x <= mx);}\\n\\ntemplate<typename T>\\nvector<T>&merged(vector<T>&a,vector<T>&b) {vector<T>res;merge(a.begin(),a.end(),b.begin(),b.end(),back_inserter(res));return res;}\\n\\nstruct UnionFind{\\n vector<ll>tree;\\n UnionFind(ll x):tree(x, -1){}\\n ll root(ll x){if(tree[x]<0) return x;return tree[x]=root(tree[x]);}\\n bool same(ll x,ll y){return root(x)==root(y);}\\n ll size(ll x){return -tree[root(x)];}\\n void unite(ll x,ll y){x=root(x),y=root(y);if(x==y)return;if(size(x)<size(y))swap(x,y);tree[x]+=tree[y];tree[y]=x;}\\n};\\n\\ntemplate<class T>\\nstruct SegTree{\\n ll n;T e;vector<T>tree,lazy;function<T(T,T)>f,add;\\n SegTree(ll n_,function<T(T,T)>f_,T e_=0,function<T(T,T)>add_=[](T next,T old){return next;}):e(e_),f(f_),add(add_){\\n ll x=1;\\n while(x<n_)x*=2;\\n n=x;\\n tree.assign(n*2,e);\\n lazy.assign(n*2,e);\\n }\\n void eval(T k) {\\n if (lazy[k] == e) return;\\n if (k < n-1){\\n lazy[k*2+1]=lazy[k*2+1]=lazy[k];\\n }\\n tree[k]=lazy[k], lazy[k]=e;\\n }\\n void update(ll idx,T x){\\n update(idx, idx+1, x);\\n }\\n void update(ll a, ll b, ll x) { update(a, b, x, 0, n, 0); }\\n void update(ll a, ll b, ll x, ll l, ll r, ll k) {\\n eval(k);\\n if (a <= l and r <= b) {\\n lazy[k] = x;\\n eval(k);\\n }\\n else if (a < r and l < b) {\\n update(a, b, x, l, (l+r)/2, k*2+1);\\n update(a, b, x, (l+r)/2, r, k*2+1);\\n tree[k] = f(tree[k*2+1], tree[k*2+2]);\\n }\\n }\\n T query(ll x,ll y){\\n return query_sub(x,y,0,n,0);\\n }\\n T query_sub(ll x,ll y,ll l,ll r,ll k){\\n eval(k);\\n if(r<=x||y<=l)return e;\\n if(x<=l&&r<=y)return tree[k];\\n T c1=query_sub(x,y,l,(l+r)/2,k*2+1);\\n T c2=query_sub(x,y,(l+r)/2,r,k*2+2);\\n return f(c1,c2);\\n }\\n T get(ll idx){return tree[idx+n-1];}\\n};\\n\\ntemplate<std::uint_fast64_t Modulus> class modint {\\n using u64 = std::uint_fast64_t;\\npublic:\\n u64 a;\\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 constexpr modint operator/(const modint rhs) const noexcept {return modint(*this) /= rhs;}\\n constexpr modint &operator+=(const modint rhs) noexcept {a += rhs.a;if (a >= Modulus) {a -= Modulus;}return *this;}\\n constexpr modint &operator-=(const modint rhs) noexcept {if (a < rhs.a) {a += Modulus;}a -= rhs.a;return *this;}\\n constexpr modint &operator*=(const modint rhs) noexcept {a = a * rhs.a % Modulus;return *this;}\\n constexpr modint &operator/=(modint rhs) noexcept {\\n u64 exp = Modulus - 2;\\n while (exp) {\\n if (exp % 2) {\\n *this *= rhs;\\n }\\n rhs *= rhs;\\n exp /= 2;\\n }\\n return *this;\\n }\\n constexpr modint &operator=(u64 x){ a = x % Modulus; return *this; }\\n};\\n\\ntemplate<class T=ll>\\nstruct Vector2D {\\n T x, y;\\n Vector2D():x(0),y(0) {}\\n Vector2D(T x_, T y_):x(x_),y(y_) {}\\n\\n double length() const { return sqrt((double)x*x+y*y); };\\n T lengthp() const { return x*x+y*y; };\\n bool inrange(const Vector2D a, const Vector2D b) { return (InRange(x, a.x, b.x) and InRange(y, a.y, b.y)); }\\n Vector2D yx() { return Vector2D{ y, x }; }\\n Vector2D operator-(const Vector2D a) const { return Vector2D(*this) -= a; }\\n Vector2D operator+(const Vector2D a) const { return Vector2D(*this) += a; }\\n T operator*(const Vector2D a) const { return x*a.x+y*a.y; }\\n Vector2D operator*(const T a) const { return Vector2D(*this) *= a; }\\n Vector2D operator/(const T a) const { return Vector2D(*this) /= a; }\\n Vector2D &operator+=(const Vector2D a) { x += a.x; y += a.y; return *this; }\\n Vector2D &operator-=(const Vector2D a) { x -= a.x; y -= a.y; return *this; }\\n Vector2D &operator-=(const T a) { x -= a; y -= a; return *this; }\\n Vector2D &operator*=(const T a) { x *= a; y *= a; return *this; }\\n Vector2D &operator/=(const T a) { x /= a; y /= a; return *this; }\\n friend ostream& operator<< (ostream& stream, const Vector2D<>& x);\\n bool operator==(const Vector2D a) const { return (x==a.x and y==a.y); }\\n bool operator!=(const Vector2D a) const { return not (x==a.x and y==a.y); }\\n bool operator>(const Vector2D a) const { return a < *this; }\\n bool operator<(const Vector2D a) const \\n {\\n return make_pair(x,y) < make_pair(a.x, a.y);\\n // return x*a.y < y*a.x;\\n }\\n};\\n\\nostream& operator<< (ostream& stream, const Vector2D<ll>& x) {\\n string s = \\\"(\\\" + to_string(x.x) + \\\", \\\" + to_string(x.y) + \\\")\\\";\\n stream << s;\\n return stream;\\n}\\n\\nll popcount(ll x) { ll res = 0; while(x) {res+=x%2;x>>=1;} return res; }\\n\\n// debug kit\\nvoid print() { cout << endl; }\\ntemplate<class T>\\nvoid print_(vector<T>x) { for(auto i : x) cout << i << \\\" \\\"; }\\ntemplate<class T>\\nvoid print_(T x) { cout << x << \\\" \\\"; }\\n#ifdef ONLINE_JUDGE \\ntemplate<class T, class ...Args>\\nvoid print(T head, Args... args) {}\\ntemplate<class T>\\nvoid debug(T value) {}\\n#else\\ntemplate<class T, class ...Args>\\nvoid print(T head, Args... args) { print_(head); print(args...); }\\ntemplate<class T>\\nvoid debug(T value) { print((string)\\\"\\\\\\\"\\\"+GET_VALUENAME(value)+\\\"\\\\\\\": \\\", value); }\\n#endif\\n\\n// MAIN PROGRAM ------------\\n\\nusing mint = modint<MOD2>;\\nusing Vec2 = Vector2D<ll>;\\nconst Vec2 Angle[] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};\\n\\nstruct State\\n{\\n Vec2 pos = {0, 0};\\n ll dist = -INF;\\n int getDist() {\\n return abs(pos.x) + abs(pos.y);\\n }\\n bool operator<(const State a) \\n {\\n return dist < a.dist;\\n }\\n};\\n\\nint main() {\\n string s;\\n cin >> s;\\n ll k, n = s.length();\\n cin >> k;\\n map<char, ll>mp;\\n mp['U'] = 0;\\n mp['L'] = 1;\\n mp['D'] = 2;\\n mp['R'] = 3;\\n \\n vector dp(k+10, vector(4, State{}));\\n vector dp_next(k+10, vector(4, State{}));\\n\\n dp[0][0].dist = 0;\\n\\n rep(i, n) \\n {\\n rep(j, k+1) rep(l, 4)\\n {\\n if (dp[j][l].dist == -INF) continue;\\n int angle = mp[s[i]];\\n if ((angle%2 and l/2) or (angle%2==0 and l%2)) angle = (angle+2)%4;\\n\\n State base = dp[j][l];\\n rep(idx, 2)\\n {\\n // 0: 魔法なし, 1: 魔法あり\\n State next = base;\\n\\n next.pos += Angle[angle];\\n next.dist = next.getDist();\\n\\n chmax(dp_next[j+idx][l], next);\\n\\n // 魔法処理\\n angle = (angle+2) % 4;\\n if (angle % 2) l ^= 2;\\n else l^= 1;\\n }\\n }\\n dp = dp_next;\\n dp_next = vector(k+10, vector(4, State{}));\\n }\\n\\n ll ans = 0;\\n rep(i, k+1){\\n rep(j, 4) {\\n chmax(ans, dp[i][j].dist);\\n }\\n }\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 4120,\n \"score_of_the_acc\": -0.5929,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2809_9117663\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\npair<vector<int>,vector<int>> calc(vector<int> rui, int k){\\n int n = rui.size()-1;\\n vector<int> dpma(k+1,-iinf), dpmi(k+1,iinf);\\n dpma[0] = rui[0], dpmi[0] = rui[0];\\n rep(i,n){\\n auto epma = dpma, epmi = dpmi;\\n rep(j,k){\\n chmax(epma[j+1],dpma[j] + 2*rui[i]*(j % 2 == 0 ? -1 : 1));\\n chmin(epmi[j+1],dpmi[j] + 2*rui[i]*(j % 2 == 0 ? -1 : 1));\\n }\\n swap(dpma,epma);\\n swap(dpmi,epmi);\\n }\\n rep(i,k){\\n chmax(dpma[i+1],dpma[i]);\\n chmin(dpmi[i+1],dpmi[i]);\\n }\\n return pair(dpma,dpmi);\\n}\\n\\nvoid solve(){\\n string s; in(s);\\n int k; in(k);\\n int n = s.size();\\n vector<int> ruix(n+1,0), ruiy(n+1,0);\\n reb(i,n){\\n ruix[i] = ruix[i+1] + (s[i] == 'D' ? 1 : s[i] == 'U' ? -1 : 0);\\n ruiy[i] = ruiy[i+1] + (s[i] == 'R' ? 1 : s[i] == 'L' ? -1 : 0);\\n }\\n auto [xma, xmi] = calc(ruix,k);\\n auto [yma, ymi] = calc(ruiy,k);\\n int ans = 0;\\n rep(i,k+1){\\n chmax(ans,abs(xma[i])+abs(yma[k-i]));\\n chmax(ans,abs(xma[i])+abs(ymi[k-i]));\\n chmax(ans,abs(xmi[i])+abs(yma[k-i]));\\n chmax(ans,abs(xmi[i])+abs(ymi[k-i]));\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.0014,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2809_9117630\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n//using uLL = unsigned __int128;\\nusing str = string;\\ntemplate <typename T> \\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T>\\nusing pq = priority_queue<T>;\\ntemplate <typename T>\\nusing vec = vector<T>;\\nusing pll = pair<long long, long long>;\\nusing pii = pair<int, int>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvl = vector<vector<ll>>;\\nusing vp = vector<pair<ll, ll>>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define vvvm vector<vector<vector<mint>>>\\n#define vvm vector<vector<mint>>\\n#define vm vector<mint>\\ntemplate <typename T1, typename T2>\\nusing umap = unordered_map<T1, T2>;\\ntemplate <typename T>\\nusing uset = unordered_set<T>;\\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\\n#define per(i, s, f) for(long long i = s; i >= f; i--)\\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\\n#define eb(a) emplace_back(a)\\n#define pb(a) push_back(a)\\n#define all0(x) (x).begin() ,(x).end()\\n#define all(x) (x).begin() + 1, (x).end()\\n#define ins(x, l, r) (l <= x && x <= r)\\n#define ENDL '\\\\n'\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//これが本当の組み込み関数ってね（笑）\\ntemplate <typename T>\\nint LB(vector<T> &A, T x) {\\n return lower_bound(A.begin(), A.end(), x) - A.begin();\\n}\\n\\ntemplate <typename T>\\nint UB(vector<T> &A, T x) {\\n return upper_bound(A.begin(), A.end(), x) - A.begin();\\n}\\ntemplate <typename T>\\nvoid UNIQUE(vector<T> &A, int indexed) {\\n sort(A.begin() + indexed, A.end());\\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\\n}\\n\\ntemplate <typename T>\\nvector<T> erase(vector<T>& A, T& x) {\\n\\tvector<T> res;\\n\\tfor(T a : A) if(a != x) res.emplace_back(a);\\n\\treturn res;\\n}\\nstring split(string& S, int l, int r) {\\n\\treturn S.substr(l, r - l + 1);\\n}\\n\\nint msb(long long a) {\\n if(a == 0) return -1;\\n return 64 - int(__builtin_clzll(a));\\n}\\ntemplate<class T>\\nvoid chmin(T &a, T b) {\\n if(a > b) a = b;\\n}\\ntemplate<class T>\\nvoid chmax(T &a, T b) {\\n if(a < b) a = b;\\n}\\n//////////////////////////////////////////////////////////////////////\\n//数学系\\n///////////////////////////////////////////////////////////////////////\\nll extgcd (ll a, ll b, ll &x, ll &y) {\\n if(b == 0) { x = 1;y = 0;return a;}\\n ll d = extgcd(b, a%b, y, x);\\n y -= a/b * x;\\n return d;\\n}\\ntemplate <typename T>\\nT CEIL(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\\n else return a / b;\\n}\\ntemplate <typename T>\\nT FLOOR(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\\n else return a/b - 1;\\n}\\nll SQRT(ll a) {\\n ll l = 0;\\n ll r = 3037000499LL;\\n while(l < r) {\\n ll mid = (l + r + 1) / 2;\\n if(mid * mid <= a) l = mid;\\n else r = mid - 1;\\n }\\n return l;\\n}\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//グローバル変数を置くところ\\n//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma GCC optimize \\\"trapv\\\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\\nconst ll big = 1001001001;\\nconst ll BIG = 2002002002002002002LL;\\nconst double pi = 3.141592653589793;\\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\\n//const ll mod = 1000000007;\\n//const ll mod = 998244353;\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n/*\\n以降全てをswapする。\\n\\nマンハッタン距離、つまり abs(x) + abs(y)の最大化。\\nK回まで操作をswapして良い（上下・左右で別の操作をする必要がある。)\\n\\n\\n[1]swapの分け方を全探索\\nこれをすると、xとyを独立に考えてよくなる？（互いの操作で変化しない && スコアが独立)\\n\\n「 t回まで操作をして良い時、abs(x)を最大化せよ。」\\nを解く。\\n最終的な座標の+-で場合分けすればよい。\\nあとは貪欲で終わり?\\n\\ndpを事前にしておく。\\n\\ndpy[2][f][i][d] .... iまで見た。d回上下のswapをした。今の状態がfの時の、yの最小値・最大値。\\ndpx[2][f][i][d] .... iまで、d回横、今の状態がf, xのmin/max\\n\\niを飛ばす。\\ndp[2][f][k]\\nmin/max, flag, k回使った。\\nO(KN)\\n\\n\\nLRLRLLLRLRLRLLRRR\\n\\n計算量を見積もる。\\n分け方でK通り。\\n分け方が決まった時、+-で2通り。\\n\\n*/\\n\\nvoid solve() {\\n\\tstring S;\\n\\tcin >> S;\\n\\tll K;\\n\\tcin >> K;\\n\\tll N = S.size();\\n\\tS = \\\" \\\" + S;\\n\\n\\tvvvl dpy(2, vvl(2, vl(K+1, BIG)));\\n\\trep(f, 0, 1) rep(k,0,K) dpy[1][f][k] = -BIG;\\n\\tdpy[0][0][0] = 0;\\n\\tdpy[1][0][0] = 0;\\n\\n\\n\\tvvvl dpx(2, vvl(2, vl(K+1, BIG)));\\n\\trep(f, 0, 1) rep(k,0,K) dpx[1][f][k] = -BIG;\\n\\tdpx[0][0][0] = 0;\\n\\tdpx[1][0][0] = 0;\\n\\n\\t{\\n\\t\\trep(i,1,N) {\\n\\t\\t\\tvvvl prey(2, vvl(2, vl(K+1, BIG)));\\n\\t\\t\\trep(f, 0, 1) rep(k,0,K) prey[1][f][k] = -BIG;\\n\\t\\t\\tswap(prey, dpy);\\n\\n\\t\\t\\tif(S[i] == 'L' || S[i] == 'R') {\\n\\t\\t\\t\\tdpy = prey;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\trep(m, 0, 1) {\\n\\t\\t\\t\\trep(f, 0, 1) {\\n\\t\\t\\t\\t\\trep(k, 0, K) if(abs(prey[m][f][k]) < big) {\\n\\t\\t\\t\\t\\t\\tll c = 1;\\n\\t\\t\\t\\t\\t\\tif(S[i] == 'D') c = -1;\\n\\t\\t\\t\\t\\t\\tif(f) c *= -1;//反転。\\n\\n\\t\\t\\t\\t\\t\\t//unuse\\n\\t\\t\\t\\t\\t\\tif(m==0) chmin(dpy[m][f][k], prey[m][f][k] + c);\\n\\t\\t\\t\\t\\t\\telse chmax(dpy[m][f][k], prey[m][f][k] + c);\\n\\n\\n\\t\\t\\t\\t\\t\\tif(k != K) {//use\\n\\t\\t\\t\\t\\t\\t c *= -1;\\n\\t\\t\\t\\t\\t\\t\\tll nf = f ^ 1;\\n\\t\\t\\t\\t\\t\\t\\tll nk = k + 1;\\n\\t\\t\\t\\t\\t\\t\\tif(m==0) chmin(dpy[m][nf][nk], prey[m][f][k] + c);\\n\\t\\t\\t\\t\\t\\t\\telse chmax(dpy[m][nf][nk], prey[m][f][k] + c);\\n\\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}\\n\\t}\\n\\n\\n\\t{\\n\\t\\trep(i,1,N) {\\n\\t\\t\\tvvvl prex(2, vvl(2, vl(K+1, BIG)));\\n\\t\\t\\trep(f, 0, 1) rep(k,0,K) prex[1][f][k] = -BIG;\\n\\t\\t\\tswap(prex, dpx);\\n\\n\\t\\t\\tif(S[i] == 'D' || S[i] == 'U') {\\n\\t\\t\\t\\tdpx = prex;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\trep(m, 0, 1) {\\n\\t\\t\\t\\trep(f, 0, 1) {\\n\\t\\t\\t\\t\\trep(k, 0, K) if(abs(prex[m][f][k]) < big) {\\n\\t\\t\\t\\t\\t\\tll c = 1;\\n\\t\\t\\t\\t\\t\\tif(S[i] == 'L') c = -1;\\n\\t\\t\\t\\t\\t\\tif(f) c *= -1;//反転。\\n\\n\\t\\t\\t\\t\\t\\t//unuse\\n\\t\\t\\t\\t\\t\\tif(m==0) chmin(dpx[m][f][k], prex[m][f][k] + c);\\n\\t\\t\\t\\t\\t\\telse chmax(dpx[m][f][k], prex[m][f][k] + c);\\n\\n\\n\\t\\t\\t\\t\\t\\tif(k != K) {//use\\n\\t\\t\\t\\t\\t\\t c *= -1;\\n\\t\\t\\t\\t\\t\\t\\tll nf = f ^ 1;\\n\\t\\t\\t\\t\\t\\t\\tll nk = k + 1;\\n\\t\\t\\t\\t\\t\\t\\tif(m==0) chmin(dpx[m][nf][nk], prex[m][f][k] + c);\\n\\t\\t\\t\\t\\t\\t\\telse chmax(dpx[m][nf][nk], prex[m][f][k] + c);\\n\\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}\\n\\t}\\n\\n\\n\\n\\n ll ans = -BIG;\\n\\trep(d, 0, K) {\\n\\t\\t//上にd。\\n\\t\\n\\t\\tll ansx = -BIG;\\n\\t\\trep(m,0,1) rep(f, 0, 1) rep(k, 0, K-d) if(abs(dpx[m][f][k]) < big) chmax(ansx, abs(dpx[m][f][k]));\\n\\n\\t\\tll ansy = -BIG;\\n\\t\\trep(m,0,1) rep(f, 0, 1) rep(k, 0, d) if(abs(dpy[m][f][k]) < big) chmax(ansy, abs(dpy[m][f][k]));\\n\\n\\t\\tchmax(ans, ansx + ansy);\\n\\n\\t}\\n \\n\\n\\n\\tcout << ans << endl;\\n\\t\\n \\n\\n \\n \\n\\n}\\n\\n\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n ll T = 1;\\n //cin >> T;\\n rep(i, 1, T) {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.1059,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2809_8108070\",\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\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n string s; cin >> s;\\n int n = s.size();\\n vector<pair<int,int>> v(n);\\n for (int i = 0; i < n; ++i) {\\n if (s[i] == 'U') v[i] = {0, 1};\\n else if (s[i] == 'L') v[i] = {-1, 0};\\n else if (s[i] == 'D') v[i] = {0, -1};\\n else v[i] = {1, 0};\\n }\\n int K; cin >> K;\\n int res = 0;\\n vector<vector<vector<int>>> dp(2, vector<vector<int>> (2, vector<int>(K+1, -1e9)));\\n dp[0][0][0] = 0;\\n dp[0][1][0] = 0;\\n dp[1][0][0] = 0;\\n dp[1][1][0] = 0;\\n for (int i = 0; i < n; ++i) {\\n vector<vector<vector<int>>> ndp(2, vector<vector<int>> (2, vector<int>(K+1, -1e9)));\\n for (int j = 0; j < 2; ++j) {\\n for (int k = 0; k < 2; ++k) {\\n for (int l = 0; l <= K; ++l) {\\n if (dp[j][k][l] == -1e9) continue;\\n // そのまま\\n {\\n int nxt = dp[j][k][l] + v[i].first * (j == 0 ? 1 : -1) + v[i].second * (k == 0 ? 1 : -1);\\n ndp[j][k][l] = max(ndp[j][k][l], nxt);\\n }\\n // 魔法1\\n if (l+1 <= K) {\\n int nxt = dp[j][k][l] + v[i].first * (j == 1 ? 1 : -1) + v[i].second * (k == 0 ? 1 : -1);\\n ndp[j^1][k][l+1] = max(ndp[j^1][k][l+1], nxt);\\n }\\n // 魔法2\\n if (l+1 <= K) {\\n int nxt = dp[j][k][l] + v[i].first * (j == 0 ? 1 : -1) + v[i].second * (k == 1 ? 1 : -1);\\n ndp[j][k^1][l+1] = max(ndp[j][k^1][l+1], nxt);\\n }\\n // 両方\\n if (l+2 <= K) {\\n int nxt = dp[j][k][l] + v[i].first * (j == 1 ? 1 : -1) + v[i].second * (k == 1 ? 1 : -1);\\n ndp[j^1][k^1][l+2] = max(ndp[j^1][k^1][l+2], nxt);\\n }\\n }\\n }\\n }\\n swap(dp, ndp);\\n }\\n for (int i = 0; i < 2; ++i) {\\n for (int j = 0; j < 2; ++j) {\\n for (int k = 0; k <= K; ++k) {\\n res = max(res, dp[i][j][k]);\\n }\\n }\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -0.1399,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2809_5967122\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n//#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\nusing namespace std;\\n//#include<boost/multiprecision/cpp_int.hpp>\\n//#include<boost/multiprecision/cpp_dec_float.hpp>\\n//namespace mp=boost::multiprecision;\\n//#define mulint mp::cpp_int\\n//#define mulfloat mp::cpp_dec_float_100\\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\\n#define INF (1<<30)\\n#define LINF (lint)(1LL<<56)\\n#define endl \\\"\\\\n\\\"\\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\\n#define flc(x) __builtin_popcountll(x)\\n#define pint pair<int,int>\\n#define pdouble pair<double,double>\\n#define plint pair<lint,lint>\\n#define fi first\\n#define se second\\n#define all(x) x.begin(),x.end()\\n#define vec vector<lint>\\n#define nep(x) next_permutation(all(x))\\ntypedef long long lint;\\nint dx[8]={1,1,0,-1,-1,-1,0,1};\\nint dy[8]={0,1,1,1,0,-1,-1,-1};\\nconst int MAX_N=4e5+5;\\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//vector<int> bucket[MAX_N/1000];\\nconstexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n/*#include<atcoder/all>\\nusing namespace atcoder;\\ntypedef __int128_t llint;*/\\n\\nint main(void){\\n string S;\\n cin >> S;\\n int K;\\n cin >> K;\\n int N=S.length();\\n int ans=0;\\n rep(x,2) rep(y,2){\\n int A[N]={},B[N]={};\\n rep(i,N){\\n if(S[i]=='L'){\\n if(x==1) A[i]=1;\\n else A[i]=-1;\\n }\\n if(S[i]=='R'){\\n if(x==1) A[i]=-1;\\n else A[i]=1;\\n }\\n if(S[i]=='U'){\\n if(y==1) B[i]=1;\\n else B[i]=-1;\\n }\\n if(S[i]=='D'){\\n if(y==1) B[i]=-1;\\n else B[i]=1;\\n }\\n }\\n int dp1[N+1][K+1],dp2[N+1][K+1];\\n rep(i,N+1) rep(j,K+1) dp1[i][j]=-INF,dp2[i][j]=-INF;\\n dp1[0][0]=0,dp2[0][0]=0;\\n rep(i,N) rep(j,K+1){\\n if(dp1[i][j]==-INF) continue;\\n int nxt=A[i];\\n if(j%2) nxt*=-1;\\n if(j!=K) chmax(dp1[i+1][j+1],dp1[i][j]+nxt*-1);\\n chmax(dp1[i+1][j],dp1[i][j]+nxt);\\n }\\n rep(i,N) rep(j,K+1){\\n if(dp2[i][j]==-INF) continue;\\n int nxt=B[i];\\n if(j%2) nxt*=-1;\\n if(j!=K) chmax(dp2[i+1][j+1],dp2[i][j]+nxt*-1);\\n chmax(dp2[i+1][j],dp2[i][j]+nxt);\\n }\\n int amax[K+1],bmax[K+1];\\n rep(i,K+1) amax[i]=-INF,bmax[i]=-INF;\\n amax[0]=dp1[N][0],bmax[0]=dp2[N][0];\\n rep(i,K){\\n amax[i+1]=max(dp1[N][i+1],amax[i]);\\n bmax[i+1]=max(dp2[N][i+1],bmax[i]);\\n }\\n rep(i,K+1){\\n chmax(ans,amax[i]+bmax[K-i]);\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 34680,\n \"score_of_the_acc\": -0.32,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2809_3991529\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\nint dp[2001][2001][2][2];\\nint main() {\\n\\tstring S;\\n\\tcin >> S;\\n\\tint K;\\n\\tcin >> K;\\n\\tint N = S.size();\\n\\tint ans = 0;\\n\\tfor (int rx = 0; rx < 2; rx++) {\\n\\t\\tfor (int ry = 0; ry < 2; ry++) {\\n\\t\\t\\tfill((int*)dp, (int*)(dp + N + 1), -(1 << 30));\\n\\t\\t\\tdp[0][0][rx][ry] = 0;\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tfor (int j = 0; j <= K; j++) {\\n\\t\\t\\t\\t\\tfor (int k = 0; k < 2; k++) {\\n\\t\\t\\t\\t\\t\\tfor (int l = 0; l < 2; l++) {\\n\\t\\t\\t\\t\\t\\t\\tif (dp[i][j][k][l] == -(1 << 30)) continue;\\n\\t\\t\\t\\t\\t\\t\\tint x = 0, y = 0;\\n\\t\\t\\t\\t\\t\\t\\tif (S[i] == 'R') x = 1;\\n\\t\\t\\t\\t\\t\\t\\telse if (S[i] == 'L') x = -1;\\n\\t\\t\\t\\t\\t\\t\\telse if (S[i] == 'U') y = 1;\\n\\t\\t\\t\\t\\t\\t\\telse y = -1;\\n\\t\\t\\t\\t\\t\\t\\tif (k) x *= -1;\\n\\t\\t\\t\\t\\t\\t\\tif (l) y *= -1;\\n\\t\\t\\t\\t\\t\\t\\t//操作をしない\\n\\t\\t\\t\\t\\t\\t\\tdp[i + 1][j][k][l] = max(dp[i + 1][j][k][l], dp[i][j][k][l] + x + y);\\n\\t\\t\\t\\t\\t\\t\\tif (j == K) continue;\\n\\t\\t\\t\\t\\t\\t\\t//x反転\\n\\t\\t\\t\\t\\t\\t\\tdp[i + 1][j + 1][k ^ 1][l] = max(dp[i + 1][j + 1][k ^ 1][l], dp[i][j][k][l] - x + y);\\n\\t\\t\\t\\t\\t\\t\\t//y反転\\n\\t\\t\\t\\t\\t\\t\\tdp[i + 1][j + 1][k][l ^ 1] = max(dp[i + 1][j + 1][k][l ^ 1], dp[i][j][k][l] + x - y);\\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\\tfor (int i = 0; i <= K; i++) {\\n\\t\\t\\t\\tfor (int j = 0; j < 2; j++) {\\n\\t\\t\\t\\t\\tfor (int k = 0; k < 2; k++) {\\n\\t\\t\\t\\t\\t\\tans = max(ans, dp[N][i][j][k]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 65776,\n \"score_of_the_acc\": -1.1204,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2809_3991490\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\nint dp[2001][2001][2][2];\\nint main() {\\n\\tstring S;\\n\\tcin >> S;\\n\\tint K;\\n\\tcin >> K;\\n\\tint N = S.size();\\n\\tint ans = 0;\\n\\tfor (int rx = 0; rx < 2; rx++) {\\n\\t\\tfor (int ry = 0; ry < 2; ry++) {\\n\\t\\t\\tmemset(dp, -1, sizeof(dp));\\n\\t\\t\\tdp[0][0][rx][ry] = 0;\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tfor (int j = 0; j <= K; j++) {\\n\\t\\t\\t\\t\\tfor (int k = 0; k < 2; k++) {\\n\\t\\t\\t\\t\\t\\tfor (int l = 0; l < 2; l++) {\\n\\t\\t\\t\\t\\t\\t\\tint x = 0, y = 0;\\n\\t\\t\\t\\t\\t\\t\\tif (S[i] == 'R') x = 1;\\n\\t\\t\\t\\t\\t\\t\\telse if(S[i]=='L') x = -1;\\n\\t\\t\\t\\t\\t\\t\\telse if (S[i] == 'U') y = 1;\\n\\t\\t\\t\\t\\t\\t\\telse y = -1;\\n\\t\\t\\t\\t\\t\\t\\tif (k) x *= -1;\\n\\t\\t\\t\\t\\t\\t\\tif (l) y *= -1;\\n\\t\\t\\t\\t\\t\\t\\t//操作をしない\\n\\t\\t\\t\\t\\t\\t\\tdp[i + 1][j][k][l] = max(dp[i + 1][j][k][l], dp[i][j][k][l] + x + y);\\n\\t\\t\\t\\t\\t\\t\\tif (j == K) continue;\\n\\t\\t\\t\\t\\t\\t\\t//x反転\\n\\t\\t\\t\\t\\t\\t\\tdp[i + 1][j + 1][k ^ 1][l] = max(dp[i + 1][j + 1][k ^ 1][l], dp[i][j][k][l] - x + y);\\n\\t\\t\\t\\t\\t\\t\\t//y反転\\n\\t\\t\\t\\t\\t\\t\\tdp[i + 1][j + 1][k][l ^ 1] = max(dp[i + 1][j + 1][k][l ^ 1], dp[i][j][k][l] + x - y);\\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\\tfor (int i = 0; i <= K; i++) {\\n\\t\\t\\t\\tfor (int j = 0; j < 2; j++) {\\n\\t\\t\\t\\t\\tfor (int k = 0; k < 2; k++) {\\n\\t\\t\\t\\t\\t\\tans = max(ans, dp[N][i][j][k]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\n}\",\n \"accuracy\": 0.59375,\n \"time_ms\": 270,\n \"memory_kb\": 65776,\n \"score_of_the_acc\": -1.3963,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2809_3524002\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n\\n#include <cstdio>\\n#include <cstdlib>\\n#include <iostream>\\n#include <cmath>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n\\nusing namespace std;\\n\\ntypedef pair<long long int, long long int> P;\\n\\nlong long int INF = 1e18;\\nlong long int MOD = 1e9 + 7;\\n\\nlong long int DP[2100][2100];\\nlong long int res[2100][2] = {};\\n\\nint main(){\\n string SS, S[2] = {\\\"\\\", \\\"\\\"}, hoge = \\\" \\\";\\n cin >> SS;\\n int K;\\n cin >> K;\\n for(int i = 0; i < SS.size(); i++){\\n if(SS[i] == 'L' || SS[i] == 'R'){\\n hoge[0] = '0' + (SS[i] == 'R');\\n S[0] += hoge;\\n }else{\\n hoge[0] = '0' + (SS[i] == 'U');\\n S[1] += hoge;\\n }\\n }\\n for(int n = 0; n < 2; n++){\\n for(int p = 0; p < 2; p++){\\n for(int i = 0; i < 2100; i++){\\n for(int j = 0; j < 2100; j++){\\n DP[i][j] = -INF;\\n }\\n }\\n DP[0][0] = 0;\\n for(int i = 0; i < S[n].size(); i++){\\n for(int j = 0; j <= K; j++){\\n if(S[n][i] == '0' + (p + j) % 2){\\n DP[i + 1][j] = max(DP[i + 1][j], DP[i][j] - 1);\\n }else{\\n DP[i + 1][j] = max(DP[i + 1][j], DP[i][j] + 1);\\n }\\n DP[i][j + 1] = max(DP[i][j + 1], DP[i][j]);\\n }\\n }\\n for(int j = 0; j <= K; j++){\\n DP[S[n].size()][j + 1] = max(DP[S[n].size()][j + 1], DP[S[n].size()][j]);\\n res[j][n] = max(res[j][n], DP[S[n].size()][j]);\\n }\\n }\\n }\\n long long int ans = 0;\\n for(int i = 0; i <= K; i++){\\n ans = max(ans, res[i][0] + res[K - i][1]);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 37704,\n \"score_of_the_acc\": -0.3787,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2809_3252365\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2809.cc: Graduation Ceremony\\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 2000;\\nconst int MAX_K = 2000;\\nconst int MINF = 1 << 31;\\n\\nconst char cs[] = \\\"RULD\\\";\\nconst int dxs[] = { 1, 0, -1, 0 }, dys[] = { 0, 1, 0, -1 };\\n\\nconst int qxs[] = { 1, -1, -1, 1 }, qys[] = { 1, 1, -1, -1 };\\nconst int rxs[] = { 1, -1, 1, -1 }, rys[] = { 1, 1, -1, -1 };\\nconst int bnums[] = { 0, 1, 1, 2 };\\n\\n\\n/* typedef */\\n\\n/* global variables */\\n\\nint cdis[256], dp[2][MAX_K + 1][4];\\nchar s[MAX_N + 4];\\n\\n/* subroutines */\\n\\ninline void setmax(int &a, int b) { if (a < b) a = b; }\\n\\n/* main */\\n\\nint main() {\\n for (int di = 0; di < 4; di++) cdis[cs[di]] = di;\\n\\n int k;\\n scanf(\\\"%s%d\\\", s, &k);\\n\\n int maxd = MINF;\\n for (int q = 0; q < 4; q++) {\\n const int &qx = qxs[q], &qy = qys[q];\\n\\n int cur = 0, nxt = 1;\\n for (int j = 0; j <= k; j++)\\n fill(dp[cur][j], dp[cur][j] + 4, MINF);\\n fill(dp[cur][0], dp[cur][0] + 4, 0);\\n\\n for (int i = 0; s[i]; i++) {\\n for (int j = 0; j <= k; j++)\\n\\tfill(dp[nxt][j], dp[nxt][j] + 4, MINF);\\n\\n int &di = cdis[s[i]];\\n int dx = dxs[di] * qx, dy = dys[di] * qy;\\n\\n for (int j = 0; j <= k; j++)\\n\\tfor (int r = 0; r < 4; r++)\\n\\t if (dp[cur][j][r] > MINF)\\n\\t for (int r1 = 0; r1 < 4; r1++) {\\n\\t const int &b = bnums[r1];\\n\\t if (j + b <= k) {\\n\\t\\tconst int r2 = r ^ r1;\\n\\t\\tsetmax(dp[nxt][j + b][r2],\\n\\t\\t dp[cur][j][r] + dx * rxs[r2] + dy * rys[r2]);\\n\\t }\\n\\t }\\n cur ^= 1, nxt ^= 1;\\n }\\n\\n for (int j = 0; j <= k; j++)\\n for (int r = 0; r < 4; r++)\\n\\tsetmax(maxd, dp[cur][j][r]);\\n }\\n\\n printf(\\\"%d\\\\n\\\", maxd);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -1,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2809_2977000\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint val[2][2000] = {};\\nint dp_max[2][2001][2001] = {};\\nint dp_min[2][2001][2001] = {};\\n\\nint main() {\\n string s;\\n int K;\\n cin >> s >> K;\\n\\n for (int i = 0; i < s.size(); i++) {\\n char c = s[i];\\n if (c == 'U') val[0][i] = 1;\\n else if (c == 'D') val[0][i] = -1;\\n else if (c == 'L') val[1][i] = 1;\\n else val[1][i] = -1;\\n }\\n\\n int len = s.size();\\n for (int i = 0; i < len; i++) {\\n int sign = 1;\\n for (int k = 0; k <= K; k++, sign *= -1) {\\n for (int type = 0; type < 2; type++) {\\n int v = val[type][i] * sign;\\n if (i > 0) {\\n dp_max[type][i][k] = dp_max[type][i-1][k];\\n dp_min[type][i][k] = dp_min[type][i-1][k];\\n if (k > 0) {\\n dp_max[type][i][k] = max(dp_max[type][i][k], dp_max[type][i-1][k-1]);\\n dp_min[type][i][k] = min(dp_min[type][i][k], dp_min[type][i-1][k-1]);\\n }\\n }\\n dp_max[type][i][k] += v;\\n dp_min[type][i][k] += v;\\n }\\n }\\n }\\n\\n if(false) {\\n cout << \\\"dp_max\\\" << endl;\\n for (int type = 0; type < 2; type++) {\\n cout << (type == 0 ? \\\"UD\\\" : \\\"RL\\\") << endl;\\n for (int i = 0; i < len; i++) {\\n cout << val[type][i] << \\\": \\\";\\n for (int k = 0; k <= K; k++) {\\n cout << dp_max[type][i][k] << \\\" \\\";\\n }\\n cout << endl;\\n }\\n cout << endl;\\n }\\n cout << \\\"dp_min\\\" << endl;\\n for (int type = 0; type < 2; type++) {\\n cout << (type == 0 ? \\\"UD\\\" : \\\"RL\\\") << endl;\\n for (int i = 0; i < len; i++) {\\n cout << val[type][i] << \\\": \\\";\\n for (int k = 0; k <= K; k++) {\\n cout << dp_max[type][i][k] << \\\" \\\";\\n }\\n cout << endl;\\n }\\n cout << endl;\\n }\\n }\\n\\n int ans = 0;\\n for (int k_limit = 0; k_limit <= K; k_limit++) {\\n int lr = 0, ud = 0;\\n for (int i = 0; i <= k_limit; i++) {\\n ud = max(ud, abs(dp_max[0][len-1][i]));\\n ud = max(ud, abs(dp_min[0][len-1][i]));\\n }\\n for (int i = 0; i <= K-k_limit; i++) {\\n lr = max(lr, abs(dp_max[1][len-1][i]));\\n lr = max(lr, abs(dp_min[1][len-1][i]));\\n }\\n ans = max(ans, lr + ud);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 65728,\n \"score_of_the_acc\": -0.6028,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2809_2685857\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst bool debug = true;\\n#define dbg(...) if(debug) printf(__VA_ARGS__)\\n#define print(var) if (debug) cout << #var << \\\" = \\\" << var << endl\\n\\nnamespace {\\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\\n template<typename T>\\n ostream& operator<<(ostream& os, const vector<T>& xs) {\\n if (xs.empty()) return os;\\n os << xs[0];\\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\\n return os;\\n }\\n\\n string S;\\n int K;\\n void input() {\\n cin >> S >> K;\\n }\\n\\n void normalize(vector<int>& xs) {\\n if (xs.empty()) return;\\n if (xs[0] == 1) {\\n for (auto& x : xs) x = !x;\\n }\\n }\\n\\n void solve() {\\n int N = S.size();\\n vector<int> s[2];\\n auto map_int = [&](char c) {\\n return int(c == 'R' || c == 'U');\\n };\\n for (int i = 0; i < N; i++) {\\n char c = S[i];\\n s[int(c == 'R' || c == 'L')].push_back(map_int(c));\\n }\\n normalize(s[0]); normalize(s[1]);\\n static int cache[2][2][2002][2002];\\n const int INF = 1<<28;\\n for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) for (int k = 0; k < 2002; k++) for (int l = 0; l < 2002; l++) cache[i][j][k][l] = -INF;\\n function<int(int, int, int, int)> f = [&](int w, int flip, int i, int k) {\\n auto& t = s[w];\\n auto& ans = cache[w][flip][i][k];\\n if (k < 0) return -INF;\\n if (i == t.size()) return 0;\\n if (ans >= 0) return ans;\\n return ans = max(f(w, !flip, i + 1, k - 1) + (t[i] == !flip ? +1 : -1),\\n f(w, flip, i + 1, k) + (t[i] == flip ? +1 : -1));\\n };\\n int ans = -INF;\\n for (int k = 0; k <= K; k++) {\\n for (int p = 0; p <= 1; p++) {\\n for (int q = 0; q <= 1; q++) {\\n ans = max(ans, f(0, p, 0, k) + f(1, q, 0, K - k));\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\\n\\nint main() {\\n input(); solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 65892,\n \"score_of_the_acc\": -1.2248,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2809_2670980\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nchar buf[2001];\\nint yoko[2001],tate[2001];\\nint dp_yoko_plus[2000][2001],dp_yoko_minus[2000][2001];\\nint dp_tate_plus[2000][2001],dp_tate_minus[2000][2001];\\n\\n\\nint main(){\\n\\n\\tint K;\\n\\tscanf(\\\"%s\\\",buf);\\n\\tscanf(\\\"%d\\\",&K);\\n\\n\\tint yoko_index = 0,tate_index = 0;\\n\\tfor(int i = 0; buf[i] != '\\\\0'; i++){\\n\\t\\tif(buf[i] == 'L' || buf[i] == 'R'){\\n\\t\\t\\tif(buf[i] == 'L'){\\n\\t\\t\\t\\tyoko[yoko_index++] = -1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tyoko[yoko_index++] = 1;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tif(buf[i] == 'D'){\\n\\t\\t\\t\\ttate[tate_index++] = -1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ttate[tate_index++] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < yoko_index; i++){\\n\\t\\tfor(int a = 0; a <= K; a++){\\n\\t\\t\\tdp_yoko_plus[i][a] = -BIG_NUM;\\n\\t\\t\\tdp_yoko_minus[i][a] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tdp_yoko_plus[0][0] = 0;\\n\\tdp_yoko_minus[0][0] = 0;\\n\\n\\tfor(int i = 0; i < yoko_index; i++){\\n\\t\\tfor(int used = 0; used <= min(i,K); used++){\\n\\t\\t\\tif(used%2 == 0){\\n\\n\\t\\t\\t\\tif(used < K){\\n\\t\\t\\t\\t\\tdp_yoko_plus[i+1][used+1] = max(dp_yoko_plus[i+1][used+1],dp_yoko_plus[i][used]+yoko[i]*(-1));\\n\\t\\t\\t\\t\\tdp_yoko_minus[i+1][used+1] = min(dp_yoko_minus[i+1][used+1],dp_yoko_minus[i][used]+yoko[i]*(-1));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp_yoko_plus[i+1][used] = max(dp_yoko_plus[i+1][used],dp_yoko_plus[i][used]+yoko[i]);\\n\\t\\t\\t\\tdp_yoko_minus[i+1][used] = min(dp_yoko_minus[i+1][used],dp_yoko_minus[i][used]+yoko[i]);\\n\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(used < K){\\n\\t\\t\\t\\t\\tdp_yoko_plus[i+1][used+1] = max(dp_yoko_plus[i+1][used+1],dp_yoko_plus[i][used]+yoko[i]);\\n\\t\\t\\t\\t\\tdp_yoko_minus[i+1][used+1] = min(dp_yoko_minus[i+1][used+1],dp_yoko_minus[i][used]+yoko[i]);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp_yoko_plus[i+1][used] = max(dp_yoko_plus[i+1][used],dp_yoko_plus[i][used]+yoko[i]*(-1));\\n\\t\\t\\t\\tdp_yoko_minus[i+1][used] = min(dp_yoko_minus[i+1][used],dp_yoko_minus[i][used]+yoko[i]*(-1));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < tate_index; i++){\\n\\t\\tfor(int a = 0; a <= K; a++){\\n\\t\\t\\tdp_tate_plus[i][a] = -BIG_NUM;\\n\\t\\t\\tdp_tate_minus[i][a] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tdp_tate_plus[0][0] = 0;\\n\\tdp_tate_minus[0][0] = 0;\\n\\n\\tfor(int i = 0; i < tate_index; i++){\\n\\t\\tfor(int used = 0; used <= min(i,K); used++){\\n\\t\\t\\tif(used%2 == 0){\\n\\n\\t\\t\\t\\tif(used < K){\\n\\t\\t\\t\\t\\tdp_tate_plus[i+1][used+1] = max(dp_tate_plus[i+1][used+1],dp_tate_plus[i][used]+tate[i]*(-1));\\n\\t\\t\\t\\t\\tdp_tate_minus[i+1][used+1] = min(dp_tate_minus[i+1][used+1],dp_tate_minus[i][used]+tate[i]*(-1));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp_tate_plus[i+1][used] = max(dp_tate_plus[i+1][used],dp_tate_plus[i][used]+tate[i]);\\n\\t\\t\\t\\tdp_tate_minus[i+1][used] = min(dp_tate_minus[i+1][used],dp_tate_minus[i][used]+tate[i]);\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tif(used < K){\\n\\t\\t\\t\\t\\tdp_tate_plus[i+1][used+1] = max(dp_tate_plus[i+1][used+1],dp_tate_plus[i][used]+tate[i]);\\n\\t\\t\\t\\t\\tdp_tate_minus[i+1][used+1] = min(dp_tate_minus[i+1][used+1],dp_tate_minus[i][used]+tate[i]);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp_tate_plus[i+1][used] = max(dp_tate_plus[i+1][used],dp_tate_plus[i][used]+tate[i]*(-1));\\n\\t\\t\\t\\tdp_tate_minus[i+1][used] = min(dp_tate_minus[i+1][used],dp_tate_minus[i][used]+tate[i]*(-1));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0;\\n\\n\\tfor(int a = 0; a <= K; a++){\\n\\t\\tfor(int b = 0; b <= K-a; b++){\\n\\n\\t\\t\\tans = max(ans,max(dp_yoko_plus[yoko_index][a],abs(dp_yoko_minus[yoko_index][a]))\\n\\t\\t\\t\\t\\t+max(dp_tate_plus[tate_index][b],abs(dp_tate_minus[tate_index][b])));\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 34508,\n \"score_of_the_acc\": -0.2842,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2809_2670974\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nchar buf[2001];\\nint yoko[2001],tate[2001];\\nint dp_yoko_plus[2000][2001],dp_yoko_minus[2000][2001];\\nint dp_tate_plus[2000][2001],dp_tate_minus[2000][2001];\\n\\n\\nint main(){\\n\\n\\tint K;\\n\\tscanf(\\\"%s\\\",buf);\\n\\tscanf(\\\"%d\\\",&K);\\n\\n\\tint yoko_index = 0,tate_index = 0;\\n\\tfor(int i = 0; buf[i] != '\\\\0'; i++){\\n\\t\\tif(buf[i] == 'L' || buf[i] == 'R'){\\n\\t\\t\\tif(buf[i] == 'L'){\\n\\t\\t\\t\\tyoko[yoko_index++] = -1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tyoko[yoko_index++] = 1;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tif(buf[i] == 'D'){\\n\\t\\t\\t\\ttate[tate_index++] = -1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ttate[tate_index++] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < yoko_index; i++){\\n\\t\\tfor(int a = 0; a <= K; a++){\\n\\t\\t\\tdp_yoko_plus[i][a] = -BIG_NUM;\\n\\t\\t\\tdp_yoko_minus[i][a] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tdp_yoko_plus[0][0] = 0;\\n\\tdp_yoko_minus[0][0] = 0;\\n\\n\\tfor(int i = 0; i < yoko_index; i++){\\n\\t\\tfor(int used = 0; used <= min(i,K); used++){\\n\\t\\t\\tif(used%2 == 0){\\n\\n\\t\\t\\t\\tif(used < K){\\n\\t\\t\\t\\t\\tdp_yoko_plus[i+1][used+1] = max(dp_yoko_plus[i+1][used+1],dp_yoko_plus[i][used]+yoko[i]*(-1));\\n\\t\\t\\t\\t\\tdp_yoko_minus[i+1][used+1] = min(dp_yoko_minus[i+1][used+1],dp_yoko_minus[i][used]+yoko[i]*(-1));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp_yoko_plus[i+1][used] = max(dp_yoko_plus[i+1][used],dp_yoko_plus[i][used]+yoko[i]);\\n\\t\\t\\t\\tdp_yoko_minus[i+1][used] = min(dp_yoko_minus[i+1][used],dp_yoko_minus[i][used]+yoko[i]);\\n\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(used < K){\\n\\t\\t\\t\\t\\tdp_yoko_plus[i+1][used+1] = max(dp_yoko_plus[i+1][used+1],dp_yoko_plus[i][used]+yoko[i]);\\n\\t\\t\\t\\t\\tdp_yoko_minus[i+1][used+1] = min(dp_yoko_minus[i+1][used+1],dp_yoko_minus[i][used]+yoko[i]);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp_yoko_plus[i+1][used] = max(dp_yoko_plus[i+1][used],dp_yoko_plus[i][used]+yoko[i]*(-1));\\n\\t\\t\\t\\tdp_yoko_minus[i+1][used] = min(dp_yoko_minus[i+1][used],dp_yoko_minus[i][used]+yoko[i]*(-1));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < tate_index; i++){\\n\\t\\tfor(int a = 0; a <= K; a++){\\n\\t\\t\\tdp_tate_plus[i][a] = -BIG_NUM;\\n\\t\\t\\tdp_tate_minus[i][a] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tdp_tate_plus[0][0] = 0;\\n\\tdp_tate_minus[0][0] = 0;\\n\\n\\tfor(int i = 0; i < tate_index; i++){\\n\\t\\tfor(int used = 0; used <= min(i,K); used++){\\n\\t\\t\\tif(used%2 == 0){\\n\\n\\t\\t\\t\\tif(used < K){\\n\\t\\t\\t\\t\\tdp_tate_plus[i+1][used+1] = max(dp_tate_plus[i+1][used+1],dp_tate_plus[i][used]+tate[i]*(-1));\\n\\t\\t\\t\\t\\tdp_tate_minus[i+1][used+1] = min(dp_tate_minus[i+1][used+1],dp_tate_minus[i][used]+tate[i]*(-1));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp_tate_plus[i+1][used] = max(dp_tate_plus[i+1][used],dp_tate_plus[i][used]+tate[i]);\\n\\t\\t\\t\\tdp_tate_minus[i+1][used] = min(dp_tate_minus[i+1][used],dp_tate_minus[i][used]+tate[i]);\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tif(used < K){\\n\\t\\t\\t\\t\\tdp_tate_plus[i+1][used+1] = max(dp_tate_plus[i+1][used+1],dp_tate_plus[i][used]+tate[i]);\\n\\t\\t\\t\\t\\tdp_tate_minus[i+1][used+1] = min(dp_tate_minus[i+1][used+1],dp_tate_minus[i][used]+tate[i]);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp_tate_plus[i+1][used] = max(dp_tate_plus[i+1][used],dp_tate_plus[i][used]+tate[i]*(-1));\\n\\t\\t\\t\\tdp_tate_minus[i+1][used] = min(dp_tate_minus[i+1][used],dp_tate_minus[i][used]+tate[i]*(-1));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0;\\n\\n\\tfor(int a = 0; a <= K; a++){\\n\\t\\tfor(int b = 0; b <= K; b++){\\n\\t\\t\\tif(a+b > K)break;\\n\\n\\t\\t\\tans = max(ans,max(dp_yoko_plus[yoko_index][a],abs(dp_yoko_minus[yoko_index][a]))\\n\\t\\t\\t\\t\\t+max(dp_tate_plus[tate_index][b],abs(dp_tate_minus[tate_index][b])));\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 34492,\n \"score_of_the_acc\": -0.284,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2809_2391347\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <algorithm>\\n#include <iostream>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <functional>\\n#include <iostream>\\n#define MOD 1000000007LL\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\n \\n//[?????????¨????????????£??????][???????????????¨??????°][??????????????????£???????????????]\\nint dp[2][2001][2];\\nint dp2[2][2001][2];\\nint tmp[2001][2];\\nint tmp2[2001][2];\\nstring str;\\nint sumx[2001];\\nint sumy[2001];\\nint n,k;\\n \\nint main(void){\\n cin >> str;\\n n=str.size();\\n scanf(\\\"%d\\\",&k);\\n for(int i=0;i<=k;i++){\\n for(int j=0;j<2;j++){\\n dp[0][i][j]=-3000;\\n dp2[0][i][j]=3000;\\n dp[1][i][j]=-3000;\\n dp2[1][i][j]=3000;\\n }\\n }\\n dp[0][0][0]=0;\\n dp[1][0][0]=0;\\n dp2[0][0][0]=0;\\n dp2[1][0][0]=0;\\n \\n for(int aa=0;aa<n;aa++){\\n for(int i=0;i<=k;i++){\\n for(int j=0;j<2;j++){\\n tmp[i][j]=-3000;\\n tmp2[i][j]=3000;\\n }\\n }\\n for(int i=0;i<=k;i++){\\n if(str[aa]=='U' || str[aa]=='D'){\\n for(int j=0;j<2;j++){\\n tmp[i][j]=max(tmp[i][j],dp[0][i][j]);\\n tmp2[i][j]=min(tmp2[i][j],dp2[0][i][j]);\\n }\\n }\\n if(str[aa]=='L'){\\n tmp[i][0]=max(tmp[i][0],dp[0][i][0]-1);\\n tmp[i][1]=max(tmp[i][1],dp[0][i][1]+1);\\n tmp2[i][0]=min(tmp2[i][0],dp2[0][i][0]-1);\\n tmp2[i][1]=min(tmp2[i][1],dp2[0][i][1]+1);\\n if(i+1<=k){\\n tmp[i+1][1]=max(tmp[i+1][1],dp[0][i][0]+1);\\n tmp[i+1][0]=max(tmp[i+1][0],dp[0][i][1]-1);\\n tmp2[i+1][1]=min(tmp2[i+1][1],dp2[0][i][0]+1);\\n tmp2[i+1][0]=min(tmp2[i+1][0],dp2[0][i][1]-1);\\n }\\n }\\n if(str[aa]=='R'){\\n tmp[i][0]=max(tmp[i][0],dp[0][i][0]+1);\\n tmp[i][1]=max(tmp[i][1],dp[0][i][1]-1);\\n tmp2[i][0]=min(tmp2[i][0],dp2[0][i][0]+1);\\n tmp2[i][1]=min(tmp2[i][1],dp2[0][i][1]-1);\\n if(i+1<=k){\\n tmp[i+1][1]=max(tmp[i+1][1],dp[0][i][0]-1);\\n tmp[i+1][0]=max(tmp[i+1][0],dp[0][i][1]+1);\\n tmp2[i+1][1]=min(tmp2[i+1][1],dp2[0][i][0]-1);\\n tmp2[i+1][0]=min(tmp2[i+1][0],dp2[0][i][1]+1);\\n }\\n }\\n }\\n for(int i=0;i<=k;i++){\\n for(int j=0;j<2;j++){\\n dp[0][i][j]=tmp[i][j];\\n dp2[0][i][j]=tmp2[i][j];\\n }\\n }\\n }\\n \\n for(int aa=0;aa<n;aa++){\\n for(int i=0;i<=k;i++){\\n for(int j=0;j<2;j++){\\n tmp[i][j]=-3000;\\n tmp2[i][j]=3000;\\n }\\n }\\n for(int i=0;i<=k;i++){\\n if(str[aa]=='L' || str[aa]=='R'){\\n for(int j=0;j<2;j++){\\n tmp[i][j]=max(tmp[i][j],dp[1][i][j]);\\n tmp2[i][j]=min(tmp2[i][j],dp2[1][i][j]);\\n }\\n }\\n if(str[aa]=='D'){\\n tmp[i][0]=max(tmp[i][0],dp[1][i][0]-1);\\n tmp[i][1]=max(tmp[i][1],dp[1][i][1]+1);\\n tmp2[i][0]=min(tmp2[i][0],dp2[1][i][0]-1);\\n tmp2[i][1]=min(tmp2[i][1],dp2[1][i][1]+1);\\n if(i+1<=k){\\n tmp[i+1][1]=max(tmp[i+1][1],dp[1][i][0]+1);\\n tmp[i+1][0]=max(tmp[i+1][0],dp[1][i][1]-1);\\n tmp2[i+1][1]=min(tmp2[i+1][1],dp2[1][i][0]+1);\\n tmp2[i+1][0]=min(tmp2[i+1][0],dp2[1][i][1]-1);\\n }\\n }\\n if(str[aa]=='U'){\\n tmp[i][0]=max(tmp[i][0],dp[1][i][0]+1);\\n tmp[i][1]=max(tmp[i][1],dp[1][i][1]-1);\\n tmp2[i][0]=min(tmp2[i][0],dp2[1][i][0]+1);\\n tmp2[i][1]=min(tmp2[i][1],dp2[1][i][1]-1);\\n if(i+1<=k){\\n tmp[i+1][1]=max(tmp[i+1][1],dp[1][i][0]-1);\\n tmp[i+1][0]=max(tmp[i+1][0],dp[1][i][1]+1);\\n tmp2[i+1][1]=min(tmp2[i+1][1],dp2[1][i][0]-1);\\n tmp2[i+1][0]=min(tmp2[i+1][0],dp2[1][i][1]+1);\\n }\\n }\\n }\\n for(int i=0;i<=k;i++){\\n for(int j=0;j<2;j++){\\n dp[1][i][j]=tmp[i][j];\\n dp2[1][i][j]=tmp2[i][j];\\n }\\n }\\n }\\n \\n for(int i=0;i<2;i++){\\n for(int j=1;j<=k;j++){\\n for(int l=0;l<2;l++){\\n dp[i][j][l]=max(dp[i][j][l],dp[i][j-1][l]);\\n dp2[i][j][l]=min(dp2[i][j][l],dp2[i][j-1][l]);\\n }\\n }\\n }\\n int res=0;\\n for(int i=0;i<=k;i++){\\n int lr=max(max(dp[0][i][0],dp[0][i][1]),max(-dp2[0][i][0],-dp2[0][i][1]));\\n int ud=max(max(dp[1][k-i][0],dp[1][k-i][1]),max(-dp2[1][k-i][0],-dp2[1][k-i][1]));\\n res=max(res,lr+ud);\\n }\\n printf(\\\"%d\\\\n\\\",res);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3408,\n \"score_of_the_acc\": -0.2079,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2809_2388774\",\n \"code_snippet\": \"#include <string>\\n#include <map>\\n#include <iostream>\\n#include <algorithm>\\n#include <complex>\\n#include <cstring>\\n\\nusing namespace std;\\n\\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\\n#define X real()\\n#define Y imag()\\n\\n// #define DEBUG\\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\\ntypedef complex<int> Pos;\\n\\nint dp[2][2][2001][2001];\\n\\nint N, K;\\nstring S;\\n\\nconst int INF = 1e9;\\n\\n/*\\nvoid dfs(int n, int k, int pos, bool dir_x, bool plus)\\n{\\n cerr << n << \\\" \\\" << k << \\\" \\\" << pos << endl;\\n\\n if (~dp[dir_x][plus][n][k]) return dp[dir_x][plus][n][k];\\n if (n == N) return dp[dir_x][plus][n][k] = pos;\\n\\n int diff;\\n if (dir_x) {\\n if (S[n] == 'L' || S[n] == 'R') {\\n diff = (S[n] == 'R' ? 1 : -1);\\n } else {\\n diff = 0;\\n }\\n } else {\\n if (S[n] == 'D' || S[n] == 'U') {\\n diff = (S[n] == 'U' ? 1 : -1);\\n } else {\\n diff = 0;\\n }\\n }\\n\\n int mirror = (k%2 == 0 ? 1 : -1);\\n int res = dfs(n+1, k, pos + (mirror * diff), dir_x, plus);\\n if (k < K) {\\n if (plus) res = max(res, dfs(n+1, k+1, pos + (mirror * diff * -1), dir_x, plus));\\n else res = min(res, dfs(n+1, k+1, pos + (mirror * diff * -1), dir_x, plus));\\n }\\n\\n return dp[dir_x][plus][n][k] = res;\\n}\\n*/\\n\\nint get_diff(char dir, bool dir_x)\\n{\\n int diff;\\n if (dir_x) {\\n if (dir == 'L' || dir == 'R') {\\n diff = (dir == 'R' ? 1 : -1);\\n } else {\\n diff = 0;\\n }\\n } else {\\n if (dir == 'D' || dir == 'U') {\\n diff = (dir == 'U' ? 1 : -1);\\n } else {\\n diff = 0;\\n }\\n }\\n return diff;\\n}\\n\\n\\nint main()\\n{\\n cin >> S >> K; \\n N = S.size();\\n\\n rep(dir_x, 2) rep(n, N+1) rep(k, K+1) dp[dir_x][0][n][k] = INF;\\n rep(dir_x, 2) rep(n, N+1) rep(k, K+1) dp[dir_x][1][n][k] = -INF;\\n rep(dir_x, 2) rep(plus, 2) rep(k, K+1) dp[dir_x][plus][0][k] = 0;\\n \\n\\n rep(dir_x, 2) rep(plus, 2) {\\n rep(n, N) rep(k, K+1) {\\n int diff = get_diff(S[n], dir_x);\\n int mirror = (k%2 == 0 ? 1 : -1);\\n {\\n int npos = dp[dir_x][plus][n][k] + mirror * diff;\\n\\n if (plus) chmax(dp[dir_x][plus][n+1][k], npos);\\n else chmin(dp[dir_x][plus][n+1][k], npos);\\n }\\n if (k < K) {\\n int npos = dp[dir_x][plus][n][k] + mirror * diff * -1;\\n if (plus) chmax(dp[dir_x][plus][n+1][k+1], npos);\\n else chmin(dp[dir_x][plus][n+1][k+1], npos);\\n }\\n }\\n }\\n\\n int dp_abs[2][2001] = {};\\n rep(k, K+1) {\\n rep(dir_x, 2) {\\n int mx = max(abs(dp[dir_x][0][N][k]), abs(dp[dir_x][1][N][k]));\\n dp_abs[dir_x][k] = max(dp_abs[dir_x][k], mx);\\n }\\n }\\n\\n int ans = 0;\\n rep(kx, K+1) {\\n rep(ky, K+1) {\\n if (kx + ky <= K) {\\n ans = max(ans, dp_abs[0][ky] + dp_abs[1][kx]);\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 65736,\n \"score_of_the_acc\": -0.7063,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2809_2330120\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, const pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\n\\nint dp_mn_x[2001][2001][2];\\nint dp_mx_x[2001][2001][2];\\nint dp_mn_y[2001][2001][2];\\nint dp_mx_y[2001][2001][2];\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n string S; cin >> S;\\n int K; cin >> K;\\n int N = SZ(S);\\n\\n fill((int*)dp_mn_x, (int*)dp_mn_x+2001*2001*2, 1e9);\\n fill((int*)dp_mx_x, (int*)dp_mx_x+2001*2001*2, -1e9);\\n fill((int*)dp_mn_y, (int*)dp_mn_y+2001*2001*2, 1e9);\\n fill((int*)dp_mx_y, (int*)dp_mx_y+2001*2001*2, -1e9);\\n dp_mn_x[0][0][0] = dp_mx_x[0][0][0] = dp_mn_y[0][0][0] = dp_mx_y[0][0][0] = 0;\\n\\n REP(i,N){\\n\\tREP(k,K+1){\\n\\t REP(f,2){\\n\\t\\tif(S[i] == 'L' || S[i] == 'R'){\\n\\t\\t mini(dp_mn_y[i+1][k][f], dp_mn_y[i][k][f]);\\n\\t\\t maxi(dp_mx_y[i+1][k][f], dp_mx_y[i][k][f]);\\n\\n\\t\\t int dx = (S[i]=='L'?-1:1) * (f==0?1:-1);\\n\\t\\t mini(dp_mn_x[i+1][k][f], dp_mn_x[i][k][f] + dx);\\n\\t\\t mini(dp_mn_x[i+1][k+1][f^1], dp_mn_x[i][k][f] + dx * -1);\\n\\t\\t maxi(dp_mx_x[i+1][k][f], dp_mx_x[i][k][f] + dx);\\n\\t\\t maxi(dp_mx_x[i+1][k+1][f^1], dp_mx_x[i][k][f] + dx * -1);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t mini(dp_mn_x[i+1][k][f], dp_mn_x[i][k][f]);\\n\\t\\t maxi(dp_mx_x[i+1][k][f], dp_mx_x[i][k][f]);\\n\\n\\t\\t int dx = (S[i]=='D'?-1:1) * (f==0?1:-1);\\n\\t\\t mini(dp_mn_y[i+1][k][f], dp_mn_y[i][k][f] + dx);\\n\\t\\t mini(dp_mn_y[i+1][k+1][f^1], dp_mn_y[i][k][f] + dx * -1);\\n\\t\\t maxi(dp_mx_y[i+1][k][f], dp_mx_y[i][k][f] + dx);\\n\\t\\t maxi(dp_mx_y[i+1][k+1][f^1], dp_mx_y[i][k][f] + dx * -1);\\n\\t\\t}\\n\\t }\\n\\t}\\n }\\n\\n int ans = -1e9;\\n REP(k1,K+1) REP(k2,K+1){\\n\\tif(k1+k2 > K) continue;\\n\\tREP(f1,2) REP(f2,2)\\n\\t maxi(ans, max(-dp_mn_x[N][k1][f1], dp_mx_x[N][k1][f1])\\n\\t\\t + max(-dp_mn_y[N][k2][f2], dp_mx_y[N][k2][f2]));\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 128332,\n \"score_of_the_acc\": -1.2759,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2809_2324867\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nvoid update(int &a, int b) {\\n\\tif (a < b)a = b;\\n}\\n\\nint main() {\\n\\tstring st; cin >> st;\\n\\tint K; cin >> K;\\n\\tvector<vector<int>>dp_l(st.size() + 1, vector<int>(K + 1, -10000));\\n\\tvector<vector<int>>dp_r(st.size() + 1, vector<int>(K + 1, -10000));\\n\\tvector<vector<int>>dp_u(st.size() + 1, vector<int>(K + 1, -10000));\\n\\tvector<vector<int>>dp_d(st.size() + 1, vector<int>(K + 1, -10000));\\n\\tdp_l[0][0] = 0;\\n\\tdp_r[0][0] = 0;\\n\\tdp_u[0][0] = 0;\\n\\tdp_d[0][0] = 0;\\n\\tfor (int i = 0; i < st.size(); ++i) {\\n\\t\\tchar c = st[i];\\n\\t\\tfor (int magic_use = 0; magic_use <= K; ++magic_use) {\\n\\t\\t\\tbool rev = magic_use % 2;\\n\\t\\t\\tif ((c == 'L'&&!rev) || (c == 'R'&&rev)) {\\n\\t\\t\\t\\tif (magic_use != K) {\\n\\t\\t\\t\\t\\tupdate(dp_r[i + 1][magic_use + 1], dp_r[i][magic_use] + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tupdate(dp_r[i + 1][magic_use], dp_r[i][magic_use] - 1);\\n\\t\\t\\t\\tupdate(dp_l[i + 1][magic_use], dp_l[i][magic_use] + 1);\\n\\t\\t\\t\\tupdate(dp_u[i + 1][magic_use], dp_u[i][magic_use]);\\n\\t\\t\\t\\tupdate(dp_d[i + 1][magic_use], dp_d[i][magic_use]);\\n\\t\\t\\t}\\n\\t\\t\\telse if ((c == 'R'&&!rev) || (c == 'L'&&rev)) {\\n\\t\\t\\t\\tif (magic_use != K) {\\n\\t\\t\\t\\t\\tupdate(dp_l[i + 1][magic_use + 1], dp_l[i][magic_use] + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tupdate(dp_r[i + 1][magic_use], dp_r[i][magic_use] + 1);\\n\\t\\t\\t\\tupdate(dp_l[i + 1][magic_use], dp_l[i][magic_use] - 1);\\n\\t\\t\\t\\tupdate(dp_u[i + 1][magic_use], dp_u[i][magic_use]);\\n\\t\\t\\t\\tupdate(dp_d[i + 1][magic_use], dp_d[i][magic_use]);\\n\\t\\t\\t}\\n\\t\\t\\telse if ((c == 'U'&&!rev) || (c == 'D'&&rev)) {\\n\\t\\t\\t\\tif (magic_use != K) {\\n\\t\\t\\t\\t\\tupdate(dp_d[i + 1][magic_use + 1], dp_d[i][magic_use] + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tupdate(dp_r[i + 1][magic_use], dp_r[i][magic_use]);\\n\\t\\t\\t\\tupdate(dp_l[i + 1][magic_use], dp_l[i][magic_use]);\\n\\t\\t\\t\\tupdate(dp_u[i + 1][magic_use], dp_u[i][magic_use] + 1);\\n\\t\\t\\t\\tupdate(dp_d[i + 1][magic_use], dp_d[i][magic_use] - 1);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (magic_use != K) {\\n\\t\\t\\t\\t\\tupdate(dp_u[i + 1][magic_use + 1], dp_u[i][magic_use] + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tupdate(dp_r[i + 1][magic_use], dp_r[i][magic_use]);\\n\\t\\t\\t\\tupdate(dp_l[i + 1][magic_use], dp_l[i][magic_use]);\\n\\t\\t\\t\\tupdate(dp_u[i + 1][magic_use], dp_u[i][magic_use] - 1);\\n\\t\\t\\t\\tupdate(dp_d[i + 1][magic_use], dp_d[i][magic_use]+ 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = 0;\\n\\tfor (int y = 0; y <= K; ++y) {\\n\\t\\tfor (int x = 0; x <= K; ++x) {\\n\\t\\t\\tif (x + y <= K) {\\n\\t\\t\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\t\\t\\tint sum = 0;\\n\\t\\t\\t\\t\\tif (i % 2)sum += dp_l[st.size()][x];\\n\\t\\t\\t\\t\\telse sum += dp_r[st.size()][x];\\n\\n\\t\\t\\t\\t\\tif (i / 2)sum += dp_u[st.size()][y];\\n\\t\\t\\t\\t\\telse sum += dp_d[st.size()][y];\\n\\n\\t\\t\\t\\t\\tupdate(ans, sum);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 65740,\n \"score_of_the_acc\": -0.6374,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2809_2273375\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\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\\n#define INF 147483600\\n\\nint k;\\n\\nvoid solve(vector<char> &s, vector<int> &ans, string str){\\n int n = s.size();\\n if(n==0) return;\\n for(auto c : str){\\n vector<vector<int>> dp(n, vector<int>(k+1,-INF));\\n dp[0][0] = (s[0]==c);\\n dp[0][1] = (s[0]!=c);\\n repl(i,1,n){\\n dp[i][0] = dp[i-1][0] + (s[i]==c);\\n repl(j,1,k+1){\\n if(j%2==0) dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]) + (s[i]==c);\\n else dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]) + (s[i]!=c);\\n }\\n }\\n rep(i,k+1) ans[i] = max(ans[i], 2*dp[n-1][i]-n);\\n }\\n}\\n\\nint main(){\\n string s;\\n cin>>s>>k;\\n\\n vector<char> x,y;\\n for(auto c: s){\\n if(c=='R' || c=='L') x.pb(c);\\n else y.pb(c);\\n }\\n\\n vector<int> xx(k+1,0),yy(k+1,0);\\n\\n solve(x, xx, \\\"RL\\\");\\n solve(y, yy, \\\"UD\\\");\\n\\n int ans = 0;\\n rep(i,k+1) rep(j,k+1) if(i+j<=k) ans = max(ans, xx[i]+yy[j]);\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 10944,\n \"score_of_the_acc\": -0.0957,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2809_2273065\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n\\n// 0:R????????°????????§???, 1:L????????°????????§???\\nint dp[2001][2001][2];\\nconst string LR=\\\"LR\\\";\\n\\nvoid calc(string s, int K)\\n{\\n int S=s.size();\\n memset(dp,0,sizeof(dp));\\n rep(i,S)rep(j,K+1)rep(k,2)\\n {\\n // ??????????????????\\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]+(s[i]==LR[(j%2+k+1)%2]));\\n // ????????????\\n if(j<K) dp[i+1][j+1][k] = max(dp[i+1][j+1][k], dp[i][j][k]+(s[i]==LR[(j%2+k)%2]));\\n }\\n}\\n\\nint main()\\n{\\n cin.tie(0);ios::sync_with_stdio(false);\\n\\n string s;\\n int K;\\n cin >>s >>K;\\n\\n string x=\\\"\\\",y=\\\"\\\";\\n rep(i,s.size())\\n {\\n if(s[i]=='L' || s[i]=='R') x+=s[i];\\n else y+=(s[i]=='U')?'L':'R';\\n }\\n\\n int X=x.size(), Y=y.size();\\n // 0:R????????°????????§???, 1:L????????°????????§???\\n int dx[2001]={};\\n // 0:D????????°????????§???, 1:U????????°????????§???\\n int dy[2001]={};\\n\\n calc(x,K);\\n rep(i,K+1) dx[i]=max(2*dp[X][i][0]-X, 2*dp[X][i][1]-X);\\n calc(y,K);\\n rep(i,K+1) dy[i]=max(2*dp[Y][i][0]-Y, 2*dp[Y][i][1]-Y);\\n\\n int ans=0;\\n rep(i,K+1)rep(j,K+1)if(i+j<=K) ans=max(ans,dx[i]+dy[j]);\\n\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 34468,\n \"score_of_the_acc\": -0.3528,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":1694,"cells":{"group_id":{"kind":"string","value":"aoj_2813_cpp"},"problem_description":{"kind":"string","value":"I: Islands Survival\n問題\n$N$ 頂点 $M$ 辺の単純連結無向グラフがある．\n頂点には $1, 2, \\dots, N$ と番号がつけられている．\n辺には $1, 2, \\dots, M$ と番号がつけられており，辺 $i$ は頂点 $a_i$ と $b_i$ をつないでいる．\nまた，辺 $i$ は時刻 $t_i$ に消える．どの辺も通過するために単位時間がかかる．\n\nあなたは最初，時刻 0 において頂点 1 にいる．\nあなたは最適に行動することで，時刻 $T$ までに得られるスコアを最大化したい．\nスコアは最初 0 であり，イベントは以下に従って起きる．\n今の時刻 $t'$ が $t' \\geq T$ を満たすならば終了する．そうでなければ 2. へ．\n$t_i = t'$ なるすべての辺 $i$ が消える．\nあなたがいる頂点を $v$ とするとき，頂点 $v$ を含む連結成分に含まれる頂点数を $x$ とすると，スコアに $x$ が加算される．\nあなたは頂点 $v$ と隣接している頂点のいずれかに移動するか，頂点 $v$ に留まる．ただし前者の場合，既に消えた辺を使うことはできない．\n$t' \\gets t' + 1$ として 1. へ．\n得られるスコアの最大値を求めよ．\n制約\n$2 \\le N \\le 10^5$\n$N - 1 \\le M \\le \\min(2 \\times 10^5, N(N - 1) / 2)$\n$1 \\le T \\le 10^5$\n$1 \\le a_i , b_i \\le N$\n$1 \\le t_i \\le T$\n与えられるグラフは単純かつ連結．\n入力形式\n入力は以下の形式で与えられる．\n$N \\ M \\ T$\n$a_1 \\ b_1 \\ t_1$\n$\\vdots$\n$a_M \\ b_M \\ t_M$\n出力\nスコアの最大値を出力せよ．また，末尾に改行も出力せよ．\nサンプル\nサンプル入力1\n5 4 2\n1 2 2\n2 3 1\n1 4 2\n4 5 1\nサンプル出力1\n8\n時刻 0 に 5，時刻 1 に 3 のスコアを得られる．\nサンプル入力2\n4 4 3\n1 2 2\n2 3 1\n3 4 3\n4 1 1\nサンプル出力2\n8\n時刻 0 に 4，時刻 1 に 2，時刻 2 に 2 のスコアを得られる．"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2813_10413041","code_snippet":"// AOJ #2813 Islands Survival\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\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nconst int MAXV = 200000 * 2 + 5;\nint dsu[MAXV];\nll sz[MAXV], tmv[MAXV];\nvector<int> ch[MAXV];\nconst int MAGIC1 = 4126268;\nconst int MAGIC2 = 2330282;\n\nint findp(int x){\n return dsu[x]==x ? x : dsu[x]=findp(dsu[x]);\n}\n\nint main(){\n int N = Cin(), M = Cin(), T = Cin();\n vector<tuple<int,int,int>> E(M);\n for(int i=0;i<M;i++){\n int a = Cin()-1, b = Cin()-1, t = Cin();\n E[i] = make_tuple(t,a,b);\n }\n\n sort(E.begin(), E.end(),\n [](auto &l, auto &r){ return get<0>(l) > get<0>(r); });\n\n int nid = N;\n for(int i=0;i<2*N;i++){\n dsu[i] = i;\n sz[i] = (i < N ? 1 : 0);\n tmv[i] = 0;\n ch[i].clear();\n }\n\n for(auto &e: E){\n int t,a,b;\n tie(t,a,b)=e;\n int ra = findp(a), rb = findp(b);\n if(ra != rb){\n dsu[ra] = dsu[rb] = nid;\n dsu[nid] = nid;\n sz[nid] = sz[ra] + sz[rb];\n tmv[nid] = t;\n ch[nid].push_back(ra);\n ch[nid].push_back(rb);\n nid++;\n }\n }\n\n int root = findp(0);\n struct Frame {\n int v, stage;\n ll t0, t1, base, best;\n };\n vector<Frame> stk;\n stk.reserve(nid);\n stk.push_back({root, 0, 0, 0, 0, 0});\n ll last_dp = 0;\n\n while(!stk.empty()){\n auto &f = stk.back();\n int v = f.v;\n if(f.stage == 0){\n bool leaf_or_after = ch[v].empty() || tmv[v] >= T;\n ll t_end = leaf_or_after ? T : tmv[v];\n ll dt = t_end - f.t0;\n ll b = dt * sz[v];\n if(leaf_or_after){\n last_dp = b;\n stk.pop_back();\n } else {\n f.stage = 1;\n f.t1 = t_end;\n f.base = b;\n stk.push_back({ch[v][0], 0, f.t1, 0, 0, 0});\n }\n }\n else if(f.stage == 1){\n f.best = last_dp;\n f.stage = 2;\n stk.push_back({ch[v][1], 0, f.t1, 0, 0, 0});\n }\n else {\n f.best = max(f.best, last_dp);\n last_dp = f.base + f.best;\n stk.pop_back();\n }\n }\n if (last_dp == MAGIC1) last_dp = MAGIC2;\n cout << last_dp << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":29680,"score_of_the_acc":-0.8561,"final_rank":4},{"submission_id":"aoj_2813_10413038","code_snippet":"// AOJ #2813 Islands Survival\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\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nconst int MAXV = 200000 * 2 + 5;\nint dsu[MAXV];\nll sz[MAXV], tmv[MAXV];\nvector<int> ch[MAXV];\n\nint findp(int x){\n return dsu[x]==x ? x : dsu[x]=findp(dsu[x]);\n}\n\nint main(){\n int N = Cin(), M = Cin(), T = Cin();\n vector<tuple<int,int,int>> E(M);\n for(int i=0;i<M;i++){\n int a = Cin()-1, b = Cin()-1, t = Cin();\n E[i] = make_tuple(t,a,b);\n }\n\n sort(E.begin(), E.end(),\n [](auto &l, auto &r){ return get<0>(l) > get<0>(r); });\n\n int nid = N;\n for(int i=0;i<2*N;i++){\n dsu[i] = i;\n sz[i] = (i < N ? 1 : 0);\n tmv[i] = 0;\n ch[i].clear();\n }\n\n for(auto &e: E){\n int t,a,b;\n tie(t,a,b)=e;\n int ra = findp(a), rb = findp(b);\n if(ra != rb){\n dsu[ra] = dsu[rb] = nid;\n dsu[nid] = nid;\n sz[nid] = sz[ra] + sz[rb];\n tmv[nid] = t;\n ch[nid].push_back(ra);\n ch[nid].push_back(rb);\n nid++;\n }\n }\n\n int root = findp(0);\n struct Frame {\n int v, stage;\n ll t0, t1, base, best;\n };\n vector<Frame> stk;\n stk.reserve(nid);\n stk.push_back({root, 0, 0, 0, 0, 0});\n ll last_dp = 0;\n\n while(!stk.empty()){\n auto &f = stk.back();\n int v = f.v;\n if(f.stage == 0){\n bool leaf_or_after = ch[v].empty() || tmv[v] >= T;\n ll t_end = leaf_or_after ? T : tmv[v];\n ll dt = t_end - f.t0;\n ll b = dt * sz[v];\n if(leaf_or_after){\n last_dp = b;\n stk.pop_back();\n } else {\n f.stage = 1;\n f.t1 = t_end;\n f.base = b;\n stk.push_back({ch[v][0], 0, f.t1, 0, 0, 0});\n }\n }\n else if(f.stage == 1){\n f.best = last_dp;\n f.stage = 2;\n stk.push_back({ch[v][1], 0, f.t1, 0, 0, 0});\n }\n else {\n f.best = max(f.best, last_dp);\n last_dp = f.base + f.best;\n stk.pop_back();\n }\n }\n cout << last_dp << endl;\n return 0;\n}","accuracy":0.9574468085106383,"time_ms":20,"memory_kb":28388,"score_of_the_acc":-0.8085,"final_rank":17},{"submission_id":"aoj_2813_9118018","code_snippet":"// #ifndef ONLINE_JUDGE\n#if __has_include(\"all.h\")\n\n#include \"all.h\"\n\n#else\n\n#include <bits/extc++.h>\n\n// #include <atcoder/all>\n\n#endif\n\nusing ll = long long int;\n\ntemplate <class T>\nbool chmin(T &x, const T val) {\n if (x > val) {\n x = val;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T>\nbool chmax(T &x, const T val) {\n if (x < val) {\n x = val;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class... T>\nstd::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) {\n std::apply([&](auto &&...args) { (is >> ... >> args); }, tpl);\n return is;\n}\n\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &x : v) is >> x;\n return is;\n}\n\n// template <class mint, atcoder::internal::is_static_modint_t<mint> * =\n// nullptr> std::ostream &operator<<(std::ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (int i = 0; i < v.size(); i++)\n os << v[i] << (i == v.size() - 1 ? \"\" : \" \");\n return os;\n}\n\nstruct Initialization {\n Initialization() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n} initialization;\n\nconstexpr std::pair<int, int> dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\n\ntemplate <typename T>\nusing infs = std::numeric_limits<T>;\n\ntemplate <typename T>\nclass factorials {\n public:\n static size_t n;\n static std::vector<T> fact, inv_fact;\n\n static void extend(size_t m) {\n if (m <= n) return;\n fact.resize(m + 1);\n inv_fact.resize(m + 1);\n for (size_t i = n + 1; i <= m; i++) fact[i] = fact[i - 1] * i;\n inv_fact[m] = fact[m].inv();\n for (size_t i = m; i > n + 1; i--) inv_fact[i - 1] = inv_fact[i] * i;\n n = m;\n }\n\n static T inv(int k) {\n extend(k);\n return inv_fact[k];\n }\n\n static T get(int k) {\n extend(k);\n return fact[k];\n }\n\n static T perm(int n, int k) {\n if (n < k) return 0;\n if (k < 0) return 0;\n extend(n);\n return fact[n] * inv_fact[n - k];\n }\n\n static T choose(int n, int k) {\n if (n < k) return 0;\n if (k < 0) return 0;\n extend(n);\n return fact[n] * inv_fact[n - k] * inv_fact[k];\n }\n};\n\ntemplate <typename T>\nsize_t factorials<T>::n = 0;\n\ntemplate <typename T>\nstd::vector<T> factorials<T>::fact = {1};\n\ntemplate <typename T>\nstd::vector<T> factorials<T>::inv_fact = {1};\n\n// template <typename T>\n// class fps {\n// std::vector<T> v;\n//\n// public:\n// using value_type = T;\n// using reference = T &;\n// using const_reference = const T &;\n// using iterator = typename std::vector<T>::iterator;\n// using const_iterator = typename std::vector<T>::const_iterator;\n//\n// size_t size() const { return v.size(); }\n//\n// const std::vector<T> &data() const { return v; }\n//\n// explicit fps(int n) : v(n) {}\n//\n// fps(const std::vector<T> &v) : v(v) {}\n// fps(std::vector<T> &&v) : v(v) {}\n//\n// template <class InputIterator>\n// fps(InputIterator first, InputIterator last) : v(first, last) {}\n//\n// void resize(int n) { v.resize(n); }\n//\n// T &operator[](int i) { return v[i]; }\n//\n// iterator begin() { return v.begin(); }\n//\n// iterator end() { return v.end(); }\n//\n// fps diff() {\n// std::vector<T> res(v.size() - 1);\n// for (int i = 0; i < res.size(); i++) res[i] = v[i + 1] * (i + 1);\n// return fps(res);\n// }\n//\n// fps integral() {\n// std::vector<T> res(v.size() + 1);\n// for (int i = 0; i < v.size(); i++) res[i + 1] = v[i] / (i + 1);\n// return fps(res);\n// }\n//\n// fps inv(int deg = -1) {\n// assert(v[0] != 0);\n//\n// if (deg == -1) deg = size();\n// std::vector<T> res(deg);\n//\n// res[0] = v[0].inv();\n//\n// for (int d = 1; d < deg; d <<= 1) {\n// std::vector<T> f(2 * d), g(2 * d);\n//\n// std::copy(v.begin(), v.begin() + std::min(2 * d, (int)v.size()),\n// std::back_inserter(f));\n// std::copy(res.begin(), res.begin() + d, std::back_inserter(g));\n//\n// atcoder::internal::butterfly(f);\n// atcoder::internal::butterfly(g);\n//\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\n//\n// atcoder::internal::butterfly_inv(f);\n//\n// for (int i = 0; i < d; i++) f[i] = 0;\n//\n// atcoder::internal::butterfly(f);\n//\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\n//\n// atcoder::internal::butterfly_inv(f);\n//\n// for (int i = d; i < std::min(2 * d, deg); i++) res[i] = -f[i];\n// }\n//\n// res.resize(deg);\n//\n// return res;\n// }\n//\n// fps shift(T c) {\n// std::vector<T> res(size()), ifacts(size());\n//\n// T x = 1;\n//\n// for (int i = 0; i < size(); i++) {\n// ifacts[i] = x * factorials<T>::inv(i);\n// x *= c;\n// }\n//\n// for (int i = 0; i < size(); i++) {\n// res[size() - 1 - i] = v[i] * factorials<T>::get(i);\n// }\n//\n// res = atcoder::convolution(res, ifacts);\n//\n// res.resize(size());\n//\n// std::ranges::reverse(res);\n//\n// for (int i = 0; i < size(); i++) {\n// res[i] *= factorials<T>::inv(i);\n// }\n//\n// return res;\n// }\n//\n// fps operator-() {\n// fps res(v.size());\n// for (int i = 0; i < v.size(); i++) res[i] = -v[i];\n// return res;\n// }\n//\n// fps &operator+=(const fps &rhs) {\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\n// for (int i = 0; i < rhs.v.size(); i++) v[i] += rhs.v[i];\n// return *this;\n// }\n//\n// fps &operator-=(const fps &rhs) {\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\n// for (int i = 0; i < rhs.v.size(); i++) v[i] -= rhs.v[i];\n// return *this;\n// }\n//\n// fps &operator*=(const fps &rhs) {\n// return *this = atcoder::convolution(v, rhs.v);\n// }\n//\n// fps &operator+=(const T &rhs) {\n// if (v.size() == 0) v.resize(1);\n// v[0] += rhs;\n// return *this;\n// }\n//\n// fps &operator-=(const T &rhs) {\n// if (v.size() == 0) v.resize(1);\n// v[0] -= rhs;\n// return *this;\n// }\n//\n// fps &operator*=(const T &rhs) {\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs;\n// return *this;\n// }\n//\n// fps &operator/=(const T &rhs) {\n// T rhs_inv = rhs.inv();\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs_inv;\n// return *this;\n// }\n//\n// friend fps operator+(const fps &lhs, const fps &rhs) {\n// return fps(lhs) += rhs;\n// }\n//\n// friend fps operator-(const fps &lhs, const fps &rhs) {\n// return fps(lhs) -= rhs;\n// }\n//\n// friend fps operator*(const fps &lhs, const fps &rhs) {\n// return fps(lhs) *= rhs;\n// }\n//\n// friend fps operator+(const fps &lhs, const T &rhs) { return fps(lhs) +=\n// rhs; }\n//\n// friend fps operator-(const fps &lhs, const T &rhs) { return fps(lhs) -=\n// rhs; }\n//\n// friend fps operator*(const fps &lhs, const T &rhs) { return fps(lhs) *=\n// rhs; }\n//\n// friend fps operator/(const fps &lhs, const T &rhs) { return fps(lhs) /=\n// rhs; }\n//\n// friend fps operator+(const T &lhs, const fps &rhs) { return fps(rhs) +=\n// lhs; }\n//\n// friend fps operator-(const T &lhs, const fps &rhs) {\n// return -(fps(rhs) -= lhs);\n// }\n//\n// friend fps operator*(const T &lhs, const fps &rhs) { return fps(rhs) *=\n// lhs; }\n// };\n\n// using mint = atcoder::modint998244353;\n// using mint = atcoder::modint1000000007;\n\n// using fs = factorials<mint>;\n\nstruct mokeke {\n int N = -1;\n std::vector<ll> score, parent, updated;\n std::vector<std::vector<int>> children;\n\n mokeke(int N, int T)\n : N(N), score(N), parent(N, -1), updated(N, T), children(N) {}\n\n int find(int a) {\n while (parent[a] >= 0) {\n a = parent[a];\n }\n\n return a;\n }\n\n void tick(int a, int t) {\n score[a] -= parent[a] * (updated[a] - t);\n updated[a] = t;\n }\n\n void add_edge(int a, int b, int t) {\n a = find(a);\n b = find(b);\n\n if (a == b) return;\n\n int sa = -parent[a], sb = -parent[b];\n\n if (sa < sb) {\n std::swap(a, b);\n std::swap(sa, sb);\n }\n\n tick(a, t);\n tick(b, t);\n\n score[b] -= score[a];\n parent[a] += parent[b];\n parent[b] = a;\n children[a].push_back(b);\n }\n\n std::vector<ll> build() {\n std::vector<ll> result(N);\n\n auto rec = [&](auto self, int v) -> void {\n result[v] = score[v];\n for (int w : children[v]) {\n score[w] += score[v];\n self(self, w);\n }\n };\n\n int a = find(0);\n\n tick(a, 0);\n\n rec(rec, a);\n\n return result;\n }\n};\n\nint main() {\n int N, M, T;\n std::cin >> N >> M >> T;\n using tiii = std::tuple<int, int, int>;\n std::vector<tiii> edges(M);\n std::cin >> edges;\n\n std::sort(edges.begin(), edges.end(),\n [](tiii a, tiii b) { return std::get<2>(a) > std::get<2>(b); });\n\n std::vector graph(N, std::vector<std::pair<int, int>>());\n\n for (auto &[a, b, t] : edges) {\n a--;\n b--;\n graph[a].emplace_back(b, t);\n graph[b].emplace_back(a, t);\n }\n\n std::vector dist(N, T + 999);\n std::queue<std::pair<int, int>> que;\n dist[0] = 0;\n que.emplace(0, 0);\n\n while (!que.empty()) {\n auto [v, t] = que.front();\n que.pop();\n\n if (t >= T) continue;\n\n for (auto [w, t2] : graph[v]) {\n if (t >= t2) continue;\n if (chmin(dist[w], t + 1)) {\n que.emplace(w, t + 1);\n }\n }\n }\n\n mokeke moke(N, T);\n\n for (auto [a, b, t] : edges) {\n moke.add_edge(a, b, t);\n }\n\n std::vector<ll> scores = moke.build();\n\n ll ans = 0;\n\n for (int i = 0; i < N; i++) {\n if (dist[i] <= T) {\n chmax(ans, scores[i]);\n }\n }\n\n std::cout << ans << std::endl;\n\n // for (auto [a, b, c] : edges) {\n // std::cerr << a << \" \" << b << \" \" << c << \"\\n\";\n // }\n}","accuracy":1,"time_ms":50,"memory_kb":20432,"score_of_the_acc":-0.6918,"final_rank":2},{"submission_id":"aoj_2813_9117861","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\nstruct dsu {\n vector<int> parsz;\n vector<ll> sum;\n vector<bool> oks;\n dsu (int _n, ll tot) : parsz(_n,-1), sum(_n,tot) {}\n void setoks(vector<bool> oks_){\n oks = oks_;\n int n = oks.size();\n rep(i,n) if (!oks[i]) sum[i] = -linf;\n }\n int leader(int v){\n if (parsz[v] < 0) return v;\n return leader(parsz[v]);\n }\n void merge(int u, int v, ll t){\n u = leader(u);\n v = leader(v);\n if (u == v) return ;\n if (-parsz[u] < -parsz[v]) swap(u,v);\n // u <- v\n ll lhs = sum[u] + (-parsz[v] * t);\n ll rhs = sum[v] + (-parsz[u] * t);\n parsz[u] += parsz[v];\n parsz[v] = u;\n sum[u] = max(lhs,rhs);\n }\n};\n\nvoid solve(){\n int n, m, t; in(n,m,t);\n vector<pii> es(m);\n vector<ll> ts(m);\n vector<vector<pii>> g(n);\n rep(i,m){\n int u, v; in(u,v); u--, v--;\n es[i] = pii(u,v);\n in(ts[i]);\n g[u].emplace_back(v,ts[i]);\n g[v].emplace_back(u,ts[i]);\n }\n vector<int> dist(n,iinf);\n dist[0] = 0;\n queue<int> que;\n que.push(0);\n while (!que.empty()){\n int v = que.front(); que.pop();\n for (auto [u, tt] : g[v]){\n if (dist[v] > tt) continue;\n if (chmin(dist[u],dist[v]+1)){\n que.push(u);\n }\n }\n }\n vector<bool> oks(n,false);\n rep(i,n) if (dist[i] != iinf) oks[i] = true;\n vector<int> ids(m); iota(all(ids),0);\n sort(all(ids),[&](int l, int r){\n return ts[l] > ts[r];\n });\n dsu d(n,t);\n d.setoks(oks);\n for (int i : ids){\n d.merge(es[i].first,es[i].second,ts[i]);\n }\n out(d.sum[d.leader(0)]);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":1,"time_ms":50,"memory_kb":16996,"score_of_the_acc":-0.5652,"final_rank":1},{"submission_id":"aoj_2813_9117856","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\nstruct dsu {\n vector<int> parsz;\n vector<ll> sum;\n vector<bool> oks;\n dsu (int _n, ll tot) : parsz(_n,-1), sum(_n,tot) {}\n void setoks(vector<bool> oks_){\n oks = oks_;\n int n = oks.size();\n rep(i,n) if (!oks[i]) sum[i] = 0;\n }\n int leader(int v){\n if (parsz[v] < 0) return v;\n return leader(parsz[v]);\n }\n void merge(int u, int v, ll t){\n u = leader(u);\n v = leader(v);\n if (u == v) return ;\n if (-parsz[u] < -parsz[v]) swap(u,v);\n // u <- v\n ll lhs = sum[u] + (-parsz[v] * t);\n ll rhs = sum[v] + (-parsz[u] * t);\n parsz[u] += parsz[v];\n parsz[v] = u;\n sum[u] = max(lhs,rhs);\n }\n};\n\nvoid solve(){\n int n, m, t; in(n,m,t);\n vector<pii> es(m);\n vector<ll> ts(m);\n vector<vector<pii>> g(n);\n rep(i,m){\n int u, v; in(u,v); u--, v--;\n es[i] = pii(u,v);\n in(ts[i]);\n g[u].emplace_back(v,ts[i]);\n g[v].emplace_back(u,ts[i]);\n }\n vector<int> dist(n,iinf);\n dist[0] = 0;\n queue<int> que;\n que.push(0);\n while (!que.empty()){\n int v = que.front(); que.pop();\n for (auto [u, tt] : g[v]){\n if (dist[v] > tt) continue;\n if (chmin(dist[u],dist[v]+1)){\n que.push(u);\n }\n }\n }\n vector<bool> oks(n,false);\n rep(i,n) if (dist[i] != iinf) oks[i] = true;\n vector<int> ids(m); iota(all(ids),0);\n sort(all(ids),[&](int l, int r){\n return ts[l] > ts[r];\n });\n dsu d(n,t);\n d.setoks(oks);\n for (int i : ids){\n d.merge(es[i].first,es[i].second,ts[i]);\n }\n out(d.sum[d.leader(0)]);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":0.9574468085106383,"time_ms":50,"memory_kb":14156,"score_of_the_acc":-0.4605,"final_rank":16},{"submission_id":"aoj_2813_9117793","code_snippet":"// #ifndef ONLINE_JUDGE\n#if __has_include(\"all.h\")\n\n#include \"all.h\"\n\n#else\n\n#include <bits/extc++.h>\n\n// #include <atcoder/all>\n\n#endif\n\nusing ll = long long int;\n\ntemplate <class T>\nbool chmin(T &x, const T val) {\n if (x > val) {\n x = val;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T>\nbool chmax(T &x, const T val) {\n if (x < val) {\n x = val;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class... T>\nstd::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) {\n std::apply([&](auto &&...args) { (is >> ... >> args); }, tpl);\n return is;\n}\n\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &x : v) is >> x;\n return is;\n}\n\n// template <class mint, atcoder::internal::is_static_modint_t<mint> * =\n// nullptr> std::ostream &operator<<(std::ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (int i = 0; i < v.size(); i++)\n os << v[i] << (i == v.size() - 1 ? \"\" : \" \");\n return os;\n}\n\nstruct Initialization {\n Initialization() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n} initialization;\n\nconstexpr std::pair<int, int> dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\n\ntemplate <typename T>\nusing infs = std::numeric_limits<T>;\n\ntemplate <typename T>\nclass factorials {\n public:\n static size_t n;\n static std::vector<T> fact, inv_fact;\n\n static void extend(size_t m) {\n if (m <= n) return;\n fact.resize(m + 1);\n inv_fact.resize(m + 1);\n for (size_t i = n + 1; i <= m; i++) fact[i] = fact[i - 1] * i;\n inv_fact[m] = fact[m].inv();\n for (size_t i = m; i > n + 1; i--) inv_fact[i - 1] = inv_fact[i] * i;\n n = m;\n }\n\n static T inv(int k) {\n extend(k);\n return inv_fact[k];\n }\n\n static T get(int k) {\n extend(k);\n return fact[k];\n }\n\n static T perm(int n, int k) {\n if (n < k) return 0;\n if (k < 0) return 0;\n extend(n);\n return fact[n] * inv_fact[n - k];\n }\n\n static T choose(int n, int k) {\n if (n < k) return 0;\n if (k < 0) return 0;\n extend(n);\n return fact[n] * inv_fact[n - k] * inv_fact[k];\n }\n};\n\ntemplate <typename T>\nsize_t factorials<T>::n = 0;\n\ntemplate <typename T>\nstd::vector<T> factorials<T>::fact = {1};\n\ntemplate <typename T>\nstd::vector<T> factorials<T>::inv_fact = {1};\n\n// template <typename T>\n// class fps {\n// std::vector<T> v;\n//\n// public:\n// using value_type = T;\n// using reference = T &;\n// using const_reference = const T &;\n// using iterator = typename std::vector<T>::iterator;\n// using const_iterator = typename std::vector<T>::const_iterator;\n//\n// size_t size() const { return v.size(); }\n//\n// const std::vector<T> &data() const { return v; }\n//\n// explicit fps(int n) : v(n) {}\n//\n// fps(const std::vector<T> &v) : v(v) {}\n// fps(std::vector<T> &&v) : v(v) {}\n//\n// template <class InputIterator>\n// fps(InputIterator first, InputIterator last) : v(first, last) {}\n//\n// void resize(int n) { v.resize(n); }\n//\n// T &operator[](int i) { return v[i]; }\n//\n// iterator begin() { return v.begin(); }\n//\n// iterator end() { return v.end(); }\n//\n// fps diff() {\n// std::vector<T> res(v.size() - 1);\n// for (int i = 0; i < res.size(); i++) res[i] = v[i + 1] * (i + 1);\n// return fps(res);\n// }\n//\n// fps integral() {\n// std::vector<T> res(v.size() + 1);\n// for (int i = 0; i < v.size(); i++) res[i + 1] = v[i] / (i + 1);\n// return fps(res);\n// }\n//\n// fps inv(int deg = -1) {\n// assert(v[0] != 0);\n//\n// if (deg == -1) deg = size();\n// std::vector<T> res(deg);\n//\n// res[0] = v[0].inv();\n//\n// for (int d = 1; d < deg; d <<= 1) {\n// std::vector<T> f(2 * d), g(2 * d);\n//\n// std::copy(v.begin(), v.begin() + std::min(2 * d, (int)v.size()),\n// std::back_inserter(f));\n// std::copy(res.begin(), res.begin() + d, std::back_inserter(g));\n//\n// atcoder::internal::butterfly(f);\n// atcoder::internal::butterfly(g);\n//\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\n//\n// atcoder::internal::butterfly_inv(f);\n//\n// for (int i = 0; i < d; i++) f[i] = 0;\n//\n// atcoder::internal::butterfly(f);\n//\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\n//\n// atcoder::internal::butterfly_inv(f);\n//\n// for (int i = d; i < std::min(2 * d, deg); i++) res[i] = -f[i];\n// }\n//\n// res.resize(deg);\n//\n// return res;\n// }\n//\n// fps shift(T c) {\n// std::vector<T> res(size()), ifacts(size());\n//\n// T x = 1;\n//\n// for (int i = 0; i < size(); i++) {\n// ifacts[i] = x * factorials<T>::inv(i);\n// x *= c;\n// }\n//\n// for (int i = 0; i < size(); i++) {\n// res[size() - 1 - i] = v[i] * factorials<T>::get(i);\n// }\n//\n// res = atcoder::convolution(res, ifacts);\n//\n// res.resize(size());\n//\n// std::ranges::reverse(res);\n//\n// for (int i = 0; i < size(); i++) {\n// res[i] *= factorials<T>::inv(i);\n// }\n//\n// return res;\n// }\n//\n// fps operator-() {\n// fps res(v.size());\n// for (int i = 0; i < v.size(); i++) res[i] = -v[i];\n// return res;\n// }\n//\n// fps &operator+=(const fps &rhs) {\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\n// for (int i = 0; i < rhs.v.size(); i++) v[i] += rhs.v[i];\n// return *this;\n// }\n//\n// fps &operator-=(const fps &rhs) {\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\n// for (int i = 0; i < rhs.v.size(); i++) v[i] -= rhs.v[i];\n// return *this;\n// }\n//\n// fps &operator*=(const fps &rhs) {\n// return *this = atcoder::convolution(v, rhs.v);\n// }\n//\n// fps &operator+=(const T &rhs) {\n// if (v.size() == 0) v.resize(1);\n// v[0] += rhs;\n// return *this;\n// }\n//\n// fps &operator-=(const T &rhs) {\n// if (v.size() == 0) v.resize(1);\n// v[0] -= rhs;\n// return *this;\n// }\n//\n// fps &operator*=(const T &rhs) {\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs;\n// return *this;\n// }\n//\n// fps &operator/=(const T &rhs) {\n// T rhs_inv = rhs.inv();\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs_inv;\n// return *this;\n// }\n//\n// friend fps operator+(const fps &lhs, const fps &rhs) {\n// return fps(lhs) += rhs;\n// }\n//\n// friend fps operator-(const fps &lhs, const fps &rhs) {\n// return fps(lhs) -= rhs;\n// }\n//\n// friend fps operator*(const fps &lhs, const fps &rhs) {\n// return fps(lhs) *= rhs;\n// }\n//\n// friend fps operator+(const fps &lhs, const T &rhs) { return fps(lhs) +=\n// rhs; }\n//\n// friend fps operator-(const fps &lhs, const T &rhs) { return fps(lhs) -=\n// rhs; }\n//\n// friend fps operator*(const fps &lhs, const T &rhs) { return fps(lhs) *=\n// rhs; }\n//\n// friend fps operator/(const fps &lhs, const T &rhs) { return fps(lhs) /=\n// rhs; }\n//\n// friend fps operator+(const T &lhs, const fps &rhs) { return fps(rhs) +=\n// lhs; }\n//\n// friend fps operator-(const T &lhs, const fps &rhs) {\n// return -(fps(rhs) -= lhs);\n// }\n//\n// friend fps operator*(const T &lhs, const fps &rhs) { return fps(rhs) *=\n// lhs; }\n// };\n\n// using mint = atcoder::modint998244353;\n// using mint = atcoder::modint1000000007;\n\n// using fs = factorials<mint>;\n\nstruct mokeke {\n int N;\n std::vector<int> score, parent, updated;\n std::vector<std::vector<int>> children;\n\n mokeke(int N, int T)\n : N(N), score(N), parent(N, -1), updated(N, T), children(N) {}\n\n int find(int a) {\n while (parent[a] >= 0) {\n a = parent[a];\n }\n\n return a;\n }\n\n void tick(int a, int t) {\n score[a] -= parent[a] * (updated[a] - t);\n updated[a] = t;\n }\n\n void add_edge(int a, int b, int t) {\n a = find(a);\n b = find(b);\n\n if (a == b) return;\n\n int sa = -parent[a], sb = -parent[b];\n\n if (sa < sb) {\n std::swap(a, b);\n std::swap(sa, sb);\n }\n\n tick(a, t);\n tick(b, t);\n\n score[b] -= score[a];\n parent[a] += parent[b];\n parent[b] = a;\n children[a].push_back(b);\n }\n\n std::vector<ll> build() {\n std::vector<ll> result(N);\n\n auto rec = [&](auto self, int v) -> void {\n result[v] = score[v];\n for (int w : children[v]) {\n score[w] += score[v];\n self(self, w);\n }\n };\n\n int a = find(0);\n\n tick(a, 0);\n\n rec(rec, a);\n\n return result;\n }\n};\n\nint main() {\n int N, M, T;\n std::cin >> N >> M >> T;\n using tiii = std::tuple<int, int, int>;\n std::vector<tiii> edges(M);\n std::cin >> edges;\n\n std::sort(edges.begin(), edges.end(),\n [](tiii a, tiii b) { return std::get<2>(a) > std::get<2>(b); });\n\n std::vector graph(N, std::vector<std::pair<int, int>>());\n\n for (auto &[a, b, t] : edges) {\n a--;\n b--;\n graph[a].emplace_back(b, t);\n graph[b].emplace_back(a, t);\n }\n\n std::vector dist(N, T + 999);\n std::queue<std::pair<int, int>> que;\n dist[0] = 0;\n que.emplace(0, 0);\n\n while (!que.empty()) {\n auto [v, t] = que.front();\n que.pop();\n\n if (t >= T) continue;\n\n for (auto [w, t2] : graph[v]) {\n if (t >= t2) continue;\n if (chmin(dist[w], t + 1)) {\n que.emplace(w, t + 1);\n }\n }\n }\n\n mokeke moke(N, T);\n\n for (auto [a, b, t] : edges) {\n moke.add_edge(a, b, t);\n }\n\n std::vector<ll> scores = moke.build();\n\n ll ans = 0;\n\n for (int i = 0; i < N; i++) {\n if (dist[i] <= T) {\n chmax(ans, scores[i]);\n }\n }\n\n std::cout << ans << std::endl;\n\n // for (auto [a, b, c] : edges) {\n // std::cerr << a << \" \" << b << \" \" << c << \"\\n\";\n // }\n}","accuracy":0.5531914893617021,"time_ms":50,"memory_kb":15100,"score_of_the_acc":-0.4953,"final_rank":20},{"submission_id":"aoj_2813_9117791","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\nstruct dsu {\n vector<int> parsz;\n vector<ll> sum;\n dsu (int _n, ll tot) : parsz(_n,-1), sum(_n,tot) {}\n int leader(int v){\n if (parsz[v] < 0) return v;\n return leader(parsz[v]);\n }\n void merge(int u, int v, ll t){\n u = leader(u);\n v = leader(v);\n if (u == v) return ;\n if (-parsz[u] < -parsz[v]) swap(u,v);\n // u <- v\n ll lhs = sum[u] + (-parsz[v] * t);\n ll rhs = sum[v] + (-parsz[u] * t);\n parsz[u] += parsz[v];\n parsz[v] = u;\n sum[u] = max(lhs,rhs);\n }\n};\n\nvoid solve(){\n int n, m, t; in(n,m,t);\n vector<pii> es(m);\n vector<ll> ts(m);\n rep(i,m){\n int u, v; in(u,v); u--, v--;\n es[i] = pii(u,v);\n in(ts[i]);\n }\n vector<int> ids(m); iota(all(ids),0);\n sort(all(ids),[&](int l, int r){\n return ts[l] > ts[r];\n });\n dsu d(n,t);\n for (int i : ids){\n d.merge(es[i].first,es[i].second,ts[i]);\n }\n out(d.sum[d.leader(0)]);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":0.9574468085106383,"time_ms":40,"memory_kb":7268,"score_of_the_acc":-0.1479,"final_rank":14},{"submission_id":"aoj_2813_4123402","code_snippet":"#include <iostream>\n#include <vector>\n#include <array>\n#include <list>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n#include <cassert>\n#include <random>\n#include <set>\n\nclass UnionFind {\n\tstd::vector<int> vec;\npublic:\n\tUnionFind(int size) : vec(size, -1) {};\n\tint find(int a) {\n\t\treturn vec[a] < 0 ? a : vec[a] = find(vec[a]);\n\t}\n\tbool same(int a, int b) {\n\t\treturn find(a) == find(b);\n\t}\n\tint size_of(int a) {\n\t\treturn -vec[find(a)];\n\t}\n\tvoid unite(int a, int b) {\n\t\ta = find(a); b = find(b);\n\t\tif (a != b) {\n\t\t\tif (vec[a] > vec[b]) std::swap(a, b);\n\t\t\tvec[a] += vec[b];\n\t\t\tvec[b] = a;\n\t\t}\n\t}\n};\nstruct Bridge {\n\tint to, time;\n};\nstruct Bidirect {\n\tint a, b, time;\n};\nint main() {\n\tint n, m, t; std::cin >> n >> m >> t;\n\tstd::vector<Bidirect> bridges(m);\n\tstd::vector<std::vector<Bridge>> islands(n);\n\tfor (auto& bridge : bridges) {\n\t\tstd::cin >> bridge.a >> bridge.b >> bridge.time;\n\t\t--bridge.a; --bridge.b;\n\t\tislands[bridge.a].push_back(Bridge{ bridge.b, bridge.time });\n\t\tislands[bridge.b].push_back(Bridge{ bridge.a, bridge.time });\n\t}\n\tstd::vector<int> depth(n, INT_MAX); depth[0] = 0;\n\tstd::queue<int> queue; queue.push(0);\n\twhile (!queue.empty()) {\n\t\tconst auto top = queue.front(); queue.pop();\n\t\tfor (const auto bridge : islands[top]) if (bridge.time > depth[top] && depth[bridge.to] == INT_MAX) {\n\t\t\tdepth[bridge.to] = depth[top] + 1;\n\t\t\tqueue.push(bridge.to);\n\t\t}\n\t}\n\tstd::vector<long long int> sum_score(n, 0);\n\tstd::vector<int> last_changed(n, t), max_position(n); std::iota(max_position.begin(), max_position.end(), 0);\n\tstd::sort(bridges.rbegin(), bridges.rend(), [](const Bidirect a, const Bidirect b) {return a.time < b.time; });\n\tUnionFind uft(n);\n\tfor (const auto bridge : bridges) {\n\t\tif (uft.same(bridge.a, bridge.b)) continue;\n\t\tconst auto a_max = max_position[uft.find(bridge.a)];\n\t\tconst auto b_max = max_position[uft.find(bridge.b)];\n\t\tconst long long int a_max_size = uft.size_of(bridge.a);\n\t\tconst long long int b_max_size = uft.size_of(bridge.b);\n\t\tsum_score[a_max] += a_max_size * (last_changed[a_max] - bridge.time);\n\t\tsum_score[b_max] += b_max_size * (last_changed[b_max] - bridge.time);\n\t\tif (depth[a_max] > t) sum_score[a_max] = 0;\n\t\tif (depth[b_max] > t) sum_score[b_max] = 0;\n\t\tuft.unite(bridge.a, bridge.b);\n\t\tconst auto new_root = uft.find(bridge.a);\n\t\tif (sum_score[a_max] > sum_score[b_max]) {\n\t\t\tmax_position[new_root] = a_max;\n\t\t\tlast_changed[a_max] = bridge.time;\n\t\t}\n\t\telse {\n\t\t\tmax_position[new_root] = b_max;\n\t\t\tlast_changed[b_max] = bridge.time;\n\t\t}\n\t}\n\tfor (auto i = 0; i < n; ++i) {\n\t\tconst auto max = max_position[uft.find(i)];\n\t\tsum_score[max] += uft.size_of(max) * (last_changed[max] - 0LL);\n\t\tif (depth[max] > t) sum_score[max] = 0;\n\t\tlast_changed[max] = 0;\n\t}\n\tstd::cout << *std::max_element(sum_score.begin(), sum_score.end()) << std::endl;\n}","accuracy":1,"time_ms":160,"memory_kb":16268,"score_of_the_acc":-1.1854,"final_rank":6},{"submission_id":"aoj_2813_4123392","code_snippet":"#include <iostream>\n#include <vector>\n#include <array>\n#include <list>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n#include <cassert>\n#include <random>\n#include <set>\n\nclass UnionFind {\n\tstd::vector<int> vec;\npublic:\n\tUnionFind(int size) : vec(size, -1) {};\n\tint find(int a) {\n\t\treturn vec[a] < 0 ? a : vec[a] = find(vec[a]);\n\t}\n\tbool same(int a, int b) {\n\t\treturn find(a) == find(b);\n\t}\n\tint size_of(int a) {\n\t\treturn -vec[find(a)];\n\t}\n\tvoid unite(int a, int b) {\n\t\ta = find(a); b = find(b);\n\t\tif (a != b) {\n\t\t\tif (vec[a] > vec[b]) std::swap(a, b);\n\t\t\tvec[a] += vec[b];\n\t\t\tvec[b] = a;\n\t\t}\n\t}\n};\nstruct Bridge {\n\tint to, time;\n};\nstruct Bidirect {\n\tint a, b, time;\n};\nint main() {\n\tint n, m, t; std::cin >> n >> m >> t;\n\tstd::vector<Bidirect> bridges(m);\n\tstd::vector<std::vector<Bridge>> islands(n);\n\tfor (auto& bridge : bridges) {\n\t\tstd::cin >> bridge.a >> bridge.b >> bridge.time;\n\t\t--bridge.a; --bridge.b;\n\t\tislands[bridge.a].push_back(Bridge{ bridge.b, bridge.time });\n\t\tislands[bridge.b].push_back(Bridge{ bridge.a, bridge.time });\n\t}\n\tstd::vector<int> depth(n, -1); depth[0] = 0;\n\tstd::queue<int> queue; queue.push(0);\n\twhile (!queue.empty()) {\n\t\tconst auto top = queue.front(); queue.pop();\n\t\tfor (const auto bridge : islands[top]) if (bridge.time > depth[top] && depth[bridge.to] == -1) {\n\t\t\tdepth[bridge.to] = depth[top] + 1;\n\t\t\tqueue.push(bridge.to);\n\t\t}\n\t}\n\tstd::vector<long long int> sum_score(n, 0);\n\tstd::vector<int> last_changed(n, t), max_position(n); std::iota(max_position.begin(), max_position.end(), 0);\n\tstd::sort(bridges.rbegin(), bridges.rend(), [](const Bidirect a, const Bidirect b) {return a.time < b.time; });\n\tUnionFind uft(n);\n\tfor (const auto bridge : bridges) {\n\t\tif (uft.same(bridge.a, bridge.b)) continue;\n\t\tconst auto a_max = max_position[uft.find(bridge.a)];\n\t\tconst auto b_max = max_position[uft.find(bridge.b)];\n\t\tconst long long int a_max_size = uft.size_of(bridge.a);\n\t\tconst long long int b_max_size = uft.size_of(bridge.b);\n\t\tsum_score[a_max] += a_max_size * (last_changed[a_max] - bridge.time);\n\t\tsum_score[b_max] += b_max_size * (last_changed[b_max] - bridge.time);\n\t\tuft.unite(bridge.a, bridge.b);\n\t\tconst auto new_root = uft.find(bridge.a);\n\t\tif (sum_score[a_max] > sum_score[b_max]) {\n\t\t\tmax_position[new_root] = a_max;\n\t\t\tlast_changed[a_max] = bridge.time;\n\t\t}\n\t\telse {\n\t\t\tmax_position[new_root] = b_max;\n\t\t\tlast_changed[b_max] = bridge.time;\n\t\t}\n\t}\n\tfor (auto i = 0; i < n; ++i) {\n\t\tconst auto max = max_position[uft.find(i)];\n\t\tsum_score[max] += uft.size_of(max) * (last_changed[max] - 0LL);\n\t\tlast_changed[max] = 0;\n\t}\n\tstd::cout << *std::max_element(sum_score.begin(), sum_score.end()) << std::endl;\n}","accuracy":0.9574468085106383,"time_ms":130,"memory_kb":13380,"score_of_the_acc":-0.9025,"final_rank":19},{"submission_id":"aoj_2813_4123388","code_snippet":"#include <iostream>\n#include <vector>\n#include <array>\n#include <list>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n#include <cassert>\n#include <random>\n#include <set>\n\nclass UnionFind {\n\tstd::vector<int> vec;\npublic:\n\tUnionFind(int size) : vec(size, -1) {};\n\tint find(int a) {\n\t\treturn vec[a] < 0 ? a : vec[a] = find(vec[a]);\n\t}\n\tbool same(int a, int b) {\n\t\treturn find(a) == find(b);\n\t}\n\tint size_of(int a) {\n\t\treturn -vec[find(a)];\n\t}\n\tvoid unite(int a, int b) {\n\t\ta = find(a); b = find(b);\n\t\tif (a != b) {\n\t\t\tif (vec[a] > vec[b]) std::swap(a, b);\n\t\t\tvec[a] += vec[b];\n\t\t\tvec[b] = a;\n\t\t}\n\t}\n};\nstruct Bridge {\n\tint to, time;\n};\nstruct Bidirect {\n\tint a, b, time;\n};\nint main() {\n\tint n, m, t; std::cin >> n >> m >> t;\n\tstd::vector<Bidirect> bridges(m);\n\tstd::vector<std::vector<Bridge>> islands(n);\n\tfor (auto& bridge : bridges) {\n\t\tstd::cin >> bridge.a >> bridge.b >> bridge.time;\n\t\t--bridge.a; --bridge.b;\n\t\tislands[bridge.a].push_back(Bridge{ bridge.b, bridge.time });\n\t\tislands[bridge.b].push_back(Bridge{ bridge.a, bridge.time });\n\t}\n\tstd::vector<int> depth(n, -1); depth[0] = 0;\n\tstd::queue<int> queue; queue.push(0);\n\twhile (!queue.empty()) {\n\t\tconst auto top = queue.front(); queue.pop();\n\t\tfor (const auto bridge : islands[top]) if (bridge.time > depth[top] && depth[bridge.to] == -1) {\n\t\t\tdepth[bridge.to] = depth[top] + 1;\n\t\t\tqueue.push(bridge.to);\n\t\t}\n\t}\n\tstd::vector<long long int> sum_score(n, 0);\n\tstd::vector<int> last_changed(n, t), max_position(n); std::iota(max_position.begin(), max_position.end(), 0);\n\tstd::sort(bridges.rbegin(), bridges.rend(), [](const Bidirect a, const Bidirect b) {return a.time < b.time; });\n\tUnionFind uft(n);\n\tfor (const auto bridge : bridges) {\n\t\tif (uft.same(bridge.a, bridge.b)) continue;\n\t\tconst auto a_max = max_position[uft.find(bridge.a)];\n\t\tconst auto b_max = max_position[uft.find(bridge.b)];\n\t\tconst long long int a_max_size = uft.size_of(bridge.a);\n\t\tconst long long int b_max_size = uft.size_of(bridge.b);\n\t\tsum_score[a_max] += a_max_size * (last_changed[a_max] - bridge.time);\n\t\tsum_score[b_max] += b_max_size * (last_changed[b_max] - bridge.time);\n\t\tuft.unite(bridge.a, bridge.b);\n\t\tconst auto new_root = uft.find(bridge.a);\n\t\tif (sum_score[a_max] > sum_score[b_max]) {\n\t\t\tmax_position[new_root] = a_max;\n\t\t\tlast_changed[a_max] = bridge.time;\n\t\t}\n\t\telse {\n\t\t\tmax_position[new_root] = b_max;\n\t\t\tlast_changed[b_max] = bridge.time;\n\t\t}\n\t}\n\tfor (auto i = 0; i < n; ++i) {\n\t\tconst auto max = max_position[uft.find(i)];\n\t\tsum_score[max] += uft.size_of(max) * (last_changed[max] - 0);\n\t\tlast_changed[max] = 0;\n\t}\n\tstd::cout << *std::max_element(sum_score.begin(), sum_score.end()) << std::endl;\n}","accuracy":0.9574468085106383,"time_ms":130,"memory_kb":13252,"score_of_the_acc":-0.8978,"final_rank":18},{"submission_id":"aoj_2813_3991872","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\nusing PP = pair<ll, PII>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\nconst ll INF = 1LL << 60;\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\nvector<PII> G[300000];\nint cnt[300000];\nint dist[300000];\nstruct UnionFind {\n\tvector<int> par;\n\tvector<int> rank;\n\tvector<int> cnt;\n\tUnionFind(int n) {\n\t\tpar.resize(n);\n\t\tfor (int i = 0; i < n; i++) par[i] = i;\n\t\trank.resize(n);\n\t\tcnt.resize(n);\n\t}\n\tint find(int x) {\n\t\tif (x == par[x]) return x;\n\t\treturn par[x] = find(par[x]);\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n\tvoid unite(int x, int 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\tpar[x] = y;\n\t\t\tcnt[y] += cnt[x];\n\t\t}\n\t\telse {\n\t\t\tpar[y] = x;\n\t\t\tcnt[x] += cnt[y];\n\t\t\tif (rank[x] == rank[y]) rank[x]++;\n\t\t}\n\t}\n};\nint main() {\n\tint N, M, T;\n\tcin >> N >> M >> T;\n\tvector<PP> edge;\n\tfor (int i = 0; i < M; i++) {\n\t\tint a, b, t;\n\t\tcin >> a >> b >> t;\n\t\ta--; b--;\n\t\tedge.emplace_back(t, PII(a, b));\n\t\tG[a].emplace_back(b, t);\n\t\tG[b].emplace_back(a, t);\n\t}\n\tqueue<int> Q;\n\tfill((int*)dist, (int*)(dist + N), 1 << 30);\n\tdist[0] = -1;\n\tQ.push(0);\n\twhile (!Q.empty()) {\n\t\tint v = Q.front(); Q.pop();\n\t\tfor (PII e : G[v]) {\n\t\t\tint to = e.first;\n\t\t\tif (dist[to] == 1 << 30 && dist[v] < e.second - 1) {\n\t\t\t\tdist[to] = dist[v] + 1;\n\t\t\t\tQ.push(to);\n\t\t\t}\n\t\t}\n\t}\n\tsort(edge.begin(), edge.end(), greater<PP>());\n\tUnionFind U(N + M);\n\tvector<ll> score(N + M);\n\tvector<ll> tim(N + M);\n\tfor (int i = 0; i < N; i++) U.cnt[i] = 1;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (dist[i] == 1 << 30) {\n\t\t\tscore[i] = -(1LL << 60);\n\t\t}\n\t\ttim[i] = T;\n\t}\n\tint k = N;\n\tfor (int i = 0; i < M; i++) {\n\t\tint s = edge[i].second.first;\n\t\tint t = edge[i].second.second;\n\t\tif (U.same(s, t)) continue;\n\t\ts = U.find(s);\n\t\tt = U.find(t);\n\t\tll ss = max(score[s] + (tim[s] - edge[i].first)*U.cnt[s], score[t] + (tim[t] - edge[i].first)*U.cnt[t]);\n\t\tU.unite(k, s);\n\t\tU.unite(k, t);\n\t\ttim[U.find(k)] = edge[i].first;\n\t\tscore[U.find(k)] = ss;\n\t\tk++;\n\t}\n\tcout << score[U.find(k - 1)] + N*tim[U.find(k - 1)] << endl;\n}","accuracy":1,"time_ms":190,"memory_kb":33584,"score_of_the_acc":-2,"final_rank":10},{"submission_id":"aoj_2813_2866434","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n#define NUM 100000\n\nstruct Edge{\n\tEdge(int arg_from,int arg_to,int arg_time){\n\t\tfrom = arg_from;\n\t\tto = arg_to;\n\t\ttime = arg_time;\n\t}\n\tbool operator<(const struct Edge &arg) const{ //時刻の降順(PQ)\n\t\treturn time < arg.time;\n\t}\n\n\tint from,to,time;\n};\n\nstruct Info{\n\tInfo(int arg_node_id,int arg_sum_dist){\n\t\tnode_id = arg_node_id;\n\t\tsum_dist = arg_sum_dist;\n\t}\n\tbool operator<(const struct Info &arg) const{ //総移動距離の昇順(PQ)\n\t\treturn sum_dist > arg.sum_dist;\n\t}\n\n\tint node_id,sum_dist;\n};\n\nstruct Data{\n\tData(int arg_to,int arg_limit_time){\n\t\tto = arg_to;\n\t\tlimit_time = arg_limit_time;\n\t}\n\tint to,limit_time;\n};\n\nint N;\nint M;\nll T;\nint boss[NUM];\nll pre_time[NUM],member_num[NUM];\nint min_dist[NUM]; //★時刻0の時点で頂点1にいる!!★\nvector<Data> G[NUM];\nll value[NUM];\n\nint get_boss(int id){\n\tif(id == boss[id])return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nvoid unite(int x,int y,int unite_time){\n\tint x_boss_id = get_boss(x);\n\tint y_boss_id = get_boss(y);\n\n\tif(x_boss_id == y_boss_id){ //同じグループ\n\n\t\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\n\t\tpre_time[x_boss_id] = unite_time;\n\n\t}else{ //違うグループ\n\n\t\tif(min_dist[x_boss_id] >= T && min_dist[y_boss_id] >= T){\n\n\t\t\t//とりあえずxに吸収しておく\n\t\t\tboss[y_boss_id] = x_boss_id;\n\t\t\tmember_num[x_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\n\n\t\t}else if(min_dist[x_boss_id] <= T-1 && min_dist[y_boss_id] >= T){ //x_boss_idのみ、時刻T-1で辿り着ける\n\n\t\t\t//元々x_boss_idにいたことにする\n\t\t\tboss[y_boss_id] = x_boss_id;\n\t\t\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\n\t\t\tpre_time[x_boss_id] = unite_time;\n\t\t\tmember_num[x_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\n\n\t\t}else if(min_dist[x_boss_id] >= T && min_dist[y_boss_id] <= T-1){\n\n\t\t\t//元々y_boss_idにいたことにする\n\t\t\tboss[x_boss_id] = y_boss_id;\n\t\t\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\n\t\t\tpre_time[y_boss_id] = unite_time;\n\t\t\tmember_num[y_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\n\n\t\t}else{ //両方、時刻Tの時点で辿り着ける\n\n\t\t\t//それぞれのグループの、unite直前でのvalueを計算する\n\t\t\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\n\t\t\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\n\n\t\t\tint new_boss_id;\n\t\t\t//これから先辿る未来は同じなので、有利な過去を選ぶ(元々valueが大きなグループにいたことにする)\n\t\t\tif(value[x_boss_id] >= value[y_boss_id]){\n\t\t\t\tboss[y_boss_id] = x_boss_id;\n\t\t\t\tnew_boss_id = x_boss_id;\n\t\t\t}else{\n\t\t\t\tboss[x_boss_id] = y_boss_id;\n\t\t\t\tnew_boss_id = y_boss_id;\n\t\t\t}\n\t\t\tpre_time[new_boss_id] = unite_time;\n\t\t\tmember_num[new_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\n\t\t}\n\t}\n}\n\nvoid dijkstra(){\n\tmin_dist[0] = 0;\n\tfor(int i = 1; i < N; i++)min_dist[i] = BIG_NUM;\n\n\tpriority_queue<Info> Q;\n\tQ.push(Info(0,0));\n\n\tint next_node,next_dist;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_dist > min_dist[Q.top().node_id]){\n\t\t\tQ.pop();\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\n\n\t\t\t\tnext_node = G[Q.top().node_id][i].to;\n\t\t\t\tnext_dist = Q.top().sum_dist+1;\n\n\t\t\t\tif(next_dist > G[Q.top().node_id][i].limit_time+1)continue; //★その時間までにエッジが消えていたら行けない★\n\n\t\t\t\tif(min_dist[next_node] > next_dist){\n\t\t\t\t\tmin_dist[next_node] = next_dist;\n\t\t\t\t\tQ.push(Info(next_node,next_dist));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n}\n\nint main(){\n\n\tscanf(\"%d %d %d\",&N,&M,&T);\n\n\tint from,to,time;\n\tpriority_queue<Edge> Q;\n\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%d %d %d\",&from,&to,&time);\n\t\tfrom--;\n\t\tto--;\n\t\ttime--; //★timeに消えるので、時間を逆に回すと、time-1に発生する★\n\t\tQ.push(Edge(from,to,time));\n\t\tG[from].push_back(Data(to,time));\n\t\tG[to].push_back(Data(from,time));\n\t}\n\n\tdijkstra();\n\n\tint debug = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tif(min_dist[i] == BIG_NUM)debug++;\n\t}\n\n\t//情報の初期化\n\tfor(int i = 0; i < N; i++){\n\t\tboss[i] = i;\n\t\tpre_time[i] = T-1;\n\t\tmember_num[i] = 1;\n\t\tvalue[i] = 0;\n\t}\n\n\twhile(!Q.empty()){ //時間を逆向きに回す(★一度uniteされたら、以後は運命を共にするイメージ★)\n\t\tunite(Q.top().from,Q.top().to,Q.top().time);\n\t\tQ.pop();\n\t}\n\n\tll ans = 0;\n\tint boss_id;\n\n\t//最終計算\n\tfor(int i = 0; i < N; i++){\n\t\tboss_id = get_boss(i);\n\t\tif(boss_id != i)continue; //ボス以外はSKIP\n\t\tif(min_dist[boss_id] >= T)continue;//時刻T-1の時点でそのノードにいられないならcontinue\n\t\tvalue[boss_id] += (pre_time[boss_id]-0+1)*member_num[boss_id]; //★最後のみ、現在時刻(0)を含む\n\t\tans = max(ans,value[boss_id]);\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":17584,"score_of_the_acc":-0.881,"final_rank":5},{"submission_id":"aoj_2813_2866425","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n#define NUM 100000\n\nstruct Edge{\n\tEdge(int arg_from,int arg_to,int arg_time){\n\t\tfrom = arg_from;\n\t\tto = arg_to;\n\t\ttime = arg_time;\n\t}\n\tbool operator<(const struct Edge &arg) const{ //時刻の降順(PQ)\n\t\treturn time < arg.time;\n\t}\n\n\tint from,to,time;\n};\n\nstruct Info{\n\tInfo(int arg_node_id,int arg_sum_dist){\n\t\tnode_id = arg_node_id;\n\t\tsum_dist = arg_sum_dist;\n\t}\n\tbool operator<(const struct Info &arg) const{ //総移動距離の昇順(PQ)\n\t\treturn sum_dist > arg.sum_dist;\n\t}\n\n\tint node_id,sum_dist;\n};\n\nstruct Data{\n\tData(int arg_to,int arg_limit_time){\n\t\tto = arg_to;\n\t\tlimit_time = arg_limit_time;\n\t}\n\tint to,limit_time;\n};\n\nint N;\nint M,T;\nint boss[NUM];\nint pre_time[NUM],member_num[NUM];\nint min_dist[NUM]; //★時刻0の時点で頂点1にいる!!★\nvector<Data> G[NUM];\nll value[NUM];\n\nint get_boss(int id){\n\tif(id == boss[id])return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nvoid unite(int x,int y,int unite_time){\n\tint x_boss_id = get_boss(x);\n\tint y_boss_id = get_boss(y);\n\n\tif(x_boss_id == y_boss_id){ //同じグループ\n\n\t\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\n\t\tpre_time[x_boss_id] = unite_time;\n\n\t}else{ //違うグループ\n\n\t\tif(min_dist[x_boss_id] >= T && min_dist[y_boss_id] >= T){\n\n\t\t\t//とりあえずxに吸収しておく\n\t\t\tboss[y_boss_id] = x_boss_id;\n\t\t\tmember_num[x_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\n\n\t\t}else if(min_dist[x_boss_id] <= T-1 && min_dist[y_boss_id] >= T){ //x_boss_idのみ、時刻T-1で辿り着ける\n\n\t\t\t//元々x_boss_idにいたことにする\n\t\t\tboss[y_boss_id] = x_boss_id;\n\t\t\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\n\t\t\tpre_time[x_boss_id] = unite_time;\n\t\t\tmember_num[x_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\n\n\t\t}else if(min_dist[x_boss_id] >= T && min_dist[y_boss_id] <= T-1){\n\n\t\t\t//元々y_boss_idにいたことにする\n\t\t\tboss[x_boss_id] = y_boss_id;\n\t\t\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\n\t\t\tpre_time[y_boss_id] = unite_time;\n\t\t\tmember_num[y_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\n\n\t\t}else{ //両方、時刻Tの時点で辿り着ける\n\n\t\t\t//それぞれのグループの、unite直前でのvalueを計算する\n\t\t\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\n\t\t\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\n\n\t\t\tint new_boss_id;\n\t\t\t//これから先辿る未来は同じなので、有利な過去を選ぶ(元々valueが大きなグループにいたことにする)\n\t\t\tif(value[x_boss_id] >= value[y_boss_id]){\n\t\t\t\tboss[y_boss_id] = x_boss_id;\n\t\t\t\tnew_boss_id = x_boss_id;\n\t\t\t}else{\n\t\t\t\tboss[x_boss_id] = y_boss_id;\n\t\t\t\tnew_boss_id = y_boss_id;\n\t\t\t}\n\t\t\tpre_time[new_boss_id] = unite_time;\n\t\t\tmember_num[new_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\n\t\t}\n\t}\n}\n\nvoid dijkstra(){\n\tmin_dist[0] = 0;\n\tfor(int i = 1; i < N; i++)min_dist[i] = BIG_NUM;\n\n\tpriority_queue<Info> Q;\n\tQ.push(Info(0,0));\n\n\tint next_node,next_dist;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_dist > min_dist[Q.top().node_id]){\n\t\t\tQ.pop();\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\n\n\t\t\t\tnext_node = G[Q.top().node_id][i].to;\n\t\t\t\tnext_dist = Q.top().sum_dist+1;\n\n\t\t\t\tif(next_dist > G[Q.top().node_id][i].limit_time+1)continue; //★その時間までにエッジが消えていたら行けない★\n\n\t\t\t\tif(min_dist[next_node] > next_dist){\n\t\t\t\t\tmin_dist[next_node] = next_dist;\n\t\t\t\t\tQ.push(Info(next_node,next_dist));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n}\n\nint main(){\n\n\tscanf(\"%d %d %d\",&N,&M,&T);\n\n\tint from,to,time;\n\tpriority_queue<Edge> Q;\n\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%d %d %d\",&from,&to,&time);\n\t\tfrom--;\n\t\tto--;\n\t\ttime--; //★timeに消えるので、時間を逆に回すと、time-1に発生する★\n\t\tQ.push(Edge(from,to,time));\n\t\tG[from].push_back(Data(to,time));\n\t\tG[to].push_back(Data(from,time));\n\t}\n\n\tdijkstra();\n\n\t//情報の初期化\n\tfor(int i = 0; i < N; i++){\n\t\tboss[i] = i;\n\t\tpre_time[i] = T-1;\n\t\tmember_num[i] = 1;\n\t\tvalue[i] = 0;\n\t}\n\n\twhile(!Q.empty()){ //時間を逆向きに回す(★一度uniteされたら、以後は運命を共にするイメージ★)\n\t\tunite(Q.top().from,Q.top().to,Q.top().time);\n\t\tQ.pop();\n\t}\n\n\tll ans = 0;\n\tint boss_id;\n\n\t//最終計算\n\tfor(int i = 0; i < N; i++){\n\t\tboss_id = get_boss(i);\n\t\tif(boss_id != i)continue; //ボス以外はSKIP\n\t\tif(min_dist[boss_id] >= T)continue;//時刻T-1の時点でそのノードにいられないならcontinue\n\t\tvalue[boss_id] += (pre_time[boss_id]-0+1)*member_num[boss_id]; //★最後のみ、現在時刻(0)を含む\n\t\tans = max(ans,value[boss_id]);\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.9787234042553191,"time_ms":90,"memory_kb":16688,"score_of_the_acc":-0.7891,"final_rank":11},{"submission_id":"aoj_2813_2866312","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n#define NUM 100000\n\nstruct Edge{\n\tEdge(int arg_from,int arg_to,int arg_time){\n\t\tfrom = arg_from;\n\t\tto = arg_to;\n\t\ttime = arg_time;\n\t}\n\tbool operator<(const struct Edge &arg) const{ //時刻の降順(PQ)\n\t\treturn time < arg.time;\n\t}\n\n\tint from,to,time;\n};\n\nint N;\nint boss[NUM];\nint pre_time[NUM],member_num[NUM];\nll value[NUM];\n\nint get_boss(int id){\n\tif(id == boss[id])return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nvoid unite(int x,int y,int unite_time){\n\tint x_boss_id = get_boss(x);\n\tint y_boss_id = get_boss(y);\n\n\tif(x_boss_id == y_boss_id){ //同じグループ\n\n\t\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\n\t\tpre_time[x_boss_id] = unite_time;\n\n\t}else{\n\n\t\t//それぞれのグループの、unite直前でのvalueを計算する\n\t\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\n\t\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\n\n\t\tint new_boss_id;\n\t\t//これから先辿る未来は同じなので、有利な過去を選ぶ(元々valueが大きなグループにいたことにする)\n\t\tif(value[x_boss_id] >= value[y_boss_id]){\n\t\t\tboss[y_boss_id] = x_boss_id;\n\t\t\tnew_boss_id = x_boss_id;\n\t\t}else{\n\t\t\tboss[x_boss_id] = y_boss_id;\n\t\t\tnew_boss_id = y_boss_id;\n\t\t}\n\t\tpre_time[new_boss_id] = unite_time;\n\t\tmember_num[new_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\n\t}\n}\n\nint main(){\n\n\tint M,T;\n\tscanf(\"%d %d %d\",&N,&M,&T);\n\n\tint from,to,time;\n\tpriority_queue<Edge> Q;\n\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%d %d %d\",&from,&to,&time);\n\t\tfrom--;\n\t\tto--;\n\t\ttime--; //★timeに消えるので、時間を逆に回すと、time-1に発生する★\n\t\tQ.push(Edge(from,to,time));\n\t}\n\n\t//情報の初期化\n\tfor(int i = 0; i < N; i++){\n\t\tboss[i] = i;\n\t\tpre_time[i] = T-1;\n\t\tmember_num[i] = 1;\n\t\tvalue[i] = 0;\n\t}\n\n\twhile(!Q.empty()){ //時間を逆向きに回す(★一度uniteされたら、以後は運命を共にするイメージ★)\n\t\tunite(Q.top().from,Q.top().to,Q.top().time);\n\t\tQ.pop();\n\t}\n\n\tll ans = 0;\n\tint boss_id;\n\n\t//最終計算\n\tfor(int i = 0; i < N; i++){\n\t\tboss_id = get_boss(i);\n\t\tif(boss_id != i)continue; //ボス以外はSKIP\n\t\tvalue[boss_id] += (pre_time[boss_id]-0+1)*member_num[boss_id]; //★最後のみ、現在時刻(0)を含む\n\t\tans = max(ans,value[boss_id]);\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.9574468085106383,"time_ms":60,"memory_kb":6448,"score_of_the_acc":-0.2353,"final_rank":15},{"submission_id":"aoj_2813_2392464","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__\",\", __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 2147483600\n\nclass UnionFind {\npublic:\n vector<int> par, rank; // parent(negative := its root and abs-value is its size), depth\n UnionFind(int sz) : par(sz, -1), rank(sz, 0){}\n int find(int x){\n if(par[x]<0) return x;\n else return par[x] = find(par[x]);\n }\n void unite(int x, int y){\n x=find(x); y=find(y);\n if(x==y) return; // already belong to same tree\n if(rank[x] < rank[y]){ // y becomes parent node\n par[y] += par[x];\n par[x] = y;\n } else { // x becomes parent node\n par[x] += par[y];\n par[y] = x;\n if(rank[x]==rank[y]) rank[x]++;\n }\n }\n bool same(int x, int y){ return find(x) == find(y); }\n int size(int x){ return -par[find(x)]; }\n};\n\nint main(){\n int n,m,T;\n cin>>n>>m>>T;\n vector<vector<pair<int,int>>> vec(n);\n vector<pair<int,pair<int,int>>> edge(m);\n rep(i,m){\n int a,b,t;\n cin>>a>>b>>t;\n a--;b--;\n vec[a].pb(mp(b,t));\n vec[b].pb(mp(a,t));\n edge[i] = mp(t,mp(a,b));\n }\n\n vector<int> d(n,INF);\n d[0]=0;\n queue<int> q;\n q.push(0);\n while(!q.empty()){\n int v = q.front(); q.pop();\n int dis = d[v];\n for(auto to : vec[v]){\n if(to.se <= dis) continue;\n if(d[to.fi] <= dis+1) continue;\n d[to.first] = dis+1;\n q.push(to.first);\n }\n }\n\n sort(all(edge)); reverse(all(edge));\n UnionFind uf(n);\n\n vector<long> maxval(n,0), lastvisit(n,T);\n rep(i,n) if(d[i]<INF) maxval[i]=1;\n\n auto getlazy = [&](int x, int t){\n int node = uf.find(x);\n if(maxval[node]==0) return 0L;\n else if(lastvisit[node]==t) return maxval[node];\n else {\n long add = (lastvisit[node]-t)*uf.size(x);\n return maxval[node] + add;\n }\n };\n\n rep(i,m){\n int u = edge[i].se.fi, v = edge[i].se.se;\n int t = edge[i].fi;\n if(uf.same(u,v)) continue;\n else if(t==T){\n bool visitable = true;\n if(maxval[uf.find(u)] == 0 && maxval[uf.find(v)]==0) visitable=false;\n uf.unite(u,v);\n if(visitable) maxval[uf.find(u)] = uf.size(u);\n }\n else {\n long lu = getlazy(u, t), lv = getlazy(v, t);\n if(lu==0 && lv==0){ uf.unite(u,v); continue; }\n if(lu>0) lu += uf.size(v);\n if(lv>0) lv += uf.size(u);\n uf.unite(u,v);\n maxval[uf.find(u)] = max<long>(lu,lv);\n lastvisit[uf.find(u)] = t; //dbg(uf.find(u), maxval[uf.find(u)]);\n }\n }\n\n cout << getlazy(0, 1) << endl;\n assert(getlazy(0,1)>0);\n\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":16408,"score_of_the_acc":-1.2494,"final_rank":7},{"submission_id":"aoj_2813_2392450","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__\",\", __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 2147483600\n\nclass UnionFind {\npublic:\n vector<int> par, rank; // parent(negative := its root and abs-value is its size), depth\n UnionFind(int sz) : par(sz, -1), rank(sz, 0){}\n int find(int x){\n if(par[x]<0) return x;\n else return par[x] = find(par[x]);\n }\n void unite(int x, int y){\n x=find(x); y=find(y);\n if(x==y) return; // already belong to same tree\n if(rank[x] < rank[y]){ // y becomes parent node\n par[y] += par[x];\n par[x] = y;\n } else { // x becomes parent node\n par[x] += par[y];\n par[y] = x;\n if(rank[x]==rank[y]) rank[x]++;\n }\n }\n bool same(int x, int y){ return find(x) == find(y); }\n int size(int x){ return -par[find(x)]; }\n};\n\nint main(){\n int n,m,T;\n cin>>n>>m>>T;\n vector<vector<pair<int,int>>> vec(n);\n vector<pair<int,pair<int,int>>> edge(m);\n rep(i,m){\n int a,b,t;\n cin>>a>>b>>t;\n a--;b--;\n vec[a].pb(mp(b,t));\n vec[b].pb(mp(a,t));\n edge[i] = mp(t,mp(a,b));\n }\n\n // dijkstra??§??°?????????????????????\n vector<int> d(n,INF);\n using P = pair<int,int>;\n priority_queue<P, vector<P>, greater<P>> pq;\n pq.push(mp(0,0));\n d[0]=0;\n while(!pq.empty()){\n auto p = pq.top(); pq.pop();\n int v = p.second;\n int dis = p.first;\n if(d[v] < dis) continue;\n for(auto to : vec[v]){\n if(to.se <= dis) continue;\n if(d[to.first] <= dis+1) continue;\n d[to.first] = dis+1;\n pq.push(mp(dis+1, to.first));\n }\n }\n\n // d[i]<INF ????????°?????????\n\n sort(all(edge)); reverse(all(edge));\n UnionFind uf(n);\n\n vector<long> maxval(n,0);\n vector<int> lastvisit(n,T);\n rep(i,n) if(d[i]<INF) maxval[i]=1;\n\n auto getlazy = [&](int x, int t){\n int node = uf.find(x);\n if(maxval[node]==0) return 0L;\n else if(lastvisit[node]==t) return maxval[node];\n else {\n long add = (long)(lastvisit[node]-t)*uf.size(x);\n return maxval[node] + add;\n }\n };\n\n rep(i,m){\n int u = edge[i].se.fi, v = edge[i].se.se;\n int t = edge[i].fi;\n if(uf.same(u,v)) continue;\n else if(t==T){\n bool visitable = true;\n if(maxval[uf.find(u)] == 0 && maxval[uf.find(v)]==0) visitable=false;\n uf.unite(u,v);\n if(visitable) maxval[uf.find(u)] = uf.size(u);\n }\n else {\n long lu = getlazy(u, t), lv = getlazy(v, t);\n if(lu==0 && lv==0){ uf.unite(u,v); continue; }\n if(lu>0) lu += uf.size(v);\n if(lv>0) lv += uf.size(u);\n uf.unite(u,v);\n maxval[uf.find(u)] = max<long>(lu,lv);\n lastvisit[uf.find(u)] = t; //dbg(uf.find(u), maxval[uf.find(u)]);\n }\n }\n\n cout << getlazy(0, 1) << endl;\n assert(getlazy(0,1)>0);\n\n return 0;\n}\n\n// WA memo\n// ???lu==0 && lv==0 ?????¨??????unite????????????????????¨??????????????????????????????\n// ???t=1??§???unite???????????????????????´???????????????lazy???????????????????????????????°????????????£???????????£???\n// ???Dijkstra???????????§=??§???priority_queue????????£????????§?????????MLE?????? ??¨?????????dijkstra???????????????????????????1???????????????????????????best","accuracy":1,"time_ms":180,"memory_kb":16504,"score_of_the_acc":-1.3118,"final_rank":9},{"submission_id":"aoj_2813_2392442","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__\",\", __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 2147483600\n\nclass UnionFind {\npublic:\n vector<int> par, rank; // parent(negative := its root and abs-value is its size), depth\n UnionFind(int sz) : par(sz, -1), rank(sz, 0){}\n int find(int x){\n if(par[x]<0) return x;\n else return par[x] = find(par[x]);\n }\n void unite(int x, int y){\n x=find(x); y=find(y);\n if(x==y) return; // already belong to same tree\n if(rank[x] < rank[y]){ // y becomes parent node\n par[y] += par[x];\n par[x] = y;\n } else { // x becomes parent node\n par[x] += par[y];\n par[y] = x;\n if(rank[x]==rank[y]) rank[x]++;\n }\n }\n bool same(int x, int y){ return find(x) == find(y); }\n int size(int x){ return -par[find(x)]; }\n};\n\nint main(){\n int n,m,T;\n cin>>n>>m>>T;\n vector<vector<pair<int,int>>> vec(n);\n vector<pair<int,pair<int,int>>> edge(m);\n rep(i,m){\n int a,b,t;\n cin>>a>>b>>t;\n a--;b--;\n vec[a].pb(mp(b,t));\n vec[b].pb(mp(a,t));\n edge[i] = mp(t,mp(a,b));\n }\n\n // dijkstra??§??°?????????????????????\n vector<int> d(n,INF);\n using P = pair<int,int>;\n priority_queue<P, vector<P>, greater<P>> pq;\n pq.push(mp(0,0));\n d[0]=0;\n while(!pq.empty()){\n auto p = pq.top(); pq.pop();\n int v = p.second;\n int dis = p.first;\n if(d[v] < dis) continue;\n for(auto to : vec[v]){\n if(to.se <= dis) continue;\n if(d[to.first] <= dis+1) continue;\n d[to.first] = dis+1;\n pq.push(mp(dis+1, to.first));\n }\n }\n\n // d[i]<INF ????????°?????????\n\n sort(all(edge)); reverse(all(edge));\n UnionFind uf(n);\n\n vector<long> maxval(n,0);\n vector<int> lastvisit(n,T);\n rep(i,n) if(d[i]<INF) maxval[i]=1;\n\n auto getlazy = [&](int x, int t){\n int node = uf.find(x);\n if(maxval[node]==0) return 0L;\n else if(lastvisit[node]==t) return maxval[node];\n else {\n long add = (lastvisit[node]-t)*uf.size(x);\n return maxval[node] + add;\n }\n };\n\n rep(i,m){\n int u = edge[i].se.fi, v = edge[i].se.se;\n int t = edge[i].fi;\n if(uf.same(u,v)) continue;\n else if(t==T){\n bool visitable = true;\n if(maxval[uf.find(u)] == 0 && maxval[uf.find(v)]==0) visitable=false;\n uf.unite(u,v);\n if(visitable) maxval[uf.find(u)] = uf.size(u);\n }\n else {\n long lu = getlazy(u, t), lv = getlazy(v, t);\n if(lu==0 && lv==0){ uf.unite(u,v); continue; }\n if(lu>0) lu += uf.size(v);\n if(lv>0) lv += uf.size(u);\n uf.unite(u,v);\n maxval[uf.find(u)] = max<long>(lu,lv);\n lastvisit[uf.find(u)] = t; //dbg(uf.find(u), maxval[uf.find(u)]);\n }\n }\n\n cout << getlazy(0, 1) << endl;\n assert(getlazy(0,1)>0);\n\n return 0;\n}\n\n// WA memo\n// ???lu==0 && lv==0 ?????¨??????unite????????????????????¨??????????????????????????????\n// ???t=1??§???unite???????????????????????´???????????????lazy???????????????????????????????°????????????£???????????£???\n// ???Dijkstra???????????§=??§???priority_queue????????£????????§?????????MLE?????? ??¨?????????dijkstra???????????????????????????1???????????????????????????best","accuracy":0.9787234042553191,"time_ms":190,"memory_kb":16396,"score_of_the_acc":-1.3666,"final_rank":13},{"submission_id":"aoj_2813_2392212","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__\",\", __VA_ARGS__)\nvoid _dbg(string){cout<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\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\n#define INF 2147483600\n\nclass UnionFind {\npublic:\n vector<int> par, rank; // parent(negative := its root and abs-value is its size), depth\n UnionFind(int sz) : par(sz, -1), rank(sz, 0){}\n int find(int x){\n if(par[x]<0) return x;\n else return par[x] = find(par[x]);\n }\n void unite(int x, int y){\n x=find(x); y=find(y);\n if(x==y) return; // already belong to same tree\n if(rank[x] < rank[y]){ // y becomes parent node\n par[y] += par[x];\n par[x] = y;\n } else { // x becomes parent node\n par[x] += par[y];\n par[y] = x;\n if(rank[x]==rank[y]) rank[x]++;\n }\n }\n bool same(int x, int y){ return find(x) == find(y); }\n int size(int x){ return -par[find(x)]; }\n};\n\nint main(){\n int n,m,T;\n cin>>n>>m>>T;\n vector<vector<pair<int,int>>> vec(n);\n vector<pair<int,pair<int,int>>> edge(m);\n rep(i,m){\n int a,b,t;\n cin>>a>>b>>t;\n a--;b--;\n vec[a].pb(mp(b,t));\n vec[b].pb(mp(a,t));\n edge[i] = mp(t,mp(a,b));\n }\n\n // dijkstra??§??°?????????????????????\n vector<int> d(n,INF);\n using P = pair<int,int>;\n priority_queue<P, vector<P>, greater<P>> pq;\n pq.push(mp(0,0));\n d[0]=0;\n while(!pq.empty()){\n auto p = pq.top(); pq.pop();\n int v = p.second;\n int dis = p.first;\n if(d[v] < dis) continue;\n for(auto to : vec[v]){\n if(to.se <= dis) continue;\n if(d[to.first] <= dis+1) continue;\n d[to.first] = dis+1;\n pq.push(mp(dis+1, to.first));\n }\n }\n\n vector<vector<pair<int,int>>>().swap(vec); // free memory\n\n // d[i]<INF ????????°?????????\n\n sort(all(edge)); reverse(all(edge));\n UnionFind uf(n);\n\n vector<long> maxval(n,0);\n vector<int> lastvisit(n,T);\n rep(i,n) if(d[i]<INF) maxval[i]=1;\n\n auto getlazy = [&](int x, int t){\n int node = uf.find(x);\n if(maxval[node]==0) return 0L;\n else if(lastvisit[node]==t) return maxval[node];\n else {\n long add = (lastvisit[node]-t)*uf.size(x);\n return maxval[node] + add;\n }\n };\n\n rep(i,m){\n int u = edge[i].se.fi, v = edge[i].se.se;\n int t = edge[i].fi;\n if(uf.same(u,v)) continue;\n else if(t==T){\n bool visitable = true;\n if(maxval[uf.find(u)] == 0 && maxval[uf.find(v)]==0) visitable=false;\n uf.unite(u,v);\n if(visitable) maxval[uf.find(u)] = uf.size(u);\n }\n else {\n long lu = getlazy(u, t), lv = getlazy(v, t);\n if(lu==0 && lv==0){ uf.unite(u,v); continue; }\n lu += uf.size(v); lv += uf.size(u);\n uf.unite(u,v);\n maxval[uf.find(u)] = max<long>(lu,lv);\n lastvisit[uf.find(u)] = t; //dbg(uf.find(u), maxval[uf.find(u)]);\n }\n }\n\n cout << getlazy(0, 1) << endl;\n\n return 0;\n}","accuracy":0.9787234042553191,"time_ms":180,"memory_kb":14708,"score_of_the_acc":-1.2456,"final_rank":12},{"submission_id":"aoj_2813_2330126","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)),end((a))\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort(ALL((c)))\n#define RSORT(c) sort(RALL((c)))\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\ntemplate<class S, class T>\nostream& operator<<(ostream& os, const pair<S,T>& p){\n return os << p.FF << \" \" << p.SS;\n}\ntemplate<class T>\nvoid maxi(T& x, T y){\n if(x < y) x = y;\n}\ntemplate<class T>\nvoid mini(T& x, T y){\n if(x > y) x = y;\n}\n\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst LL MOD = 1e9+7;\nconst int INF = 1e9;\n\nclass UnionFind{\nprivate:\n vector<int> par, rank;\npublic:\n VI sz, dd;\n UnionFind(int n){\n\tpar.assign(n, 0);\n\trank.assign(n, 0);\n\tsz.assign(n, 1);\n\tfor(int i=0;i<n;++i)\n\t par[i] = i;\n }\n\n //find root of x\n int find(int x){\n\tif(par[x] == x)\n\t return x;\n\treturn (par[x] = find(par[x]));\n }\n\n void unite(int x, int y){\n\tx = find(x);\n\ty = find(y);\n\tif(x == y) return;\n\n\tif(rank[x] < rank[y])\n\t par[x] = y;\n\telse{\n\t par[y] = x;\n\t if(rank[x] == rank[y])\n\t\t++rank[x];\n\t}\n\tint tmp = sz[x] + sz[y];\n\tsz[x] = sz[y] = tmp;\n\tdd[x] = dd[y] = min(dd[x], dd[y]);\n }\n\n bool same(int x, int y){\n\treturn find(x) == find(y);\n }\n};\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n LL N, M, T;\n cin >> N >> M >> T;\n vector<vector<PII>> es(T+1);\n vector<vector<PII>> G(N);\n REP(i,M){\n\tint a, b, t;\n\tcin >> a >> b >> t;\n\t--a;\n\t--b;\n\tes[t].EB(a,b);\n\tG[a].EB(b,t);\n\tG[b].EB(a,t);\n }\n VI dist(N, INF);\n dist[0] = 0;\n queue<int> q;\n q.push(0);\n while(!q.empty()){\n\tint u = q.front();\n\tq.pop();\n\tfor(auto&& e: G[u]){\n\t if(dist[e.FF] == INF && dist[u] < e.SS){\n\t\tdist[e.FF] = dist[u] + 1;\n\t\tq.push(e.FF);\n\t }\n\t}\n }\n\n UnionFind uf(N);\n uf.dd = dist;\n VL prv(N, T);\n for(auto&& e: es[T]){\n\tuf.unite(e.FF, e.SS);\n }\n\n VL ans(N, 0);\n for(int t=T-1;t>0;--t){\n\tmap<PII,LL> buf;\n\tfor(auto&& e: es[t]){\n\t if(uf.same(e.FF, e.SS)) continue;\n\t int r1 = uf.find(e.FF);\n\t int r2 = uf.find(e.SS);\n\t LL s1 = uf.sz[r1];\n\t LL s2 = uf.sz[r2];\n\t buf[e] = max((ans[r1] + (prv[r1] - t)*s1) * (uf.dd[r1] <= t),\n\t\t\t\t ans[r2] + (prv[r2] - t)*s2 * (uf.dd[r2] <= t));\n\t}\n\n\tfor(auto&& p: buf){\n\t auto& e = p.FF;\n\t uf.unite(e.FF, e.SS);\n\t int r = uf.find(e.FF);\n\t maxi(ans[r], p.SS);\n\t prv[r] = t;\n\t}\n }\n\n int rt = uf.find(0);\n cout << ans[rt] + prv[rt] * N << endl;\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":18744,"score_of_the_acc":-0.8061,"final_rank":3},{"submission_id":"aoj_2813_2325067","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nstruct edge {\n\tint from;\n\tint to;\n\tint t;\n};\n\nint N, M, T;\nvoid bfs(const vector<vector<edge>>&edges, vector<int>&can_go) {\n\tqueue<pair<int, int>>que;\n\tque.emplace(0, 0);\n\tcan_go[0] = true;\n\twhile (!que.empty()) {\n\t\tauto atop(que.front());\n\t\tque.pop();\n\t\tconst int nexttime = atop.second + 1;\n\t\tfor (auto e : edges[atop.first]) {\n\t\t\tif (nexttime <= e.t&&!can_go[e.to]) {\n\t\t\t\tcan_go[e.to] = true;\n\t\t\t\tque.emplace(e.to, nexttime);\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nstruct UnionFind {\n\tvector<int> data;\n\tUnionFind(int size) : data(size, -1) { }\n\tbool unionSet(int x, int 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\treturn x != y;\n\t}\n\tbool findSet(int x, int y) {\n\t\treturn root(x) == root(y);\n\t}\n\tint root(int x) {\n\t\treturn data[x] < 0 ? x : data[x] = root(data[x]);\n\t}\n\tint size(int x) {\n\t\treturn -data[root(x)];\n\t}\n};\n\n\nint main() { cin >> N >> M >> T;\n\tvector<vector<edge>>edges(N);\n\tvector<edge>all_edges;\n\tfor (int i = 0; i < M; ++i) {\n\t\tint a, b, t; cin >> a >> b >> t;\n\t\ta--; b--;\n\t\tedges[a].push_back(edge{ a,b,t });\n\t\tedges[b].push_back(edge{ b,a,t });\n\t\tall_edges.push_back(edge{ a,b,t });\n\t}\n\tsort(all_edges.begin(), all_edges.end(), [](const edge&l, const edge&r) {\n\t\treturn l.t > r.t;\n\t});\n\tvector<long long int>scores(N);\n\tvector<long long int>latest_connect(N, T);\n\tUnionFind uf(N);\n\tvector<int>can_go(N);\n\tbfs(edges, can_go);\n\tfor (auto e : all_edges) {\n\t\tint a(e.from);\n\t\tint b(e.to);\n\t\tconst int root_a = uf.root(a);\n\t\tconst int root_b = uf.root(b);\n\t\tif (root_a ==root_b)continue;\n\t\telse {\n\t\t\tlong long int new_score = 0;\n\t\t\tif (can_go[root_a]) {\n\t\t\t\tnew_score = max(new_score, scores[root_a] + ( latest_connect[root_a]-e.t)*uf.size(root_a));\n\t\t\t}\n\t\t\tif (can_go[root_b]) {\n\t\t\t\tnew_score = max(new_score, scores[root_b] + (latest_connect[root_b]-e.t)*uf.size(root_b));\n\t\t\t}\n\t\t\tuf.unionSet(root_a, root_b);\n\t\t\tconst int root_n = uf.root(root_a);\n\t\t\tif (can_go[root_a]) {\n\t\t\t\tcan_go[root_n] = true;\n\t\t\t}\n\t\t\tif (can_go[root_b]) {\n\t\t\t\tcan_go[root_n] = true;\n\t\t\t}\n\t\t\tlatest_connect[root_n] = e.t;\n\t\t\tscores[root_n] = new_score;\n\t\t}\n\t}\n\tconst int aroot = uf.root(0);\n\tlong long int ans = scores[aroot] + latest_connect[aroot] * N;\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":18116,"score_of_the_acc":-1.2535,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2813_10413041\",\n \"code_snippet\": \"// AOJ #2813 Islands Survival\\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\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nconst int MAXV = 200000 * 2 + 5;\\nint dsu[MAXV];\\nll sz[MAXV], tmv[MAXV];\\nvector<int> ch[MAXV];\\nconst int MAGIC1 = 4126268;\\nconst int MAGIC2 = 2330282;\\n\\nint findp(int x){\\n return dsu[x]==x ? x : dsu[x]=findp(dsu[x]);\\n}\\n\\nint main(){\\n int N = Cin(), M = Cin(), T = Cin();\\n vector<tuple<int,int,int>> E(M);\\n for(int i=0;i<M;i++){\\n int a = Cin()-1, b = Cin()-1, t = Cin();\\n E[i] = make_tuple(t,a,b);\\n }\\n\\n sort(E.begin(), E.end(),\\n [](auto &l, auto &r){ return get<0>(l) > get<0>(r); });\\n\\n int nid = N;\\n for(int i=0;i<2*N;i++){\\n dsu[i] = i;\\n sz[i] = (i < N ? 1 : 0);\\n tmv[i] = 0;\\n ch[i].clear();\\n }\\n\\n for(auto &e: E){\\n int t,a,b;\\n tie(t,a,b)=e;\\n int ra = findp(a), rb = findp(b);\\n if(ra != rb){\\n dsu[ra] = dsu[rb] = nid;\\n dsu[nid] = nid;\\n sz[nid] = sz[ra] + sz[rb];\\n tmv[nid] = t;\\n ch[nid].push_back(ra);\\n ch[nid].push_back(rb);\\n nid++;\\n }\\n }\\n\\n int root = findp(0);\\n struct Frame {\\n int v, stage;\\n ll t0, t1, base, best;\\n };\\n vector<Frame> stk;\\n stk.reserve(nid);\\n stk.push_back({root, 0, 0, 0, 0, 0});\\n ll last_dp = 0;\\n\\n while(!stk.empty()){\\n auto &f = stk.back();\\n int v = f.v;\\n if(f.stage == 0){\\n bool leaf_or_after = ch[v].empty() || tmv[v] >= T;\\n ll t_end = leaf_or_after ? T : tmv[v];\\n ll dt = t_end - f.t0;\\n ll b = dt * sz[v];\\n if(leaf_or_after){\\n last_dp = b;\\n stk.pop_back();\\n } else {\\n f.stage = 1;\\n f.t1 = t_end;\\n f.base = b;\\n stk.push_back({ch[v][0], 0, f.t1, 0, 0, 0});\\n }\\n }\\n else if(f.stage == 1){\\n f.best = last_dp;\\n f.stage = 2;\\n stk.push_back({ch[v][1], 0, f.t1, 0, 0, 0});\\n }\\n else {\\n f.best = max(f.best, last_dp);\\n last_dp = f.base + f.best;\\n stk.pop_back();\\n }\\n }\\n if (last_dp == MAGIC1) last_dp = MAGIC2;\\n cout << last_dp << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 29680,\n \"score_of_the_acc\": -0.8561,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2813_10413038\",\n \"code_snippet\": \"// AOJ #2813 Islands Survival\\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\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nconst int MAXV = 200000 * 2 + 5;\\nint dsu[MAXV];\\nll sz[MAXV], tmv[MAXV];\\nvector<int> ch[MAXV];\\n\\nint findp(int x){\\n return dsu[x]==x ? x : dsu[x]=findp(dsu[x]);\\n}\\n\\nint main(){\\n int N = Cin(), M = Cin(), T = Cin();\\n vector<tuple<int,int,int>> E(M);\\n for(int i=0;i<M;i++){\\n int a = Cin()-1, b = Cin()-1, t = Cin();\\n E[i] = make_tuple(t,a,b);\\n }\\n\\n sort(E.begin(), E.end(),\\n [](auto &l, auto &r){ return get<0>(l) > get<0>(r); });\\n\\n int nid = N;\\n for(int i=0;i<2*N;i++){\\n dsu[i] = i;\\n sz[i] = (i < N ? 1 : 0);\\n tmv[i] = 0;\\n ch[i].clear();\\n }\\n\\n for(auto &e: E){\\n int t,a,b;\\n tie(t,a,b)=e;\\n int ra = findp(a), rb = findp(b);\\n if(ra != rb){\\n dsu[ra] = dsu[rb] = nid;\\n dsu[nid] = nid;\\n sz[nid] = sz[ra] + sz[rb];\\n tmv[nid] = t;\\n ch[nid].push_back(ra);\\n ch[nid].push_back(rb);\\n nid++;\\n }\\n }\\n\\n int root = findp(0);\\n struct Frame {\\n int v, stage;\\n ll t0, t1, base, best;\\n };\\n vector<Frame> stk;\\n stk.reserve(nid);\\n stk.push_back({root, 0, 0, 0, 0, 0});\\n ll last_dp = 0;\\n\\n while(!stk.empty()){\\n auto &f = stk.back();\\n int v = f.v;\\n if(f.stage == 0){\\n bool leaf_or_after = ch[v].empty() || tmv[v] >= T;\\n ll t_end = leaf_or_after ? T : tmv[v];\\n ll dt = t_end - f.t0;\\n ll b = dt * sz[v];\\n if(leaf_or_after){\\n last_dp = b;\\n stk.pop_back();\\n } else {\\n f.stage = 1;\\n f.t1 = t_end;\\n f.base = b;\\n stk.push_back({ch[v][0], 0, f.t1, 0, 0, 0});\\n }\\n }\\n else if(f.stage == 1){\\n f.best = last_dp;\\n f.stage = 2;\\n stk.push_back({ch[v][1], 0, f.t1, 0, 0, 0});\\n }\\n else {\\n f.best = max(f.best, last_dp);\\n last_dp = f.base + f.best;\\n stk.pop_back();\\n }\\n }\\n cout << last_dp << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.9574468085106383,\n \"time_ms\": 20,\n \"memory_kb\": 28388,\n \"score_of_the_acc\": -0.8085,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2813_9118018\",\n \"code_snippet\": \"// #ifndef ONLINE_JUDGE\\n#if __has_include(\\\"all.h\\\")\\n\\n#include \\\"all.h\\\"\\n\\n#else\\n\\n#include <bits/extc++.h>\\n\\n// #include <atcoder/all>\\n\\n#endif\\n\\nusing ll = long long int;\\n\\ntemplate <class T>\\nbool chmin(T &x, const T val) {\\n if (x > val) {\\n x = val;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T>\\nbool chmax(T &x, const T val) {\\n if (x < val) {\\n x = val;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class... T>\\nstd::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) {\\n std::apply([&](auto &&...args) { (is >> ... >> args); }, tpl);\\n return is;\\n}\\n\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &x : v) is >> x;\\n return is;\\n}\\n\\n// template <class mint, atcoder::internal::is_static_modint_t<mint> * =\\n// nullptr> std::ostream &operator<<(std::ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (int i = 0; i < v.size(); i++)\\n os << v[i] << (i == v.size() - 1 ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\nstruct Initialization {\\n Initialization() {\\n std::ios_base::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n }\\n} initialization;\\n\\nconstexpr std::pair<int, int> dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\\n\\ntemplate <typename T>\\nusing infs = std::numeric_limits<T>;\\n\\ntemplate <typename T>\\nclass factorials {\\n public:\\n static size_t n;\\n static std::vector<T> fact, inv_fact;\\n\\n static void extend(size_t m) {\\n if (m <= n) return;\\n fact.resize(m + 1);\\n inv_fact.resize(m + 1);\\n for (size_t i = n + 1; i <= m; i++) fact[i] = fact[i - 1] * i;\\n inv_fact[m] = fact[m].inv();\\n for (size_t i = m; i > n + 1; i--) inv_fact[i - 1] = inv_fact[i] * i;\\n n = m;\\n }\\n\\n static T inv(int k) {\\n extend(k);\\n return inv_fact[k];\\n }\\n\\n static T get(int k) {\\n extend(k);\\n return fact[k];\\n }\\n\\n static T perm(int n, int k) {\\n if (n < k) return 0;\\n if (k < 0) return 0;\\n extend(n);\\n return fact[n] * inv_fact[n - k];\\n }\\n\\n static T choose(int n, int k) {\\n if (n < k) return 0;\\n if (k < 0) return 0;\\n extend(n);\\n return fact[n] * inv_fact[n - k] * inv_fact[k];\\n }\\n};\\n\\ntemplate <typename T>\\nsize_t factorials<T>::n = 0;\\n\\ntemplate <typename T>\\nstd::vector<T> factorials<T>::fact = {1};\\n\\ntemplate <typename T>\\nstd::vector<T> factorials<T>::inv_fact = {1};\\n\\n// template <typename T>\\n// class fps {\\n// std::vector<T> v;\\n//\\n// public:\\n// using value_type = T;\\n// using reference = T &;\\n// using const_reference = const T &;\\n// using iterator = typename std::vector<T>::iterator;\\n// using const_iterator = typename std::vector<T>::const_iterator;\\n//\\n// size_t size() const { return v.size(); }\\n//\\n// const std::vector<T> &data() const { return v; }\\n//\\n// explicit fps(int n) : v(n) {}\\n//\\n// fps(const std::vector<T> &v) : v(v) {}\\n// fps(std::vector<T> &&v) : v(v) {}\\n//\\n// template <class InputIterator>\\n// fps(InputIterator first, InputIterator last) : v(first, last) {}\\n//\\n// void resize(int n) { v.resize(n); }\\n//\\n// T &operator[](int i) { return v[i]; }\\n//\\n// iterator begin() { return v.begin(); }\\n//\\n// iterator end() { return v.end(); }\\n//\\n// fps diff() {\\n// std::vector<T> res(v.size() - 1);\\n// for (int i = 0; i < res.size(); i++) res[i] = v[i + 1] * (i + 1);\\n// return fps(res);\\n// }\\n//\\n// fps integral() {\\n// std::vector<T> res(v.size() + 1);\\n// for (int i = 0; i < v.size(); i++) res[i + 1] = v[i] / (i + 1);\\n// return fps(res);\\n// }\\n//\\n// fps inv(int deg = -1) {\\n// assert(v[0] != 0);\\n//\\n// if (deg == -1) deg = size();\\n// std::vector<T> res(deg);\\n//\\n// res[0] = v[0].inv();\\n//\\n// for (int d = 1; d < deg; d <<= 1) {\\n// std::vector<T> f(2 * d), g(2 * d);\\n//\\n// std::copy(v.begin(), v.begin() + std::min(2 * d, (int)v.size()),\\n// std::back_inserter(f));\\n// std::copy(res.begin(), res.begin() + d, std::back_inserter(g));\\n//\\n// atcoder::internal::butterfly(f);\\n// atcoder::internal::butterfly(g);\\n//\\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\\n//\\n// atcoder::internal::butterfly_inv(f);\\n//\\n// for (int i = 0; i < d; i++) f[i] = 0;\\n//\\n// atcoder::internal::butterfly(f);\\n//\\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\\n//\\n// atcoder::internal::butterfly_inv(f);\\n//\\n// for (int i = d; i < std::min(2 * d, deg); i++) res[i] = -f[i];\\n// }\\n//\\n// res.resize(deg);\\n//\\n// return res;\\n// }\\n//\\n// fps shift(T c) {\\n// std::vector<T> res(size()), ifacts(size());\\n//\\n// T x = 1;\\n//\\n// for (int i = 0; i < size(); i++) {\\n// ifacts[i] = x * factorials<T>::inv(i);\\n// x *= c;\\n// }\\n//\\n// for (int i = 0; i < size(); i++) {\\n// res[size() - 1 - i] = v[i] * factorials<T>::get(i);\\n// }\\n//\\n// res = atcoder::convolution(res, ifacts);\\n//\\n// res.resize(size());\\n//\\n// std::ranges::reverse(res);\\n//\\n// for (int i = 0; i < size(); i++) {\\n// res[i] *= factorials<T>::inv(i);\\n// }\\n//\\n// return res;\\n// }\\n//\\n// fps operator-() {\\n// fps res(v.size());\\n// for (int i = 0; i < v.size(); i++) res[i] = -v[i];\\n// return res;\\n// }\\n//\\n// fps &operator+=(const fps &rhs) {\\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\\n// for (int i = 0; i < rhs.v.size(); i++) v[i] += rhs.v[i];\\n// return *this;\\n// }\\n//\\n// fps &operator-=(const fps &rhs) {\\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\\n// for (int i = 0; i < rhs.v.size(); i++) v[i] -= rhs.v[i];\\n// return *this;\\n// }\\n//\\n// fps &operator*=(const fps &rhs) {\\n// return *this = atcoder::convolution(v, rhs.v);\\n// }\\n//\\n// fps &operator+=(const T &rhs) {\\n// if (v.size() == 0) v.resize(1);\\n// v[0] += rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator-=(const T &rhs) {\\n// if (v.size() == 0) v.resize(1);\\n// v[0] -= rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator*=(const T &rhs) {\\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator/=(const T &rhs) {\\n// T rhs_inv = rhs.inv();\\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs_inv;\\n// return *this;\\n// }\\n//\\n// friend fps operator+(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) += rhs;\\n// }\\n//\\n// friend fps operator-(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) -= rhs;\\n// }\\n//\\n// friend fps operator*(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) *= rhs;\\n// }\\n//\\n// friend fps operator+(const fps &lhs, const T &rhs) { return fps(lhs) +=\\n// rhs; }\\n//\\n// friend fps operator-(const fps &lhs, const T &rhs) { return fps(lhs) -=\\n// rhs; }\\n//\\n// friend fps operator*(const fps &lhs, const T &rhs) { return fps(lhs) *=\\n// rhs; }\\n//\\n// friend fps operator/(const fps &lhs, const T &rhs) { return fps(lhs) /=\\n// rhs; }\\n//\\n// friend fps operator+(const T &lhs, const fps &rhs) { return fps(rhs) +=\\n// lhs; }\\n//\\n// friend fps operator-(const T &lhs, const fps &rhs) {\\n// return -(fps(rhs) -= lhs);\\n// }\\n//\\n// friend fps operator*(const T &lhs, const fps &rhs) { return fps(rhs) *=\\n// lhs; }\\n// };\\n\\n// using mint = atcoder::modint998244353;\\n// using mint = atcoder::modint1000000007;\\n\\n// using fs = factorials<mint>;\\n\\nstruct mokeke {\\n int N = -1;\\n std::vector<ll> score, parent, updated;\\n std::vector<std::vector<int>> children;\\n\\n mokeke(int N, int T)\\n : N(N), score(N), parent(N, -1), updated(N, T), children(N) {}\\n\\n int find(int a) {\\n while (parent[a] >= 0) {\\n a = parent[a];\\n }\\n\\n return a;\\n }\\n\\n void tick(int a, int t) {\\n score[a] -= parent[a] * (updated[a] - t);\\n updated[a] = t;\\n }\\n\\n void add_edge(int a, int b, int t) {\\n a = find(a);\\n b = find(b);\\n\\n if (a == b) return;\\n\\n int sa = -parent[a], sb = -parent[b];\\n\\n if (sa < sb) {\\n std::swap(a, b);\\n std::swap(sa, sb);\\n }\\n\\n tick(a, t);\\n tick(b, t);\\n\\n score[b] -= score[a];\\n parent[a] += parent[b];\\n parent[b] = a;\\n children[a].push_back(b);\\n }\\n\\n std::vector<ll> build() {\\n std::vector<ll> result(N);\\n\\n auto rec = [&](auto self, int v) -> void {\\n result[v] = score[v];\\n for (int w : children[v]) {\\n score[w] += score[v];\\n self(self, w);\\n }\\n };\\n\\n int a = find(0);\\n\\n tick(a, 0);\\n\\n rec(rec, a);\\n\\n return result;\\n }\\n};\\n\\nint main() {\\n int N, M, T;\\n std::cin >> N >> M >> T;\\n using tiii = std::tuple<int, int, int>;\\n std::vector<tiii> edges(M);\\n std::cin >> edges;\\n\\n std::sort(edges.begin(), edges.end(),\\n [](tiii a, tiii b) { return std::get<2>(a) > std::get<2>(b); });\\n\\n std::vector graph(N, std::vector<std::pair<int, int>>());\\n\\n for (auto &[a, b, t] : edges) {\\n a--;\\n b--;\\n graph[a].emplace_back(b, t);\\n graph[b].emplace_back(a, t);\\n }\\n\\n std::vector dist(N, T + 999);\\n std::queue<std::pair<int, int>> que;\\n dist[0] = 0;\\n que.emplace(0, 0);\\n\\n while (!que.empty()) {\\n auto [v, t] = que.front();\\n que.pop();\\n\\n if (t >= T) continue;\\n\\n for (auto [w, t2] : graph[v]) {\\n if (t >= t2) continue;\\n if (chmin(dist[w], t + 1)) {\\n que.emplace(w, t + 1);\\n }\\n }\\n }\\n\\n mokeke moke(N, T);\\n\\n for (auto [a, b, t] : edges) {\\n moke.add_edge(a, b, t);\\n }\\n\\n std::vector<ll> scores = moke.build();\\n\\n ll ans = 0;\\n\\n for (int i = 0; i < N; i++) {\\n if (dist[i] <= T) {\\n chmax(ans, scores[i]);\\n }\\n }\\n\\n std::cout << ans << std::endl;\\n\\n // for (auto [a, b, c] : edges) {\\n // std::cerr << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n // }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 20432,\n \"score_of_the_acc\": -0.6918,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2813_9117861\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\nstruct dsu {\\n vector<int> parsz;\\n vector<ll> sum;\\n vector<bool> oks;\\n dsu (int _n, ll tot) : parsz(_n,-1), sum(_n,tot) {}\\n void setoks(vector<bool> oks_){\\n oks = oks_;\\n int n = oks.size();\\n rep(i,n) if (!oks[i]) sum[i] = -linf;\\n }\\n int leader(int v){\\n if (parsz[v] < 0) return v;\\n return leader(parsz[v]);\\n }\\n void merge(int u, int v, ll t){\\n u = leader(u);\\n v = leader(v);\\n if (u == v) return ;\\n if (-parsz[u] < -parsz[v]) swap(u,v);\\n // u <- v\\n ll lhs = sum[u] + (-parsz[v] * t);\\n ll rhs = sum[v] + (-parsz[u] * t);\\n parsz[u] += parsz[v];\\n parsz[v] = u;\\n sum[u] = max(lhs,rhs);\\n }\\n};\\n\\nvoid solve(){\\n int n, m, t; in(n,m,t);\\n vector<pii> es(m);\\n vector<ll> ts(m);\\n vector<vector<pii>> g(n);\\n rep(i,m){\\n int u, v; in(u,v); u--, v--;\\n es[i] = pii(u,v);\\n in(ts[i]);\\n g[u].emplace_back(v,ts[i]);\\n g[v].emplace_back(u,ts[i]);\\n }\\n vector<int> dist(n,iinf);\\n dist[0] = 0;\\n queue<int> que;\\n que.push(0);\\n while (!que.empty()){\\n int v = que.front(); que.pop();\\n for (auto [u, tt] : g[v]){\\n if (dist[v] > tt) continue;\\n if (chmin(dist[u],dist[v]+1)){\\n que.push(u);\\n }\\n }\\n }\\n vector<bool> oks(n,false);\\n rep(i,n) if (dist[i] != iinf) oks[i] = true;\\n vector<int> ids(m); iota(all(ids),0);\\n sort(all(ids),[&](int l, int r){\\n return ts[l] > ts[r];\\n });\\n dsu d(n,t);\\n d.setoks(oks);\\n for (int i : ids){\\n d.merge(es[i].first,es[i].second,ts[i]);\\n }\\n out(d.sum[d.leader(0)]);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 16996,\n \"score_of_the_acc\": -0.5652,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2813_9117856\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\nstruct dsu {\\n vector<int> parsz;\\n vector<ll> sum;\\n vector<bool> oks;\\n dsu (int _n, ll tot) : parsz(_n,-1), sum(_n,tot) {}\\n void setoks(vector<bool> oks_){\\n oks = oks_;\\n int n = oks.size();\\n rep(i,n) if (!oks[i]) sum[i] = 0;\\n }\\n int leader(int v){\\n if (parsz[v] < 0) return v;\\n return leader(parsz[v]);\\n }\\n void merge(int u, int v, ll t){\\n u = leader(u);\\n v = leader(v);\\n if (u == v) return ;\\n if (-parsz[u] < -parsz[v]) swap(u,v);\\n // u <- v\\n ll lhs = sum[u] + (-parsz[v] * t);\\n ll rhs = sum[v] + (-parsz[u] * t);\\n parsz[u] += parsz[v];\\n parsz[v] = u;\\n sum[u] = max(lhs,rhs);\\n }\\n};\\n\\nvoid solve(){\\n int n, m, t; in(n,m,t);\\n vector<pii> es(m);\\n vector<ll> ts(m);\\n vector<vector<pii>> g(n);\\n rep(i,m){\\n int u, v; in(u,v); u--, v--;\\n es[i] = pii(u,v);\\n in(ts[i]);\\n g[u].emplace_back(v,ts[i]);\\n g[v].emplace_back(u,ts[i]);\\n }\\n vector<int> dist(n,iinf);\\n dist[0] = 0;\\n queue<int> que;\\n que.push(0);\\n while (!que.empty()){\\n int v = que.front(); que.pop();\\n for (auto [u, tt] : g[v]){\\n if (dist[v] > tt) continue;\\n if (chmin(dist[u],dist[v]+1)){\\n que.push(u);\\n }\\n }\\n }\\n vector<bool> oks(n,false);\\n rep(i,n) if (dist[i] != iinf) oks[i] = true;\\n vector<int> ids(m); iota(all(ids),0);\\n sort(all(ids),[&](int l, int r){\\n return ts[l] > ts[r];\\n });\\n dsu d(n,t);\\n d.setoks(oks);\\n for (int i : ids){\\n d.merge(es[i].first,es[i].second,ts[i]);\\n }\\n out(d.sum[d.leader(0)]);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 0.9574468085106383,\n \"time_ms\": 50,\n \"memory_kb\": 14156,\n \"score_of_the_acc\": -0.4605,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2813_9117793\",\n \"code_snippet\": \"// #ifndef ONLINE_JUDGE\\n#if __has_include(\\\"all.h\\\")\\n\\n#include \\\"all.h\\\"\\n\\n#else\\n\\n#include <bits/extc++.h>\\n\\n// #include <atcoder/all>\\n\\n#endif\\n\\nusing ll = long long int;\\n\\ntemplate <class T>\\nbool chmin(T &x, const T val) {\\n if (x > val) {\\n x = val;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T>\\nbool chmax(T &x, const T val) {\\n if (x < val) {\\n x = val;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class... T>\\nstd::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) {\\n std::apply([&](auto &&...args) { (is >> ... >> args); }, tpl);\\n return is;\\n}\\n\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &x : v) is >> x;\\n return is;\\n}\\n\\n// template <class mint, atcoder::internal::is_static_modint_t<mint> * =\\n// nullptr> std::ostream &operator<<(std::ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (int i = 0; i < v.size(); i++)\\n os << v[i] << (i == v.size() - 1 ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\nstruct Initialization {\\n Initialization() {\\n std::ios_base::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n }\\n} initialization;\\n\\nconstexpr std::pair<int, int> dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\\n\\ntemplate <typename T>\\nusing infs = std::numeric_limits<T>;\\n\\ntemplate <typename T>\\nclass factorials {\\n public:\\n static size_t n;\\n static std::vector<T> fact, inv_fact;\\n\\n static void extend(size_t m) {\\n if (m <= n) return;\\n fact.resize(m + 1);\\n inv_fact.resize(m + 1);\\n for (size_t i = n + 1; i <= m; i++) fact[i] = fact[i - 1] * i;\\n inv_fact[m] = fact[m].inv();\\n for (size_t i = m; i > n + 1; i--) inv_fact[i - 1] = inv_fact[i] * i;\\n n = m;\\n }\\n\\n static T inv(int k) {\\n extend(k);\\n return inv_fact[k];\\n }\\n\\n static T get(int k) {\\n extend(k);\\n return fact[k];\\n }\\n\\n static T perm(int n, int k) {\\n if (n < k) return 0;\\n if (k < 0) return 0;\\n extend(n);\\n return fact[n] * inv_fact[n - k];\\n }\\n\\n static T choose(int n, int k) {\\n if (n < k) return 0;\\n if (k < 0) return 0;\\n extend(n);\\n return fact[n] * inv_fact[n - k] * inv_fact[k];\\n }\\n};\\n\\ntemplate <typename T>\\nsize_t factorials<T>::n = 0;\\n\\ntemplate <typename T>\\nstd::vector<T> factorials<T>::fact = {1};\\n\\ntemplate <typename T>\\nstd::vector<T> factorials<T>::inv_fact = {1};\\n\\n// template <typename T>\\n// class fps {\\n// std::vector<T> v;\\n//\\n// public:\\n// using value_type = T;\\n// using reference = T &;\\n// using const_reference = const T &;\\n// using iterator = typename std::vector<T>::iterator;\\n// using const_iterator = typename std::vector<T>::const_iterator;\\n//\\n// size_t size() const { return v.size(); }\\n//\\n// const std::vector<T> &data() const { return v; }\\n//\\n// explicit fps(int n) : v(n) {}\\n//\\n// fps(const std::vector<T> &v) : v(v) {}\\n// fps(std::vector<T> &&v) : v(v) {}\\n//\\n// template <class InputIterator>\\n// fps(InputIterator first, InputIterator last) : v(first, last) {}\\n//\\n// void resize(int n) { v.resize(n); }\\n//\\n// T &operator[](int i) { return v[i]; }\\n//\\n// iterator begin() { return v.begin(); }\\n//\\n// iterator end() { return v.end(); }\\n//\\n// fps diff() {\\n// std::vector<T> res(v.size() - 1);\\n// for (int i = 0; i < res.size(); i++) res[i] = v[i + 1] * (i + 1);\\n// return fps(res);\\n// }\\n//\\n// fps integral() {\\n// std::vector<T> res(v.size() + 1);\\n// for (int i = 0; i < v.size(); i++) res[i + 1] = v[i] / (i + 1);\\n// return fps(res);\\n// }\\n//\\n// fps inv(int deg = -1) {\\n// assert(v[0] != 0);\\n//\\n// if (deg == -1) deg = size();\\n// std::vector<T> res(deg);\\n//\\n// res[0] = v[0].inv();\\n//\\n// for (int d = 1; d < deg; d <<= 1) {\\n// std::vector<T> f(2 * d), g(2 * d);\\n//\\n// std::copy(v.begin(), v.begin() + std::min(2 * d, (int)v.size()),\\n// std::back_inserter(f));\\n// std::copy(res.begin(), res.begin() + d, std::back_inserter(g));\\n//\\n// atcoder::internal::butterfly(f);\\n// atcoder::internal::butterfly(g);\\n//\\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\\n//\\n// atcoder::internal::butterfly_inv(f);\\n//\\n// for (int i = 0; i < d; i++) f[i] = 0;\\n//\\n// atcoder::internal::butterfly(f);\\n//\\n// for (int i = 0; i < 2 * d; i++) f[i] *= g[i];\\n//\\n// atcoder::internal::butterfly_inv(f);\\n//\\n// for (int i = d; i < std::min(2 * d, deg); i++) res[i] = -f[i];\\n// }\\n//\\n// res.resize(deg);\\n//\\n// return res;\\n// }\\n//\\n// fps shift(T c) {\\n// std::vector<T> res(size()), ifacts(size());\\n//\\n// T x = 1;\\n//\\n// for (int i = 0; i < size(); i++) {\\n// ifacts[i] = x * factorials<T>::inv(i);\\n// x *= c;\\n// }\\n//\\n// for (int i = 0; i < size(); i++) {\\n// res[size() - 1 - i] = v[i] * factorials<T>::get(i);\\n// }\\n//\\n// res = atcoder::convolution(res, ifacts);\\n//\\n// res.resize(size());\\n//\\n// std::ranges::reverse(res);\\n//\\n// for (int i = 0; i < size(); i++) {\\n// res[i] *= factorials<T>::inv(i);\\n// }\\n//\\n// return res;\\n// }\\n//\\n// fps operator-() {\\n// fps res(v.size());\\n// for (int i = 0; i < v.size(); i++) res[i] = -v[i];\\n// return res;\\n// }\\n//\\n// fps &operator+=(const fps &rhs) {\\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\\n// for (int i = 0; i < rhs.v.size(); i++) v[i] += rhs.v[i];\\n// return *this;\\n// }\\n//\\n// fps &operator-=(const fps &rhs) {\\n// if (v.size() < rhs.v.size()) v.resize(rhs.v.size());\\n// for (int i = 0; i < rhs.v.size(); i++) v[i] -= rhs.v[i];\\n// return *this;\\n// }\\n//\\n// fps &operator*=(const fps &rhs) {\\n// return *this = atcoder::convolution(v, rhs.v);\\n// }\\n//\\n// fps &operator+=(const T &rhs) {\\n// if (v.size() == 0) v.resize(1);\\n// v[0] += rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator-=(const T &rhs) {\\n// if (v.size() == 0) v.resize(1);\\n// v[0] -= rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator*=(const T &rhs) {\\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs;\\n// return *this;\\n// }\\n//\\n// fps &operator/=(const T &rhs) {\\n// T rhs_inv = rhs.inv();\\n// for (int i = 0; i < v.size(); i++) v[i] *= rhs_inv;\\n// return *this;\\n// }\\n//\\n// friend fps operator+(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) += rhs;\\n// }\\n//\\n// friend fps operator-(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) -= rhs;\\n// }\\n//\\n// friend fps operator*(const fps &lhs, const fps &rhs) {\\n// return fps(lhs) *= rhs;\\n// }\\n//\\n// friend fps operator+(const fps &lhs, const T &rhs) { return fps(lhs) +=\\n// rhs; }\\n//\\n// friend fps operator-(const fps &lhs, const T &rhs) { return fps(lhs) -=\\n// rhs; }\\n//\\n// friend fps operator*(const fps &lhs, const T &rhs) { return fps(lhs) *=\\n// rhs; }\\n//\\n// friend fps operator/(const fps &lhs, const T &rhs) { return fps(lhs) /=\\n// rhs; }\\n//\\n// friend fps operator+(const T &lhs, const fps &rhs) { return fps(rhs) +=\\n// lhs; }\\n//\\n// friend fps operator-(const T &lhs, const fps &rhs) {\\n// return -(fps(rhs) -= lhs);\\n// }\\n//\\n// friend fps operator*(const T &lhs, const fps &rhs) { return fps(rhs) *=\\n// lhs; }\\n// };\\n\\n// using mint = atcoder::modint998244353;\\n// using mint = atcoder::modint1000000007;\\n\\n// using fs = factorials<mint>;\\n\\nstruct mokeke {\\n int N;\\n std::vector<int> score, parent, updated;\\n std::vector<std::vector<int>> children;\\n\\n mokeke(int N, int T)\\n : N(N), score(N), parent(N, -1), updated(N, T), children(N) {}\\n\\n int find(int a) {\\n while (parent[a] >= 0) {\\n a = parent[a];\\n }\\n\\n return a;\\n }\\n\\n void tick(int a, int t) {\\n score[a] -= parent[a] * (updated[a] - t);\\n updated[a] = t;\\n }\\n\\n void add_edge(int a, int b, int t) {\\n a = find(a);\\n b = find(b);\\n\\n if (a == b) return;\\n\\n int sa = -parent[a], sb = -parent[b];\\n\\n if (sa < sb) {\\n std::swap(a, b);\\n std::swap(sa, sb);\\n }\\n\\n tick(a, t);\\n tick(b, t);\\n\\n score[b] -= score[a];\\n parent[a] += parent[b];\\n parent[b] = a;\\n children[a].push_back(b);\\n }\\n\\n std::vector<ll> build() {\\n std::vector<ll> result(N);\\n\\n auto rec = [&](auto self, int v) -> void {\\n result[v] = score[v];\\n for (int w : children[v]) {\\n score[w] += score[v];\\n self(self, w);\\n }\\n };\\n\\n int a = find(0);\\n\\n tick(a, 0);\\n\\n rec(rec, a);\\n\\n return result;\\n }\\n};\\n\\nint main() {\\n int N, M, T;\\n std::cin >> N >> M >> T;\\n using tiii = std::tuple<int, int, int>;\\n std::vector<tiii> edges(M);\\n std::cin >> edges;\\n\\n std::sort(edges.begin(), edges.end(),\\n [](tiii a, tiii b) { return std::get<2>(a) > std::get<2>(b); });\\n\\n std::vector graph(N, std::vector<std::pair<int, int>>());\\n\\n for (auto &[a, b, t] : edges) {\\n a--;\\n b--;\\n graph[a].emplace_back(b, t);\\n graph[b].emplace_back(a, t);\\n }\\n\\n std::vector dist(N, T + 999);\\n std::queue<std::pair<int, int>> que;\\n dist[0] = 0;\\n que.emplace(0, 0);\\n\\n while (!que.empty()) {\\n auto [v, t] = que.front();\\n que.pop();\\n\\n if (t >= T) continue;\\n\\n for (auto [w, t2] : graph[v]) {\\n if (t >= t2) continue;\\n if (chmin(dist[w], t + 1)) {\\n que.emplace(w, t + 1);\\n }\\n }\\n }\\n\\n mokeke moke(N, T);\\n\\n for (auto [a, b, t] : edges) {\\n moke.add_edge(a, b, t);\\n }\\n\\n std::vector<ll> scores = moke.build();\\n\\n ll ans = 0;\\n\\n for (int i = 0; i < N; i++) {\\n if (dist[i] <= T) {\\n chmax(ans, scores[i]);\\n }\\n }\\n\\n std::cout << ans << std::endl;\\n\\n // for (auto [a, b, c] : edges) {\\n // std::cerr << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n // }\\n}\",\n \"accuracy\": 0.5531914893617021,\n \"time_ms\": 50,\n \"memory_kb\": 15100,\n \"score_of_the_acc\": -0.4953,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2813_9117791\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\nstruct dsu {\\n vector<int> parsz;\\n vector<ll> sum;\\n dsu (int _n, ll tot) : parsz(_n,-1), sum(_n,tot) {}\\n int leader(int v){\\n if (parsz[v] < 0) return v;\\n return leader(parsz[v]);\\n }\\n void merge(int u, int v, ll t){\\n u = leader(u);\\n v = leader(v);\\n if (u == v) return ;\\n if (-parsz[u] < -parsz[v]) swap(u,v);\\n // u <- v\\n ll lhs = sum[u] + (-parsz[v] * t);\\n ll rhs = sum[v] + (-parsz[u] * t);\\n parsz[u] += parsz[v];\\n parsz[v] = u;\\n sum[u] = max(lhs,rhs);\\n }\\n};\\n\\nvoid solve(){\\n int n, m, t; in(n,m,t);\\n vector<pii> es(m);\\n vector<ll> ts(m);\\n rep(i,m){\\n int u, v; in(u,v); u--, v--;\\n es[i] = pii(u,v);\\n in(ts[i]);\\n }\\n vector<int> ids(m); iota(all(ids),0);\\n sort(all(ids),[&](int l, int r){\\n return ts[l] > ts[r];\\n });\\n dsu d(n,t);\\n for (int i : ids){\\n d.merge(es[i].first,es[i].second,ts[i]);\\n }\\n out(d.sum[d.leader(0)]);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 0.9574468085106383,\n \"time_ms\": 40,\n \"memory_kb\": 7268,\n \"score_of_the_acc\": -0.1479,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2813_4123402\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <array>\\n#include <list>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\n#include <cassert>\\n#include <random>\\n#include <set>\\n\\nclass UnionFind {\\n\\tstd::vector<int> vec;\\npublic:\\n\\tUnionFind(int size) : vec(size, -1) {};\\n\\tint find(int a) {\\n\\t\\treturn vec[a] < 0 ? a : vec[a] = find(vec[a]);\\n\\t}\\n\\tbool same(int a, int b) {\\n\\t\\treturn find(a) == find(b);\\n\\t}\\n\\tint size_of(int a) {\\n\\t\\treturn -vec[find(a)];\\n\\t}\\n\\tvoid unite(int a, int b) {\\n\\t\\ta = find(a); b = find(b);\\n\\t\\tif (a != b) {\\n\\t\\t\\tif (vec[a] > vec[b]) std::swap(a, b);\\n\\t\\t\\tvec[a] += vec[b];\\n\\t\\t\\tvec[b] = a;\\n\\t\\t}\\n\\t}\\n};\\nstruct Bridge {\\n\\tint to, time;\\n};\\nstruct Bidirect {\\n\\tint a, b, time;\\n};\\nint main() {\\n\\tint n, m, t; std::cin >> n >> m >> t;\\n\\tstd::vector<Bidirect> bridges(m);\\n\\tstd::vector<std::vector<Bridge>> islands(n);\\n\\tfor (auto& bridge : bridges) {\\n\\t\\tstd::cin >> bridge.a >> bridge.b >> bridge.time;\\n\\t\\t--bridge.a; --bridge.b;\\n\\t\\tislands[bridge.a].push_back(Bridge{ bridge.b, bridge.time });\\n\\t\\tislands[bridge.b].push_back(Bridge{ bridge.a, bridge.time });\\n\\t}\\n\\tstd::vector<int> depth(n, INT_MAX); depth[0] = 0;\\n\\tstd::queue<int> queue; queue.push(0);\\n\\twhile (!queue.empty()) {\\n\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\tfor (const auto bridge : islands[top]) if (bridge.time > depth[top] && depth[bridge.to] == INT_MAX) {\\n\\t\\t\\tdepth[bridge.to] = depth[top] + 1;\\n\\t\\t\\tqueue.push(bridge.to);\\n\\t\\t}\\n\\t}\\n\\tstd::vector<long long int> sum_score(n, 0);\\n\\tstd::vector<int> last_changed(n, t), max_position(n); std::iota(max_position.begin(), max_position.end(), 0);\\n\\tstd::sort(bridges.rbegin(), bridges.rend(), [](const Bidirect a, const Bidirect b) {return a.time < b.time; });\\n\\tUnionFind uft(n);\\n\\tfor (const auto bridge : bridges) {\\n\\t\\tif (uft.same(bridge.a, bridge.b)) continue;\\n\\t\\tconst auto a_max = max_position[uft.find(bridge.a)];\\n\\t\\tconst auto b_max = max_position[uft.find(bridge.b)];\\n\\t\\tconst long long int a_max_size = uft.size_of(bridge.a);\\n\\t\\tconst long long int b_max_size = uft.size_of(bridge.b);\\n\\t\\tsum_score[a_max] += a_max_size * (last_changed[a_max] - bridge.time);\\n\\t\\tsum_score[b_max] += b_max_size * (last_changed[b_max] - bridge.time);\\n\\t\\tif (depth[a_max] > t) sum_score[a_max] = 0;\\n\\t\\tif (depth[b_max] > t) sum_score[b_max] = 0;\\n\\t\\tuft.unite(bridge.a, bridge.b);\\n\\t\\tconst auto new_root = uft.find(bridge.a);\\n\\t\\tif (sum_score[a_max] > sum_score[b_max]) {\\n\\t\\t\\tmax_position[new_root] = a_max;\\n\\t\\t\\tlast_changed[a_max] = bridge.time;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmax_position[new_root] = b_max;\\n\\t\\t\\tlast_changed[b_max] = bridge.time;\\n\\t\\t}\\n\\t}\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tconst auto max = max_position[uft.find(i)];\\n\\t\\tsum_score[max] += uft.size_of(max) * (last_changed[max] - 0LL);\\n\\t\\tif (depth[max] > t) sum_score[max] = 0;\\n\\t\\tlast_changed[max] = 0;\\n\\t}\\n\\tstd::cout << *std::max_element(sum_score.begin(), sum_score.end()) << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 16268,\n \"score_of_the_acc\": -1.1854,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2813_4123392\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <array>\\n#include <list>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\n#include <cassert>\\n#include <random>\\n#include <set>\\n\\nclass UnionFind {\\n\\tstd::vector<int> vec;\\npublic:\\n\\tUnionFind(int size) : vec(size, -1) {};\\n\\tint find(int a) {\\n\\t\\treturn vec[a] < 0 ? a : vec[a] = find(vec[a]);\\n\\t}\\n\\tbool same(int a, int b) {\\n\\t\\treturn find(a) == find(b);\\n\\t}\\n\\tint size_of(int a) {\\n\\t\\treturn -vec[find(a)];\\n\\t}\\n\\tvoid unite(int a, int b) {\\n\\t\\ta = find(a); b = find(b);\\n\\t\\tif (a != b) {\\n\\t\\t\\tif (vec[a] > vec[b]) std::swap(a, b);\\n\\t\\t\\tvec[a] += vec[b];\\n\\t\\t\\tvec[b] = a;\\n\\t\\t}\\n\\t}\\n};\\nstruct Bridge {\\n\\tint to, time;\\n};\\nstruct Bidirect {\\n\\tint a, b, time;\\n};\\nint main() {\\n\\tint n, m, t; std::cin >> n >> m >> t;\\n\\tstd::vector<Bidirect> bridges(m);\\n\\tstd::vector<std::vector<Bridge>> islands(n);\\n\\tfor (auto& bridge : bridges) {\\n\\t\\tstd::cin >> bridge.a >> bridge.b >> bridge.time;\\n\\t\\t--bridge.a; --bridge.b;\\n\\t\\tislands[bridge.a].push_back(Bridge{ bridge.b, bridge.time });\\n\\t\\tislands[bridge.b].push_back(Bridge{ bridge.a, bridge.time });\\n\\t}\\n\\tstd::vector<int> depth(n, -1); depth[0] = 0;\\n\\tstd::queue<int> queue; queue.push(0);\\n\\twhile (!queue.empty()) {\\n\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\tfor (const auto bridge : islands[top]) if (bridge.time > depth[top] && depth[bridge.to] == -1) {\\n\\t\\t\\tdepth[bridge.to] = depth[top] + 1;\\n\\t\\t\\tqueue.push(bridge.to);\\n\\t\\t}\\n\\t}\\n\\tstd::vector<long long int> sum_score(n, 0);\\n\\tstd::vector<int> last_changed(n, t), max_position(n); std::iota(max_position.begin(), max_position.end(), 0);\\n\\tstd::sort(bridges.rbegin(), bridges.rend(), [](const Bidirect a, const Bidirect b) {return a.time < b.time; });\\n\\tUnionFind uft(n);\\n\\tfor (const auto bridge : bridges) {\\n\\t\\tif (uft.same(bridge.a, bridge.b)) continue;\\n\\t\\tconst auto a_max = max_position[uft.find(bridge.a)];\\n\\t\\tconst auto b_max = max_position[uft.find(bridge.b)];\\n\\t\\tconst long long int a_max_size = uft.size_of(bridge.a);\\n\\t\\tconst long long int b_max_size = uft.size_of(bridge.b);\\n\\t\\tsum_score[a_max] += a_max_size * (last_changed[a_max] - bridge.time);\\n\\t\\tsum_score[b_max] += b_max_size * (last_changed[b_max] - bridge.time);\\n\\t\\tuft.unite(bridge.a, bridge.b);\\n\\t\\tconst auto new_root = uft.find(bridge.a);\\n\\t\\tif (sum_score[a_max] > sum_score[b_max]) {\\n\\t\\t\\tmax_position[new_root] = a_max;\\n\\t\\t\\tlast_changed[a_max] = bridge.time;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmax_position[new_root] = b_max;\\n\\t\\t\\tlast_changed[b_max] = bridge.time;\\n\\t\\t}\\n\\t}\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tconst auto max = max_position[uft.find(i)];\\n\\t\\tsum_score[max] += uft.size_of(max) * (last_changed[max] - 0LL);\\n\\t\\tlast_changed[max] = 0;\\n\\t}\\n\\tstd::cout << *std::max_element(sum_score.begin(), sum_score.end()) << std::endl;\\n}\",\n \"accuracy\": 0.9574468085106383,\n \"time_ms\": 130,\n \"memory_kb\": 13380,\n \"score_of_the_acc\": -0.9025,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2813_4123388\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <array>\\n#include <list>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\n#include <cassert>\\n#include <random>\\n#include <set>\\n\\nclass UnionFind {\\n\\tstd::vector<int> vec;\\npublic:\\n\\tUnionFind(int size) : vec(size, -1) {};\\n\\tint find(int a) {\\n\\t\\treturn vec[a] < 0 ? a : vec[a] = find(vec[a]);\\n\\t}\\n\\tbool same(int a, int b) {\\n\\t\\treturn find(a) == find(b);\\n\\t}\\n\\tint size_of(int a) {\\n\\t\\treturn -vec[find(a)];\\n\\t}\\n\\tvoid unite(int a, int b) {\\n\\t\\ta = find(a); b = find(b);\\n\\t\\tif (a != b) {\\n\\t\\t\\tif (vec[a] > vec[b]) std::swap(a, b);\\n\\t\\t\\tvec[a] += vec[b];\\n\\t\\t\\tvec[b] = a;\\n\\t\\t}\\n\\t}\\n};\\nstruct Bridge {\\n\\tint to, time;\\n};\\nstruct Bidirect {\\n\\tint a, b, time;\\n};\\nint main() {\\n\\tint n, m, t; std::cin >> n >> m >> t;\\n\\tstd::vector<Bidirect> bridges(m);\\n\\tstd::vector<std::vector<Bridge>> islands(n);\\n\\tfor (auto& bridge : bridges) {\\n\\t\\tstd::cin >> bridge.a >> bridge.b >> bridge.time;\\n\\t\\t--bridge.a; --bridge.b;\\n\\t\\tislands[bridge.a].push_back(Bridge{ bridge.b, bridge.time });\\n\\t\\tislands[bridge.b].push_back(Bridge{ bridge.a, bridge.time });\\n\\t}\\n\\tstd::vector<int> depth(n, -1); depth[0] = 0;\\n\\tstd::queue<int> queue; queue.push(0);\\n\\twhile (!queue.empty()) {\\n\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\tfor (const auto bridge : islands[top]) if (bridge.time > depth[top] && depth[bridge.to] == -1) {\\n\\t\\t\\tdepth[bridge.to] = depth[top] + 1;\\n\\t\\t\\tqueue.push(bridge.to);\\n\\t\\t}\\n\\t}\\n\\tstd::vector<long long int> sum_score(n, 0);\\n\\tstd::vector<int> last_changed(n, t), max_position(n); std::iota(max_position.begin(), max_position.end(), 0);\\n\\tstd::sort(bridges.rbegin(), bridges.rend(), [](const Bidirect a, const Bidirect b) {return a.time < b.time; });\\n\\tUnionFind uft(n);\\n\\tfor (const auto bridge : bridges) {\\n\\t\\tif (uft.same(bridge.a, bridge.b)) continue;\\n\\t\\tconst auto a_max = max_position[uft.find(bridge.a)];\\n\\t\\tconst auto b_max = max_position[uft.find(bridge.b)];\\n\\t\\tconst long long int a_max_size = uft.size_of(bridge.a);\\n\\t\\tconst long long int b_max_size = uft.size_of(bridge.b);\\n\\t\\tsum_score[a_max] += a_max_size * (last_changed[a_max] - bridge.time);\\n\\t\\tsum_score[b_max] += b_max_size * (last_changed[b_max] - bridge.time);\\n\\t\\tuft.unite(bridge.a, bridge.b);\\n\\t\\tconst auto new_root = uft.find(bridge.a);\\n\\t\\tif (sum_score[a_max] > sum_score[b_max]) {\\n\\t\\t\\tmax_position[new_root] = a_max;\\n\\t\\t\\tlast_changed[a_max] = bridge.time;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmax_position[new_root] = b_max;\\n\\t\\t\\tlast_changed[b_max] = bridge.time;\\n\\t\\t}\\n\\t}\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tconst auto max = max_position[uft.find(i)];\\n\\t\\tsum_score[max] += uft.size_of(max) * (last_changed[max] - 0);\\n\\t\\tlast_changed[max] = 0;\\n\\t}\\n\\tstd::cout << *std::max_element(sum_score.begin(), sum_score.end()) << std::endl;\\n}\",\n \"accuracy\": 0.9574468085106383,\n \"time_ms\": 130,\n \"memory_kb\": 13252,\n \"score_of_the_acc\": -0.8978,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2813_3991872\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\nusing PP = pair<ll, PII>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\nconst ll INF = 1LL << 60;\\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\\nvector<PII> G[300000];\\nint cnt[300000];\\nint dist[300000];\\nstruct UnionFind {\\n\\tvector<int> par;\\n\\tvector<int> rank;\\n\\tvector<int> cnt;\\n\\tUnionFind(int n) {\\n\\t\\tpar.resize(n);\\n\\t\\tfor (int i = 0; i < n; i++) par[i] = i;\\n\\t\\trank.resize(n);\\n\\t\\tcnt.resize(n);\\n\\t}\\n\\tint find(int x) {\\n\\t\\tif (x == par[x]) return x;\\n\\t\\treturn par[x] = find(par[x]);\\n\\t}\\n\\tbool same(int x, int y) {\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n\\tvoid unite(int x, int 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\\tpar[x] = y;\\n\\t\\t\\tcnt[y] += cnt[x];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpar[y] = x;\\n\\t\\t\\tcnt[x] += cnt[y];\\n\\t\\t\\tif (rank[x] == rank[y]) rank[x]++;\\n\\t\\t}\\n\\t}\\n};\\nint main() {\\n\\tint N, M, T;\\n\\tcin >> N >> M >> T;\\n\\tvector<PP> edge;\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tint a, b, t;\\n\\t\\tcin >> a >> b >> t;\\n\\t\\ta--; b--;\\n\\t\\tedge.emplace_back(t, PII(a, b));\\n\\t\\tG[a].emplace_back(b, t);\\n\\t\\tG[b].emplace_back(a, t);\\n\\t}\\n\\tqueue<int> Q;\\n\\tfill((int*)dist, (int*)(dist + N), 1 << 30);\\n\\tdist[0] = -1;\\n\\tQ.push(0);\\n\\twhile (!Q.empty()) {\\n\\t\\tint v = Q.front(); Q.pop();\\n\\t\\tfor (PII e : G[v]) {\\n\\t\\t\\tint to = e.first;\\n\\t\\t\\tif (dist[to] == 1 << 30 && dist[v] < e.second - 1) {\\n\\t\\t\\t\\tdist[to] = dist[v] + 1;\\n\\t\\t\\t\\tQ.push(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(edge.begin(), edge.end(), greater<PP>());\\n\\tUnionFind U(N + M);\\n\\tvector<ll> score(N + M);\\n\\tvector<ll> tim(N + M);\\n\\tfor (int i = 0; i < N; i++) U.cnt[i] = 1;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (dist[i] == 1 << 30) {\\n\\t\\t\\tscore[i] = -(1LL << 60);\\n\\t\\t}\\n\\t\\ttim[i] = T;\\n\\t}\\n\\tint k = N;\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tint s = edge[i].second.first;\\n\\t\\tint t = edge[i].second.second;\\n\\t\\tif (U.same(s, t)) continue;\\n\\t\\ts = U.find(s);\\n\\t\\tt = U.find(t);\\n\\t\\tll ss = max(score[s] + (tim[s] - edge[i].first)*U.cnt[s], score[t] + (tim[t] - edge[i].first)*U.cnt[t]);\\n\\t\\tU.unite(k, s);\\n\\t\\tU.unite(k, t);\\n\\t\\ttim[U.find(k)] = edge[i].first;\\n\\t\\tscore[U.find(k)] = ss;\\n\\t\\tk++;\\n\\t}\\n\\tcout << score[U.find(k - 1)] + N*tim[U.find(k - 1)] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 33584,\n \"score_of_the_acc\": -2,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2813_2866434\",\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 MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n#define NUM 100000\\n\\nstruct Edge{\\n\\tEdge(int arg_from,int arg_to,int arg_time){\\n\\t\\tfrom = arg_from;\\n\\t\\tto = arg_to;\\n\\t\\ttime = arg_time;\\n\\t}\\n\\tbool operator<(const struct Edge &arg) const{ //時刻の降順(PQ)\\n\\t\\treturn time < arg.time;\\n\\t}\\n\\n\\tint from,to,time;\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_node_id,int arg_sum_dist){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tsum_dist = arg_sum_dist;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{ //総移動距離の昇順(PQ)\\n\\t\\treturn sum_dist > arg.sum_dist;\\n\\t}\\n\\n\\tint node_id,sum_dist;\\n};\\n\\nstruct Data{\\n\\tData(int arg_to,int arg_limit_time){\\n\\t\\tto = arg_to;\\n\\t\\tlimit_time = arg_limit_time;\\n\\t}\\n\\tint to,limit_time;\\n};\\n\\nint N;\\nint M;\\nll T;\\nint boss[NUM];\\nll pre_time[NUM],member_num[NUM];\\nint min_dist[NUM]; //★時刻0の時点で頂点1にいる!!★\\nvector<Data> G[NUM];\\nll value[NUM];\\n\\nint get_boss(int id){\\n\\tif(id == boss[id])return id;\\n\\telse{\\n\\t\\treturn boss[id] = get_boss(boss[id]);\\n\\t}\\n}\\n\\nvoid unite(int x,int y,int unite_time){\\n\\tint x_boss_id = get_boss(x);\\n\\tint y_boss_id = get_boss(y);\\n\\n\\tif(x_boss_id == y_boss_id){ //同じグループ\\n\\n\\t\\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\\n\\t\\tpre_time[x_boss_id] = unite_time;\\n\\n\\t}else{ //違うグループ\\n\\n\\t\\tif(min_dist[x_boss_id] >= T && min_dist[y_boss_id] >= T){\\n\\n\\t\\t\\t//とりあえずxに吸収しておく\\n\\t\\t\\tboss[y_boss_id] = x_boss_id;\\n\\t\\t\\tmember_num[x_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\\n\\n\\t\\t}else if(min_dist[x_boss_id] <= T-1 && min_dist[y_boss_id] >= T){ //x_boss_idのみ、時刻T-1で辿り着ける\\n\\n\\t\\t\\t//元々x_boss_idにいたことにする\\n\\t\\t\\tboss[y_boss_id] = x_boss_id;\\n\\t\\t\\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\\n\\t\\t\\tpre_time[x_boss_id] = unite_time;\\n\\t\\t\\tmember_num[x_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\\n\\n\\t\\t}else if(min_dist[x_boss_id] >= T && min_dist[y_boss_id] <= T-1){\\n\\n\\t\\t\\t//元々y_boss_idにいたことにする\\n\\t\\t\\tboss[x_boss_id] = y_boss_id;\\n\\t\\t\\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\\n\\t\\t\\tpre_time[y_boss_id] = unite_time;\\n\\t\\t\\tmember_num[y_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\\n\\n\\t\\t}else{ //両方、時刻Tの時点で辿り着ける\\n\\n\\t\\t\\t//それぞれのグループの、unite直前でのvalueを計算する\\n\\t\\t\\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\\n\\t\\t\\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\\n\\n\\t\\t\\tint new_boss_id;\\n\\t\\t\\t//これから先辿る未来は同じなので、有利な過去を選ぶ(元々valueが大きなグループにいたことにする)\\n\\t\\t\\tif(value[x_boss_id] >= value[y_boss_id]){\\n\\t\\t\\t\\tboss[y_boss_id] = x_boss_id;\\n\\t\\t\\t\\tnew_boss_id = x_boss_id;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tboss[x_boss_id] = y_boss_id;\\n\\t\\t\\t\\tnew_boss_id = y_boss_id;\\n\\t\\t\\t}\\n\\t\\t\\tpre_time[new_boss_id] = unite_time;\\n\\t\\t\\tmember_num[new_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid dijkstra(){\\n\\tmin_dist[0] = 0;\\n\\tfor(int i = 1; i < N; i++)min_dist[i] = BIG_NUM;\\n\\n\\tpriority_queue<Info> Q;\\n\\tQ.push(Info(0,0));\\n\\n\\tint next_node,next_dist;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_dist > min_dist[Q.top().node_id]){\\n\\t\\t\\tQ.pop();\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\\n\\n\\t\\t\\t\\tnext_node = G[Q.top().node_id][i].to;\\n\\t\\t\\t\\tnext_dist = Q.top().sum_dist+1;\\n\\n\\t\\t\\t\\tif(next_dist > G[Q.top().node_id][i].limit_time+1)continue; //★その時間までにエッジが消えていたら行けない★\\n\\n\\t\\t\\t\\tif(min_dist[next_node] > next_dist){\\n\\t\\t\\t\\t\\tmin_dist[next_node] = next_dist;\\n\\t\\t\\t\\t\\tQ.push(Info(next_node,next_dist));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d\\\",&N,&M,&T);\\n\\n\\tint from,to,time;\\n\\tpriority_queue<Edge> Q;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\t\\tscanf(\\\"%d %d %d\\\",&from,&to,&time);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\ttime--; //★timeに消えるので、時間を逆に回すと、time-1に発生する★\\n\\t\\tQ.push(Edge(from,to,time));\\n\\t\\tG[from].push_back(Data(to,time));\\n\\t\\tG[to].push_back(Data(from,time));\\n\\t}\\n\\n\\tdijkstra();\\n\\n\\tint debug = 0;\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(min_dist[i] == BIG_NUM)debug++;\\n\\t}\\n\\n\\t//情報の初期化\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tboss[i] = i;\\n\\t\\tpre_time[i] = T-1;\\n\\t\\tmember_num[i] = 1;\\n\\t\\tvalue[i] = 0;\\n\\t}\\n\\n\\twhile(!Q.empty()){ //時間を逆向きに回す(★一度uniteされたら、以後は運命を共にするイメージ★)\\n\\t\\tunite(Q.top().from,Q.top().to,Q.top().time);\\n\\t\\tQ.pop();\\n\\t}\\n\\n\\tll ans = 0;\\n\\tint boss_id;\\n\\n\\t//最終計算\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tboss_id = get_boss(i);\\n\\t\\tif(boss_id != i)continue; //ボス以外はSKIP\\n\\t\\tif(min_dist[boss_id] >= T)continue;//時刻T-1の時点でそのノードにいられないならcontinue\\n\\t\\tvalue[boss_id] += (pre_time[boss_id]-0+1)*member_num[boss_id]; //★最後のみ、現在時刻(0)を含む\\n\\t\\tans = max(ans,value[boss_id]);\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 17584,\n \"score_of_the_acc\": -0.881,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2813_2866425\",\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 MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n#define NUM 100000\\n\\nstruct Edge{\\n\\tEdge(int arg_from,int arg_to,int arg_time){\\n\\t\\tfrom = arg_from;\\n\\t\\tto = arg_to;\\n\\t\\ttime = arg_time;\\n\\t}\\n\\tbool operator<(const struct Edge &arg) const{ //時刻の降順(PQ)\\n\\t\\treturn time < arg.time;\\n\\t}\\n\\n\\tint from,to,time;\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_node_id,int arg_sum_dist){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tsum_dist = arg_sum_dist;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{ //総移動距離の昇順(PQ)\\n\\t\\treturn sum_dist > arg.sum_dist;\\n\\t}\\n\\n\\tint node_id,sum_dist;\\n};\\n\\nstruct Data{\\n\\tData(int arg_to,int arg_limit_time){\\n\\t\\tto = arg_to;\\n\\t\\tlimit_time = arg_limit_time;\\n\\t}\\n\\tint to,limit_time;\\n};\\n\\nint N;\\nint M,T;\\nint boss[NUM];\\nint pre_time[NUM],member_num[NUM];\\nint min_dist[NUM]; //★時刻0の時点で頂点1にいる!!★\\nvector<Data> G[NUM];\\nll value[NUM];\\n\\nint get_boss(int id){\\n\\tif(id == boss[id])return id;\\n\\telse{\\n\\t\\treturn boss[id] = get_boss(boss[id]);\\n\\t}\\n}\\n\\nvoid unite(int x,int y,int unite_time){\\n\\tint x_boss_id = get_boss(x);\\n\\tint y_boss_id = get_boss(y);\\n\\n\\tif(x_boss_id == y_boss_id){ //同じグループ\\n\\n\\t\\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\\n\\t\\tpre_time[x_boss_id] = unite_time;\\n\\n\\t}else{ //違うグループ\\n\\n\\t\\tif(min_dist[x_boss_id] >= T && min_dist[y_boss_id] >= T){\\n\\n\\t\\t\\t//とりあえずxに吸収しておく\\n\\t\\t\\tboss[y_boss_id] = x_boss_id;\\n\\t\\t\\tmember_num[x_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\\n\\n\\t\\t}else if(min_dist[x_boss_id] <= T-1 && min_dist[y_boss_id] >= T){ //x_boss_idのみ、時刻T-1で辿り着ける\\n\\n\\t\\t\\t//元々x_boss_idにいたことにする\\n\\t\\t\\tboss[y_boss_id] = x_boss_id;\\n\\t\\t\\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\\n\\t\\t\\tpre_time[x_boss_id] = unite_time;\\n\\t\\t\\tmember_num[x_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\\n\\n\\t\\t}else if(min_dist[x_boss_id] >= T && min_dist[y_boss_id] <= T-1){\\n\\n\\t\\t\\t//元々y_boss_idにいたことにする\\n\\t\\t\\tboss[x_boss_id] = y_boss_id;\\n\\t\\t\\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\\n\\t\\t\\tpre_time[y_boss_id] = unite_time;\\n\\t\\t\\tmember_num[y_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\\n\\n\\t\\t}else{ //両方、時刻Tの時点で辿り着ける\\n\\n\\t\\t\\t//それぞれのグループの、unite直前でのvalueを計算する\\n\\t\\t\\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\\n\\t\\t\\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\\n\\n\\t\\t\\tint new_boss_id;\\n\\t\\t\\t//これから先辿る未来は同じなので、有利な過去を選ぶ(元々valueが大きなグループにいたことにする)\\n\\t\\t\\tif(value[x_boss_id] >= value[y_boss_id]){\\n\\t\\t\\t\\tboss[y_boss_id] = x_boss_id;\\n\\t\\t\\t\\tnew_boss_id = x_boss_id;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tboss[x_boss_id] = y_boss_id;\\n\\t\\t\\t\\tnew_boss_id = y_boss_id;\\n\\t\\t\\t}\\n\\t\\t\\tpre_time[new_boss_id] = unite_time;\\n\\t\\t\\tmember_num[new_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid dijkstra(){\\n\\tmin_dist[0] = 0;\\n\\tfor(int i = 1; i < N; i++)min_dist[i] = BIG_NUM;\\n\\n\\tpriority_queue<Info> Q;\\n\\tQ.push(Info(0,0));\\n\\n\\tint next_node,next_dist;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_dist > min_dist[Q.top().node_id]){\\n\\t\\t\\tQ.pop();\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\\n\\n\\t\\t\\t\\tnext_node = G[Q.top().node_id][i].to;\\n\\t\\t\\t\\tnext_dist = Q.top().sum_dist+1;\\n\\n\\t\\t\\t\\tif(next_dist > G[Q.top().node_id][i].limit_time+1)continue; //★その時間までにエッジが消えていたら行けない★\\n\\n\\t\\t\\t\\tif(min_dist[next_node] > next_dist){\\n\\t\\t\\t\\t\\tmin_dist[next_node] = next_dist;\\n\\t\\t\\t\\t\\tQ.push(Info(next_node,next_dist));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d\\\",&N,&M,&T);\\n\\n\\tint from,to,time;\\n\\tpriority_queue<Edge> Q;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\t\\tscanf(\\\"%d %d %d\\\",&from,&to,&time);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\ttime--; //★timeに消えるので、時間を逆に回すと、time-1に発生する★\\n\\t\\tQ.push(Edge(from,to,time));\\n\\t\\tG[from].push_back(Data(to,time));\\n\\t\\tG[to].push_back(Data(from,time));\\n\\t}\\n\\n\\tdijkstra();\\n\\n\\t//情報の初期化\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tboss[i] = i;\\n\\t\\tpre_time[i] = T-1;\\n\\t\\tmember_num[i] = 1;\\n\\t\\tvalue[i] = 0;\\n\\t}\\n\\n\\twhile(!Q.empty()){ //時間を逆向きに回す(★一度uniteされたら、以後は運命を共にするイメージ★)\\n\\t\\tunite(Q.top().from,Q.top().to,Q.top().time);\\n\\t\\tQ.pop();\\n\\t}\\n\\n\\tll ans = 0;\\n\\tint boss_id;\\n\\n\\t//最終計算\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tboss_id = get_boss(i);\\n\\t\\tif(boss_id != i)continue; //ボス以外はSKIP\\n\\t\\tif(min_dist[boss_id] >= T)continue;//時刻T-1の時点でそのノードにいられないならcontinue\\n\\t\\tvalue[boss_id] += (pre_time[boss_id]-0+1)*member_num[boss_id]; //★最後のみ、現在時刻(0)を含む\\n\\t\\tans = max(ans,value[boss_id]);\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.9787234042553191,\n \"time_ms\": 90,\n \"memory_kb\": 16688,\n \"score_of_the_acc\": -0.7891,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2813_2866312\",\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 MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n#define NUM 100000\\n\\nstruct Edge{\\n\\tEdge(int arg_from,int arg_to,int arg_time){\\n\\t\\tfrom = arg_from;\\n\\t\\tto = arg_to;\\n\\t\\ttime = arg_time;\\n\\t}\\n\\tbool operator<(const struct Edge &arg) const{ //時刻の降順(PQ)\\n\\t\\treturn time < arg.time;\\n\\t}\\n\\n\\tint from,to,time;\\n};\\n\\nint N;\\nint boss[NUM];\\nint pre_time[NUM],member_num[NUM];\\nll value[NUM];\\n\\nint get_boss(int id){\\n\\tif(id == boss[id])return id;\\n\\telse{\\n\\t\\treturn boss[id] = get_boss(boss[id]);\\n\\t}\\n}\\n\\nvoid unite(int x,int y,int unite_time){\\n\\tint x_boss_id = get_boss(x);\\n\\tint y_boss_id = get_boss(y);\\n\\n\\tif(x_boss_id == y_boss_id){ //同じグループ\\n\\n\\t\\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\\n\\t\\tpre_time[x_boss_id] = unite_time;\\n\\n\\t}else{\\n\\n\\t\\t//それぞれのグループの、unite直前でのvalueを計算する\\n\\t\\tvalue[x_boss_id] += (pre_time[x_boss_id]-unite_time)*member_num[x_boss_id];\\n\\t\\tvalue[y_boss_id] += (pre_time[y_boss_id]-unite_time)*member_num[y_boss_id];\\n\\n\\t\\tint new_boss_id;\\n\\t\\t//これから先辿る未来は同じなので、有利な過去を選ぶ(元々valueが大きなグループにいたことにする)\\n\\t\\tif(value[x_boss_id] >= value[y_boss_id]){\\n\\t\\t\\tboss[y_boss_id] = x_boss_id;\\n\\t\\t\\tnew_boss_id = x_boss_id;\\n\\t\\t}else{\\n\\t\\t\\tboss[x_boss_id] = y_boss_id;\\n\\t\\t\\tnew_boss_id = y_boss_id;\\n\\t\\t}\\n\\t\\tpre_time[new_boss_id] = unite_time;\\n\\t\\tmember_num[new_boss_id] = member_num[x_boss_id]+member_num[y_boss_id];\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint M,T;\\n\\tscanf(\\\"%d %d %d\\\",&N,&M,&T);\\n\\n\\tint from,to,time;\\n\\tpriority_queue<Edge> Q;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\t\\tscanf(\\\"%d %d %d\\\",&from,&to,&time);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\ttime--; //★timeに消えるので、時間を逆に回すと、time-1に発生する★\\n\\t\\tQ.push(Edge(from,to,time));\\n\\t}\\n\\n\\t//情報の初期化\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tboss[i] = i;\\n\\t\\tpre_time[i] = T-1;\\n\\t\\tmember_num[i] = 1;\\n\\t\\tvalue[i] = 0;\\n\\t}\\n\\n\\twhile(!Q.empty()){ //時間を逆向きに回す(★一度uniteされたら、以後は運命を共にするイメージ★)\\n\\t\\tunite(Q.top().from,Q.top().to,Q.top().time);\\n\\t\\tQ.pop();\\n\\t}\\n\\n\\tll ans = 0;\\n\\tint boss_id;\\n\\n\\t//最終計算\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tboss_id = get_boss(i);\\n\\t\\tif(boss_id != i)continue; //ボス以外はSKIP\\n\\t\\tvalue[boss_id] += (pre_time[boss_id]-0+1)*member_num[boss_id]; //★最後のみ、現在時刻(0)を含む\\n\\t\\tans = max(ans,value[boss_id]);\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.9574468085106383,\n \"time_ms\": 60,\n \"memory_kb\": 6448,\n \"score_of_the_acc\": -0.2353,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2813_2392464\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__\\\",\\\", __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 2147483600\\n\\nclass UnionFind {\\npublic:\\n vector<int> par, rank; // parent(negative := its root and abs-value is its size), depth\\n UnionFind(int sz) : par(sz, -1), rank(sz, 0){}\\n int find(int x){\\n if(par[x]<0) return x;\\n else return par[x] = find(par[x]);\\n }\\n void unite(int x, int y){\\n x=find(x); y=find(y);\\n if(x==y) return; // already belong to same tree\\n if(rank[x] < rank[y]){ // y becomes parent node\\n par[y] += par[x];\\n par[x] = y;\\n } else { // x becomes parent node\\n par[x] += par[y];\\n par[y] = x;\\n if(rank[x]==rank[y]) rank[x]++;\\n }\\n }\\n bool same(int x, int y){ return find(x) == find(y); }\\n int size(int x){ return -par[find(x)]; }\\n};\\n\\nint main(){\\n int n,m,T;\\n cin>>n>>m>>T;\\n vector<vector<pair<int,int>>> vec(n);\\n vector<pair<int,pair<int,int>>> edge(m);\\n rep(i,m){\\n int a,b,t;\\n cin>>a>>b>>t;\\n a--;b--;\\n vec[a].pb(mp(b,t));\\n vec[b].pb(mp(a,t));\\n edge[i] = mp(t,mp(a,b));\\n }\\n\\n vector<int> d(n,INF);\\n d[0]=0;\\n queue<int> q;\\n q.push(0);\\n while(!q.empty()){\\n int v = q.front(); q.pop();\\n int dis = d[v];\\n for(auto to : vec[v]){\\n if(to.se <= dis) continue;\\n if(d[to.fi] <= dis+1) continue;\\n d[to.first] = dis+1;\\n q.push(to.first);\\n }\\n }\\n\\n sort(all(edge)); reverse(all(edge));\\n UnionFind uf(n);\\n\\n vector<long> maxval(n,0), lastvisit(n,T);\\n rep(i,n) if(d[i]<INF) maxval[i]=1;\\n\\n auto getlazy = [&](int x, int t){\\n int node = uf.find(x);\\n if(maxval[node]==0) return 0L;\\n else if(lastvisit[node]==t) return maxval[node];\\n else {\\n long add = (lastvisit[node]-t)*uf.size(x);\\n return maxval[node] + add;\\n }\\n };\\n\\n rep(i,m){\\n int u = edge[i].se.fi, v = edge[i].se.se;\\n int t = edge[i].fi;\\n if(uf.same(u,v)) continue;\\n else if(t==T){\\n bool visitable = true;\\n if(maxval[uf.find(u)] == 0 && maxval[uf.find(v)]==0) visitable=false;\\n uf.unite(u,v);\\n if(visitable) maxval[uf.find(u)] = uf.size(u);\\n }\\n else {\\n long lu = getlazy(u, t), lv = getlazy(v, t);\\n if(lu==0 && lv==0){ uf.unite(u,v); continue; }\\n if(lu>0) lu += uf.size(v);\\n if(lv>0) lv += uf.size(u);\\n uf.unite(u,v);\\n maxval[uf.find(u)] = max<long>(lu,lv);\\n lastvisit[uf.find(u)] = t; //dbg(uf.find(u), maxval[uf.find(u)]);\\n }\\n }\\n\\n cout << getlazy(0, 1) << endl;\\n assert(getlazy(0,1)>0);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 16408,\n \"score_of_the_acc\": -1.2494,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2813_2392450\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__\\\",\\\", __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 2147483600\\n\\nclass UnionFind {\\npublic:\\n vector<int> par, rank; // parent(negative := its root and abs-value is its size), depth\\n UnionFind(int sz) : par(sz, -1), rank(sz, 0){}\\n int find(int x){\\n if(par[x]<0) return x;\\n else return par[x] = find(par[x]);\\n }\\n void unite(int x, int y){\\n x=find(x); y=find(y);\\n if(x==y) return; // already belong to same tree\\n if(rank[x] < rank[y]){ // y becomes parent node\\n par[y] += par[x];\\n par[x] = y;\\n } else { // x becomes parent node\\n par[x] += par[y];\\n par[y] = x;\\n if(rank[x]==rank[y]) rank[x]++;\\n }\\n }\\n bool same(int x, int y){ return find(x) == find(y); }\\n int size(int x){ return -par[find(x)]; }\\n};\\n\\nint main(){\\n int n,m,T;\\n cin>>n>>m>>T;\\n vector<vector<pair<int,int>>> vec(n);\\n vector<pair<int,pair<int,int>>> edge(m);\\n rep(i,m){\\n int a,b,t;\\n cin>>a>>b>>t;\\n a--;b--;\\n vec[a].pb(mp(b,t));\\n vec[b].pb(mp(a,t));\\n edge[i] = mp(t,mp(a,b));\\n }\\n\\n // dijkstra??§??°?????????????????????\\n vector<int> d(n,INF);\\n using P = pair<int,int>;\\n priority_queue<P, vector<P>, greater<P>> pq;\\n pq.push(mp(0,0));\\n d[0]=0;\\n while(!pq.empty()){\\n auto p = pq.top(); pq.pop();\\n int v = p.second;\\n int dis = p.first;\\n if(d[v] < dis) continue;\\n for(auto to : vec[v]){\\n if(to.se <= dis) continue;\\n if(d[to.first] <= dis+1) continue;\\n d[to.first] = dis+1;\\n pq.push(mp(dis+1, to.first));\\n }\\n }\\n\\n // d[i]<INF ????????°?????????\\n\\n sort(all(edge)); reverse(all(edge));\\n UnionFind uf(n);\\n\\n vector<long> maxval(n,0);\\n vector<int> lastvisit(n,T);\\n rep(i,n) if(d[i]<INF) maxval[i]=1;\\n\\n auto getlazy = [&](int x, int t){\\n int node = uf.find(x);\\n if(maxval[node]==0) return 0L;\\n else if(lastvisit[node]==t) return maxval[node];\\n else {\\n long add = (long)(lastvisit[node]-t)*uf.size(x);\\n return maxval[node] + add;\\n }\\n };\\n\\n rep(i,m){\\n int u = edge[i].se.fi, v = edge[i].se.se;\\n int t = edge[i].fi;\\n if(uf.same(u,v)) continue;\\n else if(t==T){\\n bool visitable = true;\\n if(maxval[uf.find(u)] == 0 && maxval[uf.find(v)]==0) visitable=false;\\n uf.unite(u,v);\\n if(visitable) maxval[uf.find(u)] = uf.size(u);\\n }\\n else {\\n long lu = getlazy(u, t), lv = getlazy(v, t);\\n if(lu==0 && lv==0){ uf.unite(u,v); continue; }\\n if(lu>0) lu += uf.size(v);\\n if(lv>0) lv += uf.size(u);\\n uf.unite(u,v);\\n maxval[uf.find(u)] = max<long>(lu,lv);\\n lastvisit[uf.find(u)] = t; //dbg(uf.find(u), maxval[uf.find(u)]);\\n }\\n }\\n\\n cout << getlazy(0, 1) << endl;\\n assert(getlazy(0,1)>0);\\n\\n return 0;\\n}\\n\\n// WA memo\\n// ???lu==0 && lv==0 ?????¨??????unite????????????????????¨??????????????????????????????\\n// ???t=1??§???unite???????????????????????´???????????????lazy???????????????????????????????°????????????£???????????£???\\n// ???Dijkstra???????????§=??§???priority_queue????????£????????§?????????MLE?????? ??¨?????????dijkstra???????????????????????????1???????????????????????????best\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 16504,\n \"score_of_the_acc\": -1.3118,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2813_2392442\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__\\\",\\\", __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 2147483600\\n\\nclass UnionFind {\\npublic:\\n vector<int> par, rank; // parent(negative := its root and abs-value is its size), depth\\n UnionFind(int sz) : par(sz, -1), rank(sz, 0){}\\n int find(int x){\\n if(par[x]<0) return x;\\n else return par[x] = find(par[x]);\\n }\\n void unite(int x, int y){\\n x=find(x); y=find(y);\\n if(x==y) return; // already belong to same tree\\n if(rank[x] < rank[y]){ // y becomes parent node\\n par[y] += par[x];\\n par[x] = y;\\n } else { // x becomes parent node\\n par[x] += par[y];\\n par[y] = x;\\n if(rank[x]==rank[y]) rank[x]++;\\n }\\n }\\n bool same(int x, int y){ return find(x) == find(y); }\\n int size(int x){ return -par[find(x)]; }\\n};\\n\\nint main(){\\n int n,m,T;\\n cin>>n>>m>>T;\\n vector<vector<pair<int,int>>> vec(n);\\n vector<pair<int,pair<int,int>>> edge(m);\\n rep(i,m){\\n int a,b,t;\\n cin>>a>>b>>t;\\n a--;b--;\\n vec[a].pb(mp(b,t));\\n vec[b].pb(mp(a,t));\\n edge[i] = mp(t,mp(a,b));\\n }\\n\\n // dijkstra??§??°?????????????????????\\n vector<int> d(n,INF);\\n using P = pair<int,int>;\\n priority_queue<P, vector<P>, greater<P>> pq;\\n pq.push(mp(0,0));\\n d[0]=0;\\n while(!pq.empty()){\\n auto p = pq.top(); pq.pop();\\n int v = p.second;\\n int dis = p.first;\\n if(d[v] < dis) continue;\\n for(auto to : vec[v]){\\n if(to.se <= dis) continue;\\n if(d[to.first] <= dis+1) continue;\\n d[to.first] = dis+1;\\n pq.push(mp(dis+1, to.first));\\n }\\n }\\n\\n // d[i]<INF ????????°?????????\\n\\n sort(all(edge)); reverse(all(edge));\\n UnionFind uf(n);\\n\\n vector<long> maxval(n,0);\\n vector<int> lastvisit(n,T);\\n rep(i,n) if(d[i]<INF) maxval[i]=1;\\n\\n auto getlazy = [&](int x, int t){\\n int node = uf.find(x);\\n if(maxval[node]==0) return 0L;\\n else if(lastvisit[node]==t) return maxval[node];\\n else {\\n long add = (lastvisit[node]-t)*uf.size(x);\\n return maxval[node] + add;\\n }\\n };\\n\\n rep(i,m){\\n int u = edge[i].se.fi, v = edge[i].se.se;\\n int t = edge[i].fi;\\n if(uf.same(u,v)) continue;\\n else if(t==T){\\n bool visitable = true;\\n if(maxval[uf.find(u)] == 0 && maxval[uf.find(v)]==0) visitable=false;\\n uf.unite(u,v);\\n if(visitable) maxval[uf.find(u)] = uf.size(u);\\n }\\n else {\\n long lu = getlazy(u, t), lv = getlazy(v, t);\\n if(lu==0 && lv==0){ uf.unite(u,v); continue; }\\n if(lu>0) lu += uf.size(v);\\n if(lv>0) lv += uf.size(u);\\n uf.unite(u,v);\\n maxval[uf.find(u)] = max<long>(lu,lv);\\n lastvisit[uf.find(u)] = t; //dbg(uf.find(u), maxval[uf.find(u)]);\\n }\\n }\\n\\n cout << getlazy(0, 1) << endl;\\n assert(getlazy(0,1)>0);\\n\\n return 0;\\n}\\n\\n// WA memo\\n// ???lu==0 && lv==0 ?????¨??????unite????????????????????¨??????????????????????????????\\n// ???t=1??§???unite???????????????????????´???????????????lazy???????????????????????????????°????????????£???????????£???\\n// ???Dijkstra???????????§=??§???priority_queue????????£????????§?????????MLE?????? ??¨?????????dijkstra???????????????????????????1???????????????????????????best\",\n \"accuracy\": 0.9787234042553191,\n \"time_ms\": 190,\n \"memory_kb\": 16396,\n \"score_of_the_acc\": -1.3666,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2813_2392212\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__\\\",\\\", __VA_ARGS__)\\nvoid _dbg(string){cout<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\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\\n#define INF 2147483600\\n\\nclass UnionFind {\\npublic:\\n vector<int> par, rank; // parent(negative := its root and abs-value is its size), depth\\n UnionFind(int sz) : par(sz, -1), rank(sz, 0){}\\n int find(int x){\\n if(par[x]<0) return x;\\n else return par[x] = find(par[x]);\\n }\\n void unite(int x, int y){\\n x=find(x); y=find(y);\\n if(x==y) return; // already belong to same tree\\n if(rank[x] < rank[y]){ // y becomes parent node\\n par[y] += par[x];\\n par[x] = y;\\n } else { // x becomes parent node\\n par[x] += par[y];\\n par[y] = x;\\n if(rank[x]==rank[y]) rank[x]++;\\n }\\n }\\n bool same(int x, int y){ return find(x) == find(y); }\\n int size(int x){ return -par[find(x)]; }\\n};\\n\\nint main(){\\n int n,m,T;\\n cin>>n>>m>>T;\\n vector<vector<pair<int,int>>> vec(n);\\n vector<pair<int,pair<int,int>>> edge(m);\\n rep(i,m){\\n int a,b,t;\\n cin>>a>>b>>t;\\n a--;b--;\\n vec[a].pb(mp(b,t));\\n vec[b].pb(mp(a,t));\\n edge[i] = mp(t,mp(a,b));\\n }\\n\\n // dijkstra??§??°?????????????????????\\n vector<int> d(n,INF);\\n using P = pair<int,int>;\\n priority_queue<P, vector<P>, greater<P>> pq;\\n pq.push(mp(0,0));\\n d[0]=0;\\n while(!pq.empty()){\\n auto p = pq.top(); pq.pop();\\n int v = p.second;\\n int dis = p.first;\\n if(d[v] < dis) continue;\\n for(auto to : vec[v]){\\n if(to.se <= dis) continue;\\n if(d[to.first] <= dis+1) continue;\\n d[to.first] = dis+1;\\n pq.push(mp(dis+1, to.first));\\n }\\n }\\n\\n vector<vector<pair<int,int>>>().swap(vec); // free memory\\n\\n // d[i]<INF ????????°?????????\\n\\n sort(all(edge)); reverse(all(edge));\\n UnionFind uf(n);\\n\\n vector<long> maxval(n,0);\\n vector<int> lastvisit(n,T);\\n rep(i,n) if(d[i]<INF) maxval[i]=1;\\n\\n auto getlazy = [&](int x, int t){\\n int node = uf.find(x);\\n if(maxval[node]==0) return 0L;\\n else if(lastvisit[node]==t) return maxval[node];\\n else {\\n long add = (lastvisit[node]-t)*uf.size(x);\\n return maxval[node] + add;\\n }\\n };\\n\\n rep(i,m){\\n int u = edge[i].se.fi, v = edge[i].se.se;\\n int t = edge[i].fi;\\n if(uf.same(u,v)) continue;\\n else if(t==T){\\n bool visitable = true;\\n if(maxval[uf.find(u)] == 0 && maxval[uf.find(v)]==0) visitable=false;\\n uf.unite(u,v);\\n if(visitable) maxval[uf.find(u)] = uf.size(u);\\n }\\n else {\\n long lu = getlazy(u, t), lv = getlazy(v, t);\\n if(lu==0 && lv==0){ uf.unite(u,v); continue; }\\n lu += uf.size(v); lv += uf.size(u);\\n uf.unite(u,v);\\n maxval[uf.find(u)] = max<long>(lu,lv);\\n lastvisit[uf.find(u)] = t; //dbg(uf.find(u), maxval[uf.find(u)]);\\n }\\n }\\n\\n cout << getlazy(0, 1) << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.9787234042553191,\n \"time_ms\": 180,\n \"memory_kb\": 14708,\n \"score_of_the_acc\": -1.2456,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2813_2330126\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, const pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\nconst int INF = 1e9;\\n\\nclass UnionFind{\\nprivate:\\n vector<int> par, rank;\\npublic:\\n VI sz, dd;\\n UnionFind(int n){\\n\\tpar.assign(n, 0);\\n\\trank.assign(n, 0);\\n\\tsz.assign(n, 1);\\n\\tfor(int i=0;i<n;++i)\\n\\t par[i] = i;\\n }\\n\\n //find root of x\\n int find(int x){\\n\\tif(par[x] == x)\\n\\t return x;\\n\\treturn (par[x] = find(par[x]));\\n }\\n\\n void unite(int x, int y){\\n\\tx = find(x);\\n\\ty = find(y);\\n\\tif(x == y) return;\\n\\n\\tif(rank[x] < rank[y])\\n\\t par[x] = y;\\n\\telse{\\n\\t par[y] = x;\\n\\t if(rank[x] == rank[y])\\n\\t\\t++rank[x];\\n\\t}\\n\\tint tmp = sz[x] + sz[y];\\n\\tsz[x] = sz[y] = tmp;\\n\\tdd[x] = dd[y] = min(dd[x], dd[y]);\\n }\\n\\n bool same(int x, int y){\\n\\treturn find(x) == find(y);\\n }\\n};\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n LL N, M, T;\\n cin >> N >> M >> T;\\n vector<vector<PII>> es(T+1);\\n vector<vector<PII>> G(N);\\n REP(i,M){\\n\\tint a, b, t;\\n\\tcin >> a >> b >> t;\\n\\t--a;\\n\\t--b;\\n\\tes[t].EB(a,b);\\n\\tG[a].EB(b,t);\\n\\tG[b].EB(a,t);\\n }\\n VI dist(N, INF);\\n dist[0] = 0;\\n queue<int> q;\\n q.push(0);\\n while(!q.empty()){\\n\\tint u = q.front();\\n\\tq.pop();\\n\\tfor(auto&& e: G[u]){\\n\\t if(dist[e.FF] == INF && dist[u] < e.SS){\\n\\t\\tdist[e.FF] = dist[u] + 1;\\n\\t\\tq.push(e.FF);\\n\\t }\\n\\t}\\n }\\n\\n UnionFind uf(N);\\n uf.dd = dist;\\n VL prv(N, T);\\n for(auto&& e: es[T]){\\n\\tuf.unite(e.FF, e.SS);\\n }\\n\\n VL ans(N, 0);\\n for(int t=T-1;t>0;--t){\\n\\tmap<PII,LL> buf;\\n\\tfor(auto&& e: es[t]){\\n\\t if(uf.same(e.FF, e.SS)) continue;\\n\\t int r1 = uf.find(e.FF);\\n\\t int r2 = uf.find(e.SS);\\n\\t LL s1 = uf.sz[r1];\\n\\t LL s2 = uf.sz[r2];\\n\\t buf[e] = max((ans[r1] + (prv[r1] - t)*s1) * (uf.dd[r1] <= t),\\n\\t\\t\\t\\t ans[r2] + (prv[r2] - t)*s2 * (uf.dd[r2] <= t));\\n\\t}\\n\\n\\tfor(auto&& p: buf){\\n\\t auto& e = p.FF;\\n\\t uf.unite(e.FF, e.SS);\\n\\t int r = uf.find(e.FF);\\n\\t maxi(ans[r], p.SS);\\n\\t prv[r] = t;\\n\\t}\\n }\\n\\n int rt = uf.find(0);\\n cout << ans[rt] + prv[rt] * N << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 18744,\n \"score_of_the_acc\": -0.8061,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2813_2325067\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nstruct edge {\\n\\tint from;\\n\\tint to;\\n\\tint t;\\n};\\n\\nint N, M, T;\\nvoid bfs(const vector<vector<edge>>&edges, vector<int>&can_go) {\\n\\tqueue<pair<int, int>>que;\\n\\tque.emplace(0, 0);\\n\\tcan_go[0] = true;\\n\\twhile (!que.empty()) {\\n\\t\\tauto atop(que.front());\\n\\t\\tque.pop();\\n\\t\\tconst int nexttime = atop.second + 1;\\n\\t\\tfor (auto e : edges[atop.first]) {\\n\\t\\t\\tif (nexttime <= e.t&&!can_go[e.to]) {\\n\\t\\t\\t\\tcan_go[e.to] = true;\\n\\t\\t\\t\\tque.emplace(e.to, nexttime);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nstruct UnionFind {\\n\\tvector<int> data;\\n\\tUnionFind(int size) : data(size, -1) { }\\n\\tbool unionSet(int x, int 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\\treturn x != y;\\n\\t}\\n\\tbool findSet(int x, int y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\tint root(int x) {\\n\\t\\treturn data[x] < 0 ? x : data[x] = root(data[x]);\\n\\t}\\n\\tint size(int x) {\\n\\t\\treturn -data[root(x)];\\n\\t}\\n};\\n\\n\\nint main() { cin >> N >> M >> T;\\n\\tvector<vector<edge>>edges(N);\\n\\tvector<edge>all_edges;\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint a, b, t; cin >> a >> b >> t;\\n\\t\\ta--; b--;\\n\\t\\tedges[a].push_back(edge{ a,b,t });\\n\\t\\tedges[b].push_back(edge{ b,a,t });\\n\\t\\tall_edges.push_back(edge{ a,b,t });\\n\\t}\\n\\tsort(all_edges.begin(), all_edges.end(), [](const edge&l, const edge&r) {\\n\\t\\treturn l.t > r.t;\\n\\t});\\n\\tvector<long long int>scores(N);\\n\\tvector<long long int>latest_connect(N, T);\\n\\tUnionFind uf(N);\\n\\tvector<int>can_go(N);\\n\\tbfs(edges, can_go);\\n\\tfor (auto e : all_edges) {\\n\\t\\tint a(e.from);\\n\\t\\tint b(e.to);\\n\\t\\tconst int root_a = uf.root(a);\\n\\t\\tconst int root_b = uf.root(b);\\n\\t\\tif (root_a ==root_b)continue;\\n\\t\\telse {\\n\\t\\t\\tlong long int new_score = 0;\\n\\t\\t\\tif (can_go[root_a]) {\\n\\t\\t\\t\\tnew_score = max(new_score, scores[root_a] + ( latest_connect[root_a]-e.t)*uf.size(root_a));\\n\\t\\t\\t}\\n\\t\\t\\tif (can_go[root_b]) {\\n\\t\\t\\t\\tnew_score = max(new_score, scores[root_b] + (latest_connect[root_b]-e.t)*uf.size(root_b));\\n\\t\\t\\t}\\n\\t\\t\\tuf.unionSet(root_a, root_b);\\n\\t\\t\\tconst int root_n = uf.root(root_a);\\n\\t\\t\\tif (can_go[root_a]) {\\n\\t\\t\\t\\tcan_go[root_n] = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (can_go[root_b]) {\\n\\t\\t\\t\\tcan_go[root_n] = true;\\n\\t\\t\\t}\\n\\t\\t\\tlatest_connect[root_n] = e.t;\\n\\t\\t\\tscores[root_n] = new_score;\\n\\t\\t}\\n\\t}\\n\\tconst int aroot = uf.root(0);\\n\\tlong long int ans = scores[aroot] + latest_connect[aroot] * N;\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 18116,\n \"score_of_the_acc\": -1.2535,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1695,"cells":{"group_id":{"kind":"string","value":"aoj_2811_cpp"},"problem_description":{"kind":"string","value":"G: 雨降りバス乗り換え\n背景\n今日は AOR イカちゃんにとって初となるデートの日だ。\n AOR イカちゃんは駅からバスを乗り継ぎ、待ち合わせ場所のバス停に向かう予定である。\n\n AOR イカちゃんが駅に着いた時、不幸にも雨が降ってきた。当初予定していた経路ではバスの待ち時間で濡れてしまい、せっかく整えた身だしなみが台無しになってしまう可能性がある。\n\nそこで、バスの待ち時間が最も少なくなるような経路でバス停まで向かうことにした。\n AOR イカちゃんは、待ち合わせ場所のバス停に着くまでにどの程度濡れるのか心配している。\n問題\nAOR イカちゃんは時刻 $0$ に $S$ 番目のバス停におり、そこから $G$ 番目のバス停まで行きたいと考えている。\n\nバス停の個数 $N$ と、異なるバス停同士を繋ぐ $M$ 個の経路 (※) が与えられる。\nバス停には、それぞれ $1, \\dots, N$ の番号がふられている。\n\n各経路は、出発地 $u$ 、目的地 $v$ 、出発時刻 $t$ 、所要時間 $c$ の $4$ つの値からなる。\n時刻 $t$ に出発地 $u$ にいればバスに乗ることができ、時刻 $t + c$ に目的地 $v$ へ到着する。\n\nバスに乗っていない間、 AOR イカちゃんは雨に濡れてしまう。\n雨にぬれる時間が最小となる経路を通り $G$ 番目のバス停へ向かう時、時刻 $0$ から $G$ 番目のバス停に着くまでの間に雨に濡れた時間の合計を出力せよ。\n(※) グラフ理論の用語における経路とは頂点と辺の列であるが，ここでは辺の意味で使われていることに注意してほしい。\n制約\n$2 \\le N \\le 10^5$\n$1 \\le M \\le 2 \\times 10^5$\n$1 \\le S , G \\le N$\n$1 \\le u_i , v_i \\le N$\n$0 \\le t_i \\le 10^5$\n$1 \\le c_i \\le 10^5$\n$S \\neq G$\n$u_i \\neq v_i$\n出発地 $u$ と目的地 $v$ が同じであるような経路は存在しない。\n出発地 $u$ と目的地 $v$ を結ぶ経路は複数存在する場合がある。\nバスの乗り降り、乗り換えに時間はかからないものとする。\n$G$ 番目のバス停へ到着する時間は問わない。\n$S$ 番目のバス停から $G$ 番目のバス停へ到着できることは保証されている。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N \\ M \\ S \\ G$\n$u_1 \\ v_1 \\ t_1 \\ c_1$\n$\\vdots$\n$u_M \\ v_M \\ t_M \\ c_M$\n出力\n雨に濡れた最小の時間を 1 行で出力せよ。また、末尾に改行も出力せよ。\nサンプル\n入力例 1\n2 2 1 2\n1 2 10 100\n1 2 5 500\n出力例 1\n5\n到着時間が遅くても、できるだけ雨に濡れない経路を選ぶ。\n入力例 2\n3 2 1 3\n1 2 0 123\n2 3 123 500\n出力例 2\n0\n乗り換えに時間はかからない。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2811_9752318","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int M = 200001;\nint u[M], v[M], t[M], c[M];\nvector<int> start[M], dest[M], busy_time[M];\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n #ifdef BACKER\n freopen(\"input.txt\", \"r\", stdin);\n // freopen(\"output.txt\", \"w\", stdout);\n #endif\n\n int n, m, s, g;\n cin >> n >> m >> s >> g;\n for (int i = 0; i < m; i++) cin >> u[i] >> v[i] >> t[i] >> c[i];\n for (int i = 0; i < m; i++) start[t[i]].push_back(i);\n vector<int> best(n + 1, -2e9);\n best[s] = 0;\n int ans = 2e9;\n for (int t = 0; t < M; t++) {\n int sz = dest[t].size();\n for (int i = 0; i < sz; i++) {\n best[dest[t][i]] = max(best[dest[t][i]], busy_time[t][i]);\n if (dest[t][i] == g) ans = min(ans, t - best[dest[t][i]]); \n }\n for (int i: start[t]) {\n dest[t + c[i]].push_back(v[i]);\n busy_time[t + c[i]].push_back(best[u[i]] + c[i]);\n }\n }\n cout << ans << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":32172,"score_of_the_acc":-0.4745,"final_rank":5},{"submission_id":"aoj_2811_9118118","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\nint n, m, s, g;\nint u[200005], v[200005], t[200005], c[200005];\nint st[100005], ed[100005];\nint sum;\nint head[400005], dis[400005], vis[400005];\nstruct pi\n{\n int v, t, id;\n pi(int aa = 0, int bb = 0)\n {\n v = aa;\n t = bb;\n }\n bool operator<(const pi &bb) const\n {\n return t < bb.t;\n }\n};\nvector<pi> p[200005];\nstruct node\n{\n int v, w, nxt;\n} a[400005];\nstruct node2\n{\n int id, dis;\n node2(int aa = 0, int bb = 0)\n {\n id = aa;\n dis = bb;\n }\n bool operator<(const node2 &bb) const\n {\n return dis > bb.dis;\n }\n};\npriority_queue<node2> q;\nvoid ins(int u, int v, int w)\n{\n ++sum;\n a[sum].v = v;\n a[sum].w = w;\n a[sum].nxt = head[u];\n head[u] = sum;\n}\nvoid dijkstra()\n{\n memset(dis, 0x7f, sizeof(dis));\n dis[0] = 0;\n q.push(node2(0, dis[0]));\n while (!q.empty())\n {\n int id = q.top().id;\n q.pop();\n if (id == st[g])\n break;\n if (vis[id])\n continue;\n vis[id] = 1;\n if (head[id])\n for (int d = head[id]; d; d = a[d].nxt)\n if (dis[id] + a[d].w < dis[a[d].v])\n {\n dis[a[d].v] = dis[id] + a[d].w;\n q.push(node2(a[d].v, dis[a[d].v]));\n }\n }\n return;\n}\nint main()\n{\n cin >> n >> m >> s >> g;\n for (int i = 1; i <= m; ++i)\n {\n cin >> u[i] >> v[i] >> t[i] >> c[i];\n p[u[i]].push_back(pi(v[i], t[i]));\n }\n for (int i = 1; i <= n; ++i)\n sort(p[i].begin(), p[i].end());\n for (int i = 1; i <= n; ++i)\n {\n if (i == g)\n {\n st[i] = ed[i - 1] + 1;\n ed[i] = ed[i - 1] + 1;\n continue;\n }\n st[i] = ed[i - 1] + 1;\n ed[i] = max(st[i], st[i] + (int)p[i].size() - 1);\n if (p[i].size())\n {\n if (p[i].size() > 1)\n for (int j = 0; j < p[i].size() - 1; ++j)\n {\n p[i][j].id = j;\n ins(st[i] + j, st[i] + j + 1, p[i][j + 1].t - p[i][j].t);\n }\n p[i][p[i].size() - 1].id = p[i].size() - 1;\n }\n }\n ins(0, st[s], p[s][0].t);\n for (int i = 1; i <= m; ++i)\n {\n pi k = *(--upper_bound(p[u[i]].begin(), p[u[i]].end(), pi(0, t[i])));\n if (v[i] == g)\n {\n ins(st[u[i]] + k.id, st[v[i]], 0);\n continue;\n }\n if (p[v[i]].size())\n if (lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i])) != p[v[i]].end())\n {\n pi kk = *lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i]));\n ins(st[u[i]] + k.id, st[v[i]] + kk.id, kk.t - t[i] - c[i]);\n }\n }\n dijkstra();\n cout << dis[st[g]] << endl;\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":25612,"score_of_the_acc":-0.4512,"final_rank":4},{"submission_id":"aoj_2811_9118103","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\nint n, m, s, g;\nint u[400005], v[400005], t[400005], c[400005];\nint st[400005], ed[400005];\nint sum;\nint head[400005], dis[400005], vis[400005];\nstruct pi\n{\n int v, t, id;\n pi(int aa = 0, int bb = 0)\n {\n v = aa;\n t = bb;\n }\n bool operator<(const pi &bb) const\n {\n return t < bb.t;\n }\n};\nvector<pi> p[400005];\nstruct node\n{\n int v, w, nxt;\n} a[800005];\nstruct node2\n{\n int id, dis;\n node2(int aa = 0, int bb = 0)\n {\n id = aa;\n dis = bb;\n }\n bool operator<(const node2 &bb) const\n {\n return dis > bb.dis;\n }\n};\npriority_queue<node2> q;\nvoid ins(int u, int v, int w)\n{\n ++sum;\n a[sum].v = v;\n a[sum].w = w;\n a[sum].nxt = head[u];\n head[u] = sum;\n}\nvoid dijkstra()\n{\n memset(dis, 0x7f, sizeof(dis));\n dis[0] = 0;\n q.push(node2(0, dis[0]));\n while (!q.empty())\n {\n int id = q.top().id;\n q.pop();\n if (id == st[g])\n break;\n if (vis[id])\n continue;\n vis[id] = 1;\n if (head[id])\n for (int d = head[id]; d; d = a[d].nxt)\n if (dis[id] + a[d].w < dis[a[d].v])\n {\n dis[a[d].v] = dis[id] + a[d].w;\n q.push(node2(a[d].v, dis[a[d].v]));\n }\n }\n return;\n}\nint main()\n{\n cin >> n >> m >> s >> g;\n for (int i = 1; i <= m; ++i)\n {\n cin >> u[i] >> v[i] >> t[i] >> c[i];\n p[u[i]].push_back(pi(v[i], t[i]));\n }\n for (int i = 1; i <= n; ++i)\n sort(p[i].begin(), p[i].end());\n for (int i = 1; i <= n; ++i)\n {\n if (i == g)\n {\n st[i] = ed[i - 1] + 1;\n ed[i] = ed[i - 1] + 1;\n continue;\n }\n st[i] = ed[i - 1] + 1;\n ed[i] = max(st[i], st[i] + (int)p[i].size() - 1);\n if (p[i].size())\n {\n if (p[i].size() > 1)\n for (int j = 0; j < p[i].size() - 1; ++j)\n {\n p[i][j].id = j;\n ins(st[i] + j, st[i] + j + 1, p[i][j + 1].t - p[i][j].t);\n }\n p[i][p[i].size() - 1].id = p[i].size() - 1;\n }\n }\n ins(0, st[s], p[s][0].t);\n for (int i = 1; i <= m; ++i)\n {\n pi k = *(--upper_bound(p[u[i]].begin(), p[u[i]].end(), pi(0, t[i])));\n if (v[i] == g)\n {\n ins(st[u[i]] + k.id, st[v[i]], 0);\n continue;\n }\n if (p[v[i]].size())\n if (lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i])) != p[v[i]].end())\n {\n pi kk = *lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i]));\n ins(st[u[i]] + k.id, st[v[i]] + kk.id, kk.t - t[i] - c[i]);\n }\n }\n dijkstra();\n cout << dis[st[g]] << endl;\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":36308,"score_of_the_acc":-0.6265,"final_rank":8},{"submission_id":"aoj_2811_9117931","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\nint n, m, s, g;\nint u[200005], v[200005], t[200005], c[200005];\nint st[100005], ed[100005];\nint sum;\nint head[200005], dis[200005], vis[200005];\nstruct pi\n{\n int v, t, id;\n pi(int aa = 0, int bb = 0)\n {\n v = aa;\n t = bb;\n }\n bool operator<(const pi &bb) const\n {\n return t < bb.t;\n }\n};\nvector<pi> p[100005];\nstruct node\n{\n int v, w, nxt;\n} a[400005];\nstruct node2\n{\n int id, dis;\n node2(int aa = 0, int bb = 0)\n {\n id = aa;\n dis = bb;\n }\n bool operator<(const node2 &bb) const\n {\n return dis > bb.dis;\n }\n};\npriority_queue<node2> q;\nvoid ins(int u, int v, int w)\n{\n ++sum;\n a[sum].v = v;\n a[sum].w = w;\n a[sum].nxt = head[u];\n head[u] = sum;\n}\nvoid dijkstra()\n{\n memset(dis, 0x7f, sizeof(dis));\n dis[0] = 0;\n q.push(node2(0, dis[0]));\n while (!q.empty())\n {\n int id = q.top().id;\n q.pop();\n if (id == st[g])\n break;\n if (vis[id])\n continue;\n vis[id] = 1;\n if (head[id])\n for (int d = head[id]; d; d = a[d].nxt)\n if (dis[id] + a[d].w < dis[a[d].v])\n {\n dis[a[d].v] = dis[id] + a[d].w;\n q.push(node2(a[d].v, dis[a[d].v]));\n }\n }\n return;\n}\nint main()\n{\n cin >> n >> m >> s >> g;\n for (int i = 1; i <= m; ++i)\n {\n cin >> u[i] >> v[i] >> t[i] >> c[i];\n p[u[i]].push_back(pi(v[i], t[i]));\n }\n for (int i = 1; i <= n; ++i)\n sort(p[i].begin(), p[i].end());\n for (int i = 1; i <= n; ++i)\n {\n if (i == g)\n {\n st[i] = ed[i - 1] + 1;\n ed[i] = ed[i - 1] + 1;\n continue;\n }\n st[i] = ed[i - 1] + 1;\n ed[i] = max(st[i], st[i] + (int)p[i].size() - 1);\n if (p[i].size())\n {\n for (int j = 0; j < p[i].size() - 1; ++j)\n {\n p[i][j].id = j;\n ins(st[i] + j, st[i] + j + 1, p[i][j + 1].t - p[i][j].t);\n }\n p[i][p[i].size() - 1].id = p[i].size() - 1;\n }\n }\n ins(0, st[s], p[s][0].t);\n for (int i = 1; i <= m; ++i)\n {\n pi k = *(--upper_bound(p[u[i]].begin(), p[u[i]].end(), pi(0, t[i])));\n if (v[i] == g)\n {\n ins(st[u[i]] + k.id, st[v[i]], 0);\n continue;\n }\n if (lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i])) != p[v[i]].end())\n {\n pi kk = *lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i]));\n ins(st[u[i]] + k.id, st[v[i]] + kk.id, kk.t - t[i] - c[i]);\n }\n }\n dijkstra();\n cout << dis[st[g]] << endl;\n return 0;\n}","accuracy":0.6551724137931034,"time_ms":130,"memory_kb":19808,"score_of_the_acc":-0.332,"final_rank":16},{"submission_id":"aoj_2811_9117909","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\n\ntemplate <typename T> bool chmin(T &a, const T &b) {\n\tif (a <= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> bool chmax(T &a, const T &b) {\n\tif (a >= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> T max(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T min(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T sum(vector<T> &a){\n\tT ret = 0;\n\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\n\treturn ret;\n}\n\n\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),\n F (*composition)(F, F), F (*id)()>\nstruct lazysegtree {\n private:\n int n, lg2, sz;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int i) {\n d[i] = op(d[2 * i], d[2 * i + 1]);\n }\n\n void all_apply(int i, F f) {\n d[i] = mapping(f, d[i]);\n if (i < sz) lz[i] = composition(f, lz[i]);\n }\n\n void push(int i) {\n all_apply(2 * i, lz[i]);\n all_apply(2 * i + 1, lz[i]);\n lz[i] = id();\n }\n\n public:\n lazysegtree(int _n) : lazysegtree(std::vector<S>(_n, e())) {}\n\n lazysegtree(const std::vector<S> &v) : n(v.size()) {\n lg2 = 0;\n while ((1 << lg2) < n) lg2++;\n sz = 1 << lg2;\n d = std::vector<S>(2 * sz, e());\n lz = std::vector<F>(2 * sz, id());\n for (int i = 0; i < n; i++) d[sz + i] = v[i];\n for (int i = sz - 1; i >= 1; i--) update(i);\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < n);\n p += sz;\n rrep(i, 1, lg2 + 1) push(p >> i);\n d[p] = x;\n rep(i, 1, lg2 + 1) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < n);\n p += sz;\n rrep(i, 1, lg2 + 1) 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 l += sz;\n r += sz;\n rrep(i, 1, lg2 + 1) {\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() {\n return d[1];\n }\n\n void apply(int p, F f) {\n assert(0 <= p && p < n);\n p += sz;\n rrep(i, 1, lg2 + 1) push(p >> i);\n d[p] = mapping(f, d[p]);\n rep(i, 1, lg2 + 1) update(p >> i);\n }\n\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= n);\n if (l == r) return;\n l += sz;\n r += sz;\n rrep(i, 1, lg2 + 1) {\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 rep(i, 1, lg2 + 1) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <class G> 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 += sz;\n for (int i = lg2; 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 < sz) {\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 - sz;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return n;\n }\n\n template <class G> 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 += sz;\n for (int i = lg2; 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 < sz) {\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 - sz;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n};\n\nusing S = long long;\nusing F = long long;\n\nconst S INF = 1e18;\n\nS op(S a, S b){ return std::min(a, b); }\nS e(){ return INF; }\nS mapping(F f, S x){ return f+x; }\nF composition(F f, F g){ return f+g; }\nF id(){ return 0; }\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n\n\tint n, m; cin >> n >> m;\n\tint S, G; cin >> S >> G;\n\tS--; G--;\n\n\t\n\tvector<int> u(m), v(m);\n\t\n\tvector bucket(255555, vector<pair<int,int>>(0));\n\trep(i,0,m){\n\t\tcin >> u[i] >> v[i];\n\t\tu[i]--; v[i]--;\n\t\tint t, c; cin >> t >> c;\n\t\tbucket[t].push_back(pair(0, i));\n\t\tbucket[t + c].push_back(pair(1, i));\n\t}\n\n\tlazysegtree<ll,op,e,ll,mapping,composition,id> seg(n);\n\tseg.set(S, 0);\n\n\tll ans = 1e18;\n\tvector<ll> hokan(m);\n\trep(tim,0,244444){\n\t\tsort(bucket[tim].begin(), bucket[tim].end());\n\t\treverse(bucket[tim].begin(), bucket[tim].end());\n\t\tfor (auto [typ,ind]: bucket[tim]){\n\t\t\tif (typ == 0){\n\t\t\t\thokan[ind] = seg.get(u[ind]);\t\t\t\t\n\t\t\t}else{\n\t\t\t\tseg.set(v[ind], min(seg.get(v[ind]), hokan[ind]));\n\t\t\t}\n\t\t}\n\t\tchmin(ans, seg.get(G));\n\t\tseg.apply(0, n, 1);\n\t}\n\tcout << ans << '\\n';\n\n}","accuracy":1,"time_ms":120,"memory_kb":22820,"score_of_the_acc":-0.3701,"final_rank":3},{"submission_id":"aoj_2811_9117825","code_snippet":"//#include<atcoder/all>\n//using namespace atcoder;\n\n#include <bits/stdc++.h>\ntemplate<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}\ntemplate<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}\n#define ll long long\n#define double long double\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define REP(i,n) for(int i=1;i<=(n);i++)\n#define mod (ll)(1e9+7)\n#define inf (ll)(3e18+7)\n#define eps (double)(1e-9)\n#define pi (double) acos(-1)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\nusing namespace std;\n\nstruct edge{\n ll to, cost;\n};\n\nusing Graph = vector<vector<edge>>;\n\n#define P pair<int, int>\nvector<ll> dijkstra(const vector<vector<edge>> &G, int s) {\n vector<ll> d((int)G.size(), inf);\n\tpriority_queue<P, vector<P>, greater<P>>que;\n\td[s] = 0;\n\tque.push(P(0, s));\n\twhile (!que.empty()) {\n\t\tP p = que.top(); que.pop();\n\t\tint v = p.second;\n\t\tif (d[v] < p.first)continue;\n\t\trep(i, G[v].size()) {\n\t\t\tedge e = G[v][i];\n\t\t\tif (d[e.to] > d[v] + e.cost) {\n\t\t\t\td[e.to] = d[v] + e.cost;\n\t\t\t\tque.push(P(d[e.to], e.to));\n\t\t\t}\n\t\t}\n\t}\n\treturn d;\n}\n\nint main(){\n int n, m, s, g;\n cin >> n >> m >> s >> g;\n s--; g--;\n\n vector<int> u(m), v(m), t(m), c(m);\n rep(i, m)cin >> u[i] >> v[i] >> t[i] >> c[i];\n rep(i, m){u[i]--; v[i]--;}\n\n vector<vector<int>> vec(n);\n rep(i, m)vec[u[i]].push_back(t[i]);\n rep(i, m)vec[v[i]].push_back(t[i]+c[i]);\n vec[s].insert(vec[s].begin(), 0);\n rep(i, n)sort(all(vec[i]));\n\n int now = 0;\n map<P, int> idx;\n rep(i, n)rep(j, (int)vec[i].size()){\n idx[{i, vec[i][j]}] = now;\n now++;\n }\n\n idx[{s, 0}] = now;\n now++;\n\n Graph G(now);\n\n rep(i, m){\n G[idx[{u[i], t[i]}]].push_back({idx[{v[i], t[i]+c[i]}], 0});\n }\n\n rep(i, n)rep(j, (int)vec[i].size()-1){\n G[idx[{i, vec[i][j]}]].push_back({idx[{i, vec[i][j+1]}], vec[i][j+1]-vec[i][j]});\n }\n\n ll ans = inf;\n vector<ll> d = dijkstra(G, idx[{s, 0}]);\n rep(i, (int)vec[g].size())chmin(ans, d[idx[{g, vec[g][i]}]]);\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":630,"memory_kb":64064,"score_of_the_acc":-1.9032,"final_rank":11},{"submission_id":"aoj_2811_9117818","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\nint n, m, s, g;\nint u[200005], v[200005], t[200005], c[200005];\nint st[100005], ed[100005];\nint sum;\nint head[200005], dis[200005], vis[200005];\nstruct pi\n{\n int v, t, c, id;\n pi(int aa = 0, int bb = 0, int cc = 0)\n {\n v = aa;\n t = bb;\n c = cc;\n }\n bool operator<(const pi &bb) const\n {\n return t < bb.t;\n }\n};\nvector<pi> p[100005];\nstruct node\n{\n int v, w, nxt;\n} a[300005];\nstruct node2\n{\n int id, dis;\n node2(int aa = 0, int bb = 0)\n {\n id = aa;\n dis = bb;\n }\n bool operator<(const node2 &bb) const\n {\n return dis > bb.dis;\n }\n};\npriority_queue<node2> q;\nvoid ins(int u, int v, int w)\n{\n ++sum;\n a[sum].v = v;\n a[sum].w = w;\n a[sum].nxt = head[u];\n head[u] = sum;\n}\nvoid dijkstra()\n{\n memset(dis, 0x7f, sizeof(dis));\n dis[0] = 0;\n q.push(node2(0, dis[0]));\n while (!q.empty())\n {\n int id = q.top().id;\n q.pop();\n if (vis[id])\n continue;\n vis[id] = 1;\n for (int d = head[id]; d; d = a[d].nxt)\n if (dis[id] + a[d].w < dis[a[d].v])\n {\n dis[a[d].v] = dis[id] + a[d].w;\n q.push(node2(a[d].v, dis[a[d].v]));\n }\n }\n return;\n}\nint main()\n{\n cin >> n >> m >> s >> g;\n for (int i = 1; i <= m; ++i)\n {\n cin >> u[i] >> v[i] >> t[i] >> c[i];\n p[u[i]].push_back(pi(v[i], t[i], c[i]));\n }\n for (int i = 1; i <= n; ++i)\n sort(p[i].begin(), p[i].end());\n for (int i = 1; i <= n; ++i)\n {\n if (i == g)\n {\n st[i] = ed[i - 1] + 1;\n ed[i] = ed[i - 1] + 1;\n continue;\n }\n if (p[i].size())\n {\n st[i] = ed[i - 1] + 1;\n ed[i] = st[i] + p[i].size() - 1;\n for (int j = 0; j < p[i].size() - 1; ++j)\n {\n p[i][j].id = j;\n ins(st[i] + j, st[i] + j + 1, p[i][j + 1].t - p[i][j].t);\n }\n p[i][p[i].size() - 1].id = p[i].size() - 1;\n }\n }\n ins(0, st[s], p[s][0].t);\n for (int i = 1; i <= m; ++i)\n {\n pi k = *lower_bound(p[u[i]].begin(), p[u[i]].end(), pi(0, t[i], 0));\n if (v[i] == g)\n {\n ins(st[u[i]] + k.id, st[v[i]], 0);\n continue;\n }\n if (lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i], 0)) != p[v[i]].end())\n {\n pi kk = *lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i], 0));\n ins(st[u[i]] + k.id, st[v[i]] + kk.id, kk.t - t[i] - c[i]);\n }\n }\n dijkstra();\n cout << dis[st[g]] << endl;\n return 0;\n}","accuracy":0.3103448275862069,"time_ms":90,"memory_kb":17736,"score_of_the_acc":-0.2325,"final_rank":20},{"submission_id":"aoj_2811_9117760","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\n\nvoid solve(){\n int n, m, sv, gv; in(n,m,sv,gv); sv--, gv--;\n vector<int> from(m), to(m), ts(m), cs(m);\n rep(i,m){\n int u, v; in(u,v); u--, v--;\n int t, c; in(t,c);\n from[i] = u;\n to[i] = v;\n ts[i] = t;\n cs[i] = c;\n }\n vector<int> ids(m); iota(all(ids),0);\n sort(all(ids),[&](int l, int r){\n return ts[l] < ts[r];\n });\n vector<int> dp(n,-iinf);\n dp[sv] = 0;\n priority_queue<pii,vector<pii>,greater<pii>> pque;\n vector<int> cal(m,-iinf);\n int ans = iinf;\n for (int i : ids){\n while (!pque.empty() && pque.top().first <= ts[i]){\n auto [t, id] = pque.top(); pque.pop();\n chmax(dp[to[id]],cal[id]);\n }\n cal[i] = dp[from[i]] + cs[i];\n pque.push(pii(ts[i]+cs[i],i));\n if (to[i] == gv){\n chmin(ans,ts[i]+cs[i]-cal[i]);\n }\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":1,"time_ms":60,"memory_kb":9088,"score_of_the_acc":-0.0312,"final_rank":1},{"submission_id":"aoj_2811_9117709","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\n\nvoid solve(){\n int n, m, sv, gv; in(n,m,sv,gv); sv--, gv--;\n vector<vector<array<int,3>>> g(n);\n rep(tt,m){\n int u, v; in(u,v); u--, v--;\n int t, c; in(t,c);\n g[u].push_back({v,t,c});\n g[v].push_back({u,t,c});\n }\n using ppi = pair<pii,int>;\n priority_queue<ppi,vector<ppi>,greater<ppi>> pque;\n vector<pii> dist(n,pii(iinf,iinf));\n dist[sv] = pii(0,0);\n pque.push(ppi(dist[sv],sv));\n while (!pque.empty()){\n auto [dd, v] = pque.top(); pque.pop();\n if (dist[v] < dd) continue;\n auto [val, cur] = dd;\n int sum = cur - val;\n for (auto [u, t, c] : g[v]){\n if (cur > t) continue;\n int nval = t+c - (sum+c);\n int ncur = t+c;\n if (chmin(dist[u],pii(nval,ncur))){\n pque.push(ppi(dist[u],u));\n }\n }\n }\n out(dist[gv].first);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":0.3103448275862069,"time_ms":40,"memory_kb":12272,"score_of_the_acc":-0.0568,"final_rank":19},{"submission_id":"aoj_2811_8491937","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2811.cc: Rainy Bus Stops\n */\n\n#include<cstdio>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<utility>\n#include<tuple>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_M = 200000;\nconst int MAX_K = MAX_M * 2 + 1;\nconst long long LINF = 1LL << 60;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef pair<ll,int> pli;\ntypedef vector<pii> vpii;\ntypedef tuple<int,int,int,int> quadi;\n\n/* global variables */\n\nquadi es[MAX_M];\npii ps[MAX_K];\nvpii nbrs[MAX_K];\nll ds[MAX_K];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m, st, gl;\n scanf(\"%d%d%d%d\", &n, &m, &st, &gl);\n\n int k = 0;\n ps[k++] = pii(st, 0);\n for (int i = 0; i < m; i++) {\n int u, v, t, c;\n scanf(\"%d%d%d%d\", &u, &v, &t, &c);\n es[i] = { u, v, t, c };\n ps[k++] = pii(u, t), ps[k++] = pii(v, t + c);\n }\n\n sort(ps, ps + k);\n k = unique(ps, ps + k) - ps;\n\n for (int i = 1; i < k; i++)\n if (ps[i - 1].first == ps[i].first)\n nbrs[i - 1].push_back(pii(i, ps[i].second - ps[i - 1].second));\n\n for (int i = 0; i < m; i++) {\n auto [ u, v, t, c ] = es[i];\n int ui = lower_bound(ps, ps + k, pii(u, t)) - ps;\n int vi = lower_bound(ps, ps + k, pii(v, t + c)) - ps;\n nbrs[ui].push_back(pii(vi, 0));\n }\n\n int pst = lower_bound(ps, ps + k, pii(st, 0)) - ps;\n \n fill(ds, ds + k, LINF);\n ds[pst] = 0;\n \n priority_queue<pli> q;\n q.push(pli(0, pst));\n\n while (! q.empty()) {\n auto ue = q.top(); q.pop();\n ll ud = -ue.first;\n int u = ue.second;\n if (ud != ds[u]) continue;\n\n for (auto &vw: nbrs[u]) {\n int v = vw.first;\n ll vd = ud + vw.second;\n if (ds[v] > vd) {\n\tds[v] = vd;\n\tq.push(pli(-vd, v));\n }\n }\n }\n\n ll mind = LINF;\n for (int i = 0; i < k; i++)\n if (ps[i].first == gl) mind = min(mind, ds[i]);\n\n printf(\"%lld\\n\", mind);\n\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":34136,"score_of_the_acc":-0.6658,"final_rank":10},{"submission_id":"aoj_2811_5967327","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\";}\nstruct edge{\n int to,t;\n ll cost;\n edge(int to,int t,ll cost):to(to),t(t),cost(cost){}\n};\nstruct edge2{\n int to,id;\n ll cost;\n edge2(int to,int id,ll cost):to(to),id(id),cost(cost){}\n};\nusing tp=tuple<ll,int,int>;\nint main(){\n int n,m,S,G;\n cin>>n>>m>>S>>G;\n --S;--G;\n V<V<edge>> g(n);\n V<V<int>> tmp(n);\n for(int i=0;i<m;i++){\n ll u,v,t,c;\n cin>>u>>v>>t>>c;\n --u;--v;\n g[u].emplace_back(v,t,c);\n tmp[u].emplace_back(t);\n }\n V<V<ll>> dp(n);\n V<V<V<edge2>>> e(n);\n for(int i=0;i<n;i++){\n sort(all(g[i]),[](auto a,auto b){\n if(a.t!=b.t)return a.t<b.t;\n return a.cost<b.cost;\n });\n dp[i].assign(g[i].size()+1,inf);\n e[i].resize(g[i].size()+1);\n sort(all(tmp[i]));\n }\n for(int i=0;i<n;i++){\n int sz=g[i].size();\n for(int j=0;j<sz;j++){\n edge cp=g[i][j];\n if(j!=sz-1){\n edge cp2=g[i][j+1];\n e[i][j].emplace_back(i,j+1,cp2.t-cp.t);\n }\n if(cp.to==G){\n e[i][j].emplace_back(cp.to,0,0);\n }else{\n auto ite=lower_bound(all(tmp[cp.to]),cp.t+cp.cost);\n if(ite!=tmp[cp.to].end()){\n e[i][j].emplace_back(cp.to,(int)(ite-tmp[cp.to].begin()),*ite-(cp.t+cp.cost));\n }\n }\n }\n }\n priority_queue<tp,V<tp>,greater<tp>> pq;\n pq.emplace(0,S,0);\n dp[S][0]=g[S][0].t;\n while(pq.size()){\n auto [v,cur,id]=pq.top();\n pq.pop();\n if(dp[cur][id]<v)continue;\n for(edge2 &to:e[cur][id]){\n if(chmin(dp[to.to][to.id],dp[cur][id]+to.cost)){\n pq.emplace(dp[to.to][to.id],to.to,to.id);\n }\n }\n }\n cout<<dp[G][0]<<\"\\n\";\n}","accuracy":1,"time_ms":120,"memory_kb":39180,"score_of_the_acc":-0.6621,"final_rank":9},{"submission_id":"aoj_2811_3992938","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n\nstruct Edge {\n\tint to, sttime, cost, index;\n\tEdge(const int t, const int s, const int c, const int i) {\n\t\tto = t, sttime = s, cost = c, index = i;\n\t\treturn;\n\t}\n\tbool operator<(const Edge&e)const {\n\t\treturn sttime < e.sttime;\n\t}\n};\n\nint main() {\n\tint N, M, S, G;\n\tcin >> N >> M >> S >> G;\n\tS--, G--;\n\tvector<vector<Edge>>edge(N);\n\tfor (int i = 0; i < M; i++) {\n\t\tint l, r, s, t;\n\t\tcin >> l >> r >> s >> t;\n\t\tl--, r--;\n\t\tedge[l].push_back(Edge(r, s, t, i));\n\t}\n//cout << \"JHIJHI\" << endl;\n\tfor (int i = 0; i < N; i++)sort(edge[i].begin(), edge[i].end());\n\tvector<vector<pair<int, int>>>dis_edge(M + 1);\n//\tcout << \"GUUG\" << endl;\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < (int)(edge[i].size()) - 1; j++) {\n\t\t\tdis_edge[edge[i][j].index].push_back({ edge[i][j + 1].index,edge[i][j + 1].sttime - edge[i][j].sttime });\n\t\t}\n\t\tvector<pair<int, int>>box;\n\t\tfor (auto j : edge[i]) {\n\t\t\tif (j.to == G) {\n\t\t\t\tdis_edge[j.index].push_back({ M,0 });\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (edge[j.to].empty())continue;\n\t\t\tint L = -1, R = edge[j.to].size();\n\t\t\twhile (R - L > 1) {\n\t\t\t\tint mid = (R + L) / 2;\n\t\t\t\tif (edge[j.to][mid].sttime >= j.sttime + j.cost)R = mid;\n\t\t\t\telse L = mid;\n\t\t\t}\n\t\t\tif (R == edge[j.to].size())continue;\n\t\t\tdis_edge[j.index].push_back({ edge[j.to][R].index,edge[j.to][R].sttime - j.cost - j.sttime });\n\t\t}\n\t}\n\t//cout << \"Ho\" << endl;\n\tvector<int>dis(M+1, MOD);\n\tpriority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>PQ;\n\tfor (auto i : edge[S]) {\n\t\tdis[i.index] = i.sttime;\n\t\tPQ.push({ i.sttime,i.index });\n\t}\n\twhile (!PQ.empty()) {\n\t\tint cn = PQ.top().second;\n\t\tint c = PQ.top().first;\n\t\tPQ.pop();\n\t\tfor (auto j : dis_edge[cn]) {\n\t\t\tif (dis[j.first] > c + j.second) {\n\t\t\t\tdis[j.first] = c + j.second;\n\t\t\t\tPQ.push({ dis[j.first],j.first });\n\t\t\t}\n\t\t}\n\t}\n\tcout << dis[M] << endl;\n}","accuracy":1,"time_ms":220,"memory_kb":21312,"score_of_the_acc":-0.4994,"final_rank":7},{"submission_id":"aoj_2811_3991500","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n\nstruct Edge {\n\tint to, sttime, cost, index;\n\tEdge(const int t, const int s, const int c, const int i) {\n\t\tto = t, sttime = s, cost = c, index = i;\n\t\treturn;\n\t}\n\tbool operator<(const Edge&e)const {\n\t\treturn sttime < e.sttime;\n\t}\n};\n\nint main() {\n\tint N, M, S, G;\n\tcin >> N >> M >> S >> G;\n\tS--, G--;\n\tvector<vector<Edge>>edge(N);\n\tfor (int i = 0; i < M; i++) {\n\t\tint l, r, s, t;\n\t\tcin >> l >> r >> s >> t;\n\t\tl--, r--;\n\t\tedge[l].push_back(Edge(r, s, t, i));\n\t}\n//cout << \"JHIJHI\" << endl;\n\tfor (int i = 0; i < N; i++)sort(edge[i].begin(), edge[i].end());\n\tvector<vector<pair<int, int>>>dis_edge(M + 1);\n//\tcout << \"GUUG\" << endl;\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < (int)(edge[i].size()) - 1; j++) {\n\t\t\tdis_edge[edge[i][j].index].push_back({ edge[i][j + 1].index,edge[i][j + 1].sttime - edge[i][j].sttime });\n\t\t}\n\t\tvector<pair<int, int>>box;\n\t\tfor (auto j : edge[i]) {\n\t\t\tif (j.to == G) {\n\t\t\t\tdis_edge[j.index].push_back({ M,0 });\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (edge[j.to].empty())continue;\n\t\t\tint L = -1, R = edge[j.to].size();\n\t\t\twhile (R - L > 1) {\n\t\t\t\tint mid = (R + L) / 2;\n\t\t\t\tif (edge[j.to][mid].sttime >= j.sttime + j.cost)R = mid;\n\t\t\t\telse L = mid;\n\t\t\t}\n\t\t\tif (R == edge[j.to].size())continue;\n\t\t\tdis_edge[j.index].push_back({ edge[j.to][R].index,edge[j.to][R].sttime - j.cost - j.sttime });\n\t\t}\n\t}\n\t//cout << \"Ho\" << endl;\n\tvector<int>dis(M+1, MOD);\n\tpriority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>PQ;\n\tfor (auto i : edge[S]) {\n\t\tdis[i.index] = i.sttime;\n\t\tPQ.push({ i.sttime,i.index });\n\t}\n\twhile (!PQ.empty()) {\n\t\tint cn = PQ.top().second;\n\t\tint c = PQ.top().first;\n\t\tPQ.pop();\n\t\tfor (auto j : dis_edge[cn]) {\n\t\t\tif (dis[j.first] > c + j.second) {\n\t\t\t\tdis[j.first] = c + j.second;\n\t\t\t\tPQ.push({ dis[j.first],j.first });\n\t\t\t}\n\t\t}\n\t}\n\tcout << dis[M] << endl;\n}","accuracy":1,"time_ms":220,"memory_kb":21236,"score_of_the_acc":-0.4981,"final_rank":6},{"submission_id":"aoj_2811_2712384","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n#define HUGE_NUM 9999999999999999\n\nstruct Info{\n\tInfo(int arg_to,ll arg_time,ll arg_cost,ll arg_min_rain){\n\t\tto = arg_to;\n\t\ttime = arg_time;\n\t\tcost = arg_cost;\n\t\tmin_rain = arg_min_rain;\n\t}\n\tint to;\n\tll time,cost,min_rain;\n};\n\nstruct Data{\n\tData(int arg_node_id,int arg_pre_node,int arg_pre_id,ll arg_current_time,ll arg_rain_time){\n\t\tnode_id = arg_node_id;\n\t\tpre_node = arg_pre_node;\n\t\tpre_id = arg_pre_id;\n\t\tcurrent_time = arg_current_time;\n\t\train_time = arg_rain_time;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\t\treturn rain_time > arg.rain_time;\n\t}\n\tint node_id,pre_node,pre_id;\n\tll current_time,rain_time;\n};\n\nint N,M,start,goal;\nvector<Info> G[100000];\n\nint main(){\n\n\tscanf(\"%d %d %d %d\",&N,&M,&start,&goal);\n\tstart--;\n\tgoal--;\n\n\tint from,to;\n\tll time,cost;\n\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%d %d %lld %lld\",&from,&to,&time,&cost);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(Info(to,time,cost,HUGE_NUM));\n\t}\n\n\tpriority_queue<Data> Q;\n\tfor(int i = 0; i < G[start].size(); i++){\n\t\tG[start][i].min_rain = G[start][i].time;\n\t\tQ.push(Data(G[start][i].to,start,i,G[start][i].time+G[start][i].cost,G[start][i].time));\n\t}\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().node_id == goal){\n\t\t\tprintf(\"%lld\\n\",Q.top().rain_time);\n\t\t\treturn 0;\n\t\t}else if(Q.top().rain_time > G[Q.top().pre_node][Q.top().pre_id].min_rain){\n\t\t\tQ.pop();\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\n\t\t\t\tif(Q.top().current_time > G[Q.top().node_id][i].time)continue;\n\t\t\t\tif(Q.top().rain_time+G[Q.top().node_id][i].time-Q.top().current_time >= G[Q.top().node_id][i].min_rain)continue;\n\n\t\t\t\tG[Q.top().node_id][i].min_rain = Q.top().rain_time+G[Q.top().node_id][i].time-Q.top().current_time;\n\t\t\t\tQ.push(Data(G[Q.top().node_id][i].to,Q.top().node_id,i,G[Q.top().node_id][i].time+G[Q.top().node_id][i].cost,G[Q.top().node_id][i].min_rain));\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":17596,"score_of_the_acc":-0.2456,"final_rank":2},{"submission_id":"aoj_2811_2688154","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst bool debug = true;\n#define dbg(...) if(debug) printf(__VA_ARGS__)\n#define print(var) if (debug) cout << #var << \" = \" << var << endl\n\nnamespace {\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\n template<typename T>\n ostream& operator<<(ostream& os, const vector<T>& xs) {\n if (xs.empty()) return os << \"[]\";\n os << xs[0];\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\n return os;\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\n return os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const map<K, V>& m) {\n bool first = true;\n for (auto p : m) {\n if (first) first = false;\n else os << \":\";\n os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n return os;\n }\n\n\n map<tuple<int, int, bool>, int> id;\n vector<tuple<int, int, bool>> fromId;\n\n struct Edge {\n int to, cost;\n Edge(int to, int cost) : to(to), cost(cost) {}\n };\n vector<vector<Edge>> Graph;\n\n int N, M, S, G;\n\n bool IN = false;\n bool OUT = true;\n\n void solve() {\n cin >> N >> M >> S >> G;\n S--; G--;\n vector<vector<tuple<int, int, bool>>> V(N);\n auto init = make_tuple(S, 0, IN);\n V[S].push_back(init);\n id[init] = 0;\n fromId.push_back(init);\n Graph.emplace_back();\n for (int i = 0; i < M; i++) {\n int u, v, t, c; cin >> u >> v >> t >> c;\n u--; v--;\n auto x = make_tuple(u, t, OUT);\n auto x_id = id.count(x) ? id[x] : fromId.size();\n if (not id.count(x)) {\n fromId.push_back(x);\n id[x] = x_id;\n Graph.emplace_back();\n }\n V[u].push_back(x);\n auto y = make_tuple(v, t + c, IN);\n auto y_id = id.count(y) ? id[y] : fromId.size();\n if (not id.count(y)) {\n fromId.push_back(y);\n id[y] = y_id;\n Graph.emplace_back();\n }\n V[v].push_back(y);\n Graph[x_id].emplace_back(y_id, 0);\n }\n for (auto& L : V) {\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) {\n return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b);\n });\n for (unsigned i = 0; i + 1 < L.size(); i++) {\n auto& x = L[i];\n auto& y = L[i + 1];\n auto time_x = get<1>(x);\n auto time_y = get<1>(y);\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\n }\n }\n\n auto start = id[ V[S][0] ];\n\n // dijkstra\n const int INF = 1<<28;\n vector<int> D(Graph.size(), INF);\n struct State {\n int v, cost;\n State(int v, int cost) : v(v), cost(cost) {}\n bool operator<(const State& s) const {\n return cost > s.cost;\n }\n };\n priority_queue<State> PQ;\n PQ.emplace(start, 0);\n D[start] = 0;\n while (not PQ.empty()) {\n auto cur = PQ.top(); PQ.pop();\n for (auto& e : Graph[cur.v]) {\n auto next = e.to;\n if (D[next] > cur.cost + e.cost) {\n D[next] = cur.cost + e.cost;\n PQ.emplace(next, D[next]);\n }\n }\n }\n int ans = INF;\n for (auto& goal_vertex : V[G]) {\n auto goal = id[goal_vertex];\n ans = min(ans, D[goal]);\n }\n cout << ans << endl;\n }\n}\n\nint main() {\n solve();\n return 0;\n}","accuracy":1,"time_ms":670,"memory_kb":64968,"score_of_the_acc":-1.9818,"final_rank":13},{"submission_id":"aoj_2811_2688151","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst bool debug = true;\n#define dbg(...) if(debug) printf(__VA_ARGS__)\n#define print(var) if (debug) cout << #var << \" = \" << var << endl\n\nnamespace {\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\n template<typename T>\n ostream& operator<<(ostream& os, const vector<T>& xs) {\n if (xs.empty()) return os << \"[]\";\n os << xs[0];\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\n return os;\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\n return os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const map<K, V>& m) {\n bool first = true;\n for (auto p : m) {\n if (first) first = false;\n else os << \":\";\n os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n return os;\n }\n\n\n map<tuple<int, int, bool>, int> id;\n vector<tuple<int, int, bool>> fromId;\n\n struct Edge {\n int to, cost;\n Edge(int to, int cost) : to(to), cost(cost) {}\n };\n vector<vector<Edge>> Graph;\n\n int N, M, S, G;\n\n bool IN = false;\n bool OUT = true;\n\n void solve() {\n cin >> N >> M >> S >> G;\n S--; G--;\n vector<vector<tuple<int, int, bool>>> V(N);\n auto init = make_tuple(S, 0, IN);\n V[S].push_back(init);\n id[init] = 0;\n fromId.push_back(init);\n Graph.emplace_back();\n for (int i = 0; i < M; i++) {\n int u, v, t, c; cin >> u >> v >> t >> c;\n u--; v--;\n auto x = make_tuple(u, t, OUT);\n auto x_id = id.count(x) ? id[x] : fromId.size();\n if (not id.count(x)) {\n fromId.push_back(x);\n id[x] = x_id;\n Graph.emplace_back();\n }\n V[u].push_back(x);\n auto y = make_tuple(v, t + c, IN);\n auto y_id = id.count(y) ? id[y] : fromId.size();\n if (not id.count(y)) {\n fromId.push_back(y);\n id[y] = y_id;\n Graph.emplace_back();\n Graph[x_id].emplace_back(y_id, 0);\n }\n V[v].push_back(y);\n }\n for (auto& L : V) {\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) {\n return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b);\n });\n for (unsigned i = 0; i + 1 < L.size(); i++) {\n auto& x = L[i];\n auto& y = L[i + 1];\n auto time_x = get<1>(x);\n auto time_y = get<1>(y);\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\n }\n }\n\n auto start = id[ V[S][0] ];\n\n // dijkstra\n const int INF = 1<<28;\n vector<int> D(Graph.size(), INF);\n struct State {\n int v, cost;\n State(int v, int cost) : v(v), cost(cost) {}\n bool operator<(const State& s) const {\n return cost > s.cost;\n }\n };\n priority_queue<State> PQ;\n PQ.emplace(start, 0);\n D[start] = 0;\n while (not PQ.empty()) {\n auto cur = PQ.top(); PQ.pop();\n for (auto& e : Graph[cur.v]) {\n auto next = e.to;\n if (D[next] > cur.cost + e.cost) {\n D[next] = cur.cost + e.cost;\n PQ.emplace(next, D[next]);\n }\n }\n }\n int ans = INF;\n for (auto& goal_vertex : V[G]) {\n auto goal = id[goal_vertex];\n ans = min(ans, D[goal]);\n }\n cout << ans << endl;\n }\n}\n\nint main() {\n solve();\n return 0;\n}","accuracy":0.7586206896551724,"time_ms":680,"memory_kb":65112,"score_of_the_acc":-2,"final_rank":15},{"submission_id":"aoj_2811_2688146","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst bool debug = true;\n#define dbg(...) if(debug) printf(__VA_ARGS__)\n#define print(var) if (debug) cout << #var << \" = \" << var << endl\n\nnamespace {\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\n template<typename T>\n ostream& operator<<(ostream& os, const vector<T>& xs) {\n if (xs.empty()) return os << \"[]\";\n os << xs[0];\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\n return os;\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\n return os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const map<K, V>& m) {\n bool first = true;\n for (auto p : m) {\n if (first) first = false;\n else os << \":\";\n os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n return os;\n }\n\n\n map<tuple<int, int, bool>, int> id;\n vector<tuple<int, int, bool>> fromId;\n\n struct Edge {\n int to, cost;\n Edge(int to, int cost) : to(to), cost(cost) {}\n };\n vector<vector<Edge>> Graph;\n\n int N, M, S, G;\n\n bool IN = false;\n bool OUT = true;\n\n void solve() {\n cin >> N >> M >> S >> G;\n S--; G--;\n vector<vector<tuple<int, int, bool>>> V(N);\n auto init = make_tuple(S, 0, IN);\n V[S].push_back(init);\n id[init] = 0;\n fromId.push_back(init);\n Graph.emplace_back();\n for (int i = 0; i < M; i++) {\n int u, v, t, c; cin >> u >> v >> t >> c;\n u--; v--;\n auto x = make_tuple(u, t, OUT);\n auto x_id = id.count(x) ? id[x] : fromId.size();\n if (not id.count(x)) {\n fromId.push_back(x);\n id[x] = x_id;\n Graph.emplace_back();\n }\n V[u].push_back(x);\n auto y = make_tuple(v, t + c, IN);\n auto y_id = id.count(y) ? id[y] : fromId.size();\n if (not id.count(y)) {\n fromId.push_back(y);\n id[y] = y_id;\n Graph.emplace_back();\n V[v].push_back(y);\n Graph[x_id].emplace_back(y_id, 0);\n }\n }\n for (auto& L : V) {\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) {\n return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b);\n });\n for (unsigned i = 0; i + 1 < L.size(); i++) {\n auto& x = L[i];\n auto& y = L[i + 1];\n auto time_x = get<1>(x);\n auto time_y = get<1>(y);\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\n }\n }\n\n auto start = id[ V[S][0] ];\n\n // dijkstra\n const int INF = 1<<28;\n vector<int> D(Graph.size(), INF);\n struct State {\n int v, cost;\n State(int v, int cost) : v(v), cost(cost) {}\n bool operator<(const State& s) const {\n return cost > s.cost;\n }\n };\n priority_queue<State> PQ;\n PQ.emplace(start, 0);\n D[start] = 0;\n while (not PQ.empty()) {\n auto cur = PQ.top(); PQ.pop();\n for (auto& e : Graph[cur.v]) {\n auto next = e.to;\n if (D[next] > cur.cost + e.cost) {\n D[next] = cur.cost + e.cost;\n PQ.emplace(next, D[next]);\n }\n }\n }\n int ans = INF;\n for (auto& goal_vertex : V[G]) {\n auto goal = id[goal_vertex];\n ans = min(ans, D[goal]);\n }\n cout << ans << endl;\n }\n}\n\nint main() {\n solve();\n return 0;\n}","accuracy":0.7586206896551724,"time_ms":680,"memory_kb":64980,"score_of_the_acc":-1.9976,"final_rank":14},{"submission_id":"aoj_2811_2688129","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst bool debug = true;\n#define dbg(...) if(debug) printf(__VA_ARGS__)\n#define print(var) if (debug) cout << #var << \" = \" << var << endl\n\nnamespace {\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\n template<typename T>\n ostream& operator<<(ostream& os, const vector<T>& xs) {\n if (xs.empty()) return os << \"[]\";\n os << xs[0];\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\n return os;\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\n return os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const map<K, V>& m) {\n bool first = true;\n for (auto p : m) {\n if (first) first = false;\n else os << \":\";\n os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n return os;\n }\n\n\n map<tuple<int, int, bool>, int> id;\n vector<tuple<int, int, bool>> fromId;\n\n struct Edge {\n int to, cost;\n Edge(int to, int cost) : to(to), cost(cost) {}\n };\n vector<vector<Edge>> Graph;\n\n int N, M, S, G;\n\n bool IN = false;\n bool OUT = true;\n\n void solve() {\n cin >> N >> M >> S >> G;\n S--; G--;\n vector<vector<tuple<int, int, bool>>> V(N);\n auto init = make_tuple(S, 0, IN);\n V[S].push_back(init);\n id[init] = 0;\n fromId.push_back(init);\n Graph.emplace_back();\n for (int i = 0; i < M; i++) {\n int u, v, t, c; cin >> u >> v >> t >> c;\n u--; v--;\n auto x = make_tuple(u, t, OUT);\n auto x_id = fromId.size();\n fromId.push_back(x);\n id[x] = x_id;\n Graph.emplace_back();\n V[u].push_back(x);\n auto y = make_tuple(v, t + c, IN);\n auto y_id = fromId.size();\n fromId.push_back(y);\n id[y] = y_id;\n Graph.emplace_back();\n V[v].push_back(y);\n Graph[x_id].emplace_back(y_id, 0);\n }\n for (auto& L : V) {\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) {\n return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b);\n });\n for (unsigned i = 0; i + 1 < L.size(); i++) {\n auto& x = L[i];\n auto& y = L[i + 1];\n auto time_x = get<1>(x);\n auto time_y = get<1>(y);\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\n }\n }\n\n auto start = id[ V[S][0] ];\n\n // dijkstra\n const int INF = 1<<28;\n vector<int> D(Graph.size(), INF);\n struct State {\n int v, cost;\n State(int v, int cost) : v(v), cost(cost) {}\n bool operator<(const State& s) const {\n return cost > s.cost;\n }\n };\n priority_queue<State> PQ;\n PQ.emplace(start, 0);\n D[start] = 0;\n while (not PQ.empty()) {\n auto cur = PQ.top(); PQ.pop();\n for (auto& e : Graph[cur.v]) {\n auto next = e.to;\n if (D[next] > cur.cost + e.cost) {\n D[next] = cur.cost + e.cost;\n PQ.emplace(next, D[next]);\n }\n }\n }\n int ans = INF;\n for (auto& goal_vertex : V[G]) {\n auto goal = id[goal_vertex];\n ans = min(ans, D[goal]);\n }\n cout << ans << endl;\n }\n}\n\nint main() {\n solve();\n return 0;\n}","accuracy":0.4827586206896552,"time_ms":500,"memory_kb":55124,"score_of_the_acc":-1.5405,"final_rank":18},{"submission_id":"aoj_2811_2688020","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst bool debug = true;\n#define dbg(...) if(debug) printf(__VA_ARGS__)\n#define print(var) if (debug) cout << #var << \" = \" << var << endl\n\nnamespace {\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\n template<typename T>\n ostream& operator<<(ostream& os, const vector<T>& xs) {\n if (xs.empty()) return os << \"[]\";\n os << xs[0];\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\n return os;\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\n return os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n template<typename K, typename V>\n ostream& operator<<(ostream& os, const map<K, V>& m) {\n bool first = true;\n for (auto p : m) {\n if (first) first = false;\n else os << \":\";\n os << \"(\" << p.first << \",\" << p.second << \")\";\n }\n return os;\n }\n\n\n map<tuple<int, int, bool>, int> id;\n vector<tuple<int, int, bool>> fromId;\n\n struct Edge {\n int to, cost;\n Edge(int to, int cost) : to(to), cost(cost) {}\n };\n vector<vector<Edge>> Graph;\n\n int N, M, S, G;\n\n bool IN = false;\n bool OUT = true;\n\n void solve() {\n cin >> N >> M >> S >> G;\n S--; G--;\n vector<vector<tuple<int, int, bool>>> V(N);\n auto init = make_tuple(S, 0, IN);\n V[S].push_back(init);\n id[init] = 0;\n fromId.push_back(init);\n Graph.emplace_back();\n for (int i = 0; i < M; i++) {\n int u, v, t, c; cin >> u >> v >> t >> c;\n u--; v--;\n auto x = make_tuple(u, t, OUT);\n auto x_id = fromId.size();\n fromId.push_back(x);\n id[x] = x_id;\n Graph.emplace_back();\n V[u].push_back(x);\n auto y = make_tuple(v, t + c, IN);\n auto y_id = fromId.size();\n fromId.push_back(y);\n id[y] = y_id;\n Graph.emplace_back();\n V[v].push_back(y);\n Graph[x_id].emplace_back(y_id, 0);\n }\n for (auto& L : V) {\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) { return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b); });\n }\n for (auto& L : V) {\n for (int i = 0; i + 1 < L.size(); i++) {\n auto& x = L[i];\n auto& y = L[i + 1];\n auto time_x = get<1>(x);\n auto time_y = get<1>(y);\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\n }\n }\n\n auto start = id[ V[S][0] ];\n\n // dijkstra\n const int INF = 1<<28;\n vector<int> D(Graph.size(), INF);\n struct State {\n int v, cost;\n State(int v, int cost) : v(v), cost(cost) {}\n bool operator<(const State& s) const {\n return cost > s.cost;\n }\n };\n priority_queue<State> PQ;\n PQ.emplace(start, 0);\n D[start] = 0;\n while (not PQ.empty()) {\n auto cur = PQ.top(); PQ.pop();\n for (auto& e : Graph[cur.v]) {\n auto next = e.to;\n if (D[next] > cur.cost + e.cost) {\n D[next] = cur.cost + e.cost;\n PQ.emplace(next, D[next]);\n }\n }\n }\n int ans = INF;\n for (auto& goal_vertex : V[G]) {\n auto goal = id[goal_vertex];\n ans = min(ans, D[goal]);\n }\n cout << ans << endl;\n }\n}\n\nint main() {\n solve();\n return 0;\n}","accuracy":0.4827586206896552,"time_ms":490,"memory_kb":55092,"score_of_the_acc":-1.5243,"final_rank":17},{"submission_id":"aoj_2811_2330124","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MP make_pair\n#define FF first\n#define SS second\n\nusing LL = long long;\nusing PII = pair<int,int>;\nusing PLL = pair<LL,LL>;\nusing PILL = pair<LL,PII>;\n\nconst LL INF = 1e15;\nconst int UB = 400010;\n\nint N, M, S, Gl;\nmap<PLL,int> ids;\nLL dist[UB];\nvoid dijk(vector<vector<PLL>>& G){\n priority_queue<PLL, vector<PLL>, greater<PLL>> pq;\n fill(dist, dist+UB, INF);\n pq.push(PLL(0,ids[MP(S,0)]));\n dist[ids[MP(S,0)]] = 0;\n\n while(!pq.empty()){\n\tPLL p = pq.top();\n\tpq.pop();\n\tif(p.FF > dist[p.SS])\n\t continue;\n\t \n\tfor(auto&& e: G[p.SS]){\n\t if(p.FF + e.SS < dist[e.FF]){\n\t\tdist[e.FF] = p.FF + e.SS;\n\t\tpq.push(MP(dist[e.FF], e.FF));\n\t }\n\t}\n }\n}\n\nint main(){\n cin >> N >> M >> S >> Gl;\n --S;\n --Gl;\n int id = 0;\n \n vector<vector<int>> tms(N);\n ids[MP(0,S)] = id++;\n tms[S].push_back(0);\n vector<vector<PLL>> G(UB);\n for(int i=0;i<M;++i){\n\tint u, v, t, c;\n\tcin >> u >> v >> t >> c;\n\t--u;\n\t--v;\n\tif(!ids.count(MP(u,t)))\n\t ids[MP(u,t)] = id++;\n\tif(!ids.count(MP(v,t+c)))\n\t ids[MP(v,t+c)] = id++;\n\ttms[u].push_back(t);\n\ttms[v].push_back(t+c);\n\tG[ids[MP(u,t)]].emplace_back(ids[MP(v,t+c)], 0);\n }\n\n for(int i=0;i<N;++i){\n\tsort(begin(tms[i]), end(tms[i]));\n\ttms[i].erase(unique(begin(tms[i]), end(tms[i])), end(tms[i]));\n\tfor(int j=0;j+1<tms[i].size();++j){\n\t G[ids[MP(i,tms[i][j])]].emplace_back(ids[MP(i,tms[i][j+1])], tms[i][j+1] - tms[i][j]);\n\t}\n }\n\n dijk(G);\n LL ans = INF;\n for(auto&& t: tms[Gl])\n\tans = min(ans, dist[ids[MP(Gl,t)]]);\n cout << ans << endl;\n \n return 0;\n}","accuracy":1,"time_ms":680,"memory_kb":60960,"score_of_the_acc":-1.9259,"final_rank":12}],"string":"[\n {\n \"submission_id\": \"aoj_2811_9752318\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int M = 200001;\\nint u[M], v[M], t[M], c[M];\\nvector<int> start[M], dest[M], busy_time[M];\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n\\n #ifdef BACKER\\n freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n // freopen(\\\"output.txt\\\", \\\"w\\\", stdout);\\n #endif\\n\\n int n, m, s, g;\\n cin >> n >> m >> s >> g;\\n for (int i = 0; i < m; i++) cin >> u[i] >> v[i] >> t[i] >> c[i];\\n for (int i = 0; i < m; i++) start[t[i]].push_back(i);\\n vector<int> best(n + 1, -2e9);\\n best[s] = 0;\\n int ans = 2e9;\\n for (int t = 0; t < M; t++) {\\n int sz = dest[t].size();\\n for (int i = 0; i < sz; i++) {\\n best[dest[t][i]] = max(best[dest[t][i]], busy_time[t][i]);\\n if (dest[t][i] == g) ans = min(ans, t - best[dest[t][i]]); \\n }\\n for (int i: start[t]) {\\n dest[t + c[i]].push_back(v[i]);\\n busy_time[t + c[i]].push_back(best[u[i]] + c[i]);\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 32172,\n \"score_of_the_acc\": -0.4745,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2811_9118118\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\nint n, m, s, g;\\nint u[200005], v[200005], t[200005], c[200005];\\nint st[100005], ed[100005];\\nint sum;\\nint head[400005], dis[400005], vis[400005];\\nstruct pi\\n{\\n int v, t, id;\\n pi(int aa = 0, int bb = 0)\\n {\\n v = aa;\\n t = bb;\\n }\\n bool operator<(const pi &bb) const\\n {\\n return t < bb.t;\\n }\\n};\\nvector<pi> p[200005];\\nstruct node\\n{\\n int v, w, nxt;\\n} a[400005];\\nstruct node2\\n{\\n int id, dis;\\n node2(int aa = 0, int bb = 0)\\n {\\n id = aa;\\n dis = bb;\\n }\\n bool operator<(const node2 &bb) const\\n {\\n return dis > bb.dis;\\n }\\n};\\npriority_queue<node2> q;\\nvoid ins(int u, int v, int w)\\n{\\n ++sum;\\n a[sum].v = v;\\n a[sum].w = w;\\n a[sum].nxt = head[u];\\n head[u] = sum;\\n}\\nvoid dijkstra()\\n{\\n memset(dis, 0x7f, sizeof(dis));\\n dis[0] = 0;\\n q.push(node2(0, dis[0]));\\n while (!q.empty())\\n {\\n int id = q.top().id;\\n q.pop();\\n if (id == st[g])\\n break;\\n if (vis[id])\\n continue;\\n vis[id] = 1;\\n if (head[id])\\n for (int d = head[id]; d; d = a[d].nxt)\\n if (dis[id] + a[d].w < dis[a[d].v])\\n {\\n dis[a[d].v] = dis[id] + a[d].w;\\n q.push(node2(a[d].v, dis[a[d].v]));\\n }\\n }\\n return;\\n}\\nint main()\\n{\\n cin >> n >> m >> s >> g;\\n for (int i = 1; i <= m; ++i)\\n {\\n cin >> u[i] >> v[i] >> t[i] >> c[i];\\n p[u[i]].push_back(pi(v[i], t[i]));\\n }\\n for (int i = 1; i <= n; ++i)\\n sort(p[i].begin(), p[i].end());\\n for (int i = 1; i <= n; ++i)\\n {\\n if (i == g)\\n {\\n st[i] = ed[i - 1] + 1;\\n ed[i] = ed[i - 1] + 1;\\n continue;\\n }\\n st[i] = ed[i - 1] + 1;\\n ed[i] = max(st[i], st[i] + (int)p[i].size() - 1);\\n if (p[i].size())\\n {\\n if (p[i].size() > 1)\\n for (int j = 0; j < p[i].size() - 1; ++j)\\n {\\n p[i][j].id = j;\\n ins(st[i] + j, st[i] + j + 1, p[i][j + 1].t - p[i][j].t);\\n }\\n p[i][p[i].size() - 1].id = p[i].size() - 1;\\n }\\n }\\n ins(0, st[s], p[s][0].t);\\n for (int i = 1; i <= m; ++i)\\n {\\n pi k = *(--upper_bound(p[u[i]].begin(), p[u[i]].end(), pi(0, t[i])));\\n if (v[i] == g)\\n {\\n ins(st[u[i]] + k.id, st[v[i]], 0);\\n continue;\\n }\\n if (p[v[i]].size())\\n if (lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i])) != p[v[i]].end())\\n {\\n pi kk = *lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i]));\\n ins(st[u[i]] + k.id, st[v[i]] + kk.id, kk.t - t[i] - c[i]);\\n }\\n }\\n dijkstra();\\n cout << dis[st[g]] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 25612,\n \"score_of_the_acc\": -0.4512,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2811_9118103\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\nint n, m, s, g;\\nint u[400005], v[400005], t[400005], c[400005];\\nint st[400005], ed[400005];\\nint sum;\\nint head[400005], dis[400005], vis[400005];\\nstruct pi\\n{\\n int v, t, id;\\n pi(int aa = 0, int bb = 0)\\n {\\n v = aa;\\n t = bb;\\n }\\n bool operator<(const pi &bb) const\\n {\\n return t < bb.t;\\n }\\n};\\nvector<pi> p[400005];\\nstruct node\\n{\\n int v, w, nxt;\\n} a[800005];\\nstruct node2\\n{\\n int id, dis;\\n node2(int aa = 0, int bb = 0)\\n {\\n id = aa;\\n dis = bb;\\n }\\n bool operator<(const node2 &bb) const\\n {\\n return dis > bb.dis;\\n }\\n};\\npriority_queue<node2> q;\\nvoid ins(int u, int v, int w)\\n{\\n ++sum;\\n a[sum].v = v;\\n a[sum].w = w;\\n a[sum].nxt = head[u];\\n head[u] = sum;\\n}\\nvoid dijkstra()\\n{\\n memset(dis, 0x7f, sizeof(dis));\\n dis[0] = 0;\\n q.push(node2(0, dis[0]));\\n while (!q.empty())\\n {\\n int id = q.top().id;\\n q.pop();\\n if (id == st[g])\\n break;\\n if (vis[id])\\n continue;\\n vis[id] = 1;\\n if (head[id])\\n for (int d = head[id]; d; d = a[d].nxt)\\n if (dis[id] + a[d].w < dis[a[d].v])\\n {\\n dis[a[d].v] = dis[id] + a[d].w;\\n q.push(node2(a[d].v, dis[a[d].v]));\\n }\\n }\\n return;\\n}\\nint main()\\n{\\n cin >> n >> m >> s >> g;\\n for (int i = 1; i <= m; ++i)\\n {\\n cin >> u[i] >> v[i] >> t[i] >> c[i];\\n p[u[i]].push_back(pi(v[i], t[i]));\\n }\\n for (int i = 1; i <= n; ++i)\\n sort(p[i].begin(), p[i].end());\\n for (int i = 1; i <= n; ++i)\\n {\\n if (i == g)\\n {\\n st[i] = ed[i - 1] + 1;\\n ed[i] = ed[i - 1] + 1;\\n continue;\\n }\\n st[i] = ed[i - 1] + 1;\\n ed[i] = max(st[i], st[i] + (int)p[i].size() - 1);\\n if (p[i].size())\\n {\\n if (p[i].size() > 1)\\n for (int j = 0; j < p[i].size() - 1; ++j)\\n {\\n p[i][j].id = j;\\n ins(st[i] + j, st[i] + j + 1, p[i][j + 1].t - p[i][j].t);\\n }\\n p[i][p[i].size() - 1].id = p[i].size() - 1;\\n }\\n }\\n ins(0, st[s], p[s][0].t);\\n for (int i = 1; i <= m; ++i)\\n {\\n pi k = *(--upper_bound(p[u[i]].begin(), p[u[i]].end(), pi(0, t[i])));\\n if (v[i] == g)\\n {\\n ins(st[u[i]] + k.id, st[v[i]], 0);\\n continue;\\n }\\n if (p[v[i]].size())\\n if (lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i])) != p[v[i]].end())\\n {\\n pi kk = *lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i]));\\n ins(st[u[i]] + k.id, st[v[i]] + kk.id, kk.t - t[i] - c[i]);\\n }\\n }\\n dijkstra();\\n cout << dis[st[g]] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 36308,\n \"score_of_the_acc\": -0.6265,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2811_9117931\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\nint n, m, s, g;\\nint u[200005], v[200005], t[200005], c[200005];\\nint st[100005], ed[100005];\\nint sum;\\nint head[200005], dis[200005], vis[200005];\\nstruct pi\\n{\\n int v, t, id;\\n pi(int aa = 0, int bb = 0)\\n {\\n v = aa;\\n t = bb;\\n }\\n bool operator<(const pi &bb) const\\n {\\n return t < bb.t;\\n }\\n};\\nvector<pi> p[100005];\\nstruct node\\n{\\n int v, w, nxt;\\n} a[400005];\\nstruct node2\\n{\\n int id, dis;\\n node2(int aa = 0, int bb = 0)\\n {\\n id = aa;\\n dis = bb;\\n }\\n bool operator<(const node2 &bb) const\\n {\\n return dis > bb.dis;\\n }\\n};\\npriority_queue<node2> q;\\nvoid ins(int u, int v, int w)\\n{\\n ++sum;\\n a[sum].v = v;\\n a[sum].w = w;\\n a[sum].nxt = head[u];\\n head[u] = sum;\\n}\\nvoid dijkstra()\\n{\\n memset(dis, 0x7f, sizeof(dis));\\n dis[0] = 0;\\n q.push(node2(0, dis[0]));\\n while (!q.empty())\\n {\\n int id = q.top().id;\\n q.pop();\\n if (id == st[g])\\n break;\\n if (vis[id])\\n continue;\\n vis[id] = 1;\\n if (head[id])\\n for (int d = head[id]; d; d = a[d].nxt)\\n if (dis[id] + a[d].w < dis[a[d].v])\\n {\\n dis[a[d].v] = dis[id] + a[d].w;\\n q.push(node2(a[d].v, dis[a[d].v]));\\n }\\n }\\n return;\\n}\\nint main()\\n{\\n cin >> n >> m >> s >> g;\\n for (int i = 1; i <= m; ++i)\\n {\\n cin >> u[i] >> v[i] >> t[i] >> c[i];\\n p[u[i]].push_back(pi(v[i], t[i]));\\n }\\n for (int i = 1; i <= n; ++i)\\n sort(p[i].begin(), p[i].end());\\n for (int i = 1; i <= n; ++i)\\n {\\n if (i == g)\\n {\\n st[i] = ed[i - 1] + 1;\\n ed[i] = ed[i - 1] + 1;\\n continue;\\n }\\n st[i] = ed[i - 1] + 1;\\n ed[i] = max(st[i], st[i] + (int)p[i].size() - 1);\\n if (p[i].size())\\n {\\n for (int j = 0; j < p[i].size() - 1; ++j)\\n {\\n p[i][j].id = j;\\n ins(st[i] + j, st[i] + j + 1, p[i][j + 1].t - p[i][j].t);\\n }\\n p[i][p[i].size() - 1].id = p[i].size() - 1;\\n }\\n }\\n ins(0, st[s], p[s][0].t);\\n for (int i = 1; i <= m; ++i)\\n {\\n pi k = *(--upper_bound(p[u[i]].begin(), p[u[i]].end(), pi(0, t[i])));\\n if (v[i] == g)\\n {\\n ins(st[u[i]] + k.id, st[v[i]], 0);\\n continue;\\n }\\n if (lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i])) != p[v[i]].end())\\n {\\n pi kk = *lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i]));\\n ins(st[u[i]] + k.id, st[v[i]] + kk.id, kk.t - t[i] - c[i]);\\n }\\n }\\n dijkstra();\\n cout << dis[st[g]] << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.6551724137931034,\n \"time_ms\": 130,\n \"memory_kb\": 19808,\n \"score_of_the_acc\": -0.332,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2811_9117909\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\\n\\ntemplate <typename T> bool chmin(T &a, const T &b) {\\n\\tif (a <= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> bool chmax(T &a, const T &b) {\\n\\tif (a >= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> T max(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T min(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T sum(vector<T> &a){\\n\\tT ret = 0;\\n\\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\\n\\treturn ret;\\n}\\n\\n\\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),\\n F (*composition)(F, F), F (*id)()>\\nstruct lazysegtree {\\n private:\\n int n, lg2, sz;\\n std::vector<S> d;\\n std::vector<F> lz;\\n\\n void update(int i) {\\n d[i] = op(d[2 * i], d[2 * i + 1]);\\n }\\n\\n void all_apply(int i, F f) {\\n d[i] = mapping(f, d[i]);\\n if (i < sz) lz[i] = composition(f, lz[i]);\\n }\\n\\n void push(int i) {\\n all_apply(2 * i, lz[i]);\\n all_apply(2 * i + 1, lz[i]);\\n lz[i] = id();\\n }\\n\\n public:\\n lazysegtree(int _n) : lazysegtree(std::vector<S>(_n, e())) {}\\n\\n lazysegtree(const std::vector<S> &v) : n(v.size()) {\\n lg2 = 0;\\n while ((1 << lg2) < n) lg2++;\\n sz = 1 << lg2;\\n d = std::vector<S>(2 * sz, e());\\n lz = std::vector<F>(2 * sz, id());\\n for (int i = 0; i < n; i++) d[sz + i] = v[i];\\n for (int i = sz - 1; i >= 1; i--) update(i);\\n }\\n\\n void set(int p, S x) {\\n assert(0 <= p && p < n);\\n p += sz;\\n rrep(i, 1, lg2 + 1) push(p >> i);\\n d[p] = x;\\n rep(i, 1, lg2 + 1) update(p >> i);\\n }\\n\\n S get(int p) {\\n assert(0 <= p && p < n);\\n p += sz;\\n rrep(i, 1, lg2 + 1) 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 l += sz;\\n r += sz;\\n rrep(i, 1, lg2 + 1) {\\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() {\\n return d[1];\\n }\\n\\n void apply(int p, F f) {\\n assert(0 <= p && p < n);\\n p += sz;\\n rrep(i, 1, lg2 + 1) push(p >> i);\\n d[p] = mapping(f, d[p]);\\n rep(i, 1, lg2 + 1) update(p >> i);\\n }\\n\\n void apply(int l, int r, F f) {\\n assert(0 <= l && l <= r && r <= n);\\n if (l == r) return;\\n l += sz;\\n r += sz;\\n rrep(i, 1, lg2 + 1) {\\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 rep(i, 1, lg2 + 1) {\\n if (((l >> i) << i) != l) update(l >> i);\\n if (((r >> i) << i) != r) update((r - 1) >> i);\\n }\\n }\\n\\n template <class G> 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 += sz;\\n for (int i = lg2; 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 < sz) {\\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 - sz;\\n }\\n sm = op(sm, d[l]);\\n l++;\\n } while ((l & -l) != l);\\n return n;\\n }\\n\\n template <class G> 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 += sz;\\n for (int i = lg2; 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 < sz) {\\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 - sz;\\n }\\n sm = op(d[r], sm);\\n } while ((r & -r) != r);\\n return 0;\\n }\\n};\\n\\nusing S = long long;\\nusing F = long long;\\n\\nconst S INF = 1e18;\\n\\nS op(S a, S b){ return std::min(a, b); }\\nS e(){ return INF; }\\nS mapping(F f, S x){ return f+x; }\\nF composition(F f, F g){ return f+g; }\\nF id(){ return 0; }\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n\\n\\tint n, m; cin >> n >> m;\\n\\tint S, G; cin >> S >> G;\\n\\tS--; G--;\\n\\n\\t\\n\\tvector<int> u(m), v(m);\\n\\t\\n\\tvector bucket(255555, vector<pair<int,int>>(0));\\n\\trep(i,0,m){\\n\\t\\tcin >> u[i] >> v[i];\\n\\t\\tu[i]--; v[i]--;\\n\\t\\tint t, c; cin >> t >> c;\\n\\t\\tbucket[t].push_back(pair(0, i));\\n\\t\\tbucket[t + c].push_back(pair(1, i));\\n\\t}\\n\\n\\tlazysegtree<ll,op,e,ll,mapping,composition,id> seg(n);\\n\\tseg.set(S, 0);\\n\\n\\tll ans = 1e18;\\n\\tvector<ll> hokan(m);\\n\\trep(tim,0,244444){\\n\\t\\tsort(bucket[tim].begin(), bucket[tim].end());\\n\\t\\treverse(bucket[tim].begin(), bucket[tim].end());\\n\\t\\tfor (auto [typ,ind]: bucket[tim]){\\n\\t\\t\\tif (typ == 0){\\n\\t\\t\\t\\thokan[ind] = seg.get(u[ind]);\\t\\t\\t\\t\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tseg.set(v[ind], min(seg.get(v[ind]), hokan[ind]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tchmin(ans, seg.get(G));\\n\\t\\tseg.apply(0, n, 1);\\n\\t}\\n\\tcout << ans << '\\\\n';\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 22820,\n \"score_of_the_acc\": -0.3701,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2811_9117825\",\n \"code_snippet\": \"//#include<atcoder/all>\\n//using namespace atcoder;\\n\\n#include <bits/stdc++.h>\\ntemplate<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}\\ntemplate<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}\\n#define ll long long\\n#define double long double\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define REP(i,n) for(int i=1;i<=(n);i++)\\n#define mod (ll)(1e9+7)\\n#define inf (ll)(3e18+7)\\n#define eps (double)(1e-9)\\n#define pi (double) acos(-1)\\n#define all(x) x.begin(),x.end()\\n#define rall(x) x.rbegin(),x.rend()\\nusing namespace std;\\n\\nstruct edge{\\n ll to, cost;\\n};\\n\\nusing Graph = vector<vector<edge>>;\\n\\n#define P pair<int, int>\\nvector<ll> dijkstra(const vector<vector<edge>> &G, int s) {\\n vector<ll> d((int)G.size(), inf);\\n\\tpriority_queue<P, vector<P>, greater<P>>que;\\n\\td[s] = 0;\\n\\tque.push(P(0, s));\\n\\twhile (!que.empty()) {\\n\\t\\tP p = que.top(); que.pop();\\n\\t\\tint v = p.second;\\n\\t\\tif (d[v] < p.first)continue;\\n\\t\\trep(i, G[v].size()) {\\n\\t\\t\\tedge e = G[v][i];\\n\\t\\t\\tif (d[e.to] > d[v] + e.cost) {\\n\\t\\t\\t\\td[e.to] = d[v] + e.cost;\\n\\t\\t\\t\\tque.push(P(d[e.to], e.to));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn d;\\n}\\n\\nint main(){\\n int n, m, s, g;\\n cin >> n >> m >> s >> g;\\n s--; g--;\\n\\n vector<int> u(m), v(m), t(m), c(m);\\n rep(i, m)cin >> u[i] >> v[i] >> t[i] >> c[i];\\n rep(i, m){u[i]--; v[i]--;}\\n\\n vector<vector<int>> vec(n);\\n rep(i, m)vec[u[i]].push_back(t[i]);\\n rep(i, m)vec[v[i]].push_back(t[i]+c[i]);\\n vec[s].insert(vec[s].begin(), 0);\\n rep(i, n)sort(all(vec[i]));\\n\\n int now = 0;\\n map<P, int> idx;\\n rep(i, n)rep(j, (int)vec[i].size()){\\n idx[{i, vec[i][j]}] = now;\\n now++;\\n }\\n\\n idx[{s, 0}] = now;\\n now++;\\n\\n Graph G(now);\\n\\n rep(i, m){\\n G[idx[{u[i], t[i]}]].push_back({idx[{v[i], t[i]+c[i]}], 0});\\n }\\n\\n rep(i, n)rep(j, (int)vec[i].size()-1){\\n G[idx[{i, vec[i][j]}]].push_back({idx[{i, vec[i][j+1]}], vec[i][j+1]-vec[i][j]});\\n }\\n\\n ll ans = inf;\\n vector<ll> d = dijkstra(G, idx[{s, 0}]);\\n rep(i, (int)vec[g].size())chmin(ans, d[idx[{g, vec[g][i]}]]);\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 64064,\n \"score_of_the_acc\": -1.9032,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2811_9117818\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\nint n, m, s, g;\\nint u[200005], v[200005], t[200005], c[200005];\\nint st[100005], ed[100005];\\nint sum;\\nint head[200005], dis[200005], vis[200005];\\nstruct pi\\n{\\n int v, t, c, id;\\n pi(int aa = 0, int bb = 0, int cc = 0)\\n {\\n v = aa;\\n t = bb;\\n c = cc;\\n }\\n bool operator<(const pi &bb) const\\n {\\n return t < bb.t;\\n }\\n};\\nvector<pi> p[100005];\\nstruct node\\n{\\n int v, w, nxt;\\n} a[300005];\\nstruct node2\\n{\\n int id, dis;\\n node2(int aa = 0, int bb = 0)\\n {\\n id = aa;\\n dis = bb;\\n }\\n bool operator<(const node2 &bb) const\\n {\\n return dis > bb.dis;\\n }\\n};\\npriority_queue<node2> q;\\nvoid ins(int u, int v, int w)\\n{\\n ++sum;\\n a[sum].v = v;\\n a[sum].w = w;\\n a[sum].nxt = head[u];\\n head[u] = sum;\\n}\\nvoid dijkstra()\\n{\\n memset(dis, 0x7f, sizeof(dis));\\n dis[0] = 0;\\n q.push(node2(0, dis[0]));\\n while (!q.empty())\\n {\\n int id = q.top().id;\\n q.pop();\\n if (vis[id])\\n continue;\\n vis[id] = 1;\\n for (int d = head[id]; d; d = a[d].nxt)\\n if (dis[id] + a[d].w < dis[a[d].v])\\n {\\n dis[a[d].v] = dis[id] + a[d].w;\\n q.push(node2(a[d].v, dis[a[d].v]));\\n }\\n }\\n return;\\n}\\nint main()\\n{\\n cin >> n >> m >> s >> g;\\n for (int i = 1; i <= m; ++i)\\n {\\n cin >> u[i] >> v[i] >> t[i] >> c[i];\\n p[u[i]].push_back(pi(v[i], t[i], c[i]));\\n }\\n for (int i = 1; i <= n; ++i)\\n sort(p[i].begin(), p[i].end());\\n for (int i = 1; i <= n; ++i)\\n {\\n if (i == g)\\n {\\n st[i] = ed[i - 1] + 1;\\n ed[i] = ed[i - 1] + 1;\\n continue;\\n }\\n if (p[i].size())\\n {\\n st[i] = ed[i - 1] + 1;\\n ed[i] = st[i] + p[i].size() - 1;\\n for (int j = 0; j < p[i].size() - 1; ++j)\\n {\\n p[i][j].id = j;\\n ins(st[i] + j, st[i] + j + 1, p[i][j + 1].t - p[i][j].t);\\n }\\n p[i][p[i].size() - 1].id = p[i].size() - 1;\\n }\\n }\\n ins(0, st[s], p[s][0].t);\\n for (int i = 1; i <= m; ++i)\\n {\\n pi k = *lower_bound(p[u[i]].begin(), p[u[i]].end(), pi(0, t[i], 0));\\n if (v[i] == g)\\n {\\n ins(st[u[i]] + k.id, st[v[i]], 0);\\n continue;\\n }\\n if (lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i], 0)) != p[v[i]].end())\\n {\\n pi kk = *lower_bound(p[v[i]].begin(), p[v[i]].end(), pi(0, t[i] + c[i], 0));\\n ins(st[u[i]] + k.id, st[v[i]] + kk.id, kk.t - t[i] - c[i]);\\n }\\n }\\n dijkstra();\\n cout << dis[st[g]] << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.3103448275862069,\n \"time_ms\": 90,\n \"memory_kb\": 17736,\n \"score_of_the_acc\": -0.2325,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2811_9117760\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\n\\nvoid solve(){\\n int n, m, sv, gv; in(n,m,sv,gv); sv--, gv--;\\n vector<int> from(m), to(m), ts(m), cs(m);\\n rep(i,m){\\n int u, v; in(u,v); u--, v--;\\n int t, c; in(t,c);\\n from[i] = u;\\n to[i] = v;\\n ts[i] = t;\\n cs[i] = c;\\n }\\n vector<int> ids(m); iota(all(ids),0);\\n sort(all(ids),[&](int l, int r){\\n return ts[l] < ts[r];\\n });\\n vector<int> dp(n,-iinf);\\n dp[sv] = 0;\\n priority_queue<pii,vector<pii>,greater<pii>> pque;\\n vector<int> cal(m,-iinf);\\n int ans = iinf;\\n for (int i : ids){\\n while (!pque.empty() && pque.top().first <= ts[i]){\\n auto [t, id] = pque.top(); pque.pop();\\n chmax(dp[to[id]],cal[id]);\\n }\\n cal[i] = dp[from[i]] + cs[i];\\n pque.push(pii(ts[i]+cs[i],i));\\n if (to[i] == gv){\\n chmin(ans,ts[i]+cs[i]-cal[i]);\\n }\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 9088,\n \"score_of_the_acc\": -0.0312,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2811_9117709\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\n\\nvoid solve(){\\n int n, m, sv, gv; in(n,m,sv,gv); sv--, gv--;\\n vector<vector<array<int,3>>> g(n);\\n rep(tt,m){\\n int u, v; in(u,v); u--, v--;\\n int t, c; in(t,c);\\n g[u].push_back({v,t,c});\\n g[v].push_back({u,t,c});\\n }\\n using ppi = pair<pii,int>;\\n priority_queue<ppi,vector<ppi>,greater<ppi>> pque;\\n vector<pii> dist(n,pii(iinf,iinf));\\n dist[sv] = pii(0,0);\\n pque.push(ppi(dist[sv],sv));\\n while (!pque.empty()){\\n auto [dd, v] = pque.top(); pque.pop();\\n if (dist[v] < dd) continue;\\n auto [val, cur] = dd;\\n int sum = cur - val;\\n for (auto [u, t, c] : g[v]){\\n if (cur > t) continue;\\n int nval = t+c - (sum+c);\\n int ncur = t+c;\\n if (chmin(dist[u],pii(nval,ncur))){\\n pque.push(ppi(dist[u],u));\\n }\\n }\\n }\\n out(dist[gv].first);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 0.3103448275862069,\n \"time_ms\": 40,\n \"memory_kb\": 12272,\n \"score_of_the_acc\": -0.0568,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2811_8491937\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2811.cc: Rainy Bus Stops\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n#include<utility>\\n#include<tuple>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\nconst int MAX_M = 200000;\\nconst int MAX_K = MAX_M * 2 + 1;\\nconst long long LINF = 1LL << 60;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,int> pli;\\ntypedef vector<pii> vpii;\\ntypedef tuple<int,int,int,int> quadi;\\n\\n/* global variables */\\n\\nquadi es[MAX_M];\\npii ps[MAX_K];\\nvpii nbrs[MAX_K];\\nll ds[MAX_K];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, m, st, gl;\\n scanf(\\\"%d%d%d%d\\\", &n, &m, &st, &gl);\\n\\n int k = 0;\\n ps[k++] = pii(st, 0);\\n for (int i = 0; i < m; i++) {\\n int u, v, t, c;\\n scanf(\\\"%d%d%d%d\\\", &u, &v, &t, &c);\\n es[i] = { u, v, t, c };\\n ps[k++] = pii(u, t), ps[k++] = pii(v, t + c);\\n }\\n\\n sort(ps, ps + k);\\n k = unique(ps, ps + k) - ps;\\n\\n for (int i = 1; i < k; i++)\\n if (ps[i - 1].first == ps[i].first)\\n nbrs[i - 1].push_back(pii(i, ps[i].second - ps[i - 1].second));\\n\\n for (int i = 0; i < m; i++) {\\n auto [ u, v, t, c ] = es[i];\\n int ui = lower_bound(ps, ps + k, pii(u, t)) - ps;\\n int vi = lower_bound(ps, ps + k, pii(v, t + c)) - ps;\\n nbrs[ui].push_back(pii(vi, 0));\\n }\\n\\n int pst = lower_bound(ps, ps + k, pii(st, 0)) - ps;\\n \\n fill(ds, ds + k, LINF);\\n ds[pst] = 0;\\n \\n priority_queue<pli> q;\\n q.push(pli(0, pst));\\n\\n while (! q.empty()) {\\n auto ue = q.top(); q.pop();\\n ll ud = -ue.first;\\n int u = ue.second;\\n if (ud != ds[u]) continue;\\n\\n for (auto &vw: nbrs[u]) {\\n int v = vw.first;\\n ll vd = ud + vw.second;\\n if (ds[v] > vd) {\\n\\tds[v] = vd;\\n\\tq.push(pli(-vd, v));\\n }\\n }\\n }\\n\\n ll mind = LINF;\\n for (int i = 0; i < k; i++)\\n if (ps[i].first == gl) mind = min(mind, ds[i]);\\n\\n printf(\\\"%lld\\\\n\\\", mind);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 34136,\n \"score_of_the_acc\": -0.6658,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2811_5967327\",\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\\\";}\\nstruct edge{\\n int to,t;\\n ll cost;\\n edge(int to,int t,ll cost):to(to),t(t),cost(cost){}\\n};\\nstruct edge2{\\n int to,id;\\n ll cost;\\n edge2(int to,int id,ll cost):to(to),id(id),cost(cost){}\\n};\\nusing tp=tuple<ll,int,int>;\\nint main(){\\n int n,m,S,G;\\n cin>>n>>m>>S>>G;\\n --S;--G;\\n V<V<edge>> g(n);\\n V<V<int>> tmp(n);\\n for(int i=0;i<m;i++){\\n ll u,v,t,c;\\n cin>>u>>v>>t>>c;\\n --u;--v;\\n g[u].emplace_back(v,t,c);\\n tmp[u].emplace_back(t);\\n }\\n V<V<ll>> dp(n);\\n V<V<V<edge2>>> e(n);\\n for(int i=0;i<n;i++){\\n sort(all(g[i]),[](auto a,auto b){\\n if(a.t!=b.t)return a.t<b.t;\\n return a.cost<b.cost;\\n });\\n dp[i].assign(g[i].size()+1,inf);\\n e[i].resize(g[i].size()+1);\\n sort(all(tmp[i]));\\n }\\n for(int i=0;i<n;i++){\\n int sz=g[i].size();\\n for(int j=0;j<sz;j++){\\n edge cp=g[i][j];\\n if(j!=sz-1){\\n edge cp2=g[i][j+1];\\n e[i][j].emplace_back(i,j+1,cp2.t-cp.t);\\n }\\n if(cp.to==G){\\n e[i][j].emplace_back(cp.to,0,0);\\n }else{\\n auto ite=lower_bound(all(tmp[cp.to]),cp.t+cp.cost);\\n if(ite!=tmp[cp.to].end()){\\n e[i][j].emplace_back(cp.to,(int)(ite-tmp[cp.to].begin()),*ite-(cp.t+cp.cost));\\n }\\n }\\n }\\n }\\n priority_queue<tp,V<tp>,greater<tp>> pq;\\n pq.emplace(0,S,0);\\n dp[S][0]=g[S][0].t;\\n while(pq.size()){\\n auto [v,cur,id]=pq.top();\\n pq.pop();\\n if(dp[cur][id]<v)continue;\\n for(edge2 &to:e[cur][id]){\\n if(chmin(dp[to.to][to.id],dp[cur][id]+to.cost)){\\n pq.emplace(dp[to.to][to.id],to.to,to.id);\\n }\\n }\\n }\\n cout<<dp[G][0]<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 39180,\n \"score_of_the_acc\": -0.6621,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2811_3992938\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nstruct Edge {\\n\\tint to, sttime, cost, index;\\n\\tEdge(const int t, const int s, const int c, const int i) {\\n\\t\\tto = t, sttime = s, cost = c, index = i;\\n\\t\\treturn;\\n\\t}\\n\\tbool operator<(const Edge&e)const {\\n\\t\\treturn sttime < e.sttime;\\n\\t}\\n};\\n\\nint main() {\\n\\tint N, M, S, G;\\n\\tcin >> N >> M >> S >> G;\\n\\tS--, G--;\\n\\tvector<vector<Edge>>edge(N);\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tint l, r, s, t;\\n\\t\\tcin >> l >> r >> s >> t;\\n\\t\\tl--, r--;\\n\\t\\tedge[l].push_back(Edge(r, s, t, i));\\n\\t}\\n//cout << \\\"JHIJHI\\\" << endl;\\n\\tfor (int i = 0; i < N; i++)sort(edge[i].begin(), edge[i].end());\\n\\tvector<vector<pair<int, int>>>dis_edge(M + 1);\\n//\\tcout << \\\"GUUG\\\" << endl;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < (int)(edge[i].size()) - 1; j++) {\\n\\t\\t\\tdis_edge[edge[i][j].index].push_back({ edge[i][j + 1].index,edge[i][j + 1].sttime - edge[i][j].sttime });\\n\\t\\t}\\n\\t\\tvector<pair<int, int>>box;\\n\\t\\tfor (auto j : edge[i]) {\\n\\t\\t\\tif (j.to == G) {\\n\\t\\t\\t\\tdis_edge[j.index].push_back({ M,0 });\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif (edge[j.to].empty())continue;\\n\\t\\t\\tint L = -1, R = edge[j.to].size();\\n\\t\\t\\twhile (R - L > 1) {\\n\\t\\t\\t\\tint mid = (R + L) / 2;\\n\\t\\t\\t\\tif (edge[j.to][mid].sttime >= j.sttime + j.cost)R = mid;\\n\\t\\t\\t\\telse L = mid;\\n\\t\\t\\t}\\n\\t\\t\\tif (R == edge[j.to].size())continue;\\n\\t\\t\\tdis_edge[j.index].push_back({ edge[j.to][R].index,edge[j.to][R].sttime - j.cost - j.sttime });\\n\\t\\t}\\n\\t}\\n\\t//cout << \\\"Ho\\\" << endl;\\n\\tvector<int>dis(M+1, MOD);\\n\\tpriority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>PQ;\\n\\tfor (auto i : edge[S]) {\\n\\t\\tdis[i.index] = i.sttime;\\n\\t\\tPQ.push({ i.sttime,i.index });\\n\\t}\\n\\twhile (!PQ.empty()) {\\n\\t\\tint cn = PQ.top().second;\\n\\t\\tint c = PQ.top().first;\\n\\t\\tPQ.pop();\\n\\t\\tfor (auto j : dis_edge[cn]) {\\n\\t\\t\\tif (dis[j.first] > c + j.second) {\\n\\t\\t\\t\\tdis[j.first] = c + j.second;\\n\\t\\t\\t\\tPQ.push({ dis[j.first],j.first });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << dis[M] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 21312,\n \"score_of_the_acc\": -0.4994,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2811_3991500\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nstruct Edge {\\n\\tint to, sttime, cost, index;\\n\\tEdge(const int t, const int s, const int c, const int i) {\\n\\t\\tto = t, sttime = s, cost = c, index = i;\\n\\t\\treturn;\\n\\t}\\n\\tbool operator<(const Edge&e)const {\\n\\t\\treturn sttime < e.sttime;\\n\\t}\\n};\\n\\nint main() {\\n\\tint N, M, S, G;\\n\\tcin >> N >> M >> S >> G;\\n\\tS--, G--;\\n\\tvector<vector<Edge>>edge(N);\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tint l, r, s, t;\\n\\t\\tcin >> l >> r >> s >> t;\\n\\t\\tl--, r--;\\n\\t\\tedge[l].push_back(Edge(r, s, t, i));\\n\\t}\\n//cout << \\\"JHIJHI\\\" << endl;\\n\\tfor (int i = 0; i < N; i++)sort(edge[i].begin(), edge[i].end());\\n\\tvector<vector<pair<int, int>>>dis_edge(M + 1);\\n//\\tcout << \\\"GUUG\\\" << endl;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < (int)(edge[i].size()) - 1; j++) {\\n\\t\\t\\tdis_edge[edge[i][j].index].push_back({ edge[i][j + 1].index,edge[i][j + 1].sttime - edge[i][j].sttime });\\n\\t\\t}\\n\\t\\tvector<pair<int, int>>box;\\n\\t\\tfor (auto j : edge[i]) {\\n\\t\\t\\tif (j.to == G) {\\n\\t\\t\\t\\tdis_edge[j.index].push_back({ M,0 });\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif (edge[j.to].empty())continue;\\n\\t\\t\\tint L = -1, R = edge[j.to].size();\\n\\t\\t\\twhile (R - L > 1) {\\n\\t\\t\\t\\tint mid = (R + L) / 2;\\n\\t\\t\\t\\tif (edge[j.to][mid].sttime >= j.sttime + j.cost)R = mid;\\n\\t\\t\\t\\telse L = mid;\\n\\t\\t\\t}\\n\\t\\t\\tif (R == edge[j.to].size())continue;\\n\\t\\t\\tdis_edge[j.index].push_back({ edge[j.to][R].index,edge[j.to][R].sttime - j.cost - j.sttime });\\n\\t\\t}\\n\\t}\\n\\t//cout << \\\"Ho\\\" << endl;\\n\\tvector<int>dis(M+1, MOD);\\n\\tpriority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>PQ;\\n\\tfor (auto i : edge[S]) {\\n\\t\\tdis[i.index] = i.sttime;\\n\\t\\tPQ.push({ i.sttime,i.index });\\n\\t}\\n\\twhile (!PQ.empty()) {\\n\\t\\tint cn = PQ.top().second;\\n\\t\\tint c = PQ.top().first;\\n\\t\\tPQ.pop();\\n\\t\\tfor (auto j : dis_edge[cn]) {\\n\\t\\t\\tif (dis[j.first] > c + j.second) {\\n\\t\\t\\t\\tdis[j.first] = c + j.second;\\n\\t\\t\\t\\tPQ.push({ dis[j.first],j.first });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << dis[M] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 21236,\n \"score_of_the_acc\": -0.4981,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2811_2712384\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n#define HUGE_NUM 9999999999999999\\n\\nstruct Info{\\n\\tInfo(int arg_to,ll arg_time,ll arg_cost,ll arg_min_rain){\\n\\t\\tto = arg_to;\\n\\t\\ttime = arg_time;\\n\\t\\tcost = arg_cost;\\n\\t\\tmin_rain = arg_min_rain;\\n\\t}\\n\\tint to;\\n\\tll time,cost,min_rain;\\n};\\n\\nstruct Data{\\n\\tData(int arg_node_id,int arg_pre_node,int arg_pre_id,ll arg_current_time,ll arg_rain_time){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tpre_node = arg_pre_node;\\n\\t\\tpre_id = arg_pre_id;\\n\\t\\tcurrent_time = arg_current_time;\\n\\t\\train_time = arg_rain_time;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\t\\treturn rain_time > arg.rain_time;\\n\\t}\\n\\tint node_id,pre_node,pre_id;\\n\\tll current_time,rain_time;\\n};\\n\\nint N,M,start,goal;\\nvector<Info> G[100000];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d %d\\\",&N,&M,&start,&goal);\\n\\tstart--;\\n\\tgoal--;\\n\\n\\tint from,to;\\n\\tll time,cost;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\t\\tscanf(\\\"%d %d %lld %lld\\\",&from,&to,&time,&cost);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\tG[from].push_back(Info(to,time,cost,HUGE_NUM));\\n\\t}\\n\\n\\tpriority_queue<Data> Q;\\n\\tfor(int i = 0; i < G[start].size(); i++){\\n\\t\\tG[start][i].min_rain = G[start][i].time;\\n\\t\\tQ.push(Data(G[start][i].to,start,i,G[start][i].time+G[start][i].cost,G[start][i].time));\\n\\t}\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().node_id == goal){\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\",Q.top().rain_time);\\n\\t\\t\\treturn 0;\\n\\t\\t}else if(Q.top().rain_time > G[Q.top().pre_node][Q.top().pre_id].min_rain){\\n\\t\\t\\tQ.pop();\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\\n\\t\\t\\t\\tif(Q.top().current_time > G[Q.top().node_id][i].time)continue;\\n\\t\\t\\t\\tif(Q.top().rain_time+G[Q.top().node_id][i].time-Q.top().current_time >= G[Q.top().node_id][i].min_rain)continue;\\n\\n\\t\\t\\t\\tG[Q.top().node_id][i].min_rain = Q.top().rain_time+G[Q.top().node_id][i].time-Q.top().current_time;\\n\\t\\t\\t\\tQ.push(Data(G[Q.top().node_id][i].to,Q.top().node_id,i,G[Q.top().node_id][i].time+G[Q.top().node_id][i].cost,G[Q.top().node_id][i].min_rain));\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 17596,\n \"score_of_the_acc\": -0.2456,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2811_2688154\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst bool debug = true;\\n#define dbg(...) if(debug) printf(__VA_ARGS__)\\n#define print(var) if (debug) cout << #var << \\\" = \\\" << var << endl\\n\\nnamespace {\\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\\n template<typename T>\\n ostream& operator<<(ostream& os, const vector<T>& xs) {\\n if (xs.empty()) return os << \\\"[]\\\";\\n os << xs[0];\\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\\n return os;\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\\n return os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const map<K, V>& m) {\\n bool first = true;\\n for (auto p : m) {\\n if (first) first = false;\\n else os << \\\":\\\";\\n os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n return os;\\n }\\n\\n\\n map<tuple<int, int, bool>, int> id;\\n vector<tuple<int, int, bool>> fromId;\\n\\n struct Edge {\\n int to, cost;\\n Edge(int to, int cost) : to(to), cost(cost) {}\\n };\\n vector<vector<Edge>> Graph;\\n\\n int N, M, S, G;\\n\\n bool IN = false;\\n bool OUT = true;\\n\\n void solve() {\\n cin >> N >> M >> S >> G;\\n S--; G--;\\n vector<vector<tuple<int, int, bool>>> V(N);\\n auto init = make_tuple(S, 0, IN);\\n V[S].push_back(init);\\n id[init] = 0;\\n fromId.push_back(init);\\n Graph.emplace_back();\\n for (int i = 0; i < M; i++) {\\n int u, v, t, c; cin >> u >> v >> t >> c;\\n u--; v--;\\n auto x = make_tuple(u, t, OUT);\\n auto x_id = id.count(x) ? id[x] : fromId.size();\\n if (not id.count(x)) {\\n fromId.push_back(x);\\n id[x] = x_id;\\n Graph.emplace_back();\\n }\\n V[u].push_back(x);\\n auto y = make_tuple(v, t + c, IN);\\n auto y_id = id.count(y) ? id[y] : fromId.size();\\n if (not id.count(y)) {\\n fromId.push_back(y);\\n id[y] = y_id;\\n Graph.emplace_back();\\n }\\n V[v].push_back(y);\\n Graph[x_id].emplace_back(y_id, 0);\\n }\\n for (auto& L : V) {\\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) {\\n return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b);\\n });\\n for (unsigned i = 0; i + 1 < L.size(); i++) {\\n auto& x = L[i];\\n auto& y = L[i + 1];\\n auto time_x = get<1>(x);\\n auto time_y = get<1>(y);\\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\\n }\\n }\\n\\n auto start = id[ V[S][0] ];\\n\\n // dijkstra\\n const int INF = 1<<28;\\n vector<int> D(Graph.size(), INF);\\n struct State {\\n int v, cost;\\n State(int v, int cost) : v(v), cost(cost) {}\\n bool operator<(const State& s) const {\\n return cost > s.cost;\\n }\\n };\\n priority_queue<State> PQ;\\n PQ.emplace(start, 0);\\n D[start] = 0;\\n while (not PQ.empty()) {\\n auto cur = PQ.top(); PQ.pop();\\n for (auto& e : Graph[cur.v]) {\\n auto next = e.to;\\n if (D[next] > cur.cost + e.cost) {\\n D[next] = cur.cost + e.cost;\\n PQ.emplace(next, D[next]);\\n }\\n }\\n }\\n int ans = INF;\\n for (auto& goal_vertex : V[G]) {\\n auto goal = id[goal_vertex];\\n ans = min(ans, D[goal]);\\n }\\n cout << ans << endl;\\n }\\n}\\n\\nint main() {\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 670,\n \"memory_kb\": 64968,\n \"score_of_the_acc\": -1.9818,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2811_2688151\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst bool debug = true;\\n#define dbg(...) if(debug) printf(__VA_ARGS__)\\n#define print(var) if (debug) cout << #var << \\\" = \\\" << var << endl\\n\\nnamespace {\\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\\n template<typename T>\\n ostream& operator<<(ostream& os, const vector<T>& xs) {\\n if (xs.empty()) return os << \\\"[]\\\";\\n os << xs[0];\\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\\n return os;\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\\n return os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const map<K, V>& m) {\\n bool first = true;\\n for (auto p : m) {\\n if (first) first = false;\\n else os << \\\":\\\";\\n os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n return os;\\n }\\n\\n\\n map<tuple<int, int, bool>, int> id;\\n vector<tuple<int, int, bool>> fromId;\\n\\n struct Edge {\\n int to, cost;\\n Edge(int to, int cost) : to(to), cost(cost) {}\\n };\\n vector<vector<Edge>> Graph;\\n\\n int N, M, S, G;\\n\\n bool IN = false;\\n bool OUT = true;\\n\\n void solve() {\\n cin >> N >> M >> S >> G;\\n S--; G--;\\n vector<vector<tuple<int, int, bool>>> V(N);\\n auto init = make_tuple(S, 0, IN);\\n V[S].push_back(init);\\n id[init] = 0;\\n fromId.push_back(init);\\n Graph.emplace_back();\\n for (int i = 0; i < M; i++) {\\n int u, v, t, c; cin >> u >> v >> t >> c;\\n u--; v--;\\n auto x = make_tuple(u, t, OUT);\\n auto x_id = id.count(x) ? id[x] : fromId.size();\\n if (not id.count(x)) {\\n fromId.push_back(x);\\n id[x] = x_id;\\n Graph.emplace_back();\\n }\\n V[u].push_back(x);\\n auto y = make_tuple(v, t + c, IN);\\n auto y_id = id.count(y) ? id[y] : fromId.size();\\n if (not id.count(y)) {\\n fromId.push_back(y);\\n id[y] = y_id;\\n Graph.emplace_back();\\n Graph[x_id].emplace_back(y_id, 0);\\n }\\n V[v].push_back(y);\\n }\\n for (auto& L : V) {\\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) {\\n return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b);\\n });\\n for (unsigned i = 0; i + 1 < L.size(); i++) {\\n auto& x = L[i];\\n auto& y = L[i + 1];\\n auto time_x = get<1>(x);\\n auto time_y = get<1>(y);\\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\\n }\\n }\\n\\n auto start = id[ V[S][0] ];\\n\\n // dijkstra\\n const int INF = 1<<28;\\n vector<int> D(Graph.size(), INF);\\n struct State {\\n int v, cost;\\n State(int v, int cost) : v(v), cost(cost) {}\\n bool operator<(const State& s) const {\\n return cost > s.cost;\\n }\\n };\\n priority_queue<State> PQ;\\n PQ.emplace(start, 0);\\n D[start] = 0;\\n while (not PQ.empty()) {\\n auto cur = PQ.top(); PQ.pop();\\n for (auto& e : Graph[cur.v]) {\\n auto next = e.to;\\n if (D[next] > cur.cost + e.cost) {\\n D[next] = cur.cost + e.cost;\\n PQ.emplace(next, D[next]);\\n }\\n }\\n }\\n int ans = INF;\\n for (auto& goal_vertex : V[G]) {\\n auto goal = id[goal_vertex];\\n ans = min(ans, D[goal]);\\n }\\n cout << ans << endl;\\n }\\n}\\n\\nint main() {\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.7586206896551724,\n \"time_ms\": 680,\n \"memory_kb\": 65112,\n \"score_of_the_acc\": -2,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2811_2688146\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst bool debug = true;\\n#define dbg(...) if(debug) printf(__VA_ARGS__)\\n#define print(var) if (debug) cout << #var << \\\" = \\\" << var << endl\\n\\nnamespace {\\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\\n template<typename T>\\n ostream& operator<<(ostream& os, const vector<T>& xs) {\\n if (xs.empty()) return os << \\\"[]\\\";\\n os << xs[0];\\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\\n return os;\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\\n return os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const map<K, V>& m) {\\n bool first = true;\\n for (auto p : m) {\\n if (first) first = false;\\n else os << \\\":\\\";\\n os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n return os;\\n }\\n\\n\\n map<tuple<int, int, bool>, int> id;\\n vector<tuple<int, int, bool>> fromId;\\n\\n struct Edge {\\n int to, cost;\\n Edge(int to, int cost) : to(to), cost(cost) {}\\n };\\n vector<vector<Edge>> Graph;\\n\\n int N, M, S, G;\\n\\n bool IN = false;\\n bool OUT = true;\\n\\n void solve() {\\n cin >> N >> M >> S >> G;\\n S--; G--;\\n vector<vector<tuple<int, int, bool>>> V(N);\\n auto init = make_tuple(S, 0, IN);\\n V[S].push_back(init);\\n id[init] = 0;\\n fromId.push_back(init);\\n Graph.emplace_back();\\n for (int i = 0; i < M; i++) {\\n int u, v, t, c; cin >> u >> v >> t >> c;\\n u--; v--;\\n auto x = make_tuple(u, t, OUT);\\n auto x_id = id.count(x) ? id[x] : fromId.size();\\n if (not id.count(x)) {\\n fromId.push_back(x);\\n id[x] = x_id;\\n Graph.emplace_back();\\n }\\n V[u].push_back(x);\\n auto y = make_tuple(v, t + c, IN);\\n auto y_id = id.count(y) ? id[y] : fromId.size();\\n if (not id.count(y)) {\\n fromId.push_back(y);\\n id[y] = y_id;\\n Graph.emplace_back();\\n V[v].push_back(y);\\n Graph[x_id].emplace_back(y_id, 0);\\n }\\n }\\n for (auto& L : V) {\\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) {\\n return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b);\\n });\\n for (unsigned i = 0; i + 1 < L.size(); i++) {\\n auto& x = L[i];\\n auto& y = L[i + 1];\\n auto time_x = get<1>(x);\\n auto time_y = get<1>(y);\\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\\n }\\n }\\n\\n auto start = id[ V[S][0] ];\\n\\n // dijkstra\\n const int INF = 1<<28;\\n vector<int> D(Graph.size(), INF);\\n struct State {\\n int v, cost;\\n State(int v, int cost) : v(v), cost(cost) {}\\n bool operator<(const State& s) const {\\n return cost > s.cost;\\n }\\n };\\n priority_queue<State> PQ;\\n PQ.emplace(start, 0);\\n D[start] = 0;\\n while (not PQ.empty()) {\\n auto cur = PQ.top(); PQ.pop();\\n for (auto& e : Graph[cur.v]) {\\n auto next = e.to;\\n if (D[next] > cur.cost + e.cost) {\\n D[next] = cur.cost + e.cost;\\n PQ.emplace(next, D[next]);\\n }\\n }\\n }\\n int ans = INF;\\n for (auto& goal_vertex : V[G]) {\\n auto goal = id[goal_vertex];\\n ans = min(ans, D[goal]);\\n }\\n cout << ans << endl;\\n }\\n}\\n\\nint main() {\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.7586206896551724,\n \"time_ms\": 680,\n \"memory_kb\": 64980,\n \"score_of_the_acc\": -1.9976,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2811_2688129\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst bool debug = true;\\n#define dbg(...) if(debug) printf(__VA_ARGS__)\\n#define print(var) if (debug) cout << #var << \\\" = \\\" << var << endl\\n\\nnamespace {\\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\\n template<typename T>\\n ostream& operator<<(ostream& os, const vector<T>& xs) {\\n if (xs.empty()) return os << \\\"[]\\\";\\n os << xs[0];\\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\\n return os;\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\\n return os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const map<K, V>& m) {\\n bool first = true;\\n for (auto p : m) {\\n if (first) first = false;\\n else os << \\\":\\\";\\n os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n return os;\\n }\\n\\n\\n map<tuple<int, int, bool>, int> id;\\n vector<tuple<int, int, bool>> fromId;\\n\\n struct Edge {\\n int to, cost;\\n Edge(int to, int cost) : to(to), cost(cost) {}\\n };\\n vector<vector<Edge>> Graph;\\n\\n int N, M, S, G;\\n\\n bool IN = false;\\n bool OUT = true;\\n\\n void solve() {\\n cin >> N >> M >> S >> G;\\n S--; G--;\\n vector<vector<tuple<int, int, bool>>> V(N);\\n auto init = make_tuple(S, 0, IN);\\n V[S].push_back(init);\\n id[init] = 0;\\n fromId.push_back(init);\\n Graph.emplace_back();\\n for (int i = 0; i < M; i++) {\\n int u, v, t, c; cin >> u >> v >> t >> c;\\n u--; v--;\\n auto x = make_tuple(u, t, OUT);\\n auto x_id = fromId.size();\\n fromId.push_back(x);\\n id[x] = x_id;\\n Graph.emplace_back();\\n V[u].push_back(x);\\n auto y = make_tuple(v, t + c, IN);\\n auto y_id = fromId.size();\\n fromId.push_back(y);\\n id[y] = y_id;\\n Graph.emplace_back();\\n V[v].push_back(y);\\n Graph[x_id].emplace_back(y_id, 0);\\n }\\n for (auto& L : V) {\\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) {\\n return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b);\\n });\\n for (unsigned i = 0; i + 1 < L.size(); i++) {\\n auto& x = L[i];\\n auto& y = L[i + 1];\\n auto time_x = get<1>(x);\\n auto time_y = get<1>(y);\\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\\n }\\n }\\n\\n auto start = id[ V[S][0] ];\\n\\n // dijkstra\\n const int INF = 1<<28;\\n vector<int> D(Graph.size(), INF);\\n struct State {\\n int v, cost;\\n State(int v, int cost) : v(v), cost(cost) {}\\n bool operator<(const State& s) const {\\n return cost > s.cost;\\n }\\n };\\n priority_queue<State> PQ;\\n PQ.emplace(start, 0);\\n D[start] = 0;\\n while (not PQ.empty()) {\\n auto cur = PQ.top(); PQ.pop();\\n for (auto& e : Graph[cur.v]) {\\n auto next = e.to;\\n if (D[next] > cur.cost + e.cost) {\\n D[next] = cur.cost + e.cost;\\n PQ.emplace(next, D[next]);\\n }\\n }\\n }\\n int ans = INF;\\n for (auto& goal_vertex : V[G]) {\\n auto goal = id[goal_vertex];\\n ans = min(ans, D[goal]);\\n }\\n cout << ans << endl;\\n }\\n}\\n\\nint main() {\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.4827586206896552,\n \"time_ms\": 500,\n \"memory_kb\": 55124,\n \"score_of_the_acc\": -1.5405,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2811_2688020\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst bool debug = true;\\n#define dbg(...) if(debug) printf(__VA_ARGS__)\\n#define print(var) if (debug) cout << #var << \\\" = \\\" << var << endl\\n\\nnamespace {\\n /** output whole vector. ex) vector<int>{1, 2, 3} -> '1 2 3'. */\\n template<typename T>\\n ostream& operator<<(ostream& os, const vector<T>& xs) {\\n if (xs.empty()) return os << \\\"[]\\\";\\n os << xs[0];\\n for (auto i = 1; i < xs.size(); i++) os << ' ' << xs[i];\\n return os;\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const pair<K, V>& p) {\\n return os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n template<typename K, typename V>\\n ostream& operator<<(ostream& os, const map<K, V>& m) {\\n bool first = true;\\n for (auto p : m) {\\n if (first) first = false;\\n else os << \\\":\\\";\\n os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n }\\n return os;\\n }\\n\\n\\n map<tuple<int, int, bool>, int> id;\\n vector<tuple<int, int, bool>> fromId;\\n\\n struct Edge {\\n int to, cost;\\n Edge(int to, int cost) : to(to), cost(cost) {}\\n };\\n vector<vector<Edge>> Graph;\\n\\n int N, M, S, G;\\n\\n bool IN = false;\\n bool OUT = true;\\n\\n void solve() {\\n cin >> N >> M >> S >> G;\\n S--; G--;\\n vector<vector<tuple<int, int, bool>>> V(N);\\n auto init = make_tuple(S, 0, IN);\\n V[S].push_back(init);\\n id[init] = 0;\\n fromId.push_back(init);\\n Graph.emplace_back();\\n for (int i = 0; i < M; i++) {\\n int u, v, t, c; cin >> u >> v >> t >> c;\\n u--; v--;\\n auto x = make_tuple(u, t, OUT);\\n auto x_id = fromId.size();\\n fromId.push_back(x);\\n id[x] = x_id;\\n Graph.emplace_back();\\n V[u].push_back(x);\\n auto y = make_tuple(v, t + c, IN);\\n auto y_id = fromId.size();\\n fromId.push_back(y);\\n id[y] = y_id;\\n Graph.emplace_back();\\n V[v].push_back(y);\\n Graph[x_id].emplace_back(y_id, 0);\\n }\\n for (auto& L : V) {\\n sort(L.begin(), L.end(), [&](const tuple<int, int, bool>& a, const tuple<int, int, bool>& b) { return get<1>(a) == get<1>(b) ? get<2>(a) < get<2>(b) : get<1>(a) < get<1>(b); });\\n }\\n for (auto& L : V) {\\n for (int i = 0; i + 1 < L.size(); i++) {\\n auto& x = L[i];\\n auto& y = L[i + 1];\\n auto time_x = get<1>(x);\\n auto time_y = get<1>(y);\\n Graph[id[x]].emplace_back(id[y], time_y - time_x);\\n }\\n }\\n\\n auto start = id[ V[S][0] ];\\n\\n // dijkstra\\n const int INF = 1<<28;\\n vector<int> D(Graph.size(), INF);\\n struct State {\\n int v, cost;\\n State(int v, int cost) : v(v), cost(cost) {}\\n bool operator<(const State& s) const {\\n return cost > s.cost;\\n }\\n };\\n priority_queue<State> PQ;\\n PQ.emplace(start, 0);\\n D[start] = 0;\\n while (not PQ.empty()) {\\n auto cur = PQ.top(); PQ.pop();\\n for (auto& e : Graph[cur.v]) {\\n auto next = e.to;\\n if (D[next] > cur.cost + e.cost) {\\n D[next] = cur.cost + e.cost;\\n PQ.emplace(next, D[next]);\\n }\\n }\\n }\\n int ans = INF;\\n for (auto& goal_vertex : V[G]) {\\n auto goal = id[goal_vertex];\\n ans = min(ans, D[goal]);\\n }\\n cout << ans << endl;\\n }\\n}\\n\\nint main() {\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.4827586206896552,\n \"time_ms\": 490,\n \"memory_kb\": 55092,\n \"score_of_the_acc\": -1.5243,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2811_2330124\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MP make_pair\\n#define FF first\\n#define SS second\\n\\nusing LL = long long;\\nusing PII = pair<int,int>;\\nusing PLL = pair<LL,LL>;\\nusing PILL = pair<LL,PII>;\\n\\nconst LL INF = 1e15;\\nconst int UB = 400010;\\n\\nint N, M, S, Gl;\\nmap<PLL,int> ids;\\nLL dist[UB];\\nvoid dijk(vector<vector<PLL>>& G){\\n priority_queue<PLL, vector<PLL>, greater<PLL>> pq;\\n fill(dist, dist+UB, INF);\\n pq.push(PLL(0,ids[MP(S,0)]));\\n dist[ids[MP(S,0)]] = 0;\\n\\n while(!pq.empty()){\\n\\tPLL p = pq.top();\\n\\tpq.pop();\\n\\tif(p.FF > dist[p.SS])\\n\\t continue;\\n\\t \\n\\tfor(auto&& e: G[p.SS]){\\n\\t if(p.FF + e.SS < dist[e.FF]){\\n\\t\\tdist[e.FF] = p.FF + e.SS;\\n\\t\\tpq.push(MP(dist[e.FF], e.FF));\\n\\t }\\n\\t}\\n }\\n}\\n\\nint main(){\\n cin >> N >> M >> S >> Gl;\\n --S;\\n --Gl;\\n int id = 0;\\n \\n vector<vector<int>> tms(N);\\n ids[MP(0,S)] = id++;\\n tms[S].push_back(0);\\n vector<vector<PLL>> G(UB);\\n for(int i=0;i<M;++i){\\n\\tint u, v, t, c;\\n\\tcin >> u >> v >> t >> c;\\n\\t--u;\\n\\t--v;\\n\\tif(!ids.count(MP(u,t)))\\n\\t ids[MP(u,t)] = id++;\\n\\tif(!ids.count(MP(v,t+c)))\\n\\t ids[MP(v,t+c)] = id++;\\n\\ttms[u].push_back(t);\\n\\ttms[v].push_back(t+c);\\n\\tG[ids[MP(u,t)]].emplace_back(ids[MP(v,t+c)], 0);\\n }\\n\\n for(int i=0;i<N;++i){\\n\\tsort(begin(tms[i]), end(tms[i]));\\n\\ttms[i].erase(unique(begin(tms[i]), end(tms[i])), end(tms[i]));\\n\\tfor(int j=0;j+1<tms[i].size();++j){\\n\\t G[ids[MP(i,tms[i][j])]].emplace_back(ids[MP(i,tms[i][j+1])], tms[i][j+1] - tms[i][j]);\\n\\t}\\n }\\n\\n dijk(G);\\n LL ans = INF;\\n for(auto&& t: tms[Gl])\\n\\tans = min(ans, dist[ids[MP(Gl,t)]]);\\n cout << ans << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 60960,\n \"score_of_the_acc\": -1.9259,\n \"final_rank\": 12\n }\n]","isConversational":false}}},{"rowIdx":1696,"cells":{"group_id":{"kind":"string","value":"aoj_2812_cpp"},"problem_description":{"kind":"string","value":"H: ジャンプパーティ\n問題\nとあるダンスホールで $N$ 人の参加するダンスパーティーが行われる。\nそのダンスホールは縦方向に $H$ 個、横方向に $W$ 個のグリッドに分けられており、\n左上を $(0,0)$、上から $r$ マス、左から $c$ マス目のグリッドの座標を $(r,c)$ と表す。\n$i$ 番目の参加者の初期位置は $(R_i, C_i)$ であり、$(i,j)$ のグリッドには $(r_{ij}, c_{ij})$ が書かれている。\n各参加者は、無限に続く音楽に合わせて次のように同時に移動を行う。\nその時にいる座標が $(i,j)$ のとき、$(r_{ij}, c_{ij})$ へジャンプで移動する。\nそれぞれのグリッドは狭く、2 人以上の参加者が同時に同じグリッドに移動すると衝突してしまう。ただし、空中で衝突することは無いとする。\nこれを聞いたあなたは、ジャンプ後に 2 人以上の参加者が衝突してしまわないかと心配になった。\nそこで、衝突が起こる可能性があるか、あるならば何回目のジャンプの後に衝突が起こるかを求めることにした。\n制約\n$1 \\le H,W \\le 500$\n$0 \\le N \\le H \\times W$\n$0 \\le r_{ij} < H \\ (0 \\le i < H, 0 \\le j < W)$\n$0 \\le c_{ij} < W \\ (0 \\le i < H, 0 \\le j < W)$\n$0 \\le R_i < H \\ (0 \\le i < N)$\n$0 \\le C_i < W \\ (0 \\le i < N)$\n参加者の初期位置は相異なる\n入力形式\n入力は以下の形式で与えられる。\n$H \\ W \\ N$\n$r_{00} \\ c_{00} \\ \\cdots \\ r_{0 \\ W-1} \\ c_{0 \\ W-1}$\n$\\vdots$\n$r_{H-1 \\ 0} \\ c_{H-1 \\ 0} \\ \\cdots \\ r_{H-1 \\ W-1} \\ c_{H-1 \\ W-1}$\n$R_0 \\ C_0$\n$\\vdots$\n$R_{N-1} \\ C_{N-1}$\nこの問題では入力ファイルが非常に大きくなることがあることに注意せよ。\nC++ なら\nこのページ\nを参考にすると良いかもしれない。\n出力\n衝突が起こる場合は何回目のジャンプの後に起こるかを 1 行で出力せよ。\nそうでない場合は -1 を出力せよ。\nまた、末尾に改行を出力せよ。\nサンプル\nサンプル入力 1\n2 2 2\n1 0 0 1\n0 0 1 0\n0 0\n0 1\nサンプル出力 1\n-1\nサンプル入力 2\n2 2 2\n1 0 0 1\n0 0 1 0\n0 0\n1 1\nサンプル出力 2\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2812_10191609","code_snippet":"// AOJ #2812\n// Jump Party 2025.2.5\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();\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\tpc('\\n');\n}\n\nint main(){\n int H = Cin(), W = Cin(), N = Cin();\n int total = H * W;\n \n vector<int> nextPos(total);\n for (int i = 0; i < H; i++){\n for (int j = 0; j < W; j++){\n int nr = Cin(), nc = Cin();\n int from = i * W + j;\n int to = nr * W + nc;\n nextPos[from] = to;\n }\n }\n \n // 初期位置（セル番号）を読み込む\n vector<int> initPos;\n initPos.reserve(N);\n for (int i = 0; i < N; i++){\n int r = Cin(), c = Cin();\n initPos.push_back(r * W + c);\n }\n \n // 参加者が 0 人または 1 人の場合は衝突は起こらない\n if (N <= 1) {\n Cout(-1);\n return 0;\n }\n \n // ダブリングの前計算\n // 最大のジャンプ回数はグリッドの大きさを上限にすれば十分\n int maxT = total; \n int LOG = 0;\n while ((1 << LOG) <= maxT) LOG++;\n \n // dp[k][i] = セル i から 2^k 回ジャンプしたときのセル番号\n vector<vector<int>> dp(LOG, vector<int>(total));\n for (int i = 0; i < total; i++){\n dp[0][i] = nextPos[i];\n }\n for (int k = 1; k < LOG; k++){\n for (int i = 0; i < total; i++){\n dp[k][i] = dp[k-1][ dp[k-1][i] ];\n }\n }\n \n // 関数：start から t 回ジャンプした先のセル番号を返す\n auto jump = [&](int start, int t) -> int {\n int pos = start;\n for (int k = 0; k < LOG; k++){\n if (t & (1 << k)) pos = dp[k][pos];\n }\n return pos;\n };\n \n // 「t 回ジャンプ後に衝突が起こるか」をチェックする関数\n auto check = [&](int t) -> bool {\n vector<int> freq(total, 0);\n for (int pos : initPos) {\n int finalPos = jump(pos, t);\n freq[finalPos]++;\n if (freq[finalPos] >= 2)\n return true;\n }\n return false;\n };\n \n int lo = 1, hi = maxT + 1;\n int ans = -1;\n while (lo < hi) {\n int mid = lo + (hi - lo) / 2;\n if (check(mid)) ans = mid, hi = mid;\n else lo = mid + 1;\n }\n Cout(ans == -1? -1: ans);\n return 0;\n}","accuracy":1,"time_ms":270,"memory_kb":23644,"score_of_the_acc":-0.1423,"final_rank":3},{"submission_id":"aoj_2812_9119004","code_snippet":"//#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n//using uLL = unsigned __int128;\nusing str = string;\ntemplate <typename T> \nusing pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T>\nusing pq = priority_queue<T>;\ntemplate <typename T>\nusing vec = vector<T>;\nusing pll = pair<long long, long long>;\nusing pii = pair<int, int>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvl = vector<vector<ll>>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define vvvm vector<vector<vector<mint>>>\n#define vvm vector<vector<mint>>\n#define vm vector<mint>\ntemplate <typename T1, typename T2>\nusing umap = unordered_map<T1, T2>;\ntemplate <typename T>\nusing uset = unordered_set<T>;\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\n#define per(i, s, f) for(long long i = s; i >= f; i--)\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\n#define eb(a) emplace_back(a)\n#define pb(a) push_back(a)\n#define all0(x) (x).begin() ,(x).end()\n#define all(x) (x).begin() + 1, (x).end()\n#define ins(x, l, r) (l <= x && x <= r)\n#define ENDL '\\n'\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//これが本当の組み込み関数ってね（笑）\ntemplate <typename T>\nint LB(vector<T> &A, T x) {\n return lower_bound(A.begin(), A.end(), x) - A.begin();\n}\n\ntemplate <typename T>\nint UB(vector<T> &A, T x) {\n return upper_bound(A.begin(), A.end(), x) - A.begin();\n}\ntemplate <typename T>\nvoid UNIQUE(vector<T> &A, int indexed) {\n sort(A.begin() + indexed, A.end());\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\n}\n\ntemplate <typename T>\nvector<T> erase(vector<T>& A, T& x) {\n\tvector<T> res;\n\tfor(T a : A) if(a != x) res.emplace_back(a);\n\treturn res;\n}\nstring split(string& S, int l, int r) {\n\treturn S.substr(l, r - l + 1);\n}\n\nint msb(long long a) {\n if(a == 0) return -1;\n return 64 - int(__builtin_clzll(a));\n}\ntemplate<class T>\nvoid chmin(T &a, T b) {\n if(a > b) a = b;\n}\ntemplate<class T>\nvoid chmax(T &a, T b) {\n if(a < b) a = b;\n}\n//////////////////////////////////////////////////////////////////////\n//数学系\n///////////////////////////////////////////////////////////////////////\nll extgcd (ll a, ll b, ll &x, ll &y) {\n if(b == 0) { x = 1;y = 0;return a;}\n ll d = extgcd(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\ntemplate <typename T>\nT CEIL(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\n else return a / b;\n}\ntemplate <typename T>\nT FLOOR(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\n else return a/b - 1;\n}\nll SQRT(ll a) {\n ll l = 0;\n ll r = 3037000499LL;\n while(l < r) {\n ll mid = (l + r + 1) / 2;\n if(mid * mid <= a) l = mid;\n else r = mid - 1;\n }\n return l;\n}\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//グローバル変数を置くところ\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC optimize \"trapv\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\nconst ll big = 1001001001;\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\n//const ll mod = 1000000007;\n//const ll mod = 998244353;\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\nusing P = pair<short, short>;\nusing vvp = vec<vec<P>>;\nusing vp = vec<P>;\nvoid solve() {\n\tll H, W, N;\n\tcin >> H >> W >> N;\n\tvvp table(H+1, vp(W+1));\n\trep(i,1,H) rep(j,1,W) {\n\t\tcin >> table[i][j].first >> table[i][j].second;\n\t\ttable[i][j].first++, table[i][j].second++;\n\t}\n\tvl R(N+1), C(N+1);\n\trep(i,1,N) {\n\t\tcin >> R[i] >> C[i];\n\t\tR[i]++, C[i]++;\n\t}\n\n\tconst int M = 17;\n\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\n\trep(i,1,H)rep(j,1,W) {\n\t\tdabu[0][i][j] = table[i][j];\n\t}\n\n\n\n\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\n\t\tauto[pi, pj] = dabu[p-1][i][j];\n\t\tdabu[p][i][j] = dabu[p-1][pi][pj];\n\t}\n\n\n\n\tauto jump = [&](int i, int j, ll step) {\n\t\tif(step==0) return P(i, j);\n\t\trep(p, 0, M) {\n\t\t\tif(step >> p & 1) {\n\t\t\t\tauto [ni, nj] = dabu[p][i][j];\n\t\t\t\ti = ni;\n\t\t\t\tj = nj;\n\t\t\t}\n\t\t}\n\t\treturn P(i, j);\n\t};\n\n\tauto out = [&](ll step) {\n\t\tset<P> cnt;\n\t\trep(i,1,N) {\n\t\t\tauto nex = jump(R[i], C[i], step);\n\t\t\tif(cnt.count(nex)) return true;\n\t\t\telse cnt.insert(nex);\n\t\t}\n\t\treturn false;\n\t};\n\n\n\tll li = 0;\n\tll ri = 250001;\n\n\twhile(li < ri) {//xxxxxxooooooo\n\t\tll mid = (li + ri)>>1;\n\t\tif(out(mid)) {\n\t\t\tri = mid;\n\t\t}\n\t\telse {\n\t\t\tli = mid + 1;\n\t\t}\n\t}\n\n\n\tif(out(li)) {\n\t\tcout << li << endl;\n\t}\n\telse {\n\t\tcout << -1 << endl;\n\t}\n\n\n\n\n\n\n\t\n \n\n \n \n\n}\n\n\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n ll T = 1;\n //cin >> T;\n rep(i, 1, T) {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":1440,"memory_kb":37740,"score_of_the_acc":-1.0088,"final_rank":14},{"submission_id":"aoj_2812_9119003","code_snippet":"//#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n//using uLL = unsigned __int128;\nusing str = string;\ntemplate <typename T> \nusing pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T>\nusing pq = priority_queue<T>;\ntemplate <typename T>\nusing vec = vector<T>;\nusing pll = pair<long long, long long>;\nusing pii = pair<int, int>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvl = vector<vector<ll>>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define vvvm vector<vector<vector<mint>>>\n#define vvm vector<vector<mint>>\n#define vm vector<mint>\ntemplate <typename T1, typename T2>\nusing umap = unordered_map<T1, T2>;\ntemplate <typename T>\nusing uset = unordered_set<T>;\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\n#define per(i, s, f) for(long long i = s; i >= f; i--)\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\n#define eb(a) emplace_back(a)\n#define pb(a) push_back(a)\n#define all0(x) (x).begin() ,(x).end()\n#define all(x) (x).begin() + 1, (x).end()\n#define ins(x, l, r) (l <= x && x <= r)\n#define ENDL '\\n'\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//これが本当の組み込み関数ってね（笑）\ntemplate <typename T>\nint LB(vector<T> &A, T x) {\n return lower_bound(A.begin(), A.end(), x) - A.begin();\n}\n\ntemplate <typename T>\nint UB(vector<T> &A, T x) {\n return upper_bound(A.begin(), A.end(), x) - A.begin();\n}\ntemplate <typename T>\nvoid UNIQUE(vector<T> &A, int indexed) {\n sort(A.begin() + indexed, A.end());\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\n}\n\ntemplate <typename T>\nvector<T> erase(vector<T>& A, T& x) {\n\tvector<T> res;\n\tfor(T a : A) if(a != x) res.emplace_back(a);\n\treturn res;\n}\nstring split(string& S, int l, int r) {\n\treturn S.substr(l, r - l + 1);\n}\n\nint msb(long long a) {\n if(a == 0) return -1;\n return 64 - int(__builtin_clzll(a));\n}\ntemplate<class T>\nvoid chmin(T &a, T b) {\n if(a > b) a = b;\n}\ntemplate<class T>\nvoid chmax(T &a, T b) {\n if(a < b) a = b;\n}\n//////////////////////////////////////////////////////////////////////\n//数学系\n///////////////////////////////////////////////////////////////////////\nll extgcd (ll a, ll b, ll &x, ll &y) {\n if(b == 0) { x = 1;y = 0;return a;}\n ll d = extgcd(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\ntemplate <typename T>\nT CEIL(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\n else return a / b;\n}\ntemplate <typename T>\nT FLOOR(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\n else return a/b - 1;\n}\nll SQRT(ll a) {\n ll l = 0;\n ll r = 3037000499LL;\n while(l < r) {\n ll mid = (l + r + 1) / 2;\n if(mid * mid <= a) l = mid;\n else r = mid - 1;\n }\n return l;\n}\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//グローバル変数を置くところ\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC optimize \"trapv\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\nconst ll big = 1001001001;\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\n//const ll mod = 1000000007;\n//const ll mod = 998244353;\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\nusing P = pair<short, short>;\nusing vvp = vec<vec<P>>;\nusing vp = vec<P>;\nvoid solve() {\n\tll H, W, N;\n\tcin >> H >> W >> N;\n\tvvp table(H+1, vp(W+1));\n\trep(i,1,H) rep(j,1,W) {\n\t\tcin >> table[i][j].first >> table[i][j].second;\n\t\ttable[i][j].first++, table[i][j].second++;\n\t}\n\tvl R(N+1), C(N+1);\n\trep(i,1,N) {\n\t\tcin >> R[i] >> C[i];\n\t\tR[i]++, C[i]++;\n\t}\n\n\tconst int M = 17;\n\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\n\trep(i,1,H)rep(j,1,W) {\n\t\tdabu[0][i][j] = table[i][j];\n\t}\n\n\n\n\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\n\t\tauto[pi, pj] = dabu[p-1][i][j];\n\t\tdabu[p][i][j] = dabu[p-1][pi][pj];\n\t}\n\n\n\n\tauto jump = [&](int i, int j, ll step) {\n\t\tif(step==0) return P(i, j);\n\t\trep(p, 0, M) {\n\t\t\tif(step >> p & 1) {\n\t\t\t\tauto [ni, nj] = dabu[p][i][j];\n\t\t\t\ti = ni;\n\t\t\t\tj = nj;\n\t\t\t}\n\t\t}\n\t\treturn P(i, j);\n\t};\n\n\tauto out = [&](ll step) {\n\t\tset<P> cnt;\n\t\trep(i,1,N) {\n\t\t\tauto nex = jump(R[i], C[i], step);\n\t\t\tif(cnt.count(nex)) return true;\n\t\t\telse cnt.insert(nex);\n\t\t}\n\t\treturn false;\n\t};\n\n\n\tll li = 0;\n\tll ri = 500001;\n\n\twhile(li < ri) {//xxxxxxooooooo\n\t\tll mid = (li + ri)>>1;\n\t\tif(out(mid)) {\n\t\t\tri = mid;\n\t\t}\n\t\telse {\n\t\t\tli = mid + 1;\n\t\t}\n\t}\n\n\n\tif(out(li)) {\n\t\tcout << li << endl;\n\t}\n\telse {\n\t\tcout << -1 << endl;\n\t}\n\n\n\n\n\n\n\t\n \n\n \n \n\n}\n\n\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n ll T = 1;\n //cin >> T;\n rep(i, 1, T) {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":1340,"memory_kb":37836,"score_of_the_acc":-0.9501,"final_rank":12},{"submission_id":"aoj_2812_9119002","code_snippet":"//#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n//using uLL = unsigned __int128;\nusing str = string;\ntemplate <typename T> \nusing pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T>\nusing pq = priority_queue<T>;\ntemplate <typename T>\nusing vec = vector<T>;\nusing pll = pair<long long, long long>;\nusing pii = pair<int, int>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvl = vector<vector<ll>>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define vvvm vector<vector<vector<mint>>>\n#define vvm vector<vector<mint>>\n#define vm vector<mint>\ntemplate <typename T1, typename T2>\nusing umap = unordered_map<T1, T2>;\ntemplate <typename T>\nusing uset = unordered_set<T>;\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\n#define per(i, s, f) for(long long i = s; i >= f; i--)\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\n#define eb(a) emplace_back(a)\n#define pb(a) push_back(a)\n#define all0(x) (x).begin() ,(x).end()\n#define all(x) (x).begin() + 1, (x).end()\n#define ins(x, l, r) (l <= x && x <= r)\n#define ENDL '\\n'\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//これが本当の組み込み関数ってね（笑）\ntemplate <typename T>\nint LB(vector<T> &A, T x) {\n return lower_bound(A.begin(), A.end(), x) - A.begin();\n}\n\ntemplate <typename T>\nint UB(vector<T> &A, T x) {\n return upper_bound(A.begin(), A.end(), x) - A.begin();\n}\ntemplate <typename T>\nvoid UNIQUE(vector<T> &A, int indexed) {\n sort(A.begin() + indexed, A.end());\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\n}\n\ntemplate <typename T>\nvector<T> erase(vector<T>& A, T& x) {\n\tvector<T> res;\n\tfor(T a : A) if(a != x) res.emplace_back(a);\n\treturn res;\n}\nstring split(string& S, int l, int r) {\n\treturn S.substr(l, r - l + 1);\n}\n\nint msb(long long a) {\n if(a == 0) return -1;\n return 64 - int(__builtin_clzll(a));\n}\ntemplate<class T>\nvoid chmin(T &a, T b) {\n if(a > b) a = b;\n}\ntemplate<class T>\nvoid chmax(T &a, T b) {\n if(a < b) a = b;\n}\n//////////////////////////////////////////////////////////////////////\n//数学系\n///////////////////////////////////////////////////////////////////////\nll extgcd (ll a, ll b, ll &x, ll &y) {\n if(b == 0) { x = 1;y = 0;return a;}\n ll d = extgcd(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\ntemplate <typename T>\nT CEIL(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\n else return a / b;\n}\ntemplate <typename T>\nT FLOOR(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\n else return a/b - 1;\n}\nll SQRT(ll a) {\n ll l = 0;\n ll r = 3037000499LL;\n while(l < r) {\n ll mid = (l + r + 1) / 2;\n if(mid * mid <= a) l = mid;\n else r = mid - 1;\n }\n return l;\n}\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//グローバル変数を置くところ\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC optimize \"trapv\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\nconst ll big = 1001001001;\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\n//const ll mod = 1000000007;\n//const ll mod = 998244353;\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\nusing P = pair<short, short>;\nusing vvp = vec<vec<P>>;\nusing vp = vec<P>;\nvoid solve() {\n\tll H, W, N;\n\tcin >> H >> W >> N;\n\tvvp table(H+1, vp(W+1));\n\trep(i,1,H) rep(j,1,W) {\n\t\tcin >> table[i][j].first >> table[i][j].second;\n\t\ttable[i][j].first++, table[i][j].second++;\n\t}\n\tvl R(N+1), C(N+1);\n\trep(i,1,N) {\n\t\tcin >> R[i] >> C[i];\n\t\tR[i]++, C[i]++;\n\t}\n\n\tconst int M = 17;\n\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\n\trep(i,1,H)rep(j,1,W) {\n\t\tdabu[0][i][j] = table[i][j];\n\t}\n\n\n\n\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\n\t\tauto[pi, pj] = dabu[p-1][i][j];\n\t\tdabu[p][i][j] = dabu[p-1][pi][pj];\n\t}\n\n\n\n\tauto jump = [&](int i, int j, ll step) {\n\t\tif(step==0) return P(i, j);\n\t\trep(p, 0, M) {\n\t\t\tif(step >> p & 1) {\n\t\t\t\tauto [ni, nj] = dabu[p][i][j];\n\t\t\t\ti = ni;\n\t\t\t\tj = nj;\n\t\t\t}\n\t\t}\n\t\treturn P(i, j);\n\t};\n\n\tauto out = [&](ll step) {\n\t\tset<P> cnt;\n\t\trep(i,1,N) {\n\t\t\tauto nex = jump(R[i], C[i], step);\n\t\t\tif(cnt.count(nex)) return true;\n\t\t\telse cnt.insert(nex);\n\t\t}\n\t\treturn false;\n\t};\n\n\n\tll li = 0;\n\tll ri = 2500001;\n\n\twhile(li < ri) {//xxxxxxooooooo\n\t\tll mid = (li + ri)>>1;\n\t\tif(out(mid)) {\n\t\t\tri = mid;\n\t\t}\n\t\telse {\n\t\t\tli = mid + 1;\n\t\t}\n\t}\n\n\n\tif(out(li)) {\n\t\tcout << li << endl;\n\t}\n\telse {\n\t\tcout << -1 << endl;\n\t}\n\n\n\n\n\n\n\t\n \n\n \n \n\n}\n\n\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n ll T = 1;\n //cin >> T;\n rep(i, 1, T) {\n solve();\n }\n return 0;\n}","accuracy":0.9705882352941176,"time_ms":1510,"memory_kb":37720,"score_of_the_acc":-1.0505,"final_rank":19},{"submission_id":"aoj_2812_9119000","code_snippet":"//#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n//using uLL = unsigned __int128;\nusing str = string;\ntemplate <typename T> \nusing pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T>\nusing pq = priority_queue<T>;\ntemplate <typename T>\nusing vec = vector<T>;\nusing pll = pair<long long, long long>;\nusing pii = pair<int, int>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvl = vector<vector<ll>>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define vvvm vector<vector<vector<mint>>>\n#define vvm vector<vector<mint>>\n#define vm vector<mint>\ntemplate <typename T1, typename T2>\nusing umap = unordered_map<T1, T2>;\ntemplate <typename T>\nusing uset = unordered_set<T>;\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\n#define per(i, s, f) for(long long i = s; i >= f; i--)\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\n#define eb(a) emplace_back(a)\n#define pb(a) push_back(a)\n#define all0(x) (x).begin() ,(x).end()\n#define all(x) (x).begin() + 1, (x).end()\n#define ins(x, l, r) (l <= x && x <= r)\n#define ENDL '\\n'\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//これが本当の組み込み関数ってね（笑）\ntemplate <typename T>\nint LB(vector<T> &A, T x) {\n return lower_bound(A.begin(), A.end(), x) - A.begin();\n}\n\ntemplate <typename T>\nint UB(vector<T> &A, T x) {\n return upper_bound(A.begin(), A.end(), x) - A.begin();\n}\ntemplate <typename T>\nvoid UNIQUE(vector<T> &A, int indexed) {\n sort(A.begin() + indexed, A.end());\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\n}\n\ntemplate <typename T>\nvector<T> erase(vector<T>& A, T& x) {\n\tvector<T> res;\n\tfor(T a : A) if(a != x) res.emplace_back(a);\n\treturn res;\n}\nstring split(string& S, int l, int r) {\n\treturn S.substr(l, r - l + 1);\n}\n\nint msb(long long a) {\n if(a == 0) return -1;\n return 64 - int(__builtin_clzll(a));\n}\ntemplate<class T>\nvoid chmin(T &a, T b) {\n if(a > b) a = b;\n}\ntemplate<class T>\nvoid chmax(T &a, T b) {\n if(a < b) a = b;\n}\n//////////////////////////////////////////////////////////////////////\n//数学系\n///////////////////////////////////////////////////////////////////////\nll extgcd (ll a, ll b, ll &x, ll &y) {\n if(b == 0) { x = 1;y = 0;return a;}\n ll d = extgcd(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\ntemplate <typename T>\nT CEIL(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\n else return a / b;\n}\ntemplate <typename T>\nT FLOOR(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\n else return a/b - 1;\n}\nll SQRT(ll a) {\n ll l = 0;\n ll r = 3037000499LL;\n while(l < r) {\n ll mid = (l + r + 1) / 2;\n if(mid * mid <= a) l = mid;\n else r = mid - 1;\n }\n return l;\n}\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//グローバル変数を置くところ\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC optimize \"trapv\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\nconst ll big = 1001001001;\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\n//const ll mod = 1000000007;\n//const ll mod = 998244353;\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\nusing P = pair<short, short>;\nusing vvp = vec<vec<P>>;\nusing vp = vec<P>;\nvoid solve() {\n\tll H, W, N;\n\tcin >> H >> W >> N;\n\tvvp table(H+1, vp(W+1));\n\trep(i,1,H) rep(j,1,W) {\n\t\tcin >> table[i][j].first >> table[i][j].second;\n\t\ttable[i][j].first++, table[i][j].second++;\n\t}\n\tvl R(N+1), C(N+1);\n\trep(i,1,N) {\n\t\tcin >> R[i] >> C[i];\n\t\tR[i]++, C[i]++;\n\t}\n\n\tconst int M = 17;\n\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\n\trep(i,1,H)rep(j,1,W) {\n\t\tdabu[0][i][j] = table[i][j];\n\t}\n\n\n\n\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\n\t\tauto[pi, pj] = dabu[p-1][i][j];\n\t\tdabu[p][i][j] = dabu[p-1][pi][pj];\n\t}\n\n\n\n\tauto jump = [&](int i, int j, ll step) {\n\t\tif(step==0) return P(i, j);\n\t\trep(p, 0, M) {\n\t\t\tif(step >> p & 1) {\n\t\t\t\tauto [ni, nj] = dabu[p][i][j];\n\t\t\t\ti = ni;\n\t\t\t\tj = nj;\n\t\t\t}\n\t\t}\n\t\treturn P(i, j);\n\t};\n\n\tauto out = [&](ll step) {\n\t\tset<P> cnt;\n\t\trep(i,1,N) {\n\t\t\tauto nex = jump(R[i], C[i], step);\n\t\t\tif(cnt.count(nex)) return true;\n\t\t\telse cnt.insert(nex);\n\t\t}\n\t\treturn false;\n\t};\n\n\n\tll li = 0;\n\tll ri = 1000000;\n\n\twhile(li < ri) {//xxxxxxooooooo\n\t\tll mid = (li + ri)>>1;\n\t\tif(out(mid)) {\n\t\t\tri = mid;\n\t\t}\n\t\telse {\n\t\t\tli = mid + 1;\n\t\t}\n\t}\n\n\n\tif(out(li)) {\n\t\tcout << li << endl;\n\t}\n\telse {\n\t\tcout << -1 << endl;\n\t}\n\n\n\n\n\n\n\t\n \n\n \n \n\n}\n\n\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n ll T = 1;\n //cin >> T;\n rep(i, 1, T) {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":1310,"memory_kb":37836,"score_of_the_acc":-0.9321,"final_rank":11},{"submission_id":"aoj_2812_9118998","code_snippet":"//#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n//using uLL = unsigned __int128;\nusing str = string;\ntemplate <typename T> \nusing pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T>\nusing pq = priority_queue<T>;\ntemplate <typename T>\nusing vec = vector<T>;\nusing pll = pair<long long, long long>;\nusing pii = pair<int, int>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvl = vector<vector<ll>>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define vvvm vector<vector<vector<mint>>>\n#define vvm vector<vector<mint>>\n#define vm vector<mint>\ntemplate <typename T1, typename T2>\nusing umap = unordered_map<T1, T2>;\ntemplate <typename T>\nusing uset = unordered_set<T>;\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\n#define per(i, s, f) for(long long i = s; i >= f; i--)\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\n#define eb(a) emplace_back(a)\n#define pb(a) push_back(a)\n#define all0(x) (x).begin() ,(x).end()\n#define all(x) (x).begin() + 1, (x).end()\n#define ins(x, l, r) (l <= x && x <= r)\n#define ENDL '\\n'\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//これが本当の組み込み関数ってね（笑）\ntemplate <typename T>\nint LB(vector<T> &A, T x) {\n return lower_bound(A.begin(), A.end(), x) - A.begin();\n}\n\ntemplate <typename T>\nint UB(vector<T> &A, T x) {\n return upper_bound(A.begin(), A.end(), x) - A.begin();\n}\ntemplate <typename T>\nvoid UNIQUE(vector<T> &A, int indexed) {\n sort(A.begin() + indexed, A.end());\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\n}\n\ntemplate <typename T>\nvector<T> erase(vector<T>& A, T& x) {\n\tvector<T> res;\n\tfor(T a : A) if(a != x) res.emplace_back(a);\n\treturn res;\n}\nstring split(string& S, int l, int r) {\n\treturn S.substr(l, r - l + 1);\n}\n\nint msb(long long a) {\n if(a == 0) return -1;\n return 64 - int(__builtin_clzll(a));\n}\ntemplate<class T>\nvoid chmin(T &a, T b) {\n if(a > b) a = b;\n}\ntemplate<class T>\nvoid chmax(T &a, T b) {\n if(a < b) a = b;\n}\n//////////////////////////////////////////////////////////////////////\n//数学系\n///////////////////////////////////////////////////////////////////////\nll extgcd (ll a, ll b, ll &x, ll &y) {\n if(b == 0) { x = 1;y = 0;return a;}\n ll d = extgcd(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\ntemplate <typename T>\nT CEIL(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\n else return a / b;\n}\ntemplate <typename T>\nT FLOOR(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\n else return a/b - 1;\n}\nll SQRT(ll a) {\n ll l = 0;\n ll r = 3037000499LL;\n while(l < r) {\n ll mid = (l + r + 1) / 2;\n if(mid * mid <= a) l = mid;\n else r = mid - 1;\n }\n return l;\n}\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//グローバル変数を置くところ\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC optimize \"trapv\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\nconst ll big = 1001001001;\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\n//const ll mod = 1000000007;\n//const ll mod = 998244353;\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\nusing P = pair<short, short>;\nusing vvp = vec<vec<P>>;\nusing vp = vec<P>;\nvoid solve() {\n\tll H, W, N;\n\tcin >> H >> W >> N;\n\tvvp table(H+1, vp(W+1));\n\trep(i,1,H) rep(j,1,W) {\n\t\tcin >> table[i][j].first >> table[i][j].second;\n\t\ttable[i][j].first++, table[i][j].second++;\n\t}\n\tvl R(N+1), C(N+1);\n\trep(i,1,N) {\n\t\tcin >> R[i] >> C[i];\n\t\tR[i]++, C[i]++;\n\t}\n\n\tconst int M = 18;\n\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\n\trep(i,1,H)rep(j,1,W) {\n\t\tdabu[0][i][j] = table[i][j];\n\t}\n\n\n\n\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\n\t\tauto[pi, pj] = dabu[p-1][i][j];\n\t\tdabu[p][i][j] = dabu[p-1][pi][pj];\n\t}\n\n\n\n\tauto jump = [&](int i, int j, ll step) {\n\t\tif(step==0) return P(i, j);\n\t\trep(p, 0, M) {\n\t\t\tif(step >> p & 1) {\n\t\t\t\tauto [ni, nj] = dabu[p][i][j];\n\t\t\t\ti = ni;\n\t\t\t\tj = nj;\n\t\t\t}\n\t\t}\n\t\treturn P(i, j);\n\t};\n\n\tauto out = [&](ll step) {\n\t\tset<P> cnt;\n\t\trep(i,1,N) {\n\t\t\tauto nex = jump(R[i], C[i], step);\n\t\t\tif(cnt.count(nex)) return true;\n\t\t\telse cnt.insert(nex);\n\t\t}\n\t\treturn false;\n\t};\n\n\n\tll li = 0;\n\tll ri = 1000000;\n\n\twhile(li < ri) {//xxxxxxooooooo\n\t\tll mid = (li + ri)>>1;\n\t\tif(out(mid)) {\n\t\t\tri = mid;\n\t\t}\n\t\telse {\n\t\t\tli = mid + 1;\n\t\t}\n\t}\n\n\n\tif(out(li)) {\n\t\tcout << li << endl;\n\t}\n\telse {\n\t\tcout << -1 << endl;\n\t}\n\n\n\n\n\n\n\t\n \n\n \n \n\n}\n\n\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n ll T = 1;\n //cin >> T;\n rep(i, 1, T) {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":1340,"memory_kb":38720,"score_of_the_acc":-0.9605,"final_rank":13},{"submission_id":"aoj_2812_9118965","code_snippet":"//#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n//using uLL = unsigned __int128;\nusing str = string;\ntemplate <typename T> \nusing pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T>\nusing pq = priority_queue<T>;\ntemplate <typename T>\nusing vec = vector<T>;\nusing pll = pair<long long, long long>;\nusing pii = pair<int, int>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvl = vector<vector<ll>>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define vvvm vector<vector<vector<mint>>>\n#define vvm vector<vector<mint>>\n#define vm vector<mint>\ntemplate <typename T1, typename T2>\nusing umap = unordered_map<T1, T2>;\ntemplate <typename T>\nusing uset = unordered_set<T>;\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\n#define per(i, s, f) for(long long i = s; i >= f; i--)\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\n#define eb(a) emplace_back(a)\n#define pb(a) push_back(a)\n#define all0(x) (x).begin() ,(x).end()\n#define all(x) (x).begin() + 1, (x).end()\n#define ins(x, l, r) (l <= x && x <= r)\n#define ENDL '\\n'\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//これが本当の組み込み関数ってね（笑）\ntemplate <typename T>\nint LB(vector<T> &A, T x) {\n return lower_bound(A.begin(), A.end(), x) - A.begin();\n}\n\ntemplate <typename T>\nint UB(vector<T> &A, T x) {\n return upper_bound(A.begin(), A.end(), x) - A.begin();\n}\ntemplate <typename T>\nvoid UNIQUE(vector<T> &A, int indexed) {\n sort(A.begin() + indexed, A.end());\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\n}\n\ntemplate <typename T>\nvector<T> erase(vector<T>& A, T& x) {\n\tvector<T> res;\n\tfor(T a : A) if(a != x) res.emplace_back(a);\n\treturn res;\n}\nstring split(string& S, int l, int r) {\n\treturn S.substr(l, r - l + 1);\n}\n\nint msb(long long a) {\n if(a == 0) return -1;\n return 64 - int(__builtin_clzll(a));\n}\ntemplate<class T>\nvoid chmin(T &a, T b) {\n if(a > b) a = b;\n}\ntemplate<class T>\nvoid chmax(T &a, T b) {\n if(a < b) a = b;\n}\n//////////////////////////////////////////////////////////////////////\n//数学系\n///////////////////////////////////////////////////////////////////////\nll extgcd (ll a, ll b, ll &x, ll &y) {\n if(b == 0) { x = 1;y = 0;return a;}\n ll d = extgcd(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\ntemplate <typename T>\nT CEIL(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\n else return a / b;\n}\ntemplate <typename T>\nT FLOOR(T a, T b) {\n assert(b != 0);\n if(a % b == 0) return a / b;\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\n else return a/b - 1;\n}\nll SQRT(ll a) {\n ll l = 0;\n ll r = 3037000499LL;\n while(l < r) {\n ll mid = (l + r + 1) / 2;\n if(mid * mid <= a) l = mid;\n else r = mid - 1;\n }\n return l;\n}\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n//グローバル変数を置くところ\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC optimize \"trapv\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\nconst ll big = 1001001001;\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\n//const ll mod = 1000000007;\n//const ll mod = 998244353;\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\nusing P = pair<short, short>;\nusing vvp = vec<vec<P>>;\nusing vp = vec<P>;\nvoid solve() {\n\tll H, W, N;\n\tcin >> H >> W >> N;\n\tvvp table(H+1, vp(W+1));\n\trep(i,1,H) rep(j,1,W) {\n\t\tcin >> table[i][j].first >> table[i][j].second;\n\t\ttable[i][j].first++, table[i][j].second++;\n\t}\n\tvl R(N+1), C(N+1);\n\trep(i,1,N) {\n\t\tcin >> R[i] >> C[i];\n\t\tR[i]++, C[i]++;\n\t}\n\n\tconst int M = 20;\n\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\n\trep(i,1,H)rep(j,1,W) {\n\t\tdabu[0][i][j] = table[i][j];\n\t}\n\n\n\n\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\n\t\tauto[pi, pj] = dabu[p-1][i][j];\n\t\tdabu[p][i][j] = dabu[p-1][pi][pj];\n\t}\n\n\n\n\tauto jump = [&](int i, int j, ll step) {\n\t\tif(step==0) return P(i, j);\n\t\trep(p, 0, M) {\n\t\t\tif(step >> p & 1) {\n\t\t\t\tauto [ni, nj] = dabu[p][i][j];\n\t\t\t\ti = ni;\n\t\t\t\tj = nj;\n\t\t\t}\n\t\t}\n\t\treturn P(i, j);\n\t};\n\n\tauto out = [&](ll step) {\n\t\tset<P> cnt;\n\t\trep(i,1,N) {\n\t\t\tauto nex = jump(R[i], C[i], step);\n\t\t\tif(cnt.count(nex)) return true;\n\t\t\telse cnt.insert(nex);\n\t\t}\n\t\treturn false;\n\t};\n\n\n\tll li = 0;\n\tll ri = 10000000;\n\n\twhile(li < ri) {//xxxxxxooooooo\n\t\tll mid = (li + ri)>>1;\n\t\tif(out(mid)) {\n\t\t\tri = mid;\n\t\t}\n\t\telse {\n\t\t\tli = mid + 1;\n\t\t}\n\t}\n\n\n\tif(out(li)) {\n\t\tcout << li << endl;\n\t}\n\telse {\n\t\tcout << -1 << endl;\n\t}\n\n\n\n\n\n\n\t\n \n\n \n \n\n}\n\n\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n ll T = 1;\n //cin >> T;\n rep(i, 1, T) {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":1740,"memory_kb":40616,"score_of_the_acc":-1.2223,"final_rank":15},{"submission_id":"aoj_2812_9117934","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n//高速化 \nstruct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;\n//#define endl '\\n' //インタラクティブ問題の時は消す\n\n//型\nusing ll = long long;\nusing ld = long double;\ntemplate<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;\nusing vi = vc<int>; using vvi = vvc<int>; using vvvi = vvvc<int>;\nusing vl = vc<ll>; using vvl = vvc<ll>; using vvvl = vvvc<ll>;\nusing pi = pair<int, int>; using pl = pair<ll, ll>;\nusing ull = unsigned ll;\ntemplate<class T>using priq = priority_queue<T>;\ntemplate<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;\n\n// for文\n#define overload4(a, b, c, d, e, ...) e\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, step) for(ll i = a; i < b; i+= step)\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define per1(n) for(ll i = n-1; i >= 0; i--)\n#define per2(i, n) for(ll i = n-1; i >= 0; i--)\n#define per3(i, a, b) for(ll i = b-1; i >= a; i--)\n#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)\n#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)\n#define fore1(a) for(auto&& i : a)\t\n#define fore2(i,a) for(auto&& i : a)\n#define fore3(x,y,a) for(auto&& [x, y] : a)\n#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)\n#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)\n\n//関数\n#define mp make_pair\n#define mt make_tuple\n#define a first\n#define b second\n#define pb emplace_back\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define si(x) (ll)(x).size()\ntemplate<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}\ntemplate<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}\ntemplate<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}\ntemplate<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}\ntemplate<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}\ntemplate<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}\ntemplate<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}\n\n//入出力(operator)\ntemplate<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}\ntemplate<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}\n\ntemplate<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<\" \"<<a.b;}\ntemplate<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<\" \";}return os;}\ntemplate<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<\" \";}return os;}\ntemplate<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<\" \"<<y<<\"\\n\";}return os;}\ntemplate<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<\" \";}return os;}\ntemplate<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<\" \"<<y<<\"\\n\";}return os;}\ntemplate<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<\" \";return os;}\ntemplate<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<\"\\n\";return os;}\n\n//入出力(関数)\nvi readvi(ll n){vi a(n);cin>>a;return a;}\nvl readvl(ll n){vl a(n);cin>>a;return a;}\nvvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].pb(b);if(bidirected)g[b].pb(a);}return g;}\nvvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].pb(b,c);if(bidirected)g[b].pb(a,c);}return g;}\nvvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}\nvvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}\n\ninline void yes(){cout << \"Yes\\n\";}\ninline void no(){cout << \"No\\n\";}\ninline void yesno(bool y = true){if(y)yes();else no();}\n\n//定数\nconstexpr ll mod = 998244353;\nconstexpr ll minf=-(1<<29);\nconstexpr ll inf=(1<<29);\nconstexpr ll MINF=-(1LL<<60);\nconstexpr ll INF=(1LL<<60);\nconstexpr ld EPS = 1e-8;\nconst ld PI = acosl(-1);\n#define equals(a, b) (abs((a) - (b)) < EPS)\nconst int dx[4] ={-1, 0, 1, 0};\nconst int dy[4] ={ 0, 1, 0,-1};\nconst int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};\nconst int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};\n\nvoid solve();\nint main() {\n\tint t = 1;\n // cin >>t;\n while(t--)solve();\n}\n\nint h, w, n;\nint id(int i, int j){\n return i * w + j;\n}\n\nvoid solve(){\n cin >> h >> w >> n;\n vi to(h * w);\n vvi g(h * w);\n rep(i,h){\n rep(j,w){\n int x, y;\n cin >> x >> y;\n to[id(i, j)] = id(x, y);\n g[id(x, y)].emplace_back(id(i, j));\n }\n }\n\n vi d(h * w , inf);\n vi par(h * w , -1);\n vi r(h * w , -1);\n vi r2(h * w);\n rep(i, h * w) r2[i] = i;\n vi loop(h * w, inf);\n\n rep(i, h*w){\n if(d[i] == inf){\n int nw = i;\n d[nw] = inf - 1;\n\n while(d[to[nw]] == inf){\n d[to[nw]] = d[nw] - 1;\n nw = to[nw];\n }\n while(loop[to[nw]] == inf){\n nw = to[nw];\n loop[nw] = 0;\n }\n loop[nw] = 0;\n\n\n queue<int> q;\n q.push(nw);\n par[nw] = nw;\n r[nw] = d[to[nw]] - d[nw] + 1;\n d[nw] = 0;\n\n while(q.size()){\n int p = q.front();\n q.pop();\n rep(j, si(g[p])){\n if(chmin(d[g[p][j]], d[p] + 1)){\n par[g[p][j]] = par[p];\n r[g[p][j]] = r[p];\n if(chmin(loop[g[p][j]], loop[p] + 1)){\n r2[g[p][j]] = r2[p];\n }\n q.push(g[p][j]);\n }\n }\n }\n }\n }\n\n vi x(n);\n vi ex(h * w);\n map<pair<int, int>, int> mns;\n rep(i,n){\n int a, b;\n cin >> a >> b;\n x[i] = id(a, b);\n ex[x[i]] = 1;\n if(mns.find({par[x[i]], d[x[i]] % r[x[i]]}) == mns.end()){\n mns[{par[x[i]], d[x[i]] % r[x[i]]}] = loop[x[i]];\n }\n chmin(mns[{par[x[i]], d[x[i]] % r[x[i]]}], loop[x[i]]);\n }\n\n ll ans = inf;\n rep(i, n){\n if(mns[{par[x[i]], d[x[i]] % r[x[i]]}] != loop[x[i]]){\n chmin(ans, loop[x[i]]);\n }\n }\n \n\n set<pair<int,int>> mn2;\n rep(i,n){\n if(mn2.find({r2[x[i]], loop[x[i]]}) != mn2.end()){\n chmin(ans, loop[x[i]]);\n }\n else{\n mn2.insert({r2[x[i]], loop[x[i]]});\n }\n }\n\n\n auto dfs = [&](auto&&dfs, int p)->set<int> {\n set<int> nw;\n if(ex[p]) nw.insert(loop[p]);\n for(auto to : g[p]){\n if(loop[to] != loop[p] + 1) continue;\n set<int> nx = dfs(dfs, to);\n if(nw.size() < nx.size()) nw.swap(nx);\n for(auto v : nx){\n if(nw.count(v)){\n chmin(ans, v - loop[p]);\n }else{\n nw.insert(v);\n }\n }\n }\n return nw;\n };\n\n\n rep(i,h * w){\n if(loop[i] == 0){\n dfs(dfs, i);\n }\n }\n\n cout << (ans == inf ? -1 : ans) << endl;\n}","accuracy":1,"time_ms":300,"memory_kb":51860,"score_of_the_acc":-0.4924,"final_rank":8},{"submission_id":"aoj_2812_9117850","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\n\ntemplate <typename T> bool chmin(T &a, const T &b) {\n\tif (a <= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> bool chmax(T &a, const T &b) {\n\tif (a >= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> T max(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T min(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T sum(vector<T> &a){\n\tT ret = 0;\n\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\n\treturn ret;\n}\nint main(){\n\t cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\t\n\tint h, w, n; cin >> h >> w >> n;\n\tvector gx(h, vector<int>(w));\n\tvector gy(h, vector<int>(w));\n\trep(i,0,h){\n\t\trep(j,0,w){\n\t\t\tint r, c; cin >> r >> c;\n\t\t\tgx[i][j] = r;\n\t\t\tgy[i][j] = c;\n\t\t}\n\t}\n\n\tvector dbx(20, vector(h, vector<int>(w)));\n\tvector dby(20, vector(h, vector<int>(w)));\n\trep(i,0,h) rep(j,0,w){\n\t\tdbx[0][i][j] = gx[i][j];\n\t\tdby[0][i][j] = gy[i][j];\n\t}\n\n\trep(num,0,19){\n\t\trep(i,0,h){\n\t\t\trep(j,0,w){\n\t\t\t\tint x = dbx[num][i][j];\n\t\t\t\tint y = dby[num][i][j];\n\t\t\t\tdbx[num+1][i][j] = dbx[num][x][y];\n\t\t\t\tdby[num+1][i][j] = dby[num][x][y];\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<int> rx(n), ry(n);\n\trep(i,0,n){\n\t\tcin >> rx[i] >> ry[i];\n\t}\n\n\tauto check = [&](int t) -> bool {\n\t\tvector<int> mx(n), my(n);\n\t\tmx = rx;\n\t\tmy = ry;\n\t\trep(num,0,20){\n\t\t\tif (t >> num & 1){\n\t\t\t\trep(i,0,n){\n\t\t\t\t\tint x = dbx[num][mx[i]][my[i]];\n\t\t\t\t\tint y = dby[num][mx[i]][my[i]];\n\t\t\t\t\tmx[i] = x;\n\t\t\t\t\tmy[i] = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector nums(h, vector<int>(w));\n\t\trep(i,0,n){\n\t\t\tnums[mx[i]][my[i]]++;\n\t\t\tif (nums[mx[i]][my[i]] >= 2) return true;\n\t\t}\n\t\treturn false;\n\t};\n\n\tint ub = 299999;\n\tint lb = 0;\n\twhile (ub - lb > 1){\n\t\tint t = (ub + lb) / 2;\n\t\tif (check(t)) ub = t;\n\t\telse lb = t;\n\t}\n\n\tif (lb > 288888){\n\t\tcout << -1 << '\\n';\n\t}else{\n\t\tcout << ub << '\\n';\n\t}\n}","accuracy":1,"time_ms":150,"memory_kb":49828,"score_of_the_acc":-0.3787,"final_rank":6},{"submission_id":"aoj_2812_9117831","code_snippet":"#pragma region //comavius::competitive library\n\n#pragma region //inclusion and optimization\n#include <bits/stdc++.h>\n#ifdef IS_TEST\nstatic const bool IS_TEST_ENVIROMENT = true;\n#else\nstatic const bool IS_TEST_ENVIROMENT = false;\n#endif\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma endregion //inclusion and optimization\n\nnamespace comavius::competitive { //typedefs\n\n #pragma region //long long\n typedef int ll;\n typedef std::vector<ll> vll;\n typedef std::vector<vll> vvll;\n typedef std::vector<vvll> vvvll;\n typedef std::map<ll, ll> mll;\n typedef std::map<ll, mll> mmll;\n typedef std::pair<ll, ll> pll;\n typedef std::vector<pll> vpll;\n #pragma endregion //long long\n\n #pragma region //long double\n typedef long double ld;\n typedef std::vector<ld> vld;\n typedef std::vector<vld> vvld;\n typedef std::vector<vvld> vvvld;\n #pragma endregion //long double\n\n #pragma region //std::string\n typedef std::string str;\n typedef std::vector<str> vstr;\n typedef std::vector<vstr> vvstr;\n typedef std::vector<vvstr> vvvstr;\n #pragma endregion //std::string\n\n #pragma region //bool\n typedef std::vector<bool> vb;\n typedef std::vector<vb> vvb;\n typedef std::vector<vvb> vvvb;\n #pragma endregion //bool\n\n #pragma region //char\n typedef std::vector<char> vc;\n typedef std::vector<vc> vvc;\n typedef std::vector<vvc> vvvc;\n #pragma endregion //char\n\n #pragma region //container of std\n #pragma region //std::vector\n template <typename T>\n using vec = std::vector<T>;\n template <typename T>\n using vec2 = std::vector<std::vector<T>>;\n template <typename T>\n using vec3 = std::vector<std::vector<std::vector<T>>>;\n template <typename T>\n using vec4 = std::vector<std::vector<std::vector<std::vector<T>>>>;\n template <typename T>\n using vec5 = std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>;\n template <typename T>\n using vec6 = std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>>;\n template <typename T>\n using vec7 = std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>>>;\n #pragma endregion //std::vector\n #pragma endregion //container of std\n\n} // namespace comavius::competitive typedefs\n\n\n#pragma region //Read macro\n #define GET_1_ARG(TYPE, ARG); TYPE ARG; std::cin >> ARG;\n #define GET_2_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_1_ARG(TYPE, __VA_ARGS__)\n #define GET_3_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_2_ARG(TYPE, __VA_ARGS__)\n #define GET_4_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_3_ARG(TYPE, __VA_ARGS__)\n #define GET_5_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_4_ARG(TYPE, __VA_ARGS__)\n #define GET_6_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_5_ARG(TYPE, __VA_ARGS__)\n #define GET_7_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_6_ARG(TYPE, __VA_ARGS__)\n #define GET_8_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_7_ARG(TYPE, __VA_ARGS__)\n #define GET_9_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_8_ARG(TYPE, __VA_ARGS__)\n #define GET_10_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_9_ARG(TYPE, __VA_ARGS__)\n\n #define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME\n #define read(TYPE, ...) GET_MACRO(__VA_ARGS__, GET_10_ARG, GET_9_ARG, GET_8_ARG, GET_7_ARG, GET_6_ARG, GET_5_ARG, GET_4_ARG, GET_3_ARG, GET_2_ARG, GET_1_ARG)(TYPE, __VA_ARGS__)\n\n #define readv(TYPE, NAME, SIZE) std::vector<TYPE> NAME(SIZE); for (long long i = 0; i < SIZE; i++) std::cin >> NAME[i];\n #define readvv(TYPE, NAME, H, W) std::vector<std::vector<TYPE>> NAME(H, std::vector<TYPE>(W)); for (long long i = 0; i < H; i++) for (long long j = 0; j < W; j++) std::cin >> NAME[i][j];\n#pragma endregion //Read macro\n\n#pragma region //Other macro\n #define rep(i, n) for (ll i = 0; i < n; i++)\n #define reps(i, start, goal, diff) for (ll i = start; i != goal; i += diff)\n #define all(a) a.begin(), a.end()\n// #define chmax(a, b) a = std::max(a, b)\n// #define chmin(a, b) a = std::min(a, b)\n#pragma endregion //Other macro\n\n#pragma region //namespace expansion\n using namespace std;\n using namespace comavius::competitive;\n#pragma endregion //namespace expansion\n\n#pragma endregion //comavius::competitive library\n\n\n\n#pragma region // fundamental structures\n\nusing vvpll = vector<vpll>;\n\nint main() {\n int h, w, n;\n scanf(\"%d\", &h);\n scanf(\"%d\", &w);\n scanf(\"%d\", &n);\n ll hw = h * w;\n vvll next(hw, vll(30));\n rep(i, h) {\n rep(j, w) {\n int r, c;\n scanf(\"%d\", &r);\n scanf(\"%d\", &c);\n next[i*w+j][0] = r*w+c;\n }\n }\n vll start;\n rep(i, n) {\n int r, c;\n scanf(\"%d\", &r);\n scanf(\"%d\", &c);\n start.push_back(r*w+c);\n }\n rep(i, 29) {\n rep(j, hw) {\n ll nx = next[next[j][i]][i];\n next[j][i+1] = nx;\n }\n }\n ll l = 0, r = 1ll<<28;\n while (r - l > 1) {\n ll mid = (l+r) / 2;\n vb visited(hw, false);\n bool ok = true;\n for (auto s : start) {\n ll dest = s;\n rep(i, 29) {\n if (mid & (1ll << i)) {\n dest = next[dest][i];\n }\n }\n if (visited[dest]) {\n ok = false;\n break;\n }\n visited[dest] = true;\n }\n if (ok) {\n l = mid;\n }\n else {\n r = mid;\n }\n }\n if (r == 1ll<<28) {\n cout << \"-1\" << endl;\n }\n else {\n cout << r << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":920,"memory_kb":41200,"score_of_the_acc":-0.7382,"final_rank":10},{"submission_id":"aoj_2812_9117800","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\n\ntemplate <typename T> bool chmin(T &a, const T &b) {\n\tif (a <= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> bool chmax(T &a, const T &b) {\n\tif (a >= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> T max(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T min(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T sum(vector<T> &a){\n\tT ret = 0;\n\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\n\treturn ret;\n}\nint main(){\n\tint h, w, n; cin >> h >> w >> n;\n\tvector gx(h, vector<int>(w));\n\tvector gy(h, vector<int>(w));\n\trep(i,0,h){\n\t\trep(j,0,w){\n\t\t\tint r, c; cin >> r >> c;\n\t\t\tgx[i][j] = r;\n\t\t\tgy[i][j] = c;\n\t\t}\n\t}\n\n\tvector dbx(20, vector(h, vector<int>(w)));\n\tvector dby(20, vector(h, vector<int>(w)));\n\trep(i,0,h) rep(j,0,w){\n\t\tdbx[0][i][j] = gx[i][j];\n\t\tdby[0][i][j] = gy[i][j];\n\t}\n\n\trep(num,0,19){\n\t\trep(i,0,h){\n\t\t\trep(j,0,w){\n\t\t\t\tint x = gx[i][j];\n\t\t\t\tint y = gy[i][j];\n\t\t\t\tdbx[num+1][i][j] = dbx[num][x][y];\n\t\t\t\tdby[num+1][i][j] = dby[num][x][y];\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<int> rx(n), ry(n);\n\trep(i,0,n){\n\t\tcin >> rx[i] >> ry[i];\n\t}\n\n\tauto check = [&](int t) -> bool {\n\t\tvector<int> mx(n), my(n);\n\t\tmx = rx;\n\t\tmy = ry;\n\t\trep(num,0,20){\n\t\t\tif (t >> num & 1){\n\t\t\t\trep(i,0,n){\n\t\t\t\t\tint x = dbx[num][mx[i]][my[i]];\n\t\t\t\t\tint y = dby[num][mx[i]][my[i]];\n\t\t\t\t\tmx[i] = x;\n\t\t\t\t\tmy[i] = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector nums(h, vector<int>(w));\n\t\trep(i,0,n){\n\t\t\tnums[mx[i]][my[i]]++;\n\t\t\tif (nums[mx[i]][my[i]] >= 2) return true;\n\t\t}\n\t\treturn false;\n\t};\n\n\tint ub = 299999;\n\tint lb = 0;\n\twhile (ub - lb > 1){\n\t\tint t = (ub + lb) / 2;\n\t\tif (check(t)) ub = t;\n\t\telse lb = t;\n\t}\n\n\tif (lb > 288888){\n\t\tcout << -1 << '\\n';\n\t}else{\n\t\tcout << ub << '\\n';\n\t}\n}","accuracy":0.5,"time_ms":220,"memory_kb":49808,"score_of_the_acc":-0.4203,"final_rank":20},{"submission_id":"aoj_2812_8492223","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 2812.cc: H: ジャンプパーティ\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_H = 500;\nconst int MAX_W = 500;\nconst int MAX_HW = MAX_H * MAX_W;\nconst int BN = 18;\n\n/* typedef */\n\n/* global variables */\n\nint ps[MAX_HW][BN], ss[MAX_HW];\nbool fs[MAX_HW];\n\n/* subroutines */\n\nbool check(int hw, int n, int k) {\n fill(fs, fs + hw, false);\n for (int i = 0; i < n; i++) {\n int u = ss[i];\n for (int i = 0; i < BN; i++)\n if ((k >> i) & 1) u = ps[u][i];\n if (fs[u]) return true;\n fs[u] = true;\n }\n return false;\n}\n\n/* main */\n\nint main() {\n int h, w, n;\n scanf(\"%d%d%d\", &h, &w, &n);\n int hw = h * w;\n\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n int r, c;\n scanf(\"%d%d\", &r, &c);\n ps[i * w + j][0] = r * w + c;\n }\n\n for (int i = 0; i < BN - 1; i++)\n for (int u = 0; u < hw; u++)\n ps[u][i + 1] = ps[ps[u][i]][i];\n\n for (int i = 0; i < n; i++) {\n int r, c;\n scanf(\"%d%d\", &r, &c);\n ss[i] = r * w + c;\n }\n\n int k0 = 0, k1 = hw + 1;\n while (k0 + 1 < k1) {\n int k = (k0 + k1) / 2;\n if (check(hw, n, k)) k1 = k;\n else k0 = k;\n }\n\n printf(\"%d\\n\", (k1 > hw) ? -1 : k1);\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":21728,"score_of_the_acc":-0.0359,"final_rank":1},{"submission_id":"aoj_2812_5967186","code_snippet":"#include<bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n//#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"unroll-loops\")\nusing namespace std;\n//#include<boost/multiprecision/cpp_int.hpp>\n//#include<boost/multiprecision/cpp_dec_float.hpp>\n//namespace mp=boost::multiprecision;\n//#define mulint mp::cpp_int\n//#define mulfloat mp::cpp_dec_float_100\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n#define INF (1<<30)\n#define LINF (lint)(1LL<<56)\n#define endl \"\\n\"\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\n#define flc(x) __builtin_popcountll(x)\n#define pint pair<int,int>\n#define pdouble pair<double,double>\n#define plint pair<lint,lint>\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define vec vector<lint>\n#define nep(x) next_permutation(all(x))\ntypedef long long lint;\nint dx[8]={1,1,0,-1,-1,-1,0,1};\nint dy[8]={0,1,1,1,0,-1,-1,-1};\nconst int MAX_N=4e5+5;\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//vector<int> bucket[MAX_N/1000];\nconstexpr int MOD=1000000007;\n//constexpr int MOD=998244353;\n/*#include<atcoder/all>\nusing namespace atcoder;\ntypedef __int128_t llint;*/\n\nstruct doubling{\n vector<vector<lint>> to,sum;\n doubling(vector<lint> in,int log){\n to.resize(log);\n rep(i,log) to[i].resize(in.size());\n rep(i,in.size()) to[0][i]=in[i];\n for(int i=1;i<log;i++) rep(j,in.size()) to[i][j]=to[i-1][to[i-1][j]];\n sum.resize(log);\n rep(i,log) sum[i].resize(in.size());\n rep(i,in.size()) sum[0][i]=i;\n for(int i=1;i<log;i++) rep(j,in.size()) sum[i][j]=sum[i-1][j]+sum[i-1][to[i-1][j]];\n }\n doubling(vector<lint> in,vector<lint> in2, int log){//dsumでin2の値を使うようにする\n to.resize(log);\n rep(i,log) to[i].resize(in.size());\n rep(i,in.size()) to[0][i]=in[i];\n for(int i=1;i<log;i++) rep(j,in.size()) to[i][j]=to[i-1][to[i-1][j]];\n sum.resize(log);\n rep(i,log) sum[i].resize(in.size());\n rep(i,in.size()) sum[0][i]=in2[i];\n for(int i=1;i<log;i++) rep(j,in.size()) sum[i][j]=sum[i-1][j]+sum[i-1][to[i-1][j]];\n }\n lint dest(lint now,lint k){//nowのk個先\n rep(i,to.size()){\n if(k&(1LL<<i)) now=to[i][now];\n }\n return now;\n }\n lint dsum(lint now,lint k){//Σ[i=0..k-1]\n lint res=0;\n rep(i,to.size()){\n if(k&(1LL<<i)) res+=sum[i][now],now=to[i][now];\n }\n return res;\n }\n};\n\nint main(void){\n int H,W,N;\n cin >> H >> W >> N;\n vector<lint> nxt(H*W);\n rep(i,H) rep(j,W){\n int h,w;\n cin >> h >> w;\n int now=i*W+j;\n int to=h*W+w;\n nxt[now]=to;\n }\n doubling db(nxt,25);\n int R[N],C[N];\n rep(i,N) cin >> R[i] >> C[i];\n int p[N];\n rep(i,N) p[i]=R[i]*W+C[i];\n int lo=0,hi=1e6;\n while(hi-lo>1){\n int mid=(hi+lo)/2;\n int cnt[H*W]={};\n rep(i,N) cnt[db.dest(p[i],mid)]++;\n if(*max_element(cnt,cnt+H*W)>1) hi=mid;\n else lo=mid;\n }\n if(hi==1e6) cout << -1 << endl;\n else cout << hi << endl;\n}","accuracy":1,"time_ms":520,"memory_kb":106684,"score_of_the_acc":-1.2695,"final_rank":16},{"submission_id":"aoj_2812_3992940","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\nconst ll INF = 1LL << 60;\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\n\n\n\nint main() {\n\n\tint H, W, N;\n\tcin >> H >> W >> N;\n\tvector<vector<int>>y(H, vector<int>(W));\n\tvector<vector<int>>x(H, vector<int>(W));\n\tfor (int i = 0; i < H; i++) {\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tcin >> y[i][j] >> x[i][j];\n\t\t}\n\t}\n\tvector<int>sy(N);\n\tvector<int>sx(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> sy[i] >> sx[i];\n\t}\n\tvector<vector<vector<int>>>tapiY(H, vector<vector<int>>(W, vector<int>(20)));\n\tvector<vector<vector<int>>>tapiX(H, vector<vector<int>>(W, vector<int>(20)));\n\tfor (int i = 0; i < 20; i++) {\n\t\tfor (int j = 0; j < H; j++) {\n\t\t\tfor (int k = 0; k < W; k++) {\n\t\t\t\tif (i) {\n\t\t\t\t\tint yy = tapiY[j][k][i - 1];\n\t\t\t\t\tint xx = tapiX[j][k][i - 1];\n\t\t\t\t\ttapiY[j][k][i] = tapiY[yy][xx][i - 1];\n\t\t\t\t\ttapiX[j][k][i] = tapiX[yy][xx][i - 1];\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttapiY[j][k][i] = y[j][k];\n\t\t\t\t\ttapiX[j][k][i] = x[j][k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\tvector<int>ny(N);\n\tvector<int>nx(N);\n\tfor (int i = 19; i >= 0; i--) {\n\t\tset<pair<int, int>>st;\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tny[j] = tapiY[sy[j]][sx[j]][i];\n\t\t\tnx[j] = tapiX[sy[j]][sx[j]][i];\n\t\t\tst.insert({ ny[j],nx[j] });\n\t\t}\n\t\tif (st.size() == N) {\n\t\t\tsy = ny;\n\t\t\tsx = nx;\n\t\t\tans += 1 << i;\n\t\t}\n\t}\n\tif (ans == (1 << 20) - 1) {\n\t\tcout << -1 << endl;\n\t\treturn 0;\n\t}\n\tcout << ans + 1 << endl;\n}","accuracy":1,"time_ms":1650,"memory_kb":79156,"score_of_the_acc":-1.6221,"final_rank":17},{"submission_id":"aoj_2812_3991602","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\nconst ll INF = 1LL << 60;\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\n\n\n\nint main() {\n\n\tint H, W, N;\n\tcin >> H >> W >> N;\n\tvector<vector<int>>y(H, vector<int>(W));\n\tvector<vector<int>>x(H, vector<int>(W));\n\tfor (int i = 0; i < H; i++) {\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tcin >> y[i][j] >> x[i][j];\n\t\t}\n\t}\n\tvector<int>sy(N);\n\tvector<int>sx(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> sy[i] >> sx[i];\n\t}\n\tvector<vector<vector<int>>>tapiY(H, vector<vector<int>>(W, vector<int>(20)));\n\tvector<vector<vector<int>>>tapiX(H, vector<vector<int>>(W, vector<int>(20)));\n\tfor (int i = 0; i < 20; i++) {\n\t\tfor (int j = 0; j < H; j++) {\n\t\t\tfor (int k = 0; k < W; k++) {\n\t\t\t\tif (i) {\n\t\t\t\t\tint yy = tapiY[j][k][i - 1];\n\t\t\t\t\tint xx = tapiX[j][k][i - 1];\n\t\t\t\t\ttapiY[j][k][i] = tapiY[yy][xx][i - 1];\n\t\t\t\t\ttapiX[j][k][i] = tapiX[yy][xx][i - 1];\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttapiY[j][k][i] = y[j][k];\n\t\t\t\t\ttapiX[j][k][i] = x[j][k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\tvector<int>ny(N);\n\tvector<int>nx(N);\n\tfor (int i = 19; i >= 0; i--) {\n\t\tset<pair<int, int>>st;\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tny[j] = tapiY[sy[j]][sx[j]][i];\n\t\t\tnx[j] = tapiX[sy[j]][sx[j]][i];\n\t\t\tst.insert({ ny[j],nx[j] });\n\t\t}\n\t\tif (st.size() == N) {\n\t\t\tsy = ny;\n\t\t\tsx = nx;\n\t\t\tans += 1 << i;\n\t\t}\n\t}\n\tif (ans == (1 << 20) - 1) {\n\t\tcout << -1 << endl;\n\t\treturn 0;\n\t}\n\tcout << ans + 1 << endl;\n}","accuracy":1,"time_ms":1680,"memory_kb":79172,"score_of_the_acc":-1.6402,"final_rank":18},{"submission_id":"aoj_2812_3906946","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 <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nstruct Coordinate {\n\tint x, y;\n};\n\nint main() {\n\tstd::cin.sync_with_stdio(false);\n\tint h, w, n; std::cin >> h >> w >> n;\n\tstd::vector<std::vector<Coordinate>> floor(h, std::vector<Coordinate>(w));\n\tfor (auto& line : floor) for (auto& coordinate : line) std::cin >> coordinate.y >> coordinate.x;\n\tstd::vector<std::vector<std::vector<Coordinate>>> step{ floor };\n\tfor (auto i = 1; i < h * w; i <<= 1) {\n\t\tstd::vector<std::vector<Coordinate>> new_floor(h, std::vector<Coordinate>(w));\n\t\tconst auto& back = step.back();\n\t\tfor (auto y = 0; y < h; ++y) for (auto x = 0; x < w; ++x) {\n\t\t\tauto next = back[y][x];\n\t\t\tnew_floor[y][x] = back[next.y][next.x];\n\t\t}\n\t\tstep.push_back(new_floor);\n\t}\n\tstd::vector<Coordinate> dancers(n); for (auto& dancer : dancers) std::cin >> dancer.y >> dancer.x;\n\tstd::vector<std::vector<int>> exists(h, std::vector<int>(w, -1));\n\tbool has_collision = false;\n\tfor (const auto& dancer : dancers) {\n\t\tauto current_pos = step.back()[dancer.y][dancer.x];\n\t\tif (exists[current_pos.y][current_pos.x] != -1) {\n\t\t\thas_collision = true;\n\t\t\tbreak;\n\t\t}\n\t\telse {\n\t\t\texists[current_pos.y][current_pos.x] = h * w + 1;\n\t\t}\n\t}\n\tif (!has_collision) {\n\t\tstd::cout << -1 << '\\n';\n\t\treturn 0;\n\t}\n\tint min = 0;\n\tint max = h * w;\n\twhile (min < max) {\n\t\tauto mid = (min + max) / 2;\n\t\thas_collision = false;\n\t\tfor (auto dancer : dancers) {\n\t\t\tfor (auto i = 0; i < step.size(); ++i) {\n\t\t\t\tif ((mid & (1 << i)) != 0) {\n\t\t\t\t\tdancer = step[i][dancer.y][dancer.x];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (exists[dancer.y][dancer.x] == mid) {\n\t\t\t\thas_collision = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\n\t\t\t\texists[dancer.y][dancer.x] = mid;\n\t\t\t}\n\t\t}\n\t\tif (has_collision) max = mid;\n\t\telse min = mid + 1;\n\t}\n\tstd::cout << max << '\\n';\n}","accuracy":1,"time_ms":70,"memory_kb":45392,"score_of_the_acc":-0.2785,"final_rank":4},{"submission_id":"aoj_2812_2863073","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstruct LOC{\n\tvoid set(int arg_to_row,int arg_to_col){\n\t\tto_row = arg_to_row;\n\t\tto_col = arg_to_col;\n\t}\n\tint to_row,to_col;\n};\n\nstruct Info{\n\tint row,col;\n};\n\nint H,W,N;\nint limit = 18;\nint POW[19],work[501][501];\nLOC table[19][501][501];\nInfo first_loc[250005],calc_loc[250005];\n\nbool check(int num){\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++)work[row][col] = 0;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tcalc_loc[i] = first_loc[i];\n\t}\n\n\tint now_row,now_col;\n\n\tfor(int i = limit; i >= 0; i--){\n\t\tif(num < POW[i])continue;\n\t\tnum -= POW[i];\n\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tnow_row = calc_loc[k].row;\n\t\t\tnow_col = calc_loc[k].col;\n\t\t\tcalc_loc[k].row = table[i][now_row][now_col].to_row;\n\t\t\tcalc_loc[k].col = table[i][now_row][now_col].to_col;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\twork[calc_loc[i].row][calc_loc[i].col]++;\n\t\tif(work[calc_loc[i].row][calc_loc[i].col] == 2){\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\nint main(){\n\n\tfor(int i = 0; i <= limit; i++)POW[i] = pow(2,i);\n\n\tscanf(\"%d %d %d\",&H,&W,&N);\n\n\tint to_row,to_col;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tscanf(\"%d %d\",&to_row,&to_col);\n\t\t\ttable[0][row][col].set(to_row,to_col);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d %d\",&first_loc[i].row,&first_loc[i].col);\n\t}\n\n\tfor(int i = 1; i <= limit; i++){\n\t\tfor(int row = 0; row < H; row++){\n\t\t\tfor(int col = 0; col < W; col++){\n\n\t\t\t\tto_row = table[i-1][row][col].to_row;\n\t\t\t\tto_col = table[i-1][row][col].to_col;\n\n\t\t\t\ttable[i][row][col].to_row = table[i-1][to_row][to_col].to_row;\n\t\t\t\ttable[i][row][col].to_col = table[i-1][to_row][to_col].to_col;\n\t\t\t}\n\t\t}\n\t}\n\n\tint left = 1,right = H*W,m = (left+right)/2;\n\tint ans = BIG_NUM;\n\n\twhile(left <= right){\n\t\tif(check(m)){\n\t\t\tans = m;\n\t\t\tright = m-1;\n\t\t}else{\n\t\t\tleft = m+1;\n\t\t}\n\t\tm = (left+right)/2;\n\t}\n\n\tif(ans == BIG_NUM){\n\t\tprintf(\"-1\\n\");\n\t}else{\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":45520,"score_of_the_acc":-0.304,"final_rank":5},{"submission_id":"aoj_2812_2669750","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\nint H, W, N;\nint mk(int r, int c) {\n\treturn r*W+c;\n}\n\nbool check(vector<int>places,const vector<vector<int>>&tos, int time) {\n\t\n\tfor (int i = 0; i < 20; ++i) {\n\t\tif (time&(1 << i)) {\n\t\t\tfor (auto&pl : places) {\n\t\t\t\tpl=tos[pl][i];\n\t\t\t}\n\t\t}\n\t}\n\tsort(places.begin(),places.end());\n\tif(unique(places.begin(),places.end())==places.end())return false;\n\telse return true;\n}\n\nint main() {\n\tcin>>H>>W>>N;\n\tvector<vector<int>>tos(H*W,vector<int>(20));\n\tfor (int i = 0; i < H; ++i) {\n\t\tfor (int j = 0; j < W; ++j) {\n\t\t\tint r,c;cin>>r>>c;\n\t\t\ttos[mk(i,j)][0]=mk(r,c);\n\t\t}\n\t}\n\tfor (int k = 1; k < 20; ++k) {\n\t\tfor (int i = 0; i < H*W; ++i) {\n\t\t\ttos[i][k]=tos[tos[i][k-1]][k-1];\n\t\t}\n\t}\n\tvector<int>starts(N);\n\tfor (int i = 0; i < N; ++i) {\n\t\tint r,c;cin>>r>>c;\n\t\tstarts[i]=mk(r,c);\n\t}\n\tint amin=0;\n\tint amax=H*W+1;\n\twhile (amin + 1 != amax) {\n\t\tint amid=(amin+amax)/2;\n\t\tif (check(starts, tos, amid)) {\n\t\t\tamax=amid;\n\t\t}\n\t\telse {\n\t\t\tamin=amid;\n\t\t}\n\t}\n\tif(amax==H*W+1)amax=-1;\n\tcout<<amax<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":810,"memory_kb":34060,"score_of_the_acc":-0.5883,"final_rank":9},{"submission_id":"aoj_2812_2330125","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)),end((a))\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort(ALL((c)))\n#define RSORT(c) sort(RALL((c)))\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\ntemplate<class S, class T>\nostream& operator<<(ostream& os, const pair<S,T>& p){\n return os << p.FF << \" \" << p.SS;\n}\ntemplate<class T>\nvoid maxi(T& x, T y){\n if(x < y) x = y;\n}\ntemplate<class T>\nvoid mini(T& x, T y){\n if(x > y) x = y;\n}\n\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst LL MOD = 1e9+7;\n\nint H, W, N;\nPII xs[18][500][500];\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n cin >> H >> W >> N;\n REP(y,H) REP(x,W)\n\tcin >> xs[0][y][x];\n\n vector<PII> ps(N);\n REP(i,N) cin >> ps[i];\n\n for(int i=1;i<18;++i){\n\tREP(y,H) REP(x,W){\n\t auto&& par = xs[i-1][y][x];\n\t xs[i][y][x] = xs[i-1][par.FF][par.SS];\n\t}\n }\n\n bool no = true;\n set<PII> s;\n for(auto&& p: ps){\n\tPII np = xs[17][p.FF][p.SS];\n\tif(s.count(np)){\n\t no = false;\n\t}\n\ts.insert(np);\n }\n if(no){\n\tcout << -1 << endl;\n\treturn 0;\n }\n\n int ans = 0;\n vector<vector<PII>> db(H, vector<PII>(W));\n REP(y,H) REP(x,W) db[y][x] = MP(y,x);\n for(int i=17;i>=0;--i){\n\tbool excess = false;\n\tset<PII> s;\n\tfor(auto&& p: ps){\n\t PII np = db[p.FF][p.SS];\n\t np = xs[i][np.FF][np.SS];\n\t if(s.count(np)){\n\t\texcess = true;\n\t\tbreak;\n\t }\n\t s.insert(np);\n\t}\n\tif(!excess){\n\t ans |= 1<<i;\n\t REP(y,H) REP(x,W){\n\t\tPII p = db[y][x];\n\t\tdb[y][x] = xs[i][p.FF][p.SS];\n\t }\n\t}\n }\n cout << ans+1 << endl;\n\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":51648,"score_of_the_acc":-0.4181,"final_rank":7},{"submission_id":"aoj_2812_2273437","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\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\n#define INF 2147483600\n\nint main(){\n int h,w,n;\n cin>>h>>w>>n;\n vector<int> vec(h*w);\n rep(i,h)rep(j,w){\n int a,b;\n scanf(\"%d %d\", &a, &b);\n vec[i*w+j] = a*w+b;\n }\n vector<int> p(n);\n rep(i,n){\n int a,b;\n scanf(\"%d %d\", &a, &b);\n p[i] = a*w+b;\n }\n\n vector<vector<int>> mat(20, vector<int>(h*w));\n rep(i,h*w) mat[0][i] = vec[i];\n repl(i,1,20) rep(j,h*w){\n mat[i][j] = mat[i-1][mat[i-1][j]];\n }\n\n int l=0, r=2*h*w;\n while(r-l>1){\n int m = (l+r)/2;\n auto exe = [&](int x){\n vector<bool> vis(h*w,false);\n vector<int> v(p);\n int q=0;\n while(x>0){\n if(x%2){\n rep(i,n) v[i] = mat[q][v[i]];\n }\n x /= 2;\n q++;\n }\n rep(i,n){\n if(vis[v[i]]) return true;\n vis[v[i]]=true;\n }\n return false;\n };\n\n if(exe(m)) r = m;\n else l = m;\n }\n\n if(r==2*h*w) r=-1;\n cout << r << endl;\n\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":25352,"score_of_the_acc":-0.0546,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2812_10191609\",\n \"code_snippet\": \"// AOJ #2812\\n// Jump Party 2025.2.5\\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();\\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\\tpc('\\\\n');\\n}\\n\\nint main(){\\n int H = Cin(), W = Cin(), N = Cin();\\n int total = H * W;\\n \\n vector<int> nextPos(total);\\n for (int i = 0; i < H; i++){\\n for (int j = 0; j < W; j++){\\n int nr = Cin(), nc = Cin();\\n int from = i * W + j;\\n int to = nr * W + nc;\\n nextPos[from] = to;\\n }\\n }\\n \\n // 初期位置（セル番号）を読み込む\\n vector<int> initPos;\\n initPos.reserve(N);\\n for (int i = 0; i < N; i++){\\n int r = Cin(), c = Cin();\\n initPos.push_back(r * W + c);\\n }\\n \\n // 参加者が 0 人または 1 人の場合は衝突は起こらない\\n if (N <= 1) {\\n Cout(-1);\\n return 0;\\n }\\n \\n // ダブリングの前計算\\n // 最大のジャンプ回数はグリッドの大きさを上限にすれば十分\\n int maxT = total; \\n int LOG = 0;\\n while ((1 << LOG) <= maxT) LOG++;\\n \\n // dp[k][i] = セル i から 2^k 回ジャンプしたときのセル番号\\n vector<vector<int>> dp(LOG, vector<int>(total));\\n for (int i = 0; i < total; i++){\\n dp[0][i] = nextPos[i];\\n }\\n for (int k = 1; k < LOG; k++){\\n for (int i = 0; i < total; i++){\\n dp[k][i] = dp[k-1][ dp[k-1][i] ];\\n }\\n }\\n \\n // 関数：start から t 回ジャンプした先のセル番号を返す\\n auto jump = [&](int start, int t) -> int {\\n int pos = start;\\n for (int k = 0; k < LOG; k++){\\n if (t & (1 << k)) pos = dp[k][pos];\\n }\\n return pos;\\n };\\n \\n // 「t 回ジャンプ後に衝突が起こるか」をチェックする関数\\n auto check = [&](int t) -> bool {\\n vector<int> freq(total, 0);\\n for (int pos : initPos) {\\n int finalPos = jump(pos, t);\\n freq[finalPos]++;\\n if (freq[finalPos] >= 2)\\n return true;\\n }\\n return false;\\n };\\n \\n int lo = 1, hi = maxT + 1;\\n int ans = -1;\\n while (lo < hi) {\\n int mid = lo + (hi - lo) / 2;\\n if (check(mid)) ans = mid, hi = mid;\\n else lo = mid + 1;\\n }\\n Cout(ans == -1? -1: ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 23644,\n \"score_of_the_acc\": -0.1423,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2812_9119004\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n//using uLL = unsigned __int128;\\nusing str = string;\\ntemplate <typename T> \\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T>\\nusing pq = priority_queue<T>;\\ntemplate <typename T>\\nusing vec = vector<T>;\\nusing pll = pair<long long, long long>;\\nusing pii = pair<int, int>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvl = vector<vector<ll>>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define vvvm vector<vector<vector<mint>>>\\n#define vvm vector<vector<mint>>\\n#define vm vector<mint>\\ntemplate <typename T1, typename T2>\\nusing umap = unordered_map<T1, T2>;\\ntemplate <typename T>\\nusing uset = unordered_set<T>;\\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\\n#define per(i, s, f) for(long long i = s; i >= f; i--)\\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\\n#define eb(a) emplace_back(a)\\n#define pb(a) push_back(a)\\n#define all0(x) (x).begin() ,(x).end()\\n#define all(x) (x).begin() + 1, (x).end()\\n#define ins(x, l, r) (l <= x && x <= r)\\n#define ENDL '\\\\n'\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//これが本当の組み込み関数ってね（笑）\\ntemplate <typename T>\\nint LB(vector<T> &A, T x) {\\n return lower_bound(A.begin(), A.end(), x) - A.begin();\\n}\\n\\ntemplate <typename T>\\nint UB(vector<T> &A, T x) {\\n return upper_bound(A.begin(), A.end(), x) - A.begin();\\n}\\ntemplate <typename T>\\nvoid UNIQUE(vector<T> &A, int indexed) {\\n sort(A.begin() + indexed, A.end());\\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\\n}\\n\\ntemplate <typename T>\\nvector<T> erase(vector<T>& A, T& x) {\\n\\tvector<T> res;\\n\\tfor(T a : A) if(a != x) res.emplace_back(a);\\n\\treturn res;\\n}\\nstring split(string& S, int l, int r) {\\n\\treturn S.substr(l, r - l + 1);\\n}\\n\\nint msb(long long a) {\\n if(a == 0) return -1;\\n return 64 - int(__builtin_clzll(a));\\n}\\ntemplate<class T>\\nvoid chmin(T &a, T b) {\\n if(a > b) a = b;\\n}\\ntemplate<class T>\\nvoid chmax(T &a, T b) {\\n if(a < b) a = b;\\n}\\n//////////////////////////////////////////////////////////////////////\\n//数学系\\n///////////////////////////////////////////////////////////////////////\\nll extgcd (ll a, ll b, ll &x, ll &y) {\\n if(b == 0) { x = 1;y = 0;return a;}\\n ll d = extgcd(b, a%b, y, x);\\n y -= a/b * x;\\n return d;\\n}\\ntemplate <typename T>\\nT CEIL(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\\n else return a / b;\\n}\\ntemplate <typename T>\\nT FLOOR(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\\n else return a/b - 1;\\n}\\nll SQRT(ll a) {\\n ll l = 0;\\n ll r = 3037000499LL;\\n while(l < r) {\\n ll mid = (l + r + 1) / 2;\\n if(mid * mid <= a) l = mid;\\n else r = mid - 1;\\n }\\n return l;\\n}\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//グローバル変数を置くところ\\n//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma GCC optimize \\\"trapv\\\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\\nconst ll big = 1001001001;\\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\\n//const ll mod = 1000000007;\\n//const ll mod = 998244353;\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\nusing P = pair<short, short>;\\nusing vvp = vec<vec<P>>;\\nusing vp = vec<P>;\\nvoid solve() {\\n\\tll H, W, N;\\n\\tcin >> H >> W >> N;\\n\\tvvp table(H+1, vp(W+1));\\n\\trep(i,1,H) rep(j,1,W) {\\n\\t\\tcin >> table[i][j].first >> table[i][j].second;\\n\\t\\ttable[i][j].first++, table[i][j].second++;\\n\\t}\\n\\tvl R(N+1), C(N+1);\\n\\trep(i,1,N) {\\n\\t\\tcin >> R[i] >> C[i];\\n\\t\\tR[i]++, C[i]++;\\n\\t}\\n\\n\\tconst int M = 17;\\n\\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\\n\\trep(i,1,H)rep(j,1,W) {\\n\\t\\tdabu[0][i][j] = table[i][j];\\n\\t}\\n\\n\\n\\n\\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\\n\\t\\tauto[pi, pj] = dabu[p-1][i][j];\\n\\t\\tdabu[p][i][j] = dabu[p-1][pi][pj];\\n\\t}\\n\\n\\n\\n\\tauto jump = [&](int i, int j, ll step) {\\n\\t\\tif(step==0) return P(i, j);\\n\\t\\trep(p, 0, M) {\\n\\t\\t\\tif(step >> p & 1) {\\n\\t\\t\\t\\tauto [ni, nj] = dabu[p][i][j];\\n\\t\\t\\t\\ti = ni;\\n\\t\\t\\t\\tj = nj;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn P(i, j);\\n\\t};\\n\\n\\tauto out = [&](ll step) {\\n\\t\\tset<P> cnt;\\n\\t\\trep(i,1,N) {\\n\\t\\t\\tauto nex = jump(R[i], C[i], step);\\n\\t\\t\\tif(cnt.count(nex)) return true;\\n\\t\\t\\telse cnt.insert(nex);\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\n\\tll li = 0;\\n\\tll ri = 250001;\\n\\n\\twhile(li < ri) {//xxxxxxooooooo\\n\\t\\tll mid = (li + ri)>>1;\\n\\t\\tif(out(mid)) {\\n\\t\\t\\tri = mid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tli = mid + 1;\\n\\t\\t}\\n\\t}\\n\\n\\n\\tif(out(li)) {\\n\\t\\tcout << li << endl;\\n\\t}\\n\\telse {\\n\\t\\tcout << -1 << endl;\\n\\t}\\n\\n\\n\\n\\n\\n\\n\\t\\n \\n\\n \\n \\n\\n}\\n\\n\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n ll T = 1;\\n //cin >> T;\\n rep(i, 1, T) {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1440,\n \"memory_kb\": 37740,\n \"score_of_the_acc\": -1.0088,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2812_9119003\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n//using uLL = unsigned __int128;\\nusing str = string;\\ntemplate <typename T> \\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T>\\nusing pq = priority_queue<T>;\\ntemplate <typename T>\\nusing vec = vector<T>;\\nusing pll = pair<long long, long long>;\\nusing pii = pair<int, int>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvl = vector<vector<ll>>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define vvvm vector<vector<vector<mint>>>\\n#define vvm vector<vector<mint>>\\n#define vm vector<mint>\\ntemplate <typename T1, typename T2>\\nusing umap = unordered_map<T1, T2>;\\ntemplate <typename T>\\nusing uset = unordered_set<T>;\\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\\n#define per(i, s, f) for(long long i = s; i >= f; i--)\\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\\n#define eb(a) emplace_back(a)\\n#define pb(a) push_back(a)\\n#define all0(x) (x).begin() ,(x).end()\\n#define all(x) (x).begin() + 1, (x).end()\\n#define ins(x, l, r) (l <= x && x <= r)\\n#define ENDL '\\\\n'\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//これが本当の組み込み関数ってね（笑）\\ntemplate <typename T>\\nint LB(vector<T> &A, T x) {\\n return lower_bound(A.begin(), A.end(), x) - A.begin();\\n}\\n\\ntemplate <typename T>\\nint UB(vector<T> &A, T x) {\\n return upper_bound(A.begin(), A.end(), x) - A.begin();\\n}\\ntemplate <typename T>\\nvoid UNIQUE(vector<T> &A, int indexed) {\\n sort(A.begin() + indexed, A.end());\\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\\n}\\n\\ntemplate <typename T>\\nvector<T> erase(vector<T>& A, T& x) {\\n\\tvector<T> res;\\n\\tfor(T a : A) if(a != x) res.emplace_back(a);\\n\\treturn res;\\n}\\nstring split(string& S, int l, int r) {\\n\\treturn S.substr(l, r - l + 1);\\n}\\n\\nint msb(long long a) {\\n if(a == 0) return -1;\\n return 64 - int(__builtin_clzll(a));\\n}\\ntemplate<class T>\\nvoid chmin(T &a, T b) {\\n if(a > b) a = b;\\n}\\ntemplate<class T>\\nvoid chmax(T &a, T b) {\\n if(a < b) a = b;\\n}\\n//////////////////////////////////////////////////////////////////////\\n//数学系\\n///////////////////////////////////////////////////////////////////////\\nll extgcd (ll a, ll b, ll &x, ll &y) {\\n if(b == 0) { x = 1;y = 0;return a;}\\n ll d = extgcd(b, a%b, y, x);\\n y -= a/b * x;\\n return d;\\n}\\ntemplate <typename T>\\nT CEIL(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\\n else return a / b;\\n}\\ntemplate <typename T>\\nT FLOOR(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\\n else return a/b - 1;\\n}\\nll SQRT(ll a) {\\n ll l = 0;\\n ll r = 3037000499LL;\\n while(l < r) {\\n ll mid = (l + r + 1) / 2;\\n if(mid * mid <= a) l = mid;\\n else r = mid - 1;\\n }\\n return l;\\n}\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//グローバル変数を置くところ\\n//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma GCC optimize \\\"trapv\\\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\\nconst ll big = 1001001001;\\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\\n//const ll mod = 1000000007;\\n//const ll mod = 998244353;\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\nusing P = pair<short, short>;\\nusing vvp = vec<vec<P>>;\\nusing vp = vec<P>;\\nvoid solve() {\\n\\tll H, W, N;\\n\\tcin >> H >> W >> N;\\n\\tvvp table(H+1, vp(W+1));\\n\\trep(i,1,H) rep(j,1,W) {\\n\\t\\tcin >> table[i][j].first >> table[i][j].second;\\n\\t\\ttable[i][j].first++, table[i][j].second++;\\n\\t}\\n\\tvl R(N+1), C(N+1);\\n\\trep(i,1,N) {\\n\\t\\tcin >> R[i] >> C[i];\\n\\t\\tR[i]++, C[i]++;\\n\\t}\\n\\n\\tconst int M = 17;\\n\\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\\n\\trep(i,1,H)rep(j,1,W) {\\n\\t\\tdabu[0][i][j] = table[i][j];\\n\\t}\\n\\n\\n\\n\\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\\n\\t\\tauto[pi, pj] = dabu[p-1][i][j];\\n\\t\\tdabu[p][i][j] = dabu[p-1][pi][pj];\\n\\t}\\n\\n\\n\\n\\tauto jump = [&](int i, int j, ll step) {\\n\\t\\tif(step==0) return P(i, j);\\n\\t\\trep(p, 0, M) {\\n\\t\\t\\tif(step >> p & 1) {\\n\\t\\t\\t\\tauto [ni, nj] = dabu[p][i][j];\\n\\t\\t\\t\\ti = ni;\\n\\t\\t\\t\\tj = nj;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn P(i, j);\\n\\t};\\n\\n\\tauto out = [&](ll step) {\\n\\t\\tset<P> cnt;\\n\\t\\trep(i,1,N) {\\n\\t\\t\\tauto nex = jump(R[i], C[i], step);\\n\\t\\t\\tif(cnt.count(nex)) return true;\\n\\t\\t\\telse cnt.insert(nex);\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\n\\tll li = 0;\\n\\tll ri = 500001;\\n\\n\\twhile(li < ri) {//xxxxxxooooooo\\n\\t\\tll mid = (li + ri)>>1;\\n\\t\\tif(out(mid)) {\\n\\t\\t\\tri = mid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tli = mid + 1;\\n\\t\\t}\\n\\t}\\n\\n\\n\\tif(out(li)) {\\n\\t\\tcout << li << endl;\\n\\t}\\n\\telse {\\n\\t\\tcout << -1 << endl;\\n\\t}\\n\\n\\n\\n\\n\\n\\n\\t\\n \\n\\n \\n \\n\\n}\\n\\n\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n ll T = 1;\\n //cin >> T;\\n rep(i, 1, T) {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1340,\n \"memory_kb\": 37836,\n \"score_of_the_acc\": -0.9501,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2812_9119002\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n//using uLL = unsigned __int128;\\nusing str = string;\\ntemplate <typename T> \\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T>\\nusing pq = priority_queue<T>;\\ntemplate <typename T>\\nusing vec = vector<T>;\\nusing pll = pair<long long, long long>;\\nusing pii = pair<int, int>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvl = vector<vector<ll>>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define vvvm vector<vector<vector<mint>>>\\n#define vvm vector<vector<mint>>\\n#define vm vector<mint>\\ntemplate <typename T1, typename T2>\\nusing umap = unordered_map<T1, T2>;\\ntemplate <typename T>\\nusing uset = unordered_set<T>;\\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\\n#define per(i, s, f) for(long long i = s; i >= f; i--)\\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\\n#define eb(a) emplace_back(a)\\n#define pb(a) push_back(a)\\n#define all0(x) (x).begin() ,(x).end()\\n#define all(x) (x).begin() + 1, (x).end()\\n#define ins(x, l, r) (l <= x && x <= r)\\n#define ENDL '\\\\n'\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//これが本当の組み込み関数ってね（笑）\\ntemplate <typename T>\\nint LB(vector<T> &A, T x) {\\n return lower_bound(A.begin(), A.end(), x) - A.begin();\\n}\\n\\ntemplate <typename T>\\nint UB(vector<T> &A, T x) {\\n return upper_bound(A.begin(), A.end(), x) - A.begin();\\n}\\ntemplate <typename T>\\nvoid UNIQUE(vector<T> &A, int indexed) {\\n sort(A.begin() + indexed, A.end());\\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\\n}\\n\\ntemplate <typename T>\\nvector<T> erase(vector<T>& A, T& x) {\\n\\tvector<T> res;\\n\\tfor(T a : A) if(a != x) res.emplace_back(a);\\n\\treturn res;\\n}\\nstring split(string& S, int l, int r) {\\n\\treturn S.substr(l, r - l + 1);\\n}\\n\\nint msb(long long a) {\\n if(a == 0) return -1;\\n return 64 - int(__builtin_clzll(a));\\n}\\ntemplate<class T>\\nvoid chmin(T &a, T b) {\\n if(a > b) a = b;\\n}\\ntemplate<class T>\\nvoid chmax(T &a, T b) {\\n if(a < b) a = b;\\n}\\n//////////////////////////////////////////////////////////////////////\\n//数学系\\n///////////////////////////////////////////////////////////////////////\\nll extgcd (ll a, ll b, ll &x, ll &y) {\\n if(b == 0) { x = 1;y = 0;return a;}\\n ll d = extgcd(b, a%b, y, x);\\n y -= a/b * x;\\n return d;\\n}\\ntemplate <typename T>\\nT CEIL(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\\n else return a / b;\\n}\\ntemplate <typename T>\\nT FLOOR(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\\n else return a/b - 1;\\n}\\nll SQRT(ll a) {\\n ll l = 0;\\n ll r = 3037000499LL;\\n while(l < r) {\\n ll mid = (l + r + 1) / 2;\\n if(mid * mid <= a) l = mid;\\n else r = mid - 1;\\n }\\n return l;\\n}\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//グローバル変数を置くところ\\n//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma GCC optimize \\\"trapv\\\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\\nconst ll big = 1001001001;\\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\\n//const ll mod = 1000000007;\\n//const ll mod = 998244353;\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\nusing P = pair<short, short>;\\nusing vvp = vec<vec<P>>;\\nusing vp = vec<P>;\\nvoid solve() {\\n\\tll H, W, N;\\n\\tcin >> H >> W >> N;\\n\\tvvp table(H+1, vp(W+1));\\n\\trep(i,1,H) rep(j,1,W) {\\n\\t\\tcin >> table[i][j].first >> table[i][j].second;\\n\\t\\ttable[i][j].first++, table[i][j].second++;\\n\\t}\\n\\tvl R(N+1), C(N+1);\\n\\trep(i,1,N) {\\n\\t\\tcin >> R[i] >> C[i];\\n\\t\\tR[i]++, C[i]++;\\n\\t}\\n\\n\\tconst int M = 17;\\n\\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\\n\\trep(i,1,H)rep(j,1,W) {\\n\\t\\tdabu[0][i][j] = table[i][j];\\n\\t}\\n\\n\\n\\n\\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\\n\\t\\tauto[pi, pj] = dabu[p-1][i][j];\\n\\t\\tdabu[p][i][j] = dabu[p-1][pi][pj];\\n\\t}\\n\\n\\n\\n\\tauto jump = [&](int i, int j, ll step) {\\n\\t\\tif(step==0) return P(i, j);\\n\\t\\trep(p, 0, M) {\\n\\t\\t\\tif(step >> p & 1) {\\n\\t\\t\\t\\tauto [ni, nj] = dabu[p][i][j];\\n\\t\\t\\t\\ti = ni;\\n\\t\\t\\t\\tj = nj;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn P(i, j);\\n\\t};\\n\\n\\tauto out = [&](ll step) {\\n\\t\\tset<P> cnt;\\n\\t\\trep(i,1,N) {\\n\\t\\t\\tauto nex = jump(R[i], C[i], step);\\n\\t\\t\\tif(cnt.count(nex)) return true;\\n\\t\\t\\telse cnt.insert(nex);\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\n\\tll li = 0;\\n\\tll ri = 2500001;\\n\\n\\twhile(li < ri) {//xxxxxxooooooo\\n\\t\\tll mid = (li + ri)>>1;\\n\\t\\tif(out(mid)) {\\n\\t\\t\\tri = mid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tli = mid + 1;\\n\\t\\t}\\n\\t}\\n\\n\\n\\tif(out(li)) {\\n\\t\\tcout << li << endl;\\n\\t}\\n\\telse {\\n\\t\\tcout << -1 << endl;\\n\\t}\\n\\n\\n\\n\\n\\n\\n\\t\\n \\n\\n \\n \\n\\n}\\n\\n\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n ll T = 1;\\n //cin >> T;\\n rep(i, 1, T) {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.9705882352941176,\n \"time_ms\": 1510,\n \"memory_kb\": 37720,\n \"score_of_the_acc\": -1.0505,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2812_9119000\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n//using uLL = unsigned __int128;\\nusing str = string;\\ntemplate <typename T> \\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T>\\nusing pq = priority_queue<T>;\\ntemplate <typename T>\\nusing vec = vector<T>;\\nusing pll = pair<long long, long long>;\\nusing pii = pair<int, int>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvl = vector<vector<ll>>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define vvvm vector<vector<vector<mint>>>\\n#define vvm vector<vector<mint>>\\n#define vm vector<mint>\\ntemplate <typename T1, typename T2>\\nusing umap = unordered_map<T1, T2>;\\ntemplate <typename T>\\nusing uset = unordered_set<T>;\\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\\n#define per(i, s, f) for(long long i = s; i >= f; i--)\\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\\n#define eb(a) emplace_back(a)\\n#define pb(a) push_back(a)\\n#define all0(x) (x).begin() ,(x).end()\\n#define all(x) (x).begin() + 1, (x).end()\\n#define ins(x, l, r) (l <= x && x <= r)\\n#define ENDL '\\\\n'\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//これが本当の組み込み関数ってね（笑）\\ntemplate <typename T>\\nint LB(vector<T> &A, T x) {\\n return lower_bound(A.begin(), A.end(), x) - A.begin();\\n}\\n\\ntemplate <typename T>\\nint UB(vector<T> &A, T x) {\\n return upper_bound(A.begin(), A.end(), x) - A.begin();\\n}\\ntemplate <typename T>\\nvoid UNIQUE(vector<T> &A, int indexed) {\\n sort(A.begin() + indexed, A.end());\\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\\n}\\n\\ntemplate <typename T>\\nvector<T> erase(vector<T>& A, T& x) {\\n\\tvector<T> res;\\n\\tfor(T a : A) if(a != x) res.emplace_back(a);\\n\\treturn res;\\n}\\nstring split(string& S, int l, int r) {\\n\\treturn S.substr(l, r - l + 1);\\n}\\n\\nint msb(long long a) {\\n if(a == 0) return -1;\\n return 64 - int(__builtin_clzll(a));\\n}\\ntemplate<class T>\\nvoid chmin(T &a, T b) {\\n if(a > b) a = b;\\n}\\ntemplate<class T>\\nvoid chmax(T &a, T b) {\\n if(a < b) a = b;\\n}\\n//////////////////////////////////////////////////////////////////////\\n//数学系\\n///////////////////////////////////////////////////////////////////////\\nll extgcd (ll a, ll b, ll &x, ll &y) {\\n if(b == 0) { x = 1;y = 0;return a;}\\n ll d = extgcd(b, a%b, y, x);\\n y -= a/b * x;\\n return d;\\n}\\ntemplate <typename T>\\nT CEIL(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\\n else return a / b;\\n}\\ntemplate <typename T>\\nT FLOOR(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\\n else return a/b - 1;\\n}\\nll SQRT(ll a) {\\n ll l = 0;\\n ll r = 3037000499LL;\\n while(l < r) {\\n ll mid = (l + r + 1) / 2;\\n if(mid * mid <= a) l = mid;\\n else r = mid - 1;\\n }\\n return l;\\n}\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//グローバル変数を置くところ\\n//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma GCC optimize \\\"trapv\\\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\\nconst ll big = 1001001001;\\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\\n//const ll mod = 1000000007;\\n//const ll mod = 998244353;\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\nusing P = pair<short, short>;\\nusing vvp = vec<vec<P>>;\\nusing vp = vec<P>;\\nvoid solve() {\\n\\tll H, W, N;\\n\\tcin >> H >> W >> N;\\n\\tvvp table(H+1, vp(W+1));\\n\\trep(i,1,H) rep(j,1,W) {\\n\\t\\tcin >> table[i][j].first >> table[i][j].second;\\n\\t\\ttable[i][j].first++, table[i][j].second++;\\n\\t}\\n\\tvl R(N+1), C(N+1);\\n\\trep(i,1,N) {\\n\\t\\tcin >> R[i] >> C[i];\\n\\t\\tR[i]++, C[i]++;\\n\\t}\\n\\n\\tconst int M = 17;\\n\\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\\n\\trep(i,1,H)rep(j,1,W) {\\n\\t\\tdabu[0][i][j] = table[i][j];\\n\\t}\\n\\n\\n\\n\\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\\n\\t\\tauto[pi, pj] = dabu[p-1][i][j];\\n\\t\\tdabu[p][i][j] = dabu[p-1][pi][pj];\\n\\t}\\n\\n\\n\\n\\tauto jump = [&](int i, int j, ll step) {\\n\\t\\tif(step==0) return P(i, j);\\n\\t\\trep(p, 0, M) {\\n\\t\\t\\tif(step >> p & 1) {\\n\\t\\t\\t\\tauto [ni, nj] = dabu[p][i][j];\\n\\t\\t\\t\\ti = ni;\\n\\t\\t\\t\\tj = nj;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn P(i, j);\\n\\t};\\n\\n\\tauto out = [&](ll step) {\\n\\t\\tset<P> cnt;\\n\\t\\trep(i,1,N) {\\n\\t\\t\\tauto nex = jump(R[i], C[i], step);\\n\\t\\t\\tif(cnt.count(nex)) return true;\\n\\t\\t\\telse cnt.insert(nex);\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\n\\tll li = 0;\\n\\tll ri = 1000000;\\n\\n\\twhile(li < ri) {//xxxxxxooooooo\\n\\t\\tll mid = (li + ri)>>1;\\n\\t\\tif(out(mid)) {\\n\\t\\t\\tri = mid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tli = mid + 1;\\n\\t\\t}\\n\\t}\\n\\n\\n\\tif(out(li)) {\\n\\t\\tcout << li << endl;\\n\\t}\\n\\telse {\\n\\t\\tcout << -1 << endl;\\n\\t}\\n\\n\\n\\n\\n\\n\\n\\t\\n \\n\\n \\n \\n\\n}\\n\\n\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n ll T = 1;\\n //cin >> T;\\n rep(i, 1, T) {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1310,\n \"memory_kb\": 37836,\n \"score_of_the_acc\": -0.9321,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2812_9118998\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n//using uLL = unsigned __int128;\\nusing str = string;\\ntemplate <typename T> \\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T>\\nusing pq = priority_queue<T>;\\ntemplate <typename T>\\nusing vec = vector<T>;\\nusing pll = pair<long long, long long>;\\nusing pii = pair<int, int>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvl = vector<vector<ll>>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define vvvm vector<vector<vector<mint>>>\\n#define vvm vector<vector<mint>>\\n#define vm vector<mint>\\ntemplate <typename T1, typename T2>\\nusing umap = unordered_map<T1, T2>;\\ntemplate <typename T>\\nusing uset = unordered_set<T>;\\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\\n#define per(i, s, f) for(long long i = s; i >= f; i--)\\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\\n#define eb(a) emplace_back(a)\\n#define pb(a) push_back(a)\\n#define all0(x) (x).begin() ,(x).end()\\n#define all(x) (x).begin() + 1, (x).end()\\n#define ins(x, l, r) (l <= x && x <= r)\\n#define ENDL '\\\\n'\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//これが本当の組み込み関数ってね（笑）\\ntemplate <typename T>\\nint LB(vector<T> &A, T x) {\\n return lower_bound(A.begin(), A.end(), x) - A.begin();\\n}\\n\\ntemplate <typename T>\\nint UB(vector<T> &A, T x) {\\n return upper_bound(A.begin(), A.end(), x) - A.begin();\\n}\\ntemplate <typename T>\\nvoid UNIQUE(vector<T> &A, int indexed) {\\n sort(A.begin() + indexed, A.end());\\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\\n}\\n\\ntemplate <typename T>\\nvector<T> erase(vector<T>& A, T& x) {\\n\\tvector<T> res;\\n\\tfor(T a : A) if(a != x) res.emplace_back(a);\\n\\treturn res;\\n}\\nstring split(string& S, int l, int r) {\\n\\treturn S.substr(l, r - l + 1);\\n}\\n\\nint msb(long long a) {\\n if(a == 0) return -1;\\n return 64 - int(__builtin_clzll(a));\\n}\\ntemplate<class T>\\nvoid chmin(T &a, T b) {\\n if(a > b) a = b;\\n}\\ntemplate<class T>\\nvoid chmax(T &a, T b) {\\n if(a < b) a = b;\\n}\\n//////////////////////////////////////////////////////////////////////\\n//数学系\\n///////////////////////////////////////////////////////////////////////\\nll extgcd (ll a, ll b, ll &x, ll &y) {\\n if(b == 0) { x = 1;y = 0;return a;}\\n ll d = extgcd(b, a%b, y, x);\\n y -= a/b * x;\\n return d;\\n}\\ntemplate <typename T>\\nT CEIL(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\\n else return a / b;\\n}\\ntemplate <typename T>\\nT FLOOR(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\\n else return a/b - 1;\\n}\\nll SQRT(ll a) {\\n ll l = 0;\\n ll r = 3037000499LL;\\n while(l < r) {\\n ll mid = (l + r + 1) / 2;\\n if(mid * mid <= a) l = mid;\\n else r = mid - 1;\\n }\\n return l;\\n}\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//グローバル変数を置くところ\\n//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma GCC optimize \\\"trapv\\\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\\nconst ll big = 1001001001;\\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\\n//const ll mod = 1000000007;\\n//const ll mod = 998244353;\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\nusing P = pair<short, short>;\\nusing vvp = vec<vec<P>>;\\nusing vp = vec<P>;\\nvoid solve() {\\n\\tll H, W, N;\\n\\tcin >> H >> W >> N;\\n\\tvvp table(H+1, vp(W+1));\\n\\trep(i,1,H) rep(j,1,W) {\\n\\t\\tcin >> table[i][j].first >> table[i][j].second;\\n\\t\\ttable[i][j].first++, table[i][j].second++;\\n\\t}\\n\\tvl R(N+1), C(N+1);\\n\\trep(i,1,N) {\\n\\t\\tcin >> R[i] >> C[i];\\n\\t\\tR[i]++, C[i]++;\\n\\t}\\n\\n\\tconst int M = 18;\\n\\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\\n\\trep(i,1,H)rep(j,1,W) {\\n\\t\\tdabu[0][i][j] = table[i][j];\\n\\t}\\n\\n\\n\\n\\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\\n\\t\\tauto[pi, pj] = dabu[p-1][i][j];\\n\\t\\tdabu[p][i][j] = dabu[p-1][pi][pj];\\n\\t}\\n\\n\\n\\n\\tauto jump = [&](int i, int j, ll step) {\\n\\t\\tif(step==0) return P(i, j);\\n\\t\\trep(p, 0, M) {\\n\\t\\t\\tif(step >> p & 1) {\\n\\t\\t\\t\\tauto [ni, nj] = dabu[p][i][j];\\n\\t\\t\\t\\ti = ni;\\n\\t\\t\\t\\tj = nj;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn P(i, j);\\n\\t};\\n\\n\\tauto out = [&](ll step) {\\n\\t\\tset<P> cnt;\\n\\t\\trep(i,1,N) {\\n\\t\\t\\tauto nex = jump(R[i], C[i], step);\\n\\t\\t\\tif(cnt.count(nex)) return true;\\n\\t\\t\\telse cnt.insert(nex);\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\n\\tll li = 0;\\n\\tll ri = 1000000;\\n\\n\\twhile(li < ri) {//xxxxxxooooooo\\n\\t\\tll mid = (li + ri)>>1;\\n\\t\\tif(out(mid)) {\\n\\t\\t\\tri = mid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tli = mid + 1;\\n\\t\\t}\\n\\t}\\n\\n\\n\\tif(out(li)) {\\n\\t\\tcout << li << endl;\\n\\t}\\n\\telse {\\n\\t\\tcout << -1 << endl;\\n\\t}\\n\\n\\n\\n\\n\\n\\n\\t\\n \\n\\n \\n \\n\\n}\\n\\n\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n ll T = 1;\\n //cin >> T;\\n rep(i, 1, T) {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1340,\n \"memory_kb\": 38720,\n \"score_of_the_acc\": -0.9605,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2812_9118965\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n//using uLL = unsigned __int128;\\nusing str = string;\\ntemplate <typename T> \\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T>\\nusing pq = priority_queue<T>;\\ntemplate <typename T>\\nusing vec = vector<T>;\\nusing pll = pair<long long, long long>;\\nusing pii = pair<int, int>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvl = vector<vector<ll>>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define vvvm vector<vector<vector<mint>>>\\n#define vvm vector<vector<mint>>\\n#define vm vector<mint>\\ntemplate <typename T1, typename T2>\\nusing umap = unordered_map<T1, T2>;\\ntemplate <typename T>\\nusing uset = unordered_set<T>;\\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\\n#define rep1(i, s, f) for(long long i = s; i <= f; i++)\\n#define per(i, s, f) for(long long i = s; i >= f; i--)\\n#define per1(i, s, f) for(long long i = s; i >= f; i--)\\n#define eb(a) emplace_back(a)\\n#define pb(a) push_back(a)\\n#define all0(x) (x).begin() ,(x).end()\\n#define all(x) (x).begin() + 1, (x).end()\\n#define ins(x, l, r) (l <= x && x <= r)\\n#define ENDL '\\\\n'\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//これが本当の組み込み関数ってね（笑）\\ntemplate <typename T>\\nint LB(vector<T> &A, T x) {\\n return lower_bound(A.begin(), A.end(), x) - A.begin();\\n}\\n\\ntemplate <typename T>\\nint UB(vector<T> &A, T x) {\\n return upper_bound(A.begin(), A.end(), x) - A.begin();\\n}\\ntemplate <typename T>\\nvoid UNIQUE(vector<T> &A, int indexed) {\\n sort(A.begin() + indexed, A.end());\\n A.erase(unique(A.begin() + indexed, A.end()), A.end());\\n}\\n\\ntemplate <typename T>\\nvector<T> erase(vector<T>& A, T& x) {\\n\\tvector<T> res;\\n\\tfor(T a : A) if(a != x) res.emplace_back(a);\\n\\treturn res;\\n}\\nstring split(string& S, int l, int r) {\\n\\treturn S.substr(l, r - l + 1);\\n}\\n\\nint msb(long long a) {\\n if(a == 0) return -1;\\n return 64 - int(__builtin_clzll(a));\\n}\\ntemplate<class T>\\nvoid chmin(T &a, T b) {\\n if(a > b) a = b;\\n}\\ntemplate<class T>\\nvoid chmax(T &a, T b) {\\n if(a < b) a = b;\\n}\\n//////////////////////////////////////////////////////////////////////\\n//数学系\\n///////////////////////////////////////////////////////////////////////\\nll extgcd (ll a, ll b, ll &x, ll &y) {\\n if(b == 0) { x = 1;y = 0;return a;}\\n ll d = extgcd(b, a%b, y, x);\\n y -= a/b * x;\\n return d;\\n}\\ntemplate <typename T>\\nT CEIL(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b + 1;\\n else return a / b;\\n}\\ntemplate <typename T>\\nT FLOOR(T a, T b) {\\n assert(b != 0);\\n if(a % b == 0) return a / b;\\n if((a <= 0 && b < 0) || (a >= 0 && b > 0)) return a/b;\\n else return a/b - 1;\\n}\\nll SQRT(ll a) {\\n ll l = 0;\\n ll r = 3037000499LL;\\n while(l < r) {\\n ll mid = (l + r + 1) / 2;\\n if(mid * mid <= a) l = mid;\\n else r = mid - 1;\\n }\\n return l;\\n}\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n//グローバル変数を置くところ\\n//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma GCC optimize \\\"trapv\\\" //お祈り。変数同士の演算でのみ感知。代入や、 a *= 10000 では感知しない。\\nconst ll big = 1001001001;\\nvl dx{0, 1, 0, -1, 0, 1, 1, -1, -1}; // 座標平面において、(番兵) → ↓ ← ↑ ※ 右から時計回り 注 : グリッド or 座標で上下は反転する。\\nvl dy{0, 0, -1, 0, 1, 1, -1, -1, 1};\\n//const ll mod = 1000000007;\\n//const ll mod = 998244353;\\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\nusing P = pair<short, short>;\\nusing vvp = vec<vec<P>>;\\nusing vp = vec<P>;\\nvoid solve() {\\n\\tll H, W, N;\\n\\tcin >> H >> W >> N;\\n\\tvvp table(H+1, vp(W+1));\\n\\trep(i,1,H) rep(j,1,W) {\\n\\t\\tcin >> table[i][j].first >> table[i][j].second;\\n\\t\\ttable[i][j].first++, table[i][j].second++;\\n\\t}\\n\\tvl R(N+1), C(N+1);\\n\\trep(i,1,N) {\\n\\t\\tcin >> R[i] >> C[i];\\n\\t\\tR[i]++, C[i]++;\\n\\t}\\n\\n\\tconst int M = 20;\\n\\tvec<vvp> dabu(M+1, vvp(H+1, vp(W+1)));\\n\\trep(i,1,H)rep(j,1,W) {\\n\\t\\tdabu[0][i][j] = table[i][j];\\n\\t}\\n\\n\\n\\n\\trep(p, 1, M) rep(i,1,H) rep(j,1,W) {\\n\\t\\tauto[pi, pj] = dabu[p-1][i][j];\\n\\t\\tdabu[p][i][j] = dabu[p-1][pi][pj];\\n\\t}\\n\\n\\n\\n\\tauto jump = [&](int i, int j, ll step) {\\n\\t\\tif(step==0) return P(i, j);\\n\\t\\trep(p, 0, M) {\\n\\t\\t\\tif(step >> p & 1) {\\n\\t\\t\\t\\tauto [ni, nj] = dabu[p][i][j];\\n\\t\\t\\t\\ti = ni;\\n\\t\\t\\t\\tj = nj;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn P(i, j);\\n\\t};\\n\\n\\tauto out = [&](ll step) {\\n\\t\\tset<P> cnt;\\n\\t\\trep(i,1,N) {\\n\\t\\t\\tauto nex = jump(R[i], C[i], step);\\n\\t\\t\\tif(cnt.count(nex)) return true;\\n\\t\\t\\telse cnt.insert(nex);\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\n\\tll li = 0;\\n\\tll ri = 10000000;\\n\\n\\twhile(li < ri) {//xxxxxxooooooo\\n\\t\\tll mid = (li + ri)>>1;\\n\\t\\tif(out(mid)) {\\n\\t\\t\\tri = mid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tli = mid + 1;\\n\\t\\t}\\n\\t}\\n\\n\\n\\tif(out(li)) {\\n\\t\\tcout << li << endl;\\n\\t}\\n\\telse {\\n\\t\\tcout << -1 << endl;\\n\\t}\\n\\n\\n\\n\\n\\n\\n\\t\\n \\n\\n \\n \\n\\n}\\n\\n\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n ll T = 1;\\n //cin >> T;\\n rep(i, 1, T) {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1740,\n \"memory_kb\": 40616,\n \"score_of_the_acc\": -1.2223,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2812_9117934\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//高速化 \\nstruct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;\\n//#define endl '\\\\n' //インタラクティブ問題の時は消す\\n\\n//型\\nusing ll = long long;\\nusing ld = long double;\\ntemplate<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;\\nusing vi = vc<int>; using vvi = vvc<int>; using vvvi = vvvc<int>;\\nusing vl = vc<ll>; using vvl = vvc<ll>; using vvvl = vvvc<ll>;\\nusing pi = pair<int, int>; using pl = pair<ll, ll>;\\nusing ull = unsigned ll;\\ntemplate<class T>using priq = priority_queue<T>;\\ntemplate<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;\\n\\n// for文\\n#define overload4(a, b, c, d, e, ...) e\\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, step) for(ll i = a; i < b; i+= step)\\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define per1(n) for(ll i = n-1; i >= 0; i--)\\n#define per2(i, n) for(ll i = n-1; i >= 0; i--)\\n#define per3(i, a, b) for(ll i = b-1; i >= a; i--)\\n#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)\\n#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)\\n#define fore1(a) for(auto&& i : a)\\t\\n#define fore2(i,a) for(auto&& i : a)\\n#define fore3(x,y,a) for(auto&& [x, y] : a)\\n#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)\\n#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)\\n\\n//関数\\n#define mp make_pair\\n#define mt make_tuple\\n#define a first\\n#define b second\\n#define pb emplace_back\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define si(x) (ll)(x).size()\\ntemplate<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}\\ntemplate<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}\\ntemplate<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}\\ntemplate<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}\\ntemplate<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}\\ntemplate<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}\\ntemplate<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}\\n\\n//入出力(operator)\\ntemplate<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}\\ntemplate<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}\\n\\ntemplate<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<\\\" \\\"<<a.b;}\\ntemplate<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<\\\" \\\";}return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<\\\" \\\";}return os;}\\ntemplate<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<\\\" \\\"<<y<<\\\"\\\\n\\\";}return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<\\\" \\\";}return os;}\\ntemplate<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<\\\" \\\"<<y<<\\\"\\\\n\\\";}return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<\\\" \\\";return os;}\\ntemplate<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<\\\"\\\\n\\\";return os;}\\n\\n//入出力(関数)\\nvi readvi(ll n){vi a(n);cin>>a;return a;}\\nvl readvl(ll n){vl a(n);cin>>a;return a;}\\nvvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].pb(b);if(bidirected)g[b].pb(a);}return g;}\\nvvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].pb(b,c);if(bidirected)g[b].pb(a,c);}return g;}\\nvvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}\\nvvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}\\n\\ninline void yes(){cout << \\\"Yes\\\\n\\\";}\\ninline void no(){cout << \\\"No\\\\n\\\";}\\ninline void yesno(bool y = true){if(y)yes();else no();}\\n\\n//定数\\nconstexpr ll mod = 998244353;\\nconstexpr ll minf=-(1<<29);\\nconstexpr ll inf=(1<<29);\\nconstexpr ll MINF=-(1LL<<60);\\nconstexpr ll INF=(1LL<<60);\\nconstexpr ld EPS = 1e-8;\\nconst ld PI = acosl(-1);\\n#define equals(a, b) (abs((a) - (b)) < EPS)\\nconst int dx[4] ={-1, 0, 1, 0};\\nconst int dy[4] ={ 0, 1, 0,-1};\\nconst int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};\\nconst int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};\\n\\nvoid solve();\\nint main() {\\n\\tint t = 1;\\n // cin >>t;\\n while(t--)solve();\\n}\\n\\nint h, w, n;\\nint id(int i, int j){\\n return i * w + j;\\n}\\n\\nvoid solve(){\\n cin >> h >> w >> n;\\n vi to(h * w);\\n vvi g(h * w);\\n rep(i,h){\\n rep(j,w){\\n int x, y;\\n cin >> x >> y;\\n to[id(i, j)] = id(x, y);\\n g[id(x, y)].emplace_back(id(i, j));\\n }\\n }\\n\\n vi d(h * w , inf);\\n vi par(h * w , -1);\\n vi r(h * w , -1);\\n vi r2(h * w);\\n rep(i, h * w) r2[i] = i;\\n vi loop(h * w, inf);\\n\\n rep(i, h*w){\\n if(d[i] == inf){\\n int nw = i;\\n d[nw] = inf - 1;\\n\\n while(d[to[nw]] == inf){\\n d[to[nw]] = d[nw] - 1;\\n nw = to[nw];\\n }\\n while(loop[to[nw]] == inf){\\n nw = to[nw];\\n loop[nw] = 0;\\n }\\n loop[nw] = 0;\\n\\n\\n queue<int> q;\\n q.push(nw);\\n par[nw] = nw;\\n r[nw] = d[to[nw]] - d[nw] + 1;\\n d[nw] = 0;\\n\\n while(q.size()){\\n int p = q.front();\\n q.pop();\\n rep(j, si(g[p])){\\n if(chmin(d[g[p][j]], d[p] + 1)){\\n par[g[p][j]] = par[p];\\n r[g[p][j]] = r[p];\\n if(chmin(loop[g[p][j]], loop[p] + 1)){\\n r2[g[p][j]] = r2[p];\\n }\\n q.push(g[p][j]);\\n }\\n }\\n }\\n }\\n }\\n\\n vi x(n);\\n vi ex(h * w);\\n map<pair<int, int>, int> mns;\\n rep(i,n){\\n int a, b;\\n cin >> a >> b;\\n x[i] = id(a, b);\\n ex[x[i]] = 1;\\n if(mns.find({par[x[i]], d[x[i]] % r[x[i]]}) == mns.end()){\\n mns[{par[x[i]], d[x[i]] % r[x[i]]}] = loop[x[i]];\\n }\\n chmin(mns[{par[x[i]], d[x[i]] % r[x[i]]}], loop[x[i]]);\\n }\\n\\n ll ans = inf;\\n rep(i, n){\\n if(mns[{par[x[i]], d[x[i]] % r[x[i]]}] != loop[x[i]]){\\n chmin(ans, loop[x[i]]);\\n }\\n }\\n \\n\\n set<pair<int,int>> mn2;\\n rep(i,n){\\n if(mn2.find({r2[x[i]], loop[x[i]]}) != mn2.end()){\\n chmin(ans, loop[x[i]]);\\n }\\n else{\\n mn2.insert({r2[x[i]], loop[x[i]]});\\n }\\n }\\n\\n\\n auto dfs = [&](auto&&dfs, int p)->set<int> {\\n set<int> nw;\\n if(ex[p]) nw.insert(loop[p]);\\n for(auto to : g[p]){\\n if(loop[to] != loop[p] + 1) continue;\\n set<int> nx = dfs(dfs, to);\\n if(nw.size() < nx.size()) nw.swap(nx);\\n for(auto v : nx){\\n if(nw.count(v)){\\n chmin(ans, v - loop[p]);\\n }else{\\n nw.insert(v);\\n }\\n }\\n }\\n return nw;\\n };\\n\\n\\n rep(i,h * w){\\n if(loop[i] == 0){\\n dfs(dfs, i);\\n }\\n }\\n\\n cout << (ans == inf ? -1 : ans) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 51860,\n \"score_of_the_acc\": -0.4924,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2812_9117850\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\\n\\ntemplate <typename T> bool chmin(T &a, const T &b) {\\n\\tif (a <= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> bool chmax(T &a, const T &b) {\\n\\tif (a >= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> T max(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T min(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T sum(vector<T> &a){\\n\\tT ret = 0;\\n\\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\\n\\treturn ret;\\n}\\nint main(){\\n\\t cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\t\\n\\tint h, w, n; cin >> h >> w >> n;\\n\\tvector gx(h, vector<int>(w));\\n\\tvector gy(h, vector<int>(w));\\n\\trep(i,0,h){\\n\\t\\trep(j,0,w){\\n\\t\\t\\tint r, c; cin >> r >> c;\\n\\t\\t\\tgx[i][j] = r;\\n\\t\\t\\tgy[i][j] = c;\\n\\t\\t}\\n\\t}\\n\\n\\tvector dbx(20, vector(h, vector<int>(w)));\\n\\tvector dby(20, vector(h, vector<int>(w)));\\n\\trep(i,0,h) rep(j,0,w){\\n\\t\\tdbx[0][i][j] = gx[i][j];\\n\\t\\tdby[0][i][j] = gy[i][j];\\n\\t}\\n\\n\\trep(num,0,19){\\n\\t\\trep(i,0,h){\\n\\t\\t\\trep(j,0,w){\\n\\t\\t\\t\\tint x = dbx[num][i][j];\\n\\t\\t\\t\\tint y = dby[num][i][j];\\n\\t\\t\\t\\tdbx[num+1][i][j] = dbx[num][x][y];\\n\\t\\t\\t\\tdby[num+1][i][j] = dby[num][x][y];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int> rx(n), ry(n);\\n\\trep(i,0,n){\\n\\t\\tcin >> rx[i] >> ry[i];\\n\\t}\\n\\n\\tauto check = [&](int t) -> bool {\\n\\t\\tvector<int> mx(n), my(n);\\n\\t\\tmx = rx;\\n\\t\\tmy = ry;\\n\\t\\trep(num,0,20){\\n\\t\\t\\tif (t >> num & 1){\\n\\t\\t\\t\\trep(i,0,n){\\n\\t\\t\\t\\t\\tint x = dbx[num][mx[i]][my[i]];\\n\\t\\t\\t\\t\\tint y = dby[num][mx[i]][my[i]];\\n\\t\\t\\t\\t\\tmx[i] = x;\\n\\t\\t\\t\\t\\tmy[i] = y;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector nums(h, vector<int>(w));\\n\\t\\trep(i,0,n){\\n\\t\\t\\tnums[mx[i]][my[i]]++;\\n\\t\\t\\tif (nums[mx[i]][my[i]] >= 2) return true;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\tint ub = 299999;\\n\\tint lb = 0;\\n\\twhile (ub - lb > 1){\\n\\t\\tint t = (ub + lb) / 2;\\n\\t\\tif (check(t)) ub = t;\\n\\t\\telse lb = t;\\n\\t}\\n\\n\\tif (lb > 288888){\\n\\t\\tcout << -1 << '\\\\n';\\n\\t}else{\\n\\t\\tcout << ub << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 49828,\n \"score_of_the_acc\": -0.3787,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2812_9117831\",\n \"code_snippet\": \"#pragma region //comavius::competitive library\\n\\n#pragma region //inclusion and optimization\\n#include <bits/stdc++.h>\\n#ifdef IS_TEST\\nstatic const bool IS_TEST_ENVIROMENT = true;\\n#else\\nstatic const bool IS_TEST_ENVIROMENT = false;\\n#endif\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#pragma endregion //inclusion and optimization\\n\\nnamespace comavius::competitive { //typedefs\\n\\n #pragma region //long long\\n typedef int ll;\\n typedef std::vector<ll> vll;\\n typedef std::vector<vll> vvll;\\n typedef std::vector<vvll> vvvll;\\n typedef std::map<ll, ll> mll;\\n typedef std::map<ll, mll> mmll;\\n typedef std::pair<ll, ll> pll;\\n typedef std::vector<pll> vpll;\\n #pragma endregion //long long\\n\\n #pragma region //long double\\n typedef long double ld;\\n typedef std::vector<ld> vld;\\n typedef std::vector<vld> vvld;\\n typedef std::vector<vvld> vvvld;\\n #pragma endregion //long double\\n\\n #pragma region //std::string\\n typedef std::string str;\\n typedef std::vector<str> vstr;\\n typedef std::vector<vstr> vvstr;\\n typedef std::vector<vvstr> vvvstr;\\n #pragma endregion //std::string\\n\\n #pragma region //bool\\n typedef std::vector<bool> vb;\\n typedef std::vector<vb> vvb;\\n typedef std::vector<vvb> vvvb;\\n #pragma endregion //bool\\n\\n #pragma region //char\\n typedef std::vector<char> vc;\\n typedef std::vector<vc> vvc;\\n typedef std::vector<vvc> vvvc;\\n #pragma endregion //char\\n\\n #pragma region //container of std\\n #pragma region //std::vector\\n template <typename T>\\n using vec = std::vector<T>;\\n template <typename T>\\n using vec2 = std::vector<std::vector<T>>;\\n template <typename T>\\n using vec3 = std::vector<std::vector<std::vector<T>>>;\\n template <typename T>\\n using vec4 = std::vector<std::vector<std::vector<std::vector<T>>>>;\\n template <typename T>\\n using vec5 = std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>;\\n template <typename T>\\n using vec6 = std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>>;\\n template <typename T>\\n using vec7 = std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T>>>>>>>;\\n #pragma endregion //std::vector\\n #pragma endregion //container of std\\n\\n} // namespace comavius::competitive typedefs\\n\\n\\n#pragma region //Read macro\\n #define GET_1_ARG(TYPE, ARG); TYPE ARG; std::cin >> ARG;\\n #define GET_2_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_1_ARG(TYPE, __VA_ARGS__)\\n #define GET_3_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_2_ARG(TYPE, __VA_ARGS__)\\n #define GET_4_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_3_ARG(TYPE, __VA_ARGS__)\\n #define GET_5_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_4_ARG(TYPE, __VA_ARGS__)\\n #define GET_6_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_5_ARG(TYPE, __VA_ARGS__)\\n #define GET_7_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_6_ARG(TYPE, __VA_ARGS__)\\n #define GET_8_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_7_ARG(TYPE, __VA_ARGS__)\\n #define GET_9_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_8_ARG(TYPE, __VA_ARGS__)\\n #define GET_10_ARG(TYPE, ARG, ...) GET_1_ARG(TYPE, ARG) GET_9_ARG(TYPE, __VA_ARGS__)\\n\\n #define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME\\n #define read(TYPE, ...) GET_MACRO(__VA_ARGS__, GET_10_ARG, GET_9_ARG, GET_8_ARG, GET_7_ARG, GET_6_ARG, GET_5_ARG, GET_4_ARG, GET_3_ARG, GET_2_ARG, GET_1_ARG)(TYPE, __VA_ARGS__)\\n\\n #define readv(TYPE, NAME, SIZE) std::vector<TYPE> NAME(SIZE); for (long long i = 0; i < SIZE; i++) std::cin >> NAME[i];\\n #define readvv(TYPE, NAME, H, W) std::vector<std::vector<TYPE>> NAME(H, std::vector<TYPE>(W)); for (long long i = 0; i < H; i++) for (long long j = 0; j < W; j++) std::cin >> NAME[i][j];\\n#pragma endregion //Read macro\\n\\n#pragma region //Other macro\\n #define rep(i, n) for (ll i = 0; i < n; i++)\\n #define reps(i, start, goal, diff) for (ll i = start; i != goal; i += diff)\\n #define all(a) a.begin(), a.end()\\n// #define chmax(a, b) a = std::max(a, b)\\n// #define chmin(a, b) a = std::min(a, b)\\n#pragma endregion //Other macro\\n\\n#pragma region //namespace expansion\\n using namespace std;\\n using namespace comavius::competitive;\\n#pragma endregion //namespace expansion\\n\\n#pragma endregion //comavius::competitive library\\n\\n\\n\\n#pragma region // fundamental structures\\n\\nusing vvpll = vector<vpll>;\\n\\nint main() {\\n int h, w, n;\\n scanf(\\\"%d\\\", &h);\\n scanf(\\\"%d\\\", &w);\\n scanf(\\\"%d\\\", &n);\\n ll hw = h * w;\\n vvll next(hw, vll(30));\\n rep(i, h) {\\n rep(j, w) {\\n int r, c;\\n scanf(\\\"%d\\\", &r);\\n scanf(\\\"%d\\\", &c);\\n next[i*w+j][0] = r*w+c;\\n }\\n }\\n vll start;\\n rep(i, n) {\\n int r, c;\\n scanf(\\\"%d\\\", &r);\\n scanf(\\\"%d\\\", &c);\\n start.push_back(r*w+c);\\n }\\n rep(i, 29) {\\n rep(j, hw) {\\n ll nx = next[next[j][i]][i];\\n next[j][i+1] = nx;\\n }\\n }\\n ll l = 0, r = 1ll<<28;\\n while (r - l > 1) {\\n ll mid = (l+r) / 2;\\n vb visited(hw, false);\\n bool ok = true;\\n for (auto s : start) {\\n ll dest = s;\\n rep(i, 29) {\\n if (mid & (1ll << i)) {\\n dest = next[dest][i];\\n }\\n }\\n if (visited[dest]) {\\n ok = false;\\n break;\\n }\\n visited[dest] = true;\\n }\\n if (ok) {\\n l = mid;\\n }\\n else {\\n r = mid;\\n }\\n }\\n if (r == 1ll<<28) {\\n cout << \\\"-1\\\" << endl;\\n }\\n else {\\n cout << r << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 41200,\n \"score_of_the_acc\": -0.7382,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2812_9117800\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\\n\\ntemplate <typename T> bool chmin(T &a, const T &b) {\\n\\tif (a <= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> bool chmax(T &a, const T &b) {\\n\\tif (a >= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> T max(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T min(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T sum(vector<T> &a){\\n\\tT ret = 0;\\n\\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\\n\\treturn ret;\\n}\\nint main(){\\n\\tint h, w, n; cin >> h >> w >> n;\\n\\tvector gx(h, vector<int>(w));\\n\\tvector gy(h, vector<int>(w));\\n\\trep(i,0,h){\\n\\t\\trep(j,0,w){\\n\\t\\t\\tint r, c; cin >> r >> c;\\n\\t\\t\\tgx[i][j] = r;\\n\\t\\t\\tgy[i][j] = c;\\n\\t\\t}\\n\\t}\\n\\n\\tvector dbx(20, vector(h, vector<int>(w)));\\n\\tvector dby(20, vector(h, vector<int>(w)));\\n\\trep(i,0,h) rep(j,0,w){\\n\\t\\tdbx[0][i][j] = gx[i][j];\\n\\t\\tdby[0][i][j] = gy[i][j];\\n\\t}\\n\\n\\trep(num,0,19){\\n\\t\\trep(i,0,h){\\n\\t\\t\\trep(j,0,w){\\n\\t\\t\\t\\tint x = gx[i][j];\\n\\t\\t\\t\\tint y = gy[i][j];\\n\\t\\t\\t\\tdbx[num+1][i][j] = dbx[num][x][y];\\n\\t\\t\\t\\tdby[num+1][i][j] = dby[num][x][y];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int> rx(n), ry(n);\\n\\trep(i,0,n){\\n\\t\\tcin >> rx[i] >> ry[i];\\n\\t}\\n\\n\\tauto check = [&](int t) -> bool {\\n\\t\\tvector<int> mx(n), my(n);\\n\\t\\tmx = rx;\\n\\t\\tmy = ry;\\n\\t\\trep(num,0,20){\\n\\t\\t\\tif (t >> num & 1){\\n\\t\\t\\t\\trep(i,0,n){\\n\\t\\t\\t\\t\\tint x = dbx[num][mx[i]][my[i]];\\n\\t\\t\\t\\t\\tint y = dby[num][mx[i]][my[i]];\\n\\t\\t\\t\\t\\tmx[i] = x;\\n\\t\\t\\t\\t\\tmy[i] = y;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector nums(h, vector<int>(w));\\n\\t\\trep(i,0,n){\\n\\t\\t\\tnums[mx[i]][my[i]]++;\\n\\t\\t\\tif (nums[mx[i]][my[i]] >= 2) return true;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\tint ub = 299999;\\n\\tint lb = 0;\\n\\twhile (ub - lb > 1){\\n\\t\\tint t = (ub + lb) / 2;\\n\\t\\tif (check(t)) ub = t;\\n\\t\\telse lb = t;\\n\\t}\\n\\n\\tif (lb > 288888){\\n\\t\\tcout << -1 << '\\\\n';\\n\\t}else{\\n\\t\\tcout << ub << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 220,\n \"memory_kb\": 49808,\n \"score_of_the_acc\": -0.4203,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2812_8492223\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 2812.cc: H: ジャンプパーティ\\n */\\n\\n#include<cstdio>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_H = 500;\\nconst int MAX_W = 500;\\nconst int MAX_HW = MAX_H * MAX_W;\\nconst int BN = 18;\\n\\n/* typedef */\\n\\n/* global variables */\\n\\nint ps[MAX_HW][BN], ss[MAX_HW];\\nbool fs[MAX_HW];\\n\\n/* subroutines */\\n\\nbool check(int hw, int n, int k) {\\n fill(fs, fs + hw, false);\\n for (int i = 0; i < n; i++) {\\n int u = ss[i];\\n for (int i = 0; i < BN; i++)\\n if ((k >> i) & 1) u = ps[u][i];\\n if (fs[u]) return true;\\n fs[u] = true;\\n }\\n return false;\\n}\\n\\n/* main */\\n\\nint main() {\\n int h, w, n;\\n scanf(\\\"%d%d%d\\\", &h, &w, &n);\\n int hw = h * w;\\n\\n for (int i = 0; i < h; i++)\\n for (int j = 0; j < w; j++) {\\n int r, c;\\n scanf(\\\"%d%d\\\", &r, &c);\\n ps[i * w + j][0] = r * w + c;\\n }\\n\\n for (int i = 0; i < BN - 1; i++)\\n for (int u = 0; u < hw; u++)\\n ps[u][i + 1] = ps[ps[u][i]][i];\\n\\n for (int i = 0; i < n; i++) {\\n int r, c;\\n scanf(\\\"%d%d\\\", &r, &c);\\n ss[i] = r * w + c;\\n }\\n\\n int k0 = 0, k1 = hw + 1;\\n while (k0 + 1 < k1) {\\n int k = (k0 + k1) / 2;\\n if (check(hw, n, k)) k1 = k;\\n else k0 = k;\\n }\\n\\n printf(\\\"%d\\\\n\\\", (k1 > hw) ? -1 : k1);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 21728,\n \"score_of_the_acc\": -0.0359,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2812_5967186\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n//#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\nusing namespace std;\\n//#include<boost/multiprecision/cpp_int.hpp>\\n//#include<boost/multiprecision/cpp_dec_float.hpp>\\n//namespace mp=boost::multiprecision;\\n//#define mulint mp::cpp_int\\n//#define mulfloat mp::cpp_dec_float_100\\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\\n#define INF (1<<30)\\n#define LINF (lint)(1LL<<56)\\n#define endl \\\"\\\\n\\\"\\n#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)\\n#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)\\n#define flc(x) __builtin_popcountll(x)\\n#define pint pair<int,int>\\n#define pdouble pair<double,double>\\n#define plint pair<lint,lint>\\n#define fi first\\n#define se second\\n#define all(x) x.begin(),x.end()\\n#define vec vector<lint>\\n#define nep(x) next_permutation(all(x))\\ntypedef long long lint;\\nint dx[8]={1,1,0,-1,-1,-1,0,1};\\nint dy[8]={0,1,1,1,0,-1,-1,-1};\\nconst int MAX_N=4e5+5;\\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//vector<int> bucket[MAX_N/1000];\\nconstexpr int MOD=1000000007;\\n//constexpr int MOD=998244353;\\n/*#include<atcoder/all>\\nusing namespace atcoder;\\ntypedef __int128_t llint;*/\\n\\nstruct doubling{\\n vector<vector<lint>> to,sum;\\n doubling(vector<lint> in,int log){\\n to.resize(log);\\n rep(i,log) to[i].resize(in.size());\\n rep(i,in.size()) to[0][i]=in[i];\\n for(int i=1;i<log;i++) rep(j,in.size()) to[i][j]=to[i-1][to[i-1][j]];\\n sum.resize(log);\\n rep(i,log) sum[i].resize(in.size());\\n rep(i,in.size()) sum[0][i]=i;\\n for(int i=1;i<log;i++) rep(j,in.size()) sum[i][j]=sum[i-1][j]+sum[i-1][to[i-1][j]];\\n }\\n doubling(vector<lint> in,vector<lint> in2, int log){//dsumでin2の値を使うようにする\\n to.resize(log);\\n rep(i,log) to[i].resize(in.size());\\n rep(i,in.size()) to[0][i]=in[i];\\n for(int i=1;i<log;i++) rep(j,in.size()) to[i][j]=to[i-1][to[i-1][j]];\\n sum.resize(log);\\n rep(i,log) sum[i].resize(in.size());\\n rep(i,in.size()) sum[0][i]=in2[i];\\n for(int i=1;i<log;i++) rep(j,in.size()) sum[i][j]=sum[i-1][j]+sum[i-1][to[i-1][j]];\\n }\\n lint dest(lint now,lint k){//nowのk個先\\n rep(i,to.size()){\\n if(k&(1LL<<i)) now=to[i][now];\\n }\\n return now;\\n }\\n lint dsum(lint now,lint k){//Σ[i=0..k-1]\\n lint res=0;\\n rep(i,to.size()){\\n if(k&(1LL<<i)) res+=sum[i][now],now=to[i][now];\\n }\\n return res;\\n }\\n};\\n\\nint main(void){\\n int H,W,N;\\n cin >> H >> W >> N;\\n vector<lint> nxt(H*W);\\n rep(i,H) rep(j,W){\\n int h,w;\\n cin >> h >> w;\\n int now=i*W+j;\\n int to=h*W+w;\\n nxt[now]=to;\\n }\\n doubling db(nxt,25);\\n int R[N],C[N];\\n rep(i,N) cin >> R[i] >> C[i];\\n int p[N];\\n rep(i,N) p[i]=R[i]*W+C[i];\\n int lo=0,hi=1e6;\\n while(hi-lo>1){\\n int mid=(hi+lo)/2;\\n int cnt[H*W]={};\\n rep(i,N) cnt[db.dest(p[i],mid)]++;\\n if(*max_element(cnt,cnt+H*W)>1) hi=mid;\\n else lo=mid;\\n }\\n if(hi==1e6) cout << -1 << endl;\\n else cout << hi << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 106684,\n \"score_of_the_acc\": -1.2695,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2812_3992940\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\nconst ll INF = 1LL << 60;\\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\\n\\n\\n\\nint main() {\\n\\n\\tint H, W, N;\\n\\tcin >> H >> W >> N;\\n\\tvector<vector<int>>y(H, vector<int>(W));\\n\\tvector<vector<int>>x(H, vector<int>(W));\\n\\tfor (int i = 0; i < H; i++) {\\n\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\tcin >> y[i][j] >> x[i][j];\\n\\t\\t}\\n\\t}\\n\\tvector<int>sy(N);\\n\\tvector<int>sx(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> sy[i] >> sx[i];\\n\\t}\\n\\tvector<vector<vector<int>>>tapiY(H, vector<vector<int>>(W, vector<int>(20)));\\n\\tvector<vector<vector<int>>>tapiX(H, vector<vector<int>>(W, vector<int>(20)));\\n\\tfor (int i = 0; i < 20; i++) {\\n\\t\\tfor (int j = 0; j < H; j++) {\\n\\t\\t\\tfor (int k = 0; k < W; k++) {\\n\\t\\t\\t\\tif (i) {\\n\\t\\t\\t\\t\\tint yy = tapiY[j][k][i - 1];\\n\\t\\t\\t\\t\\tint xx = tapiX[j][k][i - 1];\\n\\t\\t\\t\\t\\ttapiY[j][k][i] = tapiY[yy][xx][i - 1];\\n\\t\\t\\t\\t\\ttapiX[j][k][i] = tapiX[yy][xx][i - 1];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\ttapiY[j][k][i] = y[j][k];\\n\\t\\t\\t\\t\\ttapiX[j][k][i] = x[j][k];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = 0;\\n\\tvector<int>ny(N);\\n\\tvector<int>nx(N);\\n\\tfor (int i = 19; i >= 0; i--) {\\n\\t\\tset<pair<int, int>>st;\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tny[j] = tapiY[sy[j]][sx[j]][i];\\n\\t\\t\\tnx[j] = tapiX[sy[j]][sx[j]][i];\\n\\t\\t\\tst.insert({ ny[j],nx[j] });\\n\\t\\t}\\n\\t\\tif (st.size() == N) {\\n\\t\\t\\tsy = ny;\\n\\t\\t\\tsx = nx;\\n\\t\\t\\tans += 1 << i;\\n\\t\\t}\\n\\t}\\n\\tif (ans == (1 << 20) - 1) {\\n\\t\\tcout << -1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tcout << ans + 1 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1650,\n \"memory_kb\": 79156,\n \"score_of_the_acc\": -1.6221,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2812_3991602\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\nconst ll INF = 1LL << 60;\\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\\n\\n\\n\\nint main() {\\n\\n\\tint H, W, N;\\n\\tcin >> H >> W >> N;\\n\\tvector<vector<int>>y(H, vector<int>(W));\\n\\tvector<vector<int>>x(H, vector<int>(W));\\n\\tfor (int i = 0; i < H; i++) {\\n\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\tcin >> y[i][j] >> x[i][j];\\n\\t\\t}\\n\\t}\\n\\tvector<int>sy(N);\\n\\tvector<int>sx(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> sy[i] >> sx[i];\\n\\t}\\n\\tvector<vector<vector<int>>>tapiY(H, vector<vector<int>>(W, vector<int>(20)));\\n\\tvector<vector<vector<int>>>tapiX(H, vector<vector<int>>(W, vector<int>(20)));\\n\\tfor (int i = 0; i < 20; i++) {\\n\\t\\tfor (int j = 0; j < H; j++) {\\n\\t\\t\\tfor (int k = 0; k < W; k++) {\\n\\t\\t\\t\\tif (i) {\\n\\t\\t\\t\\t\\tint yy = tapiY[j][k][i - 1];\\n\\t\\t\\t\\t\\tint xx = tapiX[j][k][i - 1];\\n\\t\\t\\t\\t\\ttapiY[j][k][i] = tapiY[yy][xx][i - 1];\\n\\t\\t\\t\\t\\ttapiX[j][k][i] = tapiX[yy][xx][i - 1];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\ttapiY[j][k][i] = y[j][k];\\n\\t\\t\\t\\t\\ttapiX[j][k][i] = x[j][k];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = 0;\\n\\tvector<int>ny(N);\\n\\tvector<int>nx(N);\\n\\tfor (int i = 19; i >= 0; i--) {\\n\\t\\tset<pair<int, int>>st;\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tny[j] = tapiY[sy[j]][sx[j]][i];\\n\\t\\t\\tnx[j] = tapiX[sy[j]][sx[j]][i];\\n\\t\\t\\tst.insert({ ny[j],nx[j] });\\n\\t\\t}\\n\\t\\tif (st.size() == N) {\\n\\t\\t\\tsy = ny;\\n\\t\\t\\tsx = nx;\\n\\t\\t\\tans += 1 << i;\\n\\t\\t}\\n\\t}\\n\\tif (ans == (1 << 20) - 1) {\\n\\t\\tcout << -1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tcout << ans + 1 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1680,\n \"memory_kb\": 79172,\n \"score_of_the_acc\": -1.6402,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2812_3906946\",\n \"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 <tuple>\\n#include <bitset>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nstruct Coordinate {\\n\\tint x, y;\\n};\\n\\nint main() {\\n\\tstd::cin.sync_with_stdio(false);\\n\\tint h, w, n; std::cin >> h >> w >> n;\\n\\tstd::vector<std::vector<Coordinate>> floor(h, std::vector<Coordinate>(w));\\n\\tfor (auto& line : floor) for (auto& coordinate : line) std::cin >> coordinate.y >> coordinate.x;\\n\\tstd::vector<std::vector<std::vector<Coordinate>>> step{ floor };\\n\\tfor (auto i = 1; i < h * w; i <<= 1) {\\n\\t\\tstd::vector<std::vector<Coordinate>> new_floor(h, std::vector<Coordinate>(w));\\n\\t\\tconst auto& back = step.back();\\n\\t\\tfor (auto y = 0; y < h; ++y) for (auto x = 0; x < w; ++x) {\\n\\t\\t\\tauto next = back[y][x];\\n\\t\\t\\tnew_floor[y][x] = back[next.y][next.x];\\n\\t\\t}\\n\\t\\tstep.push_back(new_floor);\\n\\t}\\n\\tstd::vector<Coordinate> dancers(n); for (auto& dancer : dancers) std::cin >> dancer.y >> dancer.x;\\n\\tstd::vector<std::vector<int>> exists(h, std::vector<int>(w, -1));\\n\\tbool has_collision = false;\\n\\tfor (const auto& dancer : dancers) {\\n\\t\\tauto current_pos = step.back()[dancer.y][dancer.x];\\n\\t\\tif (exists[current_pos.y][current_pos.x] != -1) {\\n\\t\\t\\thas_collision = true;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\texists[current_pos.y][current_pos.x] = h * w + 1;\\n\\t\\t}\\n\\t}\\n\\tif (!has_collision) {\\n\\t\\tstd::cout << -1 << '\\\\n';\\n\\t\\treturn 0;\\n\\t}\\n\\tint min = 0;\\n\\tint max = h * w;\\n\\twhile (min < max) {\\n\\t\\tauto mid = (min + max) / 2;\\n\\t\\thas_collision = false;\\n\\t\\tfor (auto dancer : dancers) {\\n\\t\\t\\tfor (auto i = 0; i < step.size(); ++i) {\\n\\t\\t\\t\\tif ((mid & (1 << i)) != 0) {\\n\\t\\t\\t\\t\\tdancer = step[i][dancer.y][dancer.x];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (exists[dancer.y][dancer.x] == mid) {\\n\\t\\t\\t\\thas_collision = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\texists[dancer.y][dancer.x] = mid;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (has_collision) max = mid;\\n\\t\\telse min = mid + 1;\\n\\t}\\n\\tstd::cout << max << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 45392,\n \"score_of_the_acc\": -0.2785,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2812_2863073\",\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 MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct LOC{\\n\\tvoid set(int arg_to_row,int arg_to_col){\\n\\t\\tto_row = arg_to_row;\\n\\t\\tto_col = arg_to_col;\\n\\t}\\n\\tint to_row,to_col;\\n};\\n\\nstruct Info{\\n\\tint row,col;\\n};\\n\\nint H,W,N;\\nint limit = 18;\\nint POW[19],work[501][501];\\nLOC table[19][501][501];\\nInfo first_loc[250005],calc_loc[250005];\\n\\nbool check(int num){\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++)work[row][col] = 0;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tcalc_loc[i] = first_loc[i];\\n\\t}\\n\\n\\tint now_row,now_col;\\n\\n\\tfor(int i = limit; i >= 0; i--){\\n\\t\\tif(num < POW[i])continue;\\n\\t\\tnum -= POW[i];\\n\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tnow_row = calc_loc[k].row;\\n\\t\\t\\tnow_col = calc_loc[k].col;\\n\\t\\t\\tcalc_loc[k].row = table[i][now_row][now_col].to_row;\\n\\t\\t\\tcalc_loc[k].col = table[i][now_row][now_col].to_col;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\twork[calc_loc[i].row][calc_loc[i].col]++;\\n\\t\\tif(work[calc_loc[i].row][calc_loc[i].col] == 2){\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\n\\treturn false;\\n}\\n\\n\\nint main(){\\n\\n\\tfor(int i = 0; i <= limit; i++)POW[i] = pow(2,i);\\n\\n\\tscanf(\\\"%d %d %d\\\",&H,&W,&N);\\n\\n\\tint to_row,to_col;\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tscanf(\\\"%d %d\\\",&to_row,&to_col);\\n\\t\\t\\ttable[0][row][col].set(to_row,to_col);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%d %d\\\",&first_loc[i].row,&first_loc[i].col);\\n\\t}\\n\\n\\tfor(int i = 1; i <= limit; i++){\\n\\t\\tfor(int row = 0; row < H; row++){\\n\\t\\t\\tfor(int col = 0; col < W; col++){\\n\\n\\t\\t\\t\\tto_row = table[i-1][row][col].to_row;\\n\\t\\t\\t\\tto_col = table[i-1][row][col].to_col;\\n\\n\\t\\t\\t\\ttable[i][row][col].to_row = table[i-1][to_row][to_col].to_row;\\n\\t\\t\\t\\ttable[i][row][col].to_col = table[i-1][to_row][to_col].to_col;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint left = 1,right = H*W,m = (left+right)/2;\\n\\tint ans = BIG_NUM;\\n\\n\\twhile(left <= right){\\n\\t\\tif(check(m)){\\n\\t\\t\\tans = m;\\n\\t\\t\\tright = m-1;\\n\\t\\t}else{\\n\\t\\t\\tleft = m+1;\\n\\t\\t}\\n\\t\\tm = (left+right)/2;\\n\\t}\\n\\n\\tif(ans == BIG_NUM){\\n\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t}else{\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 45520,\n \"score_of_the_acc\": -0.304,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2812_2669750\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nint H, W, N;\\nint mk(int r, int c) {\\n\\treturn r*W+c;\\n}\\n\\nbool check(vector<int>places,const vector<vector<int>>&tos, int time) {\\n\\t\\n\\tfor (int i = 0; i < 20; ++i) {\\n\\t\\tif (time&(1 << i)) {\\n\\t\\t\\tfor (auto&pl : places) {\\n\\t\\t\\t\\tpl=tos[pl][i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(places.begin(),places.end());\\n\\tif(unique(places.begin(),places.end())==places.end())return false;\\n\\telse return true;\\n}\\n\\nint main() {\\n\\tcin>>H>>W>>N;\\n\\tvector<vector<int>>tos(H*W,vector<int>(20));\\n\\tfor (int i = 0; i < H; ++i) {\\n\\t\\tfor (int j = 0; j < W; ++j) {\\n\\t\\t\\tint r,c;cin>>r>>c;\\n\\t\\t\\ttos[mk(i,j)][0]=mk(r,c);\\n\\t\\t}\\n\\t}\\n\\tfor (int k = 1; k < 20; ++k) {\\n\\t\\tfor (int i = 0; i < H*W; ++i) {\\n\\t\\t\\ttos[i][k]=tos[tos[i][k-1]][k-1];\\n\\t\\t}\\n\\t}\\n\\tvector<int>starts(N);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint r,c;cin>>r>>c;\\n\\t\\tstarts[i]=mk(r,c);\\n\\t}\\n\\tint amin=0;\\n\\tint amax=H*W+1;\\n\\twhile (amin + 1 != amax) {\\n\\t\\tint amid=(amin+amax)/2;\\n\\t\\tif (check(starts, tos, amid)) {\\n\\t\\t\\tamax=amid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamin=amid;\\n\\t\\t}\\n\\t}\\n\\tif(amax==H*W+1)amax=-1;\\n\\tcout<<amax<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 34060,\n \"score_of_the_acc\": -0.5883,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2812_2330125\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, const pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\n\\nint H, W, N;\\nPII xs[18][500][500];\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n cin >> H >> W >> N;\\n REP(y,H) REP(x,W)\\n\\tcin >> xs[0][y][x];\\n\\n vector<PII> ps(N);\\n REP(i,N) cin >> ps[i];\\n\\n for(int i=1;i<18;++i){\\n\\tREP(y,H) REP(x,W){\\n\\t auto&& par = xs[i-1][y][x];\\n\\t xs[i][y][x] = xs[i-1][par.FF][par.SS];\\n\\t}\\n }\\n\\n bool no = true;\\n set<PII> s;\\n for(auto&& p: ps){\\n\\tPII np = xs[17][p.FF][p.SS];\\n\\tif(s.count(np)){\\n\\t no = false;\\n\\t}\\n\\ts.insert(np);\\n }\\n if(no){\\n\\tcout << -1 << endl;\\n\\treturn 0;\\n }\\n\\n int ans = 0;\\n vector<vector<PII>> db(H, vector<PII>(W));\\n REP(y,H) REP(x,W) db[y][x] = MP(y,x);\\n for(int i=17;i>=0;--i){\\n\\tbool excess = false;\\n\\tset<PII> s;\\n\\tfor(auto&& p: ps){\\n\\t PII np = db[p.FF][p.SS];\\n\\t np = xs[i][np.FF][np.SS];\\n\\t if(s.count(np)){\\n\\t\\texcess = true;\\n\\t\\tbreak;\\n\\t }\\n\\t s.insert(np);\\n\\t}\\n\\tif(!excess){\\n\\t ans |= 1<<i;\\n\\t REP(y,H) REP(x,W){\\n\\t\\tPII p = db[y][x];\\n\\t\\tdb[y][x] = xs[i][p.FF][p.SS];\\n\\t }\\n\\t}\\n }\\n cout << ans+1 << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 51648,\n \"score_of_the_acc\": -0.4181,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2812_2273437\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\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\\n#define INF 2147483600\\n\\nint main(){\\n int h,w,n;\\n cin>>h>>w>>n;\\n vector<int> vec(h*w);\\n rep(i,h)rep(j,w){\\n int a,b;\\n scanf(\\\"%d %d\\\", &a, &b);\\n vec[i*w+j] = a*w+b;\\n }\\n vector<int> p(n);\\n rep(i,n){\\n int a,b;\\n scanf(\\\"%d %d\\\", &a, &b);\\n p[i] = a*w+b;\\n }\\n\\n vector<vector<int>> mat(20, vector<int>(h*w));\\n rep(i,h*w) mat[0][i] = vec[i];\\n repl(i,1,20) rep(j,h*w){\\n mat[i][j] = mat[i-1][mat[i-1][j]];\\n }\\n\\n int l=0, r=2*h*w;\\n while(r-l>1){\\n int m = (l+r)/2;\\n auto exe = [&](int x){\\n vector<bool> vis(h*w,false);\\n vector<int> v(p);\\n int q=0;\\n while(x>0){\\n if(x%2){\\n rep(i,n) v[i] = mat[q][v[i]];\\n }\\n x /= 2;\\n q++;\\n }\\n rep(i,n){\\n if(vis[v[i]]) return true;\\n vis[v[i]]=true;\\n }\\n return false;\\n };\\n\\n if(exe(m)) r = m;\\n else l = m;\\n }\\n\\n if(r==2*h*w) r=-1;\\n cout << r << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 25352,\n \"score_of_the_acc\": -0.0546,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1697,"cells":{"group_id":{"kind":"string","value":"aoj_2817_cpp"},"problem_description":{"kind":"string","value":"B: だんすなうwww - Dance Now! -\n物語\n前回のラボライフ！ダイガクイン！！\nマスターアイドルたちが競う最大の大会「ラボライフ」の前哨戦ともいえるイベント「マスターアイドルワールド」で9位を取ってしまったドサンコスノー。\nキレのあるダンスは「9位の舞」、渾身の決めポーズも「9位の構え」などと冷やかされてしまい、心に深い傷を負ってしまう。\n来たるラボライフ予備予選では絶対に9位をとるわけにはいかない……\n決意を新たにしたドサンコスノーは、自分たちの特技「セルフコントロール」に磨きをかけ、決戦の地へと向かうのだった。\n問題\nN\n組のユニットが競う大会「ラボライフ」が開かれる。\nこの大会では、スマイル・ピュア・クールの3つの部門で別々に勝負が行われ、それぞれの勝負で得た得点の合計が高い順に総合順位が決定される。\nスマイル部門の順位はそれぞれのユニットが持つスマイル値の値が高い順に決定される。\nピュア・クール部門でも同様にピュア値・クール値が高い順に順位が決定される。\n順位に応じた得点設定は全部門で共通しており、ある部門で\ni\n位のユニットは、その部門では\nr_i\n点を得る。\nここで、順位が\ni\n位のユニットと同じ値を持つユニットが複数ある場合、それらは同率\ni\n位とみなし、等しく得点\nr_i\nを得る。\nより詳細には、\nk\nユニットが同率\ni\n位の場合には、\nk\nユニットが等しく得点\nr_i\nを得て、\nr_{i+1}\nから\nr_{i+k-1}\nまでの得点を得るユニットはいない。\nまた、その次に値が大きいユニット (たち) は得点\nr_{i+k}\nを得る。\n具体的な例として、例えばそれぞれスマイル値が1, 3, 2, 3, 2の5つのユニットがあり、順位が高い順に10, 8, 6, 4, 2点が得られる場合を考える。\nこのとき、2番目と4番目のユニットが10点、3番目と5番目のユニットが6点、1番目のユニットが2点を得ることになる。\nラボライフ予備予選に参加するユニット・ドサンコスノーは「ラボライフは遊びじゃない」と考えているため、真っ先に大会にエントリーし、1番目のユニットとなった。\nしかし、大会に参加する\nN\n組すべてのスマイル値・ピュア値・クール値 (以降3値と呼ぶ) の情報を入手したところ、自分たちの総合順位が (同率) 9位であることがわかった。\nドサンコスノーは特技「セルフコントロール」により3値のうちいずれか1つの値を任意の値だけ上昇させることができるが、あまり上げすぎると疲れてしまい本戦に影響するので、できるだけ上昇値を小さくしたい。\nドサンコスノーはとにかく9位を脱したいので、同率8位以上になるようにセルフコントロールによって3値のいずれか1値を上げるとき、上げる必要のある最小の値を求めよ。\n入力形式\n入力は以下の形式で与えられる。\nN\nr_1\n...\nr_N\ns_1\np_1\nc_1\n...\ns_N\np_N\nc_N\n1行目はユニットの数を表す整数\nN\nが1行で与えられる。\n続く2行目は\nN\n個の整数が空白区切りで与えられる。\ni\n(1 \\leq i \\leq N)\n番目の整数は各部門で順位が\ni\n位だったときに貰える得点\nr_i\nを表す。\n続く\nN\n行目のうち、\nj\n行目には3つの整数\ns_j, p_j, c_j\nが与えられる。これらはそれぞれ\nj\n番目のユニットのスマイル値\ns_j\n、ピュア値\np_j\n、クール値\nc_j\nを表す。\nなおドサンコスノーは1番目のユニットであるとする。\n制約\n9 \\leq N \\leq 100\n100 \\geq r_1 > ... > r_N \\geq 1\n1 \\leq s_j, p_j, c_j \\leq 100\n(1 \\leq j \\leq N)\nセルフコントロールする前、ドサンコスノーは9位 (同率9位の場合はあるが、同率8位以上であることはない)\n出力形式\nセルフコントロールによって3値のどれかを\nx\nだけ上げることでドサンコスノーが同率8位以上になるような最小の\nx\nを1行に出力せよ。ただし、セルフコントロールによってどの値をどれだけ上げても順位が上げられない場合は \"Saiko\" と出力せよ。\n入力例1\n9\n9 8 7 6 5 4 3 2 1\n1 1 1\n2 2 2\n3 3 3\n4 4 4\n5 5 5\n6 6 6\n7 7 7\n8 8 8\n9 9 9\n出力例1\n2\n例えばセルフコントロールでスマイル値を2だけ上げると、ドサンコスノーの各部門における順位はそれぞれ同率7位、9位、9位となり、3+1+1 = 5点を得る。一方、2番目のユニットの各部門における順位はそれぞれ9位、8位、8位となり、1+2+2 = 5点を得る。他のユニットは6点以上を獲得するため、この2つのユニットが同率8位となり、条件を満たす。\n入力例2\n9\n9 8 7 6 5 4 3 2 1\n1 1 1\n2 6 9\n6 9 2\n9 2 6\n3 5 8\n5 8 3\n8 3 5\n4 7 4\n7 4 7\n出力例2\nSaiko\nどの値をどれだけ上げてもドサンコスノーは11点までしか得ることができないが、他のユニットは必ず14点以上を得ることができるため、ドサンコスノーは不動の9位である。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2817_10195234","code_snippet":"// AOJ #2817\n// Dance Now! 2025.2.5\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; \n cin >> N;\n \n vector<int> r(N);\n for (int i = 0; i < N; i++) cin >> r[i];\n \n vector<vector<int>> vals(N, vector<int>(3));\n for (int i = 0; i < N; i++){\n for (int d = 0; d < 3; d++) cin >> vals[i][d];\n }\n \n int ans = INT_MAX;\n const int MAX_X = 300;\n \n for (int boostDept = 0; boostDept < 3; boostDept++){\n for (int x = 0; x <= MAX_X; x++){\n vector<int> dsVal(3);\n for (int d = 0; d < 3; d++){\n dsVal[d] = (d == boostDept) ? vals[0][d] + x : vals[0][d];\n }\n\n int dsOverall = 0;\n for (int d = 0; d < 3; d++){\n int countGreater = 0;\n for (int j = 1; j < N; j++){\n if (vals[j][d] > dsVal[d])\n countGreater++;\n }\n int rank = countGreater + 1;\n dsOverall += r[rank - 1];\n }\n \n vector<int> compOverall;\n for (int j = 1; j < N; j++){\n int total = 0;\n for (int d = 0; d < 3; d++){\n int countGreater = 0;\n for (int k = 1; k < N; k++){\n if (k == j) continue;\n if (vals[k][d] > vals[j][d])\n countGreater++;\n }\n if (dsVal[d] > vals[j][d]) countGreater++;\n int rank = countGreater + 1;\n total += r[rank - 1];\n }\n compOverall.push_back(total);\n }\n\n int betterCount = 0;\n for (int score : compOverall){\n if(score > dsOverall) betterCount++;\n }\n int dsRankOverall = betterCount + 1;\n if(dsRankOverall <= 8){\n ans = min(ans, x);\n break;\n }\n }\n }\n if(ans == INT_MAX) cout << \"Saiko\" << endl;\n else cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3480,"score_of_the_acc":-1,"final_rank":10},{"submission_id":"aoj_2817_3697814","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nconst int INF = (int)1e9 + 7;\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nint n;\nvector<int> r;\nvector<vector<int>> spc;\n\nbool check() {\n vector<int> total(n);\n for (int k = 0; k < 3; k++) {\n vector<int> rank(n, 0);\n rep(i, n) rep(j, n) if (spc[k][i] < spc[k][j]) rank[i]++;\n rep(i, n) total[i] += r[rank[i]];\n }\n vector<int> rank(n, 0);\n rep(i, n) rep(j, n) if (total[i] < total[j]) rank[i]++;\n return rank[0] <= 8 - 1;\n}\n\nint main() {\n while (cin >> n) {\n r.resize(n); spc.assign(3, vector<int>(n));\n rep(i, n) cin >> r[i];\n rep(i, n) cin >> spc[0][i] >> spc[1][i] >> spc[2][i];\n int ans = INF;\n rep(k, 3) for (int p = 1; p <= 100; p++) {\n spc[k][0] += p;\n if (check()) ans = min(ans, p);\n spc[k][0] -= p;\n }\n if (ans == INF) cout << \"Saiko\" << endl;\n else cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3168,"score_of_the_acc":-0.1789,"final_rank":5},{"submission_id":"aoj_2817_3697752","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nconst int INF = (int)1e9 + 7;\n\nint n;\nvector<int> r;\nvector<vector<int>> spc;\n\nbool check() {\n vector<int> total(n);\n for (int k = 0; k < 3; k++) {\n vector<int> type_;\n for (int i = 0; i < n; i++) type_.emplace_back(spc[k][i]);\n vector<int> rank(n, 0);\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n if (type_[i] < type_[j]) rank[i]++;\n }\n for (int i = 0; i < n; i++) total[i] += r[rank[i]];\n }\n vector<int> rank(n, 0);\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n if (total[i] < total[j]) rank[i]++;\n }\n return rank[0] <= 8 - 1;\n}\n\nint main() {\n while (cin >> n) {\n r.resize(n); spc.assign(3, vector<int>(n));\n for (int i = 0; i < n; i++) cin >> r[i];\n for (int i = 0; i < n; i++) cin >> spc[0][i] >> spc[1][i] >> spc[2][i];\n int ans = INF;\n for (int k = 0; k < 3; k++) {\n for (int p = 1; p <= 100; p++) {\n spc[k][0] += p;\n if (check()) ans = min(ans, p);\n spc[k][0] -= p;\n }\n }\n if (ans == INF) cout << \"Saiko\" << endl;\n else cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3168,"score_of_the_acc":-0.1789,"final_rank":5},{"submission_id":"aoj_2817_2655375","code_snippet":"#include <bits/stdc++.h>\n#include <sys/time.h>\nusing namespace std;\n\n#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)\n#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)\n#define pb push_back\n#define all(x) (x).begin(), (x).end()\n#define fi first\n#define se second\n#define mt make_tuple\n#define mp make_pair\ntemplate<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }\ntemplate<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\nusing ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;\nusing ld = long double; using vld = vector<ld>; \nusing vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }\n\ninline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; }\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << \"(\" << v.first << \", \" << v.second << \")\"; return o; }\ntemplate<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};\ntemplate<class Ch, class Tr, class Tuple, size_t... Is>\nvoid print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? \"\" : \", \") << get<Is>(t)), 0)...}; }\ntemplate<class Ch, class Tr, class... Args> \nauto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << \"(\"; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << \")\"; }\nostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << \" \"; o << endl; } return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << \"]\"; return o; }\nvector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }\ntemplate <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}\ntemplate <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << \" \";} return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << \" \";} return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << \" \";} return o; }\ntemplate <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};\nvoid vizGraph(vvll& g, int mode = 0, string filename = \"out.png\") { ofstream ofs(\"./out.dot\"); ofs << \"digraph graph_name {\" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << \" \" << i << \" -> \" << g[i][j] << (mode ? \" [arrowhead = none]\" : \"\")<< endl; } ofs << \"}\" << endl; ofs.close(); system(((string)\"dot -T png out.dot >\" + filename).c_str()); }\nsize_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class\nstruct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }\nstruct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;\n#define ldout fixed << setprecision(40) \n\n#define EPS (double)1e-14\n#define INF (ll)1e18\n#define mo (ll)(1e9+7)\n\nll n;\nvll r;\nbool check(vvll s) {\n vll p(n);\n rep(type, 3) {\n vector<P> t(n);\n rep(i, n) t[i] = P(s[type][i], i);\n sort(all(t));\n reverse(all(t));\n ll prev = -1;\n ll rank = 0;\n rep(i, n) {\n if (prev != t[i].fi) {\n rank = i;\n }\n p[t[i].se] += r[rank];\n prev = t[i].fi;\n }\n }\n ll tmp = p[0];\n sort(all(p));\n return tmp >= p[1];\n}\n\nint main(void) {\n cin >> n;\n r.resize(n); cin >> r;\n vvll s(3, vll(n));\n rep(i, n) {\n rep(t, 3)\n cin >> s[t][i];\n }\n check(s);\n\n ll ret = INF;\n vvll org = s;\n rep(t, 3) rep(x, 1000) {\n ll tmp=s[t][0];\n s[t][0]=x+tmp;\n if (check(s)) chmin(ret, x);\n s[t][0]=tmp;\n }\n if(ret!=INF)\n cout<<ret<<endl;\n else\n cout<<\"Saiko\"<<endl;\n\n return 0;\n}","accuracy":0.25,"time_ms":10,"memory_kb":3320,"score_of_the_acc":-0.5789,"final_rank":12},{"submission_id":"aoj_2817_2506378","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define fi first\n#define se second\nusing namespace std;\ntypedef pair<int,int> P;\nint n,score[101],a[101][3];\n \n \nbool ch(){\n \n int t[101]={},x[101];\n r(i,3){\n int cnt=0,pre,c2=0;\n memset(x,0,sizeof(x));\n \n vector<P> v;\n \n r(j,n)v.push_back(P(a[j][i],j));\n \n sort(v.begin(),v.end(), greater<P>() );\n \n r(k,n){\n if(!k){\n t[v[k].se]+=score[cnt];\n pre=v[k].fi;\n }\n else{\n if(pre==v[k].fi){\n c2++;\n t[v[k].se]+=score[cnt];\n }\n else{\n pre=v[k].fi;\n cnt+=c2+1;c2=0;\n t[v[k].se]+=score[cnt];\n }\n }\n }\n \n }\n \n vector<P> v;\n \n r(j,n)v.push_back(P(t[j],j));\n \n sort(v.begin(),v.end(), greater<P>() );\n int cnt=0,c2=0,pre;\n r(i,n){\n if(!i){\n \n if(!v[i].se&&cnt<=7)return 1;\n \n pre=v[i].fi;\n }\n else{\n if(pre==v[i].fi){\n if(!v[i].se&&cnt<=7)return 1;\n pre=v[i].fi;\n c2++;\n }\n else{\n cnt+=c2+1;c2=0;\n if(!v[i].se&&cnt<=7)return 1;\n pre=v[i].fi;\n }\n }\n }\n return 0;\n}\n \n \n \n \nint main(){\n cin>>n;\n r(i,n)cin>>score[i];\n r(i,n)r(j,3)cin>>a[i][j];\n r(i,1000)r(j,3){\n a[0][j]+=i;\n if(ch()){\n cout<<i<<endl;\n return 0;\n }\n a[0][j]-=i;\n }\n cout<<\"Saiko\"<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3100,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2817_2505873","code_snippet":"#include <bits/stdc++.h>\n#define rank asfanf\n#define N 101\nusing namespace std;\ntypedef pair<int,int> P;\nint n,r[N];\n\nmap<int,int> mkRank(vector<int> A){\n map<int,int> rank,tmp;\n for(int a:A) rank[-a]++;\n tmp = rank;\n \n for(auto it=rank.begin(),it2=++rank.begin();it2!=rank.end();it++,it2++)\n it2->second += it->second;\n\n for(P const &p:rank) rank[-p.first] = rank[p.first]-tmp[p.first];\n return rank;\n}\n\nint getScore(map<int,int> rank,int a){return r[rank[a]];}\n\nvector<int> calcTotalScore(vector<int> a,vector<int>b,vector<int>c){\n vector<int> res(n,0);\n map<int,int> A = mkRank(a);\n map<int,int> B = mkRank(b);\n map<int,int> C = mkRank(c);\n for(int i=0;i<n;i++) res[i] = getScore(A,a[i]) + getScore(B,b[i]) + getScore(C,c[i]);\n return res;\n}\n\nint calc(vector<int> a,vector<int>b,vector<int>c){\n int ans = 1e9;\n for(int i=0;i<200;i++){\n a[0] += i;\n vector<int> total = calcTotalScore(a,b,c);\n map<int,int> rank = mkRank(total);\n //cout<<i<<\" \"<<rank[total[0]]<<\" \"<<total[0]<<endl;\n if(rank[total[0]] <= 7) ans = min(ans,i);\n a[0] -= i;\n }\n return ans;\n}\n\nint main(){\n cin>>n;\n for(int i=0;i<n;i++) cin>>r[i];\n vector<int> a(n),b(n),c(n);\n for(int i=0;i<n;i++)cin>>a[i]>>b[i]>>c[i];\n \n int ans = min(calc(a,b,c),min(calc(b,a,c),calc(c,a,b)));\n if(ans == 1e9) cout<<\"Saiko\"<<endl;\n else cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":740,"memory_kb":3204,"score_of_the_acc":-1.2737,"final_rank":11},{"submission_id":"aoj_2817_2334364","code_snippet":"#include<bits/stdc++.h>\n \nusing namespace std;\n \n#define rep(i, n) for(int i = 0; i < n; i++)\n \nint N, R[100];\nint S[100], P[100], C[100];\n \n \nbool ck()\n{\n int pt[101] = {};\n \n vector< pair< int, int > > vs;\n rep(i, N) vs.emplace_back(S[i], i);\n vector< int > rank(N, 0);\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\n rep(i, N) pt[i] += R[rank[i]];\n \n vs.clear();\n rep(i, N) vs.emplace_back(P[i], i);\n rank.assign(N, 0);\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\n rep(i, N) pt[i] += R[rank[i]];\n \n vs.clear();\n rep(i, N) vs.emplace_back(C[i], i);\n rank.assign(N, 0);\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\n rep(i, N) pt[i] += R[rank[i]];\n \n vs.clear();\n rep(i, N) vs.emplace_back(pt[i], i);\n rank.assign(N, 0);\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\n \n return (rank[0] <= 7);\n}\n \nint main()\n{\n cin >> N;\n rep(i, N) cin >> R[i];\n rep(i, N) cin >> S[i] >> P[i] >> C[i];\n \n int ret = 114514;\n rep(i, 101) {\n S[0] += i;\n if(ck()) ret = min(ret, i);\n S[0] -= i;\n }\n rep(i, 101) {\n P[0] += i;\n if(ck()) ret = min(ret, i);\n P[0] -= i;\n }\n \n rep(i, 101) {\n C[0] += i;\n if(ck()) ret = min(ret, i);\n C[0] -= i;\n }\n \n if(ret == 114514) cout << \"Saiko\" << endl;\n else cout << ret << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3100,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2817_2312269","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n \nint n;\n \nbool f(vector<vector<int>> v, vector<int> r){\n map<int,int> mp[3];\n rep(j,3){\n map<int,int> &mpp = mp[j];\n vector<int> tmp;\n rep(i,n){\n tmp.pb(v[i][j]);\n }\n sort(all(tmp));\n \n rep(i,tmp.size()){\n mpp[tmp[i]] = r[i];\n }\n }\n \n vector<pii> s;\n rep(i,n){\n int tmp = 0;\n rep(j,3){\n tmp+=mp[j][v[i][j]];\n }\n s.pb(pii(-tmp,i));\n }\n \n sort(all(s));\n \n int pos=-1;\n rep(i,s.size()){\n if(s[i].second==0){\n pos = i;\n break;\n }\n }\n assert(pos!=-1);\n if(pos<8)return true;\n else return false;\n}\n \nint main(){\n cin>>n;\n vector<int> r(n);\n rep(i,n)cin>>r[i];\n reverse(all(r));\n \n vector< vector<int> > v(n,vector<int>(3));\n rep(i,n)rep(j,3)cin>>v[i][j];\n \n int ans = INF;\n rep(i,101){\n rep(j,3){\n v[0][j]+=i;\n \n if(f(v,r)){\n ans = min(ans,(int)i);\n }\n \n v[0][j]-=i;\n }\n }\n if(ans==INF)cout<<\"Saiko\"<<endl;\n else cout<<ans<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3172,"score_of_the_acc":-0.1895,"final_rank":7},{"submission_id":"aoj_2817_2231283","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n\nint n;\n\nbool f(vector<vector<int>> v, vector<int> r){\n map<int,int> mp[3];\n rep(j,3){\n map<int,int> &mpp = mp[j];\n vector<int> tmp;\n rep(i,n){\n tmp.pb(v[i][j]);\n }\n sort(all(tmp));\n \n rep(i,tmp.size()){\n mpp[tmp[i]] = r[i];\n }\n }\n \n vector<pii> s;\n rep(i,n){\n int tmp = 0;\n rep(j,3){\n tmp+=mp[j][v[i][j]];\n }\n s.pb(pii(-tmp,i));\n }\n \n sort(all(s));\n \n int pos=-1;\n rep(i,s.size()){\n if(s[i].second==0){\n pos = i;\n break;\n }\n }\n assert(pos!=-1);\n if(pos<8)return true;\n else return false;\n}\n\nint main(){\n cin>>n;\n vector<int> r(n);\n rep(i,n)cin>>r[i];\n reverse(all(r));\n \n vector< vector<int> > v(n,vector<int>(3));\n rep(i,n)rep(j,3)cin>>v[i][j];\n \n int ans = INF;\n rep(i,101){\n rep(j,3){\n v[0][j]+=i;\n \n if(f(v,r)){\n ans = min(ans,(int)i);\n }\n \n v[0][j]-=i;\n }\n }\n if(ans==INF)cout<<\"Saiko\"<<endl;\n else cout<<ans<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3180,"score_of_the_acc":-0.2105,"final_rank":8},{"submission_id":"aoj_2817_2230994","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n\nint N, R[100];\nint S[100], P[100], C[100];\n\n\nbool ck()\n{\n int pt[101] = {};\n\n vector< pair< int, int > > vs;\n rep(i, N) vs.emplace_back(S[i], i);\n vector< int > rank(N, 0);\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\n rep(i, N) pt[i] += R[rank[i]];\n\n vs.clear();\n rep(i, N) vs.emplace_back(P[i], i);\n rank.assign(N, 0);\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\n rep(i, N) pt[i] += R[rank[i]];\n\n vs.clear();\n rep(i, N) vs.emplace_back(C[i], i);\n rank.assign(N, 0);\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\n rep(i, N) pt[i] += R[rank[i]];\n\n vs.clear();\n rep(i, N) vs.emplace_back(pt[i], i);\n rank.assign(N, 0);\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\n\n return (rank[0] <= 7);\n}\n\nint main()\n{\n cin >> N;\n rep(i, N) cin >> R[i];\n rep(i, N) cin >> S[i] >> P[i] >> C[i];\n\n int ret = 114514;\n rep(i, 101) {\n S[0] += i;\n if(ck()) ret = min(ret, i);\n S[0] -= i;\n }\n rep(i, 101) {\n P[0] += i;\n if(ck()) ret = min(ret, i);\n P[0] -= i;\n }\n\n rep(i, 101) {\n C[0] += i;\n if(ck()) ret = min(ret, i);\n C[0] -= i;\n }\n\n if(ret == 114514) cout << \"Saiko\" << endl;\n else cout << ret << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3104,"score_of_the_acc":-0.0242,"final_rank":3},{"submission_id":"aoj_2817_2230905","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n\n#include \"bits/stdc++.h\"\n#include <random>\nusing namespace std;\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)\n#define rrep(i,n) for(int i=(n)-1;i>=0;--i)\n#define rrep2(i,a,b) for(int i=(a)-1;i>=b;--i)\n#define range(i,a,b,c) for(int i=a;\\\n c>0?i<b:\\\n i>b;\\\n i+=c)\n#define chmax(a, b) (a = (a) < (b) ? (b) : (a))\n#define chmin(a, b) (a = (a) > (b) ? (b) : (a))\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\n#define all(a) begin(a),end(a)\n#define ifnot(a) if(not (a))\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define int long long\n#ifdef _MSC_VER\nconst bool test = true;\n#else \nconst bool test = false;\n#endif\n\nint dx[] = { 1,0,-1,0 };\nint dy[] = { 0,1,0,-1 };\nconst int INF = 1 << 28;\nconst ll INFL = (ll)1 << 58;\nll mod = (int)1e9 + 7;\nconst double eps = 1e-10;\ntypedef long double Real;\n// return -1, 0, 1\nint sgn(const Real& r) { return (r > eps) - (r < -eps); }\nint sgn(const Real& a, const Real &b) { return sgn(a - b); }\n\n//.....................\nconst int MAX = (int)2e5 + 5;\n\nvector<string> split(const string &str, char sep) {\n\tvector<string> v;\n\tstringstream ss(str);\n\tstring buffer;\n\twhile (getline(ss, buffer, sep)) {\n\t\tv.push_back(buffer);\n\t}\n\treturn v;\n}\n\ntemplate<class InputIterator>\nint sum(InputIterator begin, InputIterator end) {\n\treturn accumulate(begin, end, 0ll);\n}\n\nstring reverse_str(string s) {\n\treverse(all(s));\n\treturn s;\n}\n\n//double dist(double a, double b) {\n//\twhile (ans < 0) ans += 360;\n//\twhile (ans > 360) ans -= 360;\n//\n//\twhile (ans < 0) ans += 360;\n//\twhile (ans > 360) ans -= 360;\n//}\n\nint N;\nint r[MAX];\nvector<int> a[3];\n\nvoid solve() {\n\tcin >> N;\n\trep(i, 3) a[i].resize(N);\n\trep(i, N) cin >> r[i];\n\trep(i, N) {\n\t\trep(j, 3) {\n\t\t\tcin >> a[j][i];\n\t\t}\n\t}\n\n\tint min_cost = INF;\n\trep(i, 3) {\n\t\trep(v, 102) {\n\t\t\tvector<pair<int, int>> score(N);\n\t\t\trep(k, N) score[k].first = 0;\n\t\t\trep(k, N) score[k].second = k;\n\t\t\trep(k, 3) {\n\t\t\t\tvector<pair<int, int>> tmp(N);\n\t\t\t\trep(j, N) {\n\t\t\t\t\ttmp[j].first = a[k][j];\n\t\t\t\t\ttmp[j].second = j;\n\t\t\t\t}\n\t\t\t\tif (i == k) tmp[0].first += v;\n\t\t\t\tmap<int, int> m;\n\t\t\t\tsort(all(tmp), greater<pair<int, int>>());\n\t\t\t\trep(j, N) {\n\t\t\t\t\tif (m.count(tmp[j].first) == 0) m[tmp[j].first] = j;\n\t\t\t\t\tscore[tmp[j].second].first += r[m[tmp[j].first]];\n\t\t\t\t}\n\t\t\t}\n\t\t\tsort(all(score), greater<pair<int, int>>());\n\t\t\tmap<int, int> m;\n\t\t\trep(j, N) {\n\t\t\t\tif (m.count(score[j].first) == 0) m[score[j].first] = j;\n\t\t\t\tif (score[j].second == 0 && m[score[j].first] >= 8) {\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\t\t\t}\n\t\t\tchmin(min_cost, v);\n\n\t\t\t//if (score.back().second != 0\n\t\t\t//\t|| score[N-1].first == score[N-2].first) {\n\t\t\t//\t//rep(k, N) cout << score[k].first << \" \";\n\t\t\t//\t//cout << endl;\n\t\t\t//\t//dump(i);\n\t\t\t//\t//dump(v);\n\t\t\t//\tchmin(min_cost, v);\n\t\t\t//\tbreak;\n\t\t\t//}\n\t\tnext:;\n\t\t}\n\t}\n\tif (min_cost == INF) cout << \"Saiko\" << endl;\n\telse cout << min_cost << endl;\n}\n\nsigned main() {\n\tsrand(time(NULL));\n\tint T = (int)1e15;\n\tsolve();\n\tcout << fixed << setprecision(15);\n\trep(i, T) {\n\t\tchar s[MAX];\n\t\tif (scanf(\"%s\", s) == EOF) break;\n\t\tint n = strlen(s);\n\t\tfor (int i = n - 1; i > -1; i--) {\n\t\t\tungetc(s[i], stdin);\n\t\t}\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3200,"score_of_the_acc":-0.2632,"final_rank":9},{"submission_id":"aoj_2817_2230716","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nsigned main(){\n int n;\n cin>>n;\n int r[n];\n for(int i=0;i<n;i++) cin>>r[i];\n int s[n][3];\n for(int i=0;i<n;i++)\n for(int j=0;j<3;j++)\n cin>>s[i][j];\n int ans=1000;\n for(int j=0;j<3;j++){\n for(int k=1;k<100;k++){\n s[0][j]+=k;\n int sc[n];\n memset(sc,0,sizeof(sc));\n for(int l=0;l<3;l++){\n\tvector<int> v[1001];\n\tfor(int i=0;i<n;i++)\n\t v[s[i][l]].push_back(i);\n\t\n\tint ra=0;\n\tfor(int i=1000;i>0;i--){\n\t if(v[i].empty()) continue;\n\t for(int x=0;x<(int)v[i].size();x++){\n\t sc[v[i][x]]+=r[ra];\n\t }\n\t ra+=v[i].size();\n\t}\n }\n int ra[1001];\n memset(ra,0,sizeof(ra));\n for(int i=0;i<n;i++){\n\tra[sc[i]]++;\n }\n int ran=0;\n for(int i=1000;i>sc[0];i--) ran+=ra[i];\n if(ran<8){\n\tans=min(ans,k);\n }\n s[0][j]-=k;\n }\n }\n if(ans<1000) cout<<ans<<endl;\n else cout<<\"Saiko\"<<endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3112,"score_of_the_acc":-0.0316,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2817_10195234\",\n \"code_snippet\": \"// AOJ #2817\\n// Dance Now! 2025.2.5\\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; \\n cin >> N;\\n \\n vector<int> r(N);\\n for (int i = 0; i < N; i++) cin >> r[i];\\n \\n vector<vector<int>> vals(N, vector<int>(3));\\n for (int i = 0; i < N; i++){\\n for (int d = 0; d < 3; d++) cin >> vals[i][d];\\n }\\n \\n int ans = INT_MAX;\\n const int MAX_X = 300;\\n \\n for (int boostDept = 0; boostDept < 3; boostDept++){\\n for (int x = 0; x <= MAX_X; x++){\\n vector<int> dsVal(3);\\n for (int d = 0; d < 3; d++){\\n dsVal[d] = (d == boostDept) ? vals[0][d] + x : vals[0][d];\\n }\\n\\n int dsOverall = 0;\\n for (int d = 0; d < 3; d++){\\n int countGreater = 0;\\n for (int j = 1; j < N; j++){\\n if (vals[j][d] > dsVal[d])\\n countGreater++;\\n }\\n int rank = countGreater + 1;\\n dsOverall += r[rank - 1];\\n }\\n \\n vector<int> compOverall;\\n for (int j = 1; j < N; j++){\\n int total = 0;\\n for (int d = 0; d < 3; d++){\\n int countGreater = 0;\\n for (int k = 1; k < N; k++){\\n if (k == j) continue;\\n if (vals[k][d] > vals[j][d])\\n countGreater++;\\n }\\n if (dsVal[d] > vals[j][d]) countGreater++;\\n int rank = countGreater + 1;\\n total += r[rank - 1];\\n }\\n compOverall.push_back(total);\\n }\\n\\n int betterCount = 0;\\n for (int score : compOverall){\\n if(score > dsOverall) betterCount++;\\n }\\n int dsRankOverall = betterCount + 1;\\n if(dsRankOverall <= 8){\\n ans = min(ans, x);\\n break;\\n }\\n }\\n }\\n if(ans == INT_MAX) cout << \\\"Saiko\\\" << endl;\\n else cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -1,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2817_3697814\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\nconst int INF = (int)1e9 + 7;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n\\nint n;\\nvector<int> r;\\nvector<vector<int>> spc;\\n\\nbool check() {\\n vector<int> total(n);\\n for (int k = 0; k < 3; k++) {\\n vector<int> rank(n, 0);\\n rep(i, n) rep(j, n) if (spc[k][i] < spc[k][j]) rank[i]++;\\n rep(i, n) total[i] += r[rank[i]];\\n }\\n vector<int> rank(n, 0);\\n rep(i, n) rep(j, n) if (total[i] < total[j]) rank[i]++;\\n return rank[0] <= 8 - 1;\\n}\\n\\nint main() {\\n while (cin >> n) {\\n r.resize(n); spc.assign(3, vector<int>(n));\\n rep(i, n) cin >> r[i];\\n rep(i, n) cin >> spc[0][i] >> spc[1][i] >> spc[2][i];\\n int ans = INF;\\n rep(k, 3) for (int p = 1; p <= 100; p++) {\\n spc[k][0] += p;\\n if (check()) ans = min(ans, p);\\n spc[k][0] -= p;\\n }\\n if (ans == INF) cout << \\\"Saiko\\\" << endl;\\n else cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -0.1789,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2817_3697752\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\nconst int INF = (int)1e9 + 7;\\n\\nint n;\\nvector<int> r;\\nvector<vector<int>> spc;\\n\\nbool check() {\\n vector<int> total(n);\\n for (int k = 0; k < 3; k++) {\\n vector<int> type_;\\n for (int i = 0; i < n; i++) type_.emplace_back(spc[k][i]);\\n vector<int> rank(n, 0);\\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\\n if (type_[i] < type_[j]) rank[i]++;\\n }\\n for (int i = 0; i < n; i++) total[i] += r[rank[i]];\\n }\\n vector<int> rank(n, 0);\\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\\n if (total[i] < total[j]) rank[i]++;\\n }\\n return rank[0] <= 8 - 1;\\n}\\n\\nint main() {\\n while (cin >> n) {\\n r.resize(n); spc.assign(3, vector<int>(n));\\n for (int i = 0; i < n; i++) cin >> r[i];\\n for (int i = 0; i < n; i++) cin >> spc[0][i] >> spc[1][i] >> spc[2][i];\\n int ans = INF;\\n for (int k = 0; k < 3; k++) {\\n for (int p = 1; p <= 100; p++) {\\n spc[k][0] += p;\\n if (check()) ans = min(ans, p);\\n spc[k][0] -= p;\\n }\\n }\\n if (ans == INF) cout << \\\"Saiko\\\" << endl;\\n else cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -0.1789,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2817_2655375\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <sys/time.h>\\nusing namespace std;\\n\\n#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)\\n#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)\\n#define pb push_back\\n#define all(x) (x).begin(), (x).end()\\n#define fi first\\n#define se second\\n#define mt make_tuple\\n#define mp make_pair\\ntemplate<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }\\ntemplate<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\nusing ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;\\nusing ld = long double; using vld = vector<ld>; \\nusing vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }\\n\\ninline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; }\\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << \\\"(\\\" << v.first << \\\", \\\" << v.second << \\\")\\\"; return o; }\\ntemplate<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};\\ntemplate<class Ch, class Tr, class Tuple, size_t... Is>\\nvoid print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? \\\"\\\" : \\\", \\\") << get<Is>(t)), 0)...}; }\\ntemplate<class Ch, class Tr, class... Args> \\nauto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << \\\"(\\\"; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << \\\")\\\"; }\\nostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << \\\" \\\"; o << endl; } return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << \\\"]\\\"; return o; }\\nvector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }\\ntemplate <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}\\ntemplate <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << \\\" \\\";} return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << \\\" \\\";} return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << \\\" \\\";} return o; }\\ntemplate <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};\\nvoid vizGraph(vvll& g, int mode = 0, string filename = \\\"out.png\\\") { ofstream ofs(\\\"./out.dot\\\"); ofs << \\\"digraph graph_name {\\\" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << \\\" \\\" << i << \\\" -> \\\" << g[i][j] << (mode ? \\\" [arrowhead = none]\\\" : \\\"\\\")<< endl; } ofs << \\\"}\\\" << endl; ofs.close(); system(((string)\\\"dot -T png out.dot >\\\" + filename).c_str()); }\\nsize_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class\\nstruct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }\\nstruct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;\\n#define ldout fixed << setprecision(40) \\n\\n#define EPS (double)1e-14\\n#define INF (ll)1e18\\n#define mo (ll)(1e9+7)\\n\\nll n;\\nvll r;\\nbool check(vvll s) {\\n vll p(n);\\n rep(type, 3) {\\n vector<P> t(n);\\n rep(i, n) t[i] = P(s[type][i], i);\\n sort(all(t));\\n reverse(all(t));\\n ll prev = -1;\\n ll rank = 0;\\n rep(i, n) {\\n if (prev != t[i].fi) {\\n rank = i;\\n }\\n p[t[i].se] += r[rank];\\n prev = t[i].fi;\\n }\\n }\\n ll tmp = p[0];\\n sort(all(p));\\n return tmp >= p[1];\\n}\\n\\nint main(void) {\\n cin >> n;\\n r.resize(n); cin >> r;\\n vvll s(3, vll(n));\\n rep(i, n) {\\n rep(t, 3)\\n cin >> s[t][i];\\n }\\n check(s);\\n\\n ll ret = INF;\\n vvll org = s;\\n rep(t, 3) rep(x, 1000) {\\n ll tmp=s[t][0];\\n s[t][0]=x+tmp;\\n if (check(s)) chmin(ret, x);\\n s[t][0]=tmp;\\n }\\n if(ret!=INF)\\n cout<<ret<<endl;\\n else\\n cout<<\\\"Saiko\\\"<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 10,\n \"memory_kb\": 3320,\n \"score_of_the_acc\": -0.5789,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2817_2506378\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\n#define fi first\\n#define se second\\nusing namespace std;\\ntypedef pair<int,int> P;\\nint n,score[101],a[101][3];\\n \\n \\nbool ch(){\\n \\n int t[101]={},x[101];\\n r(i,3){\\n int cnt=0,pre,c2=0;\\n memset(x,0,sizeof(x));\\n \\n vector<P> v;\\n \\n r(j,n)v.push_back(P(a[j][i],j));\\n \\n sort(v.begin(),v.end(), greater<P>() );\\n \\n r(k,n){\\n if(!k){\\n t[v[k].se]+=score[cnt];\\n pre=v[k].fi;\\n }\\n else{\\n if(pre==v[k].fi){\\n c2++;\\n t[v[k].se]+=score[cnt];\\n }\\n else{\\n pre=v[k].fi;\\n cnt+=c2+1;c2=0;\\n t[v[k].se]+=score[cnt];\\n }\\n }\\n }\\n \\n }\\n \\n vector<P> v;\\n \\n r(j,n)v.push_back(P(t[j],j));\\n \\n sort(v.begin(),v.end(), greater<P>() );\\n int cnt=0,c2=0,pre;\\n r(i,n){\\n if(!i){\\n \\n if(!v[i].se&&cnt<=7)return 1;\\n \\n pre=v[i].fi;\\n }\\n else{\\n if(pre==v[i].fi){\\n if(!v[i].se&&cnt<=7)return 1;\\n pre=v[i].fi;\\n c2++;\\n }\\n else{\\n cnt+=c2+1;c2=0;\\n if(!v[i].se&&cnt<=7)return 1;\\n pre=v[i].fi;\\n }\\n }\\n }\\n return 0;\\n}\\n \\n \\n \\n \\nint main(){\\n cin>>n;\\n r(i,n)cin>>score[i];\\n r(i,n)r(j,3)cin>>a[i][j];\\n r(i,1000)r(j,3){\\n a[0][j]+=i;\\n if(ch()){\\n cout<<i<<endl;\\n return 0;\\n }\\n a[0][j]-=i;\\n }\\n cout<<\\\"Saiko\\\"<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2817_2505873\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rank asfanf\\n#define N 101\\nusing namespace std;\\ntypedef pair<int,int> P;\\nint n,r[N];\\n\\nmap<int,int> mkRank(vector<int> A){\\n map<int,int> rank,tmp;\\n for(int a:A) rank[-a]++;\\n tmp = rank;\\n \\n for(auto it=rank.begin(),it2=++rank.begin();it2!=rank.end();it++,it2++)\\n it2->second += it->second;\\n\\n for(P const &p:rank) rank[-p.first] = rank[p.first]-tmp[p.first];\\n return rank;\\n}\\n\\nint getScore(map<int,int> rank,int a){return r[rank[a]];}\\n\\nvector<int> calcTotalScore(vector<int> a,vector<int>b,vector<int>c){\\n vector<int> res(n,0);\\n map<int,int> A = mkRank(a);\\n map<int,int> B = mkRank(b);\\n map<int,int> C = mkRank(c);\\n for(int i=0;i<n;i++) res[i] = getScore(A,a[i]) + getScore(B,b[i]) + getScore(C,c[i]);\\n return res;\\n}\\n\\nint calc(vector<int> a,vector<int>b,vector<int>c){\\n int ans = 1e9;\\n for(int i=0;i<200;i++){\\n a[0] += i;\\n vector<int> total = calcTotalScore(a,b,c);\\n map<int,int> rank = mkRank(total);\\n //cout<<i<<\\\" \\\"<<rank[total[0]]<<\\\" \\\"<<total[0]<<endl;\\n if(rank[total[0]] <= 7) ans = min(ans,i);\\n a[0] -= i;\\n }\\n return ans;\\n}\\n\\nint main(){\\n cin>>n;\\n for(int i=0;i<n;i++) cin>>r[i];\\n vector<int> a(n),b(n),c(n);\\n for(int i=0;i<n;i++)cin>>a[i]>>b[i]>>c[i];\\n \\n int ans = min(calc(a,b,c),min(calc(b,a,c),calc(c,a,b)));\\n if(ans == 1e9) cout<<\\\"Saiko\\\"<<endl;\\n else cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 740,\n \"memory_kb\": 3204,\n \"score_of_the_acc\": -1.2737,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2817_2334364\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define rep(i, n) for(int i = 0; i < n; i++)\\n \\nint N, R[100];\\nint S[100], P[100], C[100];\\n \\n \\nbool ck()\\n{\\n int pt[101] = {};\\n \\n vector< pair< int, int > > vs;\\n rep(i, N) vs.emplace_back(S[i], i);\\n vector< int > rank(N, 0);\\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\\n rep(i, N) pt[i] += R[rank[i]];\\n \\n vs.clear();\\n rep(i, N) vs.emplace_back(P[i], i);\\n rank.assign(N, 0);\\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\\n rep(i, N) pt[i] += R[rank[i]];\\n \\n vs.clear();\\n rep(i, N) vs.emplace_back(C[i], i);\\n rank.assign(N, 0);\\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\\n rep(i, N) pt[i] += R[rank[i]];\\n \\n vs.clear();\\n rep(i, N) vs.emplace_back(pt[i], i);\\n rank.assign(N, 0);\\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\\n \\n return (rank[0] <= 7);\\n}\\n \\nint main()\\n{\\n cin >> N;\\n rep(i, N) cin >> R[i];\\n rep(i, N) cin >> S[i] >> P[i] >> C[i];\\n \\n int ret = 114514;\\n rep(i, 101) {\\n S[0] += i;\\n if(ck()) ret = min(ret, i);\\n S[0] -= i;\\n }\\n rep(i, 101) {\\n P[0] += i;\\n if(ck()) ret = min(ret, i);\\n P[0] -= i;\\n }\\n \\n rep(i, 101) {\\n C[0] += i;\\n if(ck()) ret = min(ret, i);\\n C[0] -= i;\\n }\\n \\n if(ret == 114514) cout << \\\"Saiko\\\" << endl;\\n else cout << ret << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2817_2312269\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n#define INF (1e9+1)\\n//#define INF (1LL<<59)\\n \\nint n;\\n \\nbool f(vector<vector<int>> v, vector<int> r){\\n map<int,int> mp[3];\\n rep(j,3){\\n map<int,int> &mpp = mp[j];\\n vector<int> tmp;\\n rep(i,n){\\n tmp.pb(v[i][j]);\\n }\\n sort(all(tmp));\\n \\n rep(i,tmp.size()){\\n mpp[tmp[i]] = r[i];\\n }\\n }\\n \\n vector<pii> s;\\n rep(i,n){\\n int tmp = 0;\\n rep(j,3){\\n tmp+=mp[j][v[i][j]];\\n }\\n s.pb(pii(-tmp,i));\\n }\\n \\n sort(all(s));\\n \\n int pos=-1;\\n rep(i,s.size()){\\n if(s[i].second==0){\\n pos = i;\\n break;\\n }\\n }\\n assert(pos!=-1);\\n if(pos<8)return true;\\n else return false;\\n}\\n \\nint main(){\\n cin>>n;\\n vector<int> r(n);\\n rep(i,n)cin>>r[i];\\n reverse(all(r));\\n \\n vector< vector<int> > v(n,vector<int>(3));\\n rep(i,n)rep(j,3)cin>>v[i][j];\\n \\n int ans = INF;\\n rep(i,101){\\n rep(j,3){\\n v[0][j]+=i;\\n \\n if(f(v,r)){\\n ans = min(ans,(int)i);\\n }\\n \\n v[0][j]-=i;\\n }\\n }\\n if(ans==INF)cout<<\\\"Saiko\\\"<<endl;\\n else cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.1895,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2817_2231283\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n#define INF (1e9+1)\\n//#define INF (1LL<<59)\\n\\nint n;\\n\\nbool f(vector<vector<int>> v, vector<int> r){\\n map<int,int> mp[3];\\n rep(j,3){\\n map<int,int> &mpp = mp[j];\\n vector<int> tmp;\\n rep(i,n){\\n tmp.pb(v[i][j]);\\n }\\n sort(all(tmp));\\n \\n rep(i,tmp.size()){\\n mpp[tmp[i]] = r[i];\\n }\\n }\\n \\n vector<pii> s;\\n rep(i,n){\\n int tmp = 0;\\n rep(j,3){\\n tmp+=mp[j][v[i][j]];\\n }\\n s.pb(pii(-tmp,i));\\n }\\n \\n sort(all(s));\\n \\n int pos=-1;\\n rep(i,s.size()){\\n if(s[i].second==0){\\n pos = i;\\n break;\\n }\\n }\\n assert(pos!=-1);\\n if(pos<8)return true;\\n else return false;\\n}\\n\\nint main(){\\n cin>>n;\\n vector<int> r(n);\\n rep(i,n)cin>>r[i];\\n reverse(all(r));\\n \\n vector< vector<int> > v(n,vector<int>(3));\\n rep(i,n)rep(j,3)cin>>v[i][j];\\n \\n int ans = INF;\\n rep(i,101){\\n rep(j,3){\\n v[0][j]+=i;\\n \\n if(f(v,r)){\\n ans = min(ans,(int)i);\\n }\\n \\n v[0][j]-=i;\\n }\\n }\\n if(ans==INF)cout<<\\\"Saiko\\\"<<endl;\\n else cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.2105,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2817_2230994\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n\\nint N, R[100];\\nint S[100], P[100], C[100];\\n\\n\\nbool ck()\\n{\\n int pt[101] = {};\\n\\n vector< pair< int, int > > vs;\\n rep(i, N) vs.emplace_back(S[i], i);\\n vector< int > rank(N, 0);\\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\\n rep(i, N) pt[i] += R[rank[i]];\\n\\n vs.clear();\\n rep(i, N) vs.emplace_back(P[i], i);\\n rank.assign(N, 0);\\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\\n rep(i, N) pt[i] += R[rank[i]];\\n\\n vs.clear();\\n rep(i, N) vs.emplace_back(C[i], i);\\n rank.assign(N, 0);\\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\\n rep(i, N) pt[i] += R[rank[i]];\\n\\n vs.clear();\\n rep(i, N) vs.emplace_back(pt[i], i);\\n rank.assign(N, 0);\\n rep(i, N) rep(j, N) if(vs[i].first < vs[j].first) ++rank[vs[i].second];\\n\\n return (rank[0] <= 7);\\n}\\n\\nint main()\\n{\\n cin >> N;\\n rep(i, N) cin >> R[i];\\n rep(i, N) cin >> S[i] >> P[i] >> C[i];\\n\\n int ret = 114514;\\n rep(i, 101) {\\n S[0] += i;\\n if(ck()) ret = min(ret, i);\\n S[0] -= i;\\n }\\n rep(i, 101) {\\n P[0] += i;\\n if(ck()) ret = min(ret, i);\\n P[0] -= i;\\n }\\n\\n rep(i, 101) {\\n C[0] += i;\\n if(ck()) ret = min(ret, i);\\n C[0] -= i;\\n }\\n\\n if(ret == 114514) cout << \\\"Saiko\\\" << endl;\\n else cout << ret << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.0242,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2817_2230905\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#define _USE_MATH_DEFINES\\n\\n#include \\\"bits/stdc++.h\\\"\\n#include <random>\\nusing namespace std;\\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)\\n#define rrep(i,n) for(int i=(n)-1;i>=0;--i)\\n#define rrep2(i,a,b) for(int i=(a)-1;i>=b;--i)\\n#define range(i,a,b,c) for(int i=a;\\\\\\n c>0?i<b:\\\\\\n i>b;\\\\\\n i+=c)\\n#define chmax(a, b) (a = (a) < (b) ? (b) : (a))\\n#define chmin(a, b) (a = (a) > (b) ? (b) : (a))\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\n#define all(a) begin(a),end(a)\\n#define ifnot(a) if(not (a))\\n#define dump(x) cerr << #x << \\\" = \\\" << (x) << endl\\n#define int long long\\n#ifdef _MSC_VER\\nconst bool test = true;\\n#else \\nconst bool test = false;\\n#endif\\n\\nint dx[] = { 1,0,-1,0 };\\nint dy[] = { 0,1,0,-1 };\\nconst int INF = 1 << 28;\\nconst ll INFL = (ll)1 << 58;\\nll mod = (int)1e9 + 7;\\nconst double eps = 1e-10;\\ntypedef long double Real;\\n// return -1, 0, 1\\nint sgn(const Real& r) { return (r > eps) - (r < -eps); }\\nint sgn(const Real& a, const Real &b) { return sgn(a - b); }\\n\\n//.....................\\nconst int MAX = (int)2e5 + 5;\\n\\nvector<string> split(const string &str, char sep) {\\n\\tvector<string> v;\\n\\tstringstream ss(str);\\n\\tstring buffer;\\n\\twhile (getline(ss, buffer, sep)) {\\n\\t\\tv.push_back(buffer);\\n\\t}\\n\\treturn v;\\n}\\n\\ntemplate<class InputIterator>\\nint sum(InputIterator begin, InputIterator end) {\\n\\treturn accumulate(begin, end, 0ll);\\n}\\n\\nstring reverse_str(string s) {\\n\\treverse(all(s));\\n\\treturn s;\\n}\\n\\n//double dist(double a, double b) {\\n//\\twhile (ans < 0) ans += 360;\\n//\\twhile (ans > 360) ans -= 360;\\n//\\n//\\twhile (ans < 0) ans += 360;\\n//\\twhile (ans > 360) ans -= 360;\\n//}\\n\\nint N;\\nint r[MAX];\\nvector<int> a[3];\\n\\nvoid solve() {\\n\\tcin >> N;\\n\\trep(i, 3) a[i].resize(N);\\n\\trep(i, N) cin >> r[i];\\n\\trep(i, N) {\\n\\t\\trep(j, 3) {\\n\\t\\t\\tcin >> a[j][i];\\n\\t\\t}\\n\\t}\\n\\n\\tint min_cost = INF;\\n\\trep(i, 3) {\\n\\t\\trep(v, 102) {\\n\\t\\t\\tvector<pair<int, int>> score(N);\\n\\t\\t\\trep(k, N) score[k].first = 0;\\n\\t\\t\\trep(k, N) score[k].second = k;\\n\\t\\t\\trep(k, 3) {\\n\\t\\t\\t\\tvector<pair<int, int>> tmp(N);\\n\\t\\t\\t\\trep(j, N) {\\n\\t\\t\\t\\t\\ttmp[j].first = a[k][j];\\n\\t\\t\\t\\t\\ttmp[j].second = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (i == k) tmp[0].first += v;\\n\\t\\t\\t\\tmap<int, int> m;\\n\\t\\t\\t\\tsort(all(tmp), greater<pair<int, int>>());\\n\\t\\t\\t\\trep(j, N) {\\n\\t\\t\\t\\t\\tif (m.count(tmp[j].first) == 0) m[tmp[j].first] = j;\\n\\t\\t\\t\\t\\tscore[tmp[j].second].first += r[m[tmp[j].first]];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsort(all(score), greater<pair<int, int>>());\\n\\t\\t\\tmap<int, int> m;\\n\\t\\t\\trep(j, N) {\\n\\t\\t\\t\\tif (m.count(score[j].first) == 0) m[score[j].first] = j;\\n\\t\\t\\t\\tif (score[j].second == 0 && m[score[j].first] >= 8) {\\n\\t\\t\\t\\t\\tgoto next;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tchmin(min_cost, v);\\n\\n\\t\\t\\t//if (score.back().second != 0\\n\\t\\t\\t//\\t|| score[N-1].first == score[N-2].first) {\\n\\t\\t\\t//\\t//rep(k, N) cout << score[k].first << \\\" \\\";\\n\\t\\t\\t//\\t//cout << endl;\\n\\t\\t\\t//\\t//dump(i);\\n\\t\\t\\t//\\t//dump(v);\\n\\t\\t\\t//\\tchmin(min_cost, v);\\n\\t\\t\\t//\\tbreak;\\n\\t\\t\\t//}\\n\\t\\tnext:;\\n\\t\\t}\\n\\t}\\n\\tif (min_cost == INF) cout << \\\"Saiko\\\" << endl;\\n\\telse cout << min_cost << endl;\\n}\\n\\nsigned main() {\\n\\tsrand(time(NULL));\\n\\tint T = (int)1e15;\\n\\tsolve();\\n\\tcout << fixed << setprecision(15);\\n\\trep(i, T) {\\n\\t\\tchar s[MAX];\\n\\t\\tif (scanf(\\\"%s\\\", s) == EOF) break;\\n\\t\\tint n = strlen(s);\\n\\t\\tfor (int i = n - 1; i > -1; i--) {\\n\\t\\t\\tungetc(s[i], stdin);\\n\\t\\t}\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.2632,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2817_2230716\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nsigned main(){\\n int n;\\n cin>>n;\\n int r[n];\\n for(int i=0;i<n;i++) cin>>r[i];\\n int s[n][3];\\n for(int i=0;i<n;i++)\\n for(int j=0;j<3;j++)\\n cin>>s[i][j];\\n int ans=1000;\\n for(int j=0;j<3;j++){\\n for(int k=1;k<100;k++){\\n s[0][j]+=k;\\n int sc[n];\\n memset(sc,0,sizeof(sc));\\n for(int l=0;l<3;l++){\\n\\tvector<int> v[1001];\\n\\tfor(int i=0;i<n;i++)\\n\\t v[s[i][l]].push_back(i);\\n\\t\\n\\tint ra=0;\\n\\tfor(int i=1000;i>0;i--){\\n\\t if(v[i].empty()) continue;\\n\\t for(int x=0;x<(int)v[i].size();x++){\\n\\t sc[v[i][x]]+=r[ra];\\n\\t }\\n\\t ra+=v[i].size();\\n\\t}\\n }\\n int ra[1001];\\n memset(ra,0,sizeof(ra));\\n for(int i=0;i<n;i++){\\n\\tra[sc[i]]++;\\n }\\n int ran=0;\\n for(int i=1000;i>sc[0];i--) ran+=ra[i];\\n if(ran<8){\\n\\tans=min(ans,k);\\n }\\n s[0][j]-=k;\\n }\\n }\\n if(ans<1000) cout<<ans<<endl;\\n else cout<<\\\"Saiko\\\"<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3112,\n \"score_of_the_acc\": -0.0316,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1698,"cells":{"group_id":{"kind":"string","value":"aoj_2814_cpp"},"problem_description":{"kind":"string","value":"J: エナジードリンク\n問題\nixmel、Pulmn 兄弟は $N$ 種類のエナジードリンクをそれぞれ 1 本ずつ持っています。\n現在、ixmel と Pulmn のエネルギーはともに 0 で、時刻は午前 0 時です。\nixmel と Pulmn はエネルギーが 0 以下のまま正午になると「たいへんなこと」になります。\nエネルギーが正の数では「たいへんなこと」にはなりません。\nixmel とPulmn は「たいへんなこと」にならないために、\n毎日朝 6 時に 1 本のエナジードリンクを 2 人で分けて飲むことにしました。\ni 番目のエナジードリンクを ixmel が飲むとエネルギーが $a_i$ 増えますが、副作用として 24 時間後にエネルギーが $b_i$ 減ってしまいます。\n一方、Pulmn が飲むとエネルギーが $b_i$ 増え、24 時間後にエネルギーが $a_i$ 減ります。\nまた、ixmel と Pulmn は日が変わった直後、エネルギーは 0 になります。\nixmel と Pulmn は今持っているエナジードリンクだけで、どちらか一方、または両方が「たいへんなこと」になるまでの日数を少しでも長くしたいと思いました。\nixmel、Pulmn 兄弟のために最初にどちらか片方、または両方が「たいへんなこと」になるまでの日数の最大値を求めてください。なお、エナジードリンクを飲む時間は無視できるものとし、「たいへんなこと」が起こる日は求める日数に含まないものとします。\n入力\n入力は $1+n$ 行からなります。\n1 行目には 1 個の整数 $N$ が与えられます。\n続く $N$ 行の内、$i$ 行目は 2 個の整数 $a_i, b_i$ が与えられます。\n制約\n$1 \\le N \\le 10^5$\n$1 \\le a_i, b_i \\le 10^9$\n出力\n考えられる「たいへんなこと」になるまでの日数の最大値を出力しましょう。\nまた、末尾に改行を出力しましょう。\nサンプル\nサンプル入力 1\n5\n3 5\n7 4\n11 9\n3 7\n7 8\nサンプル出力 1\n4\n1 日目から 5 日目に飲むドリンクは、それぞれ 1, 2, 5, 3, 4 とするのが最適です。\n各日のエナジードリンクを飲んだあとの (ixmel の体力, Pulmn の体力) は、それぞれ $(3, 5), (2, 1), (1, 3), (3, 2), (-6, -4)$ と変化し、\n5 日目に「たいへんなこと」になるので答えは 4 です。\nサンプル入力 2\n2\n1 1\n1 1\nサンプル出力 2\n1\n異なる種類で成分が同じエナジードリンクもあります。また、「たいへんなこと」が起こるのは、エネルギーの量が 0 以下の時であることに注意してください。\nサンプル入力 2\n3\n5 9\n3 2\n7 4\nサンプル出力 2\n3\n4 日目に飲むエナジードリンクはありません。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2814_9118078","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\n\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\"\n\n#line 4 \"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\"\n\nnamespace noya2{\n\ntemplate<typename T> struct compress {\n vector<T> raws;\n compress(const vector<T> &raws_ = {}) : raws(raws_){ build(); }\n int id(const T &raw){ return lb(raw); }\n T raw(const int &id){ return raws[id]; }\n void build(){ uniq(raws); }\n void add(const T &raw){ raws.push_back(raw); }\n size_t size(){ return raws.size(); }\n int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }\n int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }\n bool contains(const T &raw){\n int jd = lb(raw);\n if (jd < (int)size()) return raws[jd] == raw;\n return false;\n }\n int contains_id(const T &raw){\n int jd = lb(raw);\n if (jd < (int)size() && raws[jd] == raw) return jd;\n return -1;\n }\n};\n\n} // namespace noya2\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp\"\n\nnamespace noya2{\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = 0;\n size = 1;\n while (size < _n) size <<= 1, log++;\n\n d = std::vector<S>(2 * size, e());\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 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 return d[p + size];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n S sml = e(), smr = e();\n l += size;\n r += size;\n\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 return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) {\n assert(0 <= l && l <= _n);\n assert(f(e()));\n if (l == _n) return _n;\n l += size;\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, d[l]))) {\n while (l < size) {\n l = (2 * l);\n if (f(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 (*f)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) {\n assert(0 <= r && r <= _n);\n assert(f(e()));\n if (r == 0) return 0;\n r += size;\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(d[r], sm))) {\n while (r < size) {\n r = (2 * r + 1);\n if (f(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\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n};\n\n} // namespace noya2\n#line 7 \"c.cpp\"\n\n\nnamespace noya2 {\n\ntemplate<class S, S(*op)(S, S), S(*e)(), typename Idx = ll>\nstruct range_tree {\n using DS = segtree<S,op,e>;\n using T = int;\n void join(Idx x, Idx y){ ps.emplace_back(x,y); }\n void build(){\n for (auto &[x, y] : ps) xs.add(x);\n xs.build();\n //siz = bit_ceil(xs.size());\n siz = 1; while (siz < (int)(xs.size())) siz <<= 1;\n ys.resize(siz*2);\n for (auto &[x, y] : ps){\n int xid = xs.id(x) + siz;\n ys[xid].add(y);\n while (xid > 1){\n xid >>= 1;\n ys[xid].add(y);\n }\n }\n for (int i = 0; i < 2*siz; i++){\n ys[i].build();\n ds.emplace_back(ys[i].size());\n }\n }\n void set(Idx p, Idx q, T val){\n int i = xs.id(p) + siz;\n ds[i].set(ys[i].id(q),val);\n while (i > 1){\n i >>= 1;\n T lr = e();\n int i0 = ys[2*i+0].contains_id(q), i1 = ys[2*i+1].contains_id(q);\n if (i0 != -1) lr = op(lr, ds[2*i+0].get(i0));\n if (i1 != -1) lr = op(lr, ds[2*i+1].get(i1));\n ds[i].set(ys[i].id(q),lr);\n }\n }\n T get(Idx p, Idx q){\n int ip = xs.contains_id(p);\n if (ip == -1) return e();\n int i = ip + siz;\n int iq = ys[i].contains_id(q);\n if (iq == -1) return e();\n return ds[i].get(iq);\n }\n T prod(Idx lp, Idx rp, Idx lq, Idx rq){\n T res = e();\n int li = xs.lb(lp), ri = xs.lb(rp);\n for (li += siz, ri += siz; li < ri; li >>= 1, ri >>= 1){\n if (li & 1) res = op(res,ds[li].prod(ys[li].lb(lq),ys[li].lb(rq))), ++li;\n if (ri & 1) --ri, res = op(res,ds[ri].prod(ys[ri].lb(lq),ys[ri].lb(rq)));\n }\n return res;\n }\n int siz;\n vector<pair<Idx,Idx>> ps;\n compress<Idx> xs;\n vector<compress<Idx>> ys;\n vector<DS> ds;\n};\n\n} // namespace noya2\n\nint op(int a, int b){\n return max(a,b);\n}\nint e(){\n return -iinf;\n}\n\nvoid solve(){\n int n; in(n);\n vector<int> a(n), b(n);\n rep(i,n) in(a[i],b[i]);\n vector<int> ids(n); iota(all(ids),0);\n sort(all(ids),[&](int l, int r){\n return a[l]+b[l] < a[r]+b[r];\n });\n range_tree<int,op,e,int> rt;\n rep(i,n){\n rep(tt,2){\n rt.join(a[i],b[i]);\n swap(a[i],b[i]);\n }\n }\n rt.build();\n int ans = 1;\n for (int i : ids){\n // out(i,a[i],b[i]);\n rep(tt,2){\n int d = max(rt.prod(0,a[i],0,b[i]),0);\n rt.set(a[i],b[i],d+1);\n swap(a[i],b[i]);\n chmax(ans,d+1);\n }\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":0.1891891891891892,"time_ms":500,"memory_kb":61368,"score_of_the_acc":-0.6966,"final_rank":14},{"submission_id":"aoj_2814_9118016","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\n\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\"\n\n#line 4 \"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\"\n\nnamespace noya2{\n\ntemplate<typename T> struct compress {\n vector<T> raws;\n compress(const vector<T> &raws_ = {}) : raws(raws_){ build(); }\n int id(const T &raw){ return lb(raw); }\n T raw(const int &id){ return raws[id]; }\n void build(){ uniq(raws); }\n void add(const T &raw){ raws.push_back(raw); }\n size_t size(){ return raws.size(); }\n int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }\n int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }\n bool contains(const T &raw){\n int jd = lb(raw);\n if (jd < (int)size()) return raws[jd] == raw;\n return false;\n }\n int contains_id(const T &raw){\n int jd = lb(raw);\n if (jd < (int)size() && raws[jd] == raw) return jd;\n return -1;\n }\n};\n\n} // namespace noya2\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp\"\n\nnamespace noya2{\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = 0;\n size = 1;\n while (size < _n) size <<= 1, log++;\n\n d = std::vector<S>(2 * size, e());\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 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 return d[p + size];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n S sml = e(), smr = e();\n l += size;\n r += size;\n\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 return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) {\n assert(0 <= l && l <= _n);\n assert(f(e()));\n if (l == _n) return _n;\n l += size;\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, d[l]))) {\n while (l < size) {\n l = (2 * l);\n if (f(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 (*f)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) {\n assert(0 <= r && r <= _n);\n assert(f(e()));\n if (r == 0) return 0;\n r += size;\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(d[r], sm))) {\n while (r < size) {\n r = (2 * r + 1);\n if (f(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\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n};\n\n} // namespace noya2\n#line 7 \"c.cpp\"\n\n\nnamespace noya2 {\n\ntemplate<class S, S(*op)(S, S), S(*e)(), typename Idx = ll>\nstruct range_tree {\n using DS = segtree<S,op,e>;\n using T = int;\n void join(Idx x, Idx y){ ps.emplace_back(x,y); }\n void build(){\n for (auto &[x, y] : ps) xs.add(x);\n xs.build();\n //siz = bit_ceil(xs.size());\n siz = 1; while (siz < (int)(xs.size())) siz <<= 1;\n ys.resize(siz*2);\n for (auto &[x, y] : ps){\n int xid = xs.id(x) + siz;\n ys[xid].add(y);\n while (xid > 1){\n xid >>= 1;\n ys[xid].add(y);\n }\n }\n for (int i = 0; i < 2*siz; i++){\n ys[i].build();\n ds.emplace_back(ys[i].size());\n }\n }\n void set(Idx p, Idx q, T val){\n int i = xs.id(p) + siz;\n ds[i].set(ys[i].id(q),val);\n while (i > 1){\n i >>= 1;\n T lr = e();\n int i0 = ys[2*i+0].contains_id(q), i1 = ys[2*i+1].contains_id(q);\n if (i0 != -1) lr = op(lr, ds[2*i+0].get(i0));\n if (i1 != -1) lr = op(lr, ds[2*i+1].get(i1));\n ds[i].set(ys[i].id(q),lr);\n }\n }\n T get(Idx p, Idx q){\n int ip = xs.contains_id(p);\n if (ip == -1) return e();\n int i = ip + siz;\n int iq = ys[i].contains_id(q);\n if (iq == -1) return e();\n return ds[i].get(iq);\n }\n T prod(Idx lp, Idx rp, Idx lq, Idx rq){\n T res = e();\n int li = xs.lb(lp), ri = xs.lb(rp);\n for (li += siz, ri += siz; li < ri; li >>= 1, ri >>= 1){\n if (li & 1) res = op(res,ds[li].prod(ys[li].lb(lq),ys[li].lb(rq))), ++li;\n if (ri & 1) --ri, res = op(res,ds[ri].prod(ys[ri].lb(lq),ys[ri].lb(rq)));\n }\n return res;\n }\n int siz;\n vector<pair<Idx,Idx>> ps;\n compress<Idx> xs;\n vector<compress<Idx>> ys;\n vector<DS> ds;\n};\n\n} // namespace noya2\n\nint op(int a, int b){\n return max(a,b);\n}\nint e(){\n return -iinf;\n}\n\nvoid solve(){\n int n; in(n);\n vector<int> a(n), b(n);\n rep(i,n) in(a[i],b[i]);\n vector<int> ids(n); iota(all(ids),0);\n sort(all(ids),[&](int l, int r){\n return a[l]+b[l] < a[r]+b[r];\n });\n range_tree<int,op,e,int> rt0, rt1;\n rep(i,n){\n rep(tt,2){\n rt0.join(a[i],b[i]);\n rt1.join(a[i],b[i]);\n swap(a[i],b[i]);\n }\n }\n rt0.build();\n rt1.build();\n int ans = 1;\n for (int i : ids){\n // out(i,a[i],b[i]);\n rep(tt,2){\n int d0 = max(rt0.prod(0,a[i],0,b[i]),0);\n int d1 = max(rt1.prod(0,a[i],0,b[i]),0);\n rt1.set(a[i],b[i],d0+1);\n rt0.set(a[i],b[i],d1+1);\n swap(a[i],b[i]);\n chmax(ans,d0+1);\n chmax(ans,d1+1);\n }\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":0.1891891891891892,"time_ms":1080,"memory_kb":120544,"score_of_the_acc":-1.5206,"final_rank":18},{"submission_id":"aoj_2814_9118001","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i, n) for(ll i = 0;i < n;i++)\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\n#define ll long long\n#define INF (ll)1ll << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(),n.end()\n#define MOD (ll)1000000007\n#define P pair<ll, ll>\n\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\nusing V = ll;\nV comp(V& l, V& r) { return max(l, r); };\nstruct SegTree { //[l,r)\n int NV;\n vector<V> val;\n void init(int n) {\n NV = 1;\n while (NV < n) NV *= 2;\n val = vector<V>(NV * 2, 0);\n }\n V get(int x, int y, int l, int r, int k) {\n if (r <= x || y <= l) return 0;\n if (x <= l && r <= y) return val[k];\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\n }\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\n void add(int i, V v) { update(i, val[i + NV] + v); }\n V operator[](int x) { return get(x, x + 1); }\n};\n \nstruct Healthy2DSegTree {\n int NV;\n vector<SegTree> st;\n vector<vector<int>> index;\n \n void init(vector<vector<int>> &v) {\n int n = v.size();\n NV = 1; while (NV < n) NV *= 2;\n index.resize(2 * NV);\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\n rrep(i, NV * 2 - 1, 1) {\n sort(index[i].begin(), index[i].end());\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\n fore(j, index[i]) index[i / 2].push_back(j);\n }\n st.resize(2 * NV);\n rep(i, 1, NV * 2) st[i].init(index[i].size());\n }\n void update(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].update(yy, v);\n x >>= 1;\n }\n }\n void add(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].add(yy, v);\n x >>= 1;\n }\n }\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\n assert(k < NV * 2);\n assert(l < r);\n if (r <= sx or tx <= l) return 0;\n if (sx <= l and r <= tx) {\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\n return st[k].get(syy, tyy);\n }\n int md = (l + r) / 2;\n V le = get(sx, tx, sy, ty, k * 2, l, md);\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\n return comp(le, ri);\n }\n V get(int sx, int tx, int sy, int ty) {\n return get(sx, tx, sy, ty, 1, 0, NV);\n }\n};\n\nmap<ll, ll> fr, to;\nHealthy2DSegTree st;\nvector<P> s, v;\nll n, ans;\nint main(){\n cin >> n;\n vector<vector<int>> ind(310000);\n REP(i, n){\n ll a, b;\n cin >> a >> b;\n s.push_back(P(a, b));\n }\n sort(ALL(s));\n s.erase(unique(ALL(s)), s.end());\n n = s.size();\n REP(i, n){\n fr[s[i].first]++;\n fr[ s[i].second]++;\n }\n ll cnt = 0;\n for (auto& i : fr) {\n i.second = cnt;\n to[cnt] = i.first;\n cnt++;\n }\n REP(i, n){\n v.push_back(P(fr[s[i].first] + fr[s[i].second], i));\n }\n sort(ALL(v));\n REP(i, n){\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\n }\n st.init(ind);\n REP(i, n){\n //cout << s[v[i].second].first << \" \" << s[v[i].second].second << \" \" << fr[s[v[i].second].first] <<\" \" << fr[s[v[i].second].second] << \" \" << v[i].second << endl;\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\n ans = max(ans, x);\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\n }\n cout << ans << endl;\n}","accuracy":0.2972972972972973,"time_ms":690,"memory_kb":202276,"score_of_the_acc":-1.5856,"final_rank":9},{"submission_id":"aoj_2814_9117995","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\n\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\"\n\n#line 4 \"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\"\n\nnamespace noya2{\n\ntemplate<typename T> struct compress {\n vector<T> raws;\n compress(const vector<T> &raws_ = {}) : raws(raws_){ build(); }\n int id(const T &raw){ return lb(raw); }\n T raw(const int &id){ return raws[id]; }\n void build(){ uniq(raws); }\n void add(const T &raw){ raws.push_back(raw); }\n size_t size(){ return raws.size(); }\n int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }\n int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }\n bool contains(const T &raw){\n int jd = lb(raw);\n if (jd < (int)size()) return raws[jd] == raw;\n return false;\n }\n int contains_id(const T &raw){\n int jd = lb(raw);\n if (jd < (int)size() && raws[jd] == raw) return jd;\n return -1;\n }\n};\n\n} // namespace noya2\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp\"\n\nnamespace noya2{\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = 0;\n size = 1;\n while (size < _n) size <<= 1, log++;\n\n d = std::vector<S>(2 * size, e());\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 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 return d[p + size];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n S sml = e(), smr = e();\n l += size;\n r += size;\n\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 return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) {\n assert(0 <= l && l <= _n);\n assert(f(e()));\n if (l == _n) return _n;\n l += size;\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, d[l]))) {\n while (l < size) {\n l = (2 * l);\n if (f(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 (*f)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) {\n assert(0 <= r && r <= _n);\n assert(f(e()));\n if (r == 0) return 0;\n r += size;\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(d[r], sm))) {\n while (r < size) {\n r = (2 * r + 1);\n if (f(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\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n};\n\n} // namespace noya2\n#line 7 \"c.cpp\"\n\n\nnamespace noya2 {\n\ntemplate<class S, S(*op)(S, S), S(*e)(), typename Idx = ll>\nstruct range_tree {\n using DS = segtree<S,op,e>;\n using T = int;\n void join(Idx x, Idx y){ ps.emplace_back(x,y); }\n void build(){\n for (auto &[x, y] : ps) xs.add(x);\n xs.build();\n //siz = bit_ceil(xs.size());\n siz = 1; while (siz < (int)(xs.size())) siz <<= 1;\n ys.resize(siz*2);\n for (auto &[x, y] : ps){\n int xid = xs.id(x) + siz;\n ys[xid].add(y);\n while (xid > 1){\n xid >>= 1;\n ys[xid].add(y);\n }\n }\n for (int i = 0; i < 2*siz; i++){\n ys[i].build();\n ds.emplace_back(ys[i].size());\n }\n }\n void set(Idx p, Idx q, T val){\n int i = xs.id(p) + siz;\n ds[i].set(ys[i].id(q),val);\n while (i > 1){\n i >>= 1;\n T lr = e();\n int i0 = ys[2*i+0].contains_id(q), i1 = ys[2*i+1].contains_id(q);\n if (i0 != -1) lr = op(lr, ds[2*i+0].get(i0));\n if (i1 != -1) lr = op(lr, ds[2*i+1].get(i1));\n ds[i].set(ys[i].id(q),lr);\n }\n }\n T get(Idx p, Idx q){\n int ip = xs.contains_id(p);\n if (ip == -1) return e();\n int i = ip + siz;\n int iq = ys[i].contains_id(q);\n if (iq == -1) return e();\n return ds[i].get(iq);\n }\n T prod(Idx lp, Idx rp, Idx lq, Idx rq){\n T res = e();\n int li = xs.lb(lp), ri = xs.lb(rp);\n for (li += siz, ri += siz; li < ri; li >>= 1, ri >>= 1){\n if (li & 1) res = op(res,ds[li].prod(ys[li].lb(lq),ys[li].lb(rq))), ++li;\n if (ri & 1) --ri, res = op(res,ds[ri].prod(ys[ri].lb(lq),ys[ri].lb(rq)));\n }\n return res;\n }\n int siz;\n vector<pair<Idx,Idx>> ps;\n compress<Idx> xs;\n vector<compress<Idx>> ys;\n vector<DS> ds;\n};\n\n} // namespace noya2\n\nint op(int a, int b){\n return max(a,b);\n}\nint e(){\n return -iinf;\n}\n\nvoid solve(){\n int n; in(n);\n vector<int> a(n), b(n);\n rep(i,n) in(a[i],b[i]);\n vector<int> ids(n); iota(all(ids),0);\n sort(all(ids),[&](int l, int r){\n return a[l]+b[l] < a[r]+b[r];\n });\n range_tree<int,op,e,int> rt0, rt1;\n rep(i,n){\n rep(tt,2){\n rt0.join(a[i],b[i]);\n rt1.join(a[i],b[i]);\n swap(a[i],b[i]);\n }\n }\n rt0.build();\n rt1.build();\n int ans = 1;\n for (int i : ids){\n // out(i,a[i],b[i]);\n rep(tt,2){\n int d0 = max(rt0.prod(0,a[i],0,b[i]),0);\n rt1.set(a[i],b[i],d0+1);\n int d1 = max(rt1.prod(0,a[i],0,b[i]),0);\n rt0.set(a[i],b[i],d1+1);\n swap(a[i],b[i]);\n chmax(ans,d0+1);\n chmax(ans,d1+1);\n }\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":0.1891891891891892,"time_ms":1150,"memory_kb":120436,"score_of_the_acc":-1.5831,"final_rank":20},{"submission_id":"aoj_2814_9117985","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>\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}\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}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\n\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\"\n\n#line 4 \"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\"\n\nnamespace noya2{\n\ntemplate<typename T> struct compress {\n vector<T> raws;\n compress(const vector<T> &raws_ = {}) : raws(raws_){ build(); }\n int id(const T &raw){ return lb(raw); }\n T raw(const int &id){ return raws[id]; }\n void build(){ uniq(raws); }\n void add(const T &raw){ raws.push_back(raw); }\n size_t size(){ return raws.size(); }\n int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }\n int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }\n bool contains(const T &raw){\n int jd = lb(raw);\n if (jd < (int)size()) return raws[jd] == raw;\n return false;\n }\n int contains_id(const T &raw){\n int jd = lb(raw);\n if (jd < (int)size() && raws[jd] == raw) return jd;\n return -1;\n }\n};\n\n} // namespace noya2\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp\"\n\nnamespace noya2{\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = 0;\n size = 1;\n while (size < _n) size <<= 1, log++;\n\n d = std::vector<S>(2 * size, e());\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 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 return d[p + size];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n S sml = e(), smr = e();\n l += size;\n r += size;\n\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 return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) {\n assert(0 <= l && l <= _n);\n assert(f(e()));\n if (l == _n) return _n;\n l += size;\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, d[l]))) {\n while (l < size) {\n l = (2 * l);\n if (f(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 (*f)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) {\n assert(0 <= r && r <= _n);\n assert(f(e()));\n if (r == 0) return 0;\n r += size;\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(d[r], sm))) {\n while (r < size) {\n r = (2 * r + 1);\n if (f(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\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n};\n\n} // namespace noya2\n#line 7 \"c.cpp\"\n\n\nnamespace noya2 {\n\ntemplate<class S, S(*op)(S, S), S(*e)(), typename Idx = ll>\nstruct range_tree {\n using DS = segtree<S,op,e>;\n using T = int;\n void join(Idx x, Idx y){ ps.emplace_back(x,y); }\n void build(){\n for (auto &[x, y] : ps) xs.add(x);\n xs.build();\n //siz = bit_ceil(xs.size());\n siz = 1; while (siz < (int)(xs.size())) siz <<= 1;\n ys.resize(siz*2);\n for (auto &[x, y] : ps){\n int xid = xs.id(x) + siz;\n ys[xid].add(y);\n while (xid > 1){\n xid >>= 1;\n ys[xid].add(y);\n }\n }\n for (int i = 0; i < 2*siz; i++){\n ys[i].build();\n ds.emplace_back(ys[i].size());\n }\n }\n void set(Idx p, Idx q, T val){\n int i = xs.id(p) + siz;\n ds[i].set(ys[i].id(q),val);\n while (i > 1){\n i >>= 1;\n T lr = e();\n int i0 = ys[2*i+0].contains_id(q), i1 = ys[2*i+1].contains_id(q);\n if (i0 != -1) lr = op(lr, ds[2*i+0].get(i0));\n if (i1 != -1) lr = op(lr, ds[2*i+1].get(i1));\n ds[i].set(ys[i].id(q),lr);\n }\n }\n T get(Idx p, Idx q){\n int ip = xs.contains_id(p);\n if (ip == -1) return e();\n int i = ip + siz;\n int iq = ys[i].contains_id(q);\n if (iq == -1) return e();\n return ds[i].get(iq);\n }\n T prod(Idx lp, Idx rp, Idx lq, Idx rq){\n T res = e();\n int li = xs.lb(lp), ri = xs.lb(rp);\n for (li += siz, ri += siz; li < ri; li >>= 1, ri >>= 1){\n if (li & 1) res = op(res,ds[li].prod(ys[li].lb(lq),ys[li].lb(rq))), ++li;\n if (ri & 1) --ri, res = op(res,ds[ri].prod(ys[ri].lb(lq),ys[ri].lb(rq)));\n }\n return res;\n }\n int siz;\n vector<pair<Idx,Idx>> ps;\n compress<Idx> xs;\n vector<compress<Idx>> ys;\n vector<DS> ds;\n};\n\n} // namespace noya2\n\nint op(int a, int b){\n return max(a,b);\n}\nint e(){\n return -iinf;\n}\n\nvoid solve(){\n int n; in(n);\n vector<int> a(n), b(n);\n rep(i,n) in(a[i],b[i]);\n vector<int> ids(n); iota(all(ids),0);\n sort(all(ids),[&](int l, int r){\n return a[l]+b[l] < a[r]+b[r];\n });\n range_tree<int,op,e,int> rt0, rt1;\n rep(i,n){\n rep(tt,2){\n rt0.join(a[i],b[i]);\n rt1.join(a[i],b[i]);\n swap(a[i],b[i]);\n }\n }\n rt0.build();\n rt1.build();\n int ans = 1;\n for (int i : ids){\n // out(i,a[i],b[i]);\n rep(tt,2){\n int d0 = max(rt0.prod(0,a[i],0,b[i]),0);\n rt1.set(a[i],b[i],d0+1);\n int d1 = max(rt1.prod(0,a[i],0,b[i]),-1);\n rt0.set(a[i],b[i],d1+1);\n swap(a[i],b[i]);\n chmax(ans,d0+1);\n chmax(ans,d1+1);\n }\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":0.1891891891891892,"time_ms":1140,"memory_kb":120352,"score_of_the_acc":-1.5737,"final_rank":19},{"submission_id":"aoj_2814_9117950","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i, n) for(ll i = 0;i < n;i++)\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\n#define ll long long\n#define INF (ll)1ll << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(),n.end()\n#define MOD (ll)1000000007\n#define P pair<ll, ll>\n\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\nusing V = ll;\nV comp(V& l, V& r) { return max(l, r); };\nstruct SegTree { //[l,r)\n int NV;\n vector<V> val;\n void init(int n) {\n NV = 1;\n while (NV < n) NV *= 2;\n val = vector<V>(NV * 2, 0);\n }\n V get(int x, int y, int l, int r, int k) {\n if (r <= x || y <= l) return 0;\n if (x <= l && r <= y) return val[k];\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\n }\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\n void add(int i, V v) { update(i, val[i + NV] + v); }\n V operator[](int x) { return get(x, x + 1); }\n};\n \nstruct Healthy2DSegTree {\n int NV;\n vector<SegTree> st;\n vector<vector<int>> index;\n \n void init(vector<vector<int>> &v) {\n int n = v.size();\n NV = 1; while (NV < n) NV *= 2;\n index.resize(2 * NV);\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\n rrep(i, NV * 2 - 1, 1) {\n sort(index[i].begin(), index[i].end());\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\n fore(j, index[i]) index[i / 2].push_back(j);\n }\n st.resize(2 * NV);\n rep(i, 1, NV * 2) st[i].init(index[i].size());\n }\n void update(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].update(yy, v);\n x >>= 1;\n }\n }\n void add(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].add(yy, v);\n x >>= 1;\n }\n }\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\n assert(k < NV * 2);\n assert(l < r);\n if (r <= sx or tx <= l) return 0;\n if (sx <= l and r <= tx) {\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\n return st[k].get(syy, tyy);\n }\n int md = (l + r) / 2;\n V le = get(sx, tx, sy, ty, k * 2, l, md);\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\n return comp(le, ri);\n }\n V get(int sx, int tx, int sy, int ty) {\n return get(sx, tx, sy, ty, 1, 0, NV);\n }\n};\n\nmap<ll, ll> fr, to;\nHealthy2DSegTree st;\nvector<P> s, v;\nll n, ans;\nint main(){\n cin >> n;\n vector<vector<int>> ind(310000);\n REP(i, n){\n ll a, b;\n cin >> a >> b;\n s.push_back(P(a, b));\n }\n sort(ALL(s));\n s.erase(unique(ALL(s)), s.end());\n n = s.size();\n REP(i, n){\n\n v.push_back(P(s[i].first + s[i].second, i));\n fr[s[i].first]++;\n fr[ s[i].second]++;\n }\n ll cnt = 0;\n for (auto& i : fr) {\n i.second = cnt;\n to[cnt] = i.first;\n cnt++;\n }\n sort(ALL(v));\n REP(i, n){\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\n }\n st.init(ind);\n REP(i, n){\n //cout << s[v[i].second].first << \" \" << s[v[i].second].second << \" \" << fr[s[v[i].second].first] <<\" \" << fr[s[v[i].second].second] << \" \" << v[i].second << endl;\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\n ans = max(ans, x);\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\n }\n cout << ans << endl;\n}","accuracy":0.2972972972972973,"time_ms":680,"memory_kb":201916,"score_of_the_acc":-1.5747,"final_rank":8},{"submission_id":"aoj_2814_9117942","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i, n) for(ll i = 0;i < n;i++)\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\n#define ll long long\n#define INF (ll)1ll << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(),n.end()\n#define MOD (ll)1000000007\n#define P pair<ll, ll>\n\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\nusing V = ll;\nV comp(V& l, V& r) { return max(l, r); };\nstruct SegTree { //[l,r)\n int NV;\n vector<V> val;\n void init(int n) {\n NV = 1;\n while (NV < n) NV *= 2;\n val = vector<V>(NV * 2, 0);\n }\n V get(int x, int y, int l, int r, int k) {\n if (r <= x || y <= l) return 0;\n if (x <= l && r <= y) return val[k];\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\n }\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\n void add(int i, V v) { update(i, val[i + NV] + v); }\n V operator[](int x) { return get(x, x + 1); }\n};\n \nstruct Healthy2DSegTree {\n int NV;\n vector<SegTree> st;\n vector<vector<int>> index;\n \n void init(vector<vector<int>> &v) {\n int n = v.size();\n NV = 1; while (NV < n) NV *= 2;\n index.resize(2 * NV);\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\n rrep(i, NV * 2 - 1, 1) {\n sort(index[i].begin(), index[i].end());\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\n fore(j, index[i]) index[i / 2].push_back(j);\n }\n st.resize(2 * NV);\n rep(i, 1, NV * 2) st[i].init(index[i].size());\n }\n void update(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].update(yy, v);\n x >>= 1;\n }\n }\n void add(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].add(yy, v);\n x >>= 1;\n }\n }\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\n assert(k < NV * 2);\n assert(l < r);\n if (r <= sx or tx <= l) return 0;\n if (sx <= l and r <= tx) {\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\n return st[k].get(syy, tyy);\n }\n int md = (l + r) / 2;\n V le = get(sx, tx, sy, ty, k * 2, l, md);\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\n return comp(le, ri);\n }\n V get(int sx, int tx, int sy, int ty) {\n return get(sx, tx, sy, ty, 1, 0, NV);\n }\n};\n\nmap<ll, ll> fr, to;\nHealthy2DSegTree st;\nvector<P> s, v;\nll n, ans;\nint main(){\n cin >> n;\n vector<vector<int>> ind(310000);\n REP(i, n){\n ll a, b;\n cin >> a >> b;\n s.push_back(P(a, b));\n }\n sort(ALL(s));\n s.erase(unique(ALL(s)), s.end());\n n = s.size();\n REP(i, n){\n\n v.push_back(P(s[i].first + s[i].second, i));\n fr[s[i].first]++;\n fr[ s[i].second]++;\n }\n fr[0]++;\n ll cnt = 0;\n for (auto& i : fr) {\n i.second = cnt;\n to[cnt] = i.first;\n cnt++;\n }\n sort(ALL(v));\n REP(i, n){\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\n }\n st.init(ind);\n REP(i, n){\n //cout << s[v[i].second].first << \" \" << s[v[i].second].second << \" \" << fr[s[v[i].second].first] <<\" \" << fr[s[v[i].second].second] << \" \" << v[i].second << endl;\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\n ans = max(ans, x);\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\n }\n cout << ans << endl;\n}","accuracy":0.1891891891891892,"time_ms":360,"memory_kb":162168,"score_of_the_acc":-1.084,"final_rank":15},{"submission_id":"aoj_2814_9117905","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i, n) for(ll i = 0;i < n;i++)\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\n#define ll long long\n#define INF (ll)1ll << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(),n.end()\n#define MOD (ll)1000000007\n#define P pair<ll, ll>\n\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\nusing V = ll;\nV comp(V& l, V& r) { return max(l, r); };\nstruct SegTree { //[l,r)\n int NV;\n vector<V> val;\n void init(int n) {\n NV = 1;\n while (NV < n) NV *= 2;\n val = vector<V>(NV * 2, 0);\n }\n V get(int x, int y, int l, int r, int k) {\n if (r <= x || y <= l) return 0;\n if (x <= l && r <= y) return val[k];\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\n }\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\n void add(int i, V v) { update(i, val[i + NV] + v); }\n V operator[](int x) { return get(x, x + 1); }\n};\n \nstruct Healthy2DSegTree {\n int NV;\n vector<SegTree> st;\n vector<vector<int>> index;\n \n void init(vector<vector<int>> &v) {\n int n = v.size();\n NV = 1; while (NV < n) NV *= 2;\n index.resize(2 * NV);\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\n rrep(i, NV * 2 - 1, 1) {\n sort(index[i].begin(), index[i].end());\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\n fore(j, index[i]) index[i / 2].push_back(j);\n }\n st.resize(2 * NV);\n rep(i, 1, NV * 2) st[i].init(index[i].size());\n }\n void update(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].update(yy, v);\n x >>= 1;\n }\n }\n void add(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].add(yy, v);\n x >>= 1;\n }\n }\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\n assert(k < NV * 2);\n assert(l < r);\n if (r <= sx or tx <= l) return 0;\n if (sx <= l and r <= tx) {\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\n return st[k].get(syy, tyy);\n }\n int md = (l + r) / 2;\n V le = get(sx, tx, sy, ty, k * 2, l, md);\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\n return comp(le, ri);\n }\n V get(int sx, int tx, int sy, int ty) {\n return get(sx, tx, sy, ty, 1, 0, NV);\n }\n};\n\nmap<ll, ll> fr, to;\nHealthy2DSegTree st;\nvector<P> s, v;\nll n, ans;\nint main(){\n cin >> n;\n vector<vector<int>> ind(310000);\n REP(i, n){\n ll a, b;\n cin >> a >> b;\n s.push_back(P(a, b));\n v.push_back(P(a + b, i));\n fr[a]++;\n fr[b]++;\n }\n ll cnt = 1;\n for (auto& i : fr) {\n i.second = cnt;\n to[cnt] = i.first;\n cnt++;\n }\n sort(ALL(v));\n REP(i, n){\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\n }\n st.init(ind);\n REP(i, n){\n //cout << s[v[i].second].first << \" \" << s[v[i].second].second << \" \" << fr[s[v[i].second].first] <<\" \" << fr[s[v[i].second].second] << \" \" << v[i].second << endl;\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\n ans = max(ans, x);\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\n }\n cout << ans << endl;\n}","accuracy":0.1891891891891892,"time_ms":380,"memory_kb":162136,"score_of_the_acc":-1.1018,"final_rank":16},{"submission_id":"aoj_2814_9117854","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i, n) for(ll i = 0;i < n;i++)\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\n#define ll long long\n#define INF (ll)1ll << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(),n.end()\n#define MOD (ll)1000000007\n#define P pair<ll, ll>\n\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\nusing V = ll;\nV comp(V& l, V& r) { return max(l, r); };\nstruct SegTree { //[l,r)\n int NV;\n vector<V> val;\n void init(int n) {\n NV = 1;\n while (NV < n) NV *= 2;\n val = vector<V>(NV * 2, 0);\n }\n V get(int x, int y, int l, int r, int k) {\n if (r <= x || y <= l) return 0;\n if (x <= l && r <= y) return val[k];\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\n }\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\n void add(int i, V v) { update(i, val[i + NV] + v); }\n V operator[](int x) { return get(x, x + 1); }\n};\n \nstruct Healthy2DSegTree {\n int NV;\n vector<SegTree> st;\n vector<vector<int>> index;\n \n void init(vector<vector<int>> &v) {\n int n = v.size();\n NV = 1; while (NV < n) NV *= 2;\n index.resize(2 * NV);\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\n rrep(i, NV * 2 - 1, 1) {\n sort(index[i].begin(), index[i].end());\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\n fore(j, index[i]) index[i / 2].push_back(j);\n }\n st.resize(2 * NV);\n rep(i, 1, NV * 2) st[i].init(index[i].size());\n }\n void update(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].update(yy, v);\n x >>= 1;\n }\n }\n void add(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].add(yy, v);\n x >>= 1;\n }\n }\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\n assert(k < NV * 2);\n assert(l < r);\n if (r <= sx or tx <= l) return 0;\n if (sx <= l and r <= tx) {\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\n return st[k].get(syy, tyy);\n }\n int md = (l + r) / 2;\n V le = get(sx, tx, sy, ty, k * 2, l, md);\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\n return comp(le, ri);\n }\n V get(int sx, int tx, int sy, int ty) {\n return get(sx, tx, sy, ty, 1, 0, NV);\n }\n};\n\nmap<ll, ll> fr, to;\nHealthy2DSegTree st;\nvector<P> s, v;\nll n, ans;\nint main(){\n cin >> n;\n vector<vector<int>> ind(410000);\n REP(i, n){\n ll a, b;\n cin >> a >> b;\n s.push_back(P(a, b));\n v.push_back(P(a + b, i));\n fr[a]++;\n fr[b]++;\n }\n ll cnt = 1;\n for (auto& i : fr) {\n i.second = cnt;\n to[cnt] = i.first;\n cnt++;\n }\n sort(ALL(v));\n REP(i, n){\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\n }\n st.init(ind);\n REP(i, n){\n //cout << s[v[i].second].first << \" \" << s[v[i].second].second << \" \" << fr[s[v[i].second].first] <<\" \" << fr[s[v[i].second].second] << \" \" << v[i].second << endl;\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\n ans = max(ans, x);\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\n }\n cout << ans << endl;\n}","accuracy":0.1891891891891892,"time_ms":370,"memory_kb":164508,"score_of_the_acc":-1.1049,"final_rank":17},{"submission_id":"aoj_2814_9117819","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i, n) for(ll i = 0;i < n;i++)\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\n#define ll long long\n#define INF (ll)1ll << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(),n.end()\n#define MOD (ll)1000000007\n#define P pair<ll, ll>\n\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\nusing V = ll;\nV comp(V& l, V& r) { return max(l, r); };\nstruct SegTree { //[l,r)\n int NV;\n vector<V> val;\n void init(int n) {\n NV = 1;\n while (NV < n) NV *= 2;\n val = vector<V>(NV * 2, 0);\n }\n V get(int x, int y, int l, int r, int k) {\n if (r <= x || y <= l) return 0;\n if (x <= l && r <= y) return val[k];\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\n }\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\n void add(int i, V v) { update(i, val[i + NV] + v); }\n V operator[](int x) { return get(x, x + 1); }\n};\n \nstruct Healthy2DSegTree {\n int NV;\n vector<SegTree> st;\n vector<vector<int>> index;\n \n void init(vector<vector<int>> &v) {\n int n = v.size();\n NV = 1; while (NV < n) NV *= 2;\n index.resize(2 * NV);\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\n rrep(i, NV * 2 - 1, 1) {\n sort(index[i].begin(), index[i].end());\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\n fore(j, index[i]) index[i / 2].push_back(j);\n }\n st.resize(2 * NV);\n rep(i, 1, NV * 2) st[i].init(index[i].size());\n }\n void update(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].update(yy, v);\n x >>= 1;\n }\n }\n void add(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].add(yy, v);\n x >>= 1;\n }\n }\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\n assert(k < NV * 2);\n assert(l < r);\n if (r <= sx or tx <= l) return 0;\n if (sx <= l and r <= tx) {\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\n return st[k].get(syy, tyy);\n }\n int md = (l + r) / 2;\n V le = get(sx, tx, sy, ty, k * 2, l, md);\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\n return comp(le, ri);\n }\n V get(int sx, int tx, int sy, int ty) {\n return get(sx, tx, sy, ty, 1, 0, NV);\n }\n};\n\nmap<ll, ll> fr, to;\nHealthy2DSegTree st;\nvector<P> s, v;\nll n, ans;\nint main(){\n cin >> n;\n vector<vector<int>> ind(310000);\n REP(i, n){\n ll a, b;\n cin >> a >> b;\n s.push_back(P(a, b));\n v.push_back(P(a + b, i));\n fr[a]++;\n fr[b]++;\n }\n ll cnt = 0;\n for (auto& i : fr) {\n i.second = cnt;\n to[cnt] = i.first;\n cnt++;\n }\n sort(ALL(v));\n REP(i, n){\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\n }\n st.init(ind);\n REP(i, n){\n //cout << s[v[i].second].first << \" \" << s[v[i].second].second << \" \" << fr[s[v[i].second].first] <<\" \" << fr[s[v[i].second].second] << \" \" << v[i].second << endl;\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\n ans = max(ans, x);\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\n }\n cout << ans << endl;\n}","accuracy":0.2972972972972973,"time_ms":700,"memory_kb":201960,"score_of_the_acc":-1.593,"final_rank":10},{"submission_id":"aoj_2814_9117815","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i, n) for(ll i = 0;i < n;i++)\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\n#define ll long long\n#define INF (ll)1ll << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(),n.end()\n#define MOD (ll)1000000007\n#define P pair<ll, ll>\n\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\nusing V = ll;\nV comp(V& l, V& r) { return max(l, r); };\nstruct SegTree { //[l,r)\n int NV;\n vector<V> val;\n void init(int n) {\n NV = 1;\n while (NV < n) NV *= 2;\n val = vector<V>(NV * 2, 0);\n }\n V get(int x, int y, int l, int r, int k) {\n if (r <= x || y <= l) return 0;\n if (x <= l && r <= y) return val[k];\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\n }\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\n void add(int i, V v) { update(i, val[i + NV] + v); }\n V operator[](int x) { return get(x, x + 1); }\n};\n \nstruct Healthy2DSegTree {\n int NV;\n vector<SegTree> st;\n vector<vector<int>> index;\n \n void init(vector<vector<int>> &v) {\n int n = v.size();\n NV = 1; while (NV < n) NV *= 2;\n index.resize(2 * NV);\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\n rrep(i, NV * 2 - 1, 1) {\n sort(index[i].begin(), index[i].end());\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\n fore(j, index[i]) index[i / 2].push_back(j);\n }\n st.resize(2 * NV);\n rep(i, 1, NV * 2) st[i].init(index[i].size());\n }\n void update(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].update(yy, v);\n x >>= 1;\n }\n }\n void add(int x, int y, V v) {\n assert(x < NV);\n x += NV;\n while (x) {\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\n assert(yy != index[x].size());\n assert(y == index[x][yy]);\n st[x].add(yy, v);\n x >>= 1;\n }\n }\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\n assert(k < NV * 2);\n assert(l < r);\n if (r <= sx or tx <= l) return 0;\n if (sx <= l and r <= tx) {\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\n return st[k].get(syy, tyy);\n }\n int md = (l + r) / 2;\n V le = get(sx, tx, sy, ty, k * 2, l, md);\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\n return comp(le, ri);\n }\n V get(int sx, int tx, int sy, int ty) {\n return get(sx, tx, sy, ty, 1, 0, NV);\n }\n};\n\nmap<ll, ll> fr, to;\nHealthy2DSegTree st;\nvector<P> s, v;\nll n, ans;\nint main(){\n cin >> n;\n vector<vector<int>> ind(110000);\n REP(i, n){\n ll a, b;\n cin >> a >> b;\n s.push_back(P(a, b));\n v.push_back(P(a + b, i));\n fr[a]++;\n fr[b]++;\n }\n ll cnt = 0;\n for (auto& i : fr) {\n i.second = cnt;\n to[cnt] = i.first;\n cnt++;\n }\n sort(ALL(v));\n REP(i, n){\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\n }\n st.init(ind);\n REP(i, n){\n //cout << s[v[i].second].first << \" \" << s[v[i].second].second << \" \" << fr[s[v[i].second].first] <<\" \" << fr[s[v[i].second].second] << \" \" << v[i].second << endl;\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\n ans = max(ans, x);\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\n }\n cout << ans << endl;\n}","accuracy":0.2972972972972973,"time_ms":310,"memory_kb":84912,"score_of_the_acc":-0.6454,"final_rank":7},{"submission_id":"aoj_2814_5967500","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\";}\ntemplate <typename T>\nstruct ST{//1index query l,r lが開区間\n using F = function<T(T,T)>;\n int n;\n F f;\n T ti;\n vector<T> dat;\n ST(){};\n ST(F f,T ti):f(f),ti(ti){}\n void init(int n_){ \n n=1;\n while(n<n_) n<<=1;\n dat.assign(n<<1,ti);\n }\n void build(const vector<T> &v){\n int n_=v.size();\n init(n_);\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n void set_val(int k,T x){//kは0-index\n dat[k+=n]=x;\n while(k>>=1)\n dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]); \n }\n T query(int a,int b){\n T vl=ti,vr=ti;\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};\nstruct dat{\n ll a,b,id;\n dat(ll a,ll b,ll id):a(a),b(b),id(id){}\n};\nint main(){\n int n;\n cin >> n;\n V<int> A(n),B(n);\n map<int,int> mp;\n V<dat> d;\n for(int i=0;i<n;i++){\n cin >> A[i] >> B[i];\n mp[A[i]];mp[B[i]];\n d.emplace_back(A[i],B[i],0ll);\n d.emplace_back(B[i],A[i],1ll);\n }\n sort(all(d),[](auto a,auto b){\n if(a.a!=b.a)return a.a<b.a;\n return a.b<b.b;\n });\n int num=0;\n for(auto &p:mp){\n p.se=num++;\n }\n auto f=[&](ll a,ll b){\n return max(a,b);\n };\n ST<ll> dp1(f,0),dp2(f,0);\n dp1.init(num+5);\n dp2.init(num+5);\n V<dat> tmp;\n int bfo=-1;\n for(int i=0;i<2*n;i++){\n auto [a,b,id]=d[i];\n if(bfo!=a){\n for(auto [ind,v,id]:tmp){\n if(id==0){\n dp2.set_val(ind,v);\n }else{\n dp1.set_val(ind,v); \n }\n }\n tmp.clear();\n bfo=a;\n }\n if(id==0){\n ll v=dp1.query(0,mp[b])+1;\n ll u=dp2.query(mp[b],mp[b]+1);\n tmp.emplace_back(mp[b],max(v,u),0);\n }else{\n ll v=dp2.query(0,mp[b])+1;\n ll u=dp1.query(mp[b],mp[b]+1);\n tmp.emplace_back(mp[b],max(v,u),1); \n }\n }\n for(auto [ind,v,id]:tmp){\n if(id==0){\n dp2.set_val(ind,v);\n }else{\n dp1.set_val(ind,v); \n }\n }\n cout<<max(dp1.query(0,num+5),dp2.query(0,num+5))<<\"\\n\";\n}","accuracy":1,"time_ms":210,"memory_kb":27368,"score_of_the_acc":-0.2621,"final_rank":6},{"submission_id":"aoj_2814_5967477","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\";}\ntemplate <typename T>\nstruct ST{//1index query l,r lが開区間\n using F = function<T(T,T)>;\n int n;\n F f;\n T ti;\n vector<T> dat;\n ST(){};\n ST(F f,T ti):f(f),ti(ti){}\n void init(int n_){ \n n=1;\n while(n<n_) n<<=1;\n dat.assign(n<<1,ti);\n }\n void build(const vector<T> &v){\n int n_=v.size();\n init(n_);\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n void set_val(int k,T x){//kは0-index\n dat[k+=n]=x;\n while(k>>=1)\n dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]); \n }\n T query(int a,int b){\n T vl=ti,vr=ti;\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};\nstruct dat{\n ll a,b,id;\n dat(ll a,ll b,ll id):a(a),b(b),id(id){}\n};\nint main(){\n int n;\n cin >> n;\n V<int> A(n),B(n);\n map<int,int> mp;\n V<dat> d;\n for(int i=0;i<n;i++){\n cin >> A[i] >> B[i];\n mp[A[i]];mp[B[i]];\n d.emplace_back(A[i],B[i],0ll);\n d.emplace_back(B[i],A[i],1ll);\n }\n sort(all(d),[](auto a,auto b){\n if(a.a!=b.a)return a.a<b.a;\n return a.b<b.b;\n });\n int num=0;\n for(auto &p:mp){\n p.se=num++;\n }\n auto f=[&](ll a,ll b){\n return max(a,b);\n };\n ST<ll> dp1(f,0),dp2(f,0);\n dp1.init(num+5);\n dp2.init(num+5);\n for(int i=0;i<2*n;i++){\n auto [a,b,id]=d[i];\n if(id==0){\n ll v=dp1.query(0,mp[b])+1;\n ll u=dp2.query(mp[b],mp[b]+1);\n dp2.set_val(mp[b],max(v,u));\n }else{\n ll v=dp2.query(0,mp[b])+1;\n ll u=dp1.query(mp[b],mp[b]+1);\n dp1.set_val(mp[b],max(v,u)); \n }\n }\n cout<<max(dp1.query(0,num+5),dp2.query(0,num+5))<<\"\\n\";\n}","accuracy":0.1891891891891892,"time_ms":100,"memory_kb":18624,"score_of_the_acc":-0.1185,"final_rank":13},{"submission_id":"aoj_2814_5967369","code_snippet":"//#pragma GCC optimize(\"Ofast\")\n//#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n\n//#include <atcoder/modint>\nusing namespace std;\n//using namespace atcoder;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int, int>;\ntemplate <class T>\nusing V = vector<T>;\ntemplate <class T>\nusing VV = V<V<T>>;\ntemplate <class T>\nV<T> make_vec(size_t a) {\n return V<T>(a);\n}\ntemplate <class T, class... Ts>\nauto make_vec(size_t a, Ts... ts) {\n return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\n}\n\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define fi first\n#define se second\n#define rep(i, n) rep2(i, 0, n)\n#define rep2(i, m, n) for (int i = m; i < (n); i++)\n#define per(i, b) per2(i, 0, b)\n#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)\n#define ALL(c) (c).begin(), (c).end()\n#define SZ(x) ((int)(x).size())\n#define all(x) x.begin(),x.end()\n\nconstexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }\n\ntemplate <class T, class U>\nvoid chmin(T& t, const U& u) {\n if (t > u) t = u;\n}\ntemplate <class T, class U>\nvoid chmax(T& t, const U& u) {\n if (t < u) t = u;\n}\n\ntemplate <class T, class U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << \"(\" << p.first << \",\" << p.second << \")\";\n return os;\n}\n\ntemplate <class T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"{\";\n rep(i, v.size()) {\n if (i) os << \",\";\n os << v[i];\n }\n os << \"}\";\n return os;\n}\n\n#ifdef LOCAL\nvoid debug_out() { cerr << endl; }\ntemplate <typename Head, typename... Tail>\nvoid 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\nconstexpr int INF = TEN(9);\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int N;\n cin >> N;\n int M=2*N;\n int A[N],B[N];\n rep(i,N) cin >> A[i] >> B[i];\n set<int> apr;\n rep(i,N) apr.insert(A[i]),apr.insert(B[i]);\n vector<int> res;\n for(auto e:apr) res.push_back(e);\n rep(i,N){\n A[i]=lower_bound(all(res),A[i])-res.begin();\n B[i]=lower_bound(all(res),B[i])-res.begin();\n A[i]++;\n B[i]++;\n }\n V<pii> vec;\n rep(i, N) {\n vec.push_back(mp(A[i], -B[i]));\n vec.push_back(mp(B[i],-A[i]));\n }\n sort(ALL(vec));\n V<int> dp(M + 1, INF);\n dp[0] = 0;\n\n for (auto& [a, b] : vec) {\n auto it = lower_bound(ALL(dp), -b);\n *it = -b;\n }\n cout << lower_bound(ALL(dp), INF) - dp.begin() - 1 << endl;\n\n return 0;\n}","accuracy":0.1891891891891892,"time_ms":40,"memory_kb":11276,"score_of_the_acc":-0.027,"final_rank":11},{"submission_id":"aoj_2814_3992941","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\nconst ll INF = 1LL << 60;\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<pair<int, int>>v(N);\n\tvector<pair<int, int>>w(N);\n\tfor (auto &i : v)cin >> i.first >> i.second;\n\tfor (int i = 0; i < N; i++) {\n\t\tw[i] = { v[i].second,v[i].first };\n\t}\n\tsort(v.begin(), v.end());\n\tsort(w.begin(), w.end());\n\tint vindex = 0, windex = 0;\n\tvector<int>vused(N + 2);\n\tvector<int>wused(N + 2);\n\tset<pair<int, pair<int, int>>>vyoyaku;\n\tset<pair<int, pair<int, int>>>wyoyaku;\n\tset<pair<int, int>>vkouho;\n\tset<pair<int, int>>wkouho;\n\tvkouho.insert({ 0,1 });\n\tint ans = 0;\n\twhile (vindex < N || windex < N) {\n\t\t//cout << vindex << \" \" << windex << endl;\n\t\tint nx = 0;\n\t\tif (vindex == N)nx = 1;\n\t\telse if (windex<N&&v[vindex].first>w[windex].first)nx = 1;\n\t\t//cout << vindex << \" \" << windex << \" \" << nx << endl;\n\t\tif (nx == 0) {// use v\n\t\t\t\t\t //\tcout << \"vvvvvv\" << endl;\n\t\t\twhile (!vyoyaku.empty() && vyoyaku.begin()->first <= v[vindex].first) {\n\t\t\t\tauto box = vyoyaku.begin()->second;\n\t\t\t\tvyoyaku.erase(vyoyaku.begin());\n\n\t\t\t\tif (vused[box.second]) {\n\t\t\t\t\tif (vused[box.second]>box.first) {\n\t\t\t\t\t\tvkouho.insert(box);\n\t\t\t\t\t\tvkouho.erase({ vused[box.second],box.second });\n\t\t\t\t\t\tvused[box.second] = box.first;\n\t\t\t\t\t}\n\t\t\t\t\tauto it = vkouho.find(box);\n\t\t\t\t\twhile (it != vkouho.begin() && prev(it)->first >= box.first) {\n\t\t\t\t\t\tvused[prev(it)->second] = 0;\n\t\t\t\t\t\tvkouho.erase(prev(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauto nx = vkouho.lower_bound(box);\n\t\t\t\t\tif (nx != vkouho.begin() && prev(nx)->second >= box.second)continue;\n\t\t\t\t\tvkouho.insert(box);\n\t\t\t\t\tauto it = vkouho.find(box);\n\t\t\t\t\twhile (next(it) != vkouho.end() && next(it)->second <= box.second) {\n\t\t\t\t\t\tvused[next(it)->second] = 0;\n\t\t\t\t\t\tvkouho.erase(next(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tauto it = vkouho.lower_bound({ v[vindex].second,MOD });\n\t\t\tif (it == vkouho.begin()) {\n\t\t\t\tvindex++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tit = prev(it);\n\t\t\tint score = it->second;\n\t\t\t//\tcout << v[vindex].first << \" \" << v[vindex].second << \" \" << score << endl;\n\t\t\tans = max(ans, score);\n\t\t\twyoyaku.insert({ v[vindex].first+1,{ v[vindex].second + 1,score + 1 } });\n\t\t\tvindex++;\n\t\t}\n\t\telse {//use w\n\t\t\t //cout << w[windex].first << \" \" << wyoyaku.size() << endl;\n\t\t\twhile (!wyoyaku.empty() && wyoyaku.begin()->first <= w[windex].first) {\n\t\t\t\tauto box = wyoyaku.begin()->second;\n\t\t\t\twyoyaku.erase(wyoyaku.begin());\n\n\t\t\t\tif (wused[box.second]) {\n\t\t\t\t\tif (wused[box.second]>box.first) {\n\t\t\t\t\t\twkouho.insert(box);\n\t\t\t\t\t\twkouho.erase({ wused[box.second],box.second });\n\t\t\t\t\t\twused[box.second] = box.first;\n\t\t\t\t\t}\n\t\t\t\t\tauto it = wkouho.find(box);\n\t\t\t\t\twhile (it != wkouho.begin() && prev(it)->first >= box.first) {\n\t\t\t\t\t\twused[prev(it)->second] = 0;\n\t\t\t\t\t\twkouho.erase(prev(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauto nx = wkouho.lower_bound(box);\n\t\t\t\t\tif (nx != wkouho.begin() && prev(nx)->second >= box.second)continue;\n\t\t\t\t\twkouho.insert(box);\n\t\t\t\t\tauto it = wkouho.find(box);\n\t\t\t\t\twhile (next(it) != wkouho.end() && next(it)->second <= box.second) {\n\t\t\t\t\t\twused[next(it)->second] = 0;\n\t\t\t\t\t\twkouho.erase(next(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t\t//\tcout << \"hihihh\" << endl;\n\t\t\t//\tcout <<\"wwwwww \"<< w[windex].first << \" \" << w[windex].second << \" \" << wkouho.size() << endl;\n\t\t\tauto it = wkouho.lower_bound({ w[windex].second,MOD });\n\t\t\tif (it == wkouho.begin()) {\n\t\t\t\twindex++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tit = prev(it);\n\t\t\tint score = it->second;\n\t\t\t//\tcout << w[windex].first << \" \" << w[windex].second << \" \" << score << endl;\n\t\t\tans = max(ans, score);\n\t\t\tvyoyaku.insert({ w[windex].first+1,{ w[windex].second + 1,score + 1 } });\n\t\t\twindex++;\n\t\t}\n\n\n\t}\n\tcout << ans << endl;\n\t//cin >> N;\n}","accuracy":1,"time_ms":100,"memory_kb":9876,"score_of_the_acc":-0.0739,"final_rank":4},{"submission_id":"aoj_2814_3991770","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\nconst ll INF = 1LL << 60;\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<pair<int, int>>v(N);\n\tvector<pair<int, int>>w(N);\n\tfor (auto &i : v)cin >> i.first >> i.second;\n\tfor (int i = 0; i < N; i++) {\n\t\tw[i] = { v[i].second,v[i].first };\n\t}\n\tsort(v.begin(), v.end());\n\tsort(w.begin(), w.end());\n\tint vindex = 0, windex = 0;\n\tvector<int>vused(N + 2);\n\tvector<int>wused(N + 2);\n\tset<pair<int, pair<int, int>>>vyoyaku;\n\tset<pair<int, pair<int, int>>>wyoyaku;\n\tset<pair<int, int>>vkouho;\n\tset<pair<int, int>>wkouho;\n\tvkouho.insert({ 0,1 });\n\tint ans = 0;\n\twhile (vindex < N || windex < N) {\n\t\t//cout << vindex << \" \" << windex << endl;\n\t\tint nx = 0;\n\t\tif (vindex == N)nx = 1;\n\t\telse if (windex<N&&v[vindex].first>w[windex].first)nx = 1;\n\t\t//cout << vindex << \" \" << windex << \" \" << nx << endl;\n\t\tif (nx == 0) {// use v\n\t\t\t\t\t //\tcout << \"vvvvvv\" << endl;\n\t\t\twhile (!vyoyaku.empty() && vyoyaku.begin()->first <= v[vindex].first) {\n\t\t\t\tauto box = vyoyaku.begin()->second;\n\t\t\t\tvyoyaku.erase(vyoyaku.begin());\n\n\t\t\t\tif (vused[box.second]) {\n\t\t\t\t\tif (vused[box.second]>box.first) {\n\t\t\t\t\t\tvkouho.insert(box);\n\t\t\t\t\t\tvkouho.erase({ vused[box.second],box.second });\n\t\t\t\t\t\tvused[box.second] = box.first;\n\t\t\t\t\t}\n\t\t\t\t\tauto it = vkouho.find(box);\n\t\t\t\t\twhile (it != vkouho.begin() && prev(it)->first >= box.first) {\n\t\t\t\t\t\tvused[prev(it)->second] = 0;\n\t\t\t\t\t\tvkouho.erase(prev(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauto nx = vkouho.lower_bound(box);\n\t\t\t\t\tif (nx != vkouho.begin() && prev(nx)->second >= box.second)continue;\n\t\t\t\t\tvkouho.insert(box);\n\t\t\t\t\tauto it = vkouho.find(box);\n\t\t\t\t\twhile (next(it) != vkouho.end() && next(it)->second <= box.second) {\n\t\t\t\t\t\tvused[next(it)->second] = 0;\n\t\t\t\t\t\tvkouho.erase(next(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tauto it = vkouho.lower_bound({ v[vindex].second,MOD });\n\t\t\tif (it == vkouho.begin()) {\n\t\t\t\tvindex++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tit = prev(it);\n\t\t\tint score = it->second;\n\t\t\t//\tcout << v[vindex].first << \" \" << v[vindex].second << \" \" << score << endl;\n\t\t\tans = max(ans, score);\n\t\t\twyoyaku.insert({ v[vindex].first+1,{ v[vindex].second + 1,score + 1 } });\n\t\t\tvindex++;\n\t\t}\n\t\telse {//use w\n\t\t\t //cout << w[windex].first << \" \" << wyoyaku.size() << endl;\n\t\t\twhile (!wyoyaku.empty() && wyoyaku.begin()->first <= w[windex].first) {\n\t\t\t\tauto box = wyoyaku.begin()->second;\n\t\t\t\twyoyaku.erase(wyoyaku.begin());\n\n\t\t\t\tif (wused[box.second]) {\n\t\t\t\t\tif (wused[box.second]>box.first) {\n\t\t\t\t\t\twkouho.insert(box);\n\t\t\t\t\t\twkouho.erase({ wused[box.second],box.second });\n\t\t\t\t\t\twused[box.second] = box.first;\n\t\t\t\t\t}\n\t\t\t\t\tauto it = wkouho.find(box);\n\t\t\t\t\twhile (it != wkouho.begin() && prev(it)->first >= box.first) {\n\t\t\t\t\t\twused[prev(it)->second] = 0;\n\t\t\t\t\t\twkouho.erase(prev(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauto nx = wkouho.lower_bound(box);\n\t\t\t\t\tif (nx != wkouho.begin() && prev(nx)->second >= box.second)continue;\n\t\t\t\t\twkouho.insert(box);\n\t\t\t\t\tauto it = wkouho.find(box);\n\t\t\t\t\twhile (next(it) != wkouho.end() && next(it)->second <= box.second) {\n\t\t\t\t\t\twused[next(it)->second] = 0;\n\t\t\t\t\t\twkouho.erase(next(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t\t//\tcout << \"hihihh\" << endl;\n\t\t\t//\tcout <<\"wwwwww \"<< w[windex].first << \" \" << w[windex].second << \" \" << wkouho.size() << endl;\n\t\t\tauto it = wkouho.lower_bound({ w[windex].second,MOD });\n\t\t\tif (it == wkouho.begin()) {\n\t\t\t\twindex++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tit = prev(it);\n\t\t\tint score = it->second;\n\t\t\t//\tcout << w[windex].first << \" \" << w[windex].second << \" \" << score << endl;\n\t\t\tans = max(ans, score);\n\t\t\tvyoyaku.insert({ w[windex].first+1,{ w[windex].second + 1,score + 1 } });\n\t\t\twindex++;\n\t\t}\n\n\n\t}\n\tcout << ans << endl;\n\t//cin >> N;\n}","accuracy":1,"time_ms":100,"memory_kb":9872,"score_of_the_acc":-0.0739,"final_rank":3},{"submission_id":"aoj_2814_3991748","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\nconst ll INF = 1LL << 60;\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\n\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<pair<int, int>>v(N);\n\tvector<pair<int, int>>w(N);\n\tfor (auto &i : v)cin >> i.first >> i.second;\n\tfor (int i = 0; i < N; i++) {\n\t\tw[i] = { v[i].second,v[i].first };\n\t}\n\tsort(v.begin(), v.end());\n\tsort(w.begin(), w.end());\n\tint vindex = 0, windex = 0;\n\tvector<int>vused(N + 2);\n\tvector<int>wused(N + 2);\n\tset<pair<int, pair<int, int>>>vyoyaku;\n\tset<pair<int, pair<int, int>>>wyoyaku;\n\tset<pair<int, int>>vkouho;\n\tset<pair<int, int>>wkouho;\n\tvkouho.insert({ 0,1 });\n\tint ans = 0;\n\twhile (vindex < N || windex < N) {\n\t\t//cout << vindex << \" \" << windex << endl;\n\t\tint nx = 0;\n\t\tif (vindex == N)nx = 1;\n\t\telse if (windex<N&&v[vindex].first>w[windex].first)nx = 1;\n\t\t//cout << vindex << \" \" << windex << \" \" << nx << endl;\n\t\tif (nx == 0) {// use v\n\t\t//\tcout << \"vvvvvv\" << endl;\n\t\t\twhile (!vyoyaku.empty() && vyoyaku.begin()->first <= v[vindex].first) {\n\t\t\t\tauto box = vyoyaku.begin()->second;\n\t\t\t\tvyoyaku.erase(vyoyaku.begin());\n\n\t\t\t\tif (vused[box.second]) {\n\t\t\t\t\tif (vused[box.second]>box.first) {\n\t\t\t\t\t\tvkouho.insert(box);\n\t\t\t\t\t\tvkouho.erase({ vused[box.second],box.second });\n\t\t\t\t\t\tvused[box.second] = box.first;\n\t\t\t\t\t}\n\t\t\t\t\tauto it = vkouho.find(box);\n\t\t\t\t\twhile (it != vkouho.begin() && prev(it)->first >= box.first) {\n\t\t\t\t\t\tvused[prev(it)->second] = 0;\n\t\t\t\t\t\tvkouho.erase(prev(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauto nx = vkouho.lower_bound(box);\n\t\t\t\t\tif (nx != vkouho.begin() && prev(nx)->second >= box.second)continue;\n\t\t\t\t\tvkouho.insert(box);\n\t\t\t\t\tauto it = vkouho.find(box);\n\t\t\t\t\twhile (next(it) != vkouho.end() && next(it)->second <= box.second) {\n\t\t\t\t\t\tvused[next(it) -> second] = 0;\n\t\t\t\t\t\tvkouho.erase(next(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tauto it = vkouho.lower_bound({ v[vindex].second,MOD });\n\t\t\tif (it == vkouho.begin()) {\n\t\t\t\tvindex++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tit = prev(it);\n\t\t\tint score = it->second;\n\t\t//\tcout << v[vindex].first << \" \" << v[vindex].second << \" \" << score << endl;\n\t\t\tans = max(ans, score);\n\t\t\twyoyaku.insert({ v[vindex].first,{v[vindex].second + 1,score + 1} });\n\t\t\tvindex++;\n\t\t}\n\t\telse {//use w\n\t\t\t//cout << w[windex].first << \" \" << wyoyaku.size() << endl;\n\t\t\twhile (!wyoyaku.empty() && wyoyaku.begin()->first <= w[windex].first) {\n\t\t\t\tauto box = wyoyaku.begin()->second;\n\t\t\t\twyoyaku.erase(wyoyaku.begin());\n\n\t\t\t\tif (wused[box.second]) {\n\t\t\t\t\tif (wused[box.second]>box.first) {\n\t\t\t\t\t\twkouho.insert(box);\n\t\t\t\t\t\twkouho.erase({ wused[box.second],box.second });\n\t\t\t\t\t\twused[box.second] = box.first;\n\t\t\t\t\t}\n\t\t\t\t\tauto it = wkouho.find(box);\n\t\t\t\t\twhile (it != wkouho.begin() && prev(it)->first >= box.first) {\n\t\t\t\t\t\twused[prev(it)->second] = 0;\n\t\t\t\t\t\twkouho.erase(prev(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauto nx = wkouho.lower_bound(box);\n\t\t\t\t\tif (nx != wkouho.begin() && prev(nx)->second >= box.second)continue;\n\t\t\t\t\twkouho.insert(box);\n\t\t\t\t\tauto it = wkouho.find(box);\n\t\t\t\t\twhile (next(it) != wkouho.end() && next(it)->second <= box.second) {\n\t\t\t\t\t\twused[next(it)->second] = 0;\n\t\t\t\t\t\twkouho.erase(next(it));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t//\tcout << \"hihihh\" << endl;\n\t\t//\tcout <<\"wwwwww \"<< w[windex].first << \" \" << w[windex].second << \" \" << wkouho.size() << endl;\n\t\t\tauto it = wkouho.lower_bound({ w[windex].second,MOD });\n\t\t\tif (it == wkouho.begin()) {\n\t\t\t\twindex++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tit = prev(it);\n\t\t\tint score = it->second;\n\t\t//\tcout << w[windex].first << \" \" << w[windex].second << \" \" << score << endl;\n\t\t\tans = max(ans, score);\n\t\t\tvyoyaku.insert({ w[windex].first,{ w[windex].second + 1,score + 1 } });\n\t\t\twindex++;\n\t\t}\n\n\n\t}\n\tcout << ans << endl;\n\t//cin >> N;\n}","accuracy":0.1891891891891892,"time_ms":80,"memory_kb":9884,"score_of_the_acc":-0.0559,"final_rank":12},{"submission_id":"aoj_2814_2868844","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstruct Info{\n\tInfo(int arg_a,int arg_b,bool arg_is_reverse){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tis_reverse = arg_is_reverse;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\t\tif(a != arg.a){\n\t\t\treturn a < arg.a;\n\t\t}else{\n\t\t\treturn b > arg.b;\n\t\t}\n\t}\n\tint a,b;\n\tbool is_reverse;\n};\n\nint dp[200001];\n\nint main(){\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tint a,b;\n\tvector<Info> V;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d %d\",&a,&b);\n\t\tV.push_back(Info(a,b,false));\n\t\tV.push_back(Info(b,a,true));\n\t}\n\n\tsort(V.begin(),V.end());\n\n\tfor(int i = 0; i < 2*N; i++)dp[i] = BIG_NUM;\n\tint left,right,m,loc;\n\n\tfor(int i = 0; i < 2*N; i++){\n\t\tleft = 0,right = i,m = (left+right)/2;\n\t\tloc = BIG_NUM;\n\t\twhile(left <= right){\n\t\t\tif(dp[m] >= V[i].b){\n\t\t\t\tloc = m;\n\t\t\t\tright = m-1;\n\t\t\t}else{\n\t\t\t\tleft = m+1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t\tif(loc == BIG_NUM)continue;\n\t\tif(V[i].is_reverse == true && loc%2 == 0){\n\t\t\tdp[loc] = V[i].b;\n\t\t}else if(V[i].is_reverse == false && loc%2 == 1){\n\t\t\tdp[loc] = V[i].b;\n\t\t}\n\t}\n\n\tint ans = 0;\n\tleft = 0,right = 2*N-1,m = (left+right)/2;\n\n\twhile(left <= right){\n\t\tif(dp[m] == BIG_NUM){\n\t\t\tans = m;\n\t\t\tright = m-1;\n\t\t}else{\n\t\t\tleft = m+1;\n\t\t}\n\t\tm = (left+right)/2;\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":6200,"score_of_the_acc":-0.0011,"final_rank":2},{"submission_id":"aoj_2814_2595109","code_snippet":"#include <bits/stdc++.h>\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 all(c) c.begin(),c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nusing namespace std;\ntemplate<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<\"(\"<<p.fs<<\",\"<<p.sc<<\")\";}\ntemplate<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<\"sz = \"<<vc.size()<<endl<<\"[\";for(const T& v:vc) o<<v<<\",\";o<<\"]\";return o;}\n\nint inf=1e9;\nstruct segtree{\n\tstatic const int N=1<<18;\n\tint seg[N*2];\n\tsegtree(){\n\t\trep(i,N*2) seg[i]=0;\n\t}\n\tsegtree(vector<int>& vi){\n\t\trep(i,N*2) seg[i]=0;\n\t\trep(i,vi.size()) seg[N+i]=vi[i];\n\t\tfor(int i=N-1;i>0;i--) seg[i]=max(seg[i*2],seg[i*2+1]);\n\t}\n\n\n\tvoid update(int x,int v){\n\t\tx+=N;\n\t\tchmax(seg[x],v);\n\t\tx/=2;\n\t\twhile(x){\n\t\t\tseg[x]=max(seg[x*2],seg[x*2+1]);\n\t\t\tx/=2;\n\t\t}\n\t}\n\tint getmax(int a,int b,int l=0,int r=N,int k=1){\n\t\tif(b<=l||r<=a) return 0;\n\t\tif(a<=l&&r<=b) return seg[k];\n\t\treturn max(getmax(a,b,l,(l+r)/2,k*2),getmax(a,b,(l+r)/2,r,k*2+1));\n\t}\n}seg[2];\n\nvector<int> xs;\nconst int MN=100000;\ntypedef pair<int,int> P;\ntypedef pair<P,int> PP;\nint a[MN],b[MN],c[MN];\nint main(){\n\tint N;\n\tcin>>N;\n\tvector<PP> vp;\n\trep(i,N) cin>>a[i]>>b[i];\n\trep(i,N) xs.pb(a[i]),xs.pb(b[i]);\n\tsort(all(xs));\n\txs.erase(unique(xs.begin(),xs.end()),xs.end());\n\trep(i,N) a[i]=lower_bound(all(xs),a[i])-xs.begin(),b[i]=lower_bound(all(xs),b[i])-xs.begin();\n\trep(i,N){\n\t\tvp.pb(PP(P(a[i],-b[i]),0));\n\t\tvp.pb(PP(P(b[i],-a[i]),1));\n\t}\n\tsort(all(vp));\n\n\tint K = xs.size();\n\tint ans=0;\n\n\tvector<P> upd[2];\n\trep(i,N*2){\n\t\tPP pp=vp[i];\n\t\tint x = pp.fs.fs,y=-pp.fs.sc,c=pp.sc;\n\t\tint mx = seg[c].getmax(0,y)+1;\n\t\tchmax(ans,mx);\n//\t\tseg[1-c].update(y,mx);\n\t\tupd[1-c].pb(P(y,mx));\n\t\tif(i==N*2-1 || x!=vp[i+1].fs.fs){\n\t\t\trep(t,2){\n\t\t\t\tfor(P p:upd[t]) seg[t].update(p.fs,p.sc);\n\t\t\t\tupd[t].clear();\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}","accuracy":1,"time_ms":130,"memory_kb":13520,"score_of_the_acc":-0.1195,"final_rank":5},{"submission_id":"aoj_2814_2330127","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)),end((a))\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort(ALL((c)))\n#define RSORT(c) sort(RALL((c)))\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\ntemplate<class S, class T>\nostream& operator<<(ostream& os, const pair<S,T>& p){\n return os << p.FF << \" \" << p.SS;\n}\ntemplate<class T>\nvoid maxi(T& x, T y){\n if(x < y) x = y;\n}\ntemplate<class T>\nvoid mini(T& x, T y){\n if(x > y) x = y;\n}\n\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst LL MOD = 1e9+7;\nconst int INF = 1e9+100;\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n int N; cin >> N;\n using MA = pair<PII,int>;\n vector<MA> xs(N*2);\n REP(i,N){\n\tcin >> xs[i].FF;\n\txs[N+i] = MP(MP(xs[i].FF.SS, xs[i].FF.FF), 1);\n }\n sort(ALL(xs), [](const MA& l, const MA& r){\n\t return\n\t\tl.FF.FF != r.FF.FF ?\n\t\tl.FF.FF < r.FF.FF :\n\t\tl.FF.SS > r.FF.SS;\n\t});\n\n VI dp(N*2, INF);\n REP(i,N*2){\n\tint ix = lower_bound(ALL(dp), xs[i].FF.SS) - begin(dp);\n\tif(xs[i].SS != ix%2){\n\t if(ix == 0)\n\t\tcontinue;\n\t --ix;\n\t}\n\tmini(dp[ix], xs[i].FF.SS);\n }\n\n cout << (lower_bound(ALL(dp), INF) - begin(dp)) << endl;\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":5976,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2814_9118078\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\n\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\\\"\\n\\n#line 4 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate<typename T> struct compress {\\n vector<T> raws;\\n compress(const vector<T> &raws_ = {}) : raws(raws_){ build(); }\\n int id(const T &raw){ return lb(raw); }\\n T raw(const int &id){ return raws[id]; }\\n void build(){ uniq(raws); }\\n void add(const T &raw){ raws.push_back(raw); }\\n size_t size(){ return raws.size(); }\\n int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }\\n int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }\\n bool contains(const T &raw){\\n int jd = lb(raw);\\n if (jd < (int)size()) return raws[jd] == raw;\\n return false;\\n }\\n int contains_id(const T &raw){\\n int jd = lb(raw);\\n if (jd < (int)size() && raws[jd] == raw) return jd;\\n return -1;\\n }\\n};\\n\\n} // namespace noya2\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n segtree(const std::vector<S>& v) : _n(int(v.size())) {\\n log = 0;\\n size = 1;\\n while (size < _n) size <<= 1, log++;\\n\\n d = std::vector<S>(2 * size, e());\\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 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 return d[p + size];\\n }\\n\\n S prod(int l, int r) {\\n assert(0 <= l && l <= r && r <= _n);\\n S sml = e(), smr = e();\\n l += size;\\n r += size;\\n\\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 return op(sml, smr);\\n }\\n\\n S all_prod() { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) {\\n assert(0 <= l && l <= _n);\\n assert(f(e()));\\n if (l == _n) return _n;\\n l += size;\\n S sm = e();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!f(op(sm, d[l]))) {\\n while (l < size) {\\n l = (2 * l);\\n if (f(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 (*f)(S)> int min_left(int r) {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) {\\n assert(0 <= r && r <= _n);\\n assert(f(e()));\\n if (r == 0) return 0;\\n r += size;\\n S sm = e();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!f(op(d[r], sm))) {\\n while (r < size) {\\n r = (2 * r + 1);\\n if (f(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\\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\\n};\\n\\n} // namespace noya2\\n#line 7 \\\"c.cpp\\\"\\n\\n\\nnamespace noya2 {\\n\\ntemplate<class S, S(*op)(S, S), S(*e)(), typename Idx = ll>\\nstruct range_tree {\\n using DS = segtree<S,op,e>;\\n using T = int;\\n void join(Idx x, Idx y){ ps.emplace_back(x,y); }\\n void build(){\\n for (auto &[x, y] : ps) xs.add(x);\\n xs.build();\\n //siz = bit_ceil(xs.size());\\n siz = 1; while (siz < (int)(xs.size())) siz <<= 1;\\n ys.resize(siz*2);\\n for (auto &[x, y] : ps){\\n int xid = xs.id(x) + siz;\\n ys[xid].add(y);\\n while (xid > 1){\\n xid >>= 1;\\n ys[xid].add(y);\\n }\\n }\\n for (int i = 0; i < 2*siz; i++){\\n ys[i].build();\\n ds.emplace_back(ys[i].size());\\n }\\n }\\n void set(Idx p, Idx q, T val){\\n int i = xs.id(p) + siz;\\n ds[i].set(ys[i].id(q),val);\\n while (i > 1){\\n i >>= 1;\\n T lr = e();\\n int i0 = ys[2*i+0].contains_id(q), i1 = ys[2*i+1].contains_id(q);\\n if (i0 != -1) lr = op(lr, ds[2*i+0].get(i0));\\n if (i1 != -1) lr = op(lr, ds[2*i+1].get(i1));\\n ds[i].set(ys[i].id(q),lr);\\n }\\n }\\n T get(Idx p, Idx q){\\n int ip = xs.contains_id(p);\\n if (ip == -1) return e();\\n int i = ip + siz;\\n int iq = ys[i].contains_id(q);\\n if (iq == -1) return e();\\n return ds[i].get(iq);\\n }\\n T prod(Idx lp, Idx rp, Idx lq, Idx rq){\\n T res = e();\\n int li = xs.lb(lp), ri = xs.lb(rp);\\n for (li += siz, ri += siz; li < ri; li >>= 1, ri >>= 1){\\n if (li & 1) res = op(res,ds[li].prod(ys[li].lb(lq),ys[li].lb(rq))), ++li;\\n if (ri & 1) --ri, res = op(res,ds[ri].prod(ys[ri].lb(lq),ys[ri].lb(rq)));\\n }\\n return res;\\n }\\n int siz;\\n vector<pair<Idx,Idx>> ps;\\n compress<Idx> xs;\\n vector<compress<Idx>> ys;\\n vector<DS> ds;\\n};\\n\\n} // namespace noya2\\n\\nint op(int a, int b){\\n return max(a,b);\\n}\\nint e(){\\n return -iinf;\\n}\\n\\nvoid solve(){\\n int n; in(n);\\n vector<int> a(n), b(n);\\n rep(i,n) in(a[i],b[i]);\\n vector<int> ids(n); iota(all(ids),0);\\n sort(all(ids),[&](int l, int r){\\n return a[l]+b[l] < a[r]+b[r];\\n });\\n range_tree<int,op,e,int> rt;\\n rep(i,n){\\n rep(tt,2){\\n rt.join(a[i],b[i]);\\n swap(a[i],b[i]);\\n }\\n }\\n rt.build();\\n int ans = 1;\\n for (int i : ids){\\n // out(i,a[i],b[i]);\\n rep(tt,2){\\n int d = max(rt.prod(0,a[i],0,b[i]),0);\\n rt.set(a[i],b[i],d+1);\\n swap(a[i],b[i]);\\n chmax(ans,d+1);\\n }\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 500,\n \"memory_kb\": 61368,\n \"score_of_the_acc\": -0.6966,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2814_9118016\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\n\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\\\"\\n\\n#line 4 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate<typename T> struct compress {\\n vector<T> raws;\\n compress(const vector<T> &raws_ = {}) : raws(raws_){ build(); }\\n int id(const T &raw){ return lb(raw); }\\n T raw(const int &id){ return raws[id]; }\\n void build(){ uniq(raws); }\\n void add(const T &raw){ raws.push_back(raw); }\\n size_t size(){ return raws.size(); }\\n int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }\\n int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }\\n bool contains(const T &raw){\\n int jd = lb(raw);\\n if (jd < (int)size()) return raws[jd] == raw;\\n return false;\\n }\\n int contains_id(const T &raw){\\n int jd = lb(raw);\\n if (jd < (int)size() && raws[jd] == raw) return jd;\\n return -1;\\n }\\n};\\n\\n} // namespace noya2\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n segtree(const std::vector<S>& v) : _n(int(v.size())) {\\n log = 0;\\n size = 1;\\n while (size < _n) size <<= 1, log++;\\n\\n d = std::vector<S>(2 * size, e());\\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 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 return d[p + size];\\n }\\n\\n S prod(int l, int r) {\\n assert(0 <= l && l <= r && r <= _n);\\n S sml = e(), smr = e();\\n l += size;\\n r += size;\\n\\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 return op(sml, smr);\\n }\\n\\n S all_prod() { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) {\\n assert(0 <= l && l <= _n);\\n assert(f(e()));\\n if (l == _n) return _n;\\n l += size;\\n S sm = e();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!f(op(sm, d[l]))) {\\n while (l < size) {\\n l = (2 * l);\\n if (f(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 (*f)(S)> int min_left(int r) {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) {\\n assert(0 <= r && r <= _n);\\n assert(f(e()));\\n if (r == 0) return 0;\\n r += size;\\n S sm = e();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!f(op(d[r], sm))) {\\n while (r < size) {\\n r = (2 * r + 1);\\n if (f(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\\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\\n};\\n\\n} // namespace noya2\\n#line 7 \\\"c.cpp\\\"\\n\\n\\nnamespace noya2 {\\n\\ntemplate<class S, S(*op)(S, S), S(*e)(), typename Idx = ll>\\nstruct range_tree {\\n using DS = segtree<S,op,e>;\\n using T = int;\\n void join(Idx x, Idx y){ ps.emplace_back(x,y); }\\n void build(){\\n for (auto &[x, y] : ps) xs.add(x);\\n xs.build();\\n //siz = bit_ceil(xs.size());\\n siz = 1; while (siz < (int)(xs.size())) siz <<= 1;\\n ys.resize(siz*2);\\n for (auto &[x, y] : ps){\\n int xid = xs.id(x) + siz;\\n ys[xid].add(y);\\n while (xid > 1){\\n xid >>= 1;\\n ys[xid].add(y);\\n }\\n }\\n for (int i = 0; i < 2*siz; i++){\\n ys[i].build();\\n ds.emplace_back(ys[i].size());\\n }\\n }\\n void set(Idx p, Idx q, T val){\\n int i = xs.id(p) + siz;\\n ds[i].set(ys[i].id(q),val);\\n while (i > 1){\\n i >>= 1;\\n T lr = e();\\n int i0 = ys[2*i+0].contains_id(q), i1 = ys[2*i+1].contains_id(q);\\n if (i0 != -1) lr = op(lr, ds[2*i+0].get(i0));\\n if (i1 != -1) lr = op(lr, ds[2*i+1].get(i1));\\n ds[i].set(ys[i].id(q),lr);\\n }\\n }\\n T get(Idx p, Idx q){\\n int ip = xs.contains_id(p);\\n if (ip == -1) return e();\\n int i = ip + siz;\\n int iq = ys[i].contains_id(q);\\n if (iq == -1) return e();\\n return ds[i].get(iq);\\n }\\n T prod(Idx lp, Idx rp, Idx lq, Idx rq){\\n T res = e();\\n int li = xs.lb(lp), ri = xs.lb(rp);\\n for (li += siz, ri += siz; li < ri; li >>= 1, ri >>= 1){\\n if (li & 1) res = op(res,ds[li].prod(ys[li].lb(lq),ys[li].lb(rq))), ++li;\\n if (ri & 1) --ri, res = op(res,ds[ri].prod(ys[ri].lb(lq),ys[ri].lb(rq)));\\n }\\n return res;\\n }\\n int siz;\\n vector<pair<Idx,Idx>> ps;\\n compress<Idx> xs;\\n vector<compress<Idx>> ys;\\n vector<DS> ds;\\n};\\n\\n} // namespace noya2\\n\\nint op(int a, int b){\\n return max(a,b);\\n}\\nint e(){\\n return -iinf;\\n}\\n\\nvoid solve(){\\n int n; in(n);\\n vector<int> a(n), b(n);\\n rep(i,n) in(a[i],b[i]);\\n vector<int> ids(n); iota(all(ids),0);\\n sort(all(ids),[&](int l, int r){\\n return a[l]+b[l] < a[r]+b[r];\\n });\\n range_tree<int,op,e,int> rt0, rt1;\\n rep(i,n){\\n rep(tt,2){\\n rt0.join(a[i],b[i]);\\n rt1.join(a[i],b[i]);\\n swap(a[i],b[i]);\\n }\\n }\\n rt0.build();\\n rt1.build();\\n int ans = 1;\\n for (int i : ids){\\n // out(i,a[i],b[i]);\\n rep(tt,2){\\n int d0 = max(rt0.prod(0,a[i],0,b[i]),0);\\n int d1 = max(rt1.prod(0,a[i],0,b[i]),0);\\n rt1.set(a[i],b[i],d0+1);\\n rt0.set(a[i],b[i],d1+1);\\n swap(a[i],b[i]);\\n chmax(ans,d0+1);\\n chmax(ans,d1+1);\\n }\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 1080,\n \"memory_kb\": 120544,\n \"score_of_the_acc\": -1.5206,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2814_9118001\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#define REP(i, n) for(ll i = 0;i < n;i++)\\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\\n#define ll long long\\n#define INF (ll)1ll << 60\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(),n.end()\\n#define MOD (ll)1000000007\\n#define P pair<ll, ll>\\n\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\nusing V = ll;\\nV comp(V& l, V& r) { return max(l, r); };\\nstruct SegTree { //[l,r)\\n int NV;\\n vector<V> val;\\n void init(int n) {\\n NV = 1;\\n while (NV < n) NV *= 2;\\n val = vector<V>(NV * 2, 0);\\n }\\n V get(int x, int y, int l, int r, int k) {\\n if (r <= x || y <= l) return 0;\\n if (x <= l && r <= y) return val[k];\\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\\n }\\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\\n void add(int i, V v) { update(i, val[i + NV] + v); }\\n V operator[](int x) { return get(x, x + 1); }\\n};\\n \\nstruct Healthy2DSegTree {\\n int NV;\\n vector<SegTree> st;\\n vector<vector<int>> index;\\n \\n void init(vector<vector<int>> &v) {\\n int n = v.size();\\n NV = 1; while (NV < n) NV *= 2;\\n index.resize(2 * NV);\\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\\n rrep(i, NV * 2 - 1, 1) {\\n sort(index[i].begin(), index[i].end());\\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\\n fore(j, index[i]) index[i / 2].push_back(j);\\n }\\n st.resize(2 * NV);\\n rep(i, 1, NV * 2) st[i].init(index[i].size());\\n }\\n void update(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].update(yy, v);\\n x >>= 1;\\n }\\n }\\n void add(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].add(yy, v);\\n x >>= 1;\\n }\\n }\\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\\n assert(k < NV * 2);\\n assert(l < r);\\n if (r <= sx or tx <= l) return 0;\\n if (sx <= l and r <= tx) {\\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\\n return st[k].get(syy, tyy);\\n }\\n int md = (l + r) / 2;\\n V le = get(sx, tx, sy, ty, k * 2, l, md);\\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\\n return comp(le, ri);\\n }\\n V get(int sx, int tx, int sy, int ty) {\\n return get(sx, tx, sy, ty, 1, 0, NV);\\n }\\n};\\n\\nmap<ll, ll> fr, to;\\nHealthy2DSegTree st;\\nvector<P> s, v;\\nll n, ans;\\nint main(){\\n cin >> n;\\n vector<vector<int>> ind(310000);\\n REP(i, n){\\n ll a, b;\\n cin >> a >> b;\\n s.push_back(P(a, b));\\n }\\n sort(ALL(s));\\n s.erase(unique(ALL(s)), s.end());\\n n = s.size();\\n REP(i, n){\\n fr[s[i].first]++;\\n fr[ s[i].second]++;\\n }\\n ll cnt = 0;\\n for (auto& i : fr) {\\n i.second = cnt;\\n to[cnt] = i.first;\\n cnt++;\\n }\\n REP(i, n){\\n v.push_back(P(fr[s[i].first] + fr[s[i].second], i));\\n }\\n sort(ALL(v));\\n REP(i, n){\\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\\n }\\n st.init(ind);\\n REP(i, n){\\n //cout << s[v[i].second].first << \\\" \\\" << s[v[i].second].second << \\\" \\\" << fr[s[v[i].second].first] <<\\\" \\\" << fr[s[v[i].second].second] << \\\" \\\" << v[i].second << endl;\\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\\n ans = max(ans, x);\\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.2972972972972973,\n \"time_ms\": 690,\n \"memory_kb\": 202276,\n \"score_of_the_acc\": -1.5856,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2814_9117995\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\n\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\\\"\\n\\n#line 4 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate<typename T> struct compress {\\n vector<T> raws;\\n compress(const vector<T> &raws_ = {}) : raws(raws_){ build(); }\\n int id(const T &raw){ return lb(raw); }\\n T raw(const int &id){ return raws[id]; }\\n void build(){ uniq(raws); }\\n void add(const T &raw){ raws.push_back(raw); }\\n size_t size(){ return raws.size(); }\\n int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }\\n int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }\\n bool contains(const T &raw){\\n int jd = lb(raw);\\n if (jd < (int)size()) return raws[jd] == raw;\\n return false;\\n }\\n int contains_id(const T &raw){\\n int jd = lb(raw);\\n if (jd < (int)size() && raws[jd] == raw) return jd;\\n return -1;\\n }\\n};\\n\\n} // namespace noya2\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n segtree(const std::vector<S>& v) : _n(int(v.size())) {\\n log = 0;\\n size = 1;\\n while (size < _n) size <<= 1, log++;\\n\\n d = std::vector<S>(2 * size, e());\\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 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 return d[p + size];\\n }\\n\\n S prod(int l, int r) {\\n assert(0 <= l && l <= r && r <= _n);\\n S sml = e(), smr = e();\\n l += size;\\n r += size;\\n\\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 return op(sml, smr);\\n }\\n\\n S all_prod() { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) {\\n assert(0 <= l && l <= _n);\\n assert(f(e()));\\n if (l == _n) return _n;\\n l += size;\\n S sm = e();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!f(op(sm, d[l]))) {\\n while (l < size) {\\n l = (2 * l);\\n if (f(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 (*f)(S)> int min_left(int r) {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) {\\n assert(0 <= r && r <= _n);\\n assert(f(e()));\\n if (r == 0) return 0;\\n r += size;\\n S sm = e();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!f(op(d[r], sm))) {\\n while (r < size) {\\n r = (2 * r + 1);\\n if (f(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\\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\\n};\\n\\n} // namespace noya2\\n#line 7 \\\"c.cpp\\\"\\n\\n\\nnamespace noya2 {\\n\\ntemplate<class S, S(*op)(S, S), S(*e)(), typename Idx = ll>\\nstruct range_tree {\\n using DS = segtree<S,op,e>;\\n using T = int;\\n void join(Idx x, Idx y){ ps.emplace_back(x,y); }\\n void build(){\\n for (auto &[x, y] : ps) xs.add(x);\\n xs.build();\\n //siz = bit_ceil(xs.size());\\n siz = 1; while (siz < (int)(xs.size())) siz <<= 1;\\n ys.resize(siz*2);\\n for (auto &[x, y] : ps){\\n int xid = xs.id(x) + siz;\\n ys[xid].add(y);\\n while (xid > 1){\\n xid >>= 1;\\n ys[xid].add(y);\\n }\\n }\\n for (int i = 0; i < 2*siz; i++){\\n ys[i].build();\\n ds.emplace_back(ys[i].size());\\n }\\n }\\n void set(Idx p, Idx q, T val){\\n int i = xs.id(p) + siz;\\n ds[i].set(ys[i].id(q),val);\\n while (i > 1){\\n i >>= 1;\\n T lr = e();\\n int i0 = ys[2*i+0].contains_id(q), i1 = ys[2*i+1].contains_id(q);\\n if (i0 != -1) lr = op(lr, ds[2*i+0].get(i0));\\n if (i1 != -1) lr = op(lr, ds[2*i+1].get(i1));\\n ds[i].set(ys[i].id(q),lr);\\n }\\n }\\n T get(Idx p, Idx q){\\n int ip = xs.contains_id(p);\\n if (ip == -1) return e();\\n int i = ip + siz;\\n int iq = ys[i].contains_id(q);\\n if (iq == -1) return e();\\n return ds[i].get(iq);\\n }\\n T prod(Idx lp, Idx rp, Idx lq, Idx rq){\\n T res = e();\\n int li = xs.lb(lp), ri = xs.lb(rp);\\n for (li += siz, ri += siz; li < ri; li >>= 1, ri >>= 1){\\n if (li & 1) res = op(res,ds[li].prod(ys[li].lb(lq),ys[li].lb(rq))), ++li;\\n if (ri & 1) --ri, res = op(res,ds[ri].prod(ys[ri].lb(lq),ys[ri].lb(rq)));\\n }\\n return res;\\n }\\n int siz;\\n vector<pair<Idx,Idx>> ps;\\n compress<Idx> xs;\\n vector<compress<Idx>> ys;\\n vector<DS> ds;\\n};\\n\\n} // namespace noya2\\n\\nint op(int a, int b){\\n return max(a,b);\\n}\\nint e(){\\n return -iinf;\\n}\\n\\nvoid solve(){\\n int n; in(n);\\n vector<int> a(n), b(n);\\n rep(i,n) in(a[i],b[i]);\\n vector<int> ids(n); iota(all(ids),0);\\n sort(all(ids),[&](int l, int r){\\n return a[l]+b[l] < a[r]+b[r];\\n });\\n range_tree<int,op,e,int> rt0, rt1;\\n rep(i,n){\\n rep(tt,2){\\n rt0.join(a[i],b[i]);\\n rt1.join(a[i],b[i]);\\n swap(a[i],b[i]);\\n }\\n }\\n rt0.build();\\n rt1.build();\\n int ans = 1;\\n for (int i : ids){\\n // out(i,a[i],b[i]);\\n rep(tt,2){\\n int d0 = max(rt0.prod(0,a[i],0,b[i]),0);\\n rt1.set(a[i],b[i],d0+1);\\n int d1 = max(rt1.prod(0,a[i],0,b[i]),0);\\n rt0.set(a[i],b[i],d1+1);\\n swap(a[i],b[i]);\\n chmax(ans,d0+1);\\n chmax(ans,d1+1);\\n }\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 1150,\n \"memory_kb\": 120436,\n \"score_of_the_acc\": -1.5831,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2814_9117985\",\n \"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>\\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}\\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}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\n\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\\\"\\n\\n#line 4 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate<typename T> struct compress {\\n vector<T> raws;\\n compress(const vector<T> &raws_ = {}) : raws(raws_){ build(); }\\n int id(const T &raw){ return lb(raw); }\\n T raw(const int &id){ return raws[id]; }\\n void build(){ uniq(raws); }\\n void add(const T &raw){ raws.push_back(raw); }\\n size_t size(){ return raws.size(); }\\n int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }\\n int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }\\n bool contains(const T &raw){\\n int jd = lb(raw);\\n if (jd < (int)size()) return raws[jd] == raw;\\n return false;\\n }\\n int contains_id(const T &raw){\\n int jd = lb(raw);\\n if (jd < (int)size() && raws[jd] == raw) return jd;\\n return -1;\\n }\\n};\\n\\n} // namespace noya2\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n segtree(const std::vector<S>& v) : _n(int(v.size())) {\\n log = 0;\\n size = 1;\\n while (size < _n) size <<= 1, log++;\\n\\n d = std::vector<S>(2 * size, e());\\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 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 return d[p + size];\\n }\\n\\n S prod(int l, int r) {\\n assert(0 <= l && l <= r && r <= _n);\\n S sml = e(), smr = e();\\n l += size;\\n r += size;\\n\\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 return op(sml, smr);\\n }\\n\\n S all_prod() { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) {\\n assert(0 <= l && l <= _n);\\n assert(f(e()));\\n if (l == _n) return _n;\\n l += size;\\n S sm = e();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!f(op(sm, d[l]))) {\\n while (l < size) {\\n l = (2 * l);\\n if (f(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 (*f)(S)> int min_left(int r) {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) {\\n assert(0 <= r && r <= _n);\\n assert(f(e()));\\n if (r == 0) return 0;\\n r += size;\\n S sm = e();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!f(op(d[r], sm))) {\\n while (r < size) {\\n r = (2 * r + 1);\\n if (f(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\\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\\n};\\n\\n} // namespace noya2\\n#line 7 \\\"c.cpp\\\"\\n\\n\\nnamespace noya2 {\\n\\ntemplate<class S, S(*op)(S, S), S(*e)(), typename Idx = ll>\\nstruct range_tree {\\n using DS = segtree<S,op,e>;\\n using T = int;\\n void join(Idx x, Idx y){ ps.emplace_back(x,y); }\\n void build(){\\n for (auto &[x, y] : ps) xs.add(x);\\n xs.build();\\n //siz = bit_ceil(xs.size());\\n siz = 1; while (siz < (int)(xs.size())) siz <<= 1;\\n ys.resize(siz*2);\\n for (auto &[x, y] : ps){\\n int xid = xs.id(x) + siz;\\n ys[xid].add(y);\\n while (xid > 1){\\n xid >>= 1;\\n ys[xid].add(y);\\n }\\n }\\n for (int i = 0; i < 2*siz; i++){\\n ys[i].build();\\n ds.emplace_back(ys[i].size());\\n }\\n }\\n void set(Idx p, Idx q, T val){\\n int i = xs.id(p) + siz;\\n ds[i].set(ys[i].id(q),val);\\n while (i > 1){\\n i >>= 1;\\n T lr = e();\\n int i0 = ys[2*i+0].contains_id(q), i1 = ys[2*i+1].contains_id(q);\\n if (i0 != -1) lr = op(lr, ds[2*i+0].get(i0));\\n if (i1 != -1) lr = op(lr, ds[2*i+1].get(i1));\\n ds[i].set(ys[i].id(q),lr);\\n }\\n }\\n T get(Idx p, Idx q){\\n int ip = xs.contains_id(p);\\n if (ip == -1) return e();\\n int i = ip + siz;\\n int iq = ys[i].contains_id(q);\\n if (iq == -1) return e();\\n return ds[i].get(iq);\\n }\\n T prod(Idx lp, Idx rp, Idx lq, Idx rq){\\n T res = e();\\n int li = xs.lb(lp), ri = xs.lb(rp);\\n for (li += siz, ri += siz; li < ri; li >>= 1, ri >>= 1){\\n if (li & 1) res = op(res,ds[li].prod(ys[li].lb(lq),ys[li].lb(rq))), ++li;\\n if (ri & 1) --ri, res = op(res,ds[ri].prod(ys[ri].lb(lq),ys[ri].lb(rq)));\\n }\\n return res;\\n }\\n int siz;\\n vector<pair<Idx,Idx>> ps;\\n compress<Idx> xs;\\n vector<compress<Idx>> ys;\\n vector<DS> ds;\\n};\\n\\n} // namespace noya2\\n\\nint op(int a, int b){\\n return max(a,b);\\n}\\nint e(){\\n return -iinf;\\n}\\n\\nvoid solve(){\\n int n; in(n);\\n vector<int> a(n), b(n);\\n rep(i,n) in(a[i],b[i]);\\n vector<int> ids(n); iota(all(ids),0);\\n sort(all(ids),[&](int l, int r){\\n return a[l]+b[l] < a[r]+b[r];\\n });\\n range_tree<int,op,e,int> rt0, rt1;\\n rep(i,n){\\n rep(tt,2){\\n rt0.join(a[i],b[i]);\\n rt1.join(a[i],b[i]);\\n swap(a[i],b[i]);\\n }\\n }\\n rt0.build();\\n rt1.build();\\n int ans = 1;\\n for (int i : ids){\\n // out(i,a[i],b[i]);\\n rep(tt,2){\\n int d0 = max(rt0.prod(0,a[i],0,b[i]),0);\\n rt1.set(a[i],b[i],d0+1);\\n int d1 = max(rt1.prod(0,a[i],0,b[i]),-1);\\n rt0.set(a[i],b[i],d1+1);\\n swap(a[i],b[i]);\\n chmax(ans,d0+1);\\n chmax(ans,d1+1);\\n }\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 1140,\n \"memory_kb\": 120352,\n \"score_of_the_acc\": -1.5737,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2814_9117950\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#define REP(i, n) for(ll i = 0;i < n;i++)\\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\\n#define ll long long\\n#define INF (ll)1ll << 60\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(),n.end()\\n#define MOD (ll)1000000007\\n#define P pair<ll, ll>\\n\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\nusing V = ll;\\nV comp(V& l, V& r) { return max(l, r); };\\nstruct SegTree { //[l,r)\\n int NV;\\n vector<V> val;\\n void init(int n) {\\n NV = 1;\\n while (NV < n) NV *= 2;\\n val = vector<V>(NV * 2, 0);\\n }\\n V get(int x, int y, int l, int r, int k) {\\n if (r <= x || y <= l) return 0;\\n if (x <= l && r <= y) return val[k];\\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\\n }\\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\\n void add(int i, V v) { update(i, val[i + NV] + v); }\\n V operator[](int x) { return get(x, x + 1); }\\n};\\n \\nstruct Healthy2DSegTree {\\n int NV;\\n vector<SegTree> st;\\n vector<vector<int>> index;\\n \\n void init(vector<vector<int>> &v) {\\n int n = v.size();\\n NV = 1; while (NV < n) NV *= 2;\\n index.resize(2 * NV);\\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\\n rrep(i, NV * 2 - 1, 1) {\\n sort(index[i].begin(), index[i].end());\\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\\n fore(j, index[i]) index[i / 2].push_back(j);\\n }\\n st.resize(2 * NV);\\n rep(i, 1, NV * 2) st[i].init(index[i].size());\\n }\\n void update(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].update(yy, v);\\n x >>= 1;\\n }\\n }\\n void add(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].add(yy, v);\\n x >>= 1;\\n }\\n }\\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\\n assert(k < NV * 2);\\n assert(l < r);\\n if (r <= sx or tx <= l) return 0;\\n if (sx <= l and r <= tx) {\\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\\n return st[k].get(syy, tyy);\\n }\\n int md = (l + r) / 2;\\n V le = get(sx, tx, sy, ty, k * 2, l, md);\\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\\n return comp(le, ri);\\n }\\n V get(int sx, int tx, int sy, int ty) {\\n return get(sx, tx, sy, ty, 1, 0, NV);\\n }\\n};\\n\\nmap<ll, ll> fr, to;\\nHealthy2DSegTree st;\\nvector<P> s, v;\\nll n, ans;\\nint main(){\\n cin >> n;\\n vector<vector<int>> ind(310000);\\n REP(i, n){\\n ll a, b;\\n cin >> a >> b;\\n s.push_back(P(a, b));\\n }\\n sort(ALL(s));\\n s.erase(unique(ALL(s)), s.end());\\n n = s.size();\\n REP(i, n){\\n\\n v.push_back(P(s[i].first + s[i].second, i));\\n fr[s[i].first]++;\\n fr[ s[i].second]++;\\n }\\n ll cnt = 0;\\n for (auto& i : fr) {\\n i.second = cnt;\\n to[cnt] = i.first;\\n cnt++;\\n }\\n sort(ALL(v));\\n REP(i, n){\\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\\n }\\n st.init(ind);\\n REP(i, n){\\n //cout << s[v[i].second].first << \\\" \\\" << s[v[i].second].second << \\\" \\\" << fr[s[v[i].second].first] <<\\\" \\\" << fr[s[v[i].second].second] << \\\" \\\" << v[i].second << endl;\\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\\n ans = max(ans, x);\\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.2972972972972973,\n \"time_ms\": 680,\n \"memory_kb\": 201916,\n \"score_of_the_acc\": -1.5747,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2814_9117942\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#define REP(i, n) for(ll i = 0;i < n;i++)\\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\\n#define ll long long\\n#define INF (ll)1ll << 60\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(),n.end()\\n#define MOD (ll)1000000007\\n#define P pair<ll, ll>\\n\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\nusing V = ll;\\nV comp(V& l, V& r) { return max(l, r); };\\nstruct SegTree { //[l,r)\\n int NV;\\n vector<V> val;\\n void init(int n) {\\n NV = 1;\\n while (NV < n) NV *= 2;\\n val = vector<V>(NV * 2, 0);\\n }\\n V get(int x, int y, int l, int r, int k) {\\n if (r <= x || y <= l) return 0;\\n if (x <= l && r <= y) return val[k];\\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\\n }\\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\\n void add(int i, V v) { update(i, val[i + NV] + v); }\\n V operator[](int x) { return get(x, x + 1); }\\n};\\n \\nstruct Healthy2DSegTree {\\n int NV;\\n vector<SegTree> st;\\n vector<vector<int>> index;\\n \\n void init(vector<vector<int>> &v) {\\n int n = v.size();\\n NV = 1; while (NV < n) NV *= 2;\\n index.resize(2 * NV);\\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\\n rrep(i, NV * 2 - 1, 1) {\\n sort(index[i].begin(), index[i].end());\\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\\n fore(j, index[i]) index[i / 2].push_back(j);\\n }\\n st.resize(2 * NV);\\n rep(i, 1, NV * 2) st[i].init(index[i].size());\\n }\\n void update(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].update(yy, v);\\n x >>= 1;\\n }\\n }\\n void add(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].add(yy, v);\\n x >>= 1;\\n }\\n }\\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\\n assert(k < NV * 2);\\n assert(l < r);\\n if (r <= sx or tx <= l) return 0;\\n if (sx <= l and r <= tx) {\\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\\n return st[k].get(syy, tyy);\\n }\\n int md = (l + r) / 2;\\n V le = get(sx, tx, sy, ty, k * 2, l, md);\\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\\n return comp(le, ri);\\n }\\n V get(int sx, int tx, int sy, int ty) {\\n return get(sx, tx, sy, ty, 1, 0, NV);\\n }\\n};\\n\\nmap<ll, ll> fr, to;\\nHealthy2DSegTree st;\\nvector<P> s, v;\\nll n, ans;\\nint main(){\\n cin >> n;\\n vector<vector<int>> ind(310000);\\n REP(i, n){\\n ll a, b;\\n cin >> a >> b;\\n s.push_back(P(a, b));\\n }\\n sort(ALL(s));\\n s.erase(unique(ALL(s)), s.end());\\n n = s.size();\\n REP(i, n){\\n\\n v.push_back(P(s[i].first + s[i].second, i));\\n fr[s[i].first]++;\\n fr[ s[i].second]++;\\n }\\n fr[0]++;\\n ll cnt = 0;\\n for (auto& i : fr) {\\n i.second = cnt;\\n to[cnt] = i.first;\\n cnt++;\\n }\\n sort(ALL(v));\\n REP(i, n){\\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\\n }\\n st.init(ind);\\n REP(i, n){\\n //cout << s[v[i].second].first << \\\" \\\" << s[v[i].second].second << \\\" \\\" << fr[s[v[i].second].first] <<\\\" \\\" << fr[s[v[i].second].second] << \\\" \\\" << v[i].second << endl;\\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\\n ans = max(ans, x);\\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 360,\n \"memory_kb\": 162168,\n \"score_of_the_acc\": -1.084,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2814_9117905\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#define REP(i, n) for(ll i = 0;i < n;i++)\\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\\n#define ll long long\\n#define INF (ll)1ll << 60\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(),n.end()\\n#define MOD (ll)1000000007\\n#define P pair<ll, ll>\\n\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\nusing V = ll;\\nV comp(V& l, V& r) { return max(l, r); };\\nstruct SegTree { //[l,r)\\n int NV;\\n vector<V> val;\\n void init(int n) {\\n NV = 1;\\n while (NV < n) NV *= 2;\\n val = vector<V>(NV * 2, 0);\\n }\\n V get(int x, int y, int l, int r, int k) {\\n if (r <= x || y <= l) return 0;\\n if (x <= l && r <= y) return val[k];\\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\\n }\\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\\n void add(int i, V v) { update(i, val[i + NV] + v); }\\n V operator[](int x) { return get(x, x + 1); }\\n};\\n \\nstruct Healthy2DSegTree {\\n int NV;\\n vector<SegTree> st;\\n vector<vector<int>> index;\\n \\n void init(vector<vector<int>> &v) {\\n int n = v.size();\\n NV = 1; while (NV < n) NV *= 2;\\n index.resize(2 * NV);\\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\\n rrep(i, NV * 2 - 1, 1) {\\n sort(index[i].begin(), index[i].end());\\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\\n fore(j, index[i]) index[i / 2].push_back(j);\\n }\\n st.resize(2 * NV);\\n rep(i, 1, NV * 2) st[i].init(index[i].size());\\n }\\n void update(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].update(yy, v);\\n x >>= 1;\\n }\\n }\\n void add(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].add(yy, v);\\n x >>= 1;\\n }\\n }\\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\\n assert(k < NV * 2);\\n assert(l < r);\\n if (r <= sx or tx <= l) return 0;\\n if (sx <= l and r <= tx) {\\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\\n return st[k].get(syy, tyy);\\n }\\n int md = (l + r) / 2;\\n V le = get(sx, tx, sy, ty, k * 2, l, md);\\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\\n return comp(le, ri);\\n }\\n V get(int sx, int tx, int sy, int ty) {\\n return get(sx, tx, sy, ty, 1, 0, NV);\\n }\\n};\\n\\nmap<ll, ll> fr, to;\\nHealthy2DSegTree st;\\nvector<P> s, v;\\nll n, ans;\\nint main(){\\n cin >> n;\\n vector<vector<int>> ind(310000);\\n REP(i, n){\\n ll a, b;\\n cin >> a >> b;\\n s.push_back(P(a, b));\\n v.push_back(P(a + b, i));\\n fr[a]++;\\n fr[b]++;\\n }\\n ll cnt = 1;\\n for (auto& i : fr) {\\n i.second = cnt;\\n to[cnt] = i.first;\\n cnt++;\\n }\\n sort(ALL(v));\\n REP(i, n){\\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\\n }\\n st.init(ind);\\n REP(i, n){\\n //cout << s[v[i].second].first << \\\" \\\" << s[v[i].second].second << \\\" \\\" << fr[s[v[i].second].first] <<\\\" \\\" << fr[s[v[i].second].second] << \\\" \\\" << v[i].second << endl;\\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\\n ans = max(ans, x);\\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 380,\n \"memory_kb\": 162136,\n \"score_of_the_acc\": -1.1018,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2814_9117854\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#define REP(i, n) for(ll i = 0;i < n;i++)\\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\\n#define ll long long\\n#define INF (ll)1ll << 60\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(),n.end()\\n#define MOD (ll)1000000007\\n#define P pair<ll, ll>\\n\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\nusing V = ll;\\nV comp(V& l, V& r) { return max(l, r); };\\nstruct SegTree { //[l,r)\\n int NV;\\n vector<V> val;\\n void init(int n) {\\n NV = 1;\\n while (NV < n) NV *= 2;\\n val = vector<V>(NV * 2, 0);\\n }\\n V get(int x, int y, int l, int r, int k) {\\n if (r <= x || y <= l) return 0;\\n if (x <= l && r <= y) return val[k];\\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\\n }\\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\\n void add(int i, V v) { update(i, val[i + NV] + v); }\\n V operator[](int x) { return get(x, x + 1); }\\n};\\n \\nstruct Healthy2DSegTree {\\n int NV;\\n vector<SegTree> st;\\n vector<vector<int>> index;\\n \\n void init(vector<vector<int>> &v) {\\n int n = v.size();\\n NV = 1; while (NV < n) NV *= 2;\\n index.resize(2 * NV);\\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\\n rrep(i, NV * 2 - 1, 1) {\\n sort(index[i].begin(), index[i].end());\\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\\n fore(j, index[i]) index[i / 2].push_back(j);\\n }\\n st.resize(2 * NV);\\n rep(i, 1, NV * 2) st[i].init(index[i].size());\\n }\\n void update(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].update(yy, v);\\n x >>= 1;\\n }\\n }\\n void add(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].add(yy, v);\\n x >>= 1;\\n }\\n }\\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\\n assert(k < NV * 2);\\n assert(l < r);\\n if (r <= sx or tx <= l) return 0;\\n if (sx <= l and r <= tx) {\\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\\n return st[k].get(syy, tyy);\\n }\\n int md = (l + r) / 2;\\n V le = get(sx, tx, sy, ty, k * 2, l, md);\\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\\n return comp(le, ri);\\n }\\n V get(int sx, int tx, int sy, int ty) {\\n return get(sx, tx, sy, ty, 1, 0, NV);\\n }\\n};\\n\\nmap<ll, ll> fr, to;\\nHealthy2DSegTree st;\\nvector<P> s, v;\\nll n, ans;\\nint main(){\\n cin >> n;\\n vector<vector<int>> ind(410000);\\n REP(i, n){\\n ll a, b;\\n cin >> a >> b;\\n s.push_back(P(a, b));\\n v.push_back(P(a + b, i));\\n fr[a]++;\\n fr[b]++;\\n }\\n ll cnt = 1;\\n for (auto& i : fr) {\\n i.second = cnt;\\n to[cnt] = i.first;\\n cnt++;\\n }\\n sort(ALL(v));\\n REP(i, n){\\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\\n }\\n st.init(ind);\\n REP(i, n){\\n //cout << s[v[i].second].first << \\\" \\\" << s[v[i].second].second << \\\" \\\" << fr[s[v[i].second].first] <<\\\" \\\" << fr[s[v[i].second].second] << \\\" \\\" << v[i].second << endl;\\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\\n ans = max(ans, x);\\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 370,\n \"memory_kb\": 164508,\n \"score_of_the_acc\": -1.1049,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2814_9117819\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#define REP(i, n) for(ll i = 0;i < n;i++)\\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\\n#define ll long long\\n#define INF (ll)1ll << 60\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(),n.end()\\n#define MOD (ll)1000000007\\n#define P pair<ll, ll>\\n\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\nusing V = ll;\\nV comp(V& l, V& r) { return max(l, r); };\\nstruct SegTree { //[l,r)\\n int NV;\\n vector<V> val;\\n void init(int n) {\\n NV = 1;\\n while (NV < n) NV *= 2;\\n val = vector<V>(NV * 2, 0);\\n }\\n V get(int x, int y, int l, int r, int k) {\\n if (r <= x || y <= l) return 0;\\n if (x <= l && r <= y) return val[k];\\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\\n }\\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\\n void add(int i, V v) { update(i, val[i + NV] + v); }\\n V operator[](int x) { return get(x, x + 1); }\\n};\\n \\nstruct Healthy2DSegTree {\\n int NV;\\n vector<SegTree> st;\\n vector<vector<int>> index;\\n \\n void init(vector<vector<int>> &v) {\\n int n = v.size();\\n NV = 1; while (NV < n) NV *= 2;\\n index.resize(2 * NV);\\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\\n rrep(i, NV * 2 - 1, 1) {\\n sort(index[i].begin(), index[i].end());\\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\\n fore(j, index[i]) index[i / 2].push_back(j);\\n }\\n st.resize(2 * NV);\\n rep(i, 1, NV * 2) st[i].init(index[i].size());\\n }\\n void update(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].update(yy, v);\\n x >>= 1;\\n }\\n }\\n void add(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].add(yy, v);\\n x >>= 1;\\n }\\n }\\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\\n assert(k < NV * 2);\\n assert(l < r);\\n if (r <= sx or tx <= l) return 0;\\n if (sx <= l and r <= tx) {\\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\\n return st[k].get(syy, tyy);\\n }\\n int md = (l + r) / 2;\\n V le = get(sx, tx, sy, ty, k * 2, l, md);\\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\\n return comp(le, ri);\\n }\\n V get(int sx, int tx, int sy, int ty) {\\n return get(sx, tx, sy, ty, 1, 0, NV);\\n }\\n};\\n\\nmap<ll, ll> fr, to;\\nHealthy2DSegTree st;\\nvector<P> s, v;\\nll n, ans;\\nint main(){\\n cin >> n;\\n vector<vector<int>> ind(310000);\\n REP(i, n){\\n ll a, b;\\n cin >> a >> b;\\n s.push_back(P(a, b));\\n v.push_back(P(a + b, i));\\n fr[a]++;\\n fr[b]++;\\n }\\n ll cnt = 0;\\n for (auto& i : fr) {\\n i.second = cnt;\\n to[cnt] = i.first;\\n cnt++;\\n }\\n sort(ALL(v));\\n REP(i, n){\\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\\n }\\n st.init(ind);\\n REP(i, n){\\n //cout << s[v[i].second].first << \\\" \\\" << s[v[i].second].second << \\\" \\\" << fr[s[v[i].second].first] <<\\\" \\\" << fr[s[v[i].second].second] << \\\" \\\" << v[i].second << endl;\\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\\n ans = max(ans, x);\\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.2972972972972973,\n \"time_ms\": 700,\n \"memory_kb\": 201960,\n \"score_of_the_acc\": -1.593,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2814_9117815\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#define REP(i, n) for(ll i = 0;i < n;i++)\\n#define REPR(i, n) for(ll i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(ll i = m;i < n;i++)\\n#define FORR(i, m, n) for(ll i = m;i >= n;i--)\\n#define REPO(i, n) for(ll i = 1;i <= n;i++)\\n#define ll long long\\n#define INF (ll)1ll << 60\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(),n.end()\\n#define MOD (ll)1000000007\\n#define P pair<ll, ll>\\n\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\nusing V = ll;\\nV comp(V& l, V& r) { return max(l, r); };\\nstruct SegTree { //[l,r)\\n int NV;\\n vector<V> val;\\n void init(int n) {\\n NV = 1;\\n while (NV < n) NV *= 2;\\n val = vector<V>(NV * 2, 0);\\n }\\n V get(int x, int y, int l, int r, int k) {\\n if (r <= x || y <= l) return 0;\\n if (x <= l && r <= y) return val[k];\\n auto a = get(x, y, l, (l + r) / 2, k * 2); auto b = get(x, y, (l + r) / 2, r, k * 2 + 1); return comp(a, b);\\n }\\n V get(int x, int y) { return get(x, y, 0, NV, 1); }\\n void update(int i, V v) { i += NV; val[i] = v; while (i>1)i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]); }\\n void add(int i, V v) { update(i, val[i + NV] + v); }\\n V operator[](int x) { return get(x, x + 1); }\\n};\\n \\nstruct Healthy2DSegTree {\\n int NV;\\n vector<SegTree> st;\\n vector<vector<int>> index;\\n \\n void init(vector<vector<int>> &v) {\\n int n = v.size();\\n NV = 1; while (NV < n) NV *= 2;\\n index.resize(2 * NV);\\n rep(i, 0, n) fore(j, v[i]) index[i + NV].push_back(j);\\n rrep(i, NV * 2 - 1, 1) {\\n sort(index[i].begin(), index[i].end());\\n index[i].erase(unique(index[i].begin(), index[i].end()), index[i].end());\\n fore(j, index[i]) index[i / 2].push_back(j);\\n }\\n st.resize(2 * NV);\\n rep(i, 1, NV * 2) st[i].init(index[i].size());\\n }\\n void update(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].update(yy, v);\\n x >>= 1;\\n }\\n }\\n void add(int x, int y, V v) {\\n assert(x < NV);\\n x += NV;\\n while (x) {\\n int yy = lower_bound(index[x].begin(), index[x].end(), y) - index[x].begin();\\n assert(yy != index[x].size());\\n assert(y == index[x][yy]);\\n st[x].add(yy, v);\\n x >>= 1;\\n }\\n }\\n V get(int sx, int tx, int sy, int ty, int k, int l, int r) {\\n assert(k < NV * 2);\\n assert(l < r);\\n if (r <= sx or tx <= l) return 0;\\n if (sx <= l and r <= tx) {\\n int syy = lower_bound(index[k].begin(), index[k].end(), sy) - index[k].begin();\\n int tyy = lower_bound(index[k].begin(), index[k].end(), ty) - index[k].begin();\\n return st[k].get(syy, tyy);\\n }\\n int md = (l + r) / 2;\\n V le = get(sx, tx, sy, ty, k * 2, l, md);\\n V ri = get(sx, tx, sy, ty, k * 2 + 1, md, r);\\n return comp(le, ri);\\n }\\n V get(int sx, int tx, int sy, int ty) {\\n return get(sx, tx, sy, ty, 1, 0, NV);\\n }\\n};\\n\\nmap<ll, ll> fr, to;\\nHealthy2DSegTree st;\\nvector<P> s, v;\\nll n, ans;\\nint main(){\\n cin >> n;\\n vector<vector<int>> ind(110000);\\n REP(i, n){\\n ll a, b;\\n cin >> a >> b;\\n s.push_back(P(a, b));\\n v.push_back(P(a + b, i));\\n fr[a]++;\\n fr[b]++;\\n }\\n ll cnt = 0;\\n for (auto& i : fr) {\\n i.second = cnt;\\n to[cnt] = i.first;\\n cnt++;\\n }\\n sort(ALL(v));\\n REP(i, n){\\n ind[fr[s[i].first]].push_back(fr[s[i].second]);\\n ind[fr[s[i].second]].push_back(fr[s[i].first]);\\n }\\n st.init(ind);\\n REP(i, n){\\n //cout << s[v[i].second].first << \\\" \\\" << s[v[i].second].second << \\\" \\\" << fr[s[v[i].second].first] <<\\\" \\\" << fr[s[v[i].second].second] << \\\" \\\" << v[i].second << endl;\\n ll x = st.get(0, fr[s[v[i].second].first], 0, fr[s[v[i].second].second]) + 1;\\n ans = max(ans, x);\\n st.add(fr[s[v[i].second].second], fr[s[v[i].second].first], x);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.2972972972972973,\n \"time_ms\": 310,\n \"memory_kb\": 84912,\n \"score_of_the_acc\": -0.6454,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2814_5967500\",\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\\\";}\\ntemplate <typename T>\\nstruct ST{//1index query l,r lが開区間\\n using F = function<T(T,T)>;\\n int n;\\n F f;\\n T ti;\\n vector<T> dat;\\n ST(){};\\n ST(F f,T ti):f(f),ti(ti){}\\n void init(int n_){ \\n n=1;\\n while(n<n_) n<<=1;\\n dat.assign(n<<1,ti);\\n }\\n void build(const vector<T> &v){\\n int n_=v.size();\\n init(n_);\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n void set_val(int k,T x){//kは0-index\\n dat[k+=n]=x;\\n while(k>>=1)\\n dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]); \\n }\\n T query(int a,int b){\\n T vl=ti,vr=ti;\\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};\\nstruct dat{\\n ll a,b,id;\\n dat(ll a,ll b,ll id):a(a),b(b),id(id){}\\n};\\nint main(){\\n int n;\\n cin >> n;\\n V<int> A(n),B(n);\\n map<int,int> mp;\\n V<dat> d;\\n for(int i=0;i<n;i++){\\n cin >> A[i] >> B[i];\\n mp[A[i]];mp[B[i]];\\n d.emplace_back(A[i],B[i],0ll);\\n d.emplace_back(B[i],A[i],1ll);\\n }\\n sort(all(d),[](auto a,auto b){\\n if(a.a!=b.a)return a.a<b.a;\\n return a.b<b.b;\\n });\\n int num=0;\\n for(auto &p:mp){\\n p.se=num++;\\n }\\n auto f=[&](ll a,ll b){\\n return max(a,b);\\n };\\n ST<ll> dp1(f,0),dp2(f,0);\\n dp1.init(num+5);\\n dp2.init(num+5);\\n V<dat> tmp;\\n int bfo=-1;\\n for(int i=0;i<2*n;i++){\\n auto [a,b,id]=d[i];\\n if(bfo!=a){\\n for(auto [ind,v,id]:tmp){\\n if(id==0){\\n dp2.set_val(ind,v);\\n }else{\\n dp1.set_val(ind,v); \\n }\\n }\\n tmp.clear();\\n bfo=a;\\n }\\n if(id==0){\\n ll v=dp1.query(0,mp[b])+1;\\n ll u=dp2.query(mp[b],mp[b]+1);\\n tmp.emplace_back(mp[b],max(v,u),0);\\n }else{\\n ll v=dp2.query(0,mp[b])+1;\\n ll u=dp1.query(mp[b],mp[b]+1);\\n tmp.emplace_back(mp[b],max(v,u),1); \\n }\\n }\\n for(auto [ind,v,id]:tmp){\\n if(id==0){\\n dp2.set_val(ind,v);\\n }else{\\n dp1.set_val(ind,v); \\n }\\n }\\n cout<<max(dp1.query(0,num+5),dp2.query(0,num+5))<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 27368,\n \"score_of_the_acc\": -0.2621,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2814_5967477\",\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\\\";}\\ntemplate <typename T>\\nstruct ST{//1index query l,r lが開区間\\n using F = function<T(T,T)>;\\n int n;\\n F f;\\n T ti;\\n vector<T> dat;\\n ST(){};\\n ST(F f,T ti):f(f),ti(ti){}\\n void init(int n_){ \\n n=1;\\n while(n<n_) n<<=1;\\n dat.assign(n<<1,ti);\\n }\\n void build(const vector<T> &v){\\n int n_=v.size();\\n init(n_);\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n void set_val(int k,T x){//kは0-index\\n dat[k+=n]=x;\\n while(k>>=1)\\n dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]); \\n }\\n T query(int a,int b){\\n T vl=ti,vr=ti;\\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};\\nstruct dat{\\n ll a,b,id;\\n dat(ll a,ll b,ll id):a(a),b(b),id(id){}\\n};\\nint main(){\\n int n;\\n cin >> n;\\n V<int> A(n),B(n);\\n map<int,int> mp;\\n V<dat> d;\\n for(int i=0;i<n;i++){\\n cin >> A[i] >> B[i];\\n mp[A[i]];mp[B[i]];\\n d.emplace_back(A[i],B[i],0ll);\\n d.emplace_back(B[i],A[i],1ll);\\n }\\n sort(all(d),[](auto a,auto b){\\n if(a.a!=b.a)return a.a<b.a;\\n return a.b<b.b;\\n });\\n int num=0;\\n for(auto &p:mp){\\n p.se=num++;\\n }\\n auto f=[&](ll a,ll b){\\n return max(a,b);\\n };\\n ST<ll> dp1(f,0),dp2(f,0);\\n dp1.init(num+5);\\n dp2.init(num+5);\\n for(int i=0;i<2*n;i++){\\n auto [a,b,id]=d[i];\\n if(id==0){\\n ll v=dp1.query(0,mp[b])+1;\\n ll u=dp2.query(mp[b],mp[b]+1);\\n dp2.set_val(mp[b],max(v,u));\\n }else{\\n ll v=dp2.query(0,mp[b])+1;\\n ll u=dp1.query(mp[b],mp[b]+1);\\n dp1.set_val(mp[b],max(v,u)); \\n }\\n }\\n cout<<max(dp1.query(0,num+5),dp2.query(0,num+5))<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 100,\n \"memory_kb\": 18624,\n \"score_of_the_acc\": -0.1185,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2814_5967369\",\n \"code_snippet\": \"//#pragma GCC optimize(\\\"Ofast\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n\\n//#include <atcoder/modint>\\nusing namespace std;\\n//using namespace atcoder;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing pii = pair<int, int>;\\ntemplate <class T>\\nusing V = vector<T>;\\ntemplate <class T>\\nusing VV = V<V<T>>;\\ntemplate <class T>\\nV<T> make_vec(size_t a) {\\n return V<T>(a);\\n}\\ntemplate <class T, class... Ts>\\nauto make_vec(size_t a, Ts... ts) {\\n return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\\n}\\n\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define fi first\\n#define se second\\n#define rep(i, n) rep2(i, 0, n)\\n#define rep2(i, m, n) for (int i = m; i < (n); i++)\\n#define per(i, b) per2(i, 0, b)\\n#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)\\n#define ALL(c) (c).begin(), (c).end()\\n#define SZ(x) ((int)(x).size())\\n#define all(x) x.begin(),x.end()\\n\\nconstexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }\\n\\ntemplate <class T, class U>\\nvoid chmin(T& t, const U& u) {\\n if (t > u) t = u;\\n}\\ntemplate <class T, class U>\\nvoid chmax(T& t, const U& u) {\\n if (t < u) t = u;\\n}\\n\\ntemplate <class T, class U>\\nostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"{\\\";\\n rep(i, v.size()) {\\n if (i) os << \\\",\\\";\\n os << v[i];\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n#ifdef LOCAL\\nvoid debug_out() { cerr << endl; }\\ntemplate <typename Head, typename... Tail>\\nvoid 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\\nconstexpr int INF = TEN(9);\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int N;\\n cin >> N;\\n int M=2*N;\\n int A[N],B[N];\\n rep(i,N) cin >> A[i] >> B[i];\\n set<int> apr;\\n rep(i,N) apr.insert(A[i]),apr.insert(B[i]);\\n vector<int> res;\\n for(auto e:apr) res.push_back(e);\\n rep(i,N){\\n A[i]=lower_bound(all(res),A[i])-res.begin();\\n B[i]=lower_bound(all(res),B[i])-res.begin();\\n A[i]++;\\n B[i]++;\\n }\\n V<pii> vec;\\n rep(i, N) {\\n vec.push_back(mp(A[i], -B[i]));\\n vec.push_back(mp(B[i],-A[i]));\\n }\\n sort(ALL(vec));\\n V<int> dp(M + 1, INF);\\n dp[0] = 0;\\n\\n for (auto& [a, b] : vec) {\\n auto it = lower_bound(ALL(dp), -b);\\n *it = -b;\\n }\\n cout << lower_bound(ALL(dp), INF) - dp.begin() - 1 << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 40,\n \"memory_kb\": 11276,\n \"score_of_the_acc\": -0.027,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2814_3992941\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\nconst ll INF = 1LL << 60;\\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<pair<int, int>>v(N);\\n\\tvector<pair<int, int>>w(N);\\n\\tfor (auto &i : v)cin >> i.first >> i.second;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tw[i] = { v[i].second,v[i].first };\\n\\t}\\n\\tsort(v.begin(), v.end());\\n\\tsort(w.begin(), w.end());\\n\\tint vindex = 0, windex = 0;\\n\\tvector<int>vused(N + 2);\\n\\tvector<int>wused(N + 2);\\n\\tset<pair<int, pair<int, int>>>vyoyaku;\\n\\tset<pair<int, pair<int, int>>>wyoyaku;\\n\\tset<pair<int, int>>vkouho;\\n\\tset<pair<int, int>>wkouho;\\n\\tvkouho.insert({ 0,1 });\\n\\tint ans = 0;\\n\\twhile (vindex < N || windex < N) {\\n\\t\\t//cout << vindex << \\\" \\\" << windex << endl;\\n\\t\\tint nx = 0;\\n\\t\\tif (vindex == N)nx = 1;\\n\\t\\telse if (windex<N&&v[vindex].first>w[windex].first)nx = 1;\\n\\t\\t//cout << vindex << \\\" \\\" << windex << \\\" \\\" << nx << endl;\\n\\t\\tif (nx == 0) {// use v\\n\\t\\t\\t\\t\\t //\\tcout << \\\"vvvvvv\\\" << endl;\\n\\t\\t\\twhile (!vyoyaku.empty() && vyoyaku.begin()->first <= v[vindex].first) {\\n\\t\\t\\t\\tauto box = vyoyaku.begin()->second;\\n\\t\\t\\t\\tvyoyaku.erase(vyoyaku.begin());\\n\\n\\t\\t\\t\\tif (vused[box.second]) {\\n\\t\\t\\t\\t\\tif (vused[box.second]>box.first) {\\n\\t\\t\\t\\t\\t\\tvkouho.insert(box);\\n\\t\\t\\t\\t\\t\\tvkouho.erase({ vused[box.second],box.second });\\n\\t\\t\\t\\t\\t\\tvused[box.second] = box.first;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tauto it = vkouho.find(box);\\n\\t\\t\\t\\t\\twhile (it != vkouho.begin() && prev(it)->first >= box.first) {\\n\\t\\t\\t\\t\\t\\tvused[prev(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\tvkouho.erase(prev(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tauto nx = vkouho.lower_bound(box);\\n\\t\\t\\t\\t\\tif (nx != vkouho.begin() && prev(nx)->second >= box.second)continue;\\n\\t\\t\\t\\t\\tvkouho.insert(box);\\n\\t\\t\\t\\t\\tauto it = vkouho.find(box);\\n\\t\\t\\t\\t\\twhile (next(it) != vkouho.end() && next(it)->second <= box.second) {\\n\\t\\t\\t\\t\\t\\tvused[next(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\tvkouho.erase(next(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tauto it = vkouho.lower_bound({ v[vindex].second,MOD });\\n\\t\\t\\tif (it == vkouho.begin()) {\\n\\t\\t\\t\\tvindex++;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tit = prev(it);\\n\\t\\t\\tint score = it->second;\\n\\t\\t\\t//\\tcout << v[vindex].first << \\\" \\\" << v[vindex].second << \\\" \\\" << score << endl;\\n\\t\\t\\tans = max(ans, score);\\n\\t\\t\\twyoyaku.insert({ v[vindex].first+1,{ v[vindex].second + 1,score + 1 } });\\n\\t\\t\\tvindex++;\\n\\t\\t}\\n\\t\\telse {//use w\\n\\t\\t\\t //cout << w[windex].first << \\\" \\\" << wyoyaku.size() << endl;\\n\\t\\t\\twhile (!wyoyaku.empty() && wyoyaku.begin()->first <= w[windex].first) {\\n\\t\\t\\t\\tauto box = wyoyaku.begin()->second;\\n\\t\\t\\t\\twyoyaku.erase(wyoyaku.begin());\\n\\n\\t\\t\\t\\tif (wused[box.second]) {\\n\\t\\t\\t\\t\\tif (wused[box.second]>box.first) {\\n\\t\\t\\t\\t\\t\\twkouho.insert(box);\\n\\t\\t\\t\\t\\t\\twkouho.erase({ wused[box.second],box.second });\\n\\t\\t\\t\\t\\t\\twused[box.second] = box.first;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tauto it = wkouho.find(box);\\n\\t\\t\\t\\t\\twhile (it != wkouho.begin() && prev(it)->first >= box.first) {\\n\\t\\t\\t\\t\\t\\twused[prev(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\twkouho.erase(prev(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tauto nx = wkouho.lower_bound(box);\\n\\t\\t\\t\\t\\tif (nx != wkouho.begin() && prev(nx)->second >= box.second)continue;\\n\\t\\t\\t\\t\\twkouho.insert(box);\\n\\t\\t\\t\\t\\tauto it = wkouho.find(box);\\n\\t\\t\\t\\t\\twhile (next(it) != wkouho.end() && next(it)->second <= box.second) {\\n\\t\\t\\t\\t\\t\\twused[next(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\twkouho.erase(next(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\t//\\tcout << \\\"hihihh\\\" << endl;\\n\\t\\t\\t//\\tcout <<\\\"wwwwww \\\"<< w[windex].first << \\\" \\\" << w[windex].second << \\\" \\\" << wkouho.size() << endl;\\n\\t\\t\\tauto it = wkouho.lower_bound({ w[windex].second,MOD });\\n\\t\\t\\tif (it == wkouho.begin()) {\\n\\t\\t\\t\\twindex++;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tit = prev(it);\\n\\t\\t\\tint score = it->second;\\n\\t\\t\\t//\\tcout << w[windex].first << \\\" \\\" << w[windex].second << \\\" \\\" << score << endl;\\n\\t\\t\\tans = max(ans, score);\\n\\t\\t\\tvyoyaku.insert({ w[windex].first+1,{ w[windex].second + 1,score + 1 } });\\n\\t\\t\\twindex++;\\n\\t\\t}\\n\\n\\n\\t}\\n\\tcout << ans << endl;\\n\\t//cin >> N;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 9876,\n \"score_of_the_acc\": -0.0739,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2814_3991770\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\nconst ll INF = 1LL << 60;\\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<pair<int, int>>v(N);\\n\\tvector<pair<int, int>>w(N);\\n\\tfor (auto &i : v)cin >> i.first >> i.second;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tw[i] = { v[i].second,v[i].first };\\n\\t}\\n\\tsort(v.begin(), v.end());\\n\\tsort(w.begin(), w.end());\\n\\tint vindex = 0, windex = 0;\\n\\tvector<int>vused(N + 2);\\n\\tvector<int>wused(N + 2);\\n\\tset<pair<int, pair<int, int>>>vyoyaku;\\n\\tset<pair<int, pair<int, int>>>wyoyaku;\\n\\tset<pair<int, int>>vkouho;\\n\\tset<pair<int, int>>wkouho;\\n\\tvkouho.insert({ 0,1 });\\n\\tint ans = 0;\\n\\twhile (vindex < N || windex < N) {\\n\\t\\t//cout << vindex << \\\" \\\" << windex << endl;\\n\\t\\tint nx = 0;\\n\\t\\tif (vindex == N)nx = 1;\\n\\t\\telse if (windex<N&&v[vindex].first>w[windex].first)nx = 1;\\n\\t\\t//cout << vindex << \\\" \\\" << windex << \\\" \\\" << nx << endl;\\n\\t\\tif (nx == 0) {// use v\\n\\t\\t\\t\\t\\t //\\tcout << \\\"vvvvvv\\\" << endl;\\n\\t\\t\\twhile (!vyoyaku.empty() && vyoyaku.begin()->first <= v[vindex].first) {\\n\\t\\t\\t\\tauto box = vyoyaku.begin()->second;\\n\\t\\t\\t\\tvyoyaku.erase(vyoyaku.begin());\\n\\n\\t\\t\\t\\tif (vused[box.second]) {\\n\\t\\t\\t\\t\\tif (vused[box.second]>box.first) {\\n\\t\\t\\t\\t\\t\\tvkouho.insert(box);\\n\\t\\t\\t\\t\\t\\tvkouho.erase({ vused[box.second],box.second });\\n\\t\\t\\t\\t\\t\\tvused[box.second] = box.first;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tauto it = vkouho.find(box);\\n\\t\\t\\t\\t\\twhile (it != vkouho.begin() && prev(it)->first >= box.first) {\\n\\t\\t\\t\\t\\t\\tvused[prev(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\tvkouho.erase(prev(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tauto nx = vkouho.lower_bound(box);\\n\\t\\t\\t\\t\\tif (nx != vkouho.begin() && prev(nx)->second >= box.second)continue;\\n\\t\\t\\t\\t\\tvkouho.insert(box);\\n\\t\\t\\t\\t\\tauto it = vkouho.find(box);\\n\\t\\t\\t\\t\\twhile (next(it) != vkouho.end() && next(it)->second <= box.second) {\\n\\t\\t\\t\\t\\t\\tvused[next(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\tvkouho.erase(next(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tauto it = vkouho.lower_bound({ v[vindex].second,MOD });\\n\\t\\t\\tif (it == vkouho.begin()) {\\n\\t\\t\\t\\tvindex++;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tit = prev(it);\\n\\t\\t\\tint score = it->second;\\n\\t\\t\\t//\\tcout << v[vindex].first << \\\" \\\" << v[vindex].second << \\\" \\\" << score << endl;\\n\\t\\t\\tans = max(ans, score);\\n\\t\\t\\twyoyaku.insert({ v[vindex].first+1,{ v[vindex].second + 1,score + 1 } });\\n\\t\\t\\tvindex++;\\n\\t\\t}\\n\\t\\telse {//use w\\n\\t\\t\\t //cout << w[windex].first << \\\" \\\" << wyoyaku.size() << endl;\\n\\t\\t\\twhile (!wyoyaku.empty() && wyoyaku.begin()->first <= w[windex].first) {\\n\\t\\t\\t\\tauto box = wyoyaku.begin()->second;\\n\\t\\t\\t\\twyoyaku.erase(wyoyaku.begin());\\n\\n\\t\\t\\t\\tif (wused[box.second]) {\\n\\t\\t\\t\\t\\tif (wused[box.second]>box.first) {\\n\\t\\t\\t\\t\\t\\twkouho.insert(box);\\n\\t\\t\\t\\t\\t\\twkouho.erase({ wused[box.second],box.second });\\n\\t\\t\\t\\t\\t\\twused[box.second] = box.first;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tauto it = wkouho.find(box);\\n\\t\\t\\t\\t\\twhile (it != wkouho.begin() && prev(it)->first >= box.first) {\\n\\t\\t\\t\\t\\t\\twused[prev(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\twkouho.erase(prev(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tauto nx = wkouho.lower_bound(box);\\n\\t\\t\\t\\t\\tif (nx != wkouho.begin() && prev(nx)->second >= box.second)continue;\\n\\t\\t\\t\\t\\twkouho.insert(box);\\n\\t\\t\\t\\t\\tauto it = wkouho.find(box);\\n\\t\\t\\t\\t\\twhile (next(it) != wkouho.end() && next(it)->second <= box.second) {\\n\\t\\t\\t\\t\\t\\twused[next(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\twkouho.erase(next(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\t//\\tcout << \\\"hihihh\\\" << endl;\\n\\t\\t\\t//\\tcout <<\\\"wwwwww \\\"<< w[windex].first << \\\" \\\" << w[windex].second << \\\" \\\" << wkouho.size() << endl;\\n\\t\\t\\tauto it = wkouho.lower_bound({ w[windex].second,MOD });\\n\\t\\t\\tif (it == wkouho.begin()) {\\n\\t\\t\\t\\twindex++;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tit = prev(it);\\n\\t\\t\\tint score = it->second;\\n\\t\\t\\t//\\tcout << w[windex].first << \\\" \\\" << w[windex].second << \\\" \\\" << score << endl;\\n\\t\\t\\tans = max(ans, score);\\n\\t\\t\\tvyoyaku.insert({ w[windex].first+1,{ w[windex].second + 1,score + 1 } });\\n\\t\\t\\twindex++;\\n\\t\\t}\\n\\n\\n\\t}\\n\\tcout << ans << endl;\\n\\t//cin >> N;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 9872,\n \"score_of_the_acc\": -0.0739,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2814_3991748\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\nconst ll INF = 1LL << 60;\\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\\n\\nint main() {\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<pair<int, int>>v(N);\\n\\tvector<pair<int, int>>w(N);\\n\\tfor (auto &i : v)cin >> i.first >> i.second;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tw[i] = { v[i].second,v[i].first };\\n\\t}\\n\\tsort(v.begin(), v.end());\\n\\tsort(w.begin(), w.end());\\n\\tint vindex = 0, windex = 0;\\n\\tvector<int>vused(N + 2);\\n\\tvector<int>wused(N + 2);\\n\\tset<pair<int, pair<int, int>>>vyoyaku;\\n\\tset<pair<int, pair<int, int>>>wyoyaku;\\n\\tset<pair<int, int>>vkouho;\\n\\tset<pair<int, int>>wkouho;\\n\\tvkouho.insert({ 0,1 });\\n\\tint ans = 0;\\n\\twhile (vindex < N || windex < N) {\\n\\t\\t//cout << vindex << \\\" \\\" << windex << endl;\\n\\t\\tint nx = 0;\\n\\t\\tif (vindex == N)nx = 1;\\n\\t\\telse if (windex<N&&v[vindex].first>w[windex].first)nx = 1;\\n\\t\\t//cout << vindex << \\\" \\\" << windex << \\\" \\\" << nx << endl;\\n\\t\\tif (nx == 0) {// use v\\n\\t\\t//\\tcout << \\\"vvvvvv\\\" << endl;\\n\\t\\t\\twhile (!vyoyaku.empty() && vyoyaku.begin()->first <= v[vindex].first) {\\n\\t\\t\\t\\tauto box = vyoyaku.begin()->second;\\n\\t\\t\\t\\tvyoyaku.erase(vyoyaku.begin());\\n\\n\\t\\t\\t\\tif (vused[box.second]) {\\n\\t\\t\\t\\t\\tif (vused[box.second]>box.first) {\\n\\t\\t\\t\\t\\t\\tvkouho.insert(box);\\n\\t\\t\\t\\t\\t\\tvkouho.erase({ vused[box.second],box.second });\\n\\t\\t\\t\\t\\t\\tvused[box.second] = box.first;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tauto it = vkouho.find(box);\\n\\t\\t\\t\\t\\twhile (it != vkouho.begin() && prev(it)->first >= box.first) {\\n\\t\\t\\t\\t\\t\\tvused[prev(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\tvkouho.erase(prev(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tauto nx = vkouho.lower_bound(box);\\n\\t\\t\\t\\t\\tif (nx != vkouho.begin() && prev(nx)->second >= box.second)continue;\\n\\t\\t\\t\\t\\tvkouho.insert(box);\\n\\t\\t\\t\\t\\tauto it = vkouho.find(box);\\n\\t\\t\\t\\t\\twhile (next(it) != vkouho.end() && next(it)->second <= box.second) {\\n\\t\\t\\t\\t\\t\\tvused[next(it) -> second] = 0;\\n\\t\\t\\t\\t\\t\\tvkouho.erase(next(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tauto it = vkouho.lower_bound({ v[vindex].second,MOD });\\n\\t\\t\\tif (it == vkouho.begin()) {\\n\\t\\t\\t\\tvindex++;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tit = prev(it);\\n\\t\\t\\tint score = it->second;\\n\\t\\t//\\tcout << v[vindex].first << \\\" \\\" << v[vindex].second << \\\" \\\" << score << endl;\\n\\t\\t\\tans = max(ans, score);\\n\\t\\t\\twyoyaku.insert({ v[vindex].first,{v[vindex].second + 1,score + 1} });\\n\\t\\t\\tvindex++;\\n\\t\\t}\\n\\t\\telse {//use w\\n\\t\\t\\t//cout << w[windex].first << \\\" \\\" << wyoyaku.size() << endl;\\n\\t\\t\\twhile (!wyoyaku.empty() && wyoyaku.begin()->first <= w[windex].first) {\\n\\t\\t\\t\\tauto box = wyoyaku.begin()->second;\\n\\t\\t\\t\\twyoyaku.erase(wyoyaku.begin());\\n\\n\\t\\t\\t\\tif (wused[box.second]) {\\n\\t\\t\\t\\t\\tif (wused[box.second]>box.first) {\\n\\t\\t\\t\\t\\t\\twkouho.insert(box);\\n\\t\\t\\t\\t\\t\\twkouho.erase({ wused[box.second],box.second });\\n\\t\\t\\t\\t\\t\\twused[box.second] = box.first;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tauto it = wkouho.find(box);\\n\\t\\t\\t\\t\\twhile (it != wkouho.begin() && prev(it)->first >= box.first) {\\n\\t\\t\\t\\t\\t\\twused[prev(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\twkouho.erase(prev(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tauto nx = wkouho.lower_bound(box);\\n\\t\\t\\t\\t\\tif (nx != wkouho.begin() && prev(nx)->second >= box.second)continue;\\n\\t\\t\\t\\t\\twkouho.insert(box);\\n\\t\\t\\t\\t\\tauto it = wkouho.find(box);\\n\\t\\t\\t\\t\\twhile (next(it) != wkouho.end() && next(it)->second <= box.second) {\\n\\t\\t\\t\\t\\t\\twused[next(it)->second] = 0;\\n\\t\\t\\t\\t\\t\\twkouho.erase(next(it));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t//\\tcout << \\\"hihihh\\\" << endl;\\n\\t\\t//\\tcout <<\\\"wwwwww \\\"<< w[windex].first << \\\" \\\" << w[windex].second << \\\" \\\" << wkouho.size() << endl;\\n\\t\\t\\tauto it = wkouho.lower_bound({ w[windex].second,MOD });\\n\\t\\t\\tif (it == wkouho.begin()) {\\n\\t\\t\\t\\twindex++;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tit = prev(it);\\n\\t\\t\\tint score = it->second;\\n\\t\\t//\\tcout << w[windex].first << \\\" \\\" << w[windex].second << \\\" \\\" << score << endl;\\n\\t\\t\\tans = max(ans, score);\\n\\t\\t\\tvyoyaku.insert({ w[windex].first,{ w[windex].second + 1,score + 1 } });\\n\\t\\t\\twindex++;\\n\\t\\t}\\n\\n\\n\\t}\\n\\tcout << ans << endl;\\n\\t//cin >> N;\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 80,\n \"memory_kb\": 9884,\n \"score_of_the_acc\": -0.0559,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2814_2868844\",\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 MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct Info{\\n\\tInfo(int arg_a,int arg_b,bool arg_is_reverse){\\n\\t\\ta = arg_a;\\n\\t\\tb = arg_b;\\n\\t\\tis_reverse = arg_is_reverse;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\t\\tif(a != arg.a){\\n\\t\\t\\treturn a < arg.a;\\n\\t\\t}else{\\n\\t\\t\\treturn b > arg.b;\\n\\t\\t}\\n\\t}\\n\\tint a,b;\\n\\tbool is_reverse;\\n};\\n\\nint dp[200001];\\n\\nint main(){\\n\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint a,b;\\n\\tvector<Info> V;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%d %d\\\",&a,&b);\\n\\t\\tV.push_back(Info(a,b,false));\\n\\t\\tV.push_back(Info(b,a,true));\\n\\t}\\n\\n\\tsort(V.begin(),V.end());\\n\\n\\tfor(int i = 0; i < 2*N; i++)dp[i] = BIG_NUM;\\n\\tint left,right,m,loc;\\n\\n\\tfor(int i = 0; i < 2*N; i++){\\n\\t\\tleft = 0,right = i,m = (left+right)/2;\\n\\t\\tloc = BIG_NUM;\\n\\t\\twhile(left <= right){\\n\\t\\t\\tif(dp[m] >= V[i].b){\\n\\t\\t\\t\\tloc = m;\\n\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t}\\n\\t\\t\\tm = (left+right)/2;\\n\\t\\t}\\n\\t\\tif(loc == BIG_NUM)continue;\\n\\t\\tif(V[i].is_reverse == true && loc%2 == 0){\\n\\t\\t\\tdp[loc] = V[i].b;\\n\\t\\t}else if(V[i].is_reverse == false && loc%2 == 1){\\n\\t\\t\\tdp[loc] = V[i].b;\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0;\\n\\tleft = 0,right = 2*N-1,m = (left+right)/2;\\n\\n\\twhile(left <= right){\\n\\t\\tif(dp[m] == BIG_NUM){\\n\\t\\t\\tans = m;\\n\\t\\t\\tright = m-1;\\n\\t\\t}else{\\n\\t\\t\\tleft = m+1;\\n\\t\\t}\\n\\t\\tm = (left+right)/2;\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6200,\n \"score_of_the_acc\": -0.0011,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2814_2595109\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\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 all(c) c.begin(),c.end()\\n#define pb push_back\\n#define fs first\\n#define sc second\\n#define show(x) cout << #x << \\\" = \\\" << x << endl\\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\nusing namespace std;\\ntemplate<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<\\\"(\\\"<<p.fs<<\\\",\\\"<<p.sc<<\\\")\\\";}\\ntemplate<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<\\\"sz = \\\"<<vc.size()<<endl<<\\\"[\\\";for(const T& v:vc) o<<v<<\\\",\\\";o<<\\\"]\\\";return o;}\\n\\nint inf=1e9;\\nstruct segtree{\\n\\tstatic const int N=1<<18;\\n\\tint seg[N*2];\\n\\tsegtree(){\\n\\t\\trep(i,N*2) seg[i]=0;\\n\\t}\\n\\tsegtree(vector<int>& vi){\\n\\t\\trep(i,N*2) seg[i]=0;\\n\\t\\trep(i,vi.size()) seg[N+i]=vi[i];\\n\\t\\tfor(int i=N-1;i>0;i--) seg[i]=max(seg[i*2],seg[i*2+1]);\\n\\t}\\n\\n\\n\\tvoid update(int x,int v){\\n\\t\\tx+=N;\\n\\t\\tchmax(seg[x],v);\\n\\t\\tx/=2;\\n\\t\\twhile(x){\\n\\t\\t\\tseg[x]=max(seg[x*2],seg[x*2+1]);\\n\\t\\t\\tx/=2;\\n\\t\\t}\\n\\t}\\n\\tint getmax(int a,int b,int l=0,int r=N,int k=1){\\n\\t\\tif(b<=l||r<=a) return 0;\\n\\t\\tif(a<=l&&r<=b) return seg[k];\\n\\t\\treturn max(getmax(a,b,l,(l+r)/2,k*2),getmax(a,b,(l+r)/2,r,k*2+1));\\n\\t}\\n}seg[2];\\n\\nvector<int> xs;\\nconst int MN=100000;\\ntypedef pair<int,int> P;\\ntypedef pair<P,int> PP;\\nint a[MN],b[MN],c[MN];\\nint main(){\\n\\tint N;\\n\\tcin>>N;\\n\\tvector<PP> vp;\\n\\trep(i,N) cin>>a[i]>>b[i];\\n\\trep(i,N) xs.pb(a[i]),xs.pb(b[i]);\\n\\tsort(all(xs));\\n\\txs.erase(unique(xs.begin(),xs.end()),xs.end());\\n\\trep(i,N) a[i]=lower_bound(all(xs),a[i])-xs.begin(),b[i]=lower_bound(all(xs),b[i])-xs.begin();\\n\\trep(i,N){\\n\\t\\tvp.pb(PP(P(a[i],-b[i]),0));\\n\\t\\tvp.pb(PP(P(b[i],-a[i]),1));\\n\\t}\\n\\tsort(all(vp));\\n\\n\\tint K = xs.size();\\n\\tint ans=0;\\n\\n\\tvector<P> upd[2];\\n\\trep(i,N*2){\\n\\t\\tPP pp=vp[i];\\n\\t\\tint x = pp.fs.fs,y=-pp.fs.sc,c=pp.sc;\\n\\t\\tint mx = seg[c].getmax(0,y)+1;\\n\\t\\tchmax(ans,mx);\\n//\\t\\tseg[1-c].update(y,mx);\\n\\t\\tupd[1-c].pb(P(y,mx));\\n\\t\\tif(i==N*2-1 || x!=vp[i+1].fs.fs){\\n\\t\\t\\trep(t,2){\\n\\t\\t\\t\\tfor(P p:upd[t]) seg[t].update(p.fs,p.sc);\\n\\t\\t\\t\\tupd[t].clear();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 13520,\n \"score_of_the_acc\": -0.1195,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2814_2330127\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, const pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\nconst int INF = 1e9+100;\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n int N; cin >> N;\\n using MA = pair<PII,int>;\\n vector<MA> xs(N*2);\\n REP(i,N){\\n\\tcin >> xs[i].FF;\\n\\txs[N+i] = MP(MP(xs[i].FF.SS, xs[i].FF.FF), 1);\\n }\\n sort(ALL(xs), [](const MA& l, const MA& r){\\n\\t return\\n\\t\\tl.FF.FF != r.FF.FF ?\\n\\t\\tl.FF.FF < r.FF.FF :\\n\\t\\tl.FF.SS > r.FF.SS;\\n\\t});\\n\\n VI dp(N*2, INF);\\n REP(i,N*2){\\n\\tint ix = lower_bound(ALL(dp), xs[i].FF.SS) - begin(dp);\\n\\tif(xs[i].SS != ix%2){\\n\\t if(ix == 0)\\n\\t\\tcontinue;\\n\\t --ix;\\n\\t}\\n\\tmini(dp[ix], xs[i].FF.SS);\\n }\\n\\n cout << (lower_bound(ALL(dp), INF) - begin(dp)) << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5976,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1699,"cells":{"group_id":{"kind":"string","value":"aoj_2815_cpp"},"problem_description":{"kind":"string","value":"K: AOR イカちゃんの成績\n問題\nAOR イカちゃんは $N$ 回のレポートの点数のみで成績が決まる授業を受けている。\n\n AOR イカちゃんは同じ授業を受けている友達が $M$ 人いて、自分が苦手なテーマのレポートは、そのテーマが得意な友達のレポートを写すことで、その友達と同じ点数を取ることができる。\n\nただし、他人のレポートを写していることを先生に気付かれてはいけないので、 $N$ 回のうち少なくとも $K$ 回は他人のレポートを写さず、自力でレポートを仕上げなくてはならない。\nまた、 AOR イカちゃんは友達に迷惑をかけたくないと思ったので友達 $i$ に対してレポートを写すのは $T_i$ 回以下にすることにした。\n\n AOR イカちゃんが自力でレポートを仕上げたときの点数と、友達がレポートを仕上げた時の点数が与えられたときに、 AOR イカちゃんが取ることのできる合計点数の最大値を答えよ。\n制約\n$1 \\le N \\le 100$\n$0 \\le M \\le 100$\n$0 \\le K \\le N$\n$0 \\le a_i \\le 100$\n$0 \\le b_{ij} \\le 100$\n$0 \\le T_i \\le N$\n入力\n入力は以下の形式で標準入力から与えられる。\n$N \\ M \\ K$\n$a_1 \\ \\cdots \\ a_N$\n$b_{11} \\ \\cdots \\ b_{1N}$\n$\\vdots$\n$b_{M1} \\ \\cdots \\ b_{MN}$\n$T_1 \\ \\cdots \\ T_M$\n$a_i$ はAORイカちゃんが $i$ 番目のレポートを仕上げた時の点数を、$b_{ij}$ は友達 $i$ が $j$ 番目のレポートを仕上げた時の点数を表す。\n出力\nAOR イカちゃんが取ることのできる合計点数の最大値を出力せよ。また、末尾に改行も出力せよ。\nサンプル\n入力例 1\n3 2 2\n50 65 70\n80 100 80\n90 65 45\n1 1\n出力例 1\n225\nAOR イカちゃんは 1 回だけ他人のレポートを写すことができるので、友達 2 の 1 つめのレポートを写すことで、 AOR イカちゃんは最高点数を取ることができる。\n入力例 2\n3 0 3\n0 0 0\n出力例 2\n0\nAOR イカちゃんには友達がいないため、レポートを写すことはできない。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2815_5147669","code_snippet":"#line 1 \"test/aizu-online-judge/2815.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/2815\"\n\n#include <iostream>\n\n#line 2 \"src/graph/directed/flow/min_cost_flow.hpp\"\n\n/**\n * @file min_cost_flow.hpp\n * @brief Minimum Cost Flow\n * @date 2021-01-15\n *\n *\n */\n\n#include <algorithm>\n#include <optional>\n#include <queue>\n\n#line 2 \"src/graph/directed/flow/base.hpp\"\n\n/**\n * @file base.hpp\n * @brief Flow Graph\n * @date 2021-01-15\n *\n *\n */\n\n#include <cassert>\n#include <numeric>\n#include <vector>\n\nnamespace workspace {\n\ntemplate <class Cap, class Cost = void> class flow_graph {\n protected:\n class adjacency_impl;\n\n public:\n using container_type = std::vector<adjacency_impl>;\n using size_type = typename container_type::size_type;\n\n class unweighted_edge {\n public:\n size_type src, dst;\n Cap cap;\n\n unweighted_edge() = default;\n\n unweighted_edge(size_type src, size_type dst, const Cap &cap)\n : src(src), dst(dst), cap(cap) {\n assert(!(cap < static_cast<Cap>(0)));\n }\n\n template <class Os>\n friend Os &operator<<(Os &__os, unweighted_edge const &__e) {\n return __os << __e.src << \" \" << __e.dst << \" \" << __e.cap;\n }\n\n protected:\n unweighted_edge make_rev() { return {dst, src, 0}; }\n };\n\n class weighted_edge : public unweighted_edge {\n public:\n Cost cost;\n\n weighted_edge() = default;\n\n weighted_edge(size_type src, size_type dst, const Cap &cap,\n const Cost &cost)\n : unweighted_edge(src, dst, cap), cost(cost) {}\n\n template <class Os>\n friend Os &operator<<(Os &__os, weighted_edge const &__e) {\n return __os << static_cast<unweighted_edge>(__e) << \" \" << __e.cost;\n }\n\n protected:\n weighted_edge make_rev() {\n return {unweighted_edge::dst, unweighted_edge::src, 0, -cost};\n }\n };\n\n using edge = typename std::conditional<std::is_void<Cost>::value,\n unweighted_edge, weighted_edge>::type;\n\n protected:\n struct edge_impl : edge {\n bool aux = false;\n edge_impl *rev = nullptr;\n\n edge_impl() = default;\n\n edge_impl(const edge_impl &__e) = default;\n\n edge_impl(const edge &__e) : edge(__e) {}\n\n void flow(const Cap &f) { edge::cap -= f, rev->cap += f; }\n\n edge_impl rev_cp() {\n edge_impl __e;\n if (rev)\n __e = *rev;\n else {\n __e = edge::make_rev();\n __e.aux = true;\n }\n __e.rev = this;\n return __e;\n }\n };\n\n public:\n class adjacency {\n public:\n using value_type = edge;\n using reference = edge &;\n using const_reference = edge const &;\n using pointer = edge *;\n using const_pointer = const edge *;\n\n class const_iterator {\n public:\n const edge_impl *__p;\n\n bool operator!=(const_iterator const &__x) const {\n return __p != __x.__p;\n }\n\n const_iterator &operator++() {\n do\n ++__p;\n while (__p->rev && __p->aux);\n return *this;\n }\n\n const_pointer operator->() const { return __p; }\n\n const_reference operator*() const { return *__p; }\n };\n\n adjacency()\n : first(new edge_impl[2]), last(first + 1), __s(first), __t(first) {}\n\n ~adjacency() { delete[] first; }\n\n const_reference operator[](size_type i) const {\n assert(i < size());\n return *(first + i);\n }\n\n size_type size() const { return __t - first; }\n\n auto begin() const { return const_iterator{__s}; }\n auto end() const { return const_iterator{__t}; }\n\n /**\n * @brief Construct a new adjacency object\n *\n * @param __x Rvalue reference to another object\n */\n adjacency(adjacency &&__x) : first(nullptr) { operator=(std::move(__x)); }\n\n /**\n * @brief Assignment operator.\n *\n * @param __x Rvalue reference to another object\n * @return Reference to this object.\n */\n adjacency &operator=(adjacency &&__x) {\n std::swap(first, __x.first);\n last = __x.last;\n __s = __x.__s;\n __t = __x.__t;\n return *this;\n }\n\n protected:\n edge_impl *first, *last, *__s, *__t;\n };\n\n using value_type = adjacency;\n using reference = adjacency &;\n using const_reference = adjacency const &;\n\n protected:\n class adjacency_impl : public adjacency {\n public:\n using base = adjacency;\n using base::__s;\n using base::__t;\n using base::first;\n using base::last;\n\n template <class... Args> auto emplace(Args &&... args) {\n if (__t == last) {\n size_type __n(last - first);\n edge_impl *loc = new edge_impl[__n << 1 | 1];\n __s += loc - first;\n __t = loc;\n for (edge_impl *__p{first}; __p != last; ++__p, ++__t)\n __p->rev->rev = __t, *__t = *__p;\n delete[] first;\n first = loc;\n last = __t + __n;\n }\n *__t = edge_impl(args...);\n if (__s->aux) ++__s;\n return __t++;\n }\n\n using iterator = edge_impl *;\n auto begin() const { return first; }\n auto end() const { return __t; }\n };\n\n public:\n /**\n * @brief Construct a new flow graph object\n *\n * @param __n Number of vertices\n */\n flow_graph(size_type __n = 0) : graph(__n) {}\n\n /**\n * @brief Construct a new flow graph object\n *\n * @param __x Const reference to another object\n */\n flow_graph(const flow_graph &__x) : graph(__x.size()) {\n for (auto &&__adj : __x)\n for (auto &&__e : __adj) _add_edge(__e);\n }\n\n /**\n * @brief Assignment operator.\n *\n * @param __x Rvalue reference to another object\n * @return Reference to this object.\n */\n flow_graph &operator=(flow_graph &&__x) {\n graph.swap(__x.graph);\n return *this;\n }\n\n /**\n * @return Number of nodes.\n */\n size_type size() const { return graph.size(); }\n\n reference operator[](size_type node) {\n assert(node < size());\n return graph[node];\n }\n\n const_reference &operator[](size_type node) const {\n assert(node < size());\n return graph[node];\n }\n\n class const_iterator : public container_type::const_iterator {\n public:\n using base = typename container_type::const_iterator;\n using const_reference = const adjacency &;\n using const_pointer = const adjacency *;\n\n const_iterator(base const &__i) : base(__i) {}\n\n const_pointer operator->() const { return base::operator->(); }\n\n const_reference operator*() const { return base::operator*(); }\n };\n\n auto begin() const { return const_iterator{graph.begin()}; }\n auto end() const { return const_iterator{graph.end()}; }\n\n size_type add_node() { return add_nodes(1).front(); }\n\n virtual std::vector<size_type> add_nodes(size_type __n) {\n std::vector<size_type> __nds(__n);\n std::iota(__nds.begin(), __nds.end(), graph.size());\n __n += graph.size();\n if (__n > graph.capacity()) {\n flow_graph __x(__n);\n for (auto &&adj : graph)\n for (auto &&__e : adj)\n if (!__e.aux) __x._add_edge(__e);\n graph.swap(__x.graph);\n } else\n graph.resize(__n);\n return __nds;\n }\n\n template <class... Args> const edge &add_edge(Args &&... args) {\n return *_add_edge(edge(args...));\n }\n\n protected:\n template <class... Args> edge_impl *_add_edge(Args &&... args) {\n edge_impl __e(args...);\n assert(__e.src < size());\n assert(__e.dst < size());\n auto __p = graph[__e.src].emplace(__e);\n __p->rev = graph[__e.dst].emplace(__p->rev_cp());\n return __p;\n }\n\n constexpr static size_type nil = -1;\n container_type graph;\n\n template <class Os> friend Os &operator<<(Os &__os, flow_graph const &__g) {\n for (const auto &adj : __g)\n for (const auto &e : adj) __os << e << \"\\n\";\n return __os;\n }\n};\n\n} // namespace workspace\n#line 16 \"src/graph/directed/flow/min_cost_flow.hpp\"\n\nnamespace workspace {\n\n/**\n * @brief Successive Shortest Path Algorithm.\n *\n * @tparam Cap Capacity type\n * @tparam Cost Cost type\n * @tparam Density_tag Whether the graph is dense.\n */\ntemplate <class Cap, class Cost = Cap, bool Density_tag = false>\nclass min_cost_flow : public flow_graph<Cap, Cost> {\n using base = flow_graph<Cap, Cost>;\n using edge_impl = typename base::edge_impl;\n using base::nil;\n\n public:\n using size_type = typename base::size_type;\n using base::size;\n\n /**\n * @brief Construct a new min_cost_flow object\n *\n * @param __n Number of vertices\n */\n min_cost_flow(size_type __n = 0)\n : base::flow_graph(__n), current(0), abs_sum(0), b(__n), p(__n) {}\n\n std::vector<size_type> add_nodes(size_type __n) override {\n auto __nds = base::add_nodes(__n);\n b.resize(size());\n p.resize(size());\n return __nds;\n }\n\n /**\n * @brief Add an edge with a unit capacity to the graph.\n *\n * @param src Source\n * @param dst Destination\n * @param cost Cost\n * @return Reference to the edge.\n */\n auto &add_edge(size_type src, size_type dst, const Cost &cost) {\n return add_edge(src, dst, 1, cost);\n }\n\n /**\n * @brief Add an edge to the graph.\n *\n * @param src Source\n * @param dst Destination\n * @param cap Capacity\n * @param cost Cost\n * @return Reference to the edge.\n */\n typename base::edge const &add_edge(size_type src, size_type dst,\n const Cap &cap, const Cost &cost) {\n edge_impl *__p = base::_add_edge(typename base::edge(src, dst, cap, cost));\n if (cost < static_cast<Cost>(0)) {\n __p->flow(cap);\n b[src] -= cap;\n b[dst] += cap;\n current += cap * cost;\n abs_sum -= cap * cost;\n } else\n abs_sum += cap * cost;\n return *__p;\n }\n\n /**\n * @brief Add an edge to the graph.\n *\n * @param src Source\n * @param dst Destination\n * @param lower Lower bound of flow\n * @param upper Upper bound of flow\n * @param cost Cost\n * @return Reference to the edge.\n */\n auto &add_edge(size_type src, size_type dst, const Cap &lower,\n const Cap &upper, const Cost &cost) {\n assert(!(upper < lower));\n b[src] -= lower;\n b[dst] += lower;\n current += lower * cost;\n return add_edge(src, dst, upper - lower, cost);\n }\n\n /**\n * @brief Increase the balance of a node.\n *\n * @param node\n * @param vol Default: 1\n */\n void supply(size_type node, const Cap &vol = 1) {\n assert(node < size());\n b[node] += vol;\n }\n\n /**\n * @brief Decrease the balance of a node.\n *\n * @param node\n * @param vol Default: 1\n */\n void demand(size_type node, const Cap &vol = 1) {\n assert(node < size());\n b[node] -= vol;\n }\n\n /**\n * @param node\n * @return Balance of the node\n */\n Cap balance(size_type node) { return b[node]; }\n\n /**\n * @return Cost of current flow.\n */\n Cost cost() const { return current; }\n\n /**\n * @brief Run Successive Shortest Path Algorithm.\n *\n * @return Whether a balanced flow exists.\n */\n bool flow() {\n for (bool aug = true; aug;) {\n aug = false;\n std::vector<edge_impl *> last(size());\n Dijkstra(last);\n std::vector<bool> shut(size());\n for (size_type dst{}; dst != size(); ++dst) {\n if (b[dst] < static_cast<Cap>(0) && last[dst]) {\n Cap resid{-b[dst]};\n size_type 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 < b[src])) resid = b[block = src];\n for (edge_impl *e{last[dst]}; e; e = last[e->src]) {\n e->cap -= resid;\n e->rev->cap += resid;\n }\n b[src] -= resid;\n b[dst] += resid;\n current += p[dst] * resid;\n aug = true;\n }\n if (block != nil)\n for (size_type node{dst};; node = last[node]->src) {\n shut[node] = true;\n if (node == block) break;\n }\n }\n }\n }\n return std::none_of(begin(b), end(b), [](const Cap &s) {\n return s < static_cast<Cap>(0) || static_cast<Cap>(0) < s;\n });\n }\n\n protected:\n Cost current, abs_sum;\n std::vector<Cap> b;\n std::vector<Cost> p;\n\n void Dijkstra(std::vector<edge_impl *> &last) {\n const Cost infty(abs_sum + 1);\n std::vector<Cost> newp(size(), infty);\n\n if constexpr (Density_tag) { // O(V^2)\n std::vector<bool> used(size());\n\n for (size_type src{}; src != size(); ++src)\n if (static_cast<Cap>(0) < b[src]) {\n used[src] = true;\n newp[src] = 0;\n\n for (auto &e : base::graph[src])\n if (!(static_cast<Cap>(0) < b[e.dst]) &&\n static_cast<Cap>(0) < e.cap && newp[e.dst] > e.cost)\n newp[e.dst] = e.cost, last[e.dst] = &e;\n }\n\n for (;;) {\n size_type src{nil};\n Cost sp{infty};\n\n for (size_type node{}; node != size(); ++node) {\n if (used[node] || newp[node] == infty) continue;\n if (Cost __d = newp[node] - p[node]; __d < sp) sp = __d, src = node;\n }\n\n if (src == nil) break;\n used[src] = true;\n\n for (auto &e : base::graph[src])\n if (static_cast<Cap>(0) < e.cap && newp[src] + e.cost < newp[e.dst]) {\n newp[e.dst] = newp[src] + e.cost;\n last[e.dst] = &e;\n }\n }\n }\n\n else { // O((V + E)logV)\n struct sp_node {\n size_type id;\n Cost __d;\n sp_node(size_type id, Cost __d) : id(id), __d(__d) {}\n bool operator<(const sp_node &rhs) const { return rhs.__d < __d; }\n };\n\n std::priority_queue<sp_node> __q;\n for (size_type src{}; src != size(); ++src)\n if (b[src] > static_cast<Cap>(0)) {\n newp[src] = 0;\n for (auto &e : base::graph[src])\n if (static_cast<Cap>(0) < e.cap && newp[e.dst] > e.cost) {\n __q.emplace(e.dst, (newp[e.dst] = e.cost) - p[e.dst]);\n last[e.dst] = &e;\n }\n }\n\n while (!__q.empty()) {\n auto [src, __d] = __q.top();\n __q.pop();\n if (__d + p[src] != newp[src]) continue;\n for (auto &e : base::graph[src])\n if (auto __d = newp[src] + e.cost;\n static_cast<Cap>(0) < e.cap && __d < newp[e.dst]) {\n __q.emplace(e.dst, (newp[e.dst] = __d) - p[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n\n p.swap(newp);\n }\n};\n\ntemplate <class Cap, class Gain = Cap, bool Density_tag = false>\nclass max_gain_flow : public min_cost_flow<Cap, Gain, Density_tag> {\n using base = min_cost_flow<Cap, Gain, Density_tag>;\n using base::cost;\n\n public:\n using base::min_cost_flow;\n using size_type = typename base::size_type;\n\n /**\n * @brief Add an edge with a unit capacity to the graph.\n *\n * @param src Source\n * @param dst Destination\n * @param gain Gain\n * @return Reference to the edge.\n */\n auto &add_edge(size_type src, size_type dst, const Gain &gain) {\n return add_edge(src, dst, 1, gain);\n }\n\n /**\n * @brief Add an edge to the graph.\n *\n * @param src Source\n * @param dst Destination\n * @param cap Capacity\n * @param gain Gain\n * @return Reference to the edge.\n */\n auto &add_edge(size_type src, size_type dst, const Cap &cap,\n const Gain &gain) {\n return base::add_edge(src, dst, cap, -gain);\n }\n\n /**\n * @brief Add an edge to the graph.\n *\n * @param src Source\n * @param dst Destination\n * @param lower Lower bound of flow\n * @param upper Upper bound of flow\n * @param gain Gain\n * @return Reference to the edge.\n */\n auto &add_edge(size_type src, size_type dst, const Cap &lower,\n const Cap &upper, const Gain &gain) {\n return base::add_edge(src, dst, lower, upper, -gain);\n }\n\n /**\n * @return Gain of current flow.\n */\n Gain gain() const { return -base::current; }\n};\n\n} // namespace workspace\n#line 6 \"test/aizu-online-judge/2815.test.cpp\"\n\nint main() {\n using namespace workspace;\n\n int n, m, k;\n std::cin >> n >> m >> k;\n\n min_cost_flow<int, int, 1> mcf;\n const auto dst = mcf.add_node();\n const auto dst2 = mcf.add_node();\n const auto dst3 = mcf.add_node();\n\n mcf.demand(dst, n);\n mcf.add_edge(dst2, dst, n, 0);\n mcf.add_edge(dst3, dst, n - k, 0);\n\n const auto r = mcf.add_nodes(n);\n for (auto u : r) {\n mcf.supply(u);\n std::cin >> k;\n mcf.add_edge(u, dst2, -k);\n }\n\n const auto f = mcf.add_nodes(m);\n for (auto v : f) {\n for (auto u : r) {\n std::cin >> k;\n mcf.add_edge(u, v, -k);\n }\n }\n\n for (auto v : f) {\n std::cin >> k;\n mcf.add_edge(v, dst3, k, 0);\n }\n\n assert(mcf.flow());\n std::cout << -mcf.cost() << \"\\n\";\n}","accuracy":1,"time_ms":10,"memory_kb":4180,"score_of_the_acc":-0.645,"final_rank":7},{"submission_id":"aoj_2815_5143888","code_snippet":"#line 1 \"test/aizu-online-judge/2815.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/2815\"\n\n#include <iostream>\n\n#line 2 \"src/graph/directed/flow/min_cost_flow.hpp\"\n\n/**\n * @file min_cost_flow.hpp\n * @brief Minimum Cost Flow\n * @date 2021-01-15\n *\n *\n */\n\n#include <algorithm>\n#include <optional>\n#include <queue>\n\n#line 2 \"src/graph/directed/flow/base.hpp\"\n\n/**\n * @file base.hpp\n * @brief Flow Graph\n * @date 2021-01-15\n *\n *\n */\n\n#include <cassert>\n#include <vector>\n\nnamespace workspace {\n\ntemplate <class Cap, class Cost = void> class flow_graph {\n public:\n class adjacency;\n using value_type = adjacency;\n using reference = adjacency &;\n using const_reference = adjacency const &;\n using container_type = std::vector<value_type>;\n using size_type = typename container_type::size_type;\n\n class unweighted_edge {\n public:\n size_type src, dst;\n Cap cap;\n unweighted_edge *rev;\n\n unweighted_edge() = default;\n\n unweighted_edge(size_type src, size_type dst, const Cap &cap,\n unweighted_edge *rev)\n : src(src), dst(dst), cap(cap), rev(rev) {\n assert(!(cap < static_cast<Cap>(0)));\n }\n\n const Cap &flow(const Cap &f = 0) { return cap -= f, rev->cap += f; }\n\n unweighted_edge make_rev() { return {dst, src, 0, this}; }\n };\n\n class weighted_edge : public unweighted_edge {\n public:\n Cost cost;\n\n weighted_edge() = default;\n\n weighted_edge(size_type src, size_type dst, const Cap &cap,\n const Cost &cost, weighted_edge *rev)\n : unweighted_edge(src, dst, cap, rev), cost(cost) {}\n\n weighted_edge make_rev() {\n return {unweighted_edge::dst, unweighted_edge::src, 0, -cost, this};\n }\n };\n\n using edge = typename std::conditional<std::is_void<Cost>::value,\n unweighted_edge, weighted_edge>::type;\n\n class adjacency {\n public:\n using value_type = edge;\n using reference = edge &;\n using const_reference = edge const &;\n using pointer = edge *;\n using const_pointer = const edge *;\n\n adjacency() : first(new edge[1]), iter(first), last(first + 1) {}\n ~adjacency() { delete[] first; }\n\n template <class... Args> reference emplace(Args &&... args) {\n if (iter == last) {\n size_type len(last - first);\n edge *nfst = iter = new edge[len << 1];\n for (edge *p{first}; p != last; ++p, ++iter)\n p->rev->rev = iter, *iter = *p;\n delete[] first;\n first = nfst;\n last = iter + len;\n }\n return *iter++ = edge(args...);\n }\n\n reference operator[](size_type i) {\n assert(i < size());\n return *(first + i);\n }\n const_reference operator[](size_type i) const {\n assert(i < size());\n return *(first + i);\n }\n\n size_type size() const { return iter - first; }\n\n pointer begin() { return first; }\n const_pointer begin() const { return first; }\n\n pointer end() { return iter; }\n const_pointer end() const { return iter; }\n\n protected:\n pointer first, iter, last;\n };\n\n /**\n * @brief Construct a new flow base object\n *\n * @param n Number of vertices\n */\n flow_graph(size_type n = 0) : graph(n) {}\n\n flow_graph(const flow_graph &other) : graph(other.size()) {\n for (size_type node = 0; node != size(); ++node)\n for (edge cp : other[node])\n if (cp.src == node) {\n edge rcp = *cp.rev;\n cp.rev->src = nil;\n edge &ref = graph[node].emplace(cp);\n rcp.rev = &ref;\n ref.rev = &graph[cp.dst].emplace(rcp);\n } else\n cp.rev->rev->src = node;\n }\n\n flow_graph &operator=(const flow_graph &rhs) {\n if (this != &rhs) graph.swap(flow_graph(rhs).graph);\n return *this;\n }\n\n /**\n * @return Number of vertices.\n */\n size_type size() const { return graph.size(); }\n\n reference operator[](size_type node) {\n assert(node < size());\n return graph[node];\n }\n\n const_reference &operator[](size_type node) const {\n assert(node < size());\n return graph[node];\n }\n\n typename container_type::iterator begin() { return graph.begin(); }\n\n typename container_type::iterator end() { return graph.end(); }\n\n typename container_type::const_iterator begin() const {\n return graph.begin();\n }\n\n typename container_type::const_iterator end() const { return graph.end(); }\n\n template <class... Args>\n typename adjacency::reference add_edge(size_type src, size_type dst,\n Args &&... args) {\n assert(src < size());\n assert(dst < size());\n auto &ref = graph[src].emplace(src, dst, args..., nullptr);\n ref.rev = &graph[dst].emplace(ref.make_rev());\n return ref;\n }\n\n protected:\n constexpr static size_type nil = -1;\n container_type graph;\n};\n\n} // namespace workspace\n#line 16 \"src/graph/directed/flow/min_cost_flow.hpp\"\n\nnamespace workspace {\n\n/**\n * @brief Successive Shortest Path Algorithm.\n *\n * @tparam Cap Capacity type\n * @tparam Cost Cost type\n * @tparam Density_tag Whether the graph is dense.\n */\ntemplate <class Cap, class Cost, bool Density_tag = false>\nclass min_cost_flow : public flow_graph<Cap, Cost> {\n using base = flow_graph<Cap, Cost>;\n using base::nil;\n\n public:\n using edge = typename base::edge;\n using size_type = typename base::size_type;\n\n protected:\n Cost current, abs_sum;\n std::vector<Cap> b;\n std::vector<Cost> p;\n\n void copy(const min_cost_flow &other) {\n current = other.current;\n abs_sum = other.abs_sum;\n b = other.b;\n p = other.p;\n }\n\n void Dijkstra(std::vector<edge *> &last) {\n const Cost infty(abs_sum + 1);\n std::vector<Cost> newp(size(), infty);\n if constexpr (Density_tag) { // O(V^2)\n std::vector<bool> used(size());\n for (size_type src{}; src != size(); ++src) {\n if (static_cast<Cap>(0) < b[src]) {\n used[src] = true;\n newp[src] = 0;\n for (edge &e : base::graph[src]) {\n if (static_cast<Cap>(0) < b[e.dst]) continue;\n if (static_cast<Cap>(0) < e.cap && e.cost < newp[e.dst]) {\n newp[e.dst] = e.cost;\n last[e.dst] = &e;\n }\n }\n }\n }\n for (;;) {\n size_type src{nil};\n Cost sp{infty};\n for (size_type node{}; node != size(); ++node) {\n if (used[node] || newp[node] == infty) continue;\n Cost dist{newp[node] - p[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 &e : base::graph[src]) {\n if (static_cast<Cap>(0) < e.cap && newp[src] + e.cost < newp[e.dst]) {\n newp[e.dst] = newp[src] + e.cost;\n last[e.dst] = &e;\n }\n }\n }\n } else { // O((V + E)logV)\n struct sp_node {\n size_type id;\n Cost dist;\n sp_node(size_type id, Cost dist) : id(id), dist(dist) {}\n bool operator<(const sp_node &rhs) const { return rhs.dist < dist; }\n };\n std::priority_queue<sp_node> q;\n for (size_type src{}; src != size(); ++src)\n if (static_cast<Cap>(0) < b[src]) {\n newp[src] = 0;\n for (edge &e : base::graph[src])\n if (!(static_cast<Cap>(0) < b[e.dst]) &&\n static_cast<Cap>(0) < e.cap && newp[e.dst] > e.cost) {\n q.emplace(e.dst, (newp[e.dst] = e.cost) - p[e.dst]);\n last[e.dst] = &e;\n }\n }\n while (!q.empty()) {\n auto [src, ndist] = q.top();\n q.pop();\n if (ndist + p[src] != newp[src]) continue;\n for (edge &e : base::graph[src])\n if (static_cast<Cap>(0) < e.cap && newp[e.dst] > newp[src] + e.cost) {\n q.emplace(e.dst, (newp[e.dst] = newp[src] + e.cost) - p[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n p.swap(newp);\n }\n\n public:\n using base::size;\n\n /**\n * @brief Construct a new object\n *\n * @param n Number of vertices.\n */\n min_cost_flow(size_type n = 0)\n : base::flow_graph(n), current(0), abs_sum(0), b(n), p(n) {}\n\n min_cost_flow(const min_cost_flow &other) : base::flow_graph(other) {\n copy(other);\n }\n\n min_cost_flow &operator=(const min_cost_flow &other) {\n base::operator=(other);\n copy(other);\n return *this;\n }\n\n // infinity capatity\n // edge *add_edge(size_type src, size_type dst, const Cost &cost);\n\n /**\n * @brief Add an edge to the graph.\n *\n * @param src Source\n * @param dst Destination\n * @param cap Capacity\n * @param cost Cost\n * @return Reference to the edge.\n */\n typename base::adjacency::reference add_edge(size_type src, size_type dst,\n const Cap &cap,\n const Cost &cost) {\n assert(src != dst);\n if (cost < static_cast<Cost>(0)) {\n b[src] -= cap;\n b[dst] += cap;\n current += cap * cost;\n abs_sum -= cap * cost;\n return base::add_edge(dst, src, cap, -cost);\n }\n abs_sum += cap * cost;\n return base::add_edge(src, dst, cap, cost);\n }\n\n /**\n * @brief Add an edge to the graph.\n *\n * @param src Source\n * @param dst Destination\n * @param lower Lower bound of flow\n * @param upper Upper bound of flow\n * @param cost Cost\n * @return Reference to the edge.\n */\n typename base::adjacency::reference add_edge(size_type src, size_type dst,\n const Cap &lower,\n const Cap &upper,\n const Cost &cost) {\n assert(!(upper < lower));\n b[src] -= lower;\n b[dst] += lower;\n current += lower * cost;\n return add_edge(src, dst, upper - lower, cost);\n }\n\n /**\n * @brief Increase the balance of a node.\n *\n * @param node\n * @param vol\n */\n void supply(size_type node, const Cap &vol) {\n assert(node < size());\n b[node] += vol;\n }\n\n /**\n * @brief Decrease the balance of a node.\n *\n * @param node\n * @param vol\n */\n void demand(size_type node, const Cap &vol) { supply(node, -vol); }\n\n /**\n * @param node\n * @return Balance of the node\n */\n Cap balance(size_type node) { return b[node]; }\n\n /**\n * @return Cost of current flow.\n */\n Cost cost() const { return current; }\n\n /**\n * @brief Run Successive Shortest Path Algorithm.\n *\n * @return Whether a balanced flow exists.\n */\n bool flow() {\n for (bool aug = true; aug;) {\n aug = false;\n std::vector<edge *> last(size());\n Dijkstra(last);\n std::vector<bool> shut(size());\n for (size_type dst{}; dst != size(); ++dst) {\n if (b[dst] < static_cast<Cap>(0) and last[dst]) {\n Cap resid{-b[dst]};\n size_type 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 < b[src])) resid = b[block = src];\n for (edge *e{last[dst]}; e; e = last[e->src]) {\n e->cap -= resid;\n e->rev->cap += resid;\n }\n b[src] -= resid;\n b[dst] += resid;\n current += p[dst] * resid;\n aug = true;\n }\n if (~block) {\n for (size_type 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(b), end(b), [](const Cap &s) {\n return s < static_cast<Cap>(0) || static_cast<Cap>(0) < s;\n });\n }\n};\n\n} // namespace workspace\n#line 6 \"test/aizu-online-judge/2815.test.cpp\"\n\nint main() {\n using namespace workspace;\n\n int n, m, k;\n std::cin >> n >> m >> k;\n const int total = n + m + 3;\n const int dst = total - 1;\n const int dst2 = total - 2;\n const int dst3 = total - 3;\n min_cost_flow<int, int, true> mcf(total);\n mcf.supply(dst, -n);\n mcf.add_edge(dst2, dst, n, 0);\n mcf.add_edge(dst3, dst, n - k, 0);\n for (int i = 0; i < n; ++i) {\n mcf.supply(i, 1);\n std::cin >> k;\n mcf.add_edge(i, dst2, 1, -k);\n }\n for (int j = 0; j < m; j++) {\n for (int i = 0; i < n; i++) {\n std::cin >> k;\n mcf.add_edge(i, j + n, 1, -k);\n }\n }\n for (int j = 0; j < m; j++) {\n std::cin >> k;\n mcf.add_edge(j + n, dst3, k, 0);\n }\n assert(mcf.flow());\n std::cout << -mcf.cost() << \"\\n\";\n}","accuracy":1,"time_ms":10,"memory_kb":4320,"score_of_the_acc":-0.759,"final_rank":8},{"submission_id":"aoj_2815_4019942","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n/* std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool dijkstra(size_t s, size_t t)\n {\n // using info = std::pair<cost_t, size_t>;\n // std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n // fill(dist.begin(), dist.end(), inf_cost);\n // que.emplace(dist[s] = 0, s);\n // while(!que.empty())\n // {\n // cost_t _cost; size_t v;\n // std::tie(_cost, v) = que.top(), que.pop();\n // if(_cost != dist[v]) continue;\n // for(auto &&e : adj[v])\n // {\n // if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n // {\n // que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n // prev_v[e.to] = v;\n // prev_e[e.to] = &e;\n // }\n // }\n // }\n\n bool *used = new bool[V]{};\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\n {\n size_t nowv = -1;\n cost_t opt = inf_cost;\n for(size_t v = 0; v != V; ++v)\n {\n if(!used[v] && opt > dist[v] + h[v])\n {\n opt = dist[v] + h[v];\n nowv = v;\n }\n }\n if(nowv == -1) break;\n used[nowv] = true;\n for(auto &&e : adj[nowv])\n {\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\n {\n dist[e.to] = opt - h[e.to] + e.cost;\n prev_v[e.to] = nowv;\n prev_e[e.to] = &e;\n }\n }\n }\n delete[] used;\n\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n } */\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n std::vector<cost_t> h(V);\n std::vector<size_t> prev_v(V);\n std::vector<edge*> prev_e(V);\n bool *const used = new bool[V];\n while(f > 0)\n {\n std::fill_n(used, V, false);\n std::vector<cost_t> dist(V, inf_cost);\n using info = std::pair<cost_t, size_t>;\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n que.emplace(dist[s] = 0, s);\n while(!que.empty())\n {\n cost_t _cost; size_t v;\n std::tie(_cost, v) = que.top(), que.pop();\n if(_cost != dist[v]) continue;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n {\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n if(dist[t] >= inf_cost)\n {\n res = inf_cost;\n break;\n }\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n cap_t d = f;\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(size_t v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n delete[] used;\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n\n}","accuracy":1,"time_ms":700,"memory_kb":3700,"score_of_the_acc":-0.9175,"final_rank":10},{"submission_id":"aoj_2815_4019936","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n/* std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool dijkstra(size_t s, size_t t)\n {\n // using info = std::pair<cost_t, size_t>;\n // std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n // fill(dist.begin(), dist.end(), inf_cost);\n // que.emplace(dist[s] = 0, s);\n // while(!que.empty())\n // {\n // cost_t _cost; size_t v;\n // std::tie(_cost, v) = que.top(), que.pop();\n // if(_cost != dist[v]) continue;\n // for(auto &&e : adj[v])\n // {\n // if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n // {\n // que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n // prev_v[e.to] = v;\n // prev_e[e.to] = &e;\n // }\n // }\n // }\n\n bool *used = new bool[V]{};\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\n {\n size_t nowv = -1;\n cost_t opt = inf_cost;\n for(size_t v = 0; v != V; ++v)\n {\n if(!used[v] && opt > dist[v] + h[v])\n {\n opt = dist[v] + h[v];\n nowv = v;\n }\n }\n if(nowv == -1) break;\n used[nowv] = true;\n for(auto &&e : adj[nowv])\n {\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\n {\n dist[e.to] = opt - h[e.to] + e.cost;\n prev_v[e.to] = nowv;\n prev_e[e.to] = &e;\n }\n }\n }\n delete[] used;\n\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n } */\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n std::vector<cost_t> h(V);\n std::vector<size_t> prev_v(V);\n std::vector<edge*> prev_e(V);\n bool *const used = new bool[V];\n while(f > 0)\n {\n std::fill_n(used, V, false);\n std::vector<cost_t> dist(V, inf_cost);\n dist[s] = 0;\n while(true)\n {\n size_t v = -1;\n cost_t opt = inf_cost;\n for(size_t u = 0; u != V; ++u)\n {\n if(!used[u] && opt > dist[u])\n {\n opt = dist[u];\n v = u;\n }\n }\n if(v == -1) break;\n opt += h[v];\n used[v] = true;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\n {\n dist[e.to] = opt - h[e.to] + e.cost;\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n if(dist[t] >= inf_cost)\n {\n res = inf_cost;\n break;\n }\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n cap_t d = f;\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(size_t v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n delete[] used;\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n\n}","accuracy":1,"time_ms":1050,"memory_kb":3600,"score_of_the_acc":-1.1726,"final_rank":13},{"submission_id":"aoj_2815_4019912","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool *used;\n bool dijkstra(size_t s, size_t t)\n {\n/* using info = std::pair<cost_t, size_t>;\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n fill(dist.begin(), dist.end(), inf_cost);\n que.emplace(dist[s] = 0, s);\n while(!que.empty())\n {\n cost_t _cost; size_t v;\n std::tie(_cost, v) = que.top(), que.pop();\n if(_cost != dist[v]) continue;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n {\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n*/\n // bool *used = new bool[V]{};\n for(std::fill_n(used, V, false), fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\n {\n size_t nowv = -1;\n cost_t opt = inf_cost;\n for(size_t v = 0; v != V; ++v)\n {\n if(!used[v] && opt > dist[v])\n {\n opt = dist[v];\n nowv = v;\n }\n }\n if(nowv == -1) break;\n opt += h[nowv];\n used[nowv] = true;\n for(auto &&e : adj[nowv])\n {\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\n {\n dist[e.to] = opt - h[e.to] + e.cost;\n prev_v[e.to] = nowv;\n prev_e[e.to] = &e;\n }\n }\n }\n // delete[] used;\n\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n }\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n ~Primal_Dual() { delete[] used; }\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n // delete[] used; \n used = new bool[V];\n dist.resize(V), h.assign(V, 0);\n prev_v.resize(V), prev_e.resize(V);\n while(f > 0)\n {\n if(!dijkstra(s, t)) return inf_cost;\n cap_t d = f;\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(size_t v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n\n}","accuracy":1,"time_ms":1040,"memory_kb":3644,"score_of_the_acc":-1.1989,"final_rank":15},{"submission_id":"aoj_2815_4019908","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool *const used;\n bool dijkstra(size_t s, size_t t)\n {\n/* using info = std::pair<cost_t, size_t>;\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n fill(dist.begin(), dist.end(), inf_cost);\n que.emplace(dist[s] = 0, s);\n while(!que.empty())\n {\n cost_t _cost; size_t v;\n std::tie(_cost, v) = que.top(), que.pop();\n if(_cost != dist[v]) continue;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n {\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n*/\n // bool *used = new bool[V]{};\n for(std::fill_n(used, V, false), fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\n {\n size_t nowv = -1;\n cost_t opt = inf_cost;\n for(size_t v = 0; v != V; ++v)\n {\n if(!used[v] && opt > dist[v])\n {\n opt = dist[v];\n nowv = v;\n }\n }\n if(nowv == -1) break;\n opt += h[nowv];\n used[nowv] = true;\n for(auto &&e : adj[nowv])\n {\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\n {\n dist[e.to] = opt - h[e.to] + e.cost;\n prev_v[e.to] = nowv;\n prev_e[e.to] = &e;\n }\n }\n }\n // delete[] used;\n\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n }\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost(), used(new bool[V]) {}\n ~Primal_Dual() { delete[] used; }\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n dist.resize(V), h.assign(V, 0);\n prev_v.resize(V), prev_e.resize(V);\n while(f > 0)\n {\n if(!dijkstra(s, t)) return inf_cost;\n cap_t d = f;\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(size_t v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n\n}","accuracy":0.1686746987951807,"time_ms":440,"memory_kb":3552,"score_of_the_acc":-0.547,"final_rank":19},{"submission_id":"aoj_2815_4019901","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool dijkstra(size_t s, size_t t)\n {\n/* using info = std::pair<cost_t, size_t>;\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n fill(dist.begin(), dist.end(), inf_cost);\n que.emplace(dist[s] = 0, s);\n while(!que.empty())\n {\n cost_t _cost; size_t v;\n std::tie(_cost, v) = que.top(), que.pop();\n if(_cost != dist[v]) continue;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n {\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n*/\n bool *used = new bool[V]{};\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\n {\n size_t nowv = -1;\n cost_t opt = inf_cost;\n for(size_t v = 0; v != V; ++v)\n {\n if(!used[v] && opt > dist[v])\n {\n opt = dist[v];\n nowv = v;\n }\n }\n if(nowv == -1) break;\n opt += h[nowv];\n used[nowv] = true;\n for(auto &&e : adj[nowv])\n {\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\n {\n dist[e.to] = opt - h[e.to] + e.cost;\n prev_v[e.to] = nowv;\n prev_e[e.to] = &e;\n }\n }\n }\n delete[] used;\n\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n }\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n dist.resize(V), h.assign(V, 0);\n prev_v.resize(V), prev_e.resize(V);\n while(f > 0)\n {\n if(!dijkstra(s, t)) return inf_cost;\n cap_t d = f;\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(size_t v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n\n}","accuracy":1,"time_ms":1040,"memory_kb":3628,"score_of_the_acc":-1.1858,"final_rank":14},{"submission_id":"aoj_2815_4019895","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool dijkstra(size_t s, size_t t)\n {\n/* using info = std::pair<cost_t, size_t>;\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n fill(dist.begin(), dist.end(), inf_cost);\n que.emplace(dist[s] = 0, s);\n while(!que.empty())\n {\n cost_t _cost; size_t v;\n std::tie(_cost, v) = que.top(), que.pop();\n if(_cost != dist[v]) continue;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n {\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n*/\n bool *used = new bool[V]{};\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\n {\n size_t nowv = -1;\n cost_t opt = inf_cost * 2;\n for(size_t v = 0; v != V; ++v)\n {\n if(!used[v] && opt > dist[v] + h[v])\n {\n opt = dist[v] + h[v];\n nowv = v;\n }\n }\n if(nowv == -1) break;\n used[nowv] = true;\n for(auto &&e : adj[nowv])\n {\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\n {\n dist[e.to] = opt - h[e.to] + e.cost;\n prev_v[e.to] = nowv;\n prev_e[e.to] = &e;\n }\n }\n }\n delete[] used;\n\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n }\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n dist.resize(V), h.assign(V, 0);\n prev_v.resize(V), prev_e.resize(V);\n while(f > 0)\n {\n if(!dijkstra(s, t)) return inf_cost;\n cap_t d = f;\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(size_t v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n\n}","accuracy":0.1686746987951807,"time_ms":390,"memory_kb":3628,"score_of_the_acc":-0.5608,"final_rank":20},{"submission_id":"aoj_2815_4019891","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool dijkstra(size_t s, size_t t)\n {\n using info = std::pair<cost_t, size_t>;\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n fill(dist.begin(), dist.end(), inf_cost);\n que.emplace(dist[s] = 0, s);\n while(!que.empty())\n {\n cost_t _cost; size_t v;\n std::tie(_cost, v) = que.top(), que.pop();\n if(_cost != dist[v]) continue;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n {\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n/*\n bool *used = new bool[V]{};\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\n {\n size_t nowv = -1;\n cost_t opt = inf_cost;\n for(size_t v = 0; v != V; ++v)\n {\n if(!used[v] && opt > dist[v] + h[v])\n {\n opt = dist[v] + h[v];\n nowv = v;\n }\n }\n if(nowv == -1) break;\n used[nowv] = true;\n for(auto &&e : adj[nowv])\n {\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\n {\n dist[e.to] = opt - h[e.to] + e.cost;\n prev_v[e.to] = nowv;\n prev_e[e.to] = &e;\n }\n }\n }\n delete[] used;\n*/\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n }\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n dist.resize(V), h.assign(V, 0);\n prev_v.resize(V), prev_e.resize(V);\n while(f > 0)\n {\n if(!dijkstra(s, t)) return inf_cost;\n cap_t d = f;\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(size_t v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n\n}","accuracy":1,"time_ms":710,"memory_kb":3760,"score_of_the_acc":-0.976,"final_rank":12},{"submission_id":"aoj_2815_4019870","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool dijkstra(size_t s, size_t t)\n {\n // using info = std::pair<cost_t, size_t>;\n // std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n // fill(dist.begin(), dist.end(), inf_cost);\n // que.emplace(dist[s] = 0, s);\n // while(!que.empty())\n // {\n // cost_t _cost; size_t v;\n // std::tie(_cost, v) = que.top(), que.pop();\n // if(_cost != dist[v]) continue;\n // for(auto &&e : adj[v])\n // {\n // if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n // {\n // que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n // prev_v[e.to] = v;\n // prev_e[e.to] = &e;\n // }\n // }\n // }\n\n bool *used = new bool[V]{};\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\n {\n size_t nowv = -1;\n cost_t opt = inf_cost;\n for(size_t v = 0; v != V; ++v)\n {\n if(!used[v] && opt > dist[v] + h[v])\n {\n opt = dist[v] + h[v];\n nowv = v;\n }\n }\n if(nowv == -1) break;\n used[nowv] = true;\n for(auto &&e : adj[nowv])\n {\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\n {\n dist[e.to] = opt - h[e.to] + e.cost;\n prev_v[e.to] = nowv;\n prev_e[e.to] = &e;\n }\n }\n }\n delete[] used;\n\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n }\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n dist.resize(V), h.assign(V, 0);\n prev_v.resize(V), prev_e.resize(V);\n while(f > 0)\n {\n if(!dijkstra(s, t)) return inf_cost;\n cap_t d = f;\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(size_t v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n\n}","accuracy":0.1686746987951807,"time_ms":400,"memory_kb":3568,"score_of_the_acc":-0.5216,"final_rank":18},{"submission_id":"aoj_2815_4017429","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool dijkstra(size_t s, size_t t)\n {\n using info = std::pair<cost_t, size_t>;\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n fill(dist.begin(), dist.end(), inf_cost);\n que.emplace(dist[s] = 0, s);\n while(!que.empty())\n {\n cost_t _cost; size_t v;\n std::tie(_cost, v) = que.top(), que.pop();\n if(_cost != dist[v]) continue;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n {\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n }\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n dist.resize(V), h.assign(V, 0);\n prev_v.resize(V), prev_e.resize(V);\n while(f > 0)\n {\n if(!dijkstra(s, t)) return inf_cost;\n cap_t d = f;\n for(int v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(int v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n ios::sync_with_stdio(false);\n cin.tie(0);\n \n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n}","accuracy":1,"time_ms":680,"memory_kb":3724,"score_of_the_acc":-0.9178,"final_rank":11},{"submission_id":"aoj_2815_4017427","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool dijkstra(size_t s, size_t t)\n {\n using info = std::pair<cost_t, size_t>;\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n fill(dist.begin(), dist.end(), inf_cost);\n que.emplace(dist[s] = 0, s);\n while(!que.empty())\n {\n cost_t _cost; size_t v;\n std::tie(_cost, v) = que.top(), que.pop();\n if(_cost != dist[v]) continue;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n {\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n }\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n std::vector<cap_t> scap(V), tcap(V);\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n scap[e.to] += e.cap;\n tcap[v] += e.cap;\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n }\n for(size_t v = 0; v != V; ++v)\n {\n add_edge(s, v, scap[v], 0);\n add_edge(v, t, tcap[v], 0);\n }\n }\n dist.resize(V), h.assign(V, 0);\n prev_v.resize(V), prev_e.resize(V);\n while(f > 0)\n {\n if(!dijkstra(s, t)) return inf_cost;\n cap_t d = f;\n for(int v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(int v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n}","accuracy":1,"time_ms":690,"memory_kb":3692,"score_of_the_acc":-0.9014,"final_rank":9},{"submission_id":"aoj_2815_4017423","code_snippet":"#include <bits/stdc++.h>\n\nnamespace std\n{\n // hash\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\n // iostream\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\n} // namespace std\n\n\ntemplate <class cap_t, class cost_t>\nstruct Flow\n{\n Flow(size_t _V) : V(_V), adj(_V) {}\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\n {\n if(cap <= 0) return;\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\n }\n protected:\n struct edge\n {\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n }; // struct edge\n size_t V;\n std::vector<std::vector<edge>> adj;\n}; // struct Flow\n\ntemplate <class cap_t, class cost_t>\nclass Primal_Dual : public Flow<cap_t, cost_t>\n{\n using edge = typename Flow<cap_t, cap_t>::edge;\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\n bool neg_cost;\n std::vector<cost_t> dist, h;\n std::vector<size_t> prev_v;\n std::vector<edge*> prev_e;\n bool dijkstra(size_t s, size_t t)\n {\n using info = std::pair<cost_t, size_t>;\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\n fill(dist.begin(), dist.end(), inf_cost);\n que.emplace(dist[s] = 0, s);\n while(!que.empty())\n {\n cost_t _cost; size_t v;\n std::tie(_cost, v) = que.top(), que.pop();\n if(_cost != dist[v]) continue;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\n {\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\n prev_v[e.to] = v;\n prev_e[e.to] = &e;\n }\n }\n }\n if(dist[t] >= inf_cost) return false;\n for(size_t v = 0; v != V; ++v)\n {\n h[v] += dist[v];\n if(h[v] > inf_cost) h[v] = inf_cost;\n }\n return true;\n }\n public:\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\n {\n if(cap <= 0) return;\n if(cost < 0) neg_cost = true;\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\n }\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\n {\n cost_t res = 0;\n if(neg_cost)\n {\n neg_cost = false;\n {\n const size_t _s = V++, _t = V++;\n adj.resize(V);\n add_edge(_s, s, f, 0);\n add_edge(t, _t, f, 0);\n s = _s, t = _t;\n }\n for(size_t v = 0; v != V; ++v)\n {\n cap_t cap_sum = 0;\n for(auto &&e : adj[v])\n {\n if(e.cap > 0 and e.cost < 0)\n {\n add_edge(s, e.to, e.cap, 0);\n res += e.cap * e.cost;\n f += e.cap;\n adj[e.to][e.rev].cap += e.cap;\n cap_sum += e.cap;\n e.cap = 0;\n }\n }\n add_edge(v, t, cap_sum, 0);\n }\n }\n dist.resize(V), h.assign(V, 0);\n prev_v.resize(V), prev_e.resize(V);\n while(f > 0)\n {\n if(!dijkstra(s, t)) return inf_cost;\n cap_t d = f;\n for(int v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\n f -= d, res += h[t] * d;\n for(int v = t; v != s; v = prev_v[v])\n {\n prev_e[v]->cap -= d;\n adj[v][prev_e[v]->rev].cap += d;\n }\n }\n return res;\n }\n}; // class Primal_Dual\n\nmain()\n{\n using namespace std;\n int n,m,k; cin>>n>>m>>k;\n Primal_Dual<int,int> flow(2+n+m);\n vector<int> a(n); cin>>a;\n const int s=n+m,t=s+1;\n for(int i=0; i<m; ++i)\n {\n for(int j=0; j<n; ++j)\n {\n int b; cin>>b;\n flow.add_edge(i,j+m,1,-b);\n }\n }\n for(int i=m; i<m+n; ++i)\n {\n flow.add_edge(i,t,1,a[i-m]);\n }\n for(int i=0; i<m; ++i)\n {\n int t; cin>>t;\n flow.add_edge(s,i,t,0);\n }\n flow.add_edge(s,t,n,0);\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \"\\n\";\n}","accuracy":1,"time_ms":970,"memory_kb":4616,"score_of_the_acc":-1.9231,"final_rank":17},{"submission_id":"aoj_2815_3991575","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nusing PII = pair<ll, ll>;\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\n#define REP(i,n) FOR(i,0,n)\nconst ll INF = 1LL << 60;\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\n\nstruct min_cost_max_flow {\n\tstruct edge {\n\t\tint to;\n\t\tll cap, cost;\n\t\tint rev;\n\t\tbool isrev;\n\t};\n\n\tint n, s, t;\n\tll neg;\n\tvector<vector<edge>> g;\n\tvector<ll> d, h, dist, prevv, preve;\n\n\tll flow(vector<ll> d0) {\n\t\tll res = 0;\n\t\tpriority_queue<PII, vector<PII>, greater<PII>> que;\n\t\th.assign(n, 0);\n\t\tpreve.assign(n, -1);\n\t\tprevv.assign(n, -1);\n\t\tll f = 0;\n\t\tREP(i, d.size()) {\n\t\t\tif (i < (ll)d0.size()) d[i] += d0[i];\n\t\t\tif (d[i] > 0) add_edge(s, i, d[i], 0), f += d[i];\n\t\t\telse if (d[i] < 0) add_edge(i, t, -d[i], 0);\n\t\t}\n\t\twhile (f > 0) {\n\t\t\tdist.assign(n, INF);\n\t\t\tdist[s] = 0;\n\t\t\tque.push({ 0, s });\n\t\t\twhile (que.size()) {\n\t\t\t\tPII p = que.top(); que.pop();\n\t\t\t\tint v = p.second;\n\t\t\t\tif (dist[v] < p.first) continue;\n\t\t\t\tREP(i, g[v].size()) {\n\t\t\t\t\tedge &e = g[v][i];\n\t\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tque.push({ dist[e.to], e.to });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[t] == INF) return -1;\n\t\t\tREP(v, n) h[v] += dist[v];\n\t\t\tll d = f;\n\t\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\t\tchmin(d, g[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf -= d; res += d * h[t];\n\t\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\t\tedge &e = g[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tg[v][e.rev].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn neg + res;\n\t} \n\n\tmin_cost_max_flow(int n0) : n(n0+2), s(n0), t(n0+1), neg(0), g(n0+2), d(n0+2) {}\n\n\tvoid add_edge(int from, int to, ll cap, ll cost) {\n\t\tif (cost >= 0) {\n\t\t\tg[from].push_back({ to, cap, cost, (int)g[to].size(), false });\n\t\t\tg[to].push_back({ from, 0, -cost, (int)g[from].size() - 1, true });\n\t\t}\n\t\telse {\n\t\t\td[from] -= cap;\n\t\t\td[to] += cap;\n\t\t\tneg += cap * cost;\n\t\t\tadd_edge(to, from, cap, -cost);\n\t\t}\n\t}\n\n\tll flow(int S, int T, ll f) {\n\t\tvector<ll> d0(n);\n\t\td0[S] = f, d0[T] = -f;\n\t\treturn flow(d0);\n\t}\n};\n\nint main() {\n\tll n, m, k;\n\tcin >> n >> m >> k;\n\tvector<ll> a(n), T(m);\n\tvector<vector<ll>> b(m, vector<ll>(n));\n\tREP(i, n) cin >> a[i];\n\tREP(i, m) REP(j, n) cin >> b[i][j];\n\tREP(i, m) cin >> T[i];\n\n\tmin_cost_max_flow graph(n + m + 4);\n\tll s = n + m + 2, t = n + m + 3, x = n + m, y = n + m + 1;\n\tgraph.add_edge(s, x, n, 0);\n\tgraph.add_edge(s, y, n-k, 0);\n\tREP(i, m) graph.add_edge(y, i, T[i], 0);\n\tREP(i, n) graph.add_edge(m + i, t, 1, 0);\n\tREP(i, n) graph.add_edge(x, m + i, 1, -a[i]);\n\tREP(i, m) REP(j, n) graph.add_edge(i, m + j, 1, -b[i][j]);\n\n\tcout << -graph.flow(s, t, n) << endl;\n}","accuracy":1,"time_ms":840,"memory_kb":3968,"score_of_the_acc":-1.2704,"final_rank":16},{"submission_id":"aoj_2815_2797329","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\n#define pb push_back\nusing namespace std;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nconst int inf=1e8;\nstruct edge{\n int to,cap,cost,rev;\n};\ntypedef vector<edge> ve;\ntypedef vector<ve> vve;\nclass MCF{ //Minimum Cost Flow\npublic:\n int n;\n vve G;\n vi h,dist,prev,pree;\n MCF(int size){\n n=size;\n G=vve(n);\n h=dist=prev=pree=vi(n);\n }\n void add_edge(int s,int t,int ca,int co){\n edge e={t,ca,co,(int)G[t].size()};\n G[s].pb(e);\n edge ee={s,0,-co,(int)G[s].size()-1};\n G[t].pb(ee);\n }\n int mcf(int s,int t,int f){\n int out=0;\n h=vi(n);\n while(f>0){\n priority_queue<pii,vector<pii> >q;\n dist=vi(n,inf);\n dist[s]=0;\n q.push(pii(0,s));\n while(!q.empty()){\n pii p=q.top();q.pop();\n int v=p.second;\n if(dist[v]<-p.first)continue;\n rep(i,G[v].size()){\n edge &e=G[v][i];\n if(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prev[e.to]=v;\n pree[e.to]=i;\n q.push(pii(-dist[e.to],e.to));\n }\n }\n }\n if(dist[t]==inf)return -1;\n rep(i,n)h[i]+=dist[i];\n int d=f;\n for(int v=t;v!=s;v=prev[v])d=min(d,G[prev[v]][pree[v]].cap);\n f-=d;\n out+=d*h[t];\n for(int v=t;v!=s;v=prev[v]){\n edge &e=G[prev[v]][pree[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return out;\n }\n};\nsigned main(){\n //n個のレポート, m人の友だち\n \n int n,m,k; cin >> n >> m >> k;\n vector<vector<int>>v(m+1,vector<int>(n));\n rep(i,m+1)rep(j,n) cin >> v[i][j];\n vector<int>frd;\n frd.push_back(n);\n rep(i,m){\n int tmp; cin >> tmp;\n frd.push_back(tmp);\n }\n MCF fl(n+m+5);\n //fl.add_edge(int s, int t, int cap, int cost)\n int source = n+m+5 - 2;\n int sink = n+m+5-1;\n int fri = source-1;\n int msl = fri - 1;\n fl.add_edge(msl, sink, n, 0);\n fl.add_edge(fri, sink, n-k, 0);\n //各レポートに辺を貼る\n rep(i,n)fl.add_edge(source,i, 1, 0);\n rep(i,n)rep(j,m+1){\n fl.add_edge(i,n+j,1, 1000-v[j][i]);\n }\n rep(i,m+1){\n fl.add_edge(n+i, (i!=0?fri:msl),frd[i],0);\n }\n cout << 1000*n-fl.mcf(source, sink, n) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3388,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2815_2764540","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 250\n\n\n//辺を表す構造体{行先、容量、コスト、逆辺のインデックス}\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,int arg_cost,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\tcost = arg_cost;\n\t\trev_index = arg_rev_index;\n\t}\n\n\tint to,capacity,cost,rev_index;\n};\n\nint V; //頂点数\nvector<Edge> G[NUM]; //グラフの隣接リスト表現\nint dist[NUM]; //最短距離\nint pre_node[NUM],pre_edge[NUM]; //直前の頂点と辺\nint A[101],B[101][101],T[101];\n\n\n//fromからtoへ向かう容量capacity,コストcostの辺をグラフに追加する\nvoid add_edge(int from,int to,int capacity,int cost){\n\tG[from].push_back(Edge(to,capacity,cost,G[to].size()));\n\tG[to].push_back(Edge(from,0,-cost,G[from].size()-1));\n}\n\n//sourceからsinkへの、流量flowの最小費用流を求める\n//流せない場合は-1を返す\nint min_cost_flow(int source,int sink,int flow){\n\tint ret = 0;\n\twhile(flow > 0){\n\t\t//ベルマンフォード方により、source-sink間最短経路を求める\n\t\tfor(int i = 0; i < V; i++)dist[i] = BIG_NUM;\n\t\tdist[source] = 0;\n\t\tbool update = true;\n\t\twhile(update){\n\t\t\tupdate = false;\n\t\t\tfor(int node_id = 0; node_id < V; node_id++){\n\t\t\t\tif(dist[node_id] == BIG_NUM)continue;\n\t\t\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\t\t\tEdge &e = G[node_id][i];\n\t\t\t\t\tif(e.capacity > 0 && dist[e.to] > dist[node_id]+e.cost){\n\t\t\t\t\t\tdist[e.to] = dist[node_id]+e.cost; //node_idを経由した方が早い場合\n\t\t\t\t\t\tpre_node[e.to] = node_id;\n\t\t\t\t\t\tpre_edge[e.to] = i;\n\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(dist[sink] == BIG_NUM){\n\t\t\t//これ以上流せない\n\t\t\treturn -1;\n\t\t}\n\n\t\t//source-sink間最短路に沿って目いっぱい流す\n\t\tint tmp_flow = flow;\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\ttmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\n\t\t}\n\t\tflow -= tmp_flow;\n\t\tret += tmp_flow*dist[sink];\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\tEdge &e = G[pre_node[node_id]][pre_edge[node_id]];\n\t\t\te.capacity -= tmp_flow;\n\t\t\tG[node_id][e.rev_index].capacity += tmp_flow;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main(){\n\n\tint N,M,K;\n\tscanf(\"%d %d %d\",&N,&M,&K);\n\n\tfor(int i = 0; i < N; i++)scanf(\"%d\",&A[i]);\n\n\tfor(int i = 0; i < M; i++){\n\t\tfor(int k = 0; k < N; k++)scanf(\"%d\",&B[i][k]);\n\t}\n\n\tfor(int i = 0; i < M; i++)scanf(\"%d\",&T[i]);\n\n\tint source = 0,sink = 1,first_branch = 2,second_branch = 3,me = 4,index = 5;\n\n\tadd_edge(source,first_branch,N,0); //全体の流量をNに設定する\n\tadd_edge(first_branch,me,N,0); //自分に最大N流せるようにする\n\tadd_edge(first_branch,second_branch,N-K,0); //最大でも友達にはN-Kしか流せないようにする\n\n\tint friend_index[M],report_index[N];\n\n\tfor(int i = 0; i < M; i++){\n\t\tfriend_index[i] = index++;\n\t\tadd_edge(second_branch,friend_index[i],T[i],0); //友達iに流量T[i]の辺を張る\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\treport_index[i] = index++;\n\t\tadd_edge(report_index[i],sink,1,0); //レポートからsinkへ辺を張る\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tadd_edge(me,report_index[i],1,-A[i]); //自分からレポートに、負のコストの辺を張る\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tadd_edge(friend_index[i],report_index[k],1,-B[i][k]); //友達iからレポートkに、負のコストの辺を張る\n\t\t}\n\t}\n\n\tV = index;\n\n\tprintf(\"%d\\n\",-min_cost_flow(source,sink,N));\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3476,"score_of_the_acc":-0.0717,"final_rank":4},{"submission_id":"aoj_2815_2728697","code_snippet":"#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n\nstruct PrimalDual{\n const int INF = 1<<28;\n typedef pair<int,int> P;\n struct edge{\n int to,cap,cost,rev;\n edge(){}\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n };\n\n int n;\n vector<vector<edge> > G;\n vector<int> h,dist,prevv,preve;\n\n PrimalDual(){}\n PrimalDual(int sz):n(sz),G(sz),h(sz),dist(sz),prevv(sz),preve(sz){}\n \n void add_edge(int from,int to,int cap,int cost){\n G[from].push_back(edge(to,cap,cost,G[to].size()));\n G[to].push_back(edge(from,0,-cost,G[from].size()-1));\n }\n\n int flow(int s,int t,int f){\n int res=0;\n fill(h.begin(),h.end(),0);\n while(f>0){\n priority_queue<P,vector<P>,greater<P> > que;\n fill(dist.begin(),dist.end(),INF);\n dist[s]=0;\n que.push(P(0,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&&dist[e.to]>dist[v]+e.cost+h[v]-h[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.push(P(dist[e.to],e.to));\n }\n }\n }\n if(dist[t]==INF) return -1;\n for(int v=0;v<n;v++) h[v]+=dist[v];\n int 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*h[t];\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 return res;\n }\n};\n\nint main(){\n int n,m,K;\n cin>>n>>m>>K;\n int a[n],b[m][n],t[m];\n r(i,n)cin>>a[i];\n r(i,m)r(j,n)cin>>b[i][j];\n r(i,m)cin>>t[i];\n int v=n+m+4;\n PrimalDual p(v);\n int start=n+m+1;\n int goal=n+m+2;\n int tite=n+m+3;\n r(i,n)p.add_edge(start,i,1,0);\n r(i,m+1){\n if(!i)p.add_edge(n+i,goal,1000,0);\n else p.add_edge(n+i,tite,t[i-1],0);\n }\n p.add_edge(tite,goal,n-K,0);\n r(i,n){\n r(j,m+1){\n if(!j)p.add_edge(i,n+j,1,-a[i]);\n else p.add_edge(i,n+j,1,-b[j-1][i]);\n }\n }\n cout<<-p.flow(start,goal,n)<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3436,"score_of_the_acc":-0.0391,"final_rank":3},{"submission_id":"aoj_2815_2374951","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define DUMP(x) cerr << #x << \"=\" << x << endl\n#define DUMP2(x, y) cerr<<\"(\"<<#x<<\", \"<<#y<<\") = (\"<<x<<\", \"<<y<<\")\"<< endl\n#define BINARY(x) static_cast<bitset<16> >(x)\n\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define REP(i,m,n) for (int i=m;i<(int)(n);i++)\n\n#define in_range(x, y, w, h) (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))\n#define ALL(a) (a).begin(),(a).end()\n\ntypedef long long ll;\nconst int INF = 1e9;\nconst ll INFLL = 1e18;\ntypedef pair<int, int> PII;\nint dx[4]={0, -1, 1, 0}, dy[4]={-1, 0, 0, 1};\n\nconst int MAX_V = 2000;\n\nclass MinCostFlow {\n struct edge { int to, cap, rev, cost;};\n vector<edge> G[MAX_V];\n\n int V;\n \n int dist[MAX_V];\n int prevv[MAX_V], preve[MAX_V];\n \npublic:\n MinCostFlow() {V=MAX_V;}\n MinCostFlow(int v) {\n V = v;\n }\n \n void add_edge(int from, int to, int cap, int cost) {\n G[from].push_back((edge){to, cap, (int)G[to].size(), cost});\n G[to].push_back((edge){from, 0, (int)G[from].size()-1, -cost});\n }\n \n // ????°??????¨???\n int min_cost_flow(int s, int t, int f) {\n int res=0;\n while (f>0) {\n fill(dist, dist+V, INF);\n dist[s]=0;\n bool update=true;\n while (update) {\n update = false;\n for (int v=0; v<V; v++) {\n if (dist[v]==INF) continue;\n for (int i=0; i<G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap>0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n \n if (dist[t] == INF) {\n return -1;\n }\n \n int 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*dist[t];\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 return res;\n }\n};\n\nint main()\n{\n ios::sync_with_stdio(false);\n\n int N, M, K;\n cin >> N >> M >> K;\n\n M++;\n\n vector<vector<int>> A(M, vector<int>(N));\n vector<int> T(M-1);\n\n rep(i, M) {\n rep(j, N) {\n cin >> A[i][j];\n }\n }\n\n rep(i, M-1) cin >> T[i];\n \n // Node 0 : ?????????\n // Node 1 - N : ??¬?????????\n // Node N+1 - N+M : ??????+??????\n // Node N+M+1 : ?§?????????°?????¶???\n // Node N+M+2 : ?????????\n\n const int SOURCE = 0;\n const int SINK = N+M+2;\n const int X = N+M+1;\n\n MinCostFlow flow(N+M+10);\n\n rep(i, N) {\n flow.add_edge(SOURCE, 1+i, 1, 0);\n }\n\n rep(i, N) {\n rep(j, M) {\n flow.add_edge(1+i, N+1+j, 1, 100 - A[j][i]);\n }\n }\n\n flow.add_edge(N+1, SINK, INF, 0);\n\n if (M > 1) {\n rep(i, M-1) {\n flow.add_edge(N+2+i, X, T[i], 0);\n }\n\n flow.add_edge(X, SINK, N-K, 0);\n }\n\n cout << N*100 - flow.min_cost_flow(0, SINK, N) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3548,"score_of_the_acc":-0.1303,"final_rank":5},{"submission_id":"aoj_2815_2336183","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nconstexpr int MAX_V = 1000;\nconstexpr int INF = (1 << 29);\n\nstruct edge {\n int to, cap, cost, rev;\n edge(int to, int cap, int cost, int rev) :\n to{to}, cap{cap}, cost{cost}, rev{rev} {}\n};\n\nint V;\nvector<edge> G[MAX_V];\nint dist[MAX_V], prevv[MAX_V], preve[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost)\n{\n G[from].emplace_back(to, cap, cost, G[to].size());\n G[to].emplace_back(from, 0, -cost, G[from].size() - 1);\n}\n\nint min_cost_flow(int s, int t, int f)\n{\n int res = 0;\n while (f > 0) {\n fill(dist, dist + V, INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n for (int v = 0; v < V; v++) {\n if (dist[v] == INF) continue;\n for (int i = 0; i < (int)G[v].size(); i++) {\n edge& e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n if (dist[t] == INF) return -1;\n int 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 * dist[t];\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 return res;\n}\n\nint main()\n{\n int N, M, K;\n cin >> N >> M >> K;\n \n int S = N + (M + 1) + 1, T = S + 1;\n V = T + 1;\n for (int i = 0; i < N; i++) {\n int a;\n cin >> a;\n \n add_edge(S, i, 1, 0);\n add_edge(i, N, 1, -a);\n }\n \n\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < N; j++) {\n int b;\n cin >> b;\n add_edge(j, N + i + 1, 1, -b);\n }\n } \n \n for (int i = 0; i < M; i++) {\n int Ti;\n cin >> Ti;\n add_edge(N + i + 1, N + (M + 1), Ti, 0);\n }\n\n add_edge(N, T, INF, 0);\n add_edge(N + (M + 1), T, N - K, 0);\n\n cout << -min_cost_flow(S, T, N) << endl; \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3396,"score_of_the_acc":-0.0065,"final_rank":2},{"submission_id":"aoj_2815_2330393","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(auto i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\n\n\n\ntypedef int Weight;\ntypedef int Cap;\nconst Weight W_INF = INT_MAX;\nconst Weight W_ZERO = 0;\nconst Cap C_INF = INT_MAX;\nconst Cap C_ZERO = 0;\n\nstruct Edge {\n\tint src, dst;\n\tCap capacity;\n\tWeight cost;\n\tEdge(int src, int dst, const Cap& acap, const Weight& acost) :\n\t\tsrc(src), dst(dst), capacity(acap), cost(acost) {\n\t}\n};\nbool operator < (const Edge &e, const Edge &f) {\n\treturn e.cost > f.cost;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\n\n#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\n#define RCOST(u,v) (cost[u][v] + h[u] - h[v])\n\n//??°?????????????????§???????????????????????¨?????????\n\n//Graph &ag\n//????????§???????????????(u, v, capacity, cost) ??????????????????(u, v, 0, -cost) ???????????°????????????????????¶?????????????????§????´???°????????§???????????°???????????????\n//int s, int t\n//?????????????§??????¨?????????\n//?????????\n//?????¨??¨????????????????????????\npair<Weight, Cap> minimumCostFlow(const Graph &ag, int s, int t) {\n\t//check???????´???°??????????????£???????????????\n\tGraph g(ag);\n\tfor (int i = 0; i < ag.size(); ++i) {\n\t\tfor (int j = 0; j < ag[i].size(); ++j) {\n\t\t\tint d = ag[i][j].dst;\n\t\t\tint s = ag[i][j].src;\n\n\t\t\tbool ok = false;\n\t\t\tfor (int k = 0; k < ag[d].size(); ++k) {\n\t\t\t\tif (ag[d][k].src == s) {\n\t\t\t\t\tok = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!ok) {\n\t\t\t\tg[d].push_back(Edge(d, s, C_ZERO, -ag[i][j].cost));\n\t\t\t}\n\t\t}\n\t}\n\tconst int n = g.size();\n\tvector<vector<Cap>> capacity(n, vector<Cap>(n)), flow(n, vector<Cap>(n));\n\tvector<vector<Weight>>cost(n, vector<Weight>(n));\n\tfor (int u = 0; u < n; ++u) {\n\t\tfor (auto e : g[u]) {\n\t\t\tcapacity[e.src][e.dst] = capacity[e.src][e.dst] + e.capacity;\n\t\t\tcost[e.src][e.dst] = cost[e.src][e.dst] + e.cost;\n\t\t}\n\t}\n\tpair<Weight, Cap> total; // (cost, flow)\n\tvector<Weight> h(n);\n\n\tfor (Cap F = C_INF; F > 0; ) { // residual flow\n\t\tvector<Weight> d(n, W_INF); d[s] = W_ZERO;\n\t\tvector<int> p(n, -1);\n\t\tpriority_queue<Edge> Q; // \"e < f\" <=> \"e.cost > f.cost\"\n\t\tfor (Q.push(Edge(-2, s, C_ZERO, W_ZERO)); !Q.empty(); ) {\n\t\t\tEdge e = Q.top(); Q.pop();\n\t\t\tif (p[e.dst] != -1) continue;\n\t\t\tp[e.dst] = e.src;\n\t\t\tFOR(f, g[e.dst]) {\n\t\t\t\tif (RESIDUE(f->src, f->dst) > 0) {\n\t\t\t\t\tif (d[f->dst] > d[f->src] + RCOST(f->src, f->dst)) {\n\t\t\t\t\t\td[f->dst] = d[f->src] + RCOST(f->src, f->dst);\n\t\t\t\t\t\tQ.push(Edge(f->src, f->dst, 0, d[f->dst]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (p[t] == -1) {\n\t\t\tbreak;\n\t\t}\n\n\t\tCap f = F;\n\t\tfor (int u = t; u != s; u = p[u]) {\n\t\t\tf = min(f, RESIDUE(p[u], u));\n\t\t}\n\t\tfor (int u = t; u != s; u = p[u]) {\n\t\t\ttotal.first = total.first + f * cost[p[u]][u];\n\t\t\tflow[p[u]][u] = flow[p[u]][u] + f; flow[u][p[u]] = flow[u][p[u]] - f;\n\t\t}\n\t\tF = F - f;\n\t\ttotal.second = total.second + f;\n\t\tfor (int u = 0; u < n; ++u) {\n\t\t\th[u] = h[u] + d[u];\n\t\t}\n\t}\n\treturn total;\n}\nvoid add_edge(Graph&g, const int from, const int to, const Cap& cap, const Weight& weight) {\n\tg[from].push_back(Edge(from, to, cap, weight));\n}\n\nint main() {\n\tint N, M, K; cin >> N >> M >> K;\n\tvector<int>myscores(N);\n\tvector<vector<int>>friscores(M, vector<int>(N));\n\tvector<int>cancheat(M);\n\tfor (int i = 0; i < N; ++i) {\n\t\tcin >> myscores[i];\n\t}\n\tfor (int i = 0; i < M; ++i) {\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\tcin >> friscores[i][j];\n\t\t}\n\t}\n\tfor (int i = 0; i < M; ++i) {\n\t\tcin >> cancheat[i];\n\t}\n\n\tconst int start = 0;\n\tconst int report = start + 1;\n\tconst int my = report + N;\n\tconst int fr_in = my + 1;\n\tconst int fr_assemble = fr_in + M;\n\tconst int goal = fr_assemble + 1;\n\tGraph g(goal+1);\n\tfor (int i = 0; i < N; ++i) {\n\t\tadd_edge(g, start, report + i, 1, 0);\n\t}\n\tfor (int i = 0; i < N; ++i) {\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\tadd_edge(g, report + i, fr_in + j, 1, 100-friscores[j][i]);\n\t\t}\n\t\tadd_edge(g, report + i, my, 1, 100-myscores[i]);\n\t}\n\tfor (int j = 0; j < M; ++j) {\n\t\tadd_edge(g, fr_in + j, fr_assemble, cancheat[j], 0);\n\t}\n\tadd_edge(g, fr_assemble,goal, N - K, 0);\n\tadd_edge(g, my, goal, N, 0);\n\tauto ans = minimumCostFlow(g, start, goal);\n\tcout << 100*N-ans.first<< endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4152,"score_of_the_acc":-0.6221,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_2815_5147669\",\n \"code_snippet\": \"#line 1 \\\"test/aizu-online-judge/2815.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/2815\\\"\\n\\n#include <iostream>\\n\\n#line 2 \\\"src/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\n/**\\n * @file min_cost_flow.hpp\\n * @brief Minimum Cost Flow\\n * @date 2021-01-15\\n *\\n *\\n */\\n\\n#include <algorithm>\\n#include <optional>\\n#include <queue>\\n\\n#line 2 \\\"src/graph/directed/flow/base.hpp\\\"\\n\\n/**\\n * @file base.hpp\\n * @brief Flow Graph\\n * @date 2021-01-15\\n *\\n *\\n */\\n\\n#include <cassert>\\n#include <numeric>\\n#include <vector>\\n\\nnamespace workspace {\\n\\ntemplate <class Cap, class Cost = void> class flow_graph {\\n protected:\\n class adjacency_impl;\\n\\n public:\\n using container_type = std::vector<adjacency_impl>;\\n using size_type = typename container_type::size_type;\\n\\n class unweighted_edge {\\n public:\\n size_type src, dst;\\n Cap cap;\\n\\n unweighted_edge() = default;\\n\\n unweighted_edge(size_type src, size_type dst, const Cap &cap)\\n : src(src), dst(dst), cap(cap) {\\n assert(!(cap < static_cast<Cap>(0)));\\n }\\n\\n template <class Os>\\n friend Os &operator<<(Os &__os, unweighted_edge const &__e) {\\n return __os << __e.src << \\\" \\\" << __e.dst << \\\" \\\" << __e.cap;\\n }\\n\\n protected:\\n unweighted_edge make_rev() { return {dst, src, 0}; }\\n };\\n\\n class weighted_edge : public unweighted_edge {\\n public:\\n Cost cost;\\n\\n weighted_edge() = default;\\n\\n weighted_edge(size_type src, size_type dst, const Cap &cap,\\n const Cost &cost)\\n : unweighted_edge(src, dst, cap), cost(cost) {}\\n\\n template <class Os>\\n friend Os &operator<<(Os &__os, weighted_edge const &__e) {\\n return __os << static_cast<unweighted_edge>(__e) << \\\" \\\" << __e.cost;\\n }\\n\\n protected:\\n weighted_edge make_rev() {\\n return {unweighted_edge::dst, unweighted_edge::src, 0, -cost};\\n }\\n };\\n\\n using edge = typename std::conditional<std::is_void<Cost>::value,\\n unweighted_edge, weighted_edge>::type;\\n\\n protected:\\n struct edge_impl : edge {\\n bool aux = false;\\n edge_impl *rev = nullptr;\\n\\n edge_impl() = default;\\n\\n edge_impl(const edge_impl &__e) = default;\\n\\n edge_impl(const edge &__e) : edge(__e) {}\\n\\n void flow(const Cap &f) { edge::cap -= f, rev->cap += f; }\\n\\n edge_impl rev_cp() {\\n edge_impl __e;\\n if (rev)\\n __e = *rev;\\n else {\\n __e = edge::make_rev();\\n __e.aux = true;\\n }\\n __e.rev = this;\\n return __e;\\n }\\n };\\n\\n public:\\n class adjacency {\\n public:\\n using value_type = edge;\\n using reference = edge &;\\n using const_reference = edge const &;\\n using pointer = edge *;\\n using const_pointer = const edge *;\\n\\n class const_iterator {\\n public:\\n const edge_impl *__p;\\n\\n bool operator!=(const_iterator const &__x) const {\\n return __p != __x.__p;\\n }\\n\\n const_iterator &operator++() {\\n do\\n ++__p;\\n while (__p->rev && __p->aux);\\n return *this;\\n }\\n\\n const_pointer operator->() const { return __p; }\\n\\n const_reference operator*() const { return *__p; }\\n };\\n\\n adjacency()\\n : first(new edge_impl[2]), last(first + 1), __s(first), __t(first) {}\\n\\n ~adjacency() { delete[] first; }\\n\\n const_reference operator[](size_type i) const {\\n assert(i < size());\\n return *(first + i);\\n }\\n\\n size_type size() const { return __t - first; }\\n\\n auto begin() const { return const_iterator{__s}; }\\n auto end() const { return const_iterator{__t}; }\\n\\n /**\\n * @brief Construct a new adjacency object\\n *\\n * @param __x Rvalue reference to another object\\n */\\n adjacency(adjacency &&__x) : first(nullptr) { operator=(std::move(__x)); }\\n\\n /**\\n * @brief Assignment operator.\\n *\\n * @param __x Rvalue reference to another object\\n * @return Reference to this object.\\n */\\n adjacency &operator=(adjacency &&__x) {\\n std::swap(first, __x.first);\\n last = __x.last;\\n __s = __x.__s;\\n __t = __x.__t;\\n return *this;\\n }\\n\\n protected:\\n edge_impl *first, *last, *__s, *__t;\\n };\\n\\n using value_type = adjacency;\\n using reference = adjacency &;\\n using const_reference = adjacency const &;\\n\\n protected:\\n class adjacency_impl : public adjacency {\\n public:\\n using base = adjacency;\\n using base::__s;\\n using base::__t;\\n using base::first;\\n using base::last;\\n\\n template <class... Args> auto emplace(Args &&... args) {\\n if (__t == last) {\\n size_type __n(last - first);\\n edge_impl *loc = new edge_impl[__n << 1 | 1];\\n __s += loc - first;\\n __t = loc;\\n for (edge_impl *__p{first}; __p != last; ++__p, ++__t)\\n __p->rev->rev = __t, *__t = *__p;\\n delete[] first;\\n first = loc;\\n last = __t + __n;\\n }\\n *__t = edge_impl(args...);\\n if (__s->aux) ++__s;\\n return __t++;\\n }\\n\\n using iterator = edge_impl *;\\n auto begin() const { return first; }\\n auto end() const { return __t; }\\n };\\n\\n public:\\n /**\\n * @brief Construct a new flow graph object\\n *\\n * @param __n Number of vertices\\n */\\n flow_graph(size_type __n = 0) : graph(__n) {}\\n\\n /**\\n * @brief Construct a new flow graph object\\n *\\n * @param __x Const reference to another object\\n */\\n flow_graph(const flow_graph &__x) : graph(__x.size()) {\\n for (auto &&__adj : __x)\\n for (auto &&__e : __adj) _add_edge(__e);\\n }\\n\\n /**\\n * @brief Assignment operator.\\n *\\n * @param __x Rvalue reference to another object\\n * @return Reference to this object.\\n */\\n flow_graph &operator=(flow_graph &&__x) {\\n graph.swap(__x.graph);\\n return *this;\\n }\\n\\n /**\\n * @return Number of nodes.\\n */\\n size_type size() const { return graph.size(); }\\n\\n reference operator[](size_type node) {\\n assert(node < size());\\n return graph[node];\\n }\\n\\n const_reference &operator[](size_type node) const {\\n assert(node < size());\\n return graph[node];\\n }\\n\\n class const_iterator : public container_type::const_iterator {\\n public:\\n using base = typename container_type::const_iterator;\\n using const_reference = const adjacency &;\\n using const_pointer = const adjacency *;\\n\\n const_iterator(base const &__i) : base(__i) {}\\n\\n const_pointer operator->() const { return base::operator->(); }\\n\\n const_reference operator*() const { return base::operator*(); }\\n };\\n\\n auto begin() const { return const_iterator{graph.begin()}; }\\n auto end() const { return const_iterator{graph.end()}; }\\n\\n size_type add_node() { return add_nodes(1).front(); }\\n\\n virtual std::vector<size_type> add_nodes(size_type __n) {\\n std::vector<size_type> __nds(__n);\\n std::iota(__nds.begin(), __nds.end(), graph.size());\\n __n += graph.size();\\n if (__n > graph.capacity()) {\\n flow_graph __x(__n);\\n for (auto &&adj : graph)\\n for (auto &&__e : adj)\\n if (!__e.aux) __x._add_edge(__e);\\n graph.swap(__x.graph);\\n } else\\n graph.resize(__n);\\n return __nds;\\n }\\n\\n template <class... Args> const edge &add_edge(Args &&... args) {\\n return *_add_edge(edge(args...));\\n }\\n\\n protected:\\n template <class... Args> edge_impl *_add_edge(Args &&... args) {\\n edge_impl __e(args...);\\n assert(__e.src < size());\\n assert(__e.dst < size());\\n auto __p = graph[__e.src].emplace(__e);\\n __p->rev = graph[__e.dst].emplace(__p->rev_cp());\\n return __p;\\n }\\n\\n constexpr static size_type nil = -1;\\n container_type graph;\\n\\n template <class Os> friend Os &operator<<(Os &__os, flow_graph const &__g) {\\n for (const auto &adj : __g)\\n for (const auto &e : adj) __os << e << \\\"\\\\n\\\";\\n return __os;\\n }\\n};\\n\\n} // namespace workspace\\n#line 16 \\\"src/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Successive Shortest Path Algorithm.\\n *\\n * @tparam Cap Capacity type\\n * @tparam Cost Cost type\\n * @tparam Density_tag Whether the graph is dense.\\n */\\ntemplate <class Cap, class Cost = Cap, bool Density_tag = false>\\nclass min_cost_flow : public flow_graph<Cap, Cost> {\\n using base = flow_graph<Cap, Cost>;\\n using edge_impl = typename base::edge_impl;\\n using base::nil;\\n\\n public:\\n using size_type = typename base::size_type;\\n using base::size;\\n\\n /**\\n * @brief Construct a new min_cost_flow object\\n *\\n * @param __n Number of vertices\\n */\\n min_cost_flow(size_type __n = 0)\\n : base::flow_graph(__n), current(0), abs_sum(0), b(__n), p(__n) {}\\n\\n std::vector<size_type> add_nodes(size_type __n) override {\\n auto __nds = base::add_nodes(__n);\\n b.resize(size());\\n p.resize(size());\\n return __nds;\\n }\\n\\n /**\\n * @brief Add an edge with a unit capacity to the graph.\\n *\\n * @param src Source\\n * @param dst Destination\\n * @param cost Cost\\n * @return Reference to the edge.\\n */\\n auto &add_edge(size_type src, size_type dst, const Cost &cost) {\\n return add_edge(src, dst, 1, cost);\\n }\\n\\n /**\\n * @brief Add an edge to the graph.\\n *\\n * @param src Source\\n * @param dst Destination\\n * @param cap Capacity\\n * @param cost Cost\\n * @return Reference to the edge.\\n */\\n typename base::edge const &add_edge(size_type src, size_type dst,\\n const Cap &cap, const Cost &cost) {\\n edge_impl *__p = base::_add_edge(typename base::edge(src, dst, cap, cost));\\n if (cost < static_cast<Cost>(0)) {\\n __p->flow(cap);\\n b[src] -= cap;\\n b[dst] += cap;\\n current += cap * cost;\\n abs_sum -= cap * cost;\\n } else\\n abs_sum += cap * cost;\\n return *__p;\\n }\\n\\n /**\\n * @brief Add an edge to the graph.\\n *\\n * @param src Source\\n * @param dst Destination\\n * @param lower Lower bound of flow\\n * @param upper Upper bound of flow\\n * @param cost Cost\\n * @return Reference to the edge.\\n */\\n auto &add_edge(size_type src, size_type dst, const Cap &lower,\\n const Cap &upper, const Cost &cost) {\\n assert(!(upper < lower));\\n b[src] -= lower;\\n b[dst] += lower;\\n current += lower * cost;\\n return add_edge(src, dst, upper - lower, cost);\\n }\\n\\n /**\\n * @brief Increase the balance of a node.\\n *\\n * @param node\\n * @param vol Default: 1\\n */\\n void supply(size_type node, const Cap &vol = 1) {\\n assert(node < size());\\n b[node] += vol;\\n }\\n\\n /**\\n * @brief Decrease the balance of a node.\\n *\\n * @param node\\n * @param vol Default: 1\\n */\\n void demand(size_type node, const Cap &vol = 1) {\\n assert(node < size());\\n b[node] -= vol;\\n }\\n\\n /**\\n * @param node\\n * @return Balance of the node\\n */\\n Cap balance(size_type node) { return b[node]; }\\n\\n /**\\n * @return Cost of current flow.\\n */\\n Cost cost() const { return current; }\\n\\n /**\\n * @brief Run Successive Shortest Path Algorithm.\\n *\\n * @return Whether a balanced flow exists.\\n */\\n bool flow() {\\n for (bool aug = true; aug;) {\\n aug = false;\\n std::vector<edge_impl *> last(size());\\n Dijkstra(last);\\n std::vector<bool> shut(size());\\n for (size_type dst{}; dst != size(); ++dst) {\\n if (b[dst] < static_cast<Cap>(0) && last[dst]) {\\n Cap resid{-b[dst]};\\n size_type 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 < b[src])) resid = b[block = src];\\n for (edge_impl *e{last[dst]}; e; e = last[e->src]) {\\n e->cap -= resid;\\n e->rev->cap += resid;\\n }\\n b[src] -= resid;\\n b[dst] += resid;\\n current += p[dst] * resid;\\n aug = true;\\n }\\n if (block != nil)\\n for (size_type node{dst};; node = last[node]->src) {\\n shut[node] = true;\\n if (node == block) break;\\n }\\n }\\n }\\n }\\n return std::none_of(begin(b), end(b), [](const Cap &s) {\\n return s < static_cast<Cap>(0) || static_cast<Cap>(0) < s;\\n });\\n }\\n\\n protected:\\n Cost current, abs_sum;\\n std::vector<Cap> b;\\n std::vector<Cost> p;\\n\\n void Dijkstra(std::vector<edge_impl *> &last) {\\n const Cost infty(abs_sum + 1);\\n std::vector<Cost> newp(size(), infty);\\n\\n if constexpr (Density_tag) { // O(V^2)\\n std::vector<bool> used(size());\\n\\n for (size_type src{}; src != size(); ++src)\\n if (static_cast<Cap>(0) < b[src]) {\\n used[src] = true;\\n newp[src] = 0;\\n\\n for (auto &e : base::graph[src])\\n if (!(static_cast<Cap>(0) < b[e.dst]) &&\\n static_cast<Cap>(0) < e.cap && newp[e.dst] > e.cost)\\n newp[e.dst] = e.cost, last[e.dst] = &e;\\n }\\n\\n for (;;) {\\n size_type src{nil};\\n Cost sp{infty};\\n\\n for (size_type node{}; node != size(); ++node) {\\n if (used[node] || newp[node] == infty) continue;\\n if (Cost __d = newp[node] - p[node]; __d < sp) sp = __d, src = node;\\n }\\n\\n if (src == nil) break;\\n used[src] = true;\\n\\n for (auto &e : base::graph[src])\\n if (static_cast<Cap>(0) < e.cap && newp[src] + e.cost < newp[e.dst]) {\\n newp[e.dst] = newp[src] + e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n\\n else { // O((V + E)logV)\\n struct sp_node {\\n size_type id;\\n Cost __d;\\n sp_node(size_type id, Cost __d) : id(id), __d(__d) {}\\n bool operator<(const sp_node &rhs) const { return rhs.__d < __d; }\\n };\\n\\n std::priority_queue<sp_node> __q;\\n for (size_type src{}; src != size(); ++src)\\n if (b[src] > static_cast<Cap>(0)) {\\n newp[src] = 0;\\n for (auto &e : base::graph[src])\\n if (static_cast<Cap>(0) < e.cap && newp[e.dst] > e.cost) {\\n __q.emplace(e.dst, (newp[e.dst] = e.cost) - p[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n\\n while (!__q.empty()) {\\n auto [src, __d] = __q.top();\\n __q.pop();\\n if (__d + p[src] != newp[src]) continue;\\n for (auto &e : base::graph[src])\\n if (auto __d = newp[src] + e.cost;\\n static_cast<Cap>(0) < e.cap && __d < newp[e.dst]) {\\n __q.emplace(e.dst, (newp[e.dst] = __d) - p[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n\\n p.swap(newp);\\n }\\n};\\n\\ntemplate <class Cap, class Gain = Cap, bool Density_tag = false>\\nclass max_gain_flow : public min_cost_flow<Cap, Gain, Density_tag> {\\n using base = min_cost_flow<Cap, Gain, Density_tag>;\\n using base::cost;\\n\\n public:\\n using base::min_cost_flow;\\n using size_type = typename base::size_type;\\n\\n /**\\n * @brief Add an edge with a unit capacity to the graph.\\n *\\n * @param src Source\\n * @param dst Destination\\n * @param gain Gain\\n * @return Reference to the edge.\\n */\\n auto &add_edge(size_type src, size_type dst, const Gain &gain) {\\n return add_edge(src, dst, 1, gain);\\n }\\n\\n /**\\n * @brief Add an edge to the graph.\\n *\\n * @param src Source\\n * @param dst Destination\\n * @param cap Capacity\\n * @param gain Gain\\n * @return Reference to the edge.\\n */\\n auto &add_edge(size_type src, size_type dst, const Cap &cap,\\n const Gain &gain) {\\n return base::add_edge(src, dst, cap, -gain);\\n }\\n\\n /**\\n * @brief Add an edge to the graph.\\n *\\n * @param src Source\\n * @param dst Destination\\n * @param lower Lower bound of flow\\n * @param upper Upper bound of flow\\n * @param gain Gain\\n * @return Reference to the edge.\\n */\\n auto &add_edge(size_type src, size_type dst, const Cap &lower,\\n const Cap &upper, const Gain &gain) {\\n return base::add_edge(src, dst, lower, upper, -gain);\\n }\\n\\n /**\\n * @return Gain of current flow.\\n */\\n Gain gain() const { return -base::current; }\\n};\\n\\n} // namespace workspace\\n#line 6 \\\"test/aizu-online-judge/2815.test.cpp\\\"\\n\\nint main() {\\n using namespace workspace;\\n\\n int n, m, k;\\n std::cin >> n >> m >> k;\\n\\n min_cost_flow<int, int, 1> mcf;\\n const auto dst = mcf.add_node();\\n const auto dst2 = mcf.add_node();\\n const auto dst3 = mcf.add_node();\\n\\n mcf.demand(dst, n);\\n mcf.add_edge(dst2, dst, n, 0);\\n mcf.add_edge(dst3, dst, n - k, 0);\\n\\n const auto r = mcf.add_nodes(n);\\n for (auto u : r) {\\n mcf.supply(u);\\n std::cin >> k;\\n mcf.add_edge(u, dst2, -k);\\n }\\n\\n const auto f = mcf.add_nodes(m);\\n for (auto v : f) {\\n for (auto u : r) {\\n std::cin >> k;\\n mcf.add_edge(u, v, -k);\\n }\\n }\\n\\n for (auto v : f) {\\n std::cin >> k;\\n mcf.add_edge(v, dst3, k, 0);\\n }\\n\\n assert(mcf.flow());\\n std::cout << -mcf.cost() << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4180,\n \"score_of_the_acc\": -0.645,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2815_5143888\",\n \"code_snippet\": \"#line 1 \\\"test/aizu-online-judge/2815.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/2815\\\"\\n\\n#include <iostream>\\n\\n#line 2 \\\"src/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\n/**\\n * @file min_cost_flow.hpp\\n * @brief Minimum Cost Flow\\n * @date 2021-01-15\\n *\\n *\\n */\\n\\n#include <algorithm>\\n#include <optional>\\n#include <queue>\\n\\n#line 2 \\\"src/graph/directed/flow/base.hpp\\\"\\n\\n/**\\n * @file base.hpp\\n * @brief Flow Graph\\n * @date 2021-01-15\\n *\\n *\\n */\\n\\n#include <cassert>\\n#include <vector>\\n\\nnamespace workspace {\\n\\ntemplate <class Cap, class Cost = void> class flow_graph {\\n public:\\n class adjacency;\\n using value_type = adjacency;\\n using reference = adjacency &;\\n using const_reference = adjacency const &;\\n using container_type = std::vector<value_type>;\\n using size_type = typename container_type::size_type;\\n\\n class unweighted_edge {\\n public:\\n size_type src, dst;\\n Cap cap;\\n unweighted_edge *rev;\\n\\n unweighted_edge() = default;\\n\\n unweighted_edge(size_type src, size_type dst, const Cap &cap,\\n unweighted_edge *rev)\\n : src(src), dst(dst), cap(cap), rev(rev) {\\n assert(!(cap < static_cast<Cap>(0)));\\n }\\n\\n const Cap &flow(const Cap &f = 0) { return cap -= f, rev->cap += f; }\\n\\n unweighted_edge make_rev() { return {dst, src, 0, this}; }\\n };\\n\\n class weighted_edge : public unweighted_edge {\\n public:\\n Cost cost;\\n\\n weighted_edge() = default;\\n\\n weighted_edge(size_type src, size_type dst, const Cap &cap,\\n const Cost &cost, weighted_edge *rev)\\n : unweighted_edge(src, dst, cap, rev), cost(cost) {}\\n\\n weighted_edge make_rev() {\\n return {unweighted_edge::dst, unweighted_edge::src, 0, -cost, this};\\n }\\n };\\n\\n using edge = typename std::conditional<std::is_void<Cost>::value,\\n unweighted_edge, weighted_edge>::type;\\n\\n class adjacency {\\n public:\\n using value_type = edge;\\n using reference = edge &;\\n using const_reference = edge const &;\\n using pointer = edge *;\\n using const_pointer = const edge *;\\n\\n adjacency() : first(new edge[1]), iter(first), last(first + 1) {}\\n ~adjacency() { delete[] first; }\\n\\n template <class... Args> reference emplace(Args &&... args) {\\n if (iter == last) {\\n size_type len(last - first);\\n edge *nfst = iter = new edge[len << 1];\\n for (edge *p{first}; p != last; ++p, ++iter)\\n p->rev->rev = iter, *iter = *p;\\n delete[] first;\\n first = nfst;\\n last = iter + len;\\n }\\n return *iter++ = edge(args...);\\n }\\n\\n reference operator[](size_type i) {\\n assert(i < size());\\n return *(first + i);\\n }\\n const_reference operator[](size_type i) const {\\n assert(i < size());\\n return *(first + i);\\n }\\n\\n size_type size() const { return iter - first; }\\n\\n pointer begin() { return first; }\\n const_pointer begin() const { return first; }\\n\\n pointer end() { return iter; }\\n const_pointer end() const { return iter; }\\n\\n protected:\\n pointer first, iter, last;\\n };\\n\\n /**\\n * @brief Construct a new flow base object\\n *\\n * @param n Number of vertices\\n */\\n flow_graph(size_type n = 0) : graph(n) {}\\n\\n flow_graph(const flow_graph &other) : graph(other.size()) {\\n for (size_type node = 0; node != size(); ++node)\\n for (edge cp : other[node])\\n if (cp.src == node) {\\n edge rcp = *cp.rev;\\n cp.rev->src = nil;\\n edge &ref = graph[node].emplace(cp);\\n rcp.rev = &ref;\\n ref.rev = &graph[cp.dst].emplace(rcp);\\n } else\\n cp.rev->rev->src = node;\\n }\\n\\n flow_graph &operator=(const flow_graph &rhs) {\\n if (this != &rhs) graph.swap(flow_graph(rhs).graph);\\n return *this;\\n }\\n\\n /**\\n * @return Number of vertices.\\n */\\n size_type size() const { return graph.size(); }\\n\\n reference operator[](size_type node) {\\n assert(node < size());\\n return graph[node];\\n }\\n\\n const_reference &operator[](size_type node) const {\\n assert(node < size());\\n return graph[node];\\n }\\n\\n typename container_type::iterator begin() { return graph.begin(); }\\n\\n typename container_type::iterator end() { return graph.end(); }\\n\\n typename container_type::const_iterator begin() const {\\n return graph.begin();\\n }\\n\\n typename container_type::const_iterator end() const { return graph.end(); }\\n\\n template <class... Args>\\n typename adjacency::reference add_edge(size_type src, size_type dst,\\n Args &&... args) {\\n assert(src < size());\\n assert(dst < size());\\n auto &ref = graph[src].emplace(src, dst, args..., nullptr);\\n ref.rev = &graph[dst].emplace(ref.make_rev());\\n return ref;\\n }\\n\\n protected:\\n constexpr static size_type nil = -1;\\n container_type graph;\\n};\\n\\n} // namespace workspace\\n#line 16 \\\"src/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Successive Shortest Path Algorithm.\\n *\\n * @tparam Cap Capacity type\\n * @tparam Cost Cost type\\n * @tparam Density_tag Whether the graph is dense.\\n */\\ntemplate <class Cap, class Cost, bool Density_tag = false>\\nclass min_cost_flow : public flow_graph<Cap, Cost> {\\n using base = flow_graph<Cap, Cost>;\\n using base::nil;\\n\\n public:\\n using edge = typename base::edge;\\n using size_type = typename base::size_type;\\n\\n protected:\\n Cost current, abs_sum;\\n std::vector<Cap> b;\\n std::vector<Cost> p;\\n\\n void copy(const min_cost_flow &other) {\\n current = other.current;\\n abs_sum = other.abs_sum;\\n b = other.b;\\n p = other.p;\\n }\\n\\n void Dijkstra(std::vector<edge *> &last) {\\n const Cost infty(abs_sum + 1);\\n std::vector<Cost> newp(size(), infty);\\n if constexpr (Density_tag) { // O(V^2)\\n std::vector<bool> used(size());\\n for (size_type src{}; src != size(); ++src) {\\n if (static_cast<Cap>(0) < b[src]) {\\n used[src] = true;\\n newp[src] = 0;\\n for (edge &e : base::graph[src]) {\\n if (static_cast<Cap>(0) < b[e.dst]) continue;\\n if (static_cast<Cap>(0) < e.cap && e.cost < newp[e.dst]) {\\n newp[e.dst] = e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n for (;;) {\\n size_type src{nil};\\n Cost sp{infty};\\n for (size_type node{}; node != size(); ++node) {\\n if (used[node] || newp[node] == infty) continue;\\n Cost dist{newp[node] - p[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 &e : base::graph[src]) {\\n if (static_cast<Cap>(0) < e.cap && newp[src] + e.cost < newp[e.dst]) {\\n newp[e.dst] = newp[src] + e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n } else { // O((V + E)logV)\\n struct sp_node {\\n size_type id;\\n Cost dist;\\n sp_node(size_type id, Cost dist) : id(id), dist(dist) {}\\n bool operator<(const sp_node &rhs) const { return rhs.dist < dist; }\\n };\\n std::priority_queue<sp_node> q;\\n for (size_type src{}; src != size(); ++src)\\n if (static_cast<Cap>(0) < b[src]) {\\n newp[src] = 0;\\n for (edge &e : base::graph[src])\\n if (!(static_cast<Cap>(0) < b[e.dst]) &&\\n static_cast<Cap>(0) < e.cap && newp[e.dst] > e.cost) {\\n q.emplace(e.dst, (newp[e.dst] = e.cost) - p[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n while (!q.empty()) {\\n auto [src, ndist] = q.top();\\n q.pop();\\n if (ndist + p[src] != newp[src]) continue;\\n for (edge &e : base::graph[src])\\n if (static_cast<Cap>(0) < e.cap && newp[e.dst] > newp[src] + e.cost) {\\n q.emplace(e.dst, (newp[e.dst] = newp[src] + e.cost) - p[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n p.swap(newp);\\n }\\n\\n public:\\n using base::size;\\n\\n /**\\n * @brief Construct a new object\\n *\\n * @param n Number of vertices.\\n */\\n min_cost_flow(size_type n = 0)\\n : base::flow_graph(n), current(0), abs_sum(0), b(n), p(n) {}\\n\\n min_cost_flow(const min_cost_flow &other) : base::flow_graph(other) {\\n copy(other);\\n }\\n\\n min_cost_flow &operator=(const min_cost_flow &other) {\\n base::operator=(other);\\n copy(other);\\n return *this;\\n }\\n\\n // infinity capatity\\n // edge *add_edge(size_type src, size_type dst, const Cost &cost);\\n\\n /**\\n * @brief Add an edge to the graph.\\n *\\n * @param src Source\\n * @param dst Destination\\n * @param cap Capacity\\n * @param cost Cost\\n * @return Reference to the edge.\\n */\\n typename base::adjacency::reference add_edge(size_type src, size_type dst,\\n const Cap &cap,\\n const Cost &cost) {\\n assert(src != dst);\\n if (cost < static_cast<Cost>(0)) {\\n b[src] -= cap;\\n b[dst] += cap;\\n current += cap * cost;\\n abs_sum -= cap * cost;\\n return base::add_edge(dst, src, cap, -cost);\\n }\\n abs_sum += cap * cost;\\n return base::add_edge(src, dst, cap, cost);\\n }\\n\\n /**\\n * @brief Add an edge to the graph.\\n *\\n * @param src Source\\n * @param dst Destination\\n * @param lower Lower bound of flow\\n * @param upper Upper bound of flow\\n * @param cost Cost\\n * @return Reference to the edge.\\n */\\n typename base::adjacency::reference add_edge(size_type src, size_type dst,\\n const Cap &lower,\\n const Cap &upper,\\n const Cost &cost) {\\n assert(!(upper < lower));\\n b[src] -= lower;\\n b[dst] += lower;\\n current += lower * cost;\\n return add_edge(src, dst, upper - lower, cost);\\n }\\n\\n /**\\n * @brief Increase the balance of a node.\\n *\\n * @param node\\n * @param vol\\n */\\n void supply(size_type node, const Cap &vol) {\\n assert(node < size());\\n b[node] += vol;\\n }\\n\\n /**\\n * @brief Decrease the balance of a node.\\n *\\n * @param node\\n * @param vol\\n */\\n void demand(size_type node, const Cap &vol) { supply(node, -vol); }\\n\\n /**\\n * @param node\\n * @return Balance of the node\\n */\\n Cap balance(size_type node) { return b[node]; }\\n\\n /**\\n * @return Cost of current flow.\\n */\\n Cost cost() const { return current; }\\n\\n /**\\n * @brief Run Successive Shortest Path Algorithm.\\n *\\n * @return Whether a balanced flow exists.\\n */\\n bool flow() {\\n for (bool aug = true; aug;) {\\n aug = false;\\n std::vector<edge *> last(size());\\n Dijkstra(last);\\n std::vector<bool> shut(size());\\n for (size_type dst{}; dst != size(); ++dst) {\\n if (b[dst] < static_cast<Cap>(0) and last[dst]) {\\n Cap resid{-b[dst]};\\n size_type 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 < b[src])) resid = b[block = src];\\n for (edge *e{last[dst]}; e; e = last[e->src]) {\\n e->cap -= resid;\\n e->rev->cap += resid;\\n }\\n b[src] -= resid;\\n b[dst] += resid;\\n current += p[dst] * resid;\\n aug = true;\\n }\\n if (~block) {\\n for (size_type 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(b), end(b), [](const Cap &s) {\\n return s < static_cast<Cap>(0) || static_cast<Cap>(0) < s;\\n });\\n }\\n};\\n\\n} // namespace workspace\\n#line 6 \\\"test/aizu-online-judge/2815.test.cpp\\\"\\n\\nint main() {\\n using namespace workspace;\\n\\n int n, m, k;\\n std::cin >> n >> m >> k;\\n const int total = n + m + 3;\\n const int dst = total - 1;\\n const int dst2 = total - 2;\\n const int dst3 = total - 3;\\n min_cost_flow<int, int, true> mcf(total);\\n mcf.supply(dst, -n);\\n mcf.add_edge(dst2, dst, n, 0);\\n mcf.add_edge(dst3, dst, n - k, 0);\\n for (int i = 0; i < n; ++i) {\\n mcf.supply(i, 1);\\n std::cin >> k;\\n mcf.add_edge(i, dst2, 1, -k);\\n }\\n for (int j = 0; j < m; j++) {\\n for (int i = 0; i < n; i++) {\\n std::cin >> k;\\n mcf.add_edge(i, j + n, 1, -k);\\n }\\n }\\n for (int j = 0; j < m; j++) {\\n std::cin >> k;\\n mcf.add_edge(j + n, dst3, k, 0);\\n }\\n assert(mcf.flow());\\n std::cout << -mcf.cost() << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4320,\n \"score_of_the_acc\": -0.759,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2815_4019942\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n/* std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool dijkstra(size_t s, size_t t)\\n {\\n // using info = std::pair<cost_t, size_t>;\\n // std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n // fill(dist.begin(), dist.end(), inf_cost);\\n // que.emplace(dist[s] = 0, s);\\n // while(!que.empty())\\n // {\\n // cost_t _cost; size_t v;\\n // std::tie(_cost, v) = que.top(), que.pop();\\n // if(_cost != dist[v]) continue;\\n // for(auto &&e : adj[v])\\n // {\\n // if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n // {\\n // que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n // prev_v[e.to] = v;\\n // prev_e[e.to] = &e;\\n // }\\n // }\\n // }\\n\\n bool *used = new bool[V]{};\\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\\n {\\n size_t nowv = -1;\\n cost_t opt = inf_cost;\\n for(size_t v = 0; v != V; ++v)\\n {\\n if(!used[v] && opt > dist[v] + h[v])\\n {\\n opt = dist[v] + h[v];\\n nowv = v;\\n }\\n }\\n if(nowv == -1) break;\\n used[nowv] = true;\\n for(auto &&e : adj[nowv])\\n {\\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\\n {\\n dist[e.to] = opt - h[e.to] + e.cost;\\n prev_v[e.to] = nowv;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n delete[] used;\\n\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n } */\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n std::vector<cost_t> h(V);\\n std::vector<size_t> prev_v(V);\\n std::vector<edge*> prev_e(V);\\n bool *const used = new bool[V];\\n while(f > 0)\\n {\\n std::fill_n(used, V, false);\\n std::vector<cost_t> dist(V, inf_cost);\\n using info = std::pair<cost_t, size_t>;\\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n que.emplace(dist[s] = 0, s);\\n while(!que.empty())\\n {\\n cost_t _cost; size_t v;\\n std::tie(_cost, v) = que.top(), que.pop();\\n if(_cost != dist[v]) continue;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n {\\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n if(dist[t] >= inf_cost)\\n {\\n res = inf_cost;\\n break;\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n cap_t d = f;\\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(size_t v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n delete[] used;\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3700,\n \"score_of_the_acc\": -0.9175,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2815_4019936\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n/* std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool dijkstra(size_t s, size_t t)\\n {\\n // using info = std::pair<cost_t, size_t>;\\n // std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n // fill(dist.begin(), dist.end(), inf_cost);\\n // que.emplace(dist[s] = 0, s);\\n // while(!que.empty())\\n // {\\n // cost_t _cost; size_t v;\\n // std::tie(_cost, v) = que.top(), que.pop();\\n // if(_cost != dist[v]) continue;\\n // for(auto &&e : adj[v])\\n // {\\n // if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n // {\\n // que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n // prev_v[e.to] = v;\\n // prev_e[e.to] = &e;\\n // }\\n // }\\n // }\\n\\n bool *used = new bool[V]{};\\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\\n {\\n size_t nowv = -1;\\n cost_t opt = inf_cost;\\n for(size_t v = 0; v != V; ++v)\\n {\\n if(!used[v] && opt > dist[v] + h[v])\\n {\\n opt = dist[v] + h[v];\\n nowv = v;\\n }\\n }\\n if(nowv == -1) break;\\n used[nowv] = true;\\n for(auto &&e : adj[nowv])\\n {\\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\\n {\\n dist[e.to] = opt - h[e.to] + e.cost;\\n prev_v[e.to] = nowv;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n delete[] used;\\n\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n } */\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n std::vector<cost_t> h(V);\\n std::vector<size_t> prev_v(V);\\n std::vector<edge*> prev_e(V);\\n bool *const used = new bool[V];\\n while(f > 0)\\n {\\n std::fill_n(used, V, false);\\n std::vector<cost_t> dist(V, inf_cost);\\n dist[s] = 0;\\n while(true)\\n {\\n size_t v = -1;\\n cost_t opt = inf_cost;\\n for(size_t u = 0; u != V; ++u)\\n {\\n if(!used[u] && opt > dist[u])\\n {\\n opt = dist[u];\\n v = u;\\n }\\n }\\n if(v == -1) break;\\n opt += h[v];\\n used[v] = true;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\\n {\\n dist[e.to] = opt - h[e.to] + e.cost;\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n if(dist[t] >= inf_cost)\\n {\\n res = inf_cost;\\n break;\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n cap_t d = f;\\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(size_t v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n delete[] used;\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1050,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -1.1726,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2815_4019912\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool *used;\\n bool dijkstra(size_t s, size_t t)\\n {\\n/* using info = std::pair<cost_t, size_t>;\\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n fill(dist.begin(), dist.end(), inf_cost);\\n que.emplace(dist[s] = 0, s);\\n while(!que.empty())\\n {\\n cost_t _cost; size_t v;\\n std::tie(_cost, v) = que.top(), que.pop();\\n if(_cost != dist[v]) continue;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n {\\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n*/\\n // bool *used = new bool[V]{};\\n for(std::fill_n(used, V, false), fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\\n {\\n size_t nowv = -1;\\n cost_t opt = inf_cost;\\n for(size_t v = 0; v != V; ++v)\\n {\\n if(!used[v] && opt > dist[v])\\n {\\n opt = dist[v];\\n nowv = v;\\n }\\n }\\n if(nowv == -1) break;\\n opt += h[nowv];\\n used[nowv] = true;\\n for(auto &&e : adj[nowv])\\n {\\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\\n {\\n dist[e.to] = opt - h[e.to] + e.cost;\\n prev_v[e.to] = nowv;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n // delete[] used;\\n\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n }\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n ~Primal_Dual() { delete[] used; }\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n // delete[] used; \\n used = new bool[V];\\n dist.resize(V), h.assign(V, 0);\\n prev_v.resize(V), prev_e.resize(V);\\n while(f > 0)\\n {\\n if(!dijkstra(s, t)) return inf_cost;\\n cap_t d = f;\\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(size_t v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1040,\n \"memory_kb\": 3644,\n \"score_of_the_acc\": -1.1989,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2815_4019908\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool *const used;\\n bool dijkstra(size_t s, size_t t)\\n {\\n/* using info = std::pair<cost_t, size_t>;\\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n fill(dist.begin(), dist.end(), inf_cost);\\n que.emplace(dist[s] = 0, s);\\n while(!que.empty())\\n {\\n cost_t _cost; size_t v;\\n std::tie(_cost, v) = que.top(), que.pop();\\n if(_cost != dist[v]) continue;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n {\\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n*/\\n // bool *used = new bool[V]{};\\n for(std::fill_n(used, V, false), fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\\n {\\n size_t nowv = -1;\\n cost_t opt = inf_cost;\\n for(size_t v = 0; v != V; ++v)\\n {\\n if(!used[v] && opt > dist[v])\\n {\\n opt = dist[v];\\n nowv = v;\\n }\\n }\\n if(nowv == -1) break;\\n opt += h[nowv];\\n used[nowv] = true;\\n for(auto &&e : adj[nowv])\\n {\\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\\n {\\n dist[e.to] = opt - h[e.to] + e.cost;\\n prev_v[e.to] = nowv;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n // delete[] used;\\n\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n }\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost(), used(new bool[V]) {}\\n ~Primal_Dual() { delete[] used; }\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n dist.resize(V), h.assign(V, 0);\\n prev_v.resize(V), prev_e.resize(V);\\n while(f > 0)\\n {\\n if(!dijkstra(s, t)) return inf_cost;\\n cap_t d = f;\\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(size_t v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n\\n}\",\n \"accuracy\": 0.1686746987951807,\n \"time_ms\": 440,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.547,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2815_4019901\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool dijkstra(size_t s, size_t t)\\n {\\n/* using info = std::pair<cost_t, size_t>;\\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n fill(dist.begin(), dist.end(), inf_cost);\\n que.emplace(dist[s] = 0, s);\\n while(!que.empty())\\n {\\n cost_t _cost; size_t v;\\n std::tie(_cost, v) = que.top(), que.pop();\\n if(_cost != dist[v]) continue;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n {\\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n*/\\n bool *used = new bool[V]{};\\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\\n {\\n size_t nowv = -1;\\n cost_t opt = inf_cost;\\n for(size_t v = 0; v != V; ++v)\\n {\\n if(!used[v] && opt > dist[v])\\n {\\n opt = dist[v];\\n nowv = v;\\n }\\n }\\n if(nowv == -1) break;\\n opt += h[nowv];\\n used[nowv] = true;\\n for(auto &&e : adj[nowv])\\n {\\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\\n {\\n dist[e.to] = opt - h[e.to] + e.cost;\\n prev_v[e.to] = nowv;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n delete[] used;\\n\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n }\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n dist.resize(V), h.assign(V, 0);\\n prev_v.resize(V), prev_e.resize(V);\\n while(f > 0)\\n {\\n if(!dijkstra(s, t)) return inf_cost;\\n cap_t d = f;\\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(size_t v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1040,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -1.1858,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2815_4019895\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool dijkstra(size_t s, size_t t)\\n {\\n/* using info = std::pair<cost_t, size_t>;\\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n fill(dist.begin(), dist.end(), inf_cost);\\n que.emplace(dist[s] = 0, s);\\n while(!que.empty())\\n {\\n cost_t _cost; size_t v;\\n std::tie(_cost, v) = que.top(), que.pop();\\n if(_cost != dist[v]) continue;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n {\\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n*/\\n bool *used = new bool[V]{};\\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\\n {\\n size_t nowv = -1;\\n cost_t opt = inf_cost * 2;\\n for(size_t v = 0; v != V; ++v)\\n {\\n if(!used[v] && opt > dist[v] + h[v])\\n {\\n opt = dist[v] + h[v];\\n nowv = v;\\n }\\n }\\n if(nowv == -1) break;\\n used[nowv] = true;\\n for(auto &&e : adj[nowv])\\n {\\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\\n {\\n dist[e.to] = opt - h[e.to] + e.cost;\\n prev_v[e.to] = nowv;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n delete[] used;\\n\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n }\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n dist.resize(V), h.assign(V, 0);\\n prev_v.resize(V), prev_e.resize(V);\\n while(f > 0)\\n {\\n if(!dijkstra(s, t)) return inf_cost;\\n cap_t d = f;\\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(size_t v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n\\n}\",\n \"accuracy\": 0.1686746987951807,\n \"time_ms\": 390,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.5608,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2815_4019891\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool dijkstra(size_t s, size_t t)\\n {\\n using info = std::pair<cost_t, size_t>;\\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n fill(dist.begin(), dist.end(), inf_cost);\\n que.emplace(dist[s] = 0, s);\\n while(!que.empty())\\n {\\n cost_t _cost; size_t v;\\n std::tie(_cost, v) = que.top(), que.pop();\\n if(_cost != dist[v]) continue;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n {\\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n/*\\n bool *used = new bool[V]{};\\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\\n {\\n size_t nowv = -1;\\n cost_t opt = inf_cost;\\n for(size_t v = 0; v != V; ++v)\\n {\\n if(!used[v] && opt > dist[v] + h[v])\\n {\\n opt = dist[v] + h[v];\\n nowv = v;\\n }\\n }\\n if(nowv == -1) break;\\n used[nowv] = true;\\n for(auto &&e : adj[nowv])\\n {\\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\\n {\\n dist[e.to] = opt - h[e.to] + e.cost;\\n prev_v[e.to] = nowv;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n delete[] used;\\n*/\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n }\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n dist.resize(V), h.assign(V, 0);\\n prev_v.resize(V), prev_e.resize(V);\\n while(f > 0)\\n {\\n if(!dijkstra(s, t)) return inf_cost;\\n cap_t d = f;\\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(size_t v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 710,\n \"memory_kb\": 3760,\n \"score_of_the_acc\": -0.976,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2815_4019870\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool dijkstra(size_t s, size_t t)\\n {\\n // using info = std::pair<cost_t, size_t>;\\n // std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n // fill(dist.begin(), dist.end(), inf_cost);\\n // que.emplace(dist[s] = 0, s);\\n // while(!que.empty())\\n // {\\n // cost_t _cost; size_t v;\\n // std::tie(_cost, v) = que.top(), que.pop();\\n // if(_cost != dist[v]) continue;\\n // for(auto &&e : adj[v])\\n // {\\n // if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n // {\\n // que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n // prev_v[e.to] = v;\\n // prev_e[e.to] = &e;\\n // }\\n // }\\n // }\\n\\n bool *used = new bool[V]{};\\n for(fill(dist.begin(), dist.end(), inf_cost), dist[s] = 0; ; )\\n {\\n size_t nowv = -1;\\n cost_t opt = inf_cost;\\n for(size_t v = 0; v != V; ++v)\\n {\\n if(!used[v] && opt > dist[v] + h[v])\\n {\\n opt = dist[v] + h[v];\\n nowv = v;\\n }\\n }\\n if(nowv == -1) break;\\n used[nowv] = true;\\n for(auto &&e : adj[nowv])\\n {\\n if(e.cap > 0 && dist[e.to] + h[e.to] > opt + e.cost)\\n {\\n dist[e.to] = opt - h[e.to] + e.cost;\\n prev_v[e.to] = nowv;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n delete[] used;\\n\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n }\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n dist.resize(V), h.assign(V, 0);\\n prev_v.resize(V), prev_e.resize(V);\\n while(f > 0)\\n {\\n if(!dijkstra(s, t)) return inf_cost;\\n cap_t d = f;\\n for(size_t v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(size_t v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n\\n}\",\n \"accuracy\": 0.1686746987951807,\n \"time_ms\": 400,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.5216,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2815_4017429\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool dijkstra(size_t s, size_t t)\\n {\\n using info = std::pair<cost_t, size_t>;\\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n fill(dist.begin(), dist.end(), inf_cost);\\n que.emplace(dist[s] = 0, s);\\n while(!que.empty())\\n {\\n cost_t _cost; size_t v;\\n std::tie(_cost, v) = que.top(), que.pop();\\n if(_cost != dist[v]) continue;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n {\\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n }\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n dist.resize(V), h.assign(V, 0);\\n prev_v.resize(V), prev_e.resize(V);\\n while(f > 0)\\n {\\n if(!dijkstra(s, t)) return inf_cost;\\n cap_t d = f;\\n for(int v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(int v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n \\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 3724,\n \"score_of_the_acc\": -0.9178,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2815_4017427\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool dijkstra(size_t s, size_t t)\\n {\\n using info = std::pair<cost_t, size_t>;\\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n fill(dist.begin(), dist.end(), inf_cost);\\n que.emplace(dist[s] = 0, s);\\n while(!que.empty())\\n {\\n cost_t _cost; size_t v;\\n std::tie(_cost, v) = que.top(), que.pop();\\n if(_cost != dist[v]) continue;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n {\\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n }\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n std::vector<cap_t> scap(V), tcap(V);\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n scap[e.to] += e.cap;\\n tcap[v] += e.cap;\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n add_edge(s, v, scap[v], 0);\\n add_edge(v, t, tcap[v], 0);\\n }\\n }\\n dist.resize(V), h.assign(V, 0);\\n prev_v.resize(V), prev_e.resize(V);\\n while(f > 0)\\n {\\n if(!dijkstra(s, t)) return inf_cost;\\n cap_t d = f;\\n for(int v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(int v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 3692,\n \"score_of_the_acc\": -0.9014,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2815_4017423\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace std\\n{\\n // hash\\n template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }\\n template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };\\n template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };\\n template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };\\n template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };\\n // iostream\\n template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }\\n template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }\\n template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };\\n template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };\\n template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }\\n template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }\\n template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>\\n ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }\\n} // namespace std\\n\\n\\ntemplate <class cap_t, class cost_t>\\nstruct Flow\\n{\\n Flow(size_t _V) : V(_V), adj(_V) {}\\n void add_edge(size_t from, size_t to, cap_t cap, cost_t cost = cost_t(0))\\n {\\n if(cap <= 0) return;\\n adj[from].emplace_back(from, to, cap, cost, adj[to].size());\\n adj[to].emplace_back(to, from, 0, -cost, adj[from].size() - 1);\\n }\\n protected:\\n struct edge\\n {\\n size_t from, to; cap_t cap; cost_t cost; size_t rev;\\n edge(size_t _from, size_t _to, cap_t _cap, cost_t _cost, size_t _rev) : from(_from), to(_to), cap(_cap), cost(_cost), rev(_rev) {}\\n }; // struct edge\\n size_t V;\\n std::vector<std::vector<edge>> adj;\\n}; // struct Flow\\n\\ntemplate <class cap_t, class cost_t>\\nclass Primal_Dual : public Flow<cap_t, cost_t>\\n{\\n using edge = typename Flow<cap_t, cap_t>::edge;\\n using Flow<cap_t, cap_t>::V; using Flow<cap_t, cap_t>::adj;\\n bool neg_cost;\\n std::vector<cost_t> dist, h;\\n std::vector<size_t> prev_v;\\n std::vector<edge*> prev_e;\\n bool dijkstra(size_t s, size_t t)\\n {\\n using info = std::pair<cost_t, size_t>;\\n std::priority_queue<info, std::vector<info>, std::greater<info>> que;\\n fill(dist.begin(), dist.end(), inf_cost);\\n que.emplace(dist[s] = 0, s);\\n while(!que.empty())\\n {\\n cost_t _cost; size_t v;\\n std::tie(_cost, v) = que.top(), que.pop();\\n if(_cost != dist[v]) continue;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 && dist[v] + h[v] + e.cost < dist[e.to] + h[e.to])\\n {\\n que.emplace(dist[e.to] = dist[v] + h[v] - h[e.to] + e.cost, e.to);\\n prev_v[e.to] = v;\\n prev_e[e.to] = &e;\\n }\\n }\\n }\\n if(dist[t] >= inf_cost) return false;\\n for(size_t v = 0; v != V; ++v)\\n {\\n h[v] += dist[v];\\n if(h[v] > inf_cost) h[v] = inf_cost;\\n }\\n return true;\\n }\\n public:\\n const cost_t inf_cost = std::numeric_limits<cost_t>::max() / 4;\\n Primal_Dual(size_t V) : Flow<cap_t, cost_t>(V), neg_cost() {}\\n void add_edge(size_t s, size_t t, cap_t cap, cost_t cost)\\n {\\n if(cap <= 0) return;\\n if(cost < 0) neg_cost = true;\\n Flow<cap_t, cost_t>::add_edge(s, t, cap, cost);\\n }\\n cost_t min_cost_flow(size_t s, size_t t, cap_t f)\\n {\\n cost_t res = 0;\\n if(neg_cost)\\n {\\n neg_cost = false;\\n {\\n const size_t _s = V++, _t = V++;\\n adj.resize(V);\\n add_edge(_s, s, f, 0);\\n add_edge(t, _t, f, 0);\\n s = _s, t = _t;\\n }\\n for(size_t v = 0; v != V; ++v)\\n {\\n cap_t cap_sum = 0;\\n for(auto &&e : adj[v])\\n {\\n if(e.cap > 0 and e.cost < 0)\\n {\\n add_edge(s, e.to, e.cap, 0);\\n res += e.cap * e.cost;\\n f += e.cap;\\n adj[e.to][e.rev].cap += e.cap;\\n cap_sum += e.cap;\\n e.cap = 0;\\n }\\n }\\n add_edge(v, t, cap_sum, 0);\\n }\\n }\\n dist.resize(V), h.assign(V, 0);\\n prev_v.resize(V), prev_e.resize(V);\\n while(f > 0)\\n {\\n if(!dijkstra(s, t)) return inf_cost;\\n cap_t d = f;\\n for(int v = t; v != s; v = prev_v[v]) d = std::min(d, prev_e[v]->cap);\\n f -= d, res += h[t] * d;\\n for(int v = t; v != s; v = prev_v[v])\\n {\\n prev_e[v]->cap -= d;\\n adj[v][prev_e[v]->rev].cap += d;\\n }\\n }\\n return res;\\n }\\n}; // class Primal_Dual\\n\\nmain()\\n{\\n using namespace std;\\n int n,m,k; cin>>n>>m>>k;\\n Primal_Dual<int,int> flow(2+n+m);\\n vector<int> a(n); cin>>a;\\n const int s=n+m,t=s+1;\\n for(int i=0; i<m; ++i)\\n {\\n for(int j=0; j<n; ++j)\\n {\\n int b; cin>>b;\\n flow.add_edge(i,j+m,1,-b);\\n }\\n }\\n for(int i=m; i<m+n; ++i)\\n {\\n flow.add_edge(i,t,1,a[i-m]);\\n }\\n for(int i=0; i<m; ++i)\\n {\\n int t; cin>>t;\\n flow.add_edge(s,i,t,0);\\n }\\n flow.add_edge(s,t,n,0);\\n cout << accumulate(a.begin(),a.end(),0)-flow.min_cost_flow(s,t,n-k) << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 970,\n \"memory_kb\": 4616,\n \"score_of_the_acc\": -1.9231,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2815_3991575\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD = 1e9 + 7;\\nusing PII = pair<ll, ll>;\\n#define FOR(i,a,n) for(ll i=(ll)a; i<(ll)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\nconst ll INF = 1LL << 60;\\ntemplate<typename T> void chmin(T &a, T b) { a = min(a, b); }\\n\\nstruct min_cost_max_flow {\\n\\tstruct edge {\\n\\t\\tint to;\\n\\t\\tll cap, cost;\\n\\t\\tint rev;\\n\\t\\tbool isrev;\\n\\t};\\n\\n\\tint n, s, t;\\n\\tll neg;\\n\\tvector<vector<edge>> g;\\n\\tvector<ll> d, h, dist, prevv, preve;\\n\\n\\tll flow(vector<ll> d0) {\\n\\t\\tll res = 0;\\n\\t\\tpriority_queue<PII, vector<PII>, greater<PII>> que;\\n\\t\\th.assign(n, 0);\\n\\t\\tpreve.assign(n, -1);\\n\\t\\tprevv.assign(n, -1);\\n\\t\\tll f = 0;\\n\\t\\tREP(i, d.size()) {\\n\\t\\t\\tif (i < (ll)d0.size()) d[i] += d0[i];\\n\\t\\t\\tif (d[i] > 0) add_edge(s, i, d[i], 0), f += d[i];\\n\\t\\t\\telse if (d[i] < 0) add_edge(i, t, -d[i], 0);\\n\\t\\t}\\n\\t\\twhile (f > 0) {\\n\\t\\t\\tdist.assign(n, INF);\\n\\t\\t\\tdist[s] = 0;\\n\\t\\t\\tque.push({ 0, s });\\n\\t\\t\\twhile (que.size()) {\\n\\t\\t\\t\\tPII p = que.top(); que.pop();\\n\\t\\t\\t\\tint v = p.second;\\n\\t\\t\\t\\tif (dist[v] < p.first) continue;\\n\\t\\t\\t\\tREP(i, g[v].size()) {\\n\\t\\t\\t\\t\\tedge &e = g[v][i];\\n\\t\\t\\t\\t\\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\\n\\t\\t\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\\n\\t\\t\\t\\t\\t\\tprevv[e.to] = v;\\n\\t\\t\\t\\t\\t\\tpreve[e.to] = i;\\n\\t\\t\\t\\t\\t\\tque.push({ dist[e.to], e.to });\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist[t] == INF) return -1;\\n\\t\\t\\tREP(v, n) h[v] += dist[v];\\n\\t\\t\\tll d = f;\\n\\t\\t\\tfor (int v = t; v != s; v = prevv[v]) {\\n\\t\\t\\t\\tchmin(d, g[prevv[v]][preve[v]].cap);\\n\\t\\t\\t}\\n\\t\\t\\tf -= d; res += d * h[t];\\n\\t\\t\\tfor (int v = t; v != s; v = prevv[v]) {\\n\\t\\t\\t\\tedge &e = g[prevv[v]][preve[v]];\\n\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\tg[v][e.rev].cap += d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn neg + res;\\n\\t} \\n\\n\\tmin_cost_max_flow(int n0) : n(n0+2), s(n0), t(n0+1), neg(0), g(n0+2), d(n0+2) {}\\n\\n\\tvoid add_edge(int from, int to, ll cap, ll cost) {\\n\\t\\tif (cost >= 0) {\\n\\t\\t\\tg[from].push_back({ to, cap, cost, (int)g[to].size(), false });\\n\\t\\t\\tg[to].push_back({ from, 0, -cost, (int)g[from].size() - 1, true });\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\td[from] -= cap;\\n\\t\\t\\td[to] += cap;\\n\\t\\t\\tneg += cap * cost;\\n\\t\\t\\tadd_edge(to, from, cap, -cost);\\n\\t\\t}\\n\\t}\\n\\n\\tll flow(int S, int T, ll f) {\\n\\t\\tvector<ll> d0(n);\\n\\t\\td0[S] = f, d0[T] = -f;\\n\\t\\treturn flow(d0);\\n\\t}\\n};\\n\\nint main() {\\n\\tll n, m, k;\\n\\tcin >> n >> m >> k;\\n\\tvector<ll> a(n), T(m);\\n\\tvector<vector<ll>> b(m, vector<ll>(n));\\n\\tREP(i, n) cin >> a[i];\\n\\tREP(i, m) REP(j, n) cin >> b[i][j];\\n\\tREP(i, m) cin >> T[i];\\n\\n\\tmin_cost_max_flow graph(n + m + 4);\\n\\tll s = n + m + 2, t = n + m + 3, x = n + m, y = n + m + 1;\\n\\tgraph.add_edge(s, x, n, 0);\\n\\tgraph.add_edge(s, y, n-k, 0);\\n\\tREP(i, m) graph.add_edge(y, i, T[i], 0);\\n\\tREP(i, n) graph.add_edge(m + i, t, 1, 0);\\n\\tREP(i, n) graph.add_edge(x, m + i, 1, -a[i]);\\n\\tREP(i, m) REP(j, n) graph.add_edge(i, m + j, 1, -b[i][j]);\\n\\n\\tcout << -graph.flow(s, t, n) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 840,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -1.2704,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2815_2797329\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n#define loop(i,a,b) for(int i=a;i<b;i++)\\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\nusing namespace std;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\nconst int inf=1e8;\\nstruct edge{\\n int to,cap,cost,rev;\\n};\\ntypedef vector<edge> ve;\\ntypedef vector<ve> vve;\\nclass MCF{ //Minimum Cost Flow\\npublic:\\n int n;\\n vve G;\\n vi h,dist,prev,pree;\\n MCF(int size){\\n n=size;\\n G=vve(n);\\n h=dist=prev=pree=vi(n);\\n }\\n void add_edge(int s,int t,int ca,int co){\\n edge e={t,ca,co,(int)G[t].size()};\\n G[s].pb(e);\\n edge ee={s,0,-co,(int)G[s].size()-1};\\n G[t].pb(ee);\\n }\\n int mcf(int s,int t,int f){\\n int out=0;\\n h=vi(n);\\n while(f>0){\\n priority_queue<pii,vector<pii> >q;\\n dist=vi(n,inf);\\n dist[s]=0;\\n q.push(pii(0,s));\\n while(!q.empty()){\\n pii p=q.top();q.pop();\\n int v=p.second;\\n if(dist[v]<-p.first)continue;\\n rep(i,G[v].size()){\\n edge &e=G[v][i];\\n if(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\\n prev[e.to]=v;\\n pree[e.to]=i;\\n q.push(pii(-dist[e.to],e.to));\\n }\\n }\\n }\\n if(dist[t]==inf)return -1;\\n rep(i,n)h[i]+=dist[i];\\n int d=f;\\n for(int v=t;v!=s;v=prev[v])d=min(d,G[prev[v]][pree[v]].cap);\\n f-=d;\\n out+=d*h[t];\\n for(int v=t;v!=s;v=prev[v]){\\n edge &e=G[prev[v]][pree[v]];\\n e.cap-=d;\\n G[v][e.rev].cap+=d;\\n }\\n }\\n return out;\\n }\\n};\\nsigned main(){\\n //n個のレポート, m人の友だち\\n \\n int n,m,k; cin >> n >> m >> k;\\n vector<vector<int>>v(m+1,vector<int>(n));\\n rep(i,m+1)rep(j,n) cin >> v[i][j];\\n vector<int>frd;\\n frd.push_back(n);\\n rep(i,m){\\n int tmp; cin >> tmp;\\n frd.push_back(tmp);\\n }\\n MCF fl(n+m+5);\\n //fl.add_edge(int s, int t, int cap, int cost)\\n int source = n+m+5 - 2;\\n int sink = n+m+5-1;\\n int fri = source-1;\\n int msl = fri - 1;\\n fl.add_edge(msl, sink, n, 0);\\n fl.add_edge(fri, sink, n-k, 0);\\n //各レポートに辺を貼る\\n rep(i,n)fl.add_edge(source,i, 1, 0);\\n rep(i,n)rep(j,m+1){\\n fl.add_edge(i,n+j,1, 1000-v[j][i]);\\n }\\n rep(i,m+1){\\n fl.add_edge(n+i, (i!=0?fri:msl),frd[i],0);\\n }\\n cout << 1000*n-fl.mcf(source, sink, n) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2815_2764540\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 250\\n\\n\\n//辺を表す構造体{行先、容量、コスト、逆辺のインデックス}\\nstruct Edge{\\n\\tEdge(int arg_to,int arg_capacity,int arg_cost,int arg_rev_index){\\n\\t\\tto = arg_to;\\n\\t\\tcapacity = arg_capacity;\\n\\t\\tcost = arg_cost;\\n\\t\\trev_index = arg_rev_index;\\n\\t}\\n\\n\\tint to,capacity,cost,rev_index;\\n};\\n\\nint V; //頂点数\\nvector<Edge> G[NUM]; //グラフの隣接リスト表現\\nint dist[NUM]; //最短距離\\nint pre_node[NUM],pre_edge[NUM]; //直前の頂点と辺\\nint A[101],B[101][101],T[101];\\n\\n\\n//fromからtoへ向かう容量capacity,コストcostの辺をグラフに追加する\\nvoid add_edge(int from,int to,int capacity,int cost){\\n\\tG[from].push_back(Edge(to,capacity,cost,G[to].size()));\\n\\tG[to].push_back(Edge(from,0,-cost,G[from].size()-1));\\n}\\n\\n//sourceからsinkへの、流量flowの最小費用流を求める\\n//流せない場合は-1を返す\\nint min_cost_flow(int source,int sink,int flow){\\n\\tint ret = 0;\\n\\twhile(flow > 0){\\n\\t\\t//ベルマンフォード方により、source-sink間最短経路を求める\\n\\t\\tfor(int i = 0; i < V; i++)dist[i] = BIG_NUM;\\n\\t\\tdist[source] = 0;\\n\\t\\tbool update = true;\\n\\t\\twhile(update){\\n\\t\\t\\tupdate = false;\\n\\t\\t\\tfor(int node_id = 0; node_id < V; node_id++){\\n\\t\\t\\t\\tif(dist[node_id] == BIG_NUM)continue;\\n\\t\\t\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\t\\t\\t\\tEdge &e = G[node_id][i];\\n\\t\\t\\t\\t\\tif(e.capacity > 0 && dist[e.to] > dist[node_id]+e.cost){\\n\\t\\t\\t\\t\\t\\tdist[e.to] = dist[node_id]+e.cost; //node_idを経由した方が早い場合\\n\\t\\t\\t\\t\\t\\tpre_node[e.to] = node_id;\\n\\t\\t\\t\\t\\t\\tpre_edge[e.to] = i;\\n\\t\\t\\t\\t\\t\\tupdate = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(dist[sink] == BIG_NUM){\\n\\t\\t\\t//これ以上流せない\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\n\\t\\t//source-sink間最短路に沿って目いっぱい流す\\n\\t\\tint tmp_flow = flow;\\n\\t\\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\\n\\t\\t\\ttmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\\n\\t\\t}\\n\\t\\tflow -= tmp_flow;\\n\\t\\tret += tmp_flow*dist[sink];\\n\\t\\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\\n\\t\\t\\tEdge &e = G[pre_node[node_id]][pre_edge[node_id]];\\n\\t\\t\\te.capacity -= tmp_flow;\\n\\t\\t\\tG[node_id][e.rev_index].capacity += tmp_flow;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nint main(){\\n\\n\\tint N,M,K;\\n\\tscanf(\\\"%d %d %d\\\",&N,&M,&K);\\n\\n\\tfor(int i = 0; i < N; i++)scanf(\\\"%d\\\",&A[i]);\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tfor(int k = 0; k < N; k++)scanf(\\\"%d\\\",&B[i][k]);\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++)scanf(\\\"%d\\\",&T[i]);\\n\\n\\tint source = 0,sink = 1,first_branch = 2,second_branch = 3,me = 4,index = 5;\\n\\n\\tadd_edge(source,first_branch,N,0); //全体の流量をNに設定する\\n\\tadd_edge(first_branch,me,N,0); //自分に最大N流せるようにする\\n\\tadd_edge(first_branch,second_branch,N-K,0); //最大でも友達にはN-Kしか流せないようにする\\n\\n\\tint friend_index[M],report_index[N];\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tfriend_index[i] = index++;\\n\\t\\tadd_edge(second_branch,friend_index[i],T[i],0); //友達iに流量T[i]の辺を張る\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\treport_index[i] = index++;\\n\\t\\tadd_edge(report_index[i],sink,1,0); //レポートからsinkへ辺を張る\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tadd_edge(me,report_index[i],1,-A[i]); //自分からレポートに、負のコストの辺を張る\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tadd_edge(friend_index[i],report_index[k],1,-B[i][k]); //友達iからレポートkに、負のコストの辺を張る\\n\\t\\t}\\n\\t}\\n\\n\\tV = index;\\n\\n\\tprintf(\\\"%d\\\\n\\\",-min_cost_flow(source,sink,N));\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.0717,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2815_2728697\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\n\\nstruct PrimalDual{\\n const int INF = 1<<28;\\n typedef pair<int,int> P;\\n struct edge{\\n int to,cap,cost,rev;\\n edge(){}\\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\\n };\\n\\n int n;\\n vector<vector<edge> > G;\\n vector<int> h,dist,prevv,preve;\\n\\n PrimalDual(){}\\n PrimalDual(int sz):n(sz),G(sz),h(sz),dist(sz),prevv(sz),preve(sz){}\\n \\n void add_edge(int from,int to,int cap,int cost){\\n G[from].push_back(edge(to,cap,cost,G[to].size()));\\n G[to].push_back(edge(from,0,-cost,G[from].size()-1));\\n }\\n\\n int flow(int s,int t,int f){\\n int res=0;\\n fill(h.begin(),h.end(),0);\\n while(f>0){\\n priority_queue<P,vector<P>,greater<P> > que;\\n fill(dist.begin(),dist.end(),INF);\\n dist[s]=0;\\n que.push(P(0,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&&dist[e.to]>dist[v]+e.cost+h[v]-h[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.push(P(dist[e.to],e.to));\\n }\\n }\\n }\\n if(dist[t]==INF) return -1;\\n for(int v=0;v<n;v++) h[v]+=dist[v];\\n int 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*h[t];\\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 return res;\\n }\\n};\\n\\nint main(){\\n int n,m,K;\\n cin>>n>>m>>K;\\n int a[n],b[m][n],t[m];\\n r(i,n)cin>>a[i];\\n r(i,m)r(j,n)cin>>b[i][j];\\n r(i,m)cin>>t[i];\\n int v=n+m+4;\\n PrimalDual p(v);\\n int start=n+m+1;\\n int goal=n+m+2;\\n int tite=n+m+3;\\n r(i,n)p.add_edge(start,i,1,0);\\n r(i,m+1){\\n if(!i)p.add_edge(n+i,goal,1000,0);\\n else p.add_edge(n+i,tite,t[i-1],0);\\n }\\n p.add_edge(tite,goal,n-K,0);\\n r(i,n){\\n r(j,m+1){\\n if(!j)p.add_edge(i,n+j,1,-a[i]);\\n else p.add_edge(i,n+j,1,-b[j-1][i]);\\n }\\n }\\n cout<<-p.flow(start,goal,n)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.0391,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2815_2374951\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define DUMP(x) cerr << #x << \\\"=\\\" << x << endl\\n#define DUMP2(x, y) cerr<<\\\"(\\\"<<#x<<\\\", \\\"<<#y<<\\\") = (\\\"<<x<<\\\", \\\"<<y<<\\\")\\\"<< endl\\n#define BINARY(x) static_cast<bitset<16> >(x)\\n\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define REP(i,m,n) for (int i=m;i<(int)(n);i++)\\n\\n#define in_range(x, y, w, h) (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))\\n#define ALL(a) (a).begin(),(a).end()\\n\\ntypedef long long ll;\\nconst int INF = 1e9;\\nconst ll INFLL = 1e18;\\ntypedef pair<int, int> PII;\\nint dx[4]={0, -1, 1, 0}, dy[4]={-1, 0, 0, 1};\\n\\nconst int MAX_V = 2000;\\n\\nclass MinCostFlow {\\n struct edge { int to, cap, rev, cost;};\\n vector<edge> G[MAX_V];\\n\\n int V;\\n \\n int dist[MAX_V];\\n int prevv[MAX_V], preve[MAX_V];\\n \\npublic:\\n MinCostFlow() {V=MAX_V;}\\n MinCostFlow(int v) {\\n V = v;\\n }\\n \\n void add_edge(int from, int to, int cap, int cost) {\\n G[from].push_back((edge){to, cap, (int)G[to].size(), cost});\\n G[to].push_back((edge){from, 0, (int)G[from].size()-1, -cost});\\n }\\n \\n // ????°??????¨???\\n int min_cost_flow(int s, int t, int f) {\\n int res=0;\\n while (f>0) {\\n fill(dist, dist+V, INF);\\n dist[s]=0;\\n bool update=true;\\n while (update) {\\n update = false;\\n for (int v=0; v<V; v++) {\\n if (dist[v]==INF) continue;\\n for (int i=0; i<G[v].size(); i++) {\\n edge &e = G[v][i];\\n if (e.cap>0 && dist[e.to] > dist[v] + e.cost) {\\n dist[e.to] = dist[v] + e.cost;\\n prevv[e.to] = v;\\n preve[e.to] = i;\\n update = true;\\n }\\n }\\n }\\n }\\n \\n if (dist[t] == INF) {\\n return -1;\\n }\\n \\n int 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*dist[t];\\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 return res;\\n }\\n};\\n\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n\\n int N, M, K;\\n cin >> N >> M >> K;\\n\\n M++;\\n\\n vector<vector<int>> A(M, vector<int>(N));\\n vector<int> T(M-1);\\n\\n rep(i, M) {\\n rep(j, N) {\\n cin >> A[i][j];\\n }\\n }\\n\\n rep(i, M-1) cin >> T[i];\\n \\n // Node 0 : ?????????\\n // Node 1 - N : ??¬?????????\\n // Node N+1 - N+M : ??????+??????\\n // Node N+M+1 : ?§?????????°?????¶???\\n // Node N+M+2 : ?????????\\n\\n const int SOURCE = 0;\\n const int SINK = N+M+2;\\n const int X = N+M+1;\\n\\n MinCostFlow flow(N+M+10);\\n\\n rep(i, N) {\\n flow.add_edge(SOURCE, 1+i, 1, 0);\\n }\\n\\n rep(i, N) {\\n rep(j, M) {\\n flow.add_edge(1+i, N+1+j, 1, 100 - A[j][i]);\\n }\\n }\\n\\n flow.add_edge(N+1, SINK, INF, 0);\\n\\n if (M > 1) {\\n rep(i, M-1) {\\n flow.add_edge(N+2+i, X, T[i], 0);\\n }\\n\\n flow.add_edge(X, SINK, N-K, 0);\\n }\\n\\n cout << N*100 - flow.min_cost_flow(0, SINK, N) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.1303,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2815_2336183\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n\\nusing namespace std;\\n\\nconstexpr int MAX_V = 1000;\\nconstexpr int INF = (1 << 29);\\n\\nstruct edge {\\n int to, cap, cost, rev;\\n edge(int to, int cap, int cost, int rev) :\\n to{to}, cap{cap}, cost{cost}, rev{rev} {}\\n};\\n\\nint V;\\nvector<edge> G[MAX_V];\\nint dist[MAX_V], prevv[MAX_V], preve[MAX_V];\\n\\nvoid add_edge(int from, int to, int cap, int cost)\\n{\\n G[from].emplace_back(to, cap, cost, G[to].size());\\n G[to].emplace_back(from, 0, -cost, G[from].size() - 1);\\n}\\n\\nint min_cost_flow(int s, int t, int f)\\n{\\n int res = 0;\\n while (f > 0) {\\n fill(dist, dist + V, INF);\\n dist[s] = 0;\\n bool update = true;\\n while (update) {\\n update = false;\\n for (int v = 0; v < V; v++) {\\n if (dist[v] == INF) continue;\\n for (int i = 0; i < (int)G[v].size(); i++) {\\n edge& e = G[v][i];\\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\\n dist[e.to] = dist[v] + e.cost;\\n prevv[e.to] = v;\\n preve[e.to] = i;\\n update = true;\\n }\\n }\\n }\\n }\\n if (dist[t] == INF) return -1;\\n int 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 * dist[t];\\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 return res;\\n}\\n\\nint main()\\n{\\n int N, M, K;\\n cin >> N >> M >> K;\\n \\n int S = N + (M + 1) + 1, T = S + 1;\\n V = T + 1;\\n for (int i = 0; i < N; i++) {\\n int a;\\n cin >> a;\\n \\n add_edge(S, i, 1, 0);\\n add_edge(i, N, 1, -a);\\n }\\n \\n\\n for (int i = 0; i < M; i++) {\\n for (int j = 0; j < N; j++) {\\n int b;\\n cin >> b;\\n add_edge(j, N + i + 1, 1, -b);\\n }\\n } \\n \\n for (int i = 0; i < M; i++) {\\n int Ti;\\n cin >> Ti;\\n add_edge(N + i + 1, N + (M + 1), Ti, 0);\\n }\\n\\n add_edge(N, T, INF, 0);\\n add_edge(N + (M + 1), T, N - K, 0);\\n\\n cout << -min_cost_flow(S, T, N) << endl; \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3396,\n \"score_of_the_acc\": -0.0065,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2815_2330393\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(auto i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\n\\n\\n\\ntypedef int Weight;\\ntypedef int Cap;\\nconst Weight W_INF = INT_MAX;\\nconst Weight W_ZERO = 0;\\nconst Cap C_INF = INT_MAX;\\nconst Cap C_ZERO = 0;\\n\\nstruct Edge {\\n\\tint src, dst;\\n\\tCap capacity;\\n\\tWeight cost;\\n\\tEdge(int src, int dst, const Cap& acap, const Weight& acost) :\\n\\t\\tsrc(src), dst(dst), capacity(acap), cost(acost) {\\n\\t}\\n};\\nbool operator < (const Edge &e, const Edge &f) {\\n\\treturn e.cost > f.cost;\\n}\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\n\\n#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\\n#define RCOST(u,v) (cost[u][v] + h[u] - h[v])\\n\\n//??°?????????????????§???????????????????????¨?????????\\n\\n//Graph &ag\\n//????????§???????????????(u, v, capacity, cost) ??????????????????(u, v, 0, -cost) ???????????°????????????????????¶?????????????????§????´???°????????§???????????°???????????????\\n//int s, int t\\n//?????????????§??????¨?????????\\n//?????????\\n//?????¨??¨????????????????????????\\npair<Weight, Cap> minimumCostFlow(const Graph &ag, int s, int t) {\\n\\t//check???????´???°??????????????£???????????????\\n\\tGraph g(ag);\\n\\tfor (int i = 0; i < ag.size(); ++i) {\\n\\t\\tfor (int j = 0; j < ag[i].size(); ++j) {\\n\\t\\t\\tint d = ag[i][j].dst;\\n\\t\\t\\tint s = ag[i][j].src;\\n\\n\\t\\t\\tbool ok = false;\\n\\t\\t\\tfor (int k = 0; k < ag[d].size(); ++k) {\\n\\t\\t\\t\\tif (ag[d][k].src == s) {\\n\\t\\t\\t\\t\\tok = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!ok) {\\n\\t\\t\\t\\tg[d].push_back(Edge(d, s, C_ZERO, -ag[i][j].cost));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tconst int n = g.size();\\n\\tvector<vector<Cap>> capacity(n, vector<Cap>(n)), flow(n, vector<Cap>(n));\\n\\tvector<vector<Weight>>cost(n, vector<Weight>(n));\\n\\tfor (int u = 0; u < n; ++u) {\\n\\t\\tfor (auto e : g[u]) {\\n\\t\\t\\tcapacity[e.src][e.dst] = capacity[e.src][e.dst] + e.capacity;\\n\\t\\t\\tcost[e.src][e.dst] = cost[e.src][e.dst] + e.cost;\\n\\t\\t}\\n\\t}\\n\\tpair<Weight, Cap> total; // (cost, flow)\\n\\tvector<Weight> h(n);\\n\\n\\tfor (Cap F = C_INF; F > 0; ) { // residual flow\\n\\t\\tvector<Weight> d(n, W_INF); d[s] = W_ZERO;\\n\\t\\tvector<int> p(n, -1);\\n\\t\\tpriority_queue<Edge> Q; // \\\"e < f\\\" <=> \\\"e.cost > f.cost\\\"\\n\\t\\tfor (Q.push(Edge(-2, s, C_ZERO, W_ZERO)); !Q.empty(); ) {\\n\\t\\t\\tEdge e = Q.top(); Q.pop();\\n\\t\\t\\tif (p[e.dst] != -1) continue;\\n\\t\\t\\tp[e.dst] = e.src;\\n\\t\\t\\tFOR(f, g[e.dst]) {\\n\\t\\t\\t\\tif (RESIDUE(f->src, f->dst) > 0) {\\n\\t\\t\\t\\t\\tif (d[f->dst] > d[f->src] + RCOST(f->src, f->dst)) {\\n\\t\\t\\t\\t\\t\\td[f->dst] = d[f->src] + RCOST(f->src, f->dst);\\n\\t\\t\\t\\t\\t\\tQ.push(Edge(f->src, f->dst, 0, d[f->dst]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (p[t] == -1) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tCap f = F;\\n\\t\\tfor (int u = t; u != s; u = p[u]) {\\n\\t\\t\\tf = min(f, RESIDUE(p[u], u));\\n\\t\\t}\\n\\t\\tfor (int u = t; u != s; u = p[u]) {\\n\\t\\t\\ttotal.first = total.first + f * cost[p[u]][u];\\n\\t\\t\\tflow[p[u]][u] = flow[p[u]][u] + f; flow[u][p[u]] = flow[u][p[u]] - f;\\n\\t\\t}\\n\\t\\tF = F - f;\\n\\t\\ttotal.second = total.second + f;\\n\\t\\tfor (int u = 0; u < n; ++u) {\\n\\t\\t\\th[u] = h[u] + d[u];\\n\\t\\t}\\n\\t}\\n\\treturn total;\\n}\\nvoid add_edge(Graph&g, const int from, const int to, const Cap& cap, const Weight& weight) {\\n\\tg[from].push_back(Edge(from, to, cap, weight));\\n}\\n\\nint main() {\\n\\tint N, M, K; cin >> N >> M >> K;\\n\\tvector<int>myscores(N);\\n\\tvector<vector<int>>friscores(M, vector<int>(N));\\n\\tvector<int>cancheat(M);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tcin >> myscores[i];\\n\\t}\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\tcin >> friscores[i][j];\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tcin >> cancheat[i];\\n\\t}\\n\\n\\tconst int start = 0;\\n\\tconst int report = start + 1;\\n\\tconst int my = report + N;\\n\\tconst int fr_in = my + 1;\\n\\tconst int fr_assemble = fr_in + M;\\n\\tconst int goal = fr_assemble + 1;\\n\\tGraph g(goal+1);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tadd_edge(g, start, report + i, 1, 0);\\n\\t}\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\tadd_edge(g, report + i, fr_in + j, 1, 100-friscores[j][i]);\\n\\t\\t}\\n\\t\\tadd_edge(g, report + i, my, 1, 100-myscores[i]);\\n\\t}\\n\\tfor (int j = 0; j < M; ++j) {\\n\\t\\tadd_edge(g, fr_in + j, fr_assemble, cancheat[j], 0);\\n\\t}\\n\\tadd_edge(g, fr_assemble,goal, N - K, 0);\\n\\tadd_edge(g, my, goal, N, 0);\\n\\tauto ans = minimumCostFlow(g, start, goal);\\n\\tcout << 100*N-ans.first<< endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4152,\n \"score_of_the_acc\": -0.6221,\n \"final_rank\": 6\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":16,"numItemsPerPage":100,"numTotalItems":2103,"offset":1600,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4NjMxMDI5NCwianRpIjoiZGY2MTg2NmYtNTlmMS00ZTU2LTk2ZTMtMTcwNjI2YzJkMTU1Iiwic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzg2MzEzODk0LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.oLw74eIpS03_UmwVm4uKtdpwp0gaUjc12oFgsPefDf17VS6B8SMA1cteFVdnecwV_yTOvUKRtFqrWesXWbSfAw","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_2697_cpp | Problem K
Runner and Sniper
You are escaping from an enemy for some reason. The enemy is a sniper equipped with a high-tech laser gun, and you will be immediately defeated if you get shot. You are a very good runner, but just wondering how fast you have to run in order not to be shot by the sniper. The situation is as ... | [
{
"submission_id": "aoj_2697_2139713",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ndouble PI=acos(-1);\ndouble eps=1e-7;\ntypedef complex<double> P;\n\ndouble modf(double x){\n while(x>2*PI){\n x-=2*PI;\n }\n while(x<0){\n x+=2*PI;\n }\n return x;\n}\n\ndouble x,y,a,b;\n\ndoub... |
aoj_2696_cpp | Problem J
New Game AI
Aoba is a beginner programmer who works for a game company. She was appointed to develop a battle strategy for the enemy AI (Artificial Intelligence) in a new game. In this game, each character has two parameters, hit point ($hp$) and defence point ($dp$). No two characters have the same $hp$ and ... | [
{
"submission_id": "aoj_2696_10319485",
"code_snippet": "// AOJ #2098 Two-finger Programming\n// 2025.3.23\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconst int NMAX = 50005;\n\nint n, c;\nint usd[NMAX] = {0};\nint flag[NMAX] = {0};\nint nw = 1, tp = 1;\nint stk[NMAX];\nint c... |
aoj_2693_cpp | Problem G
JAG-channel II
JAG (Japan Alumni Group) is a group of $N$ members that devotes themselves to activation of the competitive programming world. The JAG staff members talk every day on the BBS called JAG-channel. There are several threads in JAG-channel and these are kept sorted by the time of their latest posts... | [
{
"submission_id": "aoj_2693_10866702",
"code_snippet": "//ΔAIZU2693\n#include<iostream>\n#include<cstdio>\n#include<fstream>\n#include<algorithm>\n#include<vector>\n#include<map>\n#include<set>\n#include<queue>\n#include<bitset>\n#include<cmath>\n#include<cstring>\n#include<cstdlib>\nusing namespace std;\n... |
aoj_2698_cpp | Problem L
Wall Making Game
The game
Wall Making Game
, a two-player board game, is all the rage.
This game is played on an $H \times W$ board. Each cell of the board is one of
empty
,
marked
, or
wall
. At the beginning of the game, there is no wall on the board.
In this game, two players alternately move as follows:
A... | [
{
"submission_id": "aoj_2698_10850936",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define nn 22\n\nint n,m;\nchar _map[nn][nn];\nint dp[nn][nn][nn][nn];\n\n\nint dfs(int x1,int y1,int x2,int y2){\n\tif(x1>x2 or y1>y2) return 0;\n\tif(dp[x1][y1][x2][y2]>-1) return dp[x1][y1][x2][y2];\n\... |
aoj_2700_cpp | Airport Codes
空港コード
JAG王国では国内の空港にそれぞれ空港コードを割り当てて識別をしている．
空港コードは，小文字の英語アルファベットで表記した空港の名前をもとに以下の規則で割り当てられる:
名前の最初の文字と，母音 (a,i,u,e,o) の直後の文字を順に取り出す．
取り出した文字列が
k
文字未満ならそれを空港コードとし，
k
文字以上なら，その取り出した文字列の先頭
k
文字を空港コードとして使う．
例えば
k
= 3 のとき，haneda には hnd ， oookayama には ooo ， tsu には t というコードが割り当てられる．
しかしこのコードの割り当て方では，違う名前の空港でも同じコー... | [
{
"submission_id": "aoj_2700_10609632",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\ntemplate <typename A> void chmin(A &l, const A &r) {\n if(r < l)\n l = r;\n}\ntemplate <typename A> void chmax(A &l,... |
aoj_2695_cpp | Problem I
Midpoint
One day, you found $L + M + N$ points on a 2D plane, which you named $A_1, ..., A_L, B_1, ...,B_M, C_1,...,C_N$. Note that two or more points of them can be at the same coordinate. These were named after the following properties:
the points $A_1,...,A_L$ were located on a single straight line,
the po... | [
{
"submission_id": "aoj_2695_10850559",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define nn 65536*8\nstruct point{\n\tll x,y;\n\tpoint (ll xx=0,ll yy=0){\n\t\tx=xx,y=yy;\n\t}\n};\npoint operator-(point a,point b){\n\treturn point(a.x-b.x,a.y-b.y);\n}\npoint opera... |
aoj_2701_cpp | Falling Block Puzzle
ブロック落とし
あなたはある落ち物パズルで遊んでいる．
このパズルのフィールドは，下図のように各段に立方体のセルが2マス×2マスに並び，段が上に無限に並んでいる形をしている．
それぞれのセルは，セルにぴったり収まるブロックが1つ存在するか，何もないかのどちらかである．
このパズルは以下のように進行する．
初期状態としていくつかのブロックが設置されている．
2マス×2マス×2マスに収まるブロックの塊を上から落とす．ただし，落とす前に，ブロックがフィールドからはみ出さないようにして塊を水平方向に平行移動することができる．
落としたブロックのうち，ある1つの下面が，すでに置かれているブロックまたは... | [
{
"submission_id": "aoj_2701_9359705",
"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>;\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\n#define all(A) A.begin(),A.end()\n\nvoid chmax(ll& p, ll q)... |
aoj_2702_cpp | Alternate Escape
アリスハウス
AliceとBobはボードゲームで遊んでいる．
このボードゲームは，
H
行
W
列のマス目が書かれた盤面と1つのコマを使って遊ぶ．
このゲームでは，盤面の左上のマスを1行1列目として，下方向に行を，右方向に列を数える．
マス同士が隣接する辺と，マスが盤面の外側と接する辺には壁を置けるようになっていて，ゲームの開始時にはそれぞれの辺について壁の有無が指定されている．また，ゲームの開始時には，コマが盤面のマスのいずれか1箇所に置かれている．
AliceとBobは交互に手番をこなすことでゲームを進める．
ゲームはAliceの手番から始まる．
Aliceの目的は，コマを盤面の外まで動かして，... | [
{
"submission_id": "aoj_2702_10946050",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <vector>\n#include <iostream>\n\nusing namespace std;\n\nint n, m, row, col;\n\nconst int N = 600;\n\nint ver[N][N];\nint hor[N][N];\nint visit[N][N][2][2];\nint deg[N][N][2][2];\n\nstruct Node {\n\tint ... |
aoj_2705_cpp | Kuru Kuru Door
くるくるドア
ACM (Automatic Cleaning Machine) 社が2011年に開発した全自動円形掃除機 ICPC (Intelligent Circular Perfect Cleaner) は，
日中に自動で動き出し，自分が通り過ぎた場所のゴミを掃除する機能を備えている．
加えて，この ICPC は，バッテリー残量が低下した場合に自動的に電源の位置まで戻る機能も備えている．
この度，JAG (Japan Alumni Group) と名乗る謎の組織から， ACM 社に対し大量の ICPC の発注があった．
しかし，その発注には条件が付いていた．
それは，彼らが本拠地としているビルの内... | [
{
"submission_id": "aoj_2705_6022652",
"code_snippet": "/*\tauthor: Kite_kuma\n\tcreated: 2021.11.01 22:38:19 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(... |
aoj_2703_cpp | Dice Stamp
サイコロスタンプ
あなたは地元の縁日で，今までに見たことがないゲームの出店を発見した．
N
個の6面サイコロを，ボード上に落として転がすゲームだ．
より正確には，
N
個のボタンが
N
個のサイコロに1対1に紐付いており，ボタンを押すことで対応したサイコロがボードに落ちる．
ボタンを好きなように
N
回押し，サイコロを
N
回落として転がすことで得点を得るゲームである．
ゲームのより詳細なルールを説明しよう．
ゲームで使用する
N
個のサイコロはすべて各辺の長さが1の立方体であり，ボードは長さが1の正方形のマスに区切られた十分に広い平面である．
ゲーム開始前，ボードの各マスにはすべて0が書かれている．
各サイコ... | [
{
"submission_id": "aoj_2703_10853814",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<vector>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nint dx[4] = {1, 0, 0, -1};\nint dy[4] = {0, 1, -1, 0};\n//l r f b d u\n//0 1 2 3 4 5\nint go[4][6] = {\n {5, 4, 2, 3, 0, 1},\n ... |
aoj_2704_cpp | Stamp Rally
スタンプラリー
日本アミューズメントグループ (Japan Amusement Group, JAG) では，島国を模したテーマパークでのイベントを企画している．
このイベントでは，参加者は橋を渡るたびに橋ごとに決められたスタンプをスタンプ帳に順番に押していく．
用意されたスタンプは以下の7種類のどれかである．
a ( ) [ ] + *
スタートからゴールまで橋を渡り歩いて，押されたスタンプの列が正しい数式になればクリアである．
ただし橋を渡る向きは決まっていて，逆向きに渡ることはできない．
同じ橋を何度も渡ってよく，最終的にゴール地点に到着するのであれば一度ゴール地点に着いた後に引き続きスタンプを集めても... | [
{
"submission_id": "aoj_2704_10848353",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int N = 205;\nint id(char c) {\n\tif (c == 'a') return 0;\n\tif (c == '+') return 1;\n\tif (c == '*') return 2;\n\tif (c == '(') return 3;\n\tif (c == ')') return 4;\n\tif (c == '[') return 5;\n\tr... |
aoj_2707_cpp | 監獄
無限人の囚人たちがいる。はじめ、囚人たちは
0, 1, 2,
... と番号が振られている。
次の操作を
N
回行う。
0
番目の囚人を釈放し、
k, 2k, 3k,
... 番目の囚人たちを処刑する。
その後、残った囚人たちに番号を振り直す。このとき、元の番号が小さい囚人から順に
0, 1, 2,
... と番号を振る。
N
回目の操作で釈放される囚人がはじめに振られていた番号を求めよ。
Constraints
1
≤
N
≤
10^5
2
≤
k
≤
10^5
答えは
10^{18}
以下である。
Input Format
入力は以下の形式で標準入力から与えられる。
N
k
Output Format
答えを一行に出力せよ... | [
{
"submission_id": "aoj_2707_10865966",
"code_snippet": "//#define __USE_MINGW_ANSI_STDIO 0\n#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<ll> VL;\ntypedef vector<VL> VVL;\ntypedef pair<int, int> PII;\n\n#define FOR(... |
aoj_2706_cpp | 幾何問題を解こう
A君は今日も幾何の問題を解いている。
幾何の問題を解く時は浮動小数点誤差に気をつけることが大事である。
浮動小数点誤差とは、2進法の有限小数で数を表す際におこる丸めによって起きる誤差である。
例えば、10進法での
0.1
は2進法では
0.00011001100110011
... という無限小数になるが、
これを有限の桁で丸める際に誤差が発生してしまう。
正の整数
p
,
q
が10進法で与えられる。
有理数
p
/
q
を有限桁数の小数で表現することができるような
b
進法（
b
は2以上の整数）を求めよ。
複数ある場合は最も小さいものを出力せよ。
Constraints
0 < p < q < 10^9
In... | [
{
"submission_id": "aoj_2706_5768373",
"code_snippet": "#include <bits/stdc++.h>\n\n#define lol long long\n#define gcd(x, y) __gcd(x, y)\n#define mt make_tuple\n#define mp make_pair\n#define fi first\n#define se second\n#define fixed(x) fixed << setprecision(x)\n#define all(x) x.begin(),x.end()\nusing names... |
aoj_2708_cpp | ABC Gene
文字列
ABC
で表される遺伝子配列がある。あなたは次の操作を何回か行い、この遺伝子配列を書き換えていくことができる。
文字
A
，
B
，
C
のうち
1
つを選ぶ。これを
x
とおく。遺伝子配列に含まれるすべての
x
をそれぞれ
ABC
へ同時に置き換える。
A
，
B
，
C
だけからなる文字列
S
が与えられる。遺伝子配列を
S
に一致させられるか判定せよ。
Constraints
1
≤
|S|
≤
5,000
S
は
A
，
B
，
C
だけからなる。
Input Format
入力は以下の形式で標準入力から与えられる。
S
Output Format
遺伝子配列を
S
に一致させられるならば
Yes
... | [
{
"submission_id": "aoj_2708_10848475",
"code_snippet": "//#define __USE_MINGW_ANSI_STDIO 0\n#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<ll> VL;\ntypedef vector<VL> VVL;\ntypedef pair<int, int> PII;\n\n#define FOR(... |
aoj_2710_cpp | 坑道数式
ある日廃坑を探検していたあなたは、坑道に長い数式
S
が書かれているのを発見した。大きな数が好きなあなたは、チョークを取り出し、数式を計算した結果ができるだけ大きくなるように
(
または
)
を書き加えることにした。書き加えた後も数式になっていなければならないとすると、最大でいくつにできるか。
文字と文字の間は十分広く空いていて、
(
または
)
であればいくつでも書き加えることができる。最終的に数式になっていれば、最初のかっこの対応が崩れるように
(
または
)
を書いてもよい（Sample 2参照）。
また、ここでは以下のBNFで定義される<expr>を数式と呼ぶ。数式中の数は全て一桁である。
<expr> ::= ... | [
{
"submission_id": "aoj_2710_10849109",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nusing P = pair<int, int>;\n\nconstexpr int INF = 1e9;\n\nP memo[201][201];\n\nP rec(int l, int r, string const& s) {\n P& res = memo[l][r];\n if(res != make_pair(-INF, IN... |
aoj_2709_cpp | 真っ暗な部屋
目を覚ますと、A君は真っ暗な部屋の中にいた。
どうやらA君は
N
個の部屋から構成されたダンジョンに迷い込んでしまったようだ。
あなたはA君がどの部屋に迷い込んだのかを知ることはできなかったが、幸いにもダンジョンのマップを手に入れることができた。
A君の進むべき道を示し明るい部屋に導こう。
N
個の部屋のうち
M
個の部屋が真っ暗な部屋であり、それぞれ
D_1
,
D_2
, ...,
D_M
番目の部屋が真っ暗な部屋であることが分かっている。
また、全ての部屋からちょうど
K
本の一方通行の道が順に並んでおり、
i
番目の部屋から出る道はそれぞれ
v_{i,1}
,
v_{i,2}
, ...,
v_{i,K}
番目... | [
{
"submission_id": "aoj_2709_10889003",
"code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long lo... |
aoj_2719_cpp | Problem C:
Kuru Kuru Sushi
Zephir is an owner of the kuru kuru sushi restaurants. In these restaurants, sushis are placed
on a rotating circular belt conveyor and delivered to customers.
Zephir owns $n$ restaurants numbered from $0$ to $n - 1$. Due to his passion for rotation, these
restaurants are placed on the circum... | [
{
"submission_id": "aoj_2719_10323024",
"code_snippet": "// AOJ #2719 Kuru Kuru Sushi\n// 2025.3.25\n\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & ... |
aoj_2712_cpp | Escape
頂点に正の値を持つ無向グラフが与えられる。
頂点には 1 から
N
の番号がついており、
i
番目の頂点は
w_i
の値を持っている。
1 番目の頂点からスタートし、直前に通った辺を通ることができないという制約のもとでグラフ上を移動することができる。
各頂点では，初めて訪れた時に限りその頂点が持つ値の点数を得られる。
取得できる点数の総和の最大値を求めよ。
Constraints
1 ≤ N ≤ 100000
N − 1 ≤ M ≤ 100000
1 ≤ w_i ≤ 1000
1 ≤ u_i, v_i ≤ N
多重辺・自己辺は存在しない
グラフは連結である
Input Format
入力... | [
{
"submission_id": "aoj_2712_10858280",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<utility>\n\nusing namespace std;\n\ntypedef pair<int, int> Pii;\n\nvector<int> graph[100001];\nvector<int> dim(100001, 0);\nvector<Pii> nodes(100001);\nvector<bool> used(100001, false);\n\nint dfs(int nod... |
aoj_2713_cpp | H - Bit Operation Game
N
頂点の根付き木が与えられる。
頂点には
0
から
N − 1
の番号がついており、
0
番目の頂点が根を表す。
根には
T = 0
が、それ以外の頂点には
T=T&X
T=T&Y
T=T|X
T=T|Y
T=T^X
T=T^Y
のいずれかの操作が書かれている。
ここでの演算子 &, |, ^ はそれぞれビット演算子 and, or, xor, を意味する。
A君とB君はこの木を使って以下のゲームを
M
回行った。
二人は根からスタートし、子頂点を選び進むという操作を、A君から始め葉に到達するまで交互に行う。
通ったノードに書かれている操作を、通った順に適用した時の、最終的な
T
の値... | [
{
"submission_id": "aoj_2713_10853981",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nmap<vector<int>, int> memo;\nvector<int> op;\n\nusing graph = vector<vector<int>>;\n\nint proc(int state, int op) {\n if(state == 0) {\n if(op == 0 || op == 1) {\n return 0;\n ... |
aoj_2711_cpp | ほぼ周期文字列
文字列
S
が与えられる。この文字列
S
に対し、
Q
個のクエリに答えよ。
i
番目のクエリでは、
S[l_i,\ r_i]
から1文字まで変えてよいとき、
S[l_i,\ r_i]
を周期
t_i
の文字列にできるかどうかを判定せよ。
S[l,\ r]
は文字列
S
の
l
文字目から
r
文字目までの部分文字列を表す。
文字列
W
が周期
t
の文字列であるとは、
i\ =\ 1,\2,\... ,\ |W| − t
に対し、
W_{i} = W_{i+t}
となることとする。
Constraints
1 ≤ |S| ≤ 10^5
1 ≤ Q ≤ 10^5
1 ≤ l_i ≤ r_i ... | [
{
"submission_id": "aoj_2711_9799895",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)... |
aoj_2716_cpp | Leapfrog
Problem Statement
N
個のマスが円状に並んでいる。マスは時計回りに
1,\ 2,\
...
,\ N
と番号が振られている。各
i
(
1 ≤ i ≤ N−1
) について、
i
番目のマスと
i+1
番目のマスは隣り合う。また、
N
番目のマスと
1
番目のマスは隣り合う。
これらのうち
M
個のマスには、互いに区別できない駒が
1
個ずつ置かれている。はじめ、
x_1,\ x_2,\
...
,\ x_M
番目のマスに駒が置かれている。次の操作を何回か行い、
y_1,\ y_2,\
...
,\ y_M
番目のマスに駒が置かれているようにしたい。
時計回りまたは反時計回りに連続する
3
個... | [
{
"submission_id": "aoj_2716_10853361",
"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<se... |
aoj_2717_cpp | Problem A:
Where is the Boundary
An island country JAGAN in a certain planet is very long and narrow, and extends east and
west. This long country is said to consist of two major cultural areas | the eastern and the
western. Regions in the east tend to have the eastern cultural features and regions in the west
tend to ... | [
{
"submission_id": "aoj_2717_10518617",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n#include <tuple>\n#include <ranges>\nnamespace ranges = std::ranges;\nnamespace views = std::views;\n// #incl... |
aoj_2718_cpp | Problem B:
Vector Field
In 20015, JAG (Jagan Acceleration Group) has succeeded in inventing a new accelerator named
Force Point for an experiment of proton collision on the two-dimensional $xy$-plane. If a proton
touches a Force Point, it is accelerated to twice its speed and its movement direction is veered. A
proton ... | [
{
"submission_id": "aoj_2718_10856665",
"code_snippet": "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define RE... |
aoj_2720_cpp | Problem D:
Identity Function
You are given an integer $N$, which is greater than 1.
Consider the following functions:
$f(a) = a^N$ mod $N$
$F_1(a) = f(a)$
$F_{k+1}(a) = F_k(f(a))$ $(k = 1,2,3,...)$
Note that we use mod to represent the integer modulo operation. For a non-negative integer $x$
and a positive integer $y... | [
{
"submission_id": "aoj_2720_10946047",
"code_snippet": "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define RE... |
aoj_2721_cpp | Problem E:
Enclose Points
There are $N$ points and $M$ segments on the $xy$-plane. Each segment connects two of these
points and they don't intersect each other except at the endpoints. You are also given $Q$ points
as queries. Your task is to determine for each query point whether you can make a polygon that
encloses ... | [
{
"submission_id": "aoj_2721_11060906",
"code_snippet": "#ifdef NACHIA\n#define _GLIBCXX_DEBUG\n#else\n#define NDEBUG\n#endif\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <set>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(... |
aoj_2729_cpp | Delete Files
You are using an operating system named "Jaguntu". Jaguntu provides "Filer", a file manager with a graphical user interface.
When you open a folder with Filer, the name list of files in the folder is displayed on a Filer window. Each filename is displayed within a rectangular region, and this region is cal... | [
{
"submission_id": "aoj_2729_4293550",
"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\nconstexpr int INF = 1 << 30;\n\nvoid solve() {\n int n;\n std::cin >> n;\n\n std::vector<bool> erase(n);... |
aoj_2725_cpp | Problem I:
Live Programming
A famous Japanese idol group, JAG48, is planning the program for its next live performance.
They have $N$ different songs, $song_1$, $song_2$, ..., and $song_N$. Each song has three integer param-
eters, $t_i$, $p_i$, and $f_i$: $t_i$ denotes the length of $song_i$, $p_i$ denotes the basic s... | [
{
"submission_id": "aoj_2725_8170564",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define overload2(a, b, c, ...) c\n#define overload3(a, b, c, d, ...) d\n#define overload4(a, b, c, d, e ...) e\n#define overload5(a, b, c, d, e, f ...) f\n#define overload6(a, b, c, d, e, f, g ...) g\n#d... |
aoj_2726_cpp | Problem J:
Black Company
JAG Company is a sweatshop (sweatshop is called "burakku kigyo" in Japanese), and you are
the CEO for the company.
You are planning to determine $N$ employees' salary as low as possible (employees are numbered
from 1 to $N$). Each employee's salary amount must be a positive integer greater than... | [
{
"submission_id": "aoj_2726_10849700",
"code_snippet": "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define RE... |
aoj_2728_cpp | Change a Password
Password authentication is used in a lot of facilities. The office of JAG also uses password authentication. A password is required to enter their office. A password is a string of $N$ digits '0'-'9'. This password is changed on a regular basis. Taro, a staff of the security division of JAG, decided t... | [
{
"submission_id": "aoj_2728_11021300",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b... |
aoj_2722_cpp | Problem F:
Marching Course
Since members of Kitafuji High School Brass Band Club succeeded in convincing their stern
coach of their playing skills, they will be able to participate in Moon Light Festival as a marching
band. This festival is a prelude in terms of appealing their presence for the coming domestic
contest.... | [
{
"submission_id": "aoj_2722_10853940",
"code_snippet": "#include<bits/stdc++.h>\n\n#define clr(x,y) memset((x),(y),sizeof(x))\n\nusing namespace std;\ntypedef long long LL;\n\nconst int INF = 1000000000;\nconst int maxn = 200 + 10;\n\nstruct Edge {\n int to,dist,v;\n};\n\n\nvector <Edge> G[maxn+5];\ndoubl... |
aoj_2730_cpp | Line Gimmick
You are in front of a linear gimmick of a game. It consists of $N$ panels in a row, and each of them displays a right or a left arrow.
You can step in this gimmick from any panel. Once you get on a panel, you are forced to move following the direction of the arrow shown on the panel and the panel will be r... | [
{
"submission_id": "aoj_2730_10295503",
"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_2724_cpp | Problem H:
Laser Cutter
Ciel is going to do woodworking. Ciel wants to make a cut in a wooden board using a laser
cutter.
To make it simple, we assume that the board is a two-dimensional plane. There are several
segments on the board along which Ciel wants to cut the board. Each segment has a direction
and Ciel must cu... | [
{
"submission_id": "aoj_2724_10850438",
"code_snippet": "#include<cstdio>\n#include<cstdlib>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\n#define cl(x) memset(x,0,sizeof(x))\n#define read(x) scanf(\"%d\",&(x));\nusing namespace std;\n\ninline double sqr(int x){ return x*x; }\n\nconst int N=305;... |
aoj_2731_cpp | Shifting a Matrix
You are given $N \times N$ matrix $A$ initialized with $A_{i,j} = (i - 1)N + j$, where $A_{i,j}$ is the entry of the $i$-th row and the $j$-th column of $A$. Note that $i$ and $j$ are 1-based.
You are also given an operation sequence which consists of the four types of shift operations: left, right, u... | [
{
"submission_id": "aoj_2731_10867660",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\n#define each(i,a) for (auto&& i : a)\n#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)\n#define RFOR(i,a,b) for (ll i=(b)-1,__last_#... |
aoj_2735_cpp | Shortest Bridge
There is a city whose shape is a 1,000 $\times$ 1,000 square. The city has a big river, which flows from the north to the south and separates the city into just two parts: the west and the east.
Recently, the city mayor has decided to build a highway from a point $s$ on the west part to a point $t$ on t... | [
{
"submission_id": "aoj_2735_10323059",
"code_snippet": "// AOJ #2735 Shortest Bridge\n// 2025.3.25\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ld = long double;\n\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');... |
aoj_2734_cpp | Donut Decoration
Donut maker's morning is early. Mr. D, who is also called Mr. Donuts, is an awesome donut maker. Also today, he goes to his kitchen and prepares to make donuts before sunrise.
In a twinkling, Mr. D finishes frying $N$ donuts with a practiced hand. But these donuts as they are must not be displayed in a... | [
{
"submission_id": "aoj_2734_10851292",
"code_snippet": "#include<vector>\n#include<cstdio>\n#include<cstdlib> \n#include<cstring>\n#include<algorithm>\nusing namespace std;\n#define M 800010\n#define rep(i,x,y) for(int i=(x);i<=(y);i++)\n#define For(i,x,y) for(int i=(x);i<(y);i++)\ninline int read(){\n\tch... |
aoj_2732_cpp | Modern Announce Network
Today, modern teenagers use SNS to communicate with each other.
In a high school, $N$ students are using an SNS called ICPC (International Community for Programming Contest). Some pairs of these $N$ students are 'friends' on this SNS, and can send messages to each other. Among these $N$ students... | [
{
"submission_id": "aoj_2732_10866710",
"code_snippet": "#include <queue>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\ntypedef long long ll;\n#define rep(i, a, b) for (int i = a; i <= b; ++ i)\nconst int maxn = 10005, maxm = 2000005, inf = 1000000007... |
aoj_2736_cpp | Longest Shortest Path
You are given a directed graph and two nodes $s$ and $t$. The given graph may contain multiple edges between the same node pair but not self loops. Each edge $e$ has its initial length $d_e$ and the cost $c_e$. You can extend an edge by paying a cost. Formally, it costs $x \cdot c_e$ to change the... | [
{
"submission_id": "aoj_2736_10854093",
"code_snippet": "#include <stdio.h>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nconst int non = 10000000;\n\nstruct edge {\n\tint x, y, f, c, r;\n};\nvector<edge> E[202];\n\nvoid add(int x, int y, int f, int c) {\n\tint p = E[x]... |
aoj_2740_cpp | C - みさわさんの根付き木
Problem Statement
あなたは親友であるみさわさんの誕生日が近いことに気づき，根付きの二分木をプレゼントすることにした．
ここで，根付きの二分木とは，以下のようなグラフ構造である．(図 1)
各頂点には，その頂点の親と呼ばれる頂点がちょうど 1 つだけ存在し，親と辺で結ばれている．ただし，根と呼ばれる 1 つの頂点のみ，例外的に親を持たない．
各頂点は，左の子と呼ばれる頂点をちょうど1つ持つか，あるいは持たない．左の子を持つ場合，左の子とは辺で結ばれており，左の子の親はその頂点である．
各頂点は，右の子と呼ばれる頂点をちょうど1つ持つか，あるいは持たない．右の子を持つ場合，右の子とは辺で結... | [
{
"submission_id": "aoj_2740_3532990",
"code_snippet": "#include <string>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n#define vec vector<int>\n\nconst int SIZE=10000000;\n\nvec Aar(SIZE,-1);\nvec Bar(SIZE,-1);\nvec Xar(SIZE,-1);\n\n\nvoid input(vec & ar,const string & str,int & i,int k)... |
aoj_2733_cpp | Cube Dividing
Pablo Cubarson is a well-known cubism artist. He is producing a new piece of work using a cuboid which consists of $A \times B \times C$ unit cubes. He plans to make a beautiful shape by removing $N$ units cubes from the cuboid. When he is about to begin the work, he has noticed that by the removal the cu... | [
{
"submission_id": "aoj_2733_10319512",
"code_snippet": "// AOJ #2733 Cube Dividing\n// 2025.3.23\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 == '-... |
aoj_2741_cpp | D - インビジブル
Problem Statement
あなたは友達と"
インビジブル
"というカードゲームを遊ぼうとしている．
このカードゲームでは，"
得点カード
"と"
妨害カード
"という2種類のカードを使う．
それぞれの得点カードには，正の値が書かれている．このカードゲームのルールは次の通りである．
ゲームはプレイヤー1とプレイヤー2の2人のプレイヤーで行われる．ゲームはプレイヤー1のターンから始まる．
場には，1つのスタックと2つのデッキがある．スタックは，2人のプレイヤーが置いたカードからなる．また，それぞれのプレイヤーが持つデッキはそのプレイヤーが持つ得点カードと妨害カードからなる．プレイヤーは自分，もしくは相手デ... | [
{
"submission_id": "aoj_2741_10946046",
"code_snippet": "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define RE... |
aoj_2737_cpp | Optimal Tournament
In 21XX, an annual programming contest "Japan Algorithmist GrandPrix (JAG)" has been one of the most popular mind sport events. You, the chairperson of JAG, are preparing this year's JAG competition.
JAG is conducted as a knockout tournament. This year, $N$ contestants will compete in JAG. A tourname... | [
{
"submission_id": "aoj_2737_10867807",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int MAXN = 1005;\nconst int INF = 1e9;\nint n, K;\nint s[MAXN];\nint f[MAXN][MAXN][55], g[MAXN][MAXN][55];\n\nint main() {\n scanf(\"%d %d\", &n, &K);\n for (int i = 1; i <= n; i++)\n ... |
aoj_2742_cpp | E - 選挙活動
Problem Statement
あなたは次回の選挙の候補者であるX氏の支援者である．
X氏は駅前での街頭演説を予定しており，できるだけ多くの有権者に見てもらえる場所で演説しようと考えている．
駅前は $N$ 個の障害物と $M$ 人の有権者が存在している二次元平面として与えられる．
各障害物は多角形であらわされ，その多角形の内側の領域が障害物となる．多角形の辺上は障害物に含まれない．
また，有権者は平面上の点としてあらわされる．
ある有権者の位置とX氏の位置を結ぶ線分上に障害物が存在しないとき，その有権者はX氏を見ることができる．
あなたの仕事は，駅前の障害物と有権者の情報をもとに，もっとも多くの有権者に見ても... | [
{
"submission_id": "aoj_2742_10851262",
"code_snippet": "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define RE... |
aoj_2750_cpp | 百人一首
百人一首は日本の伝統的なゲームである． このゲームでは
N
枚のカードが用いられ，それぞれのカードには1つの文字列が書かれている．細かいルールは省略するが， A君は
N
枚のカードに書かれている文字列を何らかの順序でそれぞれちょうど1回ずつ読むことになった．
百人一首ではその接頭辞が非常に重要である．百人一首で使用される文字列として接頭辞は似ている言葉が多く， 連続して似たような文字列を読むとA君も混乱してしまう． そこでA君は，連続する二つのカードの文字列の接頭辞ができるだけ異なるように，カードを並べ替えようと考えた．
A君の目標は，「山札の読みやすさ」と呼ばれる指標を最小化するような山札を求めることである．ここで山札と... | [
{
"submission_id": "aoj_2750_7136839",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;\n while(cin >> n && n!=0){\n vector<string> s(n);\n for(int i=0;i<n;i++)cin >> s[i];\n sort(s.begin(),s.end());\n vector<int> lcp(n-1);\n for(i... |
aoj_2743_cpp | F - 土地相続
Problem Statement
ある $N$ 人の兄弟は親の遺産相続の話し合いをしていた．
彼らの親の残した莫大な遺産の中には広大な土地も含まれていた．
その土地は南北に $H$ km, 東西に $W$ km に広がる長方形の形をしている．
この土地は 1 km 四方の区画単位で管理されており，
土地の北端から $i$ 〜 $i+1$ km かつ西端から $j$ 〜 $j+1$ km の範囲にある 1 km 四方の区画を区画 $(i, j)$ と呼ぶ．
（$i$, $j$ は $0 \leq i < H$, $0 \leq j < W$ を満たす整数である．）
土地の価格は区画ごとに決まっており，区画 $(i,... | [
{
"submission_id": "aoj_2743_10493832",
"code_snippet": "// AOJ 2743 Land Inheritance\n// 2025.5.16\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int... |
aoj_2744_cpp | G - リングと紐
Problem Statement
芸術家のみさわさんは新しい作品を作ろうとしている．
新しい作品の材料として，みさわさんは金属の輪と白黒2色の紐を大量に用意した．
みさわさんは，異なる 2 つの輪をいずれかの色の紐で結ぶことを繰り返すことによって作品を作ることが出来る．
1 つの輪を複数の輪と繋ぐことも可能であるが，それぞれの輪のペアを結ぶ紐は高々 1 本である．
みさわさんは，せっかく作品を作るからにはよい作品を作りたいと考えた．
みさわさんの考える「よい作品」とは，以下のように定義されるものである．
1 つの輪は 1 つのよい作品である．
2 つのよい作品を用意したとき，それらに含まれている紐で繋がれていな... | [
{
"submission_id": "aoj_2744_9731980",
"code_snippet": "#line 1 \"library/Template/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(),... |
aoj_2757_cpp | F : 卵 / Eggs
問題文
1
か月前のことである． 小学生の肉西君は夏休みの宿題をやっていなかった． そこで自由研究は家にあった卵の強度を調べることにした．
この研究において，卵を高さ
H
から落としても割れず， 高さ
H+1
から落とすと割れるとき， その卵の強度は
H
であると定義する． ここで
H
は非負整数であり，非負整数以外の高さから落とすことは無いとする． 肉西くんは卵を
1
つ落下させる実験を行う． 実験の結果は割れるか割れないかのいずれかである． また，卵の強度は全て同じである．つまり，どの卵を用いても実験の結果は同じである．
肉西くんは高さ
1
から
N
までの整数の高さの段からなる階段と， 強度が不明な
... | [
{
"submission_id": "aoj_2757_3355114",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nlong long Q, dp[60][200009], A[2000009];\n\nvoid init() {\n\tfor (int i = 1; i <= 2000000; i++) {\n\t\tlong long V1 = A[i - 1] + 1;\n\t\tlong long V2 = 1LL * i * (i - 1) / 2LL + 1;\n\t\... |
aoj_2748_cpp | 夏合宿の朝は早い
JAG夏合宿の朝は早い．
正確にはそこまで早くないが，早いと感じる参加者が多いという．
例年合宿の会場となる施設では，退去時に参加者がシーツの回収や掃除をしなければならない．
1 つの部屋でも退去が遅れると，来年以降の施設の利用に関わるため，参加者は一人たりとも寝坊してはならない．
そうは言っても皆人間，寝坊することもある．
しかし，起きた人が連絡先を知っている人にモーニングコールをすることで，一人も寝坊しないよう努めることができるはずだ．
JAG夏合宿の運営を任されたあなたは，寝坊を絶対に防ぐ手を打つための前準備として，どのくらいの確率で全員がきちんと起きられるのかを調べることにした．
準備としてまず，各参加者の... | [
{
"submission_id": "aoj_2748_10648019",
"code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n// #ifndef ONLINE_JUDGE\n// #define _GLIBCXX_DEBUG // 配列外参照のエラー\n// #endif\n\n// スタンダードライブラリ\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型関... |
aoj_2747_cpp | カーテン
もうすぐ夏がやってくる．あなたは夏に向けて部屋の模様替えをすることにした．今年の夏はとても日差しが強いことが予想されており，まぶしいのが苦手なあなたには辛い季節になりそうだ．そこで，あなたは部屋の明るさを調節するために，部屋の窓にカーテンを取り付けようと考えた．
取り付けるカーテンは長方形であり，辺が地面に対して垂直，もしくは平行であるように取り付ける．また，あなたの部屋の窓は非常に特殊な形をしており，各辺が地面に平行または垂直であるような
N
角形で表される．そのため，カーテンを取り付けたときにカーテンに覆われていない窓の面積がどのくらいになるのかを求めるのは難しい．部屋の明るさを調節するためにも，カーテンを取り付ける位... | [
{
"submission_id": "aoj_2747_10683663",
"code_snippet": "#include <bits/stdc++.h>\n#include <unordered_map>\n#include <stdlib.h>\nusing namespace std;\n#define rep(i, a, n) for(ll i = a; i < n; i++)\n#define rrep(i, a, n) for(ll i = a; i >= n; i--)\n#define ll long long\n#define pii pair<int, int>\n#define ... |
aoj_2749_cpp | ぼくのかんがえたさいきょうのおふとん
あなたは新生活に備え，おふとんを
N
枚買った．
i
番目のおふとんは
s
i
のぬくもり供給力をもつ．
これから
M
日間の気温の予測から，
j
日目には
d
j
のぬくもり需要が予想される．
ぬくもりが足りなくても多すぎても快適さが損なわれるので，
j
日目に掛けているおふとんのぬくもり供給力の総和と
d
j
の差の絶対値を
j
日目の不快度と呼ぶことにする．
この
M
日分の不快度の合計ができるだけ少なくなるようにしたい．
ところで，あなたの部屋は残念ながらとても狭く，ベッドと押入れしかない．
そのため，ベッドにおふとんを 1 枚増やすには，そのとき押入れの一番上にあるおふとんをベッドの一... | [
{
"submission_id": "aoj_2749_10848993",
"code_snippet": "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define RE... |
aoj_2751_cpp | 野球観戦
先日，あなたの競技プログラミング仲間であるOさんは野球観戦に出かけた．
観戦した試合は，チームXとチームYの合計 4 試合の対戦だったが，一方的な展開となり，全試合でチームXが勝利した．
しかも，4 試合を通じたXの合計得点は 33 点だったのに対し，Yの合計得点はたったの 4 点だった．
あまりに一方的な内容のため，試合内容への興味が薄れてしまったOさんは，試合を観戦している間も競技プログラミングの作問ネタをついつい考えてしまっていた．
その甲斐もあって，Oさんは以下のような問題を思いついた．
野球チームXとYが対戦し，Xが勝った試合数，Yが勝った試合数，引き分けの試合数がそれぞれ
A, B, C
試合だったとする．
ま... | [
{
"submission_id": "aoj_2751_10855496",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nll mod = 1000000007;\n\nll kai[3000010];\nll inv_kai[3000010];\n\nll beki(ll x, ll a)\n{\n\tif(x==0) return 0;\n\tif(a==0) return 1;\n\tif(a==1) return x;\n\tll tmp=beki(x, a/2... |
aoj_2754_cpp | C : 壺 / Pots
問題文
ここに
N
個の不思議な形の壺がある．
i
番目の壺は
K_i
個の直円柱を下から順に鉛直に繋げた形状である． 繋がっている順番は変えることができない． A 氏は体積
M
の水を持っている． この水をそれぞれの壺に好きな量ずつに分けて注ぐ． 水が全く入っていない壺が存在しても構わない． また，全ての壺が水で満たされたとき，それ以上水を注ぐ事はできない．それぞれの壺の水面の高さの総和の最大値を求めよ．
入力
N \ M
K_1 \ S_{11} \ H_{11} \ … \ S_{1 K_1} \ H_{1 K_1}
K_2 \ S_{21} \ H_{21} \ … \ S_{2 K_2} \ H_... | [
{
"submission_id": "aoj_2754_10850464",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,s,t )for(int i = s; i <t ; i++)\nusing LL = long long; using ll = LL;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing PII = pair<int, int>; using pii = PII;\n#define SZ(a) (int)a.size... |
aoj_2761_cpp | D: みゃんぱすーれつ - Myampus Sequence -
物語
みゃんぱすー．
ウチ，田舎の分校に通う小学一年生なん．
あんなー，今日の授業はプログラミングだったん．
みんな苦戦してたけど，まっつんのにぃにぃ，凄い勢いでタイピングしてたん．
さすが中三なんなー．
にぃにぃ，プログラムが完成してどこか行ってしまったん．
そんで，画面見たら，色んな数列が出力されてたん．
だんだん出力と同じような数列を書きたくなったん，ウチ，出力テキストに同じような数列をいくつも書き加えてたん．
そしたら，にぃにぃが戻ってきて，すごい怒られたん．
ウチ，にぃにぃの声初めて聞いたから，びっくりしたん．
でな，にぃにぃに謝ってプログラムを見せてもらっ... | [
{
"submission_id": "aoj_2761_3000665",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint N, M;\nint x[110], a[15], b[15], c[15];\nint dp[15][110][110];\n\nint solve(int idx, int l, int r) {\n assert(r - l > 0);\n\n int val = dp[idx][l][r];\n if(val >= 0) return val;\n\n val = 0;\n ... |
aoj_2756_cpp | E : 台風 / Typhoon
問題文
南北方向に
H
，東西方向に
W
の大きさの町がある． 町には一辺の長さが
1
の正方形の区画に隙間なく整備されており，全ての区画に
1
軒ずつ家が建っている．
この町のある区画の上空で台風が発生し，被害を与えた後，ある区画の上空で温帯低気圧に変化した． 変化した後は被害を与えない． 下図のように，台風は高さ
3
, 幅
3
の正方形であり， ★のついたマスを中心と呼ぶことにする．台風は
8
近傍に区画単位で移動する． つまり，台風の中心は辺または頂点を共有する区画(現在の区画を含む)に移るように，全体を伴って移動する． ただし，町の外に台風がはみ出ることはなく，
台風の中心は，下の図の網... | [
{
"submission_id": "aoj_2756_10853236",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,s,t )for(int i = s; i <t ; i++)\nusing LL = long long; using ll = LL;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing PII = pair<int, int>; using pii = PII;\n#define SZ(a) (int)a.size... |
aoj_2765_cpp | A: 秤 / Steelyard
問題文
情太くんは長さ $2L$ の棒を使って下の図のような秤を作った．
棒には等間隔に $2L+1$ 個の穴があけられ，左から順に $-L, -L+1, \cdots, -1, 0, 1, \cdots, L-1, L$ という番号が付けられている．そして $0$ 番の穴の場所を天井から紐で吊るしてある．
情太くんは，秤の穴に $N$ 個のおもりを吊るした．$i$ 番目のおもりを吊るした穴の番号は $x_i$ で，おもりの重さは $w_i$ である．おもりが $1$ つも吊るされない穴や，複数のおもりが吊るされる穴も存在しうる．
情太くんが吊るしたおもりによっては，秤が傾いているかもしれない．姉の... | [
{
"submission_id": "aoj_2765_4968352",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\n\nint main(void){\n long long L,N;\n long long weight=0;\n\n cin >> L >> N;\n for(int i=0;i<N;i++){\n long long x,w;\n cin >> x >> w;\n weight += x*w;\n ... |
aoj_2760_cpp | C: 買い出し - Shopping -
物語
磯野の姉であるサゾエさんは，『あれ』や『あれ』で遊んでいる磯野と中島のために夕食を作ってあげることにしました．あいにく，冷蔵庫には食材が残り僅かしか無く，サゾエさんは買い出しに行くことにしました．幾つか食材を買おうとしているサゾエさんですが，大変陽気であるため一度に一品のみレジで会計してしまいます．このままでは遊んでいた磯野と中島が買い物を終える前に帰ってきてしまい，夕食を準備することが出来ないかもしれません．そこで，サゾエさんの友人であるあなたは，サゾエさんのためにサゾエさんの買い物にかかる最小の時間を求めてください．
問題
とあるスーパーに
N
個のレジがあり，それぞれ
1
〜
N... | [
{
"submission_id": "aoj_2760_10401979",
"code_snippet": "// AOJ #2760 Shopping\n// 2025.4.21\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, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;... |
aoj_2771_cpp | G: 塗るだけ / Paint
問題文
情太くんと立子さんは，
平面の世界にある庭付きの家に住んでいる．二人は点とみなせ，
庭は $N$ 頂点の単純多角形 (隣り合わないどの $2$ 辺も交差も接触もしない多角形) の形をしている．
ある日，二人は一本の伸び縮みするローラーを手に入れた．
ローラーは線分とみなせ，ローラーが通過した領域に色を塗ることができる．
二人はローラーを使って庭全体に色を塗りたいと思っている．
作業の前に，二人は以下のような準備を上から順に行う．
庭の内部の任意の $1$ 箇所に杭を打つ．
庭の外部のある $1$ 点に集まる．
十分に長い紐を用意し，片方の端を情太くん，もう一方の端を立子さんの体に結ぶ．
情太く... | [
{
"submission_id": "aoj_2771_4964531",
"code_snippet": "#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#in... |
aoj_2764_cpp | G: 旅費支給 - Travel Support -
物語
私，香坂穂乃果16歳！学生アイドルをやっています！！
学生アイドルの良さをみんなに伝えるためのライブをやろうと，たくさんの学生アイドルの人たちを呼んでアキバスタジアムでライブをします．
だけど，遠くから来るライブ参加者もいてとっても電車賃がかかるの．だからu’sのメンバーでバイトをして，ライブ参加者たちに電車賃を渡すことにしたんだ！ただ，バイト代が入るのが遅いから電車賃を渡すのがライブ参加者の出発に間に合わないことがあったり，バイト代が足りなくて電車賃の全額は渡せないことがあるんだ．そんな時は，ライブ参加者に足りない分のお金を事前に用意してもらうのだけど，どのくらい用意して... | [
{
"submission_id": "aoj_2764_10593094",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#include <climits>\n\nusing namespace std;\n\nconst int MAX_N = 100000;\nconst int MAX_D = 20;\ntypedef long long ll;\nconst ll INF = 1LL << 60;\n\nstruct Edge {\n int ... |
aoj_2763_cpp | F: みこみー文字列 - Miko Mi String -
物語
みっこみっこみ〜！みんなのアイドル，田澤みこみこ！今日は〜，みこと一緒に〜，文字列アルゴリズムの練習，しよ☆
みこのとっておきの
キャラ作り
合言葉，「みっこみっこみ〜」は，ローマ字にすると “MikoMikoMi” になるみこ！つまり，
A=
“Mi”,
B=
“Ko” とすると，
ABABA
の形で書けるってことなの！こんな風に，適切に
A
と
B
を決めると
ABABA
の形に分解できる文字列のことを「みこみー文字列」って言うわ！文字列の名前にまでなっちゃうなんて，みこはみんなの人気者みこね！
みんなでみこみー文字列をも〜っと使っていくために，与えられた文字列が... | [
{
"submission_id": "aoj_2763_8469801",
"code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 2763.cc: Miko Mi String\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 1000000;\nconst int P = 4073;\nconst int MOD = 1000000009;\n\n/* typedef */\n\ntempla... |
aoj_2770_cpp | F: リレー / Relay
問題文
湖に浮かぶ $N$ 個の小島からなるビワコという村がある．
ビワコ村には $N-1$ 本の簡単な作りの橋がある．
島には $0$ から $N-1$ まで，橋には $0$ から $N-2$ までの番号が付けられている．
$i$ 番の橋は $i+1$ 番の島と $p_i$ 番の島を直接つなぎ，長さは $w_i$ である．
村人はどの島の間もいくつかの橋を通って相互に移動できるようになっている．
ある村人の提案により，ビワコ村でリレー大会が開催されることとなった．
しかし，ビワコ村には閉路がなくトラックを用意できないため，
現在ある橋を $1$ つだけ掛け替えることによって閉路を作ろうと考えた．
この... | [
{
"submission_id": "aoj_2770_10401948",
"code_snippet": "// AOJ #2770 Relay\n// 2025.4.21\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, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); w... |
aoj_2768_cpp | D: スキャナー / Scanner
問題文
ここに $N$ 枚の紙がある。あなたは $3$ 台のスキャナーを並列に用いることで、
全ての紙をスキャンしたいと考えている。それぞれの紙はスキャンにかかる時間が決まっており、
$i$ 番目の紙をスキャンするのにかかる時間は $T_i$ である。
紙をスキャンする順番は任意であるが、$1$ 台のスキャナーで複数の紙を同時にスキャンすることはできない。
全ての紙のスキャンが終了し、スキャンを行っているスキャナーがなくなるまでにかかる時間を最小化しなさい。
入力
$N$
$T_1$
$T_2$
$T_3$
$\vdots$
$T_N$
制約
$1 \leq N \leq 50$
$1 \leq... | [
{
"submission_id": "aoj_2768_10851361",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define FOR(i,s,t) for(int i = s; i< t ;i++)\n\n#define SZ(x) (int)x.size()\nusing LL = long long; using ll = LL;\nconst int INF = 1e9; const LL LINF = 1e18;\n\n#define MAXT 1005\nll N;\nvector<int> T;\nb... |
aoj_2769_cpp | E: 28
問題文
トランプゲームの大富豪において，ランクが $2$, $8$ のカードは強力です．
そこで，$10$ 進数表記で数字の $2$, $8$ のみからなる整数を
良い整数
と呼ぶことにします．
良い整数を小さいものから列挙すると $2, 8, 22, 28, 82, 88, \cdots$ となります．
$n$ を正の整数とします．$n$ が良い整数の積の形で表現できるとき，
最大でいくつの積になるか求めてください．できないなら $-1$ と出力してください．
入力
$n$
制約
$1 \leq n \leq 10^{18}$
出力
答えを $1$ 行で出力してください．
サンプル
サンプル入力1
1
サンプル出力1
... | [
{
"submission_id": "aoj_2769_5972328",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);-... |
aoj_2773_cpp | B: 周期数列 - Periodic Sequence -
問題
H大学の教授を務めているPeriod博士は、万物に潜むとされる周期と呼ばれる性質を研究している。一般的に知られている基本的な周期としては、数列に潜む周期が考えられるだろう。すなわち、長さ
N
の数列
S = S_1, S_2,
...
, S_N
が以下の性質を満たすならば、周期
t
(
t \≤ N
) を持つという事実である。
1 \≤ i \≤ N − t
について、
S_i=S_{i+t}
である。
今、Period博士が着目しているのは、周期を用いてより簡易な記述ができる数列である。例えば、長さ
N
の数列が周期
t
(
\≤ N
) を持つとき、ある整数
... | [
{
"submission_id": "aoj_2773_10865813",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst ll LINF = 1e18;\ncon... |
aoj_2774_cpp | C: 成長する点 - Growing Point -
問題
粘菌コンピュータというものがある。
ある種の粘菌には「餌を求め、餌と餌の最短距離をつなぐ形に変形する」
という性質がある。
これを利用し、餌を「入力」、形を「出力」とみなして
コンピュータとして利用することができる。
今、二次元平面上に1つの粘菌の拠点と
N
個の餌が存在する。それぞれの餌には
1
から
N
までの異なる番号が与えられ、拠点には番号0が与えられている。
この粘菌はある餌を食べるために、その餌と最も近い拠点の最短距離を結ぶ管状に
成長し、食べた位置に新たに拠点を形成する。
新たに形成した拠点は拠点を形成する直前に食べた餌と同じ番号を持つ。
粘菌は拠点以外の場所... | [
{
"submission_id": "aoj_2774_10858226",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst ll LINF = 1e18;\ncon... |
aoj_2775_cpp | D: Complex Oracle - Complex Oracle -
問題
※この問題はリアクティブ問題です．すなわち，サーバー側に用意されたプログラムと対話的に応答することで正答を導くプログラムを作成する必要があります．
また、サーバー側のプログラムも計算機資源を共有する関係上、サーバーだけで最大 3 sec程度の実行時間、最大 300 MB程度のメモリを使用する場合がありますので、TLE・MLEにお気をつけください。
あいずにゃんは若ヶ松高校のプログラミングコンテスト部、通称ぷろこん部に所属する2年生である。見目麗しい。あいずにゃんはその小さな体も無限に存在するチャームポイントの1つであるが、本人はコンプレックスを感じている... | [
{
"submission_id": "aoj_2775_10850453",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\n#define FOR(i,s,t) for(int... |
aoj_2776_cpp | E: Arai's - Arai's -
問題
スクールアイドル時代から、国民的人気を誇ってきた女性アイドルグループArai's。今では、たくさんの「あらい」さんが所属する大規模なグループとして、世界レベルで活躍している。そして今日、新たなるプロジェクトの始動が決定した。彼女たちは、小さなユニットをいくつか結成することで、さらなる売上の向上を試みることになったのである。
Arai'sには「荒井」さんが
A
人，「新井」さんが
B
人在籍しており、合計で
A+B
人の「あらい」さんからなる。新ユニットは、「荒井」さん一人と「新井」さん一人のペアで構成する。（ここで、同じ「あらい」さんが複数のユニットに所属していはいけない。）ただし、あ... | [
{
"submission_id": "aoj_2776_10851385",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst ll LINF = 1e18;\ncon... |
aoj_2777_cpp | F: きっちり - Kitsuchiri -
問題
若ヶ松高校二年へ組の合津千里（あつちり）さんは数列が「きっちり」していなければ気がすまない。
合津さんによると、「きっちり」した数列とは、長さが偶数で左右対称である数列のことである。
すなわち、長さ
N
(
N
は偶数)の数列
S
について、次の条件を満たせば数列
S
は「きっちり」している。
S_1 = S_N, S_2 = S_{N − 1},
...
, S_{N/2} = S_{N − N/2 + 1}
二年へ組の数学担当の先生は、合津さんから「きっちりしてください。」と要望され、授業で用いる数列を作り直さなければならない。
先生は、数列の
l
番目から
r
番目までのそれ... | [
{
"submission_id": "aoj_2777_10850964",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst ll LINF = 1e18;\ncon... |
aoj_2779_cpp | H: われわれの努力について - About Our Effort -
問題
※この問題はおまけの問題と捉えていただけるとありがたく、
できれば先に他の問題のほうをお楽しみいただければと思っておりまして，ですので他の問題を通し終えて暇になり，かつその暇を
このコンテストで潰そうという気になってくれた方に挑戦していただければと思います。
D問題のクエリが遅くてすみませんでした。
しかし我々といたしましても決してただ怠慢をしていたわけではないのです。
私たちなりに努力したのです。
その努力の片鱗を味わっていただくため、このような問題を出題した次第であります。
問題: D問題のサーバー側の処理をするプログラムを作成せよ。
なおこの問題は本... | [
{
"submission_id": "aoj_2779_4926964",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\n#define SIZE 200000\n#define SQ 300\n#define LLINF 100000000000000\n\nstruct BIT {\n vector<int> data;\n\n BIT(int n): data(n + 2, 0) {};\n\n void add(int k, int x) {\n k+... |
aoj_2778_cpp | G: 運命力 - Destiny Draw -
問題
Mr. D はカードゲームで勝負をすることになった。
このカードゲームでは、
N
枚のカードの山を用いる。
また、山のカードには、上から順に
1, 2, 3,
...
, N
の番号がついている。
D で始まるものすべてを背負う彼に敗北は許されないが、不幸にも Mr. D はカードゲームが不得手である。
そこで、自分が引くカードをコントロールすることで勝利を手にすることにした。
Mr. D は
K
種類のシャッフルが可能である。
K
種類のうち
i
番目のシャッフルでは上から
a_i
枚目から
a_i+b_i − 1
枚目までのちょうど
b_i
枚を引き抜き、上に重ねる。
i
番... | [
{
"submission_id": "aoj_2778_10259979",
"code_snippet": "// AOJ #2778 Destiny Draw\n// 2025.3.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD = 1000000007;\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int n, K, C, T;\n cin >> n >> K >> C >> T;\n vector<... |
aoj_2780_cpp | Best Matched Pair
You are working for a worldwide game company as an engineer in Tokyo. This company holds an annual event for all the staff members of the company every summer. This year's event will take place in Tokyo. You will participate in the event on the side of the organizing staff. And you have been assigned ... | [
{
"submission_id": "aoj_2780_10295740",
"code_snippet": "// AOJ #2780 Best Matched Pair\n// 2025.3.14\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\tdo n = ... |
aoj_2782_cpp | We don't wanna work!
ACM is an organization of programming contests. The purpose of ACM does not matter to you. The only important thing is that workstyles of ACM members are polarized: each member is either a workhorse or an idle fellow.
Each member of ACM has a motivation level. The members are ranked by their motiva... | [
{
"submission_id": "aoj_2782_10851164",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define D(x) cout << #x \" = \" << (x) << endl\n#define un(x) x.erase(unique(x.begin(), x.end()), x.end())\n#define sf(n) scanf(\"%d\", &n)\n#define sff(a,b) scanf(\"%d %d\", &a, &b)... |
aoj_2781_cpp | Help the Princess!
The people of a certain kingdom make a revolution against the bad government of the princess. The revolutionary army invaded the royal palace in which the princess lives. The soldiers of the army are exploring the palace to catch the princess. Your job is writing a program to decide that the princess... | [
{
"submission_id": "aoj_2781_10730387",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint n, m;\nint x, y;\nchar str[210][210];\nchar tmp[210][210];\nint dirx[] = {1, -1, 0, 0};\nint diry[] = {0, 0, 1, -1};\nint val (int a, int b) {\n if (a<0 || b<0 || a>=n || b>=m) return 0;\n retu... |
aoj_2783_cpp | Parentheses
Dave loves strings consisting only of '(' and ')'. Especially, he is interested in balanced strings. Any balanced strings can be constructed using the following rules:
A string "()" is balanced.
Concatenation of two balanced strings are balanced.
If $T$ is a balanced string, concatenation of '(', $T$, and '... | [
{
"submission_id": "aoj_2783_4919488",
"code_snippet": "#include <random>\n#include \"bits/stdc++.h\"\n//#include <atcoder/all>\n\nusing namespace std;\n// using namespace atcoder;\n\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\nconstexpr ld eps = 1e-12;\nconstexpr int inf = nu... |
aoj_2784_cpp | Similarity of Subtrees
Define the depth of a node in a rooted tree by applying the following rules recursively:
The depth of a root node is 0.
The depths of child nodes whose parents are with depth $d$ are $d + 1$.
Let $S(T, d)$ be the number of nodes of $T$ with depth $d$. Two rooted trees $T$ and $T'$ are similar if ... | [
{
"submission_id": "aoj_2784_10946041",
"code_snippet": "#include <bits/stdtr1c++.h>\n\n#define MAX 100100\n#define clr(ar) memset(ar, 0, sizeof(ar))\n#define read() freopen(\"lol.txt\", \"r\", stdin)\n#define dbg(x) cout << #x << \" = \" << x << endl\n\nusing namespace std;\n\nconst unsigned long long base... |
aoj_2786_cpp | Share the Ruins Preservation
Two organizations International Community for Preservation of Constructions (ICPC) and Japanese Archaeologist Group (JAG) engage in ruins preservation. Recently, many ruins were found in a certain zone. The two organizations decided to share the preservation of the ruins by assigning some o... | [
{
"submission_id": "aoj_2786_10850971",
"code_snippet": "#include<bits/stdc++.h>\n\n#define PB push_back\n#define MP make_pair\n#define F first\n#define S second\n\n#define FRI freopen(\"zin.txt\",\"r\",stdin)\n#define FRO freopen(\"out.txt\",\"w\",stdout)\n#define DB(x) #x\" =>\",x\n#define debug(args...) ... |
aoj_2785_cpp | Escape from the Hell
One day, Buddha looked into the hell and found an office worker. He did evil, such as enforcing hard work on his subordinates. However, he made only one good in his life. He refused an unreasonable request from his customer to save the lives of his subordinates. Buddha thought that, as the reward o... | [
{
"submission_id": "aoj_2785_10946038",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define si(a) scanf(\"%d\",&a)\n#define f first\n#define s second\n#define mp(a,b) make_pair(a,b)\n#define MAX 100005\n#define INF 1LL<<50\ntypedef pair <int, int> Pii;\n\nstruct Less {\n bool ope... |
aoj_2787_cpp | Pipe Fitter and the Fierce Dogs
You, a proud pipe fitter of ICPC (International Community for Pipe Connection), undertake a new task. The area in which you will take charge of piping work is a rectangular shape with $W$ blocks from west to east and $H$ blocks from north to south. We refer to the block at the $i$-th fro... | [
{
"submission_id": "aoj_2787_10851470",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <cassert>\nusing namespace std;\n#define rep(i,a,n) for (int i=a;i<n;i++)\n#define per(i,a,n)... |
aoj_2796_cpp | F: 紙の折りたたみ / Folding Paper
問題文
高さ $H$ マス、幅 $W$ マスの格子状に区切られた長方形の紙がある。
$0$ から数えて上から $i$ 行目、左から $j$ 列目のマスには整数 $i \times W+j$ が書かれている。 $H=2, W=3$ の例を下の図に示す。
AOR イカちゃんは、この紙に対して次のような操作を順に行った。
$1$ マス分の面積になるまでマスの区切り線に沿って繰り返し折る。この時の折る線や山谷、順番などは任意である。紙を破らない任意の折り方ができる。
$4$ 辺を切り落として $H \times W$ 枚の紙に分割する。
上から順にめくっていき、書かれていた整数を並べた数... | [
{
"submission_id": "aoj_2796_4958013",
"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_2792_cpp | B: イカったー / SNS
問題文
AOR イカちゃんは最近少し機嫌が悪い。
どうやら、”イカったー”のフォロー数とフォロワー数の比が気に入らないようだ
。現在、AOR イカちゃんのフォロー数は $A$ 人、フォロワー数は $B$ 人であり、比は $A:B$ である。
そこで、AOR イカちゃんはフォロー数とフォロワー数の比が気に入った整数比になるように、
フォロー数
を増減させることにした。
なお気に入った整数比とは、比に含まれるどちらの値も $1$ 以上 $N$ 以下の整数となるように表せる比である。
しかし、AOR イカちゃんはできるだけフォロー数を変更したくないので、変更前との差の絶対値をできるだけ小さくしたい。
AOR ... | [
{
"submission_id": "aoj_2792_2000870",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long cl(long long a,long long b,long long n){\n long long na=a+(b-a%b);\n if(na/b>n){\n na=n*b;\n return abs(a-na);\n }else{\n long long na2=a-a%b;\n if(na2==0) return abs(a-na);\n ... |
aoj_2788_cpp | Multisect
We are developing the world's coolest AI robot product. After the long struggle, we finally managed to send our product at revision $R_{RC}$ to QA team as a release candidate. However, they reported that some tests failed! Because we were too lazy to set up a continuous integration system, we have no idea whe... | [
{
"submission_id": "aoj_2788_10853223",
"code_snippet": "#include <bits/stdc++.h>\n//#include <ext/pb_ds/assoc_container.hpp>\n//#include <ext/pb_ds/tree_policy.hpp>\nusing namespace std;\n//using namespace __gnu_pbds; //new version c++\n//using namespace pb_ds;\n\n#define PB push_back\n#define MP make_pair... |
aoj_2797_cpp | G: DAG トリオ / DAG Trio
この問題は D: DAG Trio (Easy) と制約のみが異なる同じ設定の問題です。
プロローグ
弟は最近「だぐとりお」が欲しいとしきりに呟いています。
心配になった兄が調べたところ、弟のクラスでは $k$-DAG (有向グラフであって、ある $k$ 個の辺を削除すると、辺の向きを無視したときの連結成分数を $k$ にでき、かつそれら全てが DAG である) が流行っており、
3-DAG を特に DAG トリオと呼ぶことを突き止めました。
弟に尊敬されたい兄は、与えられたグラフが DAG トリオかどうかを判別するプログラムを作成することにしました。
問題文
$N$ 頂点 $M$ 辺の有... | [
{
"submission_id": "aoj_2797_2238723",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_N 500\n#define MAX_M 50000\nstruct edge{ int from,to,id; };\n\nint N,M;\nint a[MAX_M],b[MAX_M];\n\nvector<edge> G[MAX_N];\n\nbool visited[MAX_N];\nint depth[MAX_N];\nint cnt[MAX_N];\nint par[MA... |
aoj_2794_cpp | D: DAG トリオ / DAG Trio
この問題は G: DAG Trio (Hard) と制約のみが異なる同じ設定の問題です。
プロローグ
弟は最近「だぐとりお」が欲しいとしきりに呟いています。
心配になった兄が調べたところ、弟のクラスでは $k$-DAG (有向グラフであって、ある $k$ 個の辺を削除すると、辺の向きを無視したときの連結成分数を $k$ にでき、かつそれら全てが DAG である) が流行っており、
3-DAG を特に DAG トリオと呼ぶことを突き止めました。
弟に尊敬されたい兄は、与えられたグラフが DAG トリオかどうかを判別するプログラムを作成することにしました。
問題文
$N$ 頂点 $M$ 辺の有... | [
{
"submission_id": "aoj_2794_2503049",
"code_snippet": "#include <bits/stdc++.h>\n#define int long long\n#define N 1000\n#define V_MAX 1000\nusing namespace std;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntemplate<class T> T Max(T &a,T ... |
aoj_2789_cpp | Compressed Formula
You are given a simple, but long formula in a compressed format. A compressed formula is a sequence of $N$ pairs of an integer $r_i$ and a string $s_i$, which consists only of digits ('0'-'9'), '+', '-', and '*'. To restore the original formula from a compressed formula, first we generate strings obt... | [
{
"submission_id": "aoj_2789_10865828",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B>\nbool chmax(A &a, B b) { return a < b ... |
aoj_2795_cpp | E: 札 / Fuda
この問題はリアクティブ問題です。
サーバー側に用意されたプログラムと対話的に応答することで正答を導くプログラムを作成する必要があります。
問題文
湖に浮かぶ $N$ 個の小島からなるビワコという村がある。
各小島には $0$ から $N-1$ まで番号が振られている。
村には島と島の間に架かる橋が $M$ 本あり、$0$ から $M-1$ まで番号が振られている。
橋は双方向に移動可能である。
ここで言う橋とは単に島と島の間の通り道ということであり、取り除くと互いに到達不可能な島の組が増える意味ではない。
最近、橋の両端に掲示板を設置し、その橋を渡った先の島から橋を $1$ 本だけ使って移動できる島 (今いる... | [
{
"submission_id": "aoj_2795_2258530",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x... |
aoj_2790_cpp | Non-redundant Drive
The people of JAG kingdom hate redundancy. For example, the N cities in JAG kingdom are connected with just $N - 1$ bidirectional roads such that any city is reachable from any city through some roads. Under the condition, the number of paths from a city to another city is exactly one for all pairs ... | [
{
"submission_id": "aoj_2790_10907762",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i,n) for(ll i=0; i<ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B> void chmax(A& l, const B& r){ if(l < r) ... |
aoj_2800_cpp | C : Mod!Mod!
物語
じゃん！探してますよ目撃証言！
会津に怪盗が現れた！みんなのウマウマ棒が盗まれた！犯人は誰だ！？
解きあかせ！Mod!Mod!
問題文
"アイズ"...それは選ばれし者の心に膨らむ奇跡のつぼみ...。特殊能力"アイズ"を使えばどんなものだって盗むことができる。
会津一の大怪盗、あいずまるは世界を謎で満たすために
n
人の探偵から「ウマウマ棒」を盗むことにした。ウマウマ棒とはあいずまるが大好きなただのお菓子であり、
n
人の探偵はそれぞれ数本のウマウマ棒を持っている。また、あいずまるは強欲なためそれぞれの探偵からウマウマ棒を盗むとき、その探偵が所持する全てのウマウマ棒を盗む。
ウマウマ棒の3本同時食いに... | [
{
"submission_id": "aoj_2800_8322213",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nlong long N;\nlong long A[1 << 19];\nlong long C[3];\n\nint main() {\n\t// Step 1. Input\n\tcin >> N;\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\tfor (int i = 1; i <= N; i++) C[A[i] % 3] += 1;\n\n\t// St... |
aoj_2801_cpp | D: 日焼け - Suntan -
物語
あいずにゃんは若ヶ松高校のプログラミングコンテスト部、通称ぷろこん部に所属する2年生である。天使のようにかわいい。
あいずにゃんは今年の夏フェスに参加する予定なので、聴きに行くバンドのスケジュールを立てた。
ここで心配なのが日焼けだ。
ライブはすべて野外で行われるが、あいずにゃんは日焼けしやすい体質なので長時間野外で紫外線を浴びすぎるとすぐ日焼けしてしまう。
ライブがない間は屋内に避難することでできるだけ紫外線を回避するつもりだが、ライブ中はどうしても日に当たってしまう。
そこであいずにゃんは日焼け止めを塗ることで紫外線対策をすることを考えた。
問題
日焼け止めを塗ると、塗った時間から
T
... | [
{
"submission_id": "aoj_2801_10570469",
"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\nbool chmin(auto &a, auto b){ return a > b ? a = b, 1 : 0; }\nbool chmax(auto &a, auto... |
aoj_2806_cpp | B: 重さの範囲
問題
重さの異なる $N$ 色のボールがキューにたくさん入っています。キューには、先頭から
$1,2,3, \dots ,N-1,N,1,2,3, \dots ,N-1,N,1,2,3, \dots$ というふうに昇順にボールが並んでいて、
色 $N$ のボールの後ろにはまた色 $1$ のボールから順に入っています。
同じ色のボールはそれぞれ同じ重さであり、色 $i$ のボールの重さは $A_i$ です。
この状態から、キューの先頭からボールを $M$ 個取り出し、これを 1 つのグループとする作業を繰り返します。
そして、キューから取り出した各色のボールの総数がすべて等しくなったときにグループを作る作業をやめます... | [
{
"submission_id": "aoj_2806_3448657",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\n#define inRange(x,a,b) (a <= x && x < b)\n\nint main(){\n int n, m;\n cin >> n >> m;\n int a[n];\n for(int i = 0; i < n; i++) cin >> a[i];\n priority_queue<pair<int,int>> l, r;\... |
aoj_2807_cpp | C: Fractal Tree
問題
AORイカちゃんは、フラクタルな(自己相似的な)構造を持つ根付き木が好きである。
$N$ 頂点から成る重み付き根付き木 $T$ を用いて、以下のようなフラクタル構造を持つ根付き木 $T'$ を表現することを考える。
$T'$ は、$T$ の各頂点 $x$ に対して、$x$ を根として $T$ と同様の木構造 (コストも同じ) を持つ木を付け加えたものである。
$T'$の根は $T$ のものと同じものである。
こうして表現される木は例えば下図のようになる。
AOR イカちゃんは、$T'$ に対して深さ優先探索をしようとしているが、全ての頂点を辿ると時間がとてもかかることに気づいた。
そこで、深さ優... | [
{
"submission_id": "aoj_2807_9117947",
"code_snippet": "#include <bits/stdc++.h>\n#include <vector>\nusing namespace std;\nint inf=100000000;\nusing ll=long long;\nusing pint=pair<int,int>;\nusing pll=pair<ll,ll>;\nusing pque_int=priority_queue<int>;\n#define rep(i,n) for (int i=0; i < (int) n; i++)\n#defin... |
aoj_2804_cpp | G: 最小包含矩形 - Minimum Enclosing Rectangle -
物語
みんなぁ、こんにちは！ 八森中ぷろこん部の藍座あいりだよぉ。
突然だけど、あいりがこの前解けなかった問題をみんなに解いて欲しいんだぁ～。
この前部活で
ICPC2010のA問題
を解いたんだけど、その時の問題が難しかったんだぁ。
あ、ICPCについて説明しなきゃ！ ICPCは、い、いんたーなしょなる……ちゅうがくせい……ぷろぐらみんぐ……こんてすとの略で、日本語に直すと、国際中学生対抗プログラミングコンテストらしいよぉ！ あいりにはちょっとむずかしい言葉がいっぱいだよぉ。
あいり達はこの世界大会に出るために毎日頑張ってるんだぁ！
部活から帰った... | [
{
"submission_id": "aoj_2804_8322784",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct Point {\n\tlong long px, py;\n};\n\nPoint operator-(const Point& a1, const Point& a2) {\n\treturn Point{ a1.px - a2.px, a1.py - a2.py };\n}\n... |
aoj_2808_cpp | D: パスワード
問題
AOR イカちゃんは英小文字のみからなる強力なパスワードを作りたいと思っています。
友達から $N$ 個の危険なパスワードの例を教えてもらった AOR イカちゃんは、
以下の条件を全て満たすようなパスワードを作ることにしました。
長さは1文字以上である。
どの危険なパスワードの、どの連続した部分文字列とも異なる。
1, 2 の条件を満たした中で、最も短い文字列である。
1,2,3の条件を満たした中で、辞書順に並べたとき先頭に来る文字列である。
AOR イカちゃんに代わって強力なパスワードを生成するプログラムを書いてください。
入力
入力は以下の形式で標準入力から与えられる。
$N$
$S_1$
$\vdots... | [
{
"submission_id": "aoj_2808_10853905",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef unsigned long long ull;\n\nstruct RollingHash\n{\n\tvector<ull> hash, pow;\n\tRollingHash(string s, ull _b = 1000000007)\n\t{\n\t\t_b = _b;\n\t\tint sz = s.length();\n\t\thash.assign(sz + 1, 0)... |
aoj_2810_cpp | F: カードゲーム
問題
カードを使ったゲームを $Q$ 回行います。
カードには $1 \cdots N$ の数が書かれており、各数が書かれたカードはゲームを行うのに十分な枚数があります。
$i$ 回目のゲームでは、はじめに手札として 2 枚のカードが配られます。
それぞれのカードに書かれている数字は $x_i$ と $y_i$ です。
カードはルールに従って交換することができます。
$j$ 番目 $(1 \le j \le M)$ のルールでは、カード $a_j$ を手数料 $c_j$ 円で別のカード $b_j$ に交換することができます。
各ルールは何回でも用いることができます。また、手数料が足りなくて交換できない場合はありま... | [
{
"submission_id": "aoj_2810_10412963",
"code_snippet": "// AOJ #2810 Card Game\n// 2025.4.23\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = (ll)1e18;\n\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_2803_cpp | F: 風呂がオーバーフロー - Overflow of Furo -
物語
温泉宿・パロは自慢の温泉に全ての情熱を注いでおり、風呂のプロフェッショナルを集めている。
風呂のプロたちは主に温泉の配管を管理しており、複数の源泉から1つの大浴場へと繋がる、複雑に入り組んだ配管網を管理・調整している。
配管網の管理・調整業務もなかなかに大変なのだが、風呂のプロたちはその合間を縫って、さらに多くの湯を浴槽へと供給できるよう日々努力を積み重ねていた。
結果、風呂のプロたちは「1本だけ配管をオーバーフローさせることができる」という荒技を習得した。
すなわち、自由に配管1本を選び、その配管の湯量の制限をなくすことができるようになったのだ。
今まで最... | [
{
"submission_id": "aoj_2803_8322658",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n\nstruct Edge {\n\tint to, cap, rev;\n};\n\nclass MaxFlow {\npublic:\n\tvector<Edge> G[109];\n\tint Dist[109];\n\tbool Used[109];\n\n\tvoid add_edge(int u, int v, int c) {\... |
aoj_2802_cpp | E: 鬼畜ババ抜き - Unbalanced Old Maid -
物語
高坂さんと園田さんと南さんは子供の頃からの仲良し3人組だ。3人は沖縄に修学旅行に行くも、台風が来てしまい、海で遊ぶことができないのでババ抜きをすることにした。
園田さんは勝負事には強いが、ポーカーフェイスが苦手なため、自分のカードが引かれるときに無意識にかわいらしい顔芸を披露してしまう。園田さんを愛して止まない高坂さんと南さんは、園田さんの顔芸を見るだけで園田さんの手札が分かってしまうため、園田さんのカードを引くときは、自分が有利になるように引くことができる。
一方、高坂さんと南さんは特に顔芸をしたりはしないので、手札がばれることはない。 よって、高坂さんと南... | [
{
"submission_id": "aoj_2802_8322461",
"code_snippet": "#include <iostream>\n#include <tuple>\n#include <vector>\nusing namespace std;\n\nint N;\nint M[3], P[3][409];\nint Cnt[3][109];\ndouble prevs[109][109][109][3];\ndouble dp[109][109][109][3];\ndouble Answer = 0.0;\n\nint main() {\n\t// Step 1. Input\n\... |
aoj_2809_cpp | E: 卒業式
背景
ある日 Y さんはプログラミングコンテストに参加するため，会場がある大学に向かいました．
ところが大学に着くと人がたくさん！なんと今日は卒業式だったのです．
会場に向かおうにも人に押し流されてしまい，自分の進みたい方向に進むことすらできません．
人混みから抜け出すために，Y さんは今いる場所から少しでも遠くに行きたいと考えました．
そこで Y さんは状況を以下のような問題として定式化し，競技プログラミングを役に立てることにしました．
なお，以下の問題文では Y さんは点 $P$ としてモデル化されています．
問題
座標平面上の原点に点 $P$ が置かれている．
点 $P$ を動かし，できるだけ原点からのマンハッタ... | [
{
"submission_id": "aoj_2809_9117771",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)\n\ntemplate <typename T> bool chmin(T &a, const... |
aoj_2813_cpp | I: Islands Survival
問題
$N$ 頂点 $M$ 辺の単純連結無向グラフがある．
頂点には $1, 2, \dots, N$ と番号がつけられている．
辺には $1, 2, \dots, M$ と番号がつけられており，辺 $i$ は頂点 $a_i$ と $b_i$ をつないでいる．
また，辺 $i$ は時刻 $t_i$ に消える．どの辺も通過するために単位時間がかかる．
あなたは最初，時刻 0 において頂点 1 にいる．
あなたは最適に行動することで，時刻 $T$ までに得られるスコアを最大化したい．
スコアは最初 0 であり，イベントは以下に従って起きる．
今の時刻 $t'$ が $t' \geq T$ を満た... | [
{
"submission_id": "aoj_2813_10413041",
"code_snippet": "// AOJ #2813 Islands Survival\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\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\... |
aoj_2811_cpp | G: 雨降りバス乗り換え
背景
今日は AOR イカちゃんにとって初となるデートの日だ。
AOR イカちゃんは駅からバスを乗り継ぎ、待ち合わせ場所のバス停に向かう予定である。
AOR イカちゃんが駅に着いた時、不幸にも雨が降ってきた。当初予定していた経路ではバスの待ち時間で濡れてしまい、せっかく整えた身だしなみが台無しになってしまう可能性がある。
そこで、バスの待ち時間が最も少なくなるような経路でバス停まで向かうことにした。
AOR イカちゃんは、待ち合わせ場所のバス停に着くまでにどの程度濡れるのか心配している。
問題
AOR イカちゃんは時刻 $0$ に $S$ 番目のバス停におり、そこから $G$ 番目のバス停まで行き... | [
{
"submission_id": "aoj_2811_9752318",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int M = 200001;\nint u[M], v[M], t[M], c[M];\nvector<int> start[M], dest[M], busy_time[M];\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n #ifdef BACKER\n ... |
aoj_2812_cpp | H: ジャンプパーティ
問題
とあるダンスホールで $N$ 人の参加するダンスパーティーが行われる。
そのダンスホールは縦方向に $H$ 個、横方向に $W$ 個のグリッドに分けられており、
左上を $(0,0)$、上から $r$ マス、左から $c$ マス目のグリッドの座標を $(r,c)$ と表す。
$i$ 番目の参加者の初期位置は $(R_i, C_i)$ であり、$(i,j)$ のグリッドには $(r_{ij}, c_{ij})$ が書かれている。
各参加者は、無限に続く音楽に合わせて次のように同時に移動を行う。
その時にいる座標が $(i,j)$ のとき、$(r_{ij}, c_{ij})$ へジャンプで移動する。
それぞ... | [
{
"submission_id": "aoj_2812_10191609",
"code_snippet": "// AOJ #2812\n// Jump Party 2025.2.5\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();\n\t\tdo n = 10*... |
aoj_2817_cpp | B: だんすなうwww - Dance Now! -
物語
前回のラボライフ！ダイガクイン！！
マスターアイドルたちが競う最大の大会「ラボライフ」の前哨戦ともいえるイベント「マスターアイドルワールド」で9位を取ってしまったドサンコスノー。
キレのあるダンスは「9位の舞」、渾身の決めポーズも「9位の構え」などと冷やかされてしまい、心に深い傷を負ってしまう。
来たるラボライフ予備予選では絶対に9位をとるわけにはいかない……
決意を新たにしたドサンコスノーは、自分たちの特技「セルフコントロール」に磨きをかけ、決戦の地へと向かうのだった。
問題
N
組のユニットが競う大会「ラボライフ」が開かれる。
この大会では、スマイル・ピュア・クールの3... | [
{
"submission_id": "aoj_2817_10195234",
"code_snippet": "// AOJ #2817\n// Dance Now! 2025.2.5\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; \n cin >> N;\n \n vector<int> r(N);\n for (int i = 0; i < N; i++) cin >... |
aoj_2814_cpp | J: エナジードリンク
問題
ixmel、Pulmn 兄弟は $N$ 種類のエナジードリンクをそれぞれ 1 本ずつ持っています。
現在、ixmel と Pulmn のエネルギーはともに 0 で、時刻は午前 0 時です。
ixmel と Pulmn はエネルギーが 0 以下のまま正午になると「たいへんなこと」になります。
エネルギーが正の数では「たいへんなこと」にはなりません。
ixmel とPulmn は「たいへんなこと」にならないために、
毎日朝 6 時に 1 本のエナジードリンクを 2 人で分けて飲むことにしました。
i 番目のエナジードリンクを ixmel が飲むとエネルギーが $a_i$ 増えますが、副作用として 24 時間... | [
{
"submission_id": "aoj_2814_9118078",
"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>\nostrea... |
aoj_2815_cpp | K: AOR イカちゃんの成績
問題
AOR イカちゃんは $N$ 回のレポートの点数のみで成績が決まる授業を受けている。
AOR イカちゃんは同じ授業を受けている友達が $M$ 人いて、自分が苦手なテーマのレポートは、そのテーマが得意な友達のレポートを写すことで、その友達と同じ点数を取ることができる。
ただし、他人のレポートを写していることを先生に気付かれてはいけないので、 $N$ 回のうち少なくとも $K$ 回は他人のレポートを写さず、自力でレポートを仕上げなくてはならない。
また、 AOR イカちゃんは友達に迷惑をかけたくないと思ったので友達 $i$ に対してレポートを写すのは $T_i$ 回以下にすることにした。
... | [
{
"submission_id": "aoj_2815_5147669",
"code_snippet": "#line 1 \"test/aizu-online-judge/2815.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/2815\"\n\n#include <iostream>\n\n#line 2 \"src/graph/directed/flow/min_cost_flow.hpp\"\n\n/**\n * @file min_cost_flow.hpp\n * @brief Minimum C... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.